@scenid/react-formulator 2.4.1 → 4.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sources":["../node_modules/fast-deep-equal/index.js","../node_modules/micromustache/dist/micromustache.mjs","../src/store/useStoreSelector.js","../src/context/FormContext.js","../src/context/ReservationContext.js","../src/store/FormStore.js","../src/FormGroupHeader.jsx","../src/FormSectionCard.jsx","../src/FormSectionBlock.jsx","../node_modules/classnames/index.js","../src/Editable/FormField.jsx","../src/Editable/FormDateRange.jsx","../src/Editable/FormText.jsx","../src/helpers.js","../src/Editable/FormNumber.jsx","../src/ReadOnly/FormReadOnlyText.jsx","../src/Components/SelectOrCreate.jsx","../src/Editable/FormAutocomplete/FormAutocomplete.jsx","../src/Editable/FormSelect.jsx","../src/Editable/FormCatalogType.jsx","../src/Editable/FormBoolean.jsx","../src/Editable/FormRepeater/FormRepeaterDefault.jsx","../node_modules/lodash/lodash.js","../src/Editable/FormRepeater/FormRepeaterGrid.jsx","../src/Editable/FormRepeater/FormRepeater.jsx","../src/ReadOnly/FormReadOnlyField.jsx","../node_modules/react-markdown/lib/uri-transformer.js","../node_modules/is-buffer/index.js","../node_modules/unist-util-stringify-position/index.js","../node_modules/vfile-message/index.js","../node_modules/vfile/lib/minpath.browser.js","../node_modules/vfile/lib/minproc.browser.js","../node_modules/vfile/lib/minurl.shared.js","../node_modules/vfile/lib/minurl.browser.js","../node_modules/vfile/lib/index.js","../node_modules/bail/index.js","../node_modules/extend/index.js","../node_modules/is-plain-obj/index.js","../node_modules/trough/index.js","../node_modules/unified/lib/index.js","../node_modules/mdast-util-to-string/index.js","../node_modules/micromark-util-chunked/index.js","../node_modules/micromark-util-combine-extensions/index.js","../node_modules/micromark-util-character/lib/unicode-punctuation-regex.js","../node_modules/micromark-util-character/index.js","../node_modules/micromark-factory-space/index.js","../node_modules/micromark/lib/initialize/content.js","../node_modules/micromark/lib/initialize/document.js","../node_modules/micromark-core-commonmark/node_modules/micromark-util-classify-character/index.js","../node_modules/micromark-util-resolve-all/index.js","../node_modules/micromark-core-commonmark/lib/attention.js","../node_modules/micromark-core-commonmark/lib/autolink.js","../node_modules/micromark-core-commonmark/lib/blank-line.js","../node_modules/micromark-core-commonmark/lib/block-quote.js","../node_modules/micromark-core-commonmark/lib/character-escape.js","../node_modules/decode-named-character-reference/index.dom.js","../node_modules/micromark-core-commonmark/lib/character-reference.js","../node_modules/micromark-core-commonmark/lib/code-fenced.js","../node_modules/micromark-core-commonmark/lib/code-indented.js","../node_modules/micromark-core-commonmark/lib/code-text.js","../node_modules/micromark-util-subtokenize/index.js","../node_modules/micromark-core-commonmark/lib/content.js","../node_modules/micromark-factory-destination/index.js","../node_modules/micromark-factory-label/index.js","../node_modules/micromark-factory-title/index.js","../node_modules/micromark-factory-whitespace/index.js","../node_modules/micromark-util-normalize-identifier/index.js","../node_modules/micromark-core-commonmark/lib/definition.js","../node_modules/micromark-core-commonmark/lib/hard-break-escape.js","../node_modules/micromark-core-commonmark/lib/heading-atx.js","../node_modules/micromark-util-html-tag-name/index.js","../node_modules/micromark-core-commonmark/lib/html-flow.js","../node_modules/micromark-core-commonmark/lib/html-text.js","../node_modules/micromark-core-commonmark/lib/label-end.js","../node_modules/micromark-core-commonmark/lib/label-start-image.js","../node_modules/micromark-core-commonmark/lib/label-start-link.js","../node_modules/micromark-core-commonmark/lib/line-ending.js","../node_modules/micromark-core-commonmark/lib/thematic-break.js","../node_modules/micromark-core-commonmark/lib/list.js","../node_modules/micromark-core-commonmark/lib/setext-underline.js","../node_modules/micromark/lib/initialize/flow.js","../node_modules/micromark/lib/initialize/text.js","../node_modules/micromark/lib/create-tokenizer.js","../node_modules/micromark/lib/constructs.js","../node_modules/micromark/lib/preprocess.js","../node_modules/micromark-util-decode-numeric-character-reference/index.js","../node_modules/micromark-util-decode-string/index.js","../node_modules/react-markdown/node_modules/mdast-util-from-markdown/lib/index.js","../node_modules/micromark/lib/postprocess.js","../node_modules/micromark/lib/parse.js","../node_modules/react-markdown/node_modules/remark-parse/lib/index.js","../node_modules/unist-builder/index.js","../node_modules/mdast-util-to-hast/lib/traverse.js","../node_modules/unist-util-is/index.js","../node_modules/unist-util-visit/node_modules/unist-util-visit-parents/index.js","../node_modules/unist-util-visit/index.js","../node_modules/unist-util-position/index.js","../node_modules/unist-util-visit-parents/index.js","../node_modules/mdast-util-definitions/node_modules/unist-util-visit/index.js","../node_modules/mdast-util-definitions/index.js","../node_modules/micromark-util-encode/index.js","../node_modules/micromark-util-sanitize-uri/index.js","../node_modules/mdast-util-to-hast/lib/wrap.js","../node_modules/mdast-util-to-hast/lib/handlers/footnote-reference.js","../node_modules/mdurl/encode.js","../node_modules/mdast-util-to-hast/lib/revert.js","../node_modules/mdast-util-to-hast/lib/handlers/list-item.js","../node_modules/mdast-util-to-hast/lib/handlers/index.js","../node_modules/mdast-util-to-hast/lib/handlers/blockquote.js","../node_modules/mdast-util-to-hast/lib/handlers/break.js","../node_modules/mdast-util-to-hast/lib/handlers/code.js","../node_modules/mdast-util-to-hast/lib/handlers/delete.js","../node_modules/mdast-util-to-hast/lib/handlers/emphasis.js","../node_modules/mdast-util-to-hast/lib/handlers/footnote.js","../node_modules/mdast-util-to-hast/lib/handlers/heading.js","../node_modules/mdast-util-to-hast/lib/handlers/html.js","../node_modules/mdast-util-to-hast/lib/handlers/image-reference.js","../node_modules/mdast-util-to-hast/lib/handlers/image.js","../node_modules/mdast-util-to-hast/lib/handlers/inline-code.js","../node_modules/mdast-util-to-hast/lib/handlers/link-reference.js","../node_modules/mdast-util-to-hast/lib/handlers/link.js","../node_modules/mdast-util-to-hast/lib/handlers/list.js","../node_modules/mdast-util-to-hast/lib/handlers/paragraph.js","../node_modules/mdast-util-to-hast/lib/handlers/root.js","../node_modules/mdast-util-to-hast/lib/handlers/strong.js","../node_modules/mdast-util-to-hast/lib/handlers/table.js","../node_modules/mdast-util-to-hast/lib/handlers/text.js","../node_modules/mdast-util-to-hast/lib/handlers/thematic-break.js","../node_modules/mdast-util-to-hast/lib/index.js","../node_modules/unist-util-generated/index.js","../node_modules/mdast-util-to-hast/lib/footer.js","../node_modules/remark-rehype/lib/index.js","../node_modules/property-information/lib/util/schema.js","../node_modules/property-information/lib/util/merge.js","../node_modules/property-information/lib/normalize.js","../node_modules/property-information/lib/util/info.js","../node_modules/property-information/lib/util/types.js","../node_modules/property-information/lib/util/defined-info.js","../node_modules/property-information/lib/util/create.js","../node_modules/property-information/lib/xlink.js","../node_modules/property-information/lib/xml.js","../node_modules/property-information/lib/util/case-sensitive-transform.js","../node_modules/property-information/lib/util/case-insensitive-transform.js","../node_modules/property-information/lib/xmlns.js","../node_modules/property-information/lib/aria.js","../node_modules/property-information/lib/html.js","../node_modules/property-information/lib/svg.js","../node_modules/property-information/lib/find.js","../node_modules/property-information/lib/hast-to-react.js","../node_modules/property-information/index.js","../node_modules/react-markdown/lib/rehype-filter.js","../node_modules/react-markdown/node_modules/react-is/cjs/react-is.production.min.js","../node_modules/react-markdown/node_modules/react-is/cjs/react-is.development.js","../node_modules/react-markdown/node_modules/react-is/index.js","../node_modules/inline-style-parser/index.js","../node_modules/style-to-object/index.js","../node_modules/react-markdown/lib/ast-to-react.js","../node_modules/hast-util-whitespace/index.js","../node_modules/comma-separated-tokens/index.js","../node_modules/space-separated-tokens/index.js","../node_modules/react-markdown/lib/react-markdown.js","../node_modules/micromark-extension-gfm-autolink-literal/lib/syntax.js","../node_modules/micromark-extension-gfm-footnote/lib/syntax.js","../node_modules/micromark-extension-gfm-strikethrough/node_modules/micromark-util-classify-character/index.js","../node_modules/micromark-extension-gfm-strikethrough/lib/syntax.js","../node_modules/micromark-extension-gfm-table/lib/syntax.js","../node_modules/micromark-extension-gfm-task-list-item/lib/syntax.js","../node_modules/ccount/index.js","../node_modules/mdast-util-find-and-replace/index.js","../node_modules/mdast-util-find-and-replace/node_modules/escape-string-regexp/index.js","../node_modules/mdast-util-gfm-autolink-literal/index.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/association.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/track.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/container-flow.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/indent-lines.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/pattern-compile.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/pattern-in-scope.js","../node_modules/mdast-util-gfm-footnote/node_modules/mdast-util-to-markdown/lib/util/safe.js","../node_modules/mdast-util-gfm-footnote/index.js","../node_modules/mdast-util-gfm-strikethrough/node_modules/mdast-util-to-markdown/lib/util/track.js","../node_modules/mdast-util-gfm-strikethrough/index.js","../node_modules/mdast-util-gfm-strikethrough/node_modules/mdast-util-to-markdown/lib/util/container-phrasing.js","../node_modules/mdast-util-gfm-table/node_modules/mdast-util-to-markdown/lib/util/track.js","../node_modules/mdast-util-gfm-table/node_modules/mdast-util-to-markdown/lib/util/pattern-compile.js","../node_modules/mdast-util-gfm-table/node_modules/mdast-util-to-markdown/lib/handle/inline-code.js","../node_modules/markdown-table/index.js","../node_modules/mdast-util-gfm-table/lib/index.js","../node_modules/mdast-util-gfm-table/node_modules/mdast-util-to-markdown/lib/util/container-phrasing.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/util/track.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/util/indent-lines.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/handle/list-item.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/util/check-list-item-indent.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/util/check-bullet.js","../node_modules/mdast-util-gfm-task-list-item/node_modules/mdast-util-to-markdown/lib/util/container-flow.js","../node_modules/mdast-util-gfm-task-list-item/index.js","../node_modules/remark-gfm/index.js","../node_modules/micromark-extension-gfm/index.js","../node_modules/mdast-util-gfm/lib/index.js","../node_modules/highlight.js/lib/core.js","../node_modules/format/format.js","../node_modules/fault/index.js","../node_modules/lowlight/lib/core.js","../node_modules/hast-util-is-element/index.js","../node_modules/unist-util-find-after/index.js","../node_modules/hast-util-to-text/index.js","../node_modules/rehype-highlight/lib/index.js","../src/ReadOnly/FormReadOnlyMarkdown.jsx","../src/ReadOnly/FormReadOnlyNumber.jsx","../src/ReadOnly/FormReadOnlySelect.jsx","../src/ReadOnly/FormReadOnlyBoolean.jsx","../src/ReadOnly/FormReadOnlyRepeater.jsx","../src/Components/HiddenData.jsx","../src/Components/ReservationExpiredSnackbar.jsx","../src/slots/defaultSlots.js","../src/context/GroupDisabledContext.js","../src/utils/fetch.js","../src/hooks/useReservation.js","../src/Components/FormAutoGenerate.jsx","../src/internal/AdornmentField.jsx","../src/internal/FieldRenderer.jsx","../src/Components/FormGroupAutoGenerate.jsx","../src/FormulatorFormSection.jsx","../src/FormulatorForm.jsx","../src/store/ReservationStore.js","../src/hooks/useFetchOptions.js","../src/Components/FormOptionsLoader.jsx","../src/Components/FormPrimaryToggle.jsx"],"sourcesContent":["'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n\nmodule.exports = function equal(a, b) {\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n if (a.constructor !== b.constructor) return false;\n\n var length, i, keys;\n if (Array.isArray(a)) {\n length = a.length;\n if (length != b.length) return false;\n for (i = length; i-- !== 0;)\n if (!equal(a[i], b[i])) return false;\n return true;\n }\n\n\n\n if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n keys = Object.keys(a);\n length = keys.length;\n if (length !== Object.keys(b).length) return false;\n\n for (i = length; i-- !== 0;)\n if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n for (i = length; i-- !== 0;) {\n var key = keys[i];\n\n if (!equal(a[key], b[key])) return false;\n }\n\n return true;\n }\n\n // true if both NaN, false otherwise\n return a!==a && b!==b;\n};\n","/* micromustache v8.0.3 */\n/** @internal */\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/unbound-method\nvar numberConstructor = (0).constructor;\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/unbound-method\nvar isFinite = numberConstructor.isFinite;\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/unbound-method\nvar isInteger = numberConstructor.isInteger;\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/unbound-method\nvar isArray = [].constructor.isArray;\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction isObj(x) {\n return x !== null && typeof x === 'object';\n}\n/** @internal */\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction isFn(x) {\n return typeof x === 'function';\n}\n/** @internal */\nfunction isStr(x, minLength) {\n if (minLength === void 0) { minLength = 0; }\n return typeof x === 'string' && x.length >= minLength;\n}\n/** @internal */\nfunction isNum(x) {\n return isFinite(x);\n}\n/** @internal */\nfunction isArr(x) {\n return isArray(x);\n}\n/** @internal */\nfunction isProp(x, propName) {\n return isObj(x) && propName in x;\n}\n\n/**\n * @internal\n * The number of different varNames that will be cached.\n * If a varName is cached, the actual parsing algorithm will not be called\n * which significantly improves performance.\n * However, this cache is size-limited to prevent degrading the user's software\n * over a period of time.\n * If the cache is full, we start removing older varNames one at a time.\n */\nvar cacheSize = 1000;\n/** @internal */\nvar quoteChars = '\\'\"`';\n/**\n * @internal\n */\nvar Cache = /** @class */ (function () {\n function Cache(size) {\n this.size = size;\n this.reset();\n }\n Cache.prototype.reset = function () {\n this.oldestIndex = 0;\n this.map = {};\n this.cachedKeys = new Array(this.size);\n };\n Cache.prototype.get = function (key) {\n return this.map[key];\n };\n Cache.prototype.set = function (key, value) {\n this.map[key] = value;\n var oldestKey = this.cachedKeys[this.oldestIndex];\n if (oldestKey !== undefined) {\n delete this.map[oldestKey];\n }\n this.cachedKeys[this.oldestIndex] = key;\n this.oldestIndex++;\n this.oldestIndex %= this.size;\n };\n return Cache;\n}());\n/** @internal */\nvar cache = new Cache(cacheSize);\n/**\n * @internal\n * Removes the quotes from a string and returns it.\n * @param propName an string with quotations\n * @throws `SyntaxError` if the quotation symbols don't match or one is missing\n * @returns the input with its quotes removed\n */\nfunction propBetweenBrackets(propName) {\n // in our algorithms key is always a string and never only a string of spaces\n var firstChar = propName.charAt(0);\n var lastChar = propName.substr(-1);\n if (quoteChars.includes(firstChar) || quoteChars.includes(lastChar)) {\n if (propName.length < 2 || firstChar !== lastChar) {\n throw new SyntaxError(\"Mismatching string quotation: \\\"\" + propName + \"\\\"\");\n }\n return propName.substring(1, propName.length - 1);\n }\n if (propName.includes('[')) {\n throw new SyntaxError(\"Missing ] in varName \\\"\" + propName + \"\\\"\");\n }\n // Normalize leading plus from numerical indices\n if (firstChar === '+') {\n return propName.substr(1);\n }\n return propName;\n}\n/** @internal */\nfunction pushPropName(propNames, propName, preDot) {\n var pName = propName.trim();\n if (pName === '') {\n return propNames;\n }\n if (pName.startsWith('.')) {\n if (preDot) {\n pName = pName.substr(1).trim();\n if (pName === '') {\n return propNames;\n }\n }\n else {\n throw new SyntaxError(\"Unexpected . at the start of \\\"\" + propName + \"\\\"\");\n }\n }\n else if (preDot) {\n throw new SyntaxError(\"Missing . at the start of \\\"\" + propName + \"\\\"\");\n }\n if (pName.endsWith('.')) {\n throw new SyntaxError(\"Unexpected \\\".\\\" at the end of \\\"\" + propName + \"\\\"\");\n }\n var propNameParts = pName.split('.');\n for (var _i = 0, propNameParts_1 = propNameParts; _i < propNameParts_1.length; _i++) {\n var propNamePart = propNameParts_1[_i];\n var trimmedPropName = propNamePart.trim();\n if (trimmedPropName === '') {\n throw new SyntaxError(\"Empty prop name when parsing \\\"\" + propName + \"\\\"\");\n }\n propNames.push(trimmedPropName);\n }\n return propNames;\n}\n/**\n * Breaks a variable name to an array of strings that can be used to get a\n * particular value from an object\n * @param varName - the variable name as it occurs in the template.\n * For example `a[\"b\"].c`\n * @throws `TypeError` if the varName is not a string\n * @throws `SyntaxError` if the varName syntax has a problem\n * @returns - an array of property names that can be used to get a particular\n * value.\n * For example `['a', 'b', 'c']`\n */\nfunction toPath(varName) {\n if (!isStr(varName)) {\n throw new TypeError(\"Cannot parse path. Expected string. Got a \" + typeof varName);\n }\n var openBracketIndex;\n var closeBracketIndex = 0;\n var beforeBracket;\n var propName;\n var preDot = false;\n var propNames = new Array(0);\n for (var currentIndex = 0; currentIndex < varName.length; currentIndex = closeBracketIndex) {\n openBracketIndex = varName.indexOf('[', currentIndex);\n if (openBracketIndex === -1) {\n break;\n }\n closeBracketIndex = varName.indexOf(']', openBracketIndex);\n if (closeBracketIndex === -1) {\n throw new SyntaxError(\"Missing ] in varName \\\"\" + varName + \"\\\"\");\n }\n propName = varName.substring(openBracketIndex + 1, closeBracketIndex).trim();\n if (propName.length === 0) {\n throw new SyntaxError('Unexpected token ]');\n }\n closeBracketIndex++;\n beforeBracket = varName.substring(currentIndex, openBracketIndex);\n pushPropName(propNames, beforeBracket, preDot);\n propNames.push(propBetweenBrackets(propName));\n preDot = true;\n }\n var rest = varName.substring(closeBracketIndex);\n return pushPropName(propNames, rest, preDot);\n}\n/**\n * This is just a faster version of `toPath()`\n */\nfunction toPathCached(varName) {\n var result = cache.get(varName);\n if (result === undefined) {\n result = toPath(varName);\n cache.set(varName, result);\n }\n return result;\n}\ntoPath.cached = toPathCached;\n\n/**\n * A useful utility function that is used internally to lookup a variable name as a path to a\n * property in an object. It can also be used in your custom resolver functions if needed.\n *\n * This is similar to [Lodash's `_.get()`](https://lodash.com/docs/#get)\n *\n * It has a few differences with plain JavaScript syntax:\n * - No support for keys that include `[` or `]`.\n * - No support for keys that include `'` or `\"` or `.`.\n * @see https://github.com/userpixel/micromustache/wiki/Known-issues\n * If it cannot find a value in the specified path, it may return undefined or throw an error\n * depending on the value of the `propsExist` param.\n * @param scope an object to resolve value from\n * @param varNameOrPropNames the variable name string or an array of property names (as returned by\n * `toPath()`)\n * @throws `SyntaxError` if the varName string cannot be parsed\n * @throws `ReferenceError` if the scope does not contain the requested key and the `propsExist` is\n * set to a truthy value\n * @returns the value or undefined. If path or scope are undefined or scope is null the result is\n * always undefined.\n */\nfunction get(scope, varNameOrPropNames, options) {\n if (options === void 0) { options = {}; }\n if (!isObj(options)) {\n throw new TypeError(\"get expects an object option. Got \" + typeof options);\n }\n var _a = options.depth, depth = _a === void 0 ? 10 : _a;\n if (!isNum(depth) || depth <= 0) {\n throw new RangeError(\"Expected a positive number for depth. Got \" + depth);\n }\n var propNames = Array.isArray(varNameOrPropNames)\n ? varNameOrPropNames\n : toPath.cached(varNameOrPropNames);\n var propNamesAsStr = function () { return propNames.join(' > '); };\n if (propNames.length > depth) {\n throw new ReferenceError(\"The path cannot be deeper than \" + depth + \" levels. Got \\\"\" + propNamesAsStr() + \"\\\"\");\n }\n var currentScope = scope;\n for (var _i = 0, propNames_1 = propNames; _i < propNames_1.length; _i++) {\n var propName = propNames_1[_i];\n if (isProp(currentScope, propName)) {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n currentScope = currentScope[propName];\n }\n else if (options.propsExist) {\n throw new ReferenceError(propName + \" is not defined in the scope at path: \\\"\" + propNamesAsStr() + \"\\\"\");\n }\n else {\n return;\n }\n }\n return currentScope;\n}\n\n/**\n * This class does the heavy lifting of interpolation (putting the actual values\n * in the template).\n * This is created by the `.compile()` method and is used under the hood by\n * `.render()`, `renderFn()` and `renderFnAsync()` functions.\n */\nvar Renderer = /** @class */ (function () {\n /**\n * Creates a new Renderer instance. This is called internally by the compiler.\n * @param tokens - the result of the `.tokenize()` function\n * @param options - some options for customizing the rendering process\n * @throws `TypeError` if the token is invalid\n */\n function Renderer(tokens, options) {\n var _this = this;\n if (options === void 0) { options = {}; }\n this.tokens = tokens;\n this.options = options;\n /**\n * Replaces every {{varName}} inside the template with values from the scope\n * parameter.\n *\n * @param template The template containing one or more {{varName}} as\n * placeholders for values from the `scope` parameter.\n * @param scope An object containing values for variable names from the the\n * template. If it's omitted, we default to an empty object.\n */\n this.render = function (scope) {\n if (scope === void 0) { scope = {}; }\n var varNames = _this.tokens.varNames;\n var length = varNames.length;\n _this.cacheParsedPaths();\n var values = new Array(length);\n for (var i = 0; i < length; i++) {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n values[i] = get(scope, _this.toPathCache[i], _this.options);\n }\n return _this.stringify(values);\n };\n /**\n * Same as [[render]] but accepts a resolver function which will be\n * responsible for returning a value for every varName.\n */\n this.renderFn = function (resolveFn, scope) {\n if (scope === void 0) { scope = {}; }\n var values = _this.resolveVarNames(resolveFn, scope);\n return _this.stringify(values);\n };\n /**\n * Same as [[render]] but accepts a resolver function which will be responsible\n * for returning promise that resolves to a value for every varName.\n */\n this.renderFnAsync = function (resolveFnAsync, scope) {\n if (scope === void 0) { scope = {}; }\n return Promise.all(_this.resolveVarNames(resolveFnAsync, scope)).then(function (values) {\n return _this.stringify(values);\n });\n };\n if (!isObj(tokens) ||\n !isArr(tokens.strings) ||\n !isArr(tokens.varNames) ||\n tokens.strings.length !== tokens.varNames.length + 1) {\n // This is most likely an internal error from tokenization algorithm\n throw new TypeError(\"Invalid tokens object\");\n }\n if (!isObj(options)) {\n throw new TypeError(\"Options should be an object. Got a \" + typeof options);\n }\n if (options.validateVarNames) {\n // trying to initialize toPathCache parses them which is also validation\n this.cacheParsedPaths();\n }\n }\n /**\n * This function is called internally for filling in the `toPathCache` cache.\n * If the `validateVarNames` option for the constructor is set to a truthy\n * value, this function is called immediately which leads to a validation as\n * well because it throws an error if it cannot parse variable names.\n */\n Renderer.prototype.cacheParsedPaths = function () {\n var varNames = this.tokens.varNames;\n if (this.toPathCache === undefined) {\n this.toPathCache = new Array(varNames.length);\n for (var i = 0; i < varNames.length; i++) {\n this.toPathCache[i] = toPath.cached(varNames[i]);\n }\n }\n };\n Renderer.prototype.resolveVarNames = function (resolveFn, scope) {\n if (scope === void 0) { scope = {}; }\n var varNames = this.tokens.varNames;\n if (!isFn(resolveFn)) {\n throw new TypeError(\"Expected a resolver function. Got \" + String(resolveFn));\n }\n var length = varNames.length;\n var values = new Array(length);\n for (var i = 0; i < length; i++) {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n values[i] = resolveFn.call(null, varNames[i], scope);\n }\n // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n return values;\n };\n /**\n * Puts the resolved `values` into the rest of the template (`strings`) and\n * returns the final result that'll be returned from `render()`, `renderFn()`\n * and `renderFnAsync()` functions.\n */\n Renderer.prototype.stringify = function (values) {\n var strings = this.tokens.strings;\n var explicit = this.options.explicit;\n var length = values.length;\n var ret = '';\n for (var i = 0; i < length; i++) {\n ret += strings[i];\n // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n var value = values[i];\n if (explicit || (value !== null && value !== undefined)) {\n ret += value;\n }\n }\n ret += strings[length];\n return ret;\n };\n return Renderer;\n}());\n\n/**\n * Parses a template and returns the tokens in an object.\n *\n * @throws `TypeError` if there's an issue with its inputs\n * @throws `SyntaxError` if there's an issue with the template\n *\n * @param template the template\n * @param openSym the string that marks the start of a variable name\n * @param closeSym the string that marks the start of a variable name\n * @returns the resulting tokens as an object that has strings and variable names\n */\nfunction tokenize(template, options) {\n if (options === void 0) { options = {}; }\n if (!isStr(template)) {\n throw new TypeError(\"The template parameter must be a string. Got a \" + typeof template);\n }\n if (!isObj(options)) {\n throw new TypeError(\"Options should be an object. Got a \" + typeof options);\n }\n var _a = options.tags, tags = _a === void 0 ? ['{{', '}}'] : _a, _b = options.maxVarNameLength, maxVarNameLength = _b === void 0 ? 1000 : _b;\n if (!isArr(tags) || tags.length !== 2) {\n throw TypeError(\"tags should be an array of two elements. Got \" + String(tags));\n }\n var openSym = tags[0], closeSym = tags[1];\n if (!isStr(openSym, 1) || !isStr(closeSym, 1) || openSym === closeSym) {\n throw new TypeError(\"The open and close symbols should be two distinct non-empty strings. Got \\\"\" + openSym + \"\\\" and \\\"\" + closeSym + \"\\\"\");\n }\n if (!isNum(maxVarNameLength) || maxVarNameLength <= 0) {\n throw new Error(\"Expected a positive number for maxVarNameLength. Got \" + maxVarNameLength);\n }\n var openSymLen = openSym.length;\n var closeSymLen = closeSym.length;\n var openIndex;\n var closeIndex = 0;\n var varName;\n var strings = [];\n var varNames = [];\n var currentIndex = 0;\n while (currentIndex < template.length) {\n openIndex = template.indexOf(openSym, currentIndex);\n if (openIndex === -1) {\n break;\n }\n var varNameStartIndex = openIndex + openSymLen;\n closeIndex = template\n .substr(varNameStartIndex, maxVarNameLength + closeSymLen)\n .indexOf(closeSym);\n if (closeIndex === -1) {\n throw new SyntaxError(\"Missing \\\"\" + closeSym + \"\\\" in the template for the \\\"\" + openSym + \"\\\" at position \" + openIndex + \" within \" + maxVarNameLength + \" characters\");\n }\n closeIndex += varNameStartIndex;\n varName = template.substring(varNameStartIndex, closeIndex).trim();\n if (varName.length === 0) {\n throw new SyntaxError(\"Unexpected \\\"\" + closeSym + \"\\\" tag found at position \" + openIndex);\n }\n if (varName.includes(openSym)) {\n throw new SyntaxError(\"Variable names cannot have \\\"\" + openSym + \"\\\". But at position \" + openIndex + \". Got \\\"\" + varName + \"\\\"\");\n }\n varNames.push(varName);\n closeIndex += closeSymLen;\n strings.push(template.substring(currentIndex, openIndex));\n currentIndex = closeIndex;\n }\n strings.push(template.substring(closeIndex));\n return { strings: strings, varNames: varNames };\n}\n\n/**\n * Compiles a template and returns an object with functions that render it.\n * Compilation makes repeated render calls more optimized by parsing the\n * template only once and reusing the results.\n * As a result, rendering gets 3-5x faster.\n * Caching is stored in the resulting object, so if you free up all the\n * references to that object, the caches will be garbage collected.\n *\n * @param template same as the template parameter to .render()\n * @param options some options for customizing the compilation\n * @throws `TypeError` if the template is not a string\n * @throws `TypeError` if the options is set but is not an object\n * @throws any error that [[tokenize]] or [[Renderer.constructor]] may throw\n * @returns a [[Renderer]] object which has render methods\n */\nfunction compile(template, options) {\n if (options === void 0) { options = {}; }\n var tokens = tokenize(template, options);\n return new Renderer(tokens, options);\n}\n\n/**\n * Replaces every {{varName}} inside the template with values from the scope\n * parameter.\n * @warning **When dealing with user input, always make sure to validate it.**\n * @param template The template containing one or more {{varName}} as\n * placeholders for values from the `scope` parameter.\n * @param scope An object containing values for variable names from the the\n * template. If it's omitted, we default to an empty object.\n * Since functions are objects in javascript, the `scope` can technically be a\n * function too but it won't be called. It'll be treated as an object and its\n * properties will be used for the lookup.\n * @param options same options as the [[compile]] function\n * @throws any error that [[compile]] or [[Renderer.render]] may throw\n * @returns Template where its variable names replaced with\n * corresponding values.\n */\nfunction render(template, scope, options) {\n var renderer = compile(template, options);\n return renderer.render(scope);\n}\n/**\n * Same as [[render]] but accepts a resolver function which will be responsible\n * for returning a value for every varName.\n * @param resolveFn a function that takes a variable name and resolves it to a value.\n * The value can be a number, string or boolean. If it is not, it'll be \"stringified\".\n * @throws any error that [[compile]] or [[Renderer.renderFn]] may throw\n * @returns Template where its variable names replaced with what is returned from the resolver\n * function for each varName.\n */\nfunction renderFn(template, resolveFn, scope, options) {\n var renderer = compile(template, options);\n return renderer.renderFn(resolveFn, scope);\n}\n/**\n * Same as [[renderFn]] but supports asynchronous resolver functions\n * (a function that returns a promise instead of the value).\n * @param resolveFn an async function that takes a variable name and resolves it to a value.\n * The value can be a number, string or boolean. If it is not, it'll be \"stringified\".\n * @throws any error that [[compile]] or [[Renderer.renderFnAsync]] may throw\n * @returns a promise that when resolved contains the template where its variable names replaced\n * with what is returned from the resolver function for each varName.\n */\nfunction renderFnAsync(template, resolveFnAsync, scope, options) {\n var renderer = compile(template, options);\n return renderer.renderFnAsync(resolveFnAsync, scope);\n}\n\nexport { Renderer, compile, get, render, renderFn, renderFnAsync, tokenize };\n//# sourceMappingURL=micromustache.mjs.map\n","import {\n useState, useEffect, useRef\n} from 'react'\n\n/**\n * React 17 compatible store selector hook.\n * Subscribes to a FormStore and re-renders only when the selected slice changes.\n *\n * @param {FormStore} store - the store instance\n * @param {function} selector - (state) => selectedValue\n * @param {function} equals - equality check, defaults to Object.is\n */\nconst useStoreSelector = (store, selector, equals = Object.is) => {\n const [value, setValue] = useState(() => selector(store.getState()))\n\n // Always keep the latest selector accessible inside the effect without restarting it.\n const selectorRef = useRef(selector)\n selectorRef.current = selector\n\n useEffect(() => {\n // Re-read current value to avoid a stale snapshot that might have slipped in\n // between the render and this effect being attached.\n let currentValue = selectorRef.current(store.getState())\n\n const unsubscribe = store.subscribe(() => {\n const newValue = selectorRef.current(store.getState())\n if (!equals(currentValue, newValue)) {\n currentValue = newValue\n setValue(newValue)\n }\n })\n\n return unsubscribe\n }, [store, equals]) // eslint-disable-line react-hooks/exhaustive-deps\n\n return value\n}\n\nexport default useStoreSelector\n","import {\n createContext, useContext, useMemo\n} from 'react'\n\nimport useStoreSelector from '../store/useStoreSelector'\n\nconst FormContext = createContext(null)\n\nexport default FormContext\n\n/**\n * Internal hook — used by FormulatorFormSection and FieldRenderer to access\n * the full context (store, api, config, handlers).\n * Not part of the public API.\n */\nexport const useInternalFormContext = () => useContext(FormContext)\n\n/**\n * Public hook — for parent components that wrap a FormulatorForm.\n * Provides stable, non-reactive access plus an imperative API.\n *\n * To reactively subscribe to state changes, use useFormSelector instead.\n *\n * @returns {{ getState, subscribe, submitForm, resetForm, setFieldValue }}\n */\nexport const useFormContext = () => {\n const ctx = useContext(FormContext)\n if (!ctx) throw new Error('useFormContext must be used within a FormulatorForm')\n // Stable object — only recreated when the api changes (which happens at most when\n // FormulatorForm re-renders with different callbacks/data). ctx.store is always stable.\n return useMemo(() => ({\n getState: () => ctx.store.getState(),\n subscribe: listener => ctx.store.subscribe(listener),\n submitForm: ctx.api.submitForm,\n resetForm: ctx.api.resetForm,\n setFieldValue: ctx.api.setFieldValue,\n setFieldValues: ctx.api.setFieldValues\n // eslint-disable-next-line react-hooks/exhaustive-deps\n }), [ctx.api, ctx.store])\n}\n\n/**\n * Public reactive selector hook — for parent components that need to re-render\n * when a specific slice of form state changes.\n *\n * Must be called at the top level of a component (Rules of Hooks apply).\n *\n * @example\n * const isDirty = useFormSelector(s => s.isDirty)\n * const hasErrors = useFormSelector(s => s.hasErrors)\n * const nameValue = useFormSelector(s => s.data.name)\n *\n * @param {function} selector - (formState) => selectedValue\n * @param {function} [equals] - equality check, defaults to Object.is\n */\nexport const useFormSelector = (selector, equals = Object.is) => {\n const ctx = useContext(FormContext)\n if (!ctx) throw new Error('useFormSelector must be used within a FormulatorForm')\n return useStoreSelector(ctx.store, selector, equals)\n}\n","import {\n createContext, useContext\n} from 'react'\n\nconst ReservationContext = createContext(undefined)\n\nexport default ReservationContext\n\n/**\n * Internal hook — provides access to the ReservationStore instance.\n * Used by useReservation, FormAutoGenerate, and ReservationExpiredSnackbar.\n */\nexport const useReservationStore = () => useContext(ReservationContext)\n","/**\n * Vanilla JS store — no React imports.\n * Holds all form state and notifies listeners on every change.\n * Supports batching to emit only one notification for multiple simultaneous updates.\n */\nclass FormStore {\n constructor(initialState) {\n this._state = initialState\n this._listeners = new Set()\n this._batchDepth = 0\n }\n\n getState() {\n return this._state\n }\n\n setState(updater) {\n this._state = typeof updater === 'function'\n ? updater(this._state)\n : { ...this._state, ...updater }\n if (this._batchDepth === 0) this._notify()\n }\n\n /** Run multiple setState calls while emitting only one notification at the end. */\n batch(fn) {\n this._batchDepth++\n try {\n fn()\n } finally {\n this._batchDepth--\n if (this._batchDepth === 0) this._notify()\n }\n }\n\n _notify() {\n this._listeners.forEach(l => l())\n }\n\n subscribe(listener) {\n this._listeners.add(listener)\n return () => this._listeners.delete(listener)\n }\n}\n\nexport default FormStore\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box, Typography\n} from '@mui/material'\n\nconst FormGroupHeader = ({\n label,\n labelVariant = 'h5',\n desc,\n descVariant = 'body2',\n textAlign = 'left'\n}) => {\n if (!label && !desc) return false\n\n return (\n <Box\n style={{\n width: '100%',\n display: 'flex',\n flexDirection: 'column'\n }}\n >\n {\n label\n && (\n <Box mb={2}>\n <Typography\n variant={labelVariant}\n align={textAlign}\n >\n {label}\n </Typography>\n </Box>\n )\n }\n {\n desc\n && (\n <Box mb={2}>\n <Typography\n variant={descVariant}\n align={textAlign}\n >\n {desc}\n </Typography>\n </Box>\n )\n }\n </Box>\n )\n}\n\nFormGroupHeader.propTypes = {\n label: PropTypes.string,\n labelVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n desc: PropTypes.string,\n descVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n textAlign: PropTypes.oneOf(['left', 'center', 'right'])\n}\n\nexport default FormGroupHeader\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box, Paper\n} from '@mui/material'\n\nimport FormGroupHeader from './FormGroupHeader'\n\nconst FormSectionCard = ({ label, labelVariant, desc, descVariant, textAlign, children }) => (\n <Box mb={2}>\n <Paper elevation={0}>\n <Box p={2}>\n <FormGroupHeader\n label={label}\n labelVariant={labelVariant}\n desc={desc}\n descVariant={descVariant}\n textAlign={textAlign}\n />\n {children}\n </Box>\n </Paper>\n </Box>\n)\n\nFormSectionCard.propTypes = {\n label: PropTypes.string,\n labelVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n desc: PropTypes.string,\n descVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n textAlign: PropTypes.oneOf(['left', 'center', 'right']),\n children: PropTypes.node\n}\n\nexport default FormSectionCard\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport { Box } from '@mui/material'\nimport makeStyles from '@mui/styles/makeStyles'\n\nimport FormGroupHeader from './FormGroupHeader'\n\nconst useStyles = makeStyles(theme => ({\n formSectionBlock: {\n '&:not(:last-child)': {\n marginBottom: theme.spacing(3)\n }\n }\n}))\n\nconst FormSectionBlock = ({ label, labelVariant, desc, descVariant, textAlign, children }) => {\n const styles = useStyles()\n\n return (\n <Box className={styles.formSectionBlock}>\n <FormGroupHeader\n label={label}\n labelVariant={labelVariant}\n desc={desc}\n descVariant={descVariant}\n textAlign={textAlign}\n />\n {children}\n </Box>\n )\n}\n\nFormSectionBlock.propTypes = {\n label: PropTypes.string,\n labelVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n desc: PropTypes.string,\n descVariant: PropTypes.oneOf([\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'subtitle1',\n 'subtitle2',\n 'body1',\n 'body2',\n 'button',\n 'caption',\n 'overline'\n ]),\n textAlign: PropTypes.oneOf(['left', 'center', 'right']),\n children: PropTypes.node\n}\n\nexport default FormSectionBlock\n","/*!\n Copyright (c) 2018 Jed Watson.\n Licensed under the MIT License (MIT), see\n http://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames() {\n\t\tvar classes = [];\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (!arg) continue;\n\n\t\t\tvar argType = typeof arg;\n\n\t\t\tif (argType === 'string' || argType === 'number') {\n\t\t\t\tclasses.push(arg);\n\t\t\t} else if (Array.isArray(arg)) {\n\t\t\t\tif (arg.length) {\n\t\t\t\t\tvar inner = classNames.apply(null, arg);\n\t\t\t\t\tif (inner) {\n\t\t\t\t\t\tclasses.push(inner);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (argType === 'object') {\n\t\t\t\tif (arg.toString === Object.prototype.toString) {\n\t\t\t\t\tfor (var key in arg) {\n\t\t\t\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\t\t\t\tclasses.push(key);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tclasses.push(arg.toString());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn classes.join(' ');\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n","import React from 'react'\nimport PropTypes from 'prop-types'\nimport cx from 'classnames'\n\nimport {\n FormControl,\n FormHelperText,\n InputAdornment,\n FormControlLabel,\n FormGroup\n} from '@mui/material'\n\nimport { makeStyles } from '@mui/styles'\n\nimport { Autorenew as AutorenewIcon } from '@mui/icons-material'\n\nconst useStyles = makeStyles(theme => ({ error: { color: theme.palette.error.main } }))\n\nconst FormControlField = ({\n variant,\n formVariant,\n type,\n name,\n label,\n component,\n componentProps,\n defaultValue,\n value,\n options,\n hasErrors,\n errors,\n required,\n disabled,\n validating,\n dirty,\n onChange\n}) => {\n const styles = useStyles()\n\n const finalProps = {\n formVariant,\n name,\n label,\n defaultValue,\n value,\n options,\n required,\n disabled,\n ...componentProps,\n onChange\n }\n\n const isRender = type === '@@render'\n\n if (validating) {\n finalProps.endAdornment = [(\n <InputAdornment position=\"end\">\n <AutorenewIcon />\n </InputAdornment>\n )]\n }\n\n let control\n if (isRender) {\n try {\n const oldProps = component.props || {}\n control = React.cloneElement(\n component,\n {\n variant,\n ...finalProps,\n ...oldProps,\n label,\n hasErrors,\n errors,\n dirty\n }\n )\n } catch (e) {\n throw new Error(`error creating control for field \"${name}\": ${e.message}`)\n }\n } else {\n try {\n control = React.createElement(\n component,\n {\n variant,\n ...finalProps\n }\n )\n } catch (e) {\n throw new Error(`error creating control for field \"${name}\": ${e.message}`)\n }\n }\n\n const isBoolean = type === 'boolean'\n const isBooleanButtons = isBoolean && finalProps.variant === 'buttons'\n const isRepeater = type === 'array'\n\n if (isRepeater || isRender) {\n return control\n }\n\n return (\n <FormControl\n className=\"data-card-field\"\n error={dirty && hasErrors}\n variant={variant}\n margin=\"dense\"\n fullWidth\n required={required}\n >\n {\n (isBoolean && !isBooleanButtons)\n && (\n <FormControlLabel\n className={cx({ [styles.error]: dirty && hasErrors })}\n control={control}\n label={label}\n labelPlacement={finalProps.labelPlacement || 'end'}\n />\n )\n }\n {\n (\n (!isBoolean && !isRepeater && !isRender)\n || isBooleanButtons\n )\n && control\n }\n {\n (dirty && !disabled && hasErrors)\n && (\n <FormHelperText>\n {errors.map(e => e.message).join('. ')}\n </FormHelperText>\n )\n }\n </FormControl>\n )\n}\n\nFormControlField.propTypes = {\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n formVariant: PropTypes.oneOf(['block', 'card']),\n component: PropTypes.any.isRequired,\n componentProps: PropTypes.object,\n type: PropTypes.string.isRequired,\n name: PropTypes.string.isRequired,\n label: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.bool\n ]),\n defaultValue: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.number,\n PropTypes.bool,\n PropTypes.array,\n PropTypes.object\n ]),\n value: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.number,\n PropTypes.bool,\n PropTypes.array,\n PropTypes.object\n ]),\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })),\n hasErrors: PropTypes.bool,\n errors: PropTypes.array,\n validating: PropTypes.bool,\n dirty: PropTypes.bool,\n required: PropTypes.bool,\n disabled: PropTypes.bool,\n onChange: PropTypes.func.isRequired\n}\n\nconst FormField = ({\n prepend,\n append,\n componentProps,\n ...fieldProps\n}) => {\n const finalProps = {\n componentProps,\n ...fieldProps\n }\n\n if (componentProps?.type === 'hidden') {\n return <input type=\"hidden\" name={fieldProps.name} value={fieldProps.value} />\n }\n\n return (\n <FormGroup>\n {prepend}\n {/* eslint-disable-next-line react/jsx-props-no-spreading */}\n <FormControlField {...finalProps} />\n {append}\n </FormGroup>\n )\n}\n\nFormField.propTypes = {\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n component: PropTypes.any.isRequired,\n componentProps: PropTypes.object,\n type: PropTypes.string.isRequired,\n name: PropTypes.string.isRequired,\n label: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.bool\n ]),\n value: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.number,\n PropTypes.bool,\n PropTypes.array,\n PropTypes.object\n ]),\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })),\n prepend: PropTypes.array,\n append: PropTypes.array,\n hasErrors: PropTypes.bool,\n errors: PropTypes.array,\n validating: PropTypes.bool,\n required: PropTypes.bool,\n dirty: PropTypes.bool,\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormField\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Stack,\n TextField,\n Box,\n Typography\n} from '@mui/material'\n\nconst FormDateRange = ({\n type,\n name,\n label,\n variant,\n value,\n defaultValue,\n required,\n loading,\n disabled,\n onChange\n}) => {\n const changeHandler = newValue => {\n if (onChange) {\n onChange({ target: { name, value: newValue } })\n }\n }\n\n const handleStartChange = e => {\n const newValue = structuredClone(value || {})\n newValue.start = e.target.value\n changeHandler(newValue)\n }\n\n const handleEndChange = e => {\n const newValue = structuredClone(value || {})\n newValue.end = e.target.value\n changeHandler(newValue)\n }\n\n return (\n <Stack>\n <Typography mb={1}>\n {label}\n </Typography>\n <Stack\n direction=\"row\"\n sx={{\n flex: '1 1 auto',\n width: '100%'\n }}\n >\n <TextField\n sx={{ flex: '1 1 auto' }}\n type={type}\n name={`${name}.start`}\n label=\"von\"\n variant={variant}\n InputLabelProps={{ shrink: true }}\n value={value?.start || defaultValue?.start || ''}\n max={value?.end || defaultValue?.end || ''}\n required={required}\n disabled={disabled || loading}\n onChange={handleStartChange}\n />\n <Box\n sx={{\n display: 'flex',\n justifyContent: 'center',\n alignItems: 'center',\n ml: 2,\n mr: 2\n }}\n >\n <Typography color=\"GrayText\">\n –\n </Typography>\n </Box>\n <TextField\n sx={{ flex: '1 1 auto' }}\n type={type}\n name={`${name}.end`}\n label=\"bis\"\n variant={variant}\n InputLabelProps={{ shrink: true }}\n value={value?.end || defaultValue?.end || ''}\n min={value?.start || defaultValue?.start || ''}\n required={required}\n disabled={disabled || loading}\n onChange={handleEndChange}\n />\n </Stack>\n </Stack>\n )\n}\n\nFormDateRange.propTypes = {\n type: PropTypes.string,\n name: PropTypes.string,\n label: PropTypes.string,\n variant: PropTypes.string,\n value: PropTypes.object,\n defaultValue: PropTypes.string,\n required: PropTypes.bool,\n loading: PropTypes.bool,\n disabled: PropTypes.bool,\n onChange: PropTypes.func\n}\n\nexport default FormDateRange\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport { TextField } from '@mui/material'\n\nimport FormDateRange from './FormDateRange'\n\nconst FormText = ({\n type,\n name,\n label,\n variant,\n value,\n defaultValue,\n multiline,\n minRows,\n range,\n required,\n loading,\n disabled,\n onChange\n}) => {\n const extraProps = {}\n\n if (type === 'date' || type === 'datetime-local') {\n extraProps.InputLabelProps = { shrink: true }\n }\n\n if (range) {\n return (\n <FormDateRange\n type={type}\n name={name}\n label={label}\n variant={variant}\n value={value || defaultValue || ''}\n required={required}\n disabled={disabled || loading}\n onChange={onChange || (() => {})}\n />\n )\n }\n\n return (\n <TextField\n type={type}\n name={name}\n label={label}\n variant={variant}\n value={value || defaultValue || ''}\n multiline={multiline}\n minRows={minRows}\n range={range}\n required={required}\n disabled={disabled || loading}\n onChange={onChange || (() => {})}\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...extraProps}\n />\n )\n}\n\nFormText.propTypes = {\n type: PropTypes.string,\n name: PropTypes.string,\n label: PropTypes.string,\n variant: PropTypes.string,\n value: PropTypes.string,\n defaultValue: PropTypes.string,\n multiline: PropTypes.bool,\n minRows: PropTypes.number,\n range: PropTypes.bool,\n required: PropTypes.bool,\n loading: PropTypes.bool,\n disabled: PropTypes.bool,\n onChange: PropTypes.func\n}\n\nexport default FormText\n","// eslint-disable-next-line import/prefer-default-export\nexport const castToNumber = (value, step) => {\n if (\n value === undefined\n || Number.isNaN(value)\n || value === ''\n ) {\n return ''\n }\n\n if (step && !Number.isSafeInteger(step)) return parseFloat(value, 10)\n\n return parseInt(value, 10)\n}\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport { TextField } from '@mui/material'\n\nimport { castToNumber } from '../helpers'\n\nconst FormNumber = ({ name, value, min, max, step, onChange, ...props }) => (\n <TextField\n name={name}\n type=\"number\"\n value={castToNumber(value, step)}\n inputProps={{ min, max, step }}\n onChange={e => onChange({\n target: {\n name,\n value: castToNumber(e.target.value, step)\n }\n })}\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...props}\n />\n)\n\nFormNumber.propTypes = {\n name: PropTypes.string.isRequired,\n min: PropTypes.number,\n max: PropTypes.number,\n step: PropTypes.number,\n value: PropTypes.oneOfType([\n PropTypes.number,\n PropTypes.string\n ]),\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormNumber\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport { Typography } from '@mui/material'\n\nimport { DateTime } from 'luxon'\n\nconst formatDate = (value, renderFormat) => {\n let formatter = DateTime.DATETIME_FULL\n\n if (renderFormat) {\n if (typeof renderFormat === 'string') formatter = DateTime[renderFormat]\n else formatter = renderFormat\n }\n\n return DateTime.fromISO(value).toLocaleString(formatter)\n}\n\nconst FormReadOnlyText = ({ value, type, renderFormat, range, multiline }) => {\n let finalValue = value\n\n if (type === 'date' || type === 'datetime-local') {\n if (range) {\n finalValue = `${formatDate(value?.start || '', renderFormat)} - ${formatDate(value?.end || '', renderFormat)}`\n } else {\n finalValue = formatDate(value, renderFormat)\n }\n }\n\n return (\n <Typography\n variant=\"body1\"\n style={{ whiteSpace: multiline ? 'pre-line' : 'inherit' }}\n >\n {finalValue}\n </Typography>\n )\n}\n\nFormReadOnlyText.propTypes = {\n value: PropTypes.oneOfType([\n PropTypes.number,\n PropTypes.string\n ]),\n type: PropTypes.string,\n range: PropTypes.bool,\n renderFormat: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.object\n ]),\n multiline: PropTypes.bool\n}\n\nexport default FormReadOnlyText\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n TextField, InputAdornment, CircularProgress\n} from '@mui/material'\n\nimport Autocomplete, { createFilterOptions } from '@mui/material/Autocomplete'\n\nconst filter = createFilterOptions()\n\nconst renderInput = (\n {\n required,\n label,\n onInputChange,\n variant,\n loading\n },\n params\n) => {\n let InputProps = params.InputProps || {}\n\n if (loading) {\n InputProps = {\n endAdornment: (\n <InputAdornment position=\"end\">\n <CircularProgress\n size={20}\n thickness={4}\n />\n </InputAdornment>\n )\n }\n }\n\n return (\n <TextField\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...params}\n required={required}\n label={label}\n variant={variant}\n onChange={onInputChange}\n InputProps={InputProps}\n />\n )\n}\n\nconst SelectOrCreate = ({\n id,\n label,\n variant,\n loading,\n required,\n disabled,\n allowCreate,\n options,\n searchKey,\n renderOption,\n renderNewOption,\n value,\n onOpen,\n onClose,\n onChange,\n onInputChange\n}) => (\n <Autocomplete\n id={id}\n value={value || ''}\n fullWidth\n disabled={disabled}\n onOpen={onOpen}\n onClose={onClose}\n onChange={(_, newValue) => {\n if (typeof newValue === 'string') {\n if (!allowCreate && Array.isArray(options) && !options.find(o => o.entry === newValue)) onChange(undefined)\n else onChange({ [searchKey]: newValue })\n } else if (allowCreate && newValue && newValue.inputValue) {\n // Create a new value from the user input\n onChange({ [searchKey]: newValue.inputValue })\n } else {\n onChange(newValue)\n }\n }}\n filterOptions={(allOptions, params) => {\n const filtered = filter(allOptions, params)\n\n // Suggest the creation of a new value\n if (allowCreate && params.inputValue !== '') {\n filtered.push({\n inputValue: params.inputValue,\n [searchKey]: renderNewOption(params.inputValue)\n })\n }\n\n return filtered\n }}\n selectOnFocus\n clearOnBlur\n handleHomeEndKeys\n options={options}\n freeSolo={allowCreate}\n getOptionLabel={option => {\n // Value selected with enter, right from the input\n if (typeof option === 'string') {\n if (!allowCreate && Array.isArray(options) && !options.find(o => o.entry === option)) return ''\n return option\n }\n\n // Add \"xxx\" option created dynamically\n if (option?.inputValue) {\n return option?.inputValue\n }\n\n // Regular option\n return option[searchKey]\n }}\n isOptionEqualToValue={(option, testValue) => option[searchKey] === testValue}\n renderOption={renderOption}\n renderInput={params => (\n renderInput(\n {\n required,\n disabled,\n label,\n onInputChange,\n variant,\n loading\n },\n params\n )\n )}\n />\n)\n\nSelectOrCreate.propTypes = {\n id: PropTypes.string,\n label: PropTypes.string.isRequired,\n variant: PropTypes.string,\n loading: PropTypes.bool,\n required: PropTypes.bool,\n disabled: PropTypes.bool,\n allowCreate: PropTypes.bool,\n options: PropTypes.array.isRequired,\n searchKey: PropTypes.string.isRequired,\n renderOption: PropTypes.func.isRequired,\n renderNewOption: PropTypes.func.isRequired,\n value: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.object\n ]),\n onOpen: PropTypes.func,\n onClose: PropTypes.func,\n onChange: PropTypes.func,\n onInputChange: PropTypes.func\n}\n\nexport default SelectOrCreate\n","import React, { useCallback } from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box,\n Typography,\n FormControl,\n FormHelperText,\n TextField,\n InputAdornment,\n CircularProgress\n} from '@mui/material'\n\nimport FormReadOnlyText from '../../ReadOnly/FormReadOnlyText'\nimport SelectOrCreate from '../../Components/SelectOrCreate'\n\nconst FormAutocomplete = ({\n loading,\n name,\n label,\n value,\n options,\n allowCreate,\n dirty,\n hasErrors,\n errors,\n variant,\n required,\n disabled,\n readOnly,\n fetch,\n abort,\n onChange\n}) => {\n const changeValue = useCallback(newValue => { onChange({ target: { name, value: newValue?.entry || '' } }) }, [onChange])\n\n if (readOnly) {\n return <FormReadOnlyText name={name} value={value} />\n }\n\n if (!options) {\n return (\n <FormControl\n error={dirty && hasErrors}\n margin=\"dense\"\n fullWidth\n required={required}\n >\n <TextField\n label={label}\n variant={variant}\n value={value}\n disabled\n InputProps={{\n endAdornment: (\n <InputAdornment position=\"end\">\n <CircularProgress\n size={20}\n thickness={4}\n />\n </InputAdornment>\n )\n }}\n />\n </FormControl>\n )\n }\n\n return (\n <FormControl\n error={dirty && hasErrors}\n margin=\"dense\"\n fullWidth\n required={required}\n >\n <SelectOrCreate\n loading={loading}\n label={label}\n variant={variant}\n allowCreate={allowCreate}\n options={options}\n searchKey=\"entry\"\n required={required}\n disabled={disabled}\n renderOption={(props, option) => (\n <Box\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...props}\n sx={{\n display: 'flex',\n flexDirection: 'column',\n justifyContent: 'flex-start',\n alignItems: 'flex-start'\n }}\n >\n <Typography variant=\"body1\">\n {option.entry}\n </Typography>\n {\n option.count !== undefined\n && (\n <Typography variant=\"caption\">\n {`${option.count} Einträge`}\n </Typography>\n )\n }\n </Box>\n )}\n renderNewOption={newValue => (\n <Typography variant=\"body1\">\n <strong>{`\"${newValue}\" `}</strong>\n erstellen\n </Typography>\n )}\n value={value}\n onOpen={() => {\n changeValue({ entry: value })\n if (fetch) fetch()\n }}\n onClose={() => {\n if (abort) abort()\n }}\n onChange={changeValue}\n />\n {\n (dirty && !disabled && hasErrors)\n && (\n <FormHelperText>\n {errors.map(e => e.message).join('. ')}\n </FormHelperText>\n )\n }\n </FormControl>\n )\n}\n\nFormAutocomplete.propTypes = {\n loading: PropTypes.bool,\n name: PropTypes.string,\n label: PropTypes.string,\n value: PropTypes.any,\n options: PropTypes.arrayOf(PropTypes.shape({\n entry: PropTypes.string.isRequired,\n count: PropTypes.number\n })),\n allowCreate: PropTypes.bool,\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n required: PropTypes.bool,\n disabled: PropTypes.bool,\n readOnly: PropTypes.bool,\n dirty: PropTypes.bool,\n hasErrors: PropTypes.bool,\n errors: PropTypes.array,\n fetch: PropTypes.func,\n abort: PropTypes.func,\n onChange: PropTypes.func\n}\n\nexport default FormAutocomplete\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n TextField, MenuItem\n} from '@mui/material'\n\nconst FormSelect = ({ name, options, required, defaultValue, value, noSort, onChange, ...props }) => {\n const allOptions = (\n noSort\n ? options\n : options.sort((l, r) => l.label.localeCompare(r.label))\n )\n\n if (!required && !defaultValue) {\n allOptions.unshift({\n label: 'Auswahl löschen',\n value: ''\n })\n }\n\n let finalValue = ''\n if (value !== undefined) finalValue = value\n if (finalValue === '' && defaultValue !== undefined) finalValue = defaultValue\n\n return (\n <TextField\n name={name}\n select\n required={required}\n value={finalValue}\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...props}\n onChange={onChange}\n >\n {\n allOptions\n .map(({ label: itemLabel, value: itemValue }) => (\n <MenuItem\n key={itemLabel}\n value={itemValue}\n >\n {itemLabel}\n </MenuItem>\n ))\n }\n </TextField>\n )\n}\n\nFormSelect.propTypes = {\n name: PropTypes.string,\n defaultValue: PropTypes.string,\n value: PropTypes.string,\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })),\n required: PropTypes.bool,\n noSort: PropTypes.bool,\n onChange: PropTypes.func\n}\n\nexport default FormSelect\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport FormAutocomplete from './FormAutocomplete/FormAutocomplete'\nimport FormSelect from './FormSelect'\n\nconst FormCatalogType = ({ type, options, autocomplete, ...props }) => {\n if (autocomplete === true) {\n return (\n <FormAutocomplete\n type=\"autocomplete\"\n // eslint-disable-next-line react/jsx-props-no-spreading\n {...props}\n options={options.map(entry => ({ entry: entry.value }))}\n />\n )\n }\n\n // eslint-disable-next-line react/jsx-props-no-spreading\n return <FormSelect type={type} options={options} {...props} />\n}\n\nFormCatalogType.propTypes = {\n type: PropTypes.string.isRequired,\n options: PropTypes.array.isRequired,\n autocomplete: PropTypes.bool\n}\n\nexport default FormCatalogType\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Stack,\n Button,\n Checkbox,\n Switch\n} from '@mui/material'\n\nconst isBoolean = val => val === false || val === true\nconst isChecked = (value, defaultValue) => (isBoolean(value) ? value : (defaultValue || false))\n\nconst FormBoolean = ({\n variant,\n name,\n value,\n defaultValue,\n disabled,\n needsToBeTrue,\n firstOption,\n labelTrue,\n labelFalse,\n onChange\n}) => {\n const handleChange = e => {\n let newValue = e.target.checked\n if (needsToBeTrue === true && newValue === false) newValue = undefined\n onChange({ target: { name, value: newValue } })\n }\n\n const setValue = newValue => {\n onChange({ target: { name, value: newValue } })\n }\n\n if (variant === 'checkbox') {\n return (\n <Checkbox\n color=\"primary\"\n name={name}\n checked={isChecked(value, defaultValue)}\n onChange={handleChange}\n />\n )\n }\n\n if (variant === 'buttons') {\n const buttonFalse = (\n <Button\n disabled={disabled}\n disableElevation\n variant={\n !isChecked(value, defaultValue)\n ? 'contained'\n : 'outlined'\n }\n color={\n !isChecked(value, defaultValue)\n ? 'primary'\n : 'inherit'\n }\n sx={{\n p: 0,\n height: theme => theme.spacing(7),\n flex: ' 1 1 auto',\n mr: (\n firstOption === true\n ? 0\n : 2\n )\n }}\n onClick={() => setValue(false)}\n >\n {labelFalse || 'Nein'}\n </Button>\n )\n\n const buttonTrue = (\n <Button\n disabled={disabled}\n disableElevation\n variant={\n isChecked(value, defaultValue)\n ? 'contained'\n : 'outlined'\n }\n color={\n isChecked(value, defaultValue)\n ? 'primary'\n : 'inherit'\n }\n sx={{\n p: 0,\n height: theme => theme.spacing(7),\n flex: ' 1 1 auto',\n mr: (\n firstOption === true\n ? 2\n : 0\n )\n }}\n onClick={() => setValue(true)}\n >\n {labelTrue || 'Ja'}\n </Button>\n )\n\n return (\n <Stack direction=\"row\">\n {\n firstOption === true\n && (\n <>\n {buttonTrue}\n {buttonFalse}\n </>\n )\n }\n {\n firstOption !== true\n && (\n <>\n {buttonFalse}\n {buttonTrue}\n </>\n )\n }\n </Stack>\n )\n }\n\n return (\n <Switch\n color=\"primary\"\n name={name}\n checked={isChecked(value, defaultValue)}\n onChange={handleChange}\n />\n )\n}\n\nFormBoolean.propTypes = {\n variant: PropTypes.string,\n name: PropTypes.string.isRequired,\n value: PropTypes.bool,\n defaultValue: PropTypes.bool,\n disabled: PropTypes.bool,\n needsToBeTrue: PropTypes.bool,\n firstOption: PropTypes.bool,\n labelTrue: PropTypes.string,\n labelFalse: PropTypes.string,\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormBoolean\n","import React, { useState } from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box,\n TextField,\n Button,\n IconButton,\n InputAdornment,\n FormControl,\n Typography,\n MenuItem,\n ClickAwayListener\n} from '@mui/material'\n\nimport {\n Add as AddIcon,\n Clear as ClearIcon\n} from '@mui/icons-material'\n\nconst getValue = (value, catalog) => {\n if (catalog && catalog[value] !== undefined) return catalog[value]\n return value\n}\n\nconst FormRepeaterDefault = ({\n variant,\n entries,\n options,\n blockedOptions,\n onChange\n}) => {\n const [inEdit, setInEdit] = useState(false)\n const [inputValue, setInputValue] = useState('')\n const [catalogSelectValue, setCatalogSelectValue] = useState('')\n\n const handleCancelNewEntry = () => {\n setInEdit(false)\n setInputValue('')\n setCatalogSelectValue('')\n }\n\n const handleEntryAdd = () => {\n if (inputValue.length > 0) {\n onChange([...entries, inputValue])\n setInputValue('')\n }\n }\n\n const handleEntryDel = delIndex => {\n const newEntries = [...entries]\n newEntries.splice(delIndex, 1)\n onChange(newEntries)\n }\n\n return (\n <Box width=\"100%\">\n {\n (!entries || entries?.length === 0)\n && (\n <Box mt={1} pl={2}>\n <Typography variant=\"body2\" color=\"textSecondary\">\n Keine Einträge vorhanden\n </Typography>\n </Box>\n )\n }\n {\n entries.map((entry, index) => (\n <Box\n // eslint-disable-next-line react/no-array-index-key\n key={`entry-${index}`}\n sx={theme => ({\n display: 'flex',\n alignItems: 'center',\n width: '100%',\n mt: 1,\n px: 1.5,\n py: 0.75,\n border: `1px solid ${theme.palette.grey[400]}`,\n borderRadius: 1\n })}\n >\n <Typography\n variant=\"body2\"\n sx={theme => ({\n mr: 1.5,\n px: 0.5,\n color: theme.palette.text.secondary,\n fontSize: theme.typography.caption.fontSize,\n fontWeight: theme.typography.fontWeightMedium,\n lineHeight: 1\n })}\n >\n {index + 1}\n </Typography>\n <Typography\n variant=\"body1\"\n sx={{ flex: '1 1 auto' }}\n >\n {getValue(entry, options)}\n </Typography>\n <IconButton\n size=\"small\"\n onClick={() => handleEntryDel(index)}\n >\n <ClearIcon fontSize=\"small\" />\n </IconButton>\n </Box>\n ))\n }\n {\n !inEdit\n && (\n <Box mt={1}>\n <Button\n color=\"primary\"\n variant=\"outlined\"\n onClick={() => setInEdit(true)}\n >\n Einträge hinzufügen\n </Button>\n </Box>\n )\n }\n {\n (inEdit && !options)\n && (\n <Box\n width=\"100%\"\n display=\"flex\"\n alignItems=\"stretch\"\n mt={1}\n gap={1}\n >\n <ClickAwayListener\n onClickAway={() => {\n if (inputValue === '') {\n setInEdit(false)\n }\n }}\n >\n <FormControl\n variant=\"filled\"\n fullWidth\n >\n <TextField\n label=\"Neuer Eintrag\"\n variant={variant}\n value={inputValue}\n onKeyDown={e => {\n if (e.key === 'Enter') handleEntryAdd()\n if (e.key === 'Escape') handleCancelNewEntry()\n }}\n onChange={e => setInputValue(e.target.value)}\n />\n </FormControl>\n </ClickAwayListener>\n <Button\n variant=\"outlined\"\n color=\"primary\"\n sx={{ minWidth: 0, px: 2 }}\n onClick={handleEntryAdd}\n >\n <AddIcon />\n </Button>\n </Box>\n )\n }\n {\n (inEdit && options)\n && (\n <Box\n width=\"100%\"\n display=\"flex\"\n alignItems=\"stretch\"\n mt={1}\n >\n <FormControl\n variant=\"filled\"\n fullWidth\n >\n <TextField\n label=\"Eintrag auswählen\"\n select\n variant={variant}\n value={catalogSelectValue}\n onBlur={handleCancelNewEntry}\n onChange={e => {\n setCatalogSelectValue('')\n onChange([...entries, e.target.value])\n }}\n >\n {\n Object\n .entries(options)\n .sort((a, b) => a[1].localeCompare(b[1]))\n .map(e => (\n <MenuItem\n key={`option-${e[0]}`}\n value={e[0]}\n disabled={blockedOptions.includes(e[0])}\n >\n {e[1]}\n </MenuItem>\n ))\n }\n </TextField>\n </FormControl>\n </Box>\n )\n }\n </Box>\n )\n}\n\nFormRepeaterDefault.propTypes = {\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n entries: PropTypes.array.isRequired,\n options: PropTypes.array.isRequired,\n blockedOptions: PropTypes.array.isRequired,\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormRepeaterDefault\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var 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 match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var 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. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\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. */\n var 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 rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\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 */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var 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 /** 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/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var 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 /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var 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 /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&amp;',\n '<': '&lt;',\n '>': '&gt;',\n '\"': '&quot;',\n \"'\": '&#39;'\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&amp;': '&',\n '&lt;': '<',\n '&gt;': '>',\n '&quot;': '\"',\n '&#39;': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var 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\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * A specialized version of `_.forEachRight` 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 */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\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 */\n function 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\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 */\n function 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\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 */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\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 */\n function 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\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * A specialized version of `_.reduceRight` 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 last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\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 */\n function 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\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\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 */\n function asciiToArray(string) {\n return string.split('');\n }\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 */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\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 */\n function 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\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 */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\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 * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\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 */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` 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 {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\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 */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\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 */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\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 */\n function 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\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` 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 {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\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 */\n function 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\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names 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 key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\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 */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\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 */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\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 */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\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 */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\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 */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\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 */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\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 */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\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 */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\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 */\n function 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\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 */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\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 */\n function 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\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\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 */\n function 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\n /**\n * A specialized version of `_.lastIndexOf` 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 */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\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 */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\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 */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\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 */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\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 */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\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 */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\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 */\n var 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\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function 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 /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\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 */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\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 */\n function 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\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 */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\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 */\n function 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\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function 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 /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\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 */\n function 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\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 */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\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 */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\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 */\n function 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\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\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 */\n function 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 /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\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 */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\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 */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\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 */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\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 */\n function 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\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\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 */\n function 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 /**\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 */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\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 */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\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 */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\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 */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\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 */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\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 */\n function stackHas(key) {\n return this.__data__.has(key);\n }\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 */\n function 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\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\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 */\n function 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\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\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 */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\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 */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\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 */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\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 */\n function 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\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\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 */\n function 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\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\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 */\n function 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\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 */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` 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 */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\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 */\n function 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\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 */\n function 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\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\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 */\n function 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\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 */\n function 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\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 */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\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 */\n var baseForRight = createBaseFor(true);\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 */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` 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 */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\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 */\n function 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\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 */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\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 */\n function 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\n /**\n * The base implementation of `_.gt` 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 greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\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 */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\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 */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays 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 array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\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 */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\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 */\n function 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\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 */\n function 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\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 */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\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 */\n function 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\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 */\n function 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\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 */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\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 */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\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 */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\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 */\n function baseLt(value, other) {\n return value < other;\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\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 */\n function 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\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 */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\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 */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\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 */\n function 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\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\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 */\n var 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\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\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 */\n function 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\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 */\n function 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\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * 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 * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\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 */\n function 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\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 */\n function 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\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays 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 array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\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 */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\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 */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\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 */\n function 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\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\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 */\n function 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\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 */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\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 */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\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 */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\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 */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\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 */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\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 */\n function 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\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 */\n function 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\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 */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\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 */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\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 */\n function 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, getIteratee(iteratee, 2), accumulator);\n };\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\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 */\n function 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\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 */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\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 */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(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\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\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 */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\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 */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\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 */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\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 */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\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 */\n function 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\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 */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\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 */\n function 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\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 */\n var 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\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 */\n var 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\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((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\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\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 */\n function 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\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 */\n function 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\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 */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\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 */\n function 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\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\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 */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\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 */\n function 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\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 */\n function 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\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 */\n function 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\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 */\n function 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\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\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 */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\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 */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\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 */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\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 */\n function 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\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 */\n function 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\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\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 */\n function 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\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 */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\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 */\n function 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\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\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 */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\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 */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\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 */\n function 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\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\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 */\n var 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\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 */\n function 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\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 */\n function 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\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\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 */\n function 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\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\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 */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\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 */\n function 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\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 */\n function 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\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\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 */\n function 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, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.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=array.length-1] 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': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\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 */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\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 */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\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 */\n function 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\n /**\n * Gets all but 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 {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all 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 * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first 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} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\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 */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\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=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\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 */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.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 * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\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] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\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 * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken 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 take.\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 * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(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, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. 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} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\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 */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\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 */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, 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 {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.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 * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\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 */\n function 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, getIteratee(predicate, 3));\n }\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 */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\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 */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.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=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\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 */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.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 * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.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 {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\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 */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\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 _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\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 */\n var 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\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 */\n function 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\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `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 {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\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 iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\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 */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\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 {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.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 array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\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 */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\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 _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\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 */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\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 */\n function 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, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are 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|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\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 */\n function 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`.\n memoize.Cache = MapCache;\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 */\n function 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\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\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 * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '<p>' + func(text) + '</p>';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '<p>fred, barney, &amp; pebbles</p>'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\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 */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\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 */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.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 `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.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 `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\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 */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\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 */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` 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 an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\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 */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\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 */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or 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 boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\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 */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` 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 date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\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 DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('<body>');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\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 */\n function 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\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.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 * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\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 * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\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 an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\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 finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\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 */\n function 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\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\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 integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\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 */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\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 */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\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 */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\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 */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\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 `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\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 native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\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 `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\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 nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\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 number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\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 */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\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 safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\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 */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\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 */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\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 */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\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 */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\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 */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` 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 weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` 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 weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.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 `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.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 `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\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 */\n function 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\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 */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is 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 convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\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 */\n function 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\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\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 * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\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 */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\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 */\n var 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\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\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 * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\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 */\n var 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\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.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 _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key 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 Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\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 */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\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 */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\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 */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` 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 of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\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 */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\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 */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * 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 * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\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 */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\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 of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\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 * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\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 assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\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 */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values 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 values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\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 */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\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 */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\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 */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, &amp; pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\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 kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower 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 lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower 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 * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\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 snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<b><%- value %></b>');\n * compiled({ 'value': '<script>' });\n * // => '<b>&lt;script&gt;</b>'\n *\n * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the internal `print` function in \"evaluate\" delimiters.\n * var compiled = _.template('<% print(\"hello \" + user); %>!');\n * compiled({ 'user': 'barney' });\n * // => 'hello barney!'\n *\n * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n * // Disable support by replacing the \"interpolate\" delimiter.\n * var compiled = _.template('hello ${ user }!');\n * compiled({ 'user': 'pebbles' });\n * // => 'hello pebbles!'\n *\n * // Use backslashes to treat delimiters as plain text.\n * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n * compiled({ 'value': 'ignored' });\n * // => '<%- value %>'\n *\n * // Use the `imports` option to import `jQuery` as `jq`.\n * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n * compiled(data);\n * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n *\n * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n * compiled.source;\n * // => function(data) {\n * // var __t, __p = '';\n * // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n * // return __p;\n * // }\n *\n * // Use custom template delimiters.\n * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n * var compiled = _.template('hello {{ user }}!');\n * compiled({ 'user': 'mustache' });\n * // => 'hello mustache!'\n *\n * // Use the `source` property to inline compiled templates for meaningful\n * // line numbers in error messages and stack traces.\n * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n * var JST = {\\\n * \"main\": ' + _.template(mainText).source + '\\\n * };\\\n * ');\n */\n function template(string, options, guard) {\n // Based on John Resig's `tmpl` implementation\n // (http://ejohn.org/blog/javascript-micro-templating/)\n // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n var settings = lodash.templateSettings;\n\n if (guard && isIterateeCall(string, options, guard)) {\n options = undefined;\n }\n string = toString(string);\n options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n importsKeys = keys(imports),\n importsValues = baseValues(imports, importsKeys);\n\n var isEscaping,\n isEvaluating,\n index = 0,\n interpolate = options.interpolate || reNoMatch,\n source = \"__p += '\";\n\n // Compile the regexp to match each delimiter.\n var reDelimiters = RegExp(\n (options.escape || reNoMatch).source + '|' +\n interpolate.source + '|' +\n (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n (options.evaluate || reNoMatch).source + '|$'\n , 'g');\n\n // Use a sourceURL for easier debugging.\n // The sourceURL gets injected into the source that's eval-ed, so be careful\n // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n // and escape the comment, thus injecting code that gets evaled.\n var sourceURL = '//# sourceURL=' +\n (hasOwnProperty.call(options, 'sourceURL')\n ? (options.sourceURL + '').replace(/\\s/g, ' ')\n : ('lodash.templateSources[' + (++templateCounter) + ']')\n ) + '\\n';\n\n string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n interpolateValue || (interpolateValue = esTemplateValue);\n\n // Escape characters that can't be included in string literals.\n source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n // Replace delimiters with snippets.\n if (escapeValue) {\n isEscaping = true;\n source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n }\n if (evaluateValue) {\n isEvaluating = true;\n source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n }\n if (interpolateValue) {\n source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n }\n index = offset + match.length;\n\n // The JS engine embedded in Adobe products needs `match` returned in\n // order to produce the correct `offset` value.\n return match;\n });\n\n source += \"';\\n\";\n\n // If `variable` is not specified wrap a with-statement around the generated\n // code to add the data object to the top of the scope chain.\n var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n if (!variable) {\n source = 'with (obj) {\\n' + source + '\\n}\\n';\n }\n // Throw an error if a forbidden character was found in `variable`, to prevent\n // potential command injection attacks.\n else if (reForbiddenIdentifierChars.test(variable)) {\n throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n }\n\n // Cleanup code by stripping empty strings.\n source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n .replace(reEmptyStringMiddle, '$1')\n .replace(reEmptyStringTrailing, '$1;');\n\n // Frame code as the function body.\n source = 'function(' + (variable || 'obj') + ') {\\n' +\n (variable\n ? ''\n : 'obj || (obj = {});\\n'\n ) +\n \"var __t, __p = ''\" +\n (isEscaping\n ? ', __e = _.escape'\n : ''\n ) +\n (isEvaluating\n ? ', __j = Array.prototype.join;\\n' +\n \"function print() { __p += __j.call(arguments, '') }\\n\"\n : ';\\n'\n ) +\n source +\n 'return __p\\n}';\n\n var result = attempt(function() {\n return Function(importsKeys, sourceURL + 'return ' + source)\n .apply(undefined, importsValues);\n });\n\n // Provide the compiled function's source by its `toString` method or\n // the `source` property as a convenience for inlining compiled templates.\n result.source = source;\n if (isError(result)) {\n throw result;\n }\n return result;\n }\n\n /**\n * Converts `string`, as a whole, to lower case just like\n * [String#toLowerCase](https://mdn.io/toLowerCase).\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 lower cased string.\n * @example\n *\n * _.toLower('--Foo-Bar--');\n * // => '--foo-bar--'\n *\n * _.toLower('fooBar');\n * // => 'foobar'\n *\n * _.toLower('__FOO_BAR__');\n * // => '__foo_bar__'\n */\n function toLower(value) {\n return toString(value).toLowerCase();\n }\n\n /**\n * Converts `string`, as a whole, to upper case just like\n * [String#toUpperCase](https://mdn.io/toUpperCase).\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 upper cased string.\n * @example\n *\n * _.toUpper('--foo-bar--');\n * // => '--FOO-BAR--'\n *\n * _.toUpper('fooBar');\n * // => 'FOOBAR'\n *\n * _.toUpper('__foo_bar__');\n * // => '__FOO_BAR__'\n */\n function toUpper(value) {\n return toString(value).toUpperCase();\n }\n\n /**\n * Removes leading and trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trim(' abc ');\n * // => 'abc'\n *\n * _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n *\n * _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n */\n function trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return baseTrim(string);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n }\n\n /**\n * Removes trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimEnd(' abc ');\n * // => ' abc'\n *\n * _.trimEnd('-_-abc-_-', '_-');\n * // => '-_-abc'\n */\n function trimEnd(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.slice(0, trimmedEndIndex(string) + 1);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n return castSlice(strSymbols, 0, end).join('');\n }\n\n /**\n * Removes leading whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimStart(' abc ');\n * // => 'abc '\n *\n * _.trimStart('-_-abc-_-', '_-');\n * // => 'abc-_-'\n */\n function trimStart(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.replace(reTrimStart, '');\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n start = charsStartIndex(strSymbols, stringToArray(chars));\n\n return castSlice(strSymbols, start).join('');\n }\n\n /**\n * Truncates `string` if it's longer than the given maximum string length.\n * The last characters of the truncated string are replaced with the omission\n * string which defaults to \"...\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to truncate.\n * @param {Object} [options={}] The options object.\n * @param {number} [options.length=30] The maximum string length.\n * @param {string} [options.omission='...'] The string to indicate text is omitted.\n * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n * @returns {string} Returns the truncated string.\n * @example\n *\n * _.truncate('hi-diddly-ho there, neighborino');\n * // => 'hi-diddly-ho there, neighbo...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': ' '\n * });\n * // => 'hi-diddly-ho there,...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': /,? +/\n * });\n * // => 'hi-diddly-ho there...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'omission': ' [...]'\n * });\n * // => 'hi-diddly-ho there, neig [...]'\n */\n function truncate(string, options) {\n var length = DEFAULT_TRUNC_LENGTH,\n omission = DEFAULT_TRUNC_OMISSION;\n\n if (isObject(options)) {\n var separator = 'separator' in options ? options.separator : separator;\n length = 'length' in options ? toInteger(options.length) : length;\n omission = 'omission' in options ? baseToString(options.omission) : omission;\n }\n string = toString(string);\n\n var strLength = string.length;\n if (hasUnicode(string)) {\n var strSymbols = stringToArray(string);\n strLength = strSymbols.length;\n }\n if (length >= strLength) {\n return string;\n }\n var end = length - stringSize(omission);\n if (end < 1) {\n return omission;\n }\n var result = strSymbols\n ? castSlice(strSymbols, 0, end).join('')\n : string.slice(0, end);\n\n if (separator === undefined) {\n return result + omission;\n }\n if (strSymbols) {\n end += (result.length - end);\n }\n if (isRegExp(separator)) {\n if (string.slice(end).search(separator)) {\n var match,\n substring = result;\n\n if (!separator.global) {\n separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n }\n separator.lastIndex = 0;\n while ((match = separator.exec(substring))) {\n var newEnd = match.index;\n }\n result = result.slice(0, newEnd === undefined ? end : newEnd);\n }\n } else if (string.indexOf(baseToString(separator), end) != end) {\n var index = result.lastIndexOf(separator);\n if (index > -1) {\n result = result.slice(0, index);\n }\n }\n return result + omission;\n }\n\n /**\n * The inverse of `_.escape`; this method converts the HTML entities\n * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n * their corresponding characters.\n *\n * **Note:** No other HTML entities are unescaped. To unescape additional\n * HTML entities use a third-party library like [_he_](https://mths.be/he).\n *\n * @static\n * @memberOf _\n * @since 0.6.0\n * @category String\n * @param {string} [string=''] The string to unescape.\n * @returns {string} Returns the unescaped string.\n * @example\n *\n * _.unescape('fred, barney, &amp; pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function unescape(string) {\n string = toString(string);\n return (string && reHasEscapedHtml.test(string))\n ? string.replace(reEscapedHtml, unescapeHtmlChar)\n : string;\n }\n\n /**\n * Converts `string`, as space separated words, 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 upper cased string.\n * @example\n *\n * _.upperCase('--foo-bar');\n * // => 'FOO BAR'\n *\n * _.upperCase('fooBar');\n * // => 'FOO BAR'\n *\n * _.upperCase('__foo_bar__');\n * // => 'FOO BAR'\n */\n var upperCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toUpperCase();\n });\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 */\n var upperFirst = createCaseFirst('toUpperCase');\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 */\n function 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\n /*------------------------------------------------------------------------*/\n\n /**\n * Attempts to invoke `func`, returning either the result or the caught error\n * object. Any additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Function} func The function to attempt.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {*} Returns the `func` result or error object.\n * @example\n *\n * // Avoid throwing errors for invalid selectors.\n * var elements = _.attempt(function(selector) {\n * return document.querySelectorAll(selector);\n * }, '>_>');\n *\n * if (_.isError(elements)) {\n * elements = [];\n * }\n */\n var attempt = baseRest(function(func, args) {\n try {\n return apply(func, undefined, args);\n } catch (e) {\n return isError(e) ? e : new Error(e);\n }\n });\n\n /**\n * Binds methods of an object to the object itself, overwriting the existing\n * method.\n *\n * **Note:** This method doesn't set the \"length\" property of bound functions.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Object} object The object to bind and assign the bound methods to.\n * @param {...(string|string[])} methodNames The object method names to bind.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var view = {\n * 'label': 'docs',\n * 'click': function() {\n * console.log('clicked ' + this.label);\n * }\n * };\n *\n * _.bindAll(view, ['click']);\n * jQuery(element).on('click', view.click);\n * // => Logs 'clicked docs' when clicked.\n */\n var bindAll = flatRest(function(object, methodNames) {\n arrayEach(methodNames, function(key) {\n key = toKey(key);\n baseAssignValue(object, key, bind(object[key], object));\n });\n return object;\n });\n\n /**\n * Creates a function that iterates over `pairs` and invokes the corresponding\n * function of the first predicate to return truthy. The predicate-function\n * pairs are invoked with the `this` binding and arguments of the created\n * function.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Array} pairs The predicate-function pairs.\n * @returns {Function} Returns the new composite function.\n * @example\n *\n * var func = _.cond([\n * [_.matches({ 'a': 1 }), _.constant('matches A')],\n * [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n * [_.stubTrue, _.constant('no match')]\n * ]);\n *\n * func({ 'a': 1, 'b': 2 });\n * // => 'matches A'\n *\n * func({ 'a': 0, 'b': 1 });\n * // => 'matches B'\n *\n * func({ 'a': '1', 'b': '2' });\n * // => 'no match'\n */\n function cond(pairs) {\n var length = pairs == null ? 0 : pairs.length,\n toIteratee = getIteratee();\n\n pairs = !length ? [] : arrayMap(pairs, function(pair) {\n if (typeof pair[1] != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return [toIteratee(pair[0]), pair[1]];\n });\n\n return baseRest(function(args) {\n var index = -1;\n while (++index < length) {\n var pair = pairs[index];\n if (apply(pair[0], this, args)) {\n return apply(pair[1], this, args);\n }\n }\n });\n }\n\n /**\n * Creates a function that invokes the predicate properties of `source` with\n * the corresponding property values of a given object, returning `true` if\n * all predicates return truthy, else `false`.\n *\n * **Note:** The created function is equivalent to `_.conformsTo` with\n * `source` partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 2, 'b': 1 },\n * { 'a': 1, 'b': 2 }\n * ];\n *\n * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n * // => [{ 'a': 1, 'b': 2 }]\n */\n function conforms(source) {\n return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n }\n\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 */\n function constant(value) {\n return function() {\n return value;\n };\n }\n\n /**\n * Checks `value` to determine whether a default value should be returned in\n * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n * or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Util\n * @param {*} value The value to check.\n * @param {*} defaultValue The default value.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * _.defaultTo(1, 10);\n * // => 1\n *\n * _.defaultTo(undefined, 10);\n * // => 10\n */\n function defaultTo(value, defaultValue) {\n return (value == null || value !== value) ? defaultValue : value;\n }\n\n /**\n * Creates a function that returns the result of invoking the given functions\n * with the `this` binding of the created function, where each successive\n * invocation is supplied the return value of the previous.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flowRight\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flow([_.add, square]);\n * addSquare(1, 2);\n * // => 9\n */\n var flow = createFlow();\n\n /**\n * This method is like `_.flow` except that it creates a function that\n * invokes the given functions from right to left.\n *\n * @static\n * @since 3.0.0\n * @memberOf _\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flow\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flowRight([square, _.add]);\n * addSquare(1, 2);\n * // => 9\n */\n var flowRight = createFlow(true);\n\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 */\n function identity(value) {\n return value;\n }\n\n /**\n * Creates a function that invokes `func` with the arguments of the created\n * function. If `func` is a property name, the created function returns the\n * property value for a given element. If `func` is an array or object, the\n * created function returns `true` for elements that contain the equivalent\n * source properties, otherwise it returns `false`.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Util\n * @param {*} [func=_.identity] The value to convert to a callback.\n * @returns {Function} Returns the callback.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, _.iteratee(['user', 'fred']));\n * // => [{ 'user': 'fred', 'age': 40 }]\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, _.iteratee('user'));\n * // => ['barney', 'fred']\n *\n * // Create custom iteratee shorthands.\n * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n * return !_.isRegExp(func) ? iteratee(func) : function(string) {\n * return func.test(string);\n * };\n * });\n *\n * _.filter(['abc', 'def'], /ef/);\n * // => ['def']\n */\n function iteratee(func) {\n return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between a given\n * object and `source`, returning `true` if the given object has equivalent\n * property values, else `false`.\n *\n * **Note:** The created function is equivalent to `_.isMatch` with `source`\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matches(source) {\n return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between the\n * value at `path` of a given object to `srcValue`, returning `true` if the\n * object value is equivalent, else `false`.\n *\n * **Note:** Partial comparisons will match empty array and empty object\n * `srcValue` values against any array or object value, respectively. See\n * `_.isEqual` for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Util\n * @param {Array|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 * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.find(objects, _.matchesProperty('a', 4));\n * // => { 'a': 4, 'b': 5, 'c': 6 }\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matchesProperty(path, srcValue) {\n return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that invokes the method at `path` of a given object.\n * Any additional arguments are provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': _.constant(2) } },\n * { 'a': { 'b': _.constant(1) } }\n * ];\n *\n * _.map(objects, _.method('a.b'));\n * // => [2, 1]\n *\n * _.map(objects, _.method(['a', 'b']));\n * // => [2, 1]\n */\n var method = baseRest(function(path, args) {\n return function(object) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * The opposite of `_.method`; this method creates a function that invokes\n * the method at a given path of `object`. Any additional arguments are\n * provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Object} object The object to query.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var array = _.times(3, _.constant),\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n * // => [2, 0]\n */\n var methodOf = baseRest(function(object, args) {\n return function(path) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * Adds all own enumerable string keyed function properties of a source\n * object to the destination object. If `object` is a function, then methods\n * are added to its prototype as well.\n *\n * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n * avoid conflicts caused by modifying the original.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Function|Object} [object=lodash] The destination object.\n * @param {Object} source The object of functions to add.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n * @returns {Function|Object} Returns `object`.\n * @example\n *\n * function vowels(string) {\n * return _.filter(string, function(v) {\n * return /[aeiou]/i.test(v);\n * });\n * }\n *\n * _.mixin({ 'vowels': vowels });\n * _.vowels('fred');\n * // => ['e']\n *\n * _('fred').vowels().value();\n * // => ['e']\n *\n * _.mixin({ 'vowels': vowels }, { 'chain': false });\n * _('fred').vowels();\n * // => ['e']\n */\n function mixin(object, source, options) {\n var props = keys(source),\n methodNames = baseFunctions(source, props);\n\n if (options == null &&\n !(isObject(source) && (methodNames.length || !props.length))) {\n options = source;\n source = object;\n object = this;\n methodNames = baseFunctions(source, keys(source));\n }\n var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n isFunc = isFunction(object);\n\n arrayEach(methodNames, function(methodName) {\n var func = source[methodName];\n object[methodName] = func;\n if (isFunc) {\n object.prototype[methodName] = function() {\n var chainAll = this.__chain__;\n if (chain || chainAll) {\n var result = object(this.__wrapped__),\n actions = result.__actions__ = copyArray(this.__actions__);\n\n actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n result.__chain__ = chainAll;\n return result;\n }\n return func.apply(object, arrayPush([this.value()], arguments));\n };\n }\n });\n\n return object;\n }\n\n /**\n * Reverts the `_` variable to its previous value and returns a reference to\n * the `lodash` function.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @returns {Function} Returns the `lodash` function.\n * @example\n *\n * var lodash = _.noConflict();\n */\n function noConflict() {\n if (root._ === this) {\n root._ = oldDash;\n }\n return this;\n }\n\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 */\n function noop() {\n // No operation performed.\n }\n\n /**\n * Creates a function that gets the argument at index `n`. If `n` is negative,\n * the nth argument from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [n=0] The index of the argument to return.\n * @returns {Function} Returns the new pass-thru function.\n * @example\n *\n * var func = _.nthArg(1);\n * func('a', 'b', 'c', 'd');\n * // => 'b'\n *\n * var func = _.nthArg(-2);\n * func('a', 'b', 'c', 'd');\n * // => 'c'\n */\n function nthArg(n) {\n n = toInteger(n);\n return baseRest(function(args) {\n return baseNth(args, n);\n });\n }\n\n /**\n * Creates a function that invokes `iteratees` with the arguments it receives\n * and returns their results.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to invoke.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.over([Math.max, Math.min]);\n *\n * func(1, 2, 3, 4);\n * // => [4, 1]\n */\n var over = createOver(arrayMap);\n\n /**\n * Creates a function that checks if **all** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overEvery([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => false\n *\n * func(NaN);\n * // => false\n */\n var overEvery = createOver(arrayEvery);\n\n /**\n * Creates a function that checks if **any** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overSome([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => true\n *\n * func(NaN);\n * // => false\n *\n * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n */\n var overSome = createOver(arraySome);\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 */\n function property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n }\n\n /**\n * The opposite of `_.property`; this method creates a function that returns\n * the value at a given path of `object`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var array = [0, 1, 2],\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n * // => [2, 0]\n */\n function propertyOf(object) {\n return function(path) {\n return object == null ? undefined : baseGet(object, path);\n };\n }\n\n /**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\n var range = createRange();\n\n /**\n * This method is like `_.range` except that it populates values in\n * descending order.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.range\n * @example\n *\n * _.rangeRight(4);\n * // => [3, 2, 1, 0]\n *\n * _.rangeRight(-4);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 5);\n * // => [4, 3, 2, 1]\n *\n * _.rangeRight(0, 20, 5);\n * // => [15, 10, 5, 0]\n *\n * _.rangeRight(0, -4, -1);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.rangeRight(0);\n * // => []\n */\n var rangeRight = createRange(true);\n\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 */\n function stubArray() {\n return [];\n }\n\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 */\n function stubFalse() {\n return false;\n }\n\n /**\n * This method returns a new empty object.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Object} Returns the new empty object.\n * @example\n *\n * var objects = _.times(2, _.stubObject);\n *\n * console.log(objects);\n * // => [{}, {}]\n *\n * console.log(objects[0] === objects[1]);\n * // => false\n */\n function stubObject() {\n return {};\n }\n\n /**\n * This method returns an empty string.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {string} Returns the empty string.\n * @example\n *\n * _.times(2, _.stubString);\n * // => ['', '']\n */\n function stubString() {\n return '';\n }\n\n /**\n * This method returns `true`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `true`.\n * @example\n *\n * _.times(2, _.stubTrue);\n * // => [true, true]\n */\n function stubTrue() {\n return true;\n }\n\n /**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n * _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\n function times(n, iteratee) {\n n = toInteger(n);\n if (n < 1 || n > MAX_SAFE_INTEGER) {\n return [];\n }\n var index = MAX_ARRAY_LENGTH,\n length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n iteratee = getIteratee(iteratee);\n n -= MAX_ARRAY_LENGTH;\n\n var result = baseTimes(length, iteratee);\n while (++index < n) {\n iteratee(index);\n }\n return result;\n }\n\n /**\n * Converts `value` to a property path array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {*} value The value to convert.\n * @returns {Array} Returns the new property path array.\n * @example\n *\n * _.toPath('a.b.c');\n * // => ['a', 'b', 'c']\n *\n * _.toPath('a[0].b.c');\n * // => ['a', '0', 'b', 'c']\n */\n function toPath(value) {\n if (isArray(value)) {\n return arrayMap(value, toKey);\n }\n return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n }\n\n /**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\n function uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Adds two numbers.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {number} augend The first number in an addition.\n * @param {number} addend The second number in an addition.\n * @returns {number} Returns the total.\n * @example\n *\n * _.add(6, 4);\n * // => 10\n */\n var add = createMathOperation(function(augend, addend) {\n return augend + addend;\n }, 0);\n\n /**\n * Computes `number` rounded up to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round up.\n * @param {number} [precision=0] The precision to round up to.\n * @returns {number} Returns the rounded up number.\n * @example\n *\n * _.ceil(4.006);\n * // => 5\n *\n * _.ceil(6.004, 2);\n * // => 6.01\n *\n * _.ceil(6040, -2);\n * // => 6100\n */\n var ceil = createRound('ceil');\n\n /**\n * Divide two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} dividend The first number in a division.\n * @param {number} divisor The second number in a division.\n * @returns {number} Returns the quotient.\n * @example\n *\n * _.divide(6, 4);\n * // => 1.5\n */\n var divide = createMathOperation(function(dividend, divisor) {\n return dividend / divisor;\n }, 1);\n\n /**\n * Computes `number` rounded down to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round down.\n * @param {number} [precision=0] The precision to round down to.\n * @returns {number} Returns the rounded down number.\n * @example\n *\n * _.floor(4.006);\n * // => 4\n *\n * _.floor(0.046, 2);\n * // => 0.04\n *\n * _.floor(4060, -2);\n * // => 4000\n */\n var floor = createRound('floor');\n\n /**\n * Computes the maximum 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 maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\n function max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n }\n\n /**\n * This method is like `_.max` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.maxBy(objects, function(o) { return o.n; });\n * // => { 'n': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.maxBy(objects, 'n');\n * // => { 'n': 2 }\n */\n function maxBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n : undefined;\n }\n\n /**\n * Computes the mean of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the mean.\n * @example\n *\n * _.mean([4, 2, 8, 6]);\n * // => 5\n */\n function mean(array) {\n return baseMean(array, identity);\n }\n\n /**\n * This method is like `_.mean` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be averaged.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the mean.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.meanBy(objects, function(o) { return o.n; });\n * // => 5\n *\n * // The `_.property` iteratee shorthand.\n * _.meanBy(objects, 'n');\n * // => 5\n */\n function meanBy(array, iteratee) {\n return baseMean(array, getIteratee(iteratee, 2));\n }\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 */\n function min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n }\n\n /**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\n function minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n : undefined;\n }\n\n /**\n * Multiply two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} multiplier The first number in a multiplication.\n * @param {number} multiplicand The second number in a multiplication.\n * @returns {number} Returns the product.\n * @example\n *\n * _.multiply(6, 4);\n * // => 24\n */\n var multiply = createMathOperation(function(multiplier, multiplicand) {\n return multiplier * multiplicand;\n }, 1);\n\n /**\n * Computes `number` rounded to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round.\n * @param {number} [precision=0] The precision to round to.\n * @returns {number} Returns the rounded number.\n * @example\n *\n * _.round(4.006);\n * // => 4\n *\n * _.round(4.006, 2);\n * // => 4.01\n *\n * _.round(4060, -2);\n * // => 4100\n */\n var round = createRound('round');\n\n /**\n * Subtract two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {number} minuend The first number in a subtraction.\n * @param {number} subtrahend The second number in a subtraction.\n * @returns {number} Returns the difference.\n * @example\n *\n * _.subtract(6, 4);\n * // => 2\n */\n var subtract = createMathOperation(function(minuend, subtrahend) {\n return minuend - subtrahend;\n }, 0);\n\n /**\n * Computes the sum of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the sum.\n * @example\n *\n * _.sum([4, 2, 8, 6]);\n * // => 20\n */\n function sum(array) {\n return (array && array.length)\n ? baseSum(array, identity)\n : 0;\n }\n\n /**\n * This method is like `_.sum` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be summed.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the sum.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.sumBy(objects, function(o) { return o.n; });\n * // => 20\n *\n * // The `_.property` iteratee shorthand.\n * _.sumBy(objects, 'n');\n * // => 20\n */\n function sumBy(array, iteratee) {\n return (array && array.length)\n ? baseSum(array, getIteratee(iteratee, 2))\n : 0;\n }\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return wrapped values in chain sequences.\n lodash.after = after;\n lodash.ary = ary;\n lodash.assign = assign;\n lodash.assignIn = assignIn;\n lodash.assignInWith = assignInWith;\n lodash.assignWith = assignWith;\n lodash.at = at;\n lodash.before = before;\n lodash.bind = bind;\n lodash.bindAll = bindAll;\n lodash.bindKey = bindKey;\n lodash.castArray = castArray;\n lodash.chain = chain;\n lodash.chunk = chunk;\n lodash.compact = compact;\n lodash.concat = concat;\n lodash.cond = cond;\n lodash.conforms = conforms;\n lodash.constant = constant;\n lodash.countBy = countBy;\n lodash.create = create;\n lodash.curry = curry;\n lodash.curryRight = curryRight;\n lodash.debounce = debounce;\n lodash.defaults = defaults;\n lodash.defaultsDeep = defaultsDeep;\n lodash.defer = defer;\n lodash.delay = delay;\n lodash.difference = difference;\n lodash.differenceBy = differenceBy;\n lodash.differenceWith = differenceWith;\n lodash.drop = drop;\n lodash.dropRight = dropRight;\n lodash.dropRightWhile = dropRightWhile;\n lodash.dropWhile = dropWhile;\n lodash.fill = fill;\n lodash.filter = filter;\n lodash.flatMap = flatMap;\n lodash.flatMapDeep = flatMapDeep;\n lodash.flatMapDepth = flatMapDepth;\n lodash.flatten = flatten;\n lodash.flattenDeep = flattenDeep;\n lodash.flattenDepth = flattenDepth;\n lodash.flip = flip;\n lodash.flow = flow;\n lodash.flowRight = flowRight;\n lodash.fromPairs = fromPairs;\n lodash.functions = functions;\n lodash.functionsIn = functionsIn;\n lodash.groupBy = groupBy;\n lodash.initial = initial;\n lodash.intersection = intersection;\n lodash.intersectionBy = intersectionBy;\n lodash.intersectionWith = intersectionWith;\n lodash.invert = invert;\n lodash.invertBy = invertBy;\n lodash.invokeMap = invokeMap;\n lodash.iteratee = iteratee;\n lodash.keyBy = keyBy;\n lodash.keys = keys;\n lodash.keysIn = keysIn;\n lodash.map = map;\n lodash.mapKeys = mapKeys;\n lodash.mapValues = mapValues;\n lodash.matches = matches;\n lodash.matchesProperty = matchesProperty;\n lodash.memoize = memoize;\n lodash.merge = merge;\n lodash.mergeWith = mergeWith;\n lodash.method = method;\n lodash.methodOf = methodOf;\n lodash.mixin = mixin;\n lodash.negate = negate;\n lodash.nthArg = nthArg;\n lodash.omit = omit;\n lodash.omitBy = omitBy;\n lodash.once = once;\n lodash.orderBy = orderBy;\n lodash.over = over;\n lodash.overArgs = overArgs;\n lodash.overEvery = overEvery;\n lodash.overSome = overSome;\n lodash.partial = partial;\n lodash.partialRight = partialRight;\n lodash.partition = partition;\n lodash.pick = pick;\n lodash.pickBy = pickBy;\n lodash.property = property;\n lodash.propertyOf = propertyOf;\n lodash.pull = pull;\n lodash.pullAll = pullAll;\n lodash.pullAllBy = pullAllBy;\n lodash.pullAllWith = pullAllWith;\n lodash.pullAt = pullAt;\n lodash.range = range;\n lodash.rangeRight = rangeRight;\n lodash.rearg = rearg;\n lodash.reject = reject;\n lodash.remove = remove;\n lodash.rest = rest;\n lodash.reverse = reverse;\n lodash.sampleSize = sampleSize;\n lodash.set = set;\n lodash.setWith = setWith;\n lodash.shuffle = shuffle;\n lodash.slice = slice;\n lodash.sortBy = sortBy;\n lodash.sortedUniq = sortedUniq;\n lodash.sortedUniqBy = sortedUniqBy;\n lodash.split = split;\n lodash.spread = spread;\n lodash.tail = tail;\n lodash.take = take;\n lodash.takeRight = takeRight;\n lodash.takeRightWhile = takeRightWhile;\n lodash.takeWhile = takeWhile;\n lodash.tap = tap;\n lodash.throttle = throttle;\n lodash.thru = thru;\n lodash.toArray = toArray;\n lodash.toPairs = toPairs;\n lodash.toPairsIn = toPairsIn;\n lodash.toPath = toPath;\n lodash.toPlainObject = toPlainObject;\n lodash.transform = transform;\n lodash.unary = unary;\n lodash.union = union;\n lodash.unionBy = unionBy;\n lodash.unionWith = unionWith;\n lodash.uniq = uniq;\n lodash.uniqBy = uniqBy;\n lodash.uniqWith = uniqWith;\n lodash.unset = unset;\n lodash.unzip = unzip;\n lodash.unzipWith = unzipWith;\n lodash.update = update;\n lodash.updateWith = updateWith;\n lodash.values = values;\n lodash.valuesIn = valuesIn;\n lodash.without = without;\n lodash.words = words;\n lodash.wrap = wrap;\n lodash.xor = xor;\n lodash.xorBy = xorBy;\n lodash.xorWith = xorWith;\n lodash.zip = zip;\n lodash.zipObject = zipObject;\n lodash.zipObjectDeep = zipObjectDeep;\n lodash.zipWith = zipWith;\n\n // Add aliases.\n lodash.entries = toPairs;\n lodash.entriesIn = toPairsIn;\n lodash.extend = assignIn;\n lodash.extendWith = assignInWith;\n\n // Add methods to `lodash.prototype`.\n mixin(lodash, lodash);\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return unwrapped values in chain sequences.\n lodash.add = add;\n lodash.attempt = attempt;\n lodash.camelCase = camelCase;\n lodash.capitalize = capitalize;\n lodash.ceil = ceil;\n lodash.clamp = clamp;\n lodash.clone = clone;\n lodash.cloneDeep = cloneDeep;\n lodash.cloneDeepWith = cloneDeepWith;\n lodash.cloneWith = cloneWith;\n lodash.conformsTo = conformsTo;\n lodash.deburr = deburr;\n lodash.defaultTo = defaultTo;\n lodash.divide = divide;\n lodash.endsWith = endsWith;\n lodash.eq = eq;\n lodash.escape = escape;\n lodash.escapeRegExp = escapeRegExp;\n lodash.every = every;\n lodash.find = find;\n lodash.findIndex = findIndex;\n lodash.findKey = findKey;\n lodash.findLast = findLast;\n lodash.findLastIndex = findLastIndex;\n lodash.findLastKey = findLastKey;\n lodash.floor = floor;\n lodash.forEach = forEach;\n lodash.forEachRight = forEachRight;\n lodash.forIn = forIn;\n lodash.forInRight = forInRight;\n lodash.forOwn = forOwn;\n lodash.forOwnRight = forOwnRight;\n lodash.get = get;\n lodash.gt = gt;\n lodash.gte = gte;\n lodash.has = has;\n lodash.hasIn = hasIn;\n lodash.head = head;\n lodash.identity = identity;\n lodash.includes = includes;\n lodash.indexOf = indexOf;\n lodash.inRange = inRange;\n lodash.invoke = invoke;\n lodash.isArguments = isArguments;\n lodash.isArray = isArray;\n lodash.isArrayBuffer = isArrayBuffer;\n lodash.isArrayLike = isArrayLike;\n lodash.isArrayLikeObject = isArrayLikeObject;\n lodash.isBoolean = isBoolean;\n lodash.isBuffer = isBuffer;\n lodash.isDate = isDate;\n lodash.isElement = isElement;\n lodash.isEmpty = isEmpty;\n lodash.isEqual = isEqual;\n lodash.isEqualWith = isEqualWith;\n lodash.isError = isError;\n lodash.isFinite = isFinite;\n lodash.isFunction = isFunction;\n lodash.isInteger = isInteger;\n lodash.isLength = isLength;\n lodash.isMap = isMap;\n lodash.isMatch = isMatch;\n lodash.isMatchWith = isMatchWith;\n lodash.isNaN = isNaN;\n lodash.isNative = isNative;\n lodash.isNil = isNil;\n lodash.isNull = isNull;\n lodash.isNumber = isNumber;\n lodash.isObject = isObject;\n lodash.isObjectLike = isObjectLike;\n lodash.isPlainObject = isPlainObject;\n lodash.isRegExp = isRegExp;\n lodash.isSafeInteger = isSafeInteger;\n lodash.isSet = isSet;\n lodash.isString = isString;\n lodash.isSymbol = isSymbol;\n lodash.isTypedArray = isTypedArray;\n lodash.isUndefined = isUndefined;\n lodash.isWeakMap = isWeakMap;\n lodash.isWeakSet = isWeakSet;\n lodash.join = join;\n lodash.kebabCase = kebabCase;\n lodash.last = last;\n lodash.lastIndexOf = lastIndexOf;\n lodash.lowerCase = lowerCase;\n lodash.lowerFirst = lowerFirst;\n lodash.lt = lt;\n lodash.lte = lte;\n lodash.max = max;\n lodash.maxBy = maxBy;\n lodash.mean = mean;\n lodash.meanBy = meanBy;\n lodash.min = min;\n lodash.minBy = minBy;\n lodash.stubArray = stubArray;\n lodash.stubFalse = stubFalse;\n lodash.stubObject = stubObject;\n lodash.stubString = stubString;\n lodash.stubTrue = stubTrue;\n lodash.multiply = multiply;\n lodash.nth = nth;\n lodash.noConflict = noConflict;\n lodash.noop = noop;\n lodash.now = now;\n lodash.pad = pad;\n lodash.padEnd = padEnd;\n lodash.padStart = padStart;\n lodash.parseInt = parseInt;\n lodash.random = random;\n lodash.reduce = reduce;\n lodash.reduceRight = reduceRight;\n lodash.repeat = repeat;\n lodash.replace = replace;\n lodash.result = result;\n lodash.round = round;\n lodash.runInContext = runInContext;\n lodash.sample = sample;\n lodash.size = size;\n lodash.snakeCase = snakeCase;\n lodash.some = some;\n lodash.sortedIndex = sortedIndex;\n lodash.sortedIndexBy = sortedIndexBy;\n lodash.sortedIndexOf = sortedIndexOf;\n lodash.sortedLastIndex = sortedLastIndex;\n lodash.sortedLastIndexBy = sortedLastIndexBy;\n lodash.sortedLastIndexOf = sortedLastIndexOf;\n lodash.startCase = startCase;\n lodash.startsWith = startsWith;\n lodash.subtract = subtract;\n lodash.sum = sum;\n lodash.sumBy = sumBy;\n lodash.template = template;\n lodash.times = times;\n lodash.toFinite = toFinite;\n lodash.toInteger = toInteger;\n lodash.toLength = toLength;\n lodash.toLower = toLower;\n lodash.toNumber = toNumber;\n lodash.toSafeInteger = toSafeInteger;\n lodash.toString = toString;\n lodash.toUpper = toUpper;\n lodash.trim = trim;\n lodash.trimEnd = trimEnd;\n lodash.trimStart = trimStart;\n lodash.truncate = truncate;\n lodash.unescape = unescape;\n lodash.uniqueId = uniqueId;\n lodash.upperCase = upperCase;\n lodash.upperFirst = upperFirst;\n\n // Add aliases.\n lodash.each = forEach;\n lodash.eachRight = forEachRight;\n lodash.first = head;\n\n mixin(lodash, (function() {\n var source = {};\n baseForOwn(lodash, function(func, methodName) {\n if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n source[methodName] = func;\n }\n });\n return source;\n }()), { 'chain': false });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The semantic version number.\n *\n * @static\n * @memberOf _\n * @type {string}\n */\n lodash.VERSION = VERSION;\n\n // Assign default placeholders.\n arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n lodash[methodName].placeholder = lodash;\n });\n\n // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n arrayEach(['drop', 'take'], function(methodName, index) {\n LazyWrapper.prototype[methodName] = function(n) {\n n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n var result = (this.__filtered__ && !index)\n ? new LazyWrapper(this)\n : this.clone();\n\n if (result.__filtered__) {\n result.__takeCount__ = nativeMin(n, result.__takeCount__);\n } else {\n result.__views__.push({\n 'size': nativeMin(n, MAX_ARRAY_LENGTH),\n 'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n });\n }\n return result;\n };\n\n LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n return this.reverse()[methodName](n).reverse();\n };\n });\n\n // Add `LazyWrapper` methods that accept an `iteratee` value.\n arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n var type = index + 1,\n isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n LazyWrapper.prototype[methodName] = function(iteratee) {\n var result = this.clone();\n result.__iteratees__.push({\n 'iteratee': getIteratee(iteratee, 3),\n 'type': type\n });\n result.__filtered__ = result.__filtered__ || isFilter;\n return result;\n };\n });\n\n // Add `LazyWrapper` methods for `_.head` and `_.last`.\n arrayEach(['head', 'last'], function(methodName, index) {\n var takeName = 'take' + (index ? 'Right' : '');\n\n LazyWrapper.prototype[methodName] = function() {\n return this[takeName](1).value()[0];\n };\n });\n\n // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n arrayEach(['initial', 'tail'], function(methodName, index) {\n var dropName = 'drop' + (index ? '' : 'Right');\n\n LazyWrapper.prototype[methodName] = function() {\n return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n };\n });\n\n LazyWrapper.prototype.compact = function() {\n return this.filter(identity);\n };\n\n LazyWrapper.prototype.find = function(predicate) {\n return this.filter(predicate).head();\n };\n\n LazyWrapper.prototype.findLast = function(predicate) {\n return this.reverse().find(predicate);\n };\n\n LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n if (typeof path == 'function') {\n return new LazyWrapper(this);\n }\n return this.map(function(value) {\n return baseInvoke(value, path, args);\n });\n });\n\n LazyWrapper.prototype.reject = function(predicate) {\n return this.filter(negate(getIteratee(predicate)));\n };\n\n LazyWrapper.prototype.slice = function(start, end) {\n start = toInteger(start);\n\n var result = this;\n if (result.__filtered__ && (start > 0 || end < 0)) {\n return new LazyWrapper(result);\n }\n if (start < 0) {\n result = result.takeRight(-start);\n } else if (start) {\n result = result.drop(start);\n }\n if (end !== undefined) {\n end = toInteger(end);\n result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n }\n return result;\n };\n\n LazyWrapper.prototype.takeRightWhile = function(predicate) {\n return this.reverse().takeWhile(predicate).reverse();\n };\n\n LazyWrapper.prototype.toArray = function() {\n return this.take(MAX_ARRAY_LENGTH);\n };\n\n // Add `LazyWrapper` methods to `lodash.prototype`.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n isTaker = /^(?:head|last)$/.test(methodName),\n lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n retUnwrapped = isTaker || /^find/.test(methodName);\n\n if (!lodashFunc) {\n return;\n }\n lodash.prototype[methodName] = function() {\n var value = this.__wrapped__,\n args = isTaker ? [1] : arguments,\n isLazy = value instanceof LazyWrapper,\n iteratee = args[0],\n useLazy = isLazy || isArray(value);\n\n var interceptor = function(value) {\n var result = lodashFunc.apply(lodash, arrayPush([value], args));\n return (isTaker && chainAll) ? result[0] : result;\n };\n\n if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n isLazy = useLazy = false;\n }\n var chainAll = this.__chain__,\n isHybrid = !!this.__actions__.length,\n isUnwrapped = retUnwrapped && !chainAll,\n onlyLazy = isLazy && !isHybrid;\n\n if (!retUnwrapped && useLazy) {\n value = onlyLazy ? value : new LazyWrapper(this);\n var result = func.apply(value, args);\n result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n return new LodashWrapper(result, chainAll);\n }\n if (isUnwrapped && onlyLazy) {\n return func.apply(this, args);\n }\n result = this.thru(interceptor);\n return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n };\n });\n\n // Add `Array` methods to `lodash.prototype`.\n arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n var func = arrayProto[methodName],\n chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n lodash.prototype[methodName] = function() {\n var args = arguments;\n if (retUnwrapped && !this.__chain__) {\n var value = this.value();\n return func.apply(isArray(value) ? value : [], args);\n }\n return this[chainName](function(value) {\n return func.apply(isArray(value) ? value : [], args);\n });\n };\n });\n\n // Map minified method names to their real names.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var lodashFunc = lodash[methodName];\n if (lodashFunc) {\n var key = lodashFunc.name + '';\n if (!hasOwnProperty.call(realNames, key)) {\n realNames[key] = [];\n }\n realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n }\n });\n\n realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n 'name': 'wrapper',\n 'func': undefined\n }];\n\n // Add methods to `LazyWrapper`.\n LazyWrapper.prototype.clone = lazyClone;\n LazyWrapper.prototype.reverse = lazyReverse;\n LazyWrapper.prototype.value = lazyValue;\n\n // Add chain sequence methods to the `lodash` wrapper.\n lodash.prototype.at = wrapperAt;\n lodash.prototype.chain = wrapperChain;\n lodash.prototype.commit = wrapperCommit;\n lodash.prototype.next = wrapperNext;\n lodash.prototype.plant = wrapperPlant;\n lodash.prototype.reverse = wrapperReverse;\n lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n // Add lazy aliases.\n lodash.prototype.first = lodash.prototype.head;\n\n if (symIterator) {\n lodash.prototype[symIterator] = wrapperToIterator;\n }\n return lodash;\n });\n\n /*--------------------------------------------------------------------------*/\n\n // Export lodash.\n var _ = runInContext();\n\n // Some AMD build optimizers, like r.js, check for condition patterns like:\n if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n // Expose Lodash on the global object to prevent errors when Lodash is\n // loaded by a script tag in the presence of an AMD loader.\n // See http://requirejs.org/docs/errors.html#mismatch for more details.\n // Use `_.noConflict` to remove Lodash from the global object.\n root._ = _;\n\n // Define as an anonymous module so, through path mapping, it can be\n // referenced as the \"underscore\" module.\n define(function() {\n return _;\n });\n }\n // Check for `exports` after `define` in case a build optimizer adds it.\n else if (freeModule) {\n // Export for Node.js.\n (freeModule.exports = _)._ = _;\n // Export for CommonJS support.\n freeExports._ = _;\n }\n else {\n // Export to the global object.\n root._ = _;\n }\n}.call(this));\n","import React, { useMemo } from 'react'\nimport PropTypes from 'prop-types'\n\nimport { chunk } from 'lodash'\n\nimport {\n Box,\n Typography,\n Button\n} from '@mui/material'\n\nconst FormRepeaterGrid = ({\n entries,\n options,\n blockedOptions,\n onChange\n}) => {\n const toggleEntry = entry => {\n const newEntries = structuredClone(entries)\n\n if (newEntries.includes(entry)) {\n const entryIndex = newEntries.findIndex(e => e === entry)\n newEntries.splice(entryIndex, 1)\n } else {\n newEntries.push(entry)\n }\n\n onChange(newEntries)\n }\n\n const mappedEntries = useMemo(() => (\n chunk(\n Object\n .entries(options)\n .map(e => {\n const value = e[0]\n const selected = entries.includes(value)\n const disabled = blockedOptions.includes(value) && !selected\n\n return {\n value,\n label: e[1],\n selected,\n disabled\n }\n }),\n 1\n )\n ), [options, entries, blockedOptions])\n\n return (\n <Box width=\"100%\">\n {\n mappedEntries.map((row, i) => (\n <Box\n // eslint-disable-next-line react/no-array-index-key\n key={`row-${i}`}\n width=\"100%\"\n mb={2}\n >\n {\n row.map(({\n value,\n label,\n selected,\n disabled\n }, ei) => (\n <Button\n key={`option-${value}`}\n disabled={disabled}\n disableElevation\n variant={\n selected\n ? 'contained'\n : 'outlined'\n }\n color={\n selected\n ? 'primary'\n : 'inherit'\n }\n sx={{\n // width: 'calc(50% - 8px)',\n width: '100%',\n p: 0,\n pl: theme => theme.spacing(2),\n pr: theme => theme.spacing(2),\n height: theme => theme.spacing(7),\n mr: ei === 0 ? 2 : 0\n }}\n onClick={() => toggleEntry(value)}\n >\n <Typography\n variant=\"button\"\n noWrap\n >\n {label}\n </Typography>\n </Button>\n ))\n }\n </Box>\n ))\n }\n </Box>\n )\n}\n\nFormRepeaterGrid.propTypes = {\n entries: PropTypes.array.isRequired,\n options: PropTypes.array.isRequired,\n blockedOptions: PropTypes.array.isRequired,\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormRepeaterGrid\n","import React, {\n useState, useEffect\n} from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box, Typography\n} from '@mui/material'\n\nimport FormRepeaterDefault from './FormRepeaterDefault'\nimport FormRepeaterGrid from './FormRepeaterGrid'\n\nconst FormRepeater = ({\n variant,\n name,\n label,\n value,\n options,\n maxEntries,\n optionsAsGrid,\n onChange\n}) => {\n const [entries, setEntries] = useState(value || [])\n\n useEffect(() => {\n const newValue = entries.length > 0 ? entries : undefined\n onChange({ target: { name, value: newValue } })\n }, [entries])\n\n let blockedOptions = []\n if (options) {\n blockedOptions = (\n Object\n .entries(options)\n .filter(e => Array.isArray(value) && value.includes(e[0])).map(e => e[0])\n )\n }\n\n if (maxEntries && value?.length >= maxEntries) {\n blockedOptions = (\n Object\n .entries(options)\n .map(e => e[0])\n )\n }\n\n const Repeater = (\n optionsAsGrid\n ? FormRepeaterGrid\n : FormRepeaterDefault\n )\n\n return (\n <Box>\n {\n label\n && (\n <Typography variant=\"body1\">\n {label}\n </Typography>\n )\n }\n <Repeater\n variant={variant}\n entries={entries}\n options={options}\n blockedOptions={blockedOptions}\n onChange={setEntries}\n />\n </Box>\n )\n}\n\nFormRepeater.propTypes = {\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n name: PropTypes.string,\n label: PropTypes.string,\n value: PropTypes.any,\n options: PropTypes.object,\n maxEntries: PropTypes.number,\n optionsAsGrid: PropTypes.bool,\n onChange: PropTypes.func.isRequired\n}\n\nexport default FormRepeater\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Typography, Box\n} from '@mui/material'\n\nimport makeStyles from '@mui/styles/makeStyles'\n\nconst useStyles = makeStyles(theme => ({\n readOnlyField: {\n width: '100%',\n display: 'flex',\n flexDirection: 'column',\n marginBottom: theme.spacing(1.5),\n '&:last-child': {\n marginBottom: 0\n }\n }\n}))\n\nconst FormControlField = ({\n formVariant,\n type,\n name,\n label,\n component,\n componentProps = {},\n value,\n options,\n required\n}) => {\n const finalProps = {\n ...componentProps,\n formVariant,\n name,\n label,\n value,\n options,\n required,\n readOnly: true\n }\n\n const styles = useStyles()\n\n const isSwitch = type === 'boolean'\n\n if (componentProps?.readOnlyHidden === true) {\n return false\n }\n\n let control\n if (type === '@@render') control = React.cloneElement(component, finalProps)\n else control = React.createElement(component, finalProps)\n\n return (\n <Box className={styles.readOnlyField}>\n {\n (label && !isSwitch)\n && (\n <Typography\n variant=\"caption\"\n color=\"textSecondary\"\n >\n {label}\n </Typography>\n )\n }\n {control}\n </Box>\n )\n}\n\nFormControlField.propTypes = {\n formVariant: PropTypes.oneOf(['block', 'card']),\n component: PropTypes.any.isRequired,\n componentProps: PropTypes.object,\n name: PropTypes.string.isRequired,\n type: PropTypes.string.isRequired,\n label: PropTypes.string.isRequired,\n value: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.number,\n PropTypes.bool,\n PropTypes.array\n ]),\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })),\n required: PropTypes.bool\n}\n\nconst FormReadOnlyField = ({\n prepend,\n append,\n componentProps,\n ...fieldProps\n}) => {\n const finalProps = {\n componentProps,\n ...fieldProps\n }\n\n if (componentProps?.type === 'hidden') {\n return <input type=\"hidden\" name={fieldProps.name} value={fieldProps.value} />\n }\n\n return (\n // eslint-disable-next-line react/jsx-props-no-spreading\n <FormControlField {...finalProps} />\n )\n}\n\nFormReadOnlyField.propTypes = {\n component: PropTypes.any.isRequired,\n componentProps: PropTypes.object,\n type: PropTypes.string.isRequired,\n name: PropTypes.string.isRequired,\n label: PropTypes.string.isRequired,\n value: PropTypes.oneOfType([\n PropTypes.string,\n PropTypes.number,\n PropTypes.bool,\n PropTypes.array\n ]),\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })),\n prepend: PropTypes.array,\n append: PropTypes.array,\n hasErrors: PropTypes.bool,\n errors: PropTypes.array,\n validating: PropTypes.bool,\n required: PropTypes.bool,\n dirty: PropTypes.bool\n}\n\nexport default React.memo(FormReadOnlyField)\n","const protocols = ['http', 'https', 'mailto', 'tel']\n\n/**\n * @param {string} uri\n * @returns {string}\n */\nexport function uriTransformer(uri) {\n const url = (uri || '').trim()\n const first = url.charAt(0)\n\n if (first === '#' || first === '/') {\n return url\n }\n\n const colon = url.indexOf(':')\n if (colon === -1) {\n return url\n }\n\n let index = -1\n\n while (++index < protocols.length) {\n const protocol = protocols[index]\n\n if (\n colon === protocol.length &&\n url.slice(0, protocol.length).toLowerCase() === protocol\n ) {\n return url\n }\n }\n\n index = url.indexOf('?')\n if (index !== -1 && colon > index) {\n return url\n }\n\n index = url.indexOf('#')\n if (index !== -1 && colon > index) {\n return url\n }\n\n // eslint-disable-next-line no-script-url\n return 'javascript:void(0)'\n}\n","/*!\n * Determine if an object is a Buffer\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n\nmodule.exports = function isBuffer (obj) {\n return obj != null && obj.constructor != null &&\n typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n","/**\n * @typedef {import('unist').Point} Point\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {object & {type: string, position?: Position|undefined}} NodeLike\n */\n\n/**\n * Stringify one point, a position (start and end points), or a node’s\n * positional information.\n *\n * @param {Node|NodeLike|Position|Point|null} [value]\n * @returns {string}\n */\nexport function stringifyPosition(value) {\n // Nothing.\n if (!value || typeof value !== 'object') {\n return ''\n }\n\n // Node.\n if ('position' in value || 'type' in value) {\n return position(value.position)\n }\n\n // Position.\n if ('start' in value || 'end' in value) {\n return position(value)\n }\n\n // Point.\n if ('line' in value || 'column' in value) {\n return point(value)\n }\n\n // ?\n return ''\n}\n\n/**\n * @param {Point|undefined} point\n * @returns {string}\n */\nfunction point(point) {\n return index(point && point.line) + ':' + index(point && point.column)\n}\n\n/**\n * @param {Position|undefined} pos\n * @returns {string}\n */\nfunction position(pos) {\n return point(pos && pos.start) + '-' + point(pos && pos.end)\n}\n\n/**\n * @param {number|undefined} value\n * @returns {number}\n */\nfunction index(value) {\n return value && typeof value === 'number' ? value : 1\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Point} Point\n * @typedef {object & {type: string, position?: Position|undefined}} NodeLike\n */\n\nimport {stringifyPosition} from 'unist-util-stringify-position'\n\nexport class VFileMessage extends Error {\n /**\n * Constructor of a message for `reason` at `place` from `origin`.\n * When an error is passed in as `reason`, copies the `stack`.\n *\n * @param {string|Error} reason Reason for message (`string` or `Error`). Uses the stack and message of the error if given.\n * @param {Node|NodeLike|Position|Point} [place] Place at which the message occurred in a file (`Node`, `Position`, or `Point`, optional).\n * @param {string} [origin] Place in code the message originates from (`string`, optional).\n */\n constructor(reason, place, origin) {\n /** @type {[string|null, string|null]} */\n const parts = [null, null]\n /** @type {Position} */\n let position = {\n // @ts-expect-error: we always follows the structure of `position`.\n start: {line: null, column: null},\n // @ts-expect-error: \"\n end: {line: null, column: null}\n }\n\n super()\n\n if (typeof place === 'string') {\n origin = place\n place = undefined\n }\n\n if (typeof origin === 'string') {\n const index = origin.indexOf(':')\n\n if (index === -1) {\n parts[1] = origin\n } else {\n parts[0] = origin.slice(0, index)\n parts[1] = origin.slice(index + 1)\n }\n }\n\n if (place) {\n // Node.\n if ('type' in place || 'position' in place) {\n if (place.position) {\n position = place.position\n }\n }\n // Position.\n else if ('start' in place || 'end' in place) {\n position = place\n }\n // Point.\n else if ('line' in place || 'column' in place) {\n position.start = place\n }\n }\n\n // Fields from `Error`\n this.name = stringifyPosition(place) || '1:1'\n this.message = typeof reason === 'object' ? reason.message : reason\n this.stack = typeof reason === 'object' ? reason.stack : ''\n\n /**\n * Reason for message.\n * @type {string}\n */\n this.reason = this.message\n /**\n * If true, marks associated file as no longer processable.\n * @type {boolean?}\n */\n // eslint-disable-next-line no-unused-expressions\n this.fatal\n /**\n * Starting line of error.\n * @type {number?}\n */\n this.line = position.start.line\n /**\n * Starting column of error.\n * @type {number?}\n */\n this.column = position.start.column\n /**\n * Namespace of warning.\n * @type {string?}\n */\n this.source = parts[0]\n /**\n * Category of message.\n * @type {string?}\n */\n this.ruleId = parts[1]\n /**\n * Full range information, when available.\n * Has start and end properties, both set to an object with line and column, set to number?.\n * @type {Position?}\n */\n this.position = position\n\n // The following fields are “well known”.\n // Not standard.\n // Feel free to add other non-standard fields to your messages.\n\n /* eslint-disable no-unused-expressions */\n /**\n * You can use this to specify the source value that’s being reported, which\n * is deemed incorrect.\n * @type {string?}\n */\n this.actual\n /**\n * You can use this to suggest values that should be used instead of\n * `actual`, one or more values that are deemed as acceptable.\n * @type {Array<string>?}\n */\n this.expected\n /**\n * You may add a file property with a path of a file (used throughout the VFile ecosystem).\n * @type {string?}\n */\n this.file\n /**\n * You may add a url property with a link to documentation for the message.\n * @type {string?}\n */\n this.url\n /**\n * You may add a note property with a long form description of the message (supported by vfile-reporter).\n * @type {string?}\n */\n this.note\n /* eslint-enable no-unused-expressions */\n }\n}\n\nVFileMessage.prototype.file = ''\nVFileMessage.prototype.name = ''\nVFileMessage.prototype.reason = ''\nVFileMessage.prototype.message = ''\nVFileMessage.prototype.stack = ''\nVFileMessage.prototype.fatal = null\nVFileMessage.prototype.column = null\nVFileMessage.prototype.line = null\nVFileMessage.prototype.source = null\nVFileMessage.prototype.ruleId = null\nVFileMessage.prototype.position = null\n","// A derivative work based on:\n// <https://github.com/browserify/path-browserify>.\n// Which is licensed:\n//\n// MIT License\n//\n// Copyright (c) 2013 James Halliday\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy of\n// this software and associated documentation files (the \"Software\"), to deal in\n// the Software without restriction, including without limitation the rights to\n// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n// the Software, and to permit persons to whom the Software is furnished to do so,\n// subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n// A derivative work based on:\n//\n// Parts of that are extracted from Node’s internal `path` module:\n// <https://github.com/nodejs/node/blob/master/lib/path.js>.\n// Which is licensed:\n//\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nexport const path = {basename, dirname, extname, join, sep: '/'}\n\n/* eslint-disable max-depth, complexity */\n\n/**\n * @param {string} path\n * @param {string} [ext]\n * @returns {string}\n */\nfunction basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') {\n throw new TypeError('\"ext\" argument must be a string')\n }\n\n assertPath(path)\n let start = 0\n let end = -1\n let index = path.length\n /** @type {boolean|undefined} */\n let seenNonSlash\n\n if (ext === undefined || ext.length === 0 || ext.length > path.length) {\n while (index--) {\n if (path.charCodeAt(index) === 47 /* `/` */) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now.\n if (seenNonSlash) {\n start = index + 1\n break\n }\n } else if (end < 0) {\n // We saw the first non-path separator, mark this as the end of our\n // path component.\n seenNonSlash = true\n end = index + 1\n }\n }\n\n return end < 0 ? '' : path.slice(start, end)\n }\n\n if (ext === path) {\n return ''\n }\n\n let firstNonSlashEnd = -1\n let extIndex = ext.length - 1\n\n while (index--) {\n if (path.charCodeAt(index) === 47 /* `/` */) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now.\n if (seenNonSlash) {\n start = index + 1\n break\n }\n } else {\n if (firstNonSlashEnd < 0) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching.\n seenNonSlash = true\n firstNonSlashEnd = index + 1\n }\n\n if (extIndex > -1) {\n // Try to match the explicit extension.\n if (path.charCodeAt(index) === ext.charCodeAt(extIndex--)) {\n if (extIndex < 0) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = index\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIndex = -1\n end = firstNonSlashEnd\n }\n }\n }\n }\n\n if (start === end) {\n end = firstNonSlashEnd\n } else if (end < 0) {\n end = path.length\n }\n\n return path.slice(start, end)\n}\n\n/**\n * @param {string} path\n * @returns {string}\n */\nfunction dirname(path) {\n assertPath(path)\n\n if (path.length === 0) {\n return '.'\n }\n\n let end = -1\n let index = path.length\n /** @type {boolean|undefined} */\n let unmatchedSlash\n\n // Prefix `--` is important to not run on `0`.\n while (--index) {\n if (path.charCodeAt(index) === 47 /* `/` */) {\n if (unmatchedSlash) {\n end = index\n break\n }\n } else if (!unmatchedSlash) {\n // We saw the first non-path separator\n unmatchedSlash = true\n }\n }\n\n return end < 0\n ? path.charCodeAt(0) === 47 /* `/` */\n ? '/'\n : '.'\n : end === 1 && path.charCodeAt(0) === 47 /* `/` */\n ? '//'\n : path.slice(0, end)\n}\n\n/**\n * @param {string} path\n * @returns {string}\n */\nfunction extname(path) {\n assertPath(path)\n\n let index = path.length\n\n let end = -1\n let startPart = 0\n let startDot = -1\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find.\n let preDotState = 0\n /** @type {boolean|undefined} */\n let unmatchedSlash\n\n while (index--) {\n const code = path.charCodeAt(index)\n\n if (code === 47 /* `/` */) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now.\n if (unmatchedSlash) {\n startPart = index + 1\n break\n }\n\n continue\n }\n\n if (end < 0) {\n // We saw the first non-path separator, mark this as the end of our\n // extension.\n unmatchedSlash = true\n end = index + 1\n }\n\n if (code === 46 /* `.` */) {\n // If this is our first dot, mark it as the start of our extension.\n if (startDot < 0) {\n startDot = index\n } else if (preDotState !== 1) {\n preDotState = 1\n }\n } else if (startDot > -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension.\n preDotState = -1\n }\n }\n\n if (\n startDot < 0 ||\n end < 0 ||\n // We saw a non-dot character immediately before the dot.\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly `..`.\n (preDotState === 1 && startDot === end - 1 && startDot === startPart + 1)\n ) {\n return ''\n }\n\n return path.slice(startDot, end)\n}\n\n/**\n * @param {Array<string>} segments\n * @returns {string}\n */\nfunction join(...segments) {\n let index = -1\n /** @type {string|undefined} */\n let joined\n\n while (++index < segments.length) {\n assertPath(segments[index])\n\n if (segments[index]) {\n joined =\n joined === undefined ? segments[index] : joined + '/' + segments[index]\n }\n }\n\n return joined === undefined ? '.' : normalize(joined)\n}\n\n/**\n * Note: `normalize` is not exposed as `path.normalize`, so some code is\n * manually removed from it.\n *\n * @param {string} path\n * @returns {string}\n */\nfunction normalize(path) {\n assertPath(path)\n\n const absolute = path.charCodeAt(0) === 47 /* `/` */\n\n // Normalize the path according to POSIX rules.\n let value = normalizeString(path, !absolute)\n\n if (value.length === 0 && !absolute) {\n value = '.'\n }\n\n if (value.length > 0 && path.charCodeAt(path.length - 1) === 47 /* / */) {\n value += '/'\n }\n\n return absolute ? '/' + value : value\n}\n\n/**\n * Resolve `.` and `..` elements in a path with directory names.\n *\n * @param {string} path\n * @param {boolean} allowAboveRoot\n * @returns {string}\n */\nfunction normalizeString(path, allowAboveRoot) {\n let result = ''\n let lastSegmentLength = 0\n let lastSlash = -1\n let dots = 0\n let index = -1\n /** @type {number|undefined} */\n let code\n /** @type {number} */\n let lastSlashIndex\n\n while (++index <= path.length) {\n if (index < path.length) {\n code = path.charCodeAt(index)\n } else if (code === 47 /* `/` */) {\n break\n } else {\n code = 47 /* `/` */\n }\n\n if (code === 47 /* `/` */) {\n if (lastSlash === index - 1 || dots === 1) {\n // Empty.\n } else if (lastSlash !== index - 1 && dots === 2) {\n if (\n result.length < 2 ||\n lastSegmentLength !== 2 ||\n result.charCodeAt(result.length - 1) !== 46 /* `.` */ ||\n result.charCodeAt(result.length - 2) !== 46 /* `.` */\n ) {\n if (result.length > 2) {\n lastSlashIndex = result.lastIndexOf('/')\n\n if (lastSlashIndex !== result.length - 1) {\n if (lastSlashIndex < 0) {\n result = ''\n lastSegmentLength = 0\n } else {\n result = result.slice(0, lastSlashIndex)\n lastSegmentLength = result.length - 1 - result.lastIndexOf('/')\n }\n\n lastSlash = index\n dots = 0\n continue\n }\n } else if (result.length > 0) {\n result = ''\n lastSegmentLength = 0\n lastSlash = index\n dots = 0\n continue\n }\n }\n\n if (allowAboveRoot) {\n result = result.length > 0 ? result + '/..' : '..'\n lastSegmentLength = 2\n }\n } else {\n if (result.length > 0) {\n result += '/' + path.slice(lastSlash + 1, index)\n } else {\n result = path.slice(lastSlash + 1, index)\n }\n\n lastSegmentLength = index - lastSlash - 1\n }\n\n lastSlash = index\n dots = 0\n } else if (code === 46 /* `.` */ && dots > -1) {\n dots++\n } else {\n dots = -1\n }\n }\n\n return result\n}\n\n/**\n * @param {string} path\n */\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError(\n 'Path must be a string. Received ' + JSON.stringify(path)\n )\n }\n}\n\n/* eslint-enable max-depth, complexity */\n","// Somewhat based on:\n// <https://github.com/defunctzombie/node-process/blob/master/browser.js>.\n// But I don’t think one tiny line of code can be copyrighted. 😅\nexport const proc = {cwd}\n\nfunction cwd() {\n return '/'\n}\n","/**\n * @typedef URL\n * @property {string} hash\n * @property {string} host\n * @property {string} hostname\n * @property {string} href\n * @property {string} origin\n * @property {string} password\n * @property {string} pathname\n * @property {string} port\n * @property {string} protocol\n * @property {string} search\n * @property {any} searchParams\n * @property {string} username\n * @property {() => string} toString\n * @property {() => string} toJSON\n */\n\n/**\n * @param {unknown} fileURLOrPath\n * @returns {fileURLOrPath is URL}\n */\n// From: <https://github.com/nodejs/node/blob/fcf8ba4/lib/internal/url.js#L1501>\nexport function isUrl(fileURLOrPath) {\n return (\n fileURLOrPath !== null &&\n typeof fileURLOrPath === 'object' &&\n // @ts-expect-error: indexable.\n fileURLOrPath.href &&\n // @ts-expect-error: indexable.\n fileURLOrPath.origin\n )\n}\n","/// <reference lib=\"dom\" />\n\nimport {isUrl} from './minurl.shared.js'\n\n// See: <https://github.com/nodejs/node/blob/fcf8ba4/lib/internal/url.js>\n\n/**\n * @param {string|URL} path\n */\nexport function urlToPath(path) {\n if (typeof path === 'string') {\n path = new URL(path)\n } else if (!isUrl(path)) {\n /** @type {NodeJS.ErrnoException} */\n const error = new TypeError(\n 'The \"path\" argument must be of type string or an instance of URL. Received `' +\n path +\n '`'\n )\n error.code = 'ERR_INVALID_ARG_TYPE'\n throw error\n }\n\n if (path.protocol !== 'file:') {\n /** @type {NodeJS.ErrnoException} */\n const error = new TypeError('The URL must be of scheme file')\n error.code = 'ERR_INVALID_URL_SCHEME'\n throw error\n }\n\n return getPathFromURLPosix(path)\n}\n\n/**\n * @param {URL} url\n */\nfunction getPathFromURLPosix(url) {\n if (url.hostname !== '') {\n /** @type {NodeJS.ErrnoException} */\n const error = new TypeError(\n 'File URL host must be \"localhost\" or empty on darwin'\n )\n error.code = 'ERR_INVALID_FILE_URL_HOST'\n throw error\n }\n\n const pathname = url.pathname\n let index = -1\n\n while (++index < pathname.length) {\n if (\n pathname.charCodeAt(index) === 37 /* `%` */ &&\n pathname.charCodeAt(index + 1) === 50 /* `2` */\n ) {\n const third = pathname.charCodeAt(index + 2)\n if (third === 70 /* `F` */ || third === 102 /* `f` */) {\n /** @type {NodeJS.ErrnoException} */\n const error = new TypeError(\n 'File URL path must not include encoded / characters'\n )\n error.code = 'ERR_INVALID_FILE_URL_PATH'\n throw error\n }\n }\n }\n\n return decodeURIComponent(pathname)\n}\n\nexport {isUrl} from './minurl.shared.js'\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Point} Point\n * @typedef {Record<string, unknown> & {type: string, position?: Position|undefined}} NodeLike\n * @typedef {import('./minurl.shared.js').URL} URL\n * @typedef {import('..').VFileData} VFileData\n * @typedef {import('..').VFileValue} VFileValue\n *\n * @typedef {'ascii'|'utf8'|'utf-8'|'utf16le'|'ucs2'|'ucs-2'|'base64'|'base64url'|'latin1'|'binary'|'hex'} BufferEncoding\n * Encodings supported by the buffer class.\n * This is a copy of the typing from Node, copied to prevent Node globals from\n * being needed.\n * Copied from: <https://github.com/DefinitelyTyped/DefinitelyTyped/blob/90a4ec8/types/node/buffer.d.ts#L170>\n *\n * @typedef {VFileValue|VFileOptions|VFile|URL} VFileCompatible\n * Things that can be passed to the constructor.\n *\n * @typedef VFileCoreOptions\n * @property {VFileValue} [value]\n * @property {string} [cwd]\n * @property {Array<string>} [history]\n * @property {string|URL} [path]\n * @property {string} [basename]\n * @property {string} [stem]\n * @property {string} [extname]\n * @property {string} [dirname]\n * @property {VFileData} [data]\n *\n * @typedef Map\n * Raw source map, see:\n * <https://github.com/mozilla/source-map/blob/58819f0/source-map.d.ts#L15-L23>.\n * @property {number} version\n * @property {Array<string>} sources\n * @property {Array<string>} names\n * @property {string|undefined} [sourceRoot]\n * @property {Array<string>|undefined} [sourcesContent]\n * @property {string} mappings\n * @property {string} file\n *\n * @typedef {{[key: string]: unknown} & VFileCoreOptions} VFileOptions\n * Configuration: a bunch of keys that will be shallow copied over to the new\n * file.\n *\n * @typedef {Record<string, unknown>} VFileReporterSettings\n * @typedef {<T = VFileReporterSettings>(files: Array<VFile>, options: T) => string} VFileReporter\n */\n\nimport buffer from 'is-buffer'\nimport {VFileMessage} from 'vfile-message'\nimport {path} from './minpath.js'\nimport {proc} from './minproc.js'\nimport {urlToPath, isUrl} from './minurl.js'\n\n// Order of setting (least specific to most), we need this because otherwise\n// `{stem: 'a', path: '~/b.js'}` would throw, as a path is needed before a\n// stem can be set.\nconst order = ['history', 'path', 'basename', 'stem', 'extname', 'dirname']\n\nexport class VFile {\n /**\n * Create a new virtual file.\n *\n * If `options` is `string` or `Buffer`, treats it as `{value: options}`.\n * If `options` is a `VFile`, shallow copies its data over to the new file.\n * All other given fields are set on the newly created `VFile`.\n *\n * Path related properties are set in the following order (least specific to\n * most specific): `history`, `path`, `basename`, `stem`, `extname`,\n * `dirname`.\n *\n * It’s not possible to set either `dirname` or `extname` without setting\n * either `history`, `path`, `basename`, or `stem` as well.\n *\n * @param {VFileCompatible} [value]\n */\n constructor(value) {\n /** @type {VFileOptions} */\n let options\n\n if (!value) {\n options = {}\n } else if (typeof value === 'string' || buffer(value)) {\n // @ts-expect-error Looks like a buffer.\n options = {value}\n } else if (isUrl(value)) {\n options = {path: value}\n } else {\n // @ts-expect-error Looks like file or options.\n options = value\n }\n\n /**\n * Place to store custom information.\n * It’s OK to store custom data directly on the file, moving it to `data`\n * gives a little more privacy.\n * @type {VFileData}\n */\n this.data = {}\n\n /**\n * List of messages associated with the file.\n * @type {Array<VFileMessage>}\n */\n this.messages = []\n\n /**\n * List of file paths the file moved between.\n * @type {Array<string>}\n */\n this.history = []\n\n /**\n * Base of `path`.\n * Defaults to `process.cwd()` (`/` in browsers).\n * @type {string}\n */\n this.cwd = proc.cwd()\n\n /* eslint-disable no-unused-expressions */\n /**\n * Raw value.\n * @type {VFileValue}\n */\n this.value\n\n // The below are non-standard, they are “well-known”.\n // As in, used in several tools.\n\n /**\n * Whether a file was saved to disk.\n * This is used by vfile reporters.\n * @type {boolean}\n */\n this.stored\n\n /**\n * Sometimes files have a non-string representation.\n * This can be stored in the `result` field.\n * One example is when turning markdown into React nodes.\n * This is used by unified to store non-string results.\n * @type {unknown}\n */\n this.result\n\n /**\n * Sometimes files have a source map associated with them.\n * This can be stored in the `map` field.\n * This should be a `RawSourceMap` type from the `source-map` module.\n * @type {Map|undefined}\n */\n this.map\n /* eslint-enable no-unused-expressions */\n\n // Set path related properties in the correct order.\n let index = -1\n\n while (++index < order.length) {\n const prop = order[index]\n\n // Note: we specifically use `in` instead of `hasOwnProperty` to accept\n // `vfile`s too.\n if (prop in options && options[prop] !== undefined) {\n // @ts-expect-error: TS is confused by the different types for `history`.\n this[prop] = prop === 'history' ? [...options[prop]] : options[prop]\n }\n }\n\n /** @type {string} */\n let prop\n\n // Set non-path related properties.\n for (prop in options) {\n // @ts-expect-error: fine to set other things.\n if (!order.includes(prop)) this[prop] = options[prop]\n }\n }\n\n /**\n * Access full path (`~/index.min.js`).\n *\n * @returns {string}\n */\n get path() {\n return this.history[this.history.length - 1]\n }\n\n /**\n * Set full path (`~/index.min.js`).\n * Cannot be nullified.\n *\n * @param {string|URL} path\n */\n set path(path) {\n if (isUrl(path)) {\n path = urlToPath(path)\n }\n\n assertNonEmpty(path, 'path')\n\n if (this.path !== path) {\n this.history.push(path)\n }\n }\n\n /**\n * Access parent path (`~`).\n */\n get dirname() {\n return typeof this.path === 'string' ? path.dirname(this.path) : undefined\n }\n\n /**\n * Set parent path (`~`).\n * Cannot be set if there's no `path` yet.\n */\n set dirname(dirname) {\n assertPath(this.basename, 'dirname')\n this.path = path.join(dirname || '', this.basename)\n }\n\n /**\n * Access basename (including extname) (`index.min.js`).\n */\n get basename() {\n return typeof this.path === 'string' ? path.basename(this.path) : undefined\n }\n\n /**\n * Set basename (`index.min.js`).\n * Cannot contain path separators.\n * Cannot be nullified either (use `file.path = file.dirname` instead).\n */\n set basename(basename) {\n assertNonEmpty(basename, 'basename')\n assertPart(basename, 'basename')\n this.path = path.join(this.dirname || '', basename)\n }\n\n /**\n * Access extname (including dot) (`.js`).\n */\n get extname() {\n return typeof this.path === 'string' ? path.extname(this.path) : undefined\n }\n\n /**\n * Set extname (including dot) (`.js`).\n * Cannot be set if there's no `path` yet and cannot contain path separators.\n */\n set extname(extname) {\n assertPart(extname, 'extname')\n assertPath(this.dirname, 'extname')\n\n if (extname) {\n if (extname.charCodeAt(0) !== 46 /* `.` */) {\n throw new Error('`extname` must start with `.`')\n }\n\n if (extname.includes('.', 1)) {\n throw new Error('`extname` cannot contain multiple dots')\n }\n }\n\n this.path = path.join(this.dirname, this.stem + (extname || ''))\n }\n\n /**\n * Access stem (w/o extname) (`index.min`).\n */\n get stem() {\n return typeof this.path === 'string'\n ? path.basename(this.path, this.extname)\n : undefined\n }\n\n /**\n * Set stem (w/o extname) (`index.min`).\n * Cannot be nullified, and cannot contain path separators.\n */\n set stem(stem) {\n assertNonEmpty(stem, 'stem')\n assertPart(stem, 'stem')\n this.path = path.join(this.dirname || '', stem + (this.extname || ''))\n }\n\n /**\n * Serialize the file.\n *\n * @param {BufferEncoding} [encoding='utf8'] If `file.value` is a buffer, `encoding` is used to serialize buffers.\n * @returns {string}\n */\n toString(encoding) {\n return (this.value || '').toString(encoding)\n }\n\n /**\n * Create a message and associates it w/ the file.\n *\n * @param {string|Error} reason Reason for message (`string` or `Error`). Uses the stack and message of the error if given.\n * @param {Node|NodeLike|Position|Point} [place] Place at which the message occurred in a file (`Node`, `Position`, or `Point`, optional).\n * @param {string} [origin] Place in code the message originates from (`string`, optional).\n * @returns {VFileMessage}\n */\n message(reason, place, origin) {\n const message = new VFileMessage(reason, place, origin)\n\n if (this.path) {\n message.name = this.path + ':' + message.name\n message.file = this.path\n }\n\n message.fatal = false\n\n this.messages.push(message)\n\n return message\n }\n\n /**\n * Info: create a message, associate it with the file, and mark the fatality\n * as `null`.\n * Calls `message()` internally.\n *\n * @param {string|Error} reason Reason for message (`string` or `Error`). Uses the stack and message of the error if given.\n * @param {Node|NodeLike|Position|Point} [place] Place at which the message occurred in a file (`Node`, `Position`, or `Point`, optional).\n * @param {string} [origin] Place in code the message originates from (`string`, optional).\n * @returns {VFileMessage}\n */\n info(reason, place, origin) {\n const message = this.message(reason, place, origin)\n\n message.fatal = null\n\n return message\n }\n\n /**\n * Fail: create a message, associate it with the file, mark the fatality as\n * `true`.\n * Note: fatal errors mean a file is no longer processable.\n * Calls `message()` internally.\n *\n * @param {string|Error} reason Reason for message (`string` or `Error`). Uses the stack and message of the error if given.\n * @param {Node|NodeLike|Position|Point} [place] Place at which the message occurred in a file (`Node`, `Position`, or `Point`, optional).\n * @param {string} [origin] Place in code the message originates from (`string`, optional).\n * @returns {never}\n */\n fail(reason, place, origin) {\n const message = this.message(reason, place, origin)\n\n message.fatal = true\n\n throw message\n }\n}\n\n/**\n * Assert that `part` is not a path (as in, does not contain `path.sep`).\n *\n * @param {string|undefined} part\n * @param {string} name\n * @returns {void}\n */\nfunction assertPart(part, name) {\n if (part && part.includes(path.sep)) {\n throw new Error(\n '`' + name + '` cannot be a path: did not expect `' + path.sep + '`'\n )\n }\n}\n\n/**\n * Assert that `part` is not empty.\n *\n * @param {string|undefined} part\n * @param {string} name\n * @returns {asserts part is string}\n */\nfunction assertNonEmpty(part, name) {\n if (!part) {\n throw new Error('`' + name + '` cannot be empty')\n }\n}\n\n/**\n * Assert `path` exists.\n *\n * @param {string|undefined} path\n * @param {string} name\n * @returns {asserts path is string}\n */\nfunction assertPath(path, name) {\n if (!path) {\n throw new Error('Setting `' + name + '` requires `path` to be set too')\n }\n}\n","/**\n * Throw a given error.\n *\n * @param {Error|null|undefined} [error]\n * Maybe error.\n * @returns {asserts error is null|undefined}\n */\nexport function bail(error) {\n if (error) {\n throw error\n }\n}\n","'use strict';\n\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar toStr = Object.prototype.toString;\nvar defineProperty = Object.defineProperty;\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nvar isArray = function isArray(arr) {\n\tif (typeof Array.isArray === 'function') {\n\t\treturn Array.isArray(arr);\n\t}\n\n\treturn toStr.call(arr) === '[object Array]';\n};\n\nvar isPlainObject = function isPlainObject(obj) {\n\tif (!obj || toStr.call(obj) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tvar hasOwnConstructor = hasOwn.call(obj, 'constructor');\n\tvar hasIsPrototypeOf = obj.constructor && obj.constructor.prototype && hasOwn.call(obj.constructor.prototype, 'isPrototypeOf');\n\t// Not own constructor property must be Object\n\tif (obj.constructor && !hasOwnConstructor && !hasIsPrototypeOf) {\n\t\treturn false;\n\t}\n\n\t// Own properties are enumerated firstly, so to speed up,\n\t// if last one is own, then all properties are own.\n\tvar key;\n\tfor (key in obj) { /**/ }\n\n\treturn typeof key === 'undefined' || hasOwn.call(obj, key);\n};\n\n// If name is '__proto__', and Object.defineProperty is available, define __proto__ as an own property on target\nvar setProperty = function setProperty(target, options) {\n\tif (defineProperty && options.name === '__proto__') {\n\t\tdefineProperty(target, options.name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: true,\n\t\t\tvalue: options.newValue,\n\t\t\twritable: true\n\t\t});\n\t} else {\n\t\ttarget[options.name] = options.newValue;\n\t}\n};\n\n// Return undefined instead of __proto__ if '__proto__' is not an own property\nvar getProperty = function getProperty(obj, name) {\n\tif (name === '__proto__') {\n\t\tif (!hasOwn.call(obj, name)) {\n\t\t\treturn void 0;\n\t\t} else if (gOPD) {\n\t\t\t// In early versions of node, obj['__proto__'] is buggy when obj has\n\t\t\t// __proto__ as an own property. Object.getOwnPropertyDescriptor() works.\n\t\t\treturn gOPD(obj, name).value;\n\t\t}\n\t}\n\n\treturn obj[name];\n};\n\nmodule.exports = function extend() {\n\tvar options, name, src, copy, copyIsArray, clone;\n\tvar target = arguments[0];\n\tvar i = 1;\n\tvar length = arguments.length;\n\tvar deep = false;\n\n\t// Handle a deep copy situation\n\tif (typeof target === 'boolean') {\n\t\tdeep = target;\n\t\ttarget = arguments[1] || {};\n\t\t// skip the boolean and the target\n\t\ti = 2;\n\t}\n\tif (target == null || (typeof target !== 'object' && typeof target !== 'function')) {\n\t\ttarget = {};\n\t}\n\n\tfor (; i < length; ++i) {\n\t\toptions = arguments[i];\n\t\t// Only deal with non-null/undefined values\n\t\tif (options != null) {\n\t\t\t// Extend the base object\n\t\t\tfor (name in options) {\n\t\t\t\tsrc = getProperty(target, name);\n\t\t\t\tcopy = getProperty(options, name);\n\n\t\t\t\t// Prevent never-ending loop\n\t\t\t\tif (target !== copy) {\n\t\t\t\t\t// Recurse if we're merging plain objects or arrays\n\t\t\t\t\tif (deep && copy && (isPlainObject(copy) || (copyIsArray = isArray(copy)))) {\n\t\t\t\t\t\tif (copyIsArray) {\n\t\t\t\t\t\t\tcopyIsArray = false;\n\t\t\t\t\t\t\tclone = src && isArray(src) ? src : [];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tclone = src && isPlainObject(src) ? src : {};\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Never move original objects, clone them\n\t\t\t\t\t\tsetProperty(target, { name: name, newValue: extend(deep, clone, copy) });\n\n\t\t\t\t\t// Don't bring in undefined values\n\t\t\t\t\t} else if (typeof copy !== 'undefined') {\n\t\t\t\t\t\tsetProperty(target, { name: name, newValue: copy });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return the modified object\n\treturn target;\n};\n","export default function isPlainObject(value) {\n\tif (Object.prototype.toString.call(value) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === null || prototype === Object.prototype;\n}\n","/**\n * @typedef {(error?: Error|null|undefined, ...output: Array<any>) => void} Callback\n * @typedef {(...input: Array<any>) => any} Middleware\n *\n * @typedef {(...input: Array<any>) => void} Run\n * Call all middleware.\n * @typedef {(fn: Middleware) => Pipeline} Use\n * Add `fn` (middleware) to the list.\n * @typedef {{run: Run, use: Use}} Pipeline\n * Middleware.\n */\n\n/**\n * Create new middleware.\n *\n * @returns {Pipeline}\n */\nexport function trough() {\n /** @type {Array<Middleware>} */\n const fns = []\n /** @type {Pipeline} */\n const pipeline = {run, use}\n\n return pipeline\n\n /** @type {Run} */\n function run(...values) {\n let middlewareIndex = -1\n /** @type {Callback} */\n const callback = values.pop()\n\n if (typeof callback !== 'function') {\n throw new TypeError('Expected function as last argument, not ' + callback)\n }\n\n next(null, ...values)\n\n /**\n * Run the next `fn`, or we’re done.\n *\n * @param {Error|null|undefined} error\n * @param {Array<any>} output\n */\n function next(error, ...output) {\n const fn = fns[++middlewareIndex]\n let index = -1\n\n if (error) {\n callback(error)\n return\n }\n\n // Copy non-nullish input into values.\n while (++index < values.length) {\n if (output[index] === null || output[index] === undefined) {\n output[index] = values[index]\n }\n }\n\n // Save the newly created `output` for the next call.\n values = output\n\n // Next or done.\n if (fn) {\n wrap(fn, next)(...output)\n } else {\n callback(null, ...output)\n }\n }\n }\n\n /** @type {Use} */\n function use(middelware) {\n if (typeof middelware !== 'function') {\n throw new TypeError(\n 'Expected `middelware` to be a function, not ' + middelware\n )\n }\n\n fns.push(middelware)\n return pipeline\n }\n}\n\n/**\n * Wrap `middleware`.\n * Can be sync or async; return a promise, receive a callback, or return new\n * values and errors.\n *\n * @param {Middleware} middleware\n * @param {Callback} callback\n */\nexport function wrap(middleware, callback) {\n /** @type {boolean} */\n let called\n\n return wrapped\n\n /**\n * Call `middleware`.\n * @this {any}\n * @param {Array<any>} parameters\n * @returns {void}\n */\n function wrapped(...parameters) {\n const fnExpectsCallback = middleware.length > parameters.length\n /** @type {any} */\n let result\n\n if (fnExpectsCallback) {\n parameters.push(done)\n }\n\n try {\n result = middleware.apply(this, parameters)\n } catch (error) {\n const exception = /** @type {Error} */ (error)\n\n // Well, this is quite the pickle.\n // `middleware` received a callback and called it synchronously, but that\n // threw an error.\n // The only thing left to do is to throw the thing instead.\n if (fnExpectsCallback && called) {\n throw exception\n }\n\n return done(exception)\n }\n\n if (!fnExpectsCallback) {\n if (result instanceof Promise) {\n result.then(then, done)\n } else if (result instanceof Error) {\n done(result)\n } else {\n then(result)\n }\n }\n }\n\n /**\n * Call `callback`, only once.\n * @type {Callback}\n */\n function done(error, ...output) {\n if (!called) {\n called = true\n callback(error, ...output)\n }\n }\n\n /**\n * Call `done` with one value.\n *\n * @param {any} [value]\n */\n function then(value) {\n done(null, value)\n }\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('vfile').VFileCompatible} VFileCompatible\n * @typedef {import('vfile').VFileValue} VFileValue\n * @typedef {import('..').Processor} Processor\n * @typedef {import('..').Plugin} Plugin\n * @typedef {import('..').Preset} Preset\n * @typedef {import('..').Pluggable} Pluggable\n * @typedef {import('..').PluggableList} PluggableList\n * @typedef {import('..').Transformer} Transformer\n * @typedef {import('..').Parser} Parser\n * @typedef {import('..').Compiler} Compiler\n * @typedef {import('..').RunCallback} RunCallback\n * @typedef {import('..').ProcessCallback} ProcessCallback\n *\n * @typedef Context\n * @property {Node} tree\n * @property {VFile} file\n */\n\nimport {bail} from 'bail'\nimport isBuffer from 'is-buffer'\nimport extend from 'extend'\nimport isPlainObj from 'is-plain-obj'\nimport {trough} from 'trough'\nimport {VFile} from 'vfile'\n\n// Expose a frozen processor.\nexport const unified = base().freeze()\n\nconst own = {}.hasOwnProperty\n\n// Function to create the first processor.\n/**\n * @returns {Processor}\n */\nfunction base() {\n const transformers = trough()\n /** @type {Processor['attachers']} */\n const attachers = []\n /** @type {Record<string, unknown>} */\n let namespace = {}\n /** @type {boolean|undefined} */\n let frozen\n let freezeIndex = -1\n\n // Data management.\n // @ts-expect-error: overloads are handled.\n processor.data = data\n processor.Parser = undefined\n processor.Compiler = undefined\n\n // Lock.\n processor.freeze = freeze\n\n // Plugins.\n processor.attachers = attachers\n // @ts-expect-error: overloads are handled.\n processor.use = use\n\n // API.\n processor.parse = parse\n processor.stringify = stringify\n // @ts-expect-error: overloads are handled.\n processor.run = run\n processor.runSync = runSync\n // @ts-expect-error: overloads are handled.\n processor.process = process\n processor.processSync = processSync\n\n // Expose.\n return processor\n\n // Create a new processor based on the processor in the current scope.\n /** @type {Processor} */\n function processor() {\n const destination = base()\n let index = -1\n\n while (++index < attachers.length) {\n destination.use(...attachers[index])\n }\n\n destination.data(extend(true, {}, namespace))\n\n return destination\n }\n\n /**\n * @param {string|Record<string, unknown>} [key]\n * @param {unknown} [value]\n * @returns {unknown}\n */\n function data(key, value) {\n if (typeof key === 'string') {\n // Set `key`.\n if (arguments.length === 2) {\n assertUnfrozen('data', frozen)\n namespace[key] = value\n return processor\n }\n\n // Get `key`.\n return (own.call(namespace, key) && namespace[key]) || null\n }\n\n // Set space.\n if (key) {\n assertUnfrozen('data', frozen)\n namespace = key\n return processor\n }\n\n // Get space.\n return namespace\n }\n\n /** @type {Processor['freeze']} */\n function freeze() {\n if (frozen) {\n return processor\n }\n\n while (++freezeIndex < attachers.length) {\n const [attacher, ...options] = attachers[freezeIndex]\n\n if (options[0] === false) {\n continue\n }\n\n if (options[0] === true) {\n options[0] = undefined\n }\n\n /** @type {Transformer|void} */\n const transformer = attacher.call(processor, ...options)\n\n if (typeof transformer === 'function') {\n transformers.use(transformer)\n }\n }\n\n frozen = true\n freezeIndex = Number.POSITIVE_INFINITY\n\n return processor\n }\n\n /**\n * @param {Pluggable|null|undefined} [value]\n * @param {...unknown} options\n * @returns {Processor}\n */\n function use(value, ...options) {\n /** @type {Record<string, unknown>|undefined} */\n let settings\n\n assertUnfrozen('use', frozen)\n\n if (value === null || value === undefined) {\n // Empty.\n } else if (typeof value === 'function') {\n addPlugin(value, ...options)\n } else if (typeof value === 'object') {\n if (Array.isArray(value)) {\n addList(value)\n } else {\n addPreset(value)\n }\n } else {\n throw new TypeError('Expected usable value, not `' + value + '`')\n }\n\n if (settings) {\n namespace.settings = Object.assign(namespace.settings || {}, settings)\n }\n\n return processor\n\n /**\n * @param {import('..').Pluggable<unknown[]>} value\n * @returns {void}\n */\n function add(value) {\n if (typeof value === 'function') {\n addPlugin(value)\n } else if (typeof value === 'object') {\n if (Array.isArray(value)) {\n const [plugin, ...options] = value\n addPlugin(plugin, ...options)\n } else {\n addPreset(value)\n }\n } else {\n throw new TypeError('Expected usable value, not `' + value + '`')\n }\n }\n\n /**\n * @param {Preset} result\n * @returns {void}\n */\n function addPreset(result) {\n addList(result.plugins)\n\n if (result.settings) {\n settings = Object.assign(settings || {}, result.settings)\n }\n }\n\n /**\n * @param {PluggableList|null|undefined} [plugins]\n * @returns {void}\n */\n function addList(plugins) {\n let index = -1\n\n if (plugins === null || plugins === undefined) {\n // Empty.\n } else if (Array.isArray(plugins)) {\n while (++index < plugins.length) {\n const thing = plugins[index]\n add(thing)\n }\n } else {\n throw new TypeError('Expected a list of plugins, not `' + plugins + '`')\n }\n }\n\n /**\n * @param {Plugin} plugin\n * @param {...unknown} [value]\n * @returns {void}\n */\n function addPlugin(plugin, value) {\n let index = -1\n /** @type {Processor['attachers'][number]|undefined} */\n let entry\n\n while (++index < attachers.length) {\n if (attachers[index][0] === plugin) {\n entry = attachers[index]\n break\n }\n }\n\n if (entry) {\n if (isPlainObj(entry[1]) && isPlainObj(value)) {\n value = extend(true, entry[1], value)\n }\n\n entry[1] = value\n } else {\n // @ts-expect-error: fine.\n attachers.push([...arguments])\n }\n }\n }\n\n /** @type {Processor['parse']} */\n function parse(doc) {\n processor.freeze()\n const file = vfile(doc)\n const Parser = processor.Parser\n assertParser('parse', Parser)\n\n if (newable(Parser, 'parse')) {\n // @ts-expect-error: `newable` checks this.\n return new Parser(String(file), file).parse()\n }\n\n // @ts-expect-error: `newable` checks this.\n return Parser(String(file), file) // eslint-disable-line new-cap\n }\n\n /** @type {Processor['stringify']} */\n function stringify(node, doc) {\n processor.freeze()\n const file = vfile(doc)\n const Compiler = processor.Compiler\n assertCompiler('stringify', Compiler)\n assertNode(node)\n\n if (newable(Compiler, 'compile')) {\n // @ts-expect-error: `newable` checks this.\n return new Compiler(node, file).compile()\n }\n\n // @ts-expect-error: `newable` checks this.\n return Compiler(node, file) // eslint-disable-line new-cap\n }\n\n /**\n * @param {Node} node\n * @param {VFileCompatible|RunCallback} [doc]\n * @param {RunCallback} [callback]\n * @returns {Promise<Node>|void}\n */\n function run(node, doc, callback) {\n assertNode(node)\n processor.freeze()\n\n if (!callback && typeof doc === 'function') {\n callback = doc\n doc = undefined\n }\n\n if (!callback) {\n return new Promise(executor)\n }\n\n executor(null, callback)\n\n /**\n * @param {null|((node: Node) => void)} resolve\n * @param {(error: Error) => void} reject\n * @returns {void}\n */\n function executor(resolve, reject) {\n // @ts-expect-error: `doc` can’t be a callback anymore, we checked.\n transformers.run(node, vfile(doc), done)\n\n /**\n * @param {Error|null} error\n * @param {Node} tree\n * @param {VFile} file\n * @returns {void}\n */\n function done(error, tree, file) {\n tree = tree || node\n if (error) {\n reject(error)\n } else if (resolve) {\n resolve(tree)\n } else {\n // @ts-expect-error: `callback` is defined if `resolve` is not.\n callback(null, tree, file)\n }\n }\n }\n }\n\n /** @type {Processor['runSync']} */\n function runSync(node, file) {\n /** @type {Node|undefined} */\n let result\n /** @type {boolean|undefined} */\n let complete\n\n processor.run(node, file, done)\n\n assertDone('runSync', 'run', complete)\n\n // @ts-expect-error: we either bailed on an error or have a tree.\n return result\n\n /**\n * @param {Error|null} [error]\n * @param {Node} [tree]\n * @returns {void}\n */\n function done(error, tree) {\n bail(error)\n result = tree\n complete = true\n }\n }\n\n /**\n * @param {VFileCompatible} doc\n * @param {ProcessCallback} [callback]\n * @returns {Promise<VFile>|undefined}\n */\n function process(doc, callback) {\n processor.freeze()\n assertParser('process', processor.Parser)\n assertCompiler('process', processor.Compiler)\n\n if (!callback) {\n return new Promise(executor)\n }\n\n executor(null, callback)\n\n /**\n * @param {null|((file: VFile) => void)} resolve\n * @param {(error?: Error|null|undefined) => void} reject\n * @returns {void}\n */\n function executor(resolve, reject) {\n const file = vfile(doc)\n\n processor.run(processor.parse(file), file, (error, tree, file) => {\n if (error || !tree || !file) {\n done(error)\n } else {\n /** @type {unknown} */\n const result = processor.stringify(tree, file)\n\n if (result === undefined || result === null) {\n // Empty.\n } else if (looksLikeAVFileValue(result)) {\n file.value = result\n } else {\n file.result = result\n }\n\n done(error, file)\n }\n })\n\n /**\n * @param {Error|null|undefined} [error]\n * @param {VFile|undefined} [file]\n * @returns {void}\n */\n function done(error, file) {\n if (error || !file) {\n reject(error)\n } else if (resolve) {\n resolve(file)\n } else {\n // @ts-expect-error: `callback` is defined if `resolve` is not.\n callback(null, file)\n }\n }\n }\n }\n\n /** @type {Processor['processSync']} */\n function processSync(doc) {\n /** @type {boolean|undefined} */\n let complete\n\n processor.freeze()\n assertParser('processSync', processor.Parser)\n assertCompiler('processSync', processor.Compiler)\n\n const file = vfile(doc)\n\n processor.process(file, done)\n\n assertDone('processSync', 'process', complete)\n\n return file\n\n /**\n * @param {Error|null|undefined} [error]\n * @returns {void}\n */\n function done(error) {\n complete = true\n bail(error)\n }\n }\n}\n\n/**\n * Check if `value` is a constructor.\n *\n * @param {unknown} value\n * @param {string} name\n * @returns {boolean}\n */\nfunction newable(value, name) {\n return (\n typeof value === 'function' &&\n // Prototypes do exist.\n // type-coverage:ignore-next-line\n value.prototype &&\n // A function with keys in its prototype is probably a constructor.\n // Classes’ prototype methods are not enumerable, so we check if some value\n // exists in the prototype.\n // type-coverage:ignore-next-line\n (keys(value.prototype) || name in value.prototype)\n )\n}\n\n/**\n * Check if `value` is an object with keys.\n *\n * @param {Record<string, unknown>} value\n * @returns {boolean}\n */\nfunction keys(value) {\n /** @type {string} */\n let key\n\n for (key in value) {\n if (own.call(value, key)) {\n return true\n }\n }\n\n return false\n}\n\n/**\n * Assert a parser is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Parser}\n */\nfunction assertParser(name, value) {\n if (typeof value !== 'function') {\n throw new TypeError('Cannot `' + name + '` without `Parser`')\n }\n}\n\n/**\n * Assert a compiler is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Compiler}\n */\nfunction assertCompiler(name, value) {\n if (typeof value !== 'function') {\n throw new TypeError('Cannot `' + name + '` without `Compiler`')\n }\n}\n\n/**\n * Assert the processor is not frozen.\n *\n * @param {string} name\n * @param {unknown} frozen\n * @returns {asserts frozen is false}\n */\nfunction assertUnfrozen(name, frozen) {\n if (frozen) {\n throw new Error(\n 'Cannot call `' +\n name +\n '` on a frozen processor.\\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.'\n )\n }\n}\n\n/**\n * Assert `node` is a unist node.\n *\n * @param {unknown} node\n * @returns {asserts node is Node}\n */\nfunction assertNode(node) {\n // `isPlainObj` unfortunately uses `any` instead of `unknown`.\n // type-coverage:ignore-next-line\n if (!isPlainObj(node) || typeof node.type !== 'string') {\n throw new TypeError('Expected node, got `' + node + '`')\n // Fine.\n }\n}\n\n/**\n * Assert that `complete` is `true`.\n *\n * @param {string} name\n * @param {string} asyncName\n * @param {unknown} complete\n * @returns {asserts complete is true}\n */\nfunction assertDone(name, asyncName, complete) {\n if (!complete) {\n throw new Error(\n '`' + name + '` finished async. Use `' + asyncName + '` instead'\n )\n }\n}\n\n/**\n * @param {VFileCompatible} [value]\n * @returns {VFile}\n */\nfunction vfile(value) {\n return looksLikeAVFile(value) ? value : new VFile(value)\n}\n\n/**\n * @param {VFileCompatible} [value]\n * @returns {value is VFile}\n */\nfunction looksLikeAVFile(value) {\n return Boolean(\n value &&\n typeof value === 'object' &&\n 'message' in value &&\n 'messages' in value\n )\n}\n\n/**\n * @param {unknown} [value]\n * @returns {value is VFileValue}\n */\nfunction looksLikeAVFileValue(value) {\n return typeof value === 'string' || isBuffer(value)\n}\n","/**\n * @typedef Options\n * @property {boolean} [includeImageAlt=true]\n */\n\n/**\n * Get the text content of a node.\n * Prefer the node’s plain-text fields, otherwise serialize its children,\n * and if the given value is an array, serialize the nodes in it.\n *\n * @param {unknown} node\n * @param {Options} [options]\n * @returns {string}\n */\nexport function toString(node, options) {\n var {includeImageAlt = true} = options || {}\n return one(node, includeImageAlt)\n}\n\n/**\n * @param {unknown} node\n * @param {boolean} includeImageAlt\n * @returns {string}\n */\nfunction one(node, includeImageAlt) {\n return (\n (node &&\n typeof node === 'object' &&\n // @ts-ignore looks like a literal.\n (node.value ||\n // @ts-ignore looks like an image.\n (includeImageAlt ? node.alt : '') ||\n // @ts-ignore looks like a parent.\n ('children' in node && all(node.children, includeImageAlt)) ||\n (Array.isArray(node) && all(node, includeImageAlt)))) ||\n ''\n )\n}\n\n/**\n * @param {Array.<unknown>} values\n * @param {boolean} includeImageAlt\n * @returns {string}\n */\nfunction all(values, includeImageAlt) {\n /** @type {Array.<string>} */\n var result = []\n var index = -1\n\n while (++index < values.length) {\n result[index] = one(values[index], includeImageAlt)\n }\n\n return result.join('')\n}\n","/**\n * Like `Array#splice`, but smarter for giant arrays.\n *\n * `Array#splice` takes all items to be inserted as individual argument which\n * causes a stack overflow in V8 when trying to insert 100k items for instance.\n *\n * Otherwise, this does not return the removed items, and takes `items` as an\n * array instead of rest parameters.\n *\n * @template {unknown} T\n * @param {T[]} list\n * @param {number} start\n * @param {number} remove\n * @param {T[]} items\n * @returns {void}\n */\nexport function splice(list, start, remove, items) {\n const end = list.length\n let chunkStart = 0\n /** @type {unknown[]} */\n\n let parameters // Make start between zero and `end` (included).\n\n if (start < 0) {\n start = -start > end ? 0 : end + start\n } else {\n start = start > end ? end : start\n }\n\n remove = remove > 0 ? remove : 0 // No need to chunk the items if there’s only a couple (10k) items.\n\n if (items.length < 10000) {\n parameters = Array.from(items)\n parameters.unshift(start, remove) // @ts-expect-error Hush, it’s fine.\n ;[].splice.apply(list, parameters)\n } else {\n // Delete `remove` items starting from `start`\n if (remove) [].splice.apply(list, [start, remove]) // Insert the items in chunks to not cause stack overflows.\n\n while (chunkStart < items.length) {\n parameters = items.slice(chunkStart, chunkStart + 10000)\n parameters.unshift(start, 0) // @ts-expect-error Hush, it’s fine.\n ;[].splice.apply(list, parameters)\n chunkStart += 10000\n start += 10000\n }\n }\n}\n/**\n * Append `items` (an array) at the end of `list` (another array).\n * When `list` was empty, returns `items` instead.\n *\n * This prevents a potentially expensive operation when `list` is empty,\n * and adds items in batches to prevent V8 from hanging.\n *\n * @template {unknown} T\n * @param {T[]} list\n * @param {T[]} items\n * @returns {T[]}\n */\n\nexport function push(list, items) {\n if (list.length > 0) {\n splice(list, list.length, 0, items)\n return list\n }\n\n return items\n}\n","/**\n * @typedef {import('micromark-util-types').NormalizedExtension} NormalizedExtension\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').HtmlExtension} HtmlExtension\n */\n\nimport {splice} from 'micromark-util-chunked'\n\nconst hasOwnProperty = {}.hasOwnProperty\n\n/**\n * Combine several syntax extensions into one.\n *\n * @param {Extension[]} extensions List of syntax extensions.\n * @returns {NormalizedExtension} A single combined extension.\n */\nexport function combineExtensions(extensions) {\n /** @type {NormalizedExtension} */\n const all = {}\n let index = -1\n\n while (++index < extensions.length) {\n syntaxExtension(all, extensions[index])\n }\n\n return all\n}\n\n/**\n * Merge `extension` into `all`.\n *\n * @param {NormalizedExtension} all Extension to merge into.\n * @param {Extension} extension Extension to merge.\n * @returns {void}\n */\nfunction syntaxExtension(all, extension) {\n /** @type {string} */\n let hook\n\n for (hook in extension) {\n const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined\n const left = maybe || (all[hook] = {})\n const right = extension[hook]\n /** @type {string} */\n let code\n\n for (code in right) {\n if (!hasOwnProperty.call(left, code)) left[code] = []\n const value = right[code]\n constructs(\n // @ts-expect-error Looks like a list.\n left[code],\n Array.isArray(value) ? value : value ? [value] : []\n )\n }\n }\n}\n\n/**\n * Merge `list` into `existing` (both lists of constructs).\n * Mutates `existing`.\n *\n * @param {unknown[]} existing\n * @param {unknown[]} list\n * @returns {void}\n */\nfunction constructs(existing, list) {\n let index = -1\n /** @type {unknown[]} */\n const before = []\n\n while (++index < list.length) {\n // @ts-expect-error Looks like an object.\n ;(list[index].add === 'after' ? existing : before).push(list[index])\n }\n\n splice(existing, 0, 0, before)\n}\n\n/**\n * Combine several HTML extensions into one.\n *\n * @param {HtmlExtension[]} htmlExtensions List of HTML extensions.\n * @returns {HtmlExtension} A single combined extension.\n */\nexport function combineHtmlExtensions(htmlExtensions) {\n /** @type {HtmlExtension} */\n const handlers = {}\n let index = -1\n\n while (++index < htmlExtensions.length) {\n htmlExtension(handlers, htmlExtensions[index])\n }\n\n return handlers\n}\n\n/**\n * Merge `extension` into `all`.\n *\n * @param {HtmlExtension} all Extension to merge into.\n * @param {HtmlExtension} extension Extension to merge.\n * @returns {void}\n */\nfunction htmlExtension(all, extension) {\n /** @type {string} */\n let hook\n\n for (hook in extension) {\n const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined\n const left = maybe || (all[hook] = {})\n const right = extension[hook]\n /** @type {string} */\n let type\n\n if (right) {\n for (type in right) {\n left[type] = right[type]\n }\n }\n }\n}\n","// This module is generated by `script/`.\n//\n// CommonMark handles attention (emphasis, strong) markers based on what comes\n// before or after them.\n// One such difference is if those characters are Unicode punctuation.\n// This script is generated from the Unicode data.\nexport const unicodePunctuationRegex =\n /[!-/:-@[-`{-~\\u00A1\\u00A7\\u00AB\\u00B6\\u00B7\\u00BB\\u00BF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u09FD\\u0A76\\u0AF0\\u0C77\\u0C84\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2308-\\u230B\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E4F\\u2E52\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA8FC\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]/\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {unicodePunctuationRegex} from './lib/unicode-punctuation-regex.js'\n/**\n * Check whether the character code represents an ASCII alpha (`a` through `z`,\n * case insensitive).\n *\n * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.\n *\n * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)\n * to U+005A (`Z`).\n *\n * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)\n * to U+007A (`z`).\n */\n\nexport const asciiAlpha = regexCheck(/[A-Za-z]/)\n/**\n * Check whether the character code represents an ASCII digit (`0` through `9`).\n *\n * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to\n * U+0039 (`9`).\n */\n\nexport const asciiDigit = regexCheck(/\\d/)\n/**\n * Check whether the character code represents an ASCII hex digit (`a` through\n * `f`, case insensitive, or `0` through `9`).\n *\n * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex\n * digit, or an ASCII lower hex digit.\n *\n * An **ASCII upper hex digit** is a character in the inclusive range U+0041\n * (`A`) to U+0046 (`F`).\n *\n * An **ASCII lower hex digit** is a character in the inclusive range U+0061\n * (`a`) to U+0066 (`f`).\n */\n\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/)\n/**\n * Check whether the character code represents an ASCII alphanumeric (`a`\n * through `z`, case insensitive, or `0` through `9`).\n *\n * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha\n * (see `asciiAlpha`).\n */\n\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/)\n/**\n * Check whether the character code represents ASCII punctuation.\n *\n * An **ASCII punctuation** is a character in the inclusive ranges U+0021\n * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT\n * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT\n * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).\n */\n\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/)\n/**\n * Check whether the character code represents an ASCII atext.\n *\n * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in\n * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),\n * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F\n * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E\n * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE\n * (`{`) to U+007E TILDE (`~`).\n *\n * See:\n * **\\[RFC5322]**:\n * [Internet Message Format](https://tools.ietf.org/html/rfc5322).\n * P. Resnick.\n * IETF.\n */\n\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/)\n/**\n * Check whether a character code is an ASCII control character.\n *\n * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)\n * to U+001F (US), or U+007F (DEL).\n *\n * @param {Code} code\n * @returns {code is number}\n */\n\nexport function asciiControl(code) {\n return (\n // Special whitespace codes (which have negative values), C0 and Control\n // character DEL\n code !== null && (code < 32 || code === 127)\n )\n}\n/**\n * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n * @returns {code is number}\n */\n\nexport function markdownLineEndingOrSpace(code) {\n return code !== null && (code < 0 || code === 32)\n}\n/**\n * Check whether a character code is a markdown line ending.\n *\n * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN\n * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).\n *\n * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE\n * RETURN (CR) are replaced by these virtual characters depending on whether\n * they occurred together.\n *\n * @param {Code} code\n * @returns {code is number}\n */\n\nexport function markdownLineEnding(code) {\n return code !== null && code < -2\n}\n/**\n * Check whether a character code is a markdown space.\n *\n * A **markdown space** is the concrete character U+0020 SPACE (SP) and the\n * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).\n *\n * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is\n * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL\n * SPACE (VS) characters, depending on the column at which the tab occurred.\n *\n * @param {Code} code\n * @returns {code is number}\n */\n\nexport function markdownSpace(code) {\n return code === -2 || code === -1 || code === 32\n}\n/**\n * Check whether the character code represents Unicode whitespace.\n *\n * Note that this does handle micromark specific markdown whitespace characters.\n * See `markdownLineEndingOrSpace` to check that.\n *\n * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,\n * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),\n * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\\[UNICODE]**).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n */\n\nexport const unicodeWhitespace = regexCheck(/\\s/)\n/**\n * Check whether the character code represents Unicode punctuation.\n *\n * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,\n * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`\n * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`\n * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII\n * punctuation (see `asciiPunctuation`).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n */\n// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n\nexport const unicodePunctuation = regexCheck(unicodePunctuationRegex)\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n * @returns {(code: Code) => code is number}\n */\n\nfunction regexCheck(regex) {\n return check\n /**\n * Check whether a code matches the bound regex.\n *\n * @param {Code} code Character code\n * @returns {code is number} Whether the character code matches the bound regex\n */\n\n function check(code) {\n return code !== null && regex.test(String.fromCharCode(code))\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownSpace} from 'micromark-util-character'\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {string} type\n * @param {number} [max=Infinity]\n * @returns {State}\n */\n\nexport function factorySpace(effects, ok, type, max) {\n const limit = max ? max - 1 : Number.POSITIVE_INFINITY\n let size = 0\n return start\n /** @type {State} */\n\n function start(code) {\n if (markdownSpace(code)) {\n effects.enter(type)\n return prefix(code)\n }\n\n return ok(code)\n }\n /** @type {State} */\n\n function prefix(code) {\n if (markdownSpace(code) && size++ < limit) {\n effects.consume(code)\n return prefix\n }\n\n effects.exit(type)\n return ok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {InitialConstruct} */\nexport const content = {\n tokenize: initializeContent\n}\n/** @type {Initializer} */\n\nfunction initializeContent(effects) {\n const contentStart = effects.attempt(\n this.parser.constructs.contentInitial,\n afterContentStartConstruct,\n paragraphInitial\n )\n /** @type {Token} */\n\n let previous\n return contentStart\n /** @type {State} */\n\n function afterContentStartConstruct(code) {\n if (code === null) {\n effects.consume(code)\n return\n }\n\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(effects, contentStart, 'linePrefix')\n }\n /** @type {State} */\n\n function paragraphInitial(code) {\n effects.enter('paragraph')\n return lineStart(code)\n }\n /** @type {State} */\n\n function lineStart(code) {\n const token = effects.enter('chunkText', {\n contentType: 'text',\n previous\n })\n\n if (previous) {\n previous.next = token\n }\n\n previous = token\n return data(code)\n }\n /** @type {State} */\n\n function data(code) {\n if (code === null) {\n effects.exit('chunkText')\n effects.exit('paragraph')\n effects.consume(code)\n return\n }\n\n if (markdownLineEnding(code)) {\n effects.consume(code)\n effects.exit('chunkText')\n return lineStart\n } // Data.\n\n effects.consume(code)\n return data\n }\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Point} Point\n */\n\n/**\n * @typedef {Record<string, unknown>} StackState\n * @typedef {[Construct, StackState]} StackItem\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {splice} from 'micromark-util-chunked'\n/** @type {InitialConstruct} */\n\nexport const document = {\n tokenize: initializeDocument\n}\n/** @type {Construct} */\n\nconst containerConstruct = {\n tokenize: tokenizeContainer\n}\n/** @type {Initializer} */\n\nfunction initializeDocument(effects) {\n const self = this\n /** @type {StackItem[]} */\n\n const stack = []\n let continued = 0\n /** @type {TokenizeContext|undefined} */\n\n let childFlow\n /** @type {Token|undefined} */\n\n let childToken\n /** @type {number} */\n\n let lineStartOffset\n return start\n /** @type {State} */\n\n function start(code) {\n // First we iterate through the open blocks, starting with the root\n // document, and descending through last children down to the last open\n // block.\n // Each block imposes a condition that the line must satisfy if the block is\n // to remain open.\n // For example, a block quote requires a `>` character.\n // A paragraph requires a non-blank line.\n // In this phase we may match all or just some of the open blocks.\n // But we cannot close unmatched blocks yet, because we may have a lazy\n // continuation line.\n if (continued < stack.length) {\n const item = stack[continued]\n self.containerState = item[1]\n return effects.attempt(\n item[0].continuation,\n documentContinue,\n checkNewContainers\n )(code)\n } // Done.\n\n return checkNewContainers(code)\n }\n /** @type {State} */\n\n function documentContinue(code) {\n continued++ // Note: this field is called `_closeFlow` but it also closes containers.\n // Perhaps a good idea to rename it but it’s already used in the wild by\n // extensions.\n\n if (self.containerState._closeFlow) {\n self.containerState._closeFlow = undefined\n\n if (childFlow) {\n closeFlow()\n } // Note: this algorithm for moving events around is similar to the\n // algorithm when dealing with lazy lines in `writeToChild`.\n\n const indexBeforeExits = self.events.length\n let indexBeforeFlow = indexBeforeExits\n /** @type {Point|undefined} */\n\n let point // Find the flow chunk.\n\n while (indexBeforeFlow--) {\n if (\n self.events[indexBeforeFlow][0] === 'exit' &&\n self.events[indexBeforeFlow][1].type === 'chunkFlow'\n ) {\n point = self.events[indexBeforeFlow][1].end\n break\n }\n }\n\n exitContainers(continued) // Fix positions.\n\n let index = indexBeforeExits\n\n while (index < self.events.length) {\n self.events[index][1].end = Object.assign({}, point)\n index++\n } // Inject the exits earlier (they’re still also at the end).\n\n splice(\n self.events,\n indexBeforeFlow + 1,\n 0,\n self.events.slice(indexBeforeExits)\n ) // Discard the duplicate exits.\n\n self.events.length = index\n return checkNewContainers(code)\n }\n\n return start(code)\n }\n /** @type {State} */\n\n function checkNewContainers(code) {\n // Next, after consuming the continuation markers for existing blocks, we\n // look for new block starts (e.g. `>` for a block quote).\n // If we encounter a new block start, we close any blocks unmatched in\n // step 1 before creating the new block as a child of the last matched\n // block.\n if (continued === stack.length) {\n // No need to `check` whether there’s a container, of `exitContainers`\n // would be moot.\n // We can instead immediately `attempt` to parse one.\n if (!childFlow) {\n return documentContinued(code)\n } // If we have concrete content, such as block HTML or fenced code,\n // we can’t have containers “pierce” into them, so we can immediately\n // start.\n\n if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {\n return flowStart(code)\n } // If we do have flow, it could still be a blank line,\n // but we’d be interrupting it w/ a new container if there’s a current\n // construct.\n\n self.interrupt = Boolean(\n childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack\n )\n } // Check if there is a new container.\n\n self.containerState = {}\n return effects.check(\n containerConstruct,\n thereIsANewContainer,\n thereIsNoNewContainer\n )(code)\n }\n /** @type {State} */\n\n function thereIsANewContainer(code) {\n if (childFlow) closeFlow()\n exitContainers(continued)\n return documentContinued(code)\n }\n /** @type {State} */\n\n function thereIsNoNewContainer(code) {\n self.parser.lazy[self.now().line] = continued !== stack.length\n lineStartOffset = self.now().offset\n return flowStart(code)\n }\n /** @type {State} */\n\n function documentContinued(code) {\n // Try new containers.\n self.containerState = {}\n return effects.attempt(\n containerConstruct,\n containerContinue,\n flowStart\n )(code)\n }\n /** @type {State} */\n\n function containerContinue(code) {\n continued++\n stack.push([self.currentConstruct, self.containerState]) // Try another.\n\n return documentContinued(code)\n }\n /** @type {State} */\n\n function flowStart(code) {\n if (code === null) {\n if (childFlow) closeFlow()\n exitContainers(0)\n effects.consume(code)\n return\n }\n\n childFlow = childFlow || self.parser.flow(self.now())\n effects.enter('chunkFlow', {\n contentType: 'flow',\n previous: childToken,\n _tokenizer: childFlow\n })\n return flowContinue(code)\n }\n /** @type {State} */\n\n function flowContinue(code) {\n if (code === null) {\n writeToChild(effects.exit('chunkFlow'), true)\n exitContainers(0)\n effects.consume(code)\n return\n }\n\n if (markdownLineEnding(code)) {\n effects.consume(code)\n writeToChild(effects.exit('chunkFlow')) // Get ready for the next line.\n\n continued = 0\n self.interrupt = undefined\n return start\n }\n\n effects.consume(code)\n return flowContinue\n }\n /**\n * @param {Token} token\n * @param {boolean} [eof]\n * @returns {void}\n */\n\n function writeToChild(token, eof) {\n const stream = self.sliceStream(token)\n if (eof) stream.push(null)\n token.previous = childToken\n if (childToken) childToken.next = token\n childToken = token\n childFlow.defineSkip(token.start)\n childFlow.write(stream) // Alright, so we just added a lazy line:\n //\n // ```markdown\n // > a\n // b.\n //\n // Or:\n //\n // > ~~~c\n // d\n //\n // Or:\n //\n // > | e |\n // f\n // ```\n //\n // The construct in the second example (fenced code) does not accept lazy\n // lines, so it marked itself as done at the end of its first line, and\n // then the content construct parses `d`.\n // Most constructs in markdown match on the first line: if the first line\n // forms a construct, a non-lazy line can’t “unmake” it.\n //\n // The construct in the third example is potentially a GFM table, and\n // those are *weird*.\n // It *could* be a table, from the first line, if the following line\n // matches a condition.\n // In this case, that second line is lazy, which “unmakes” the first line\n // and turns the whole into one content block.\n //\n // We’ve now parsed the non-lazy and the lazy line, and can figure out\n // whether the lazy line started a new flow block.\n // If it did, we exit the current containers between the two flow blocks.\n\n if (self.parser.lazy[token.start.line]) {\n let index = childFlow.events.length\n\n while (index--) {\n if (\n // The token starts before the line ending…\n childFlow.events[index][1].start.offset < lineStartOffset && // …and either is not ended yet…\n (!childFlow.events[index][1].end || // …or ends after it.\n childFlow.events[index][1].end.offset > lineStartOffset)\n ) {\n // Exit: there’s still something open, which means it’s a lazy line\n // part of something.\n return\n }\n } // Note: this algorithm for moving events around is similar to the\n // algorithm when closing flow in `documentContinue`.\n\n const indexBeforeExits = self.events.length\n let indexBeforeFlow = indexBeforeExits\n /** @type {boolean|undefined} */\n\n let seen\n /** @type {Point|undefined} */\n\n let point // Find the previous chunk (the one before the lazy line).\n\n while (indexBeforeFlow--) {\n if (\n self.events[indexBeforeFlow][0] === 'exit' &&\n self.events[indexBeforeFlow][1].type === 'chunkFlow'\n ) {\n if (seen) {\n point = self.events[indexBeforeFlow][1].end\n break\n }\n\n seen = true\n }\n }\n\n exitContainers(continued) // Fix positions.\n\n index = indexBeforeExits\n\n while (index < self.events.length) {\n self.events[index][1].end = Object.assign({}, point)\n index++\n } // Inject the exits earlier (they’re still also at the end).\n\n splice(\n self.events,\n indexBeforeFlow + 1,\n 0,\n self.events.slice(indexBeforeExits)\n ) // Discard the duplicate exits.\n\n self.events.length = index\n }\n }\n /**\n * @param {number} size\n * @returns {void}\n */\n\n function exitContainers(size) {\n let index = stack.length // Exit open containers.\n\n while (index-- > size) {\n const entry = stack[index]\n self.containerState = entry[1]\n entry[0].exit.call(self, effects)\n }\n\n stack.length = size\n }\n\n function closeFlow() {\n childFlow.write([null])\n childToken = undefined\n childFlow = undefined\n self.containerState._closeFlow = undefined\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContainer(effects, ok, nok) {\n return factorySpace(\n effects,\n effects.attempt(this.parser.constructs.document, ok, nok),\n 'linePrefix',\n this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4\n )\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {\n markdownLineEndingOrSpace,\n unicodePunctuation,\n unicodeWhitespace\n} from 'micromark-util-character'\n\n/**\n * Classify whether a character code represents whitespace, punctuation, or\n * something else.\n *\n * Used for attention (emphasis, strong), whose sequences can open or close\n * based on the class of surrounding characters.\n *\n * Note that eof (`null`) is seen as whitespace.\n *\n * @param {Code} code\n * @returns {number|undefined}\n */\nexport function classifyCharacter(code) {\n if (\n code === null ||\n markdownLineEndingOrSpace(code) ||\n unicodeWhitespace(code)\n ) {\n return 1\n }\n\n if (unicodePunctuation(code)) {\n return 2\n }\n}\n","/**\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Resolver} Resolver\n */\n\n/**\n * Call all `resolveAll`s.\n *\n * @param {{resolveAll?: Resolver}[]} constructs\n * @param {Event[]} events\n * @param {TokenizeContext} context\n * @returns {Event[]}\n */\nexport function resolveAll(constructs, events, context) {\n /** @type {Resolver[]} */\n const called = []\n let index = -1\n\n while (++index < constructs.length) {\n const resolve = constructs[index].resolveAll\n\n if (resolve && !called.includes(resolve)) {\n events = resolve(events, context)\n called.push(resolve)\n }\n }\n\n return events\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Point} Point\n */\nimport {push, splice} from 'micromark-util-chunked'\nimport {classifyCharacter} from 'micromark-util-classify-character'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\n/** @type {Construct} */\nexport const attention = {\n name: 'attention',\n tokenize: tokenizeAttention,\n resolveAll: resolveAllAttention\n}\n/**\n * Take all events and resolve attention to emphasis or strong.\n *\n * @type {Resolver}\n */\n\nfunction resolveAllAttention(events, context) {\n let index = -1\n /** @type {number} */\n\n let open\n /** @type {Token} */\n\n let group\n /** @type {Token} */\n\n let text\n /** @type {Token} */\n\n let openingSequence\n /** @type {Token} */\n\n let closingSequence\n /** @type {number} */\n\n let use\n /** @type {Event[]} */\n\n let nextEvents\n /** @type {number} */\n\n let offset // Walk through all events.\n //\n // Note: performance of this is fine on an mb of normal markdown, but it’s\n // a bottleneck for malicious stuff.\n\n while (++index < events.length) {\n // Find a token that can close.\n if (\n events[index][0] === 'enter' &&\n events[index][1].type === 'attentionSequence' &&\n events[index][1]._close\n ) {\n open = index // Now walk back to find an opener.\n\n while (open--) {\n // Find a token that can open the closer.\n if (\n events[open][0] === 'exit' &&\n events[open][1].type === 'attentionSequence' &&\n events[open][1]._open && // If the markers are the same:\n context.sliceSerialize(events[open][1]).charCodeAt(0) ===\n context.sliceSerialize(events[index][1]).charCodeAt(0)\n ) {\n // If the opening can close or the closing can open,\n // and the close size *is not* a multiple of three,\n // but the sum of the opening and closing size *is* multiple of three,\n // then don’t match.\n if (\n (events[open][1]._close || events[index][1]._open) &&\n (events[index][1].end.offset - events[index][1].start.offset) % 3 &&\n !(\n (events[open][1].end.offset -\n events[open][1].start.offset +\n events[index][1].end.offset -\n events[index][1].start.offset) %\n 3\n )\n ) {\n continue\n } // Number of markers to use from the sequence.\n\n use =\n events[open][1].end.offset - events[open][1].start.offset > 1 &&\n events[index][1].end.offset - events[index][1].start.offset > 1\n ? 2\n : 1\n const start = Object.assign({}, events[open][1].end)\n const end = Object.assign({}, events[index][1].start)\n movePoint(start, -use)\n movePoint(end, use)\n openingSequence = {\n type: use > 1 ? 'strongSequence' : 'emphasisSequence',\n start,\n end: Object.assign({}, events[open][1].end)\n }\n closingSequence = {\n type: use > 1 ? 'strongSequence' : 'emphasisSequence',\n start: Object.assign({}, events[index][1].start),\n end\n }\n text = {\n type: use > 1 ? 'strongText' : 'emphasisText',\n start: Object.assign({}, events[open][1].end),\n end: Object.assign({}, events[index][1].start)\n }\n group = {\n type: use > 1 ? 'strong' : 'emphasis',\n start: Object.assign({}, openingSequence.start),\n end: Object.assign({}, closingSequence.end)\n }\n events[open][1].end = Object.assign({}, openingSequence.start)\n events[index][1].start = Object.assign({}, closingSequence.end)\n nextEvents = [] // If there are more markers in the opening, add them before.\n\n if (events[open][1].end.offset - events[open][1].start.offset) {\n nextEvents = push(nextEvents, [\n ['enter', events[open][1], context],\n ['exit', events[open][1], context]\n ])\n } // Opening.\n\n nextEvents = push(nextEvents, [\n ['enter', group, context],\n ['enter', openingSequence, context],\n ['exit', openingSequence, context],\n ['enter', text, context]\n ]) // Between.\n\n nextEvents = push(\n nextEvents,\n resolveAll(\n context.parser.constructs.insideSpan.null,\n events.slice(open + 1, index),\n context\n )\n ) // Closing.\n\n nextEvents = push(nextEvents, [\n ['exit', text, context],\n ['enter', closingSequence, context],\n ['exit', closingSequence, context],\n ['exit', group, context]\n ]) // If there are more markers in the closing, add them after.\n\n if (events[index][1].end.offset - events[index][1].start.offset) {\n offset = 2\n nextEvents = push(nextEvents, [\n ['enter', events[index][1], context],\n ['exit', events[index][1], context]\n ])\n } else {\n offset = 0\n }\n\n splice(events, open - 1, index - open + 3, nextEvents)\n index = open + nextEvents.length - offset - 2\n break\n }\n }\n }\n } // Remove remaining sequences.\n\n index = -1\n\n while (++index < events.length) {\n if (events[index][1].type === 'attentionSequence') {\n events[index][1].type = 'data'\n }\n }\n\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeAttention(effects, ok) {\n const attentionMarkers = this.parser.constructs.attentionMarkers.null\n const previous = this.previous\n const before = classifyCharacter(previous)\n /** @type {NonNullable<Code>} */\n\n let marker\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('attentionSequence')\n marker = code\n return sequence(code)\n }\n /** @type {State} */\n\n function sequence(code) {\n if (code === marker) {\n effects.consume(code)\n return sequence\n }\n\n const token = effects.exit('attentionSequence')\n const after = classifyCharacter(code)\n const open =\n !after || (after === 2 && before) || attentionMarkers.includes(code)\n const close =\n !before || (before === 2 && after) || attentionMarkers.includes(previous)\n token._open = Boolean(marker === 42 ? open : open && (before || !close))\n token._close = Boolean(marker === 42 ? close : close && (after || !open))\n return ok(code)\n }\n}\n/**\n * Move a point a bit.\n *\n * Note: `move` only works inside lines! It’s not possible to move past other\n * chunks (replacement characters, tabs, or line endings).\n *\n * @param {Point} point\n * @param {number} offset\n * @returns {void}\n */\n\nfunction movePoint(point, offset) {\n point.column += offset\n point.offset += offset\n point._bufferIndex += offset\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {\n asciiAlpha,\n asciiAlphanumeric,\n asciiAtext,\n asciiControl\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const autolink = {\n name: 'autolink',\n tokenize: tokenizeAutolink\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeAutolink(effects, ok, nok) {\n let size = 1\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('autolink')\n effects.enter('autolinkMarker')\n effects.consume(code)\n effects.exit('autolinkMarker')\n effects.enter('autolinkProtocol')\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (asciiAlpha(code)) {\n effects.consume(code)\n return schemeOrEmailAtext\n }\n\n return asciiAtext(code) ? emailAtext(code) : nok(code)\n }\n /** @type {State} */\n\n function schemeOrEmailAtext(code) {\n return code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)\n ? schemeInsideOrEmailAtext(code)\n : emailAtext(code)\n }\n /** @type {State} */\n\n function schemeInsideOrEmailAtext(code) {\n if (code === 58) {\n effects.consume(code)\n return urlInside\n }\n\n if (\n (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&\n size++ < 32\n ) {\n effects.consume(code)\n return schemeInsideOrEmailAtext\n }\n\n return emailAtext(code)\n }\n /** @type {State} */\n\n function urlInside(code) {\n if (code === 62) {\n effects.exit('autolinkProtocol')\n return end(code)\n }\n\n if (code === null || code === 32 || code === 60 || asciiControl(code)) {\n return nok(code)\n }\n\n effects.consume(code)\n return urlInside\n }\n /** @type {State} */\n\n function emailAtext(code) {\n if (code === 64) {\n effects.consume(code)\n size = 0\n return emailAtSignOrDot\n }\n\n if (asciiAtext(code)) {\n effects.consume(code)\n return emailAtext\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function emailAtSignOrDot(code) {\n return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)\n }\n /** @type {State} */\n\n function emailLabel(code) {\n if (code === 46) {\n effects.consume(code)\n size = 0\n return emailAtSignOrDot\n }\n\n if (code === 62) {\n // Exit, then change the type.\n effects.exit('autolinkProtocol').type = 'autolinkEmail'\n return end(code)\n }\n\n return emailValue(code)\n }\n /** @type {State} */\n\n function emailValue(code) {\n if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {\n effects.consume(code)\n return code === 45 ? emailValue : emailLabel\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function end(code) {\n effects.enter('autolinkMarker')\n effects.consume(code)\n effects.exit('autolinkMarker')\n effects.exit('autolink')\n return ok\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const blankLine = {\n tokenize: tokenizeBlankLine,\n partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlankLine(effects, ok, nok) {\n return factorySpace(effects, afterWhitespace, 'linePrefix')\n /** @type {State} */\n\n function afterWhitespace(code) {\n return code === null || markdownLineEnding(code) ? ok(code) : nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownSpace} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const blockQuote = {\n name: 'blockQuote',\n tokenize: tokenizeBlockQuoteStart,\n continuation: {\n tokenize: tokenizeBlockQuoteContinuation\n },\n exit\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlockQuoteStart(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n if (code === 62) {\n const state = self.containerState\n\n if (!state.open) {\n effects.enter('blockQuote', {\n _container: true\n })\n state.open = true\n }\n\n effects.enter('blockQuotePrefix')\n effects.enter('blockQuoteMarker')\n effects.consume(code)\n effects.exit('blockQuoteMarker')\n return after\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n if (markdownSpace(code)) {\n effects.enter('blockQuotePrefixWhitespace')\n effects.consume(code)\n effects.exit('blockQuotePrefixWhitespace')\n effects.exit('blockQuotePrefix')\n return ok\n }\n\n effects.exit('blockQuotePrefix')\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlockQuoteContinuation(effects, ok, nok) {\n return factorySpace(\n effects,\n effects.attempt(blockQuote, ok, nok),\n 'linePrefix',\n this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4\n )\n}\n/** @type {Exiter} */\n\nfunction exit(effects) {\n effects.exit('blockQuote')\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {asciiPunctuation} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const characterEscape = {\n name: 'characterEscape',\n tokenize: tokenizeCharacterEscape\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCharacterEscape(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('characterEscape')\n effects.enter('escapeMarker')\n effects.consume(code)\n effects.exit('escapeMarker')\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (asciiPunctuation(code)) {\n effects.enter('characterEscapeValue')\n effects.consume(code)\n effects.exit('characterEscapeValue')\n effects.exit('characterEscape')\n return ok\n }\n\n return nok(code)\n }\n}\n","/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string|false}\n */\nexport function decodeNamedCharacterReference(value) {\n const characterReference = '&' + value + ';'\n element.innerHTML = characterReference\n const char = element.textContent\n\n // Some named character references do not require the closing semicolon\n // (`&not`, for instance), which leads to situations where parsing the assumed\n // named reference of `&notit;` will result in the string `¬it;`.\n // When we encounter a trailing semicolon after parsing, and the character\n // reference to decode was not a semicolon (`&semi;`), we can assume that the\n // matching was not complete.\n // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n // yield `null`.\n if (char.charCodeAt(char.length - 1) === 59 /* `;` */ && value !== 'semi') {\n return false\n }\n\n // If the decoded string is equal to the input, the character reference was\n // not valid.\n // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n // yield `null`.\n return char === characterReference ? false : char\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {\n asciiAlphanumeric,\n asciiDigit,\n asciiHexDigit\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const characterReference = {\n name: 'characterReference',\n tokenize: tokenizeCharacterReference\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCharacterReference(effects, ok, nok) {\n const self = this\n let size = 0\n /** @type {number} */\n\n let max\n /** @type {(code: Code) => code is number} */\n\n let test\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('characterReference')\n effects.enter('characterReferenceMarker')\n effects.consume(code)\n effects.exit('characterReferenceMarker')\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 35) {\n effects.enter('characterReferenceMarkerNumeric')\n effects.consume(code)\n effects.exit('characterReferenceMarkerNumeric')\n return numeric\n }\n\n effects.enter('characterReferenceValue')\n max = 31\n test = asciiAlphanumeric\n return value(code)\n }\n /** @type {State} */\n\n function numeric(code) {\n if (code === 88 || code === 120) {\n effects.enter('characterReferenceMarkerHexadecimal')\n effects.consume(code)\n effects.exit('characterReferenceMarkerHexadecimal')\n effects.enter('characterReferenceValue')\n max = 6\n test = asciiHexDigit\n return value\n }\n\n effects.enter('characterReferenceValue')\n max = 7\n test = asciiDigit\n return value(code)\n }\n /** @type {State} */\n\n function value(code) {\n /** @type {Token} */\n let token\n\n if (code === 59 && size) {\n token = effects.exit('characterReferenceValue')\n\n if (\n test === asciiAlphanumeric &&\n !decodeNamedCharacterReference(self.sliceSerialize(token))\n ) {\n return nok(code)\n }\n\n effects.enter('characterReferenceMarker')\n effects.consume(code)\n effects.exit('characterReferenceMarker')\n effects.exit('characterReference')\n return ok\n }\n\n if (test(code) && size++ < max) {\n effects.consume(code)\n return value\n }\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n markdownLineEnding,\n markdownLineEndingOrSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeFenced = {\n name: 'codeFenced',\n tokenize: tokenizeCodeFenced,\n concrete: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCodeFenced(effects, ok, nok) {\n const self = this\n /** @type {Construct} */\n\n const closingFenceConstruct = {\n tokenize: tokenizeClosingFence,\n partial: true\n }\n /** @type {Construct} */\n\n const nonLazyLine = {\n tokenize: tokenizeNonLazyLine,\n partial: true\n }\n const tail = this.events[this.events.length - 1]\n const initialPrefix =\n tail && tail[1].type === 'linePrefix'\n ? tail[2].sliceSerialize(tail[1], true).length\n : 0\n let sizeOpen = 0\n /** @type {NonNullable<Code>} */\n\n let marker\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('codeFenced')\n effects.enter('codeFencedFence')\n effects.enter('codeFencedFenceSequence')\n marker = code\n return sequenceOpen(code)\n }\n /** @type {State} */\n\n function sequenceOpen(code) {\n if (code === marker) {\n effects.consume(code)\n sizeOpen++\n return sequenceOpen\n }\n\n effects.exit('codeFencedFenceSequence')\n return sizeOpen < 3\n ? nok(code)\n : factorySpace(effects, infoOpen, 'whitespace')(code)\n }\n /** @type {State} */\n\n function infoOpen(code) {\n if (code === null || markdownLineEnding(code)) {\n return openAfter(code)\n }\n\n effects.enter('codeFencedFenceInfo')\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return info(code)\n }\n /** @type {State} */\n\n function info(code) {\n if (code === null || markdownLineEndingOrSpace(code)) {\n effects.exit('chunkString')\n effects.exit('codeFencedFenceInfo')\n return factorySpace(effects, infoAfter, 'whitespace')(code)\n }\n\n if (code === 96 && code === marker) return nok(code)\n effects.consume(code)\n return info\n }\n /** @type {State} */\n\n function infoAfter(code) {\n if (code === null || markdownLineEnding(code)) {\n return openAfter(code)\n }\n\n effects.enter('codeFencedFenceMeta')\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return meta(code)\n }\n /** @type {State} */\n\n function meta(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('chunkString')\n effects.exit('codeFencedFenceMeta')\n return openAfter(code)\n }\n\n if (code === 96 && code === marker) return nok(code)\n effects.consume(code)\n return meta\n }\n /** @type {State} */\n\n function openAfter(code) {\n effects.exit('codeFencedFence')\n return self.interrupt ? ok(code) : contentStart(code)\n }\n /** @type {State} */\n\n function contentStart(code) {\n if (code === null) {\n return after(code)\n }\n\n if (markdownLineEnding(code)) {\n return effects.attempt(\n nonLazyLine,\n effects.attempt(\n closingFenceConstruct,\n after,\n initialPrefix\n ? factorySpace(\n effects,\n contentStart,\n 'linePrefix',\n initialPrefix + 1\n )\n : contentStart\n ),\n after\n )(code)\n }\n\n effects.enter('codeFlowValue')\n return contentContinue(code)\n }\n /** @type {State} */\n\n function contentContinue(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('codeFlowValue')\n return contentStart(code)\n }\n\n effects.consume(code)\n return contentContinue\n }\n /** @type {State} */\n\n function after(code) {\n effects.exit('codeFenced')\n return ok(code)\n }\n /** @type {Tokenizer} */\n\n function tokenizeNonLazyLine(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return lineStart\n }\n /** @type {State} */\n\n function lineStart(code) {\n return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n }\n }\n /** @type {Tokenizer} */\n\n function tokenizeClosingFence(effects, ok, nok) {\n let size = 0\n return factorySpace(\n effects,\n closingSequenceStart,\n 'linePrefix',\n this.parser.constructs.disable.null.includes('codeIndented')\n ? undefined\n : 4\n )\n /** @type {State} */\n\n function closingSequenceStart(code) {\n effects.enter('codeFencedFence')\n effects.enter('codeFencedFenceSequence')\n return closingSequence(code)\n }\n /** @type {State} */\n\n function closingSequence(code) {\n if (code === marker) {\n effects.consume(code)\n size++\n return closingSequence\n }\n\n if (size < sizeOpen) return nok(code)\n effects.exit('codeFencedFenceSequence')\n return factorySpace(effects, closingSequenceEnd, 'whitespace')(code)\n }\n /** @type {State} */\n\n function closingSequenceEnd(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('codeFencedFence')\n return ok(code)\n }\n\n return nok(code)\n }\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeIndented = {\n name: 'codeIndented',\n tokenize: tokenizeCodeIndented\n}\n/** @type {Construct} */\n\nconst indentedContent = {\n tokenize: tokenizeIndentedContent,\n partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCodeIndented(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('codeIndented')\n return factorySpace(effects, afterStartPrefix, 'linePrefix', 4 + 1)(code)\n }\n /** @type {State} */\n\n function afterStartPrefix(code) {\n const tail = self.events[self.events.length - 1]\n return tail &&\n tail[1].type === 'linePrefix' &&\n tail[2].sliceSerialize(tail[1], true).length >= 4\n ? afterPrefix(code)\n : nok(code)\n }\n /** @type {State} */\n\n function afterPrefix(code) {\n if (code === null) {\n return after(code)\n }\n\n if (markdownLineEnding(code)) {\n return effects.attempt(indentedContent, afterPrefix, after)(code)\n }\n\n effects.enter('codeFlowValue')\n return content(code)\n }\n /** @type {State} */\n\n function content(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('codeFlowValue')\n return afterPrefix(code)\n }\n\n effects.consume(code)\n return content\n }\n /** @type {State} */\n\n function after(code) {\n effects.exit('codeIndented')\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeIndentedContent(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n // If this is a lazy line, it can’t be code.\n if (self.parser.lazy[self.now().line]) {\n return nok(code)\n }\n\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return start\n }\n\n return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)\n }\n /** @type {State} */\n\n function afterPrefix(code) {\n const tail = self.events[self.events.length - 1]\n return tail &&\n tail[1].type === 'linePrefix' &&\n tail[2].sliceSerialize(tail[1], true).length >= 4\n ? ok(code)\n : markdownLineEnding(code)\n ? start(code)\n : nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Previous} Previous\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeText = {\n name: 'codeText',\n tokenize: tokenizeCodeText,\n resolve: resolveCodeText,\n previous\n}\n/** @type {Resolver} */\n\nfunction resolveCodeText(events) {\n let tailExitIndex = events.length - 4\n let headEnterIndex = 3\n /** @type {number} */\n\n let index\n /** @type {number|undefined} */\n\n let enter // If we start and end with an EOL or a space.\n\n if (\n (events[headEnterIndex][1].type === 'lineEnding' ||\n events[headEnterIndex][1].type === 'space') &&\n (events[tailExitIndex][1].type === 'lineEnding' ||\n events[tailExitIndex][1].type === 'space')\n ) {\n index = headEnterIndex // And we have data.\n\n while (++index < tailExitIndex) {\n if (events[index][1].type === 'codeTextData') {\n // Then we have padding.\n events[headEnterIndex][1].type = 'codeTextPadding'\n events[tailExitIndex][1].type = 'codeTextPadding'\n headEnterIndex += 2\n tailExitIndex -= 2\n break\n }\n }\n } // Merge adjacent spaces and data.\n\n index = headEnterIndex - 1\n tailExitIndex++\n\n while (++index <= tailExitIndex) {\n if (enter === undefined) {\n if (index !== tailExitIndex && events[index][1].type !== 'lineEnding') {\n enter = index\n }\n } else if (\n index === tailExitIndex ||\n events[index][1].type === 'lineEnding'\n ) {\n events[enter][1].type = 'codeTextData'\n\n if (index !== enter + 2) {\n events[enter][1].end = events[index - 1][1].end\n events.splice(enter + 2, index - enter - 2)\n tailExitIndex -= index - enter - 2\n index = enter + 2\n }\n\n enter = undefined\n }\n }\n\n return events\n}\n/** @type {Previous} */\n\nfunction previous(code) {\n // If there is a previous code, there will always be a tail.\n return (\n code !== 96 ||\n this.events[this.events.length - 1][1].type === 'characterEscape'\n )\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCodeText(effects, ok, nok) {\n const self = this\n let sizeOpen = 0\n /** @type {number} */\n\n let size\n /** @type {Token} */\n\n let token\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('codeText')\n effects.enter('codeTextSequence')\n return openingSequence(code)\n }\n /** @type {State} */\n\n function openingSequence(code) {\n if (code === 96) {\n effects.consume(code)\n sizeOpen++\n return openingSequence\n }\n\n effects.exit('codeTextSequence')\n return gap(code)\n }\n /** @type {State} */\n\n function gap(code) {\n // EOF.\n if (code === null) {\n return nok(code)\n } // Closing fence?\n // Could also be data.\n\n if (code === 96) {\n token = effects.enter('codeTextSequence')\n size = 0\n return closingSequence(code)\n } // Tabs don’t work, and virtual spaces don’t make sense.\n\n if (code === 32) {\n effects.enter('space')\n effects.consume(code)\n effects.exit('space')\n return gap\n }\n\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return gap\n } // Data.\n\n effects.enter('codeTextData')\n return data(code)\n } // In code.\n\n /** @type {State} */\n\n function data(code) {\n if (\n code === null ||\n code === 32 ||\n code === 96 ||\n markdownLineEnding(code)\n ) {\n effects.exit('codeTextData')\n return gap(code)\n }\n\n effects.consume(code)\n return data\n } // Closing fence.\n\n /** @type {State} */\n\n function closingSequence(code) {\n // More.\n if (code === 96) {\n effects.consume(code)\n size++\n return closingSequence\n } // Done!\n\n if (size === sizeOpen) {\n effects.exit('codeTextSequence')\n effects.exit('codeText')\n return ok(code)\n } // More or less accents: mark as data.\n\n token.type = 'codeTextData'\n return data(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Event} Event\n */\nimport {splice} from 'micromark-util-chunked'\n\n/**\n * Tokenize subcontent.\n *\n * @param {Event[]} events\n * @returns {boolean}\n */\nexport function subtokenize(events) {\n /** @type {Record<string, number>} */\n const jumps = {}\n let index = -1\n /** @type {Event} */\n\n let event\n /** @type {number|undefined} */\n\n let lineIndex\n /** @type {number} */\n\n let otherIndex\n /** @type {Event} */\n\n let otherEvent\n /** @type {Event[]} */\n\n let parameters\n /** @type {Event[]} */\n\n let subevents\n /** @type {boolean|undefined} */\n\n let more\n\n while (++index < events.length) {\n while (index in jumps) {\n index = jumps[index]\n }\n\n event = events[index] // Add a hook for the GFM tasklist extension, which needs to know if text\n // is in the first content of a list item.\n\n if (\n index &&\n event[1].type === 'chunkFlow' &&\n events[index - 1][1].type === 'listItemPrefix'\n ) {\n subevents = event[1]._tokenizer.events\n otherIndex = 0\n\n if (\n otherIndex < subevents.length &&\n subevents[otherIndex][1].type === 'lineEndingBlank'\n ) {\n otherIndex += 2\n }\n\n if (\n otherIndex < subevents.length &&\n subevents[otherIndex][1].type === 'content'\n ) {\n while (++otherIndex < subevents.length) {\n if (subevents[otherIndex][1].type === 'content') {\n break\n }\n\n if (subevents[otherIndex][1].type === 'chunkText') {\n subevents[otherIndex][1]._isInFirstContentOfListItem = true\n otherIndex++\n }\n }\n }\n } // Enter.\n\n if (event[0] === 'enter') {\n if (event[1].contentType) {\n Object.assign(jumps, subcontent(events, index))\n index = jumps[index]\n more = true\n }\n } // Exit.\n else if (event[1]._container) {\n otherIndex = index\n lineIndex = undefined\n\n while (otherIndex--) {\n otherEvent = events[otherIndex]\n\n if (\n otherEvent[1].type === 'lineEnding' ||\n otherEvent[1].type === 'lineEndingBlank'\n ) {\n if (otherEvent[0] === 'enter') {\n if (lineIndex) {\n events[lineIndex][1].type = 'lineEndingBlank'\n }\n\n otherEvent[1].type = 'lineEnding'\n lineIndex = otherIndex\n }\n } else {\n break\n }\n }\n\n if (lineIndex) {\n // Fix position.\n event[1].end = Object.assign({}, events[lineIndex][1].start) // Switch container exit w/ line endings.\n\n parameters = events.slice(lineIndex, index)\n parameters.unshift(event)\n splice(events, lineIndex, index - lineIndex + 1, parameters)\n }\n }\n }\n\n return !more\n}\n/**\n * Tokenize embedded tokens.\n *\n * @param {Event[]} events\n * @param {number} eventIndex\n * @returns {Record<string, number>}\n */\n\nfunction subcontent(events, eventIndex) {\n const token = events[eventIndex][1]\n const context = events[eventIndex][2]\n let startPosition = eventIndex - 1\n /** @type {number[]} */\n\n const startPositions = []\n const tokenizer =\n token._tokenizer || context.parser[token.contentType](token.start)\n const childEvents = tokenizer.events\n /** @type {[number, number][]} */\n\n const jumps = []\n /** @type {Record<string, number>} */\n\n const gaps = {}\n /** @type {Chunk[]} */\n\n let stream\n /** @type {Token|undefined} */\n\n let previous\n let index = -1\n /** @type {Token|undefined} */\n\n let current = token\n let adjust = 0\n let start = 0\n const breaks = [start] // Loop forward through the linked tokens to pass them in order to the\n // subtokenizer.\n\n while (current) {\n // Find the position of the event for this token.\n while (events[++startPosition][1] !== current) {\n // Empty.\n }\n\n startPositions.push(startPosition)\n\n if (!current._tokenizer) {\n stream = context.sliceStream(current)\n\n if (!current.next) {\n stream.push(null)\n }\n\n if (previous) {\n tokenizer.defineSkip(current.start)\n }\n\n if (current._isInFirstContentOfListItem) {\n tokenizer._gfmTasklistFirstContentOfListItem = true\n }\n\n tokenizer.write(stream)\n\n if (current._isInFirstContentOfListItem) {\n tokenizer._gfmTasklistFirstContentOfListItem = undefined\n }\n } // Unravel the next token.\n\n previous = current\n current = current.next\n } // Now, loop back through all events (and linked tokens), to figure out which\n // parts belong where.\n\n current = token\n\n while (++index < childEvents.length) {\n if (\n // Find a void token that includes a break.\n childEvents[index][0] === 'exit' &&\n childEvents[index - 1][0] === 'enter' &&\n childEvents[index][1].type === childEvents[index - 1][1].type &&\n childEvents[index][1].start.line !== childEvents[index][1].end.line\n ) {\n start = index + 1\n breaks.push(start) // Help GC.\n\n current._tokenizer = undefined\n current.previous = undefined\n current = current.next\n }\n } // Help GC.\n\n tokenizer.events = [] // If there’s one more token (which is the cases for lines that end in an\n // EOF), that’s perfect: the last point we found starts it.\n // If there isn’t then make sure any remaining content is added to it.\n\n if (current) {\n // Help GC.\n current._tokenizer = undefined\n current.previous = undefined\n } else {\n breaks.pop()\n } // Now splice the events from the subtokenizer into the current events,\n // moving back to front so that splice indices aren’t affected.\n\n index = breaks.length\n\n while (index--) {\n const slice = childEvents.slice(breaks[index], breaks[index + 1])\n const start = startPositions.pop()\n jumps.unshift([start, start + slice.length - 1])\n splice(events, start, 2, slice)\n }\n\n index = -1\n\n while (++index < jumps.length) {\n gaps[adjust + jumps[index][0]] = adjust + jumps[index][1]\n adjust += jumps[index][1] - jumps[index][0] - 1\n }\n\n return gaps\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {subtokenize} from 'micromark-util-subtokenize'\n\n/**\n * No name because it must not be turned off.\n * @type {Construct}\n */\nexport const content = {\n tokenize: tokenizeContent,\n resolve: resolveContent\n}\n/** @type {Construct} */\n\nconst continuationConstruct = {\n tokenize: tokenizeContinuation,\n partial: true\n}\n/**\n * Content is transparent: it’s parsed right now. That way, definitions are also\n * parsed right now: before text in paragraphs (specifically, media) are parsed.\n *\n * @type {Resolver}\n */\n\nfunction resolveContent(events) {\n subtokenize(events)\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContent(effects, ok) {\n /** @type {Token} */\n let previous\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('content')\n previous = effects.enter('chunkContent', {\n contentType: 'content'\n })\n return data(code)\n }\n /** @type {State} */\n\n function data(code) {\n if (code === null) {\n return contentEnd(code)\n }\n\n if (markdownLineEnding(code)) {\n return effects.check(\n continuationConstruct,\n contentContinue,\n contentEnd\n )(code)\n } // Data.\n\n effects.consume(code)\n return data\n }\n /** @type {State} */\n\n function contentEnd(code) {\n effects.exit('chunkContent')\n effects.exit('content')\n return ok(code)\n }\n /** @type {State} */\n\n function contentContinue(code) {\n effects.consume(code)\n effects.exit('chunkContent')\n previous.next = effects.enter('chunkContent', {\n contentType: 'content',\n previous\n })\n previous = previous.next\n return data\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContinuation(effects, ok, nok) {\n const self = this\n return startLookahead\n /** @type {State} */\n\n function startLookahead(code) {\n effects.exit('chunkContent')\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(effects, prefixed, 'linePrefix')\n }\n /** @type {State} */\n\n function prefixed(code) {\n if (code === null || markdownLineEnding(code)) {\n return nok(code)\n }\n\n const tail = self.events[self.events.length - 1]\n\n if (\n !self.parser.constructs.disable.null.includes('codeIndented') &&\n tail &&\n tail[1].type === 'linePrefix' &&\n tail[2].sliceSerialize(tail[1], true).length >= 4\n ) {\n return ok(code)\n }\n\n return effects.interrupt(self.parser.constructs.flow, nok, ok)(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\nimport {\n asciiControl,\n markdownLineEndingOrSpace,\n markdownLineEnding\n} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} literalType\n * @param {string} literalMarkerType\n * @param {string} rawType\n * @param {string} stringType\n * @param {number} [max=Infinity]\n * @returns {State}\n */\n// eslint-disable-next-line max-params\nexport function factoryDestination(\n effects,\n ok,\n nok,\n type,\n literalType,\n literalMarkerType,\n rawType,\n stringType,\n max\n) {\n const limit = max || Number.POSITIVE_INFINITY\n let balance = 0\n return start\n /** @type {State} */\n\n function start(code) {\n if (code === 60) {\n effects.enter(type)\n effects.enter(literalType)\n effects.enter(literalMarkerType)\n effects.consume(code)\n effects.exit(literalMarkerType)\n return destinationEnclosedBefore\n }\n\n if (code === null || code === 41 || asciiControl(code)) {\n return nok(code)\n }\n\n effects.enter(type)\n effects.enter(rawType)\n effects.enter(stringType)\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return destinationRaw(code)\n }\n /** @type {State} */\n\n function destinationEnclosedBefore(code) {\n if (code === 62) {\n effects.enter(literalMarkerType)\n effects.consume(code)\n effects.exit(literalMarkerType)\n effects.exit(literalType)\n effects.exit(type)\n return ok\n }\n\n effects.enter(stringType)\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return destinationEnclosed(code)\n }\n /** @type {State} */\n\n function destinationEnclosed(code) {\n if (code === 62) {\n effects.exit('chunkString')\n effects.exit(stringType)\n return destinationEnclosedBefore(code)\n }\n\n if (code === null || code === 60 || markdownLineEnding(code)) {\n return nok(code)\n }\n\n effects.consume(code)\n return code === 92 ? destinationEnclosedEscape : destinationEnclosed\n }\n /** @type {State} */\n\n function destinationEnclosedEscape(code) {\n if (code === 60 || code === 62 || code === 92) {\n effects.consume(code)\n return destinationEnclosed\n }\n\n return destinationEnclosed(code)\n }\n /** @type {State} */\n\n function destinationRaw(code) {\n if (code === 40) {\n if (++balance > limit) return nok(code)\n effects.consume(code)\n return destinationRaw\n }\n\n if (code === 41) {\n if (!balance--) {\n effects.exit('chunkString')\n effects.exit(stringType)\n effects.exit(rawType)\n effects.exit(type)\n return ok(code)\n }\n\n effects.consume(code)\n return destinationRaw\n }\n\n if (code === null || markdownLineEndingOrSpace(code)) {\n if (balance) return nok(code)\n effects.exit('chunkString')\n effects.exit(stringType)\n effects.exit(rawType)\n effects.exit(type)\n return ok(code)\n }\n\n if (asciiControl(code)) return nok(code)\n effects.consume(code)\n return code === 92 ? destinationRawEscape : destinationRaw\n }\n /** @type {State} */\n\n function destinationRawEscape(code) {\n if (code === 40 || code === 41 || code === 92) {\n effects.consume(code)\n return destinationRaw\n }\n\n return destinationRaw(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/**\n * @this {TokenizeContext}\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} markerType\n * @param {string} stringType\n * @returns {State}\n */\n// eslint-disable-next-line max-params\nexport function factoryLabel(effects, ok, nok, type, markerType, stringType) {\n const self = this\n let size = 0\n /** @type {boolean} */\n\n let data\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter(type)\n effects.enter(markerType)\n effects.consume(code)\n effects.exit(markerType)\n effects.enter(stringType)\n return atBreak\n }\n /** @type {State} */\n\n function atBreak(code) {\n if (\n code === null ||\n code === 91 ||\n (code === 93 && !data) ||\n /* To do: remove in the future once we’ve switched from\n * `micromark-extension-footnote` to `micromark-extension-gfm-footnote`,\n * which doesn’t need this */\n\n /* Hidden footnotes hook */\n\n /* c8 ignore next 3 */\n (code === 94 &&\n !size &&\n '_hiddenFootnoteSupport' in self.parser.constructs) ||\n size > 999\n ) {\n return nok(code)\n }\n\n if (code === 93) {\n effects.exit(stringType)\n effects.enter(markerType)\n effects.consume(code)\n effects.exit(markerType)\n effects.exit(type)\n return ok\n }\n\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return atBreak\n }\n\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return label(code)\n }\n /** @type {State} */\n\n function label(code) {\n if (\n code === null ||\n code === 91 ||\n code === 93 ||\n markdownLineEnding(code) ||\n size++ > 999\n ) {\n effects.exit('chunkString')\n return atBreak(code)\n }\n\n effects.consume(code)\n data = data || !markdownSpace(code)\n return code === 92 ? labelEscape : label\n }\n /** @type {State} */\n\n function labelEscape(code) {\n if (code === 91 || code === 92 || code === 93) {\n effects.consume(code)\n size++\n return label\n }\n\n return label(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} markerType\n * @param {string} stringType\n * @returns {State}\n */\n// eslint-disable-next-line max-params\nexport function factoryTitle(effects, ok, nok, type, markerType, stringType) {\n /** @type {NonNullable<Code>} */\n let marker\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter(type)\n effects.enter(markerType)\n effects.consume(code)\n effects.exit(markerType)\n marker = code === 40 ? 41 : code\n return atFirstTitleBreak\n }\n /** @type {State} */\n\n function atFirstTitleBreak(code) {\n if (code === marker) {\n effects.enter(markerType)\n effects.consume(code)\n effects.exit(markerType)\n effects.exit(type)\n return ok\n }\n\n effects.enter(stringType)\n return atTitleBreak(code)\n }\n /** @type {State} */\n\n function atTitleBreak(code) {\n if (code === marker) {\n effects.exit(stringType)\n return atFirstTitleBreak(marker)\n }\n\n if (code === null) {\n return nok(code)\n } // Note: blank lines can’t exist in content.\n\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(effects, atTitleBreak, 'linePrefix')\n }\n\n effects.enter('chunkString', {\n contentType: 'string'\n })\n return title(code)\n }\n /** @type {State} */\n\n function title(code) {\n if (code === marker || code === null || markdownLineEnding(code)) {\n effects.exit('chunkString')\n return atTitleBreak(code)\n }\n\n effects.consume(code)\n return code === 92 ? titleEscape : title\n }\n /** @type {State} */\n\n function titleEscape(code) {\n if (code === marker || code === 92) {\n effects.consume(code)\n return title\n }\n\n return title(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n */\nexport function factoryWhitespace(effects, ok) {\n /** @type {boolean} */\n let seen\n return start\n /** @type {State} */\n\n function start(code) {\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n seen = true\n return start\n }\n\n if (markdownSpace(code)) {\n return factorySpace(\n effects,\n start,\n seen ? 'linePrefix' : 'lineSuffix'\n )(code)\n }\n\n return ok(code)\n }\n}\n","/**\n * Normalize an identifier (such as used in definitions).\n *\n * @param {string} value\n * @returns {string}\n */\nexport function normalizeIdentifier(value) {\n return (\n value // Collapse Markdown whitespace.\n .replace(/[\\t\\n\\r ]+/g, ' ') // Trim.\n .replace(/^ | $/g, '') // Some characters are considered “uppercase”, but if their lowercase\n // counterpart is uppercased will result in a different uppercase\n // character.\n // Hence, to get that form, we perform both lower- and uppercase.\n // Upper case makes sure keys will not interact with default prototypal\n // methods: no method is uppercase.\n .toLowerCase()\n .toUpperCase()\n )\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factoryDestination} from 'micromark-factory-destination'\nimport {factoryLabel} from 'micromark-factory-label'\nimport {factorySpace} from 'micromark-factory-space'\nimport {factoryTitle} from 'micromark-factory-title'\nimport {factoryWhitespace} from 'micromark-factory-whitespace'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {\n markdownLineEnding,\n markdownLineEndingOrSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const definition = {\n name: 'definition',\n tokenize: tokenizeDefinition\n}\n/** @type {Construct} */\n\nconst titleConstruct = {\n tokenize: tokenizeTitle,\n partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeDefinition(effects, ok, nok) {\n const self = this\n /** @type {string} */\n\n let identifier\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('definition')\n return factoryLabel.call(\n self,\n effects,\n labelAfter,\n nok,\n 'definitionLabel',\n 'definitionLabelMarker',\n 'definitionLabelString'\n )(code)\n }\n /** @type {State} */\n\n function labelAfter(code) {\n identifier = normalizeIdentifier(\n self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)\n )\n\n if (code === 58) {\n effects.enter('definitionMarker')\n effects.consume(code)\n effects.exit('definitionMarker') // Note: blank lines can’t exist in content.\n\n return factoryWhitespace(\n effects,\n factoryDestination(\n effects,\n effects.attempt(\n titleConstruct,\n factorySpace(effects, after, 'whitespace'),\n factorySpace(effects, after, 'whitespace')\n ),\n nok,\n 'definitionDestination',\n 'definitionDestinationLiteral',\n 'definitionDestinationLiteralMarker',\n 'definitionDestinationRaw',\n 'definitionDestinationString'\n )\n )\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('definition')\n\n if (!self.parser.defined.includes(identifier)) {\n self.parser.defined.push(identifier)\n }\n\n return ok(code)\n }\n\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeTitle(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n return markdownLineEndingOrSpace(code)\n ? factoryWhitespace(effects, before)(code)\n : nok(code)\n }\n /** @type {State} */\n\n function before(code) {\n if (code === 34 || code === 39 || code === 40) {\n return factoryTitle(\n effects,\n factorySpace(effects, after, 'whitespace'),\n nok,\n 'definitionTitle',\n 'definitionTitleMarker',\n 'definitionTitleString'\n )(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n return code === null || markdownLineEnding(code) ? ok(code) : nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const hardBreakEscape = {\n name: 'hardBreakEscape',\n tokenize: tokenizeHardBreakEscape\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHardBreakEscape(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('hardBreakEscape')\n effects.enter('escapeMarker')\n effects.consume(code)\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (markdownLineEnding(code)) {\n effects.exit('escapeMarker')\n effects.exit('hardBreakEscape')\n return ok(code)\n }\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n markdownLineEnding,\n markdownLineEndingOrSpace,\n markdownSpace\n} from 'micromark-util-character'\nimport {splice} from 'micromark-util-chunked'\n\n/** @type {Construct} */\nexport const headingAtx = {\n name: 'headingAtx',\n tokenize: tokenizeHeadingAtx,\n resolve: resolveHeadingAtx\n}\n/** @type {Resolver} */\n\nfunction resolveHeadingAtx(events, context) {\n let contentEnd = events.length - 2\n let contentStart = 3\n /** @type {Token} */\n\n let content\n /** @type {Token} */\n\n let text // Prefix whitespace, part of the opening.\n\n if (events[contentStart][1].type === 'whitespace') {\n contentStart += 2\n } // Suffix whitespace, part of the closing.\n\n if (\n contentEnd - 2 > contentStart &&\n events[contentEnd][1].type === 'whitespace'\n ) {\n contentEnd -= 2\n }\n\n if (\n events[contentEnd][1].type === 'atxHeadingSequence' &&\n (contentStart === contentEnd - 1 ||\n (contentEnd - 4 > contentStart &&\n events[contentEnd - 2][1].type === 'whitespace'))\n ) {\n contentEnd -= contentStart + 1 === contentEnd ? 2 : 4\n }\n\n if (contentEnd > contentStart) {\n content = {\n type: 'atxHeadingText',\n start: events[contentStart][1].start,\n end: events[contentEnd][1].end\n }\n text = {\n type: 'chunkText',\n start: events[contentStart][1].start,\n end: events[contentEnd][1].end,\n // @ts-expect-error Constants are fine to assign.\n contentType: 'text'\n }\n splice(events, contentStart, contentEnd - contentStart + 1, [\n ['enter', content, context],\n ['enter', text, context],\n ['exit', text, context],\n ['exit', content, context]\n ])\n }\n\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHeadingAtx(effects, ok, nok) {\n const self = this\n let size = 0\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('atxHeading')\n effects.enter('atxHeadingSequence')\n return fenceOpenInside(code)\n }\n /** @type {State} */\n\n function fenceOpenInside(code) {\n if (code === 35 && size++ < 6) {\n effects.consume(code)\n return fenceOpenInside\n }\n\n if (code === null || markdownLineEndingOrSpace(code)) {\n effects.exit('atxHeadingSequence')\n return self.interrupt ? ok(code) : headingBreak(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function headingBreak(code) {\n if (code === 35) {\n effects.enter('atxHeadingSequence')\n return sequence(code)\n }\n\n if (code === null || markdownLineEnding(code)) {\n effects.exit('atxHeading')\n return ok(code)\n }\n\n if (markdownSpace(code)) {\n return factorySpace(effects, headingBreak, 'whitespace')(code)\n }\n\n effects.enter('atxHeadingText')\n return data(code)\n }\n /** @type {State} */\n\n function sequence(code) {\n if (code === 35) {\n effects.consume(code)\n return sequence\n }\n\n effects.exit('atxHeadingSequence')\n return headingBreak(code)\n }\n /** @type {State} */\n\n function data(code) {\n if (code === null || code === 35 || markdownLineEndingOrSpace(code)) {\n effects.exit('atxHeadingText')\n return headingBreak(code)\n }\n\n effects.consume(code)\n return data\n }\n}\n","/**\n * List of lowercase HTML tag names which when parsing HTML (flow), result\n * in more relaxed rules (condition 6): because they are known blocks, the\n * HTML-like syntax doesn’t have to be strictly parsed.\n * For tag names not in this list, a more strict algorithm (condition 7) is used\n * to detect whether the HTML-like syntax is seen as HTML (flow) or not.\n *\n * This is copied from:\n * <https://spec.commonmark.org/0.29/#html-blocks>.\n */\nexport const htmlBlockNames = [\n 'address',\n 'article',\n 'aside',\n 'base',\n 'basefont',\n 'blockquote',\n 'body',\n 'caption',\n 'center',\n 'col',\n 'colgroup',\n 'dd',\n 'details',\n 'dialog',\n 'dir',\n 'div',\n 'dl',\n 'dt',\n 'fieldset',\n 'figcaption',\n 'figure',\n 'footer',\n 'form',\n 'frame',\n 'frameset',\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'head',\n 'header',\n 'hr',\n 'html',\n 'iframe',\n 'legend',\n 'li',\n 'link',\n 'main',\n 'menu',\n 'menuitem',\n 'nav',\n 'noframes',\n 'ol',\n 'optgroup',\n 'option',\n 'p',\n 'param',\n 'section',\n 'source',\n 'summary',\n 'table',\n 'tbody',\n 'td',\n 'tfoot',\n 'th',\n 'thead',\n 'title',\n 'tr',\n 'track',\n 'ul'\n]\n\n/**\n * List of lowercase HTML tag names which when parsing HTML (flow), result in\n * HTML that can include lines w/o exiting, until a closing tag also in this\n * list is found (condition 1).\n *\n * This module is copied from:\n * <https://spec.commonmark.org/0.29/#html-blocks>.\n *\n * Note that `textarea` is not available in `CommonMark@0.29` but has been\n * merged to the primary branch and is slated to be released in the next release\n * of CommonMark.\n */\nexport const htmlRawNames = ['pre', 'script', 'style', 'textarea']\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {\n asciiAlpha,\n asciiAlphanumeric,\n markdownLineEnding,\n markdownLineEndingOrSpace,\n markdownSpace\n} from 'micromark-util-character'\nimport {htmlBlockNames, htmlRawNames} from 'micromark-util-html-tag-name'\nimport {blankLine} from './blank-line.js'\n/** @type {Construct} */\n\nexport const htmlFlow = {\n name: 'htmlFlow',\n tokenize: tokenizeHtmlFlow,\n resolveTo: resolveToHtmlFlow,\n concrete: true\n}\n/** @type {Construct} */\n\nconst nextBlankConstruct = {\n tokenize: tokenizeNextBlank,\n partial: true\n}\n/** @type {Resolver} */\n\nfunction resolveToHtmlFlow(events) {\n let index = events.length\n\n while (index--) {\n if (events[index][0] === 'enter' && events[index][1].type === 'htmlFlow') {\n break\n }\n }\n\n if (index > 1 && events[index - 2][1].type === 'linePrefix') {\n // Add the prefix start to the HTML token.\n events[index][1].start = events[index - 2][1].start // Add the prefix start to the HTML line token.\n\n events[index + 1][1].start = events[index - 2][1].start // Remove the line prefix.\n\n events.splice(index - 2, 2)\n }\n\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHtmlFlow(effects, ok, nok) {\n const self = this\n /** @type {number} */\n\n let kind\n /** @type {boolean} */\n\n let startTag\n /** @type {string} */\n\n let buffer\n /** @type {number} */\n\n let index\n /** @type {Code} */\n\n let marker\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('htmlFlow')\n effects.enter('htmlFlowData')\n effects.consume(code)\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 33) {\n effects.consume(code)\n return declarationStart\n }\n\n if (code === 47) {\n effects.consume(code)\n return tagCloseStart\n }\n\n if (code === 63) {\n effects.consume(code)\n kind = 3 // While we’re in an instruction instead of a declaration, we’re on a `?`\n // right now, so we do need to search for `>`, similar to declarations.\n\n return self.interrupt ? ok : continuationDeclarationInside\n }\n\n if (asciiAlpha(code)) {\n effects.consume(code)\n buffer = String.fromCharCode(code)\n startTag = true\n return tagName\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function declarationStart(code) {\n if (code === 45) {\n effects.consume(code)\n kind = 2\n return commentOpenInside\n }\n\n if (code === 91) {\n effects.consume(code)\n kind = 5\n buffer = 'CDATA['\n index = 0\n return cdataOpenInside\n }\n\n if (asciiAlpha(code)) {\n effects.consume(code)\n kind = 4\n return self.interrupt ? ok : continuationDeclarationInside\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function commentOpenInside(code) {\n if (code === 45) {\n effects.consume(code)\n return self.interrupt ? ok : continuationDeclarationInside\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function cdataOpenInside(code) {\n if (code === buffer.charCodeAt(index++)) {\n effects.consume(code)\n return index === buffer.length\n ? self.interrupt\n ? ok\n : continuation\n : cdataOpenInside\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function tagCloseStart(code) {\n if (asciiAlpha(code)) {\n effects.consume(code)\n buffer = String.fromCharCode(code)\n return tagName\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function tagName(code) {\n if (\n code === null ||\n code === 47 ||\n code === 62 ||\n markdownLineEndingOrSpace(code)\n ) {\n if (\n code !== 47 &&\n startTag &&\n htmlRawNames.includes(buffer.toLowerCase())\n ) {\n kind = 1\n return self.interrupt ? ok(code) : continuation(code)\n }\n\n if (htmlBlockNames.includes(buffer.toLowerCase())) {\n kind = 6\n\n if (code === 47) {\n effects.consume(code)\n return basicSelfClosing\n }\n\n return self.interrupt ? ok(code) : continuation(code)\n }\n\n kind = 7 // Do not support complete HTML when interrupting\n\n return self.interrupt && !self.parser.lazy[self.now().line]\n ? nok(code)\n : startTag\n ? completeAttributeNameBefore(code)\n : completeClosingTagAfter(code)\n }\n\n if (code === 45 || asciiAlphanumeric(code)) {\n effects.consume(code)\n buffer += String.fromCharCode(code)\n return tagName\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function basicSelfClosing(code) {\n if (code === 62) {\n effects.consume(code)\n return self.interrupt ? ok : continuation\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function completeClosingTagAfter(code) {\n if (markdownSpace(code)) {\n effects.consume(code)\n return completeClosingTagAfter\n }\n\n return completeEnd(code)\n }\n /** @type {State} */\n\n function completeAttributeNameBefore(code) {\n if (code === 47) {\n effects.consume(code)\n return completeEnd\n }\n\n if (code === 58 || code === 95 || asciiAlpha(code)) {\n effects.consume(code)\n return completeAttributeName\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return completeAttributeNameBefore\n }\n\n return completeEnd(code)\n }\n /** @type {State} */\n\n function completeAttributeName(code) {\n if (\n code === 45 ||\n code === 46 ||\n code === 58 ||\n code === 95 ||\n asciiAlphanumeric(code)\n ) {\n effects.consume(code)\n return completeAttributeName\n }\n\n return completeAttributeNameAfter(code)\n }\n /** @type {State} */\n\n function completeAttributeNameAfter(code) {\n if (code === 61) {\n effects.consume(code)\n return completeAttributeValueBefore\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return completeAttributeNameAfter\n }\n\n return completeAttributeNameBefore(code)\n }\n /** @type {State} */\n\n function completeAttributeValueBefore(code) {\n if (\n code === null ||\n code === 60 ||\n code === 61 ||\n code === 62 ||\n code === 96\n ) {\n return nok(code)\n }\n\n if (code === 34 || code === 39) {\n effects.consume(code)\n marker = code\n return completeAttributeValueQuoted\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return completeAttributeValueBefore\n }\n\n marker = null\n return completeAttributeValueUnquoted(code)\n }\n /** @type {State} */\n\n function completeAttributeValueQuoted(code) {\n if (code === null || markdownLineEnding(code)) {\n return nok(code)\n }\n\n if (code === marker) {\n effects.consume(code)\n return completeAttributeValueQuotedAfter\n }\n\n effects.consume(code)\n return completeAttributeValueQuoted\n }\n /** @type {State} */\n\n function completeAttributeValueUnquoted(code) {\n if (\n code === null ||\n code === 34 ||\n code === 39 ||\n code === 60 ||\n code === 61 ||\n code === 62 ||\n code === 96 ||\n markdownLineEndingOrSpace(code)\n ) {\n return completeAttributeNameAfter(code)\n }\n\n effects.consume(code)\n return completeAttributeValueUnquoted\n }\n /** @type {State} */\n\n function completeAttributeValueQuotedAfter(code) {\n if (code === 47 || code === 62 || markdownSpace(code)) {\n return completeAttributeNameBefore(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function completeEnd(code) {\n if (code === 62) {\n effects.consume(code)\n return completeAfter\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function completeAfter(code) {\n if (markdownSpace(code)) {\n effects.consume(code)\n return completeAfter\n }\n\n return code === null || markdownLineEnding(code)\n ? continuation(code)\n : nok(code)\n }\n /** @type {State} */\n\n function continuation(code) {\n if (code === 45 && kind === 2) {\n effects.consume(code)\n return continuationCommentInside\n }\n\n if (code === 60 && kind === 1) {\n effects.consume(code)\n return continuationRawTagOpen\n }\n\n if (code === 62 && kind === 4) {\n effects.consume(code)\n return continuationClose\n }\n\n if (code === 63 && kind === 3) {\n effects.consume(code)\n return continuationDeclarationInside\n }\n\n if (code === 93 && kind === 5) {\n effects.consume(code)\n return continuationCharacterDataInside\n }\n\n if (markdownLineEnding(code) && (kind === 6 || kind === 7)) {\n return effects.check(\n nextBlankConstruct,\n continuationClose,\n continuationAtLineEnding\n )(code)\n }\n\n if (code === null || markdownLineEnding(code)) {\n return continuationAtLineEnding(code)\n }\n\n effects.consume(code)\n return continuation\n }\n /** @type {State} */\n\n function continuationAtLineEnding(code) {\n effects.exit('htmlFlowData')\n return htmlContinueStart(code)\n }\n /** @type {State} */\n\n function htmlContinueStart(code) {\n if (code === null) {\n return done(code)\n }\n\n if (markdownLineEnding(code)) {\n return effects.attempt(\n {\n tokenize: htmlLineEnd,\n partial: true\n },\n htmlContinueStart,\n done\n )(code)\n }\n\n effects.enter('htmlFlowData')\n return continuation(code)\n }\n /** @type {Tokenizer} */\n\n function htmlLineEnd(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return lineStart\n }\n /** @type {State} */\n\n function lineStart(code) {\n return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n }\n }\n /** @type {State} */\n\n function continuationCommentInside(code) {\n if (code === 45) {\n effects.consume(code)\n return continuationDeclarationInside\n }\n\n return continuation(code)\n }\n /** @type {State} */\n\n function continuationRawTagOpen(code) {\n if (code === 47) {\n effects.consume(code)\n buffer = ''\n return continuationRawEndTag\n }\n\n return continuation(code)\n }\n /** @type {State} */\n\n function continuationRawEndTag(code) {\n if (code === 62 && htmlRawNames.includes(buffer.toLowerCase())) {\n effects.consume(code)\n return continuationClose\n }\n\n if (asciiAlpha(code) && buffer.length < 8) {\n effects.consume(code)\n buffer += String.fromCharCode(code)\n return continuationRawEndTag\n }\n\n return continuation(code)\n }\n /** @type {State} */\n\n function continuationCharacterDataInside(code) {\n if (code === 93) {\n effects.consume(code)\n return continuationDeclarationInside\n }\n\n return continuation(code)\n }\n /** @type {State} */\n\n function continuationDeclarationInside(code) {\n if (code === 62) {\n effects.consume(code)\n return continuationClose\n } // More dashes.\n\n if (code === 45 && kind === 2) {\n effects.consume(code)\n return continuationDeclarationInside\n }\n\n return continuation(code)\n }\n /** @type {State} */\n\n function continuationClose(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('htmlFlowData')\n return done(code)\n }\n\n effects.consume(code)\n return continuationClose\n }\n /** @type {State} */\n\n function done(code) {\n effects.exit('htmlFlow')\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeNextBlank(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.exit('htmlFlowData')\n effects.enter('lineEndingBlank')\n effects.consume(code)\n effects.exit('lineEndingBlank')\n return effects.attempt(blankLine, ok, nok)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n asciiAlpha,\n asciiAlphanumeric,\n markdownLineEnding,\n markdownLineEndingOrSpace,\n markdownSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const htmlText = {\n name: 'htmlText',\n tokenize: tokenizeHtmlText\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHtmlText(effects, ok, nok) {\n const self = this\n /** @type {NonNullable<Code>|undefined} */\n\n let marker\n /** @type {string} */\n\n let buffer\n /** @type {number} */\n\n let index\n /** @type {State} */\n\n let returnState\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('htmlText')\n effects.enter('htmlTextData')\n effects.consume(code)\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 33) {\n effects.consume(code)\n return declarationOpen\n }\n\n if (code === 47) {\n effects.consume(code)\n return tagCloseStart\n }\n\n if (code === 63) {\n effects.consume(code)\n return instruction\n }\n\n if (asciiAlpha(code)) {\n effects.consume(code)\n return tagOpen\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function declarationOpen(code) {\n if (code === 45) {\n effects.consume(code)\n return commentOpen\n }\n\n if (code === 91) {\n effects.consume(code)\n buffer = 'CDATA['\n index = 0\n return cdataOpen\n }\n\n if (asciiAlpha(code)) {\n effects.consume(code)\n return declaration\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function commentOpen(code) {\n if (code === 45) {\n effects.consume(code)\n return commentStart\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function commentStart(code) {\n if (code === null || code === 62) {\n return nok(code)\n }\n\n if (code === 45) {\n effects.consume(code)\n return commentStartDash\n }\n\n return comment(code)\n }\n /** @type {State} */\n\n function commentStartDash(code) {\n if (code === null || code === 62) {\n return nok(code)\n }\n\n return comment(code)\n }\n /** @type {State} */\n\n function comment(code) {\n if (code === null) {\n return nok(code)\n }\n\n if (code === 45) {\n effects.consume(code)\n return commentClose\n }\n\n if (markdownLineEnding(code)) {\n returnState = comment\n return atLineEnding(code)\n }\n\n effects.consume(code)\n return comment\n }\n /** @type {State} */\n\n function commentClose(code) {\n if (code === 45) {\n effects.consume(code)\n return end\n }\n\n return comment(code)\n }\n /** @type {State} */\n\n function cdataOpen(code) {\n if (code === buffer.charCodeAt(index++)) {\n effects.consume(code)\n return index === buffer.length ? cdata : cdataOpen\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function cdata(code) {\n if (code === null) {\n return nok(code)\n }\n\n if (code === 93) {\n effects.consume(code)\n return cdataClose\n }\n\n if (markdownLineEnding(code)) {\n returnState = cdata\n return atLineEnding(code)\n }\n\n effects.consume(code)\n return cdata\n }\n /** @type {State} */\n\n function cdataClose(code) {\n if (code === 93) {\n effects.consume(code)\n return cdataEnd\n }\n\n return cdata(code)\n }\n /** @type {State} */\n\n function cdataEnd(code) {\n if (code === 62) {\n return end(code)\n }\n\n if (code === 93) {\n effects.consume(code)\n return cdataEnd\n }\n\n return cdata(code)\n }\n /** @type {State} */\n\n function declaration(code) {\n if (code === null || code === 62) {\n return end(code)\n }\n\n if (markdownLineEnding(code)) {\n returnState = declaration\n return atLineEnding(code)\n }\n\n effects.consume(code)\n return declaration\n }\n /** @type {State} */\n\n function instruction(code) {\n if (code === null) {\n return nok(code)\n }\n\n if (code === 63) {\n effects.consume(code)\n return instructionClose\n }\n\n if (markdownLineEnding(code)) {\n returnState = instruction\n return atLineEnding(code)\n }\n\n effects.consume(code)\n return instruction\n }\n /** @type {State} */\n\n function instructionClose(code) {\n return code === 62 ? end(code) : instruction(code)\n }\n /** @type {State} */\n\n function tagCloseStart(code) {\n if (asciiAlpha(code)) {\n effects.consume(code)\n return tagClose\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function tagClose(code) {\n if (code === 45 || asciiAlphanumeric(code)) {\n effects.consume(code)\n return tagClose\n }\n\n return tagCloseBetween(code)\n }\n /** @type {State} */\n\n function tagCloseBetween(code) {\n if (markdownLineEnding(code)) {\n returnState = tagCloseBetween\n return atLineEnding(code)\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return tagCloseBetween\n }\n\n return end(code)\n }\n /** @type {State} */\n\n function tagOpen(code) {\n if (code === 45 || asciiAlphanumeric(code)) {\n effects.consume(code)\n return tagOpen\n }\n\n if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {\n return tagOpenBetween(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function tagOpenBetween(code) {\n if (code === 47) {\n effects.consume(code)\n return end\n }\n\n if (code === 58 || code === 95 || asciiAlpha(code)) {\n effects.consume(code)\n return tagOpenAttributeName\n }\n\n if (markdownLineEnding(code)) {\n returnState = tagOpenBetween\n return atLineEnding(code)\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return tagOpenBetween\n }\n\n return end(code)\n }\n /** @type {State} */\n\n function tagOpenAttributeName(code) {\n if (\n code === 45 ||\n code === 46 ||\n code === 58 ||\n code === 95 ||\n asciiAlphanumeric(code)\n ) {\n effects.consume(code)\n return tagOpenAttributeName\n }\n\n return tagOpenAttributeNameAfter(code)\n }\n /** @type {State} */\n\n function tagOpenAttributeNameAfter(code) {\n if (code === 61) {\n effects.consume(code)\n return tagOpenAttributeValueBefore\n }\n\n if (markdownLineEnding(code)) {\n returnState = tagOpenAttributeNameAfter\n return atLineEnding(code)\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return tagOpenAttributeNameAfter\n }\n\n return tagOpenBetween(code)\n }\n /** @type {State} */\n\n function tagOpenAttributeValueBefore(code) {\n if (\n code === null ||\n code === 60 ||\n code === 61 ||\n code === 62 ||\n code === 96\n ) {\n return nok(code)\n }\n\n if (code === 34 || code === 39) {\n effects.consume(code)\n marker = code\n return tagOpenAttributeValueQuoted\n }\n\n if (markdownLineEnding(code)) {\n returnState = tagOpenAttributeValueBefore\n return atLineEnding(code)\n }\n\n if (markdownSpace(code)) {\n effects.consume(code)\n return tagOpenAttributeValueBefore\n }\n\n effects.consume(code)\n marker = undefined\n return tagOpenAttributeValueUnquoted\n }\n /** @type {State} */\n\n function tagOpenAttributeValueQuoted(code) {\n if (code === marker) {\n effects.consume(code)\n return tagOpenAttributeValueQuotedAfter\n }\n\n if (code === null) {\n return nok(code)\n }\n\n if (markdownLineEnding(code)) {\n returnState = tagOpenAttributeValueQuoted\n return atLineEnding(code)\n }\n\n effects.consume(code)\n return tagOpenAttributeValueQuoted\n }\n /** @type {State} */\n\n function tagOpenAttributeValueQuotedAfter(code) {\n if (code === 62 || code === 47 || markdownLineEndingOrSpace(code)) {\n return tagOpenBetween(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function tagOpenAttributeValueUnquoted(code) {\n if (\n code === null ||\n code === 34 ||\n code === 39 ||\n code === 60 ||\n code === 61 ||\n code === 96\n ) {\n return nok(code)\n }\n\n if (code === 62 || markdownLineEndingOrSpace(code)) {\n return tagOpenBetween(code)\n }\n\n effects.consume(code)\n return tagOpenAttributeValueUnquoted\n } // We can’t have blank lines in content, so no need to worry about empty\n // tokens.\n\n /** @type {State} */\n\n function atLineEnding(code) {\n effects.exit('htmlTextData')\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(\n effects,\n afterPrefix,\n 'linePrefix',\n self.parser.constructs.disable.null.includes('codeIndented')\n ? undefined\n : 4\n )\n }\n /** @type {State} */\n\n function afterPrefix(code) {\n effects.enter('htmlTextData')\n return returnState(code)\n }\n /** @type {State} */\n\n function end(code) {\n if (code === 62) {\n effects.consume(code)\n effects.exit('htmlTextData')\n effects.exit('htmlText')\n return ok\n }\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factoryDestination} from 'micromark-factory-destination'\nimport {factoryLabel} from 'micromark-factory-label'\nimport {factoryTitle} from 'micromark-factory-title'\nimport {factoryWhitespace} from 'micromark-factory-whitespace'\nimport {markdownLineEndingOrSpace} from 'micromark-util-character'\nimport {push, splice} from 'micromark-util-chunked'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\n/** @type {Construct} */\nexport const labelEnd = {\n name: 'labelEnd',\n tokenize: tokenizeLabelEnd,\n resolveTo: resolveToLabelEnd,\n resolveAll: resolveAllLabelEnd\n}\n/** @type {Construct} */\n\nconst resourceConstruct = {\n tokenize: tokenizeResource\n}\n/** @type {Construct} */\n\nconst fullReferenceConstruct = {\n tokenize: tokenizeFullReference\n}\n/** @type {Construct} */\n\nconst collapsedReferenceConstruct = {\n tokenize: tokenizeCollapsedReference\n}\n/** @type {Resolver} */\n\nfunction resolveAllLabelEnd(events) {\n let index = -1\n /** @type {Token} */\n\n let token\n\n while (++index < events.length) {\n token = events[index][1]\n\n if (\n token.type === 'labelImage' ||\n token.type === 'labelLink' ||\n token.type === 'labelEnd'\n ) {\n // Remove the marker.\n events.splice(index + 1, token.type === 'labelImage' ? 4 : 2)\n token.type = 'data'\n index++\n }\n }\n\n return events\n}\n/** @type {Resolver} */\n\nfunction resolveToLabelEnd(events, context) {\n let index = events.length\n let offset = 0\n /** @type {Token} */\n\n let token\n /** @type {number|undefined} */\n\n let open\n /** @type {number|undefined} */\n\n let close\n /** @type {Event[]} */\n\n let media // Find an opening.\n\n while (index--) {\n token = events[index][1]\n\n if (open) {\n // If we see another link, or inactive link label, we’ve been here before.\n if (\n token.type === 'link' ||\n (token.type === 'labelLink' && token._inactive)\n ) {\n break\n } // Mark other link openings as inactive, as we can’t have links in\n // links.\n\n if (events[index][0] === 'enter' && token.type === 'labelLink') {\n token._inactive = true\n }\n } else if (close) {\n if (\n events[index][0] === 'enter' &&\n (token.type === 'labelImage' || token.type === 'labelLink') &&\n !token._balanced\n ) {\n open = index\n\n if (token.type !== 'labelLink') {\n offset = 2\n break\n }\n }\n } else if (token.type === 'labelEnd') {\n close = index\n }\n }\n\n const group = {\n type: events[open][1].type === 'labelLink' ? 'link' : 'image',\n start: Object.assign({}, events[open][1].start),\n end: Object.assign({}, events[events.length - 1][1].end)\n }\n const label = {\n type: 'label',\n start: Object.assign({}, events[open][1].start),\n end: Object.assign({}, events[close][1].end)\n }\n const text = {\n type: 'labelText',\n start: Object.assign({}, events[open + offset + 2][1].end),\n end: Object.assign({}, events[close - 2][1].start)\n }\n media = [\n ['enter', group, context],\n ['enter', label, context]\n ] // Opening marker.\n\n media = push(media, events.slice(open + 1, open + offset + 3)) // Text open.\n\n media = push(media, [['enter', text, context]]) // Between.\n\n media = push(\n media,\n resolveAll(\n context.parser.constructs.insideSpan.null,\n events.slice(open + offset + 4, close - 3),\n context\n )\n ) // Text close, marker close, label close.\n\n media = push(media, [\n ['exit', text, context],\n events[close - 2],\n events[close - 1],\n ['exit', label, context]\n ]) // Reference, resource, or so.\n\n media = push(media, events.slice(close + 1)) // Media close.\n\n media = push(media, [['exit', group, context]])\n splice(events, open, events.length, media)\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelEnd(effects, ok, nok) {\n const self = this\n let index = self.events.length\n /** @type {Token} */\n\n let labelStart\n /** @type {boolean} */\n\n let defined // Find an opening.\n\n while (index--) {\n if (\n (self.events[index][1].type === 'labelImage' ||\n self.events[index][1].type === 'labelLink') &&\n !self.events[index][1]._balanced\n ) {\n labelStart = self.events[index][1]\n break\n }\n }\n\n return start\n /** @type {State} */\n\n function start(code) {\n if (!labelStart) {\n return nok(code)\n } // It’s a balanced bracket, but contains a link.\n\n if (labelStart._inactive) return balanced(code)\n defined = self.parser.defined.includes(\n normalizeIdentifier(\n self.sliceSerialize({\n start: labelStart.end,\n end: self.now()\n })\n )\n )\n effects.enter('labelEnd')\n effects.enter('labelMarker')\n effects.consume(code)\n effects.exit('labelMarker')\n effects.exit('labelEnd')\n return afterLabelEnd\n }\n /** @type {State} */\n\n function afterLabelEnd(code) {\n // Resource: `[asd](fgh)`.\n if (code === 40) {\n return effects.attempt(\n resourceConstruct,\n ok,\n defined ? ok : balanced\n )(code)\n } // Collapsed (`[asd][]`) or full (`[asd][fgh]`) reference?\n\n if (code === 91) {\n return effects.attempt(\n fullReferenceConstruct,\n ok,\n defined\n ? effects.attempt(collapsedReferenceConstruct, ok, balanced)\n : balanced\n )(code)\n } // Shortcut reference: `[asd]`?\n\n return defined ? ok(code) : balanced(code)\n }\n /** @type {State} */\n\n function balanced(code) {\n labelStart._balanced = true\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeResource(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('resource')\n effects.enter('resourceMarker')\n effects.consume(code)\n effects.exit('resourceMarker')\n return factoryWhitespace(effects, open)\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 41) {\n return end(code)\n }\n\n return factoryDestination(\n effects,\n destinationAfter,\n nok,\n 'resourceDestination',\n 'resourceDestinationLiteral',\n 'resourceDestinationLiteralMarker',\n 'resourceDestinationRaw',\n 'resourceDestinationString',\n 32\n )(code)\n }\n /** @type {State} */\n\n function destinationAfter(code) {\n return markdownLineEndingOrSpace(code)\n ? factoryWhitespace(effects, between)(code)\n : end(code)\n }\n /** @type {State} */\n\n function between(code) {\n if (code === 34 || code === 39 || code === 40) {\n return factoryTitle(\n effects,\n factoryWhitespace(effects, end),\n nok,\n 'resourceTitle',\n 'resourceTitleMarker',\n 'resourceTitleString'\n )(code)\n }\n\n return end(code)\n }\n /** @type {State} */\n\n function end(code) {\n if (code === 41) {\n effects.enter('resourceMarker')\n effects.consume(code)\n effects.exit('resourceMarker')\n effects.exit('resource')\n return ok\n }\n\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeFullReference(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n return factoryLabel.call(\n self,\n effects,\n afterLabel,\n nok,\n 'reference',\n 'referenceMarker',\n 'referenceString'\n )(code)\n }\n /** @type {State} */\n\n function afterLabel(code) {\n return self.parser.defined.includes(\n normalizeIdentifier(\n self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)\n )\n )\n ? ok(code)\n : nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCollapsedReference(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('reference')\n effects.enter('referenceMarker')\n effects.consume(code)\n effects.exit('referenceMarker')\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 93) {\n effects.enter('referenceMarker')\n effects.consume(code)\n effects.exit('referenceMarker')\n effects.exit('reference')\n return ok\n }\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {labelEnd} from './label-end.js'\n/** @type {Construct} */\n\nexport const labelStartImage = {\n name: 'labelStartImage',\n tokenize: tokenizeLabelStartImage,\n resolveAll: labelEnd.resolveAll\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelStartImage(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('labelImage')\n effects.enter('labelImageMarker')\n effects.consume(code)\n effects.exit('labelImageMarker')\n return open\n }\n /** @type {State} */\n\n function open(code) {\n if (code === 91) {\n effects.enter('labelMarker')\n effects.consume(code)\n effects.exit('labelMarker')\n effects.exit('labelImage')\n return after\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n /* To do: remove in the future once we’ve switched from\n * `micromark-extension-footnote` to `micromark-extension-gfm-footnote`,\n * which doesn’t need this */\n\n /* Hidden footnotes hook */\n\n /* c8 ignore next 3 */\n return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs\n ? nok(code)\n : ok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {labelEnd} from './label-end.js'\n/** @type {Construct} */\n\nexport const labelStartLink = {\n name: 'labelStartLink',\n tokenize: tokenizeLabelStartLink,\n resolveAll: labelEnd.resolveAll\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelStartLink(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('labelLink')\n effects.enter('labelMarker')\n effects.consume(code)\n effects.exit('labelMarker')\n effects.exit('labelLink')\n return after\n }\n /** @type {State} */\n\n function after(code) {\n /* To do: remove in the future once we’ve switched from\n * `micromark-extension-footnote` to `micromark-extension-gfm-footnote`,\n * which doesn’t need this */\n\n /* Hidden footnotes hook. */\n\n /* c8 ignore next 3 */\n return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs\n ? nok(code)\n : ok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const lineEnding = {\n name: 'lineEnding',\n tokenize: tokenizeLineEnding\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLineEnding(effects, ok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(effects, ok, 'linePrefix')\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const thematicBreak = {\n name: 'thematicBreak',\n tokenize: tokenizeThematicBreak\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeThematicBreak(effects, ok, nok) {\n let size = 0\n /** @type {NonNullable<Code>} */\n\n let marker\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('thematicBreak')\n marker = code\n return atBreak(code)\n }\n /** @type {State} */\n\n function atBreak(code) {\n if (code === marker) {\n effects.enter('thematicBreakSequence')\n return sequence(code)\n }\n\n if (markdownSpace(code)) {\n return factorySpace(effects, atBreak, 'whitespace')(code)\n }\n\n if (size < 3 || (code !== null && !markdownLineEnding(code))) {\n return nok(code)\n }\n\n effects.exit('thematicBreak')\n return ok(code)\n }\n /** @type {State} */\n\n function sequence(code) {\n if (code === marker) {\n effects.consume(code)\n size++\n return sequence\n }\n\n effects.exit('thematicBreakSequence')\n return atBreak(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\n\n/**\n * @typedef {Record<string, unknown> & {marker: Code, type: string, size: number}} ListContainerState\n * @typedef {TokenizeContext & {containerState: ListContainerState}} TokenizeContextWithState\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {asciiDigit, markdownSpace} from 'micromark-util-character'\nimport {blankLine} from './blank-line.js'\nimport {thematicBreak} from './thematic-break.js'\n/** @type {Construct} */\n\nexport const list = {\n name: 'list',\n tokenize: tokenizeListStart,\n continuation: {\n tokenize: tokenizeListContinuation\n },\n exit: tokenizeListEnd\n}\n/** @type {Construct} */\n\nconst listItemPrefixWhitespaceConstruct = {\n tokenize: tokenizeListItemPrefixWhitespace,\n partial: true\n}\n/** @type {Construct} */\n\nconst indentConstruct = {\n tokenize: tokenizeIndent,\n partial: true\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListStart(effects, ok, nok) {\n const self = this\n const tail = self.events[self.events.length - 1]\n let initialSize =\n tail && tail[1].type === 'linePrefix'\n ? tail[2].sliceSerialize(tail[1], true).length\n : 0\n let size = 0\n return start\n /** @type {State} */\n\n function start(code) {\n const kind =\n self.containerState.type ||\n (code === 42 || code === 43 || code === 45\n ? 'listUnordered'\n : 'listOrdered')\n\n if (\n kind === 'listUnordered'\n ? !self.containerState.marker || code === self.containerState.marker\n : asciiDigit(code)\n ) {\n if (!self.containerState.type) {\n self.containerState.type = kind\n effects.enter(kind, {\n _container: true\n })\n }\n\n if (kind === 'listUnordered') {\n effects.enter('listItemPrefix')\n return code === 42 || code === 45\n ? effects.check(thematicBreak, nok, atMarker)(code)\n : atMarker(code)\n }\n\n if (!self.interrupt || code === 49) {\n effects.enter('listItemPrefix')\n effects.enter('listItemValue')\n return inside(code)\n }\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function inside(code) {\n if (asciiDigit(code) && ++size < 10) {\n effects.consume(code)\n return inside\n }\n\n if (\n (!self.interrupt || size < 2) &&\n (self.containerState.marker\n ? code === self.containerState.marker\n : code === 41 || code === 46)\n ) {\n effects.exit('listItemValue')\n return atMarker(code)\n }\n\n return nok(code)\n }\n /**\n * @type {State}\n **/\n\n function atMarker(code) {\n effects.enter('listItemMarker')\n effects.consume(code)\n effects.exit('listItemMarker')\n self.containerState.marker = self.containerState.marker || code\n return effects.check(\n blankLine, // Can’t be empty when interrupting.\n self.interrupt ? nok : onBlank,\n effects.attempt(\n listItemPrefixWhitespaceConstruct,\n endOfPrefix,\n otherPrefix\n )\n )\n }\n /** @type {State} */\n\n function onBlank(code) {\n self.containerState.initialBlankLine = true\n initialSize++\n return endOfPrefix(code)\n }\n /** @type {State} */\n\n function otherPrefix(code) {\n if (markdownSpace(code)) {\n effects.enter('listItemPrefixWhitespace')\n effects.consume(code)\n effects.exit('listItemPrefixWhitespace')\n return endOfPrefix\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function endOfPrefix(code) {\n self.containerState.size =\n initialSize +\n self.sliceSerialize(effects.exit('listItemPrefix'), true).length\n return ok(code)\n }\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListContinuation(effects, ok, nok) {\n const self = this\n self.containerState._closeFlow = undefined\n return effects.check(blankLine, onBlank, notBlank)\n /** @type {State} */\n\n function onBlank(code) {\n self.containerState.furtherBlankLines =\n self.containerState.furtherBlankLines ||\n self.containerState.initialBlankLine // We have a blank line.\n // Still, try to consume at most the items size.\n\n return factorySpace(\n effects,\n ok,\n 'listItemIndent',\n self.containerState.size + 1\n )(code)\n }\n /** @type {State} */\n\n function notBlank(code) {\n if (self.containerState.furtherBlankLines || !markdownSpace(code)) {\n self.containerState.furtherBlankLines = undefined\n self.containerState.initialBlankLine = undefined\n return notInCurrentItem(code)\n }\n\n self.containerState.furtherBlankLines = undefined\n self.containerState.initialBlankLine = undefined\n return effects.attempt(indentConstruct, ok, notInCurrentItem)(code)\n }\n /** @type {State} */\n\n function notInCurrentItem(code) {\n // While we do continue, we signal that the flow should be closed.\n self.containerState._closeFlow = true // As we’re closing flow, we’re no longer interrupting.\n\n self.interrupt = undefined\n return factorySpace(\n effects,\n effects.attempt(list, ok, nok),\n 'linePrefix',\n self.parser.constructs.disable.null.includes('codeIndented')\n ? undefined\n : 4\n )(code)\n }\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeIndent(effects, ok, nok) {\n const self = this\n return factorySpace(\n effects,\n afterPrefix,\n 'listItemIndent',\n self.containerState.size + 1\n )\n /** @type {State} */\n\n function afterPrefix(code) {\n const tail = self.events[self.events.length - 1]\n return tail &&\n tail[1].type === 'listItemIndent' &&\n tail[2].sliceSerialize(tail[1], true).length === self.containerState.size\n ? ok(code)\n : nok(code)\n }\n}\n/**\n * @type {Exiter}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListEnd(effects) {\n effects.exit(this.containerState.type)\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListItemPrefixWhitespace(effects, ok, nok) {\n const self = this\n return factorySpace(\n effects,\n afterPrefix,\n 'listItemPrefixWhitespace',\n self.parser.constructs.disable.null.includes('codeIndented')\n ? undefined\n : 4 + 1\n )\n /** @type {State} */\n\n function afterPrefix(code) {\n const tail = self.events[self.events.length - 1]\n return !markdownSpace(code) &&\n tail &&\n tail[1].type === 'listItemPrefixWhitespace'\n ? ok(code)\n : nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const setextUnderline = {\n name: 'setextUnderline',\n tokenize: tokenizeSetextUnderline,\n resolveTo: resolveToSetextUnderline\n}\n/** @type {Resolver} */\n\nfunction resolveToSetextUnderline(events, context) {\n let index = events.length\n /** @type {number|undefined} */\n\n let content\n /** @type {number|undefined} */\n\n let text\n /** @type {number|undefined} */\n\n let definition // Find the opening of the content.\n // It’ll always exist: we don’t tokenize if it isn’t there.\n\n while (index--) {\n if (events[index][0] === 'enter') {\n if (events[index][1].type === 'content') {\n content = index\n break\n }\n\n if (events[index][1].type === 'paragraph') {\n text = index\n }\n } // Exit\n else {\n if (events[index][1].type === 'content') {\n // Remove the content end (if needed we’ll add it later)\n events.splice(index, 1)\n }\n\n if (!definition && events[index][1].type === 'definition') {\n definition = index\n }\n }\n }\n\n const heading = {\n type: 'setextHeading',\n start: Object.assign({}, events[text][1].start),\n end: Object.assign({}, events[events.length - 1][1].end)\n } // Change the paragraph to setext heading text.\n\n events[text][1].type = 'setextHeadingText' // If we have definitions in the content, we’ll keep on having content,\n // but we need move it.\n\n if (definition) {\n events.splice(text, 0, ['enter', heading, context])\n events.splice(definition + 1, 0, ['exit', events[content][1], context])\n events[content][1].end = Object.assign({}, events[definition][1].end)\n } else {\n events[content][1] = heading\n } // Add the heading exit at the end.\n\n events.push(['exit', heading, context])\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeSetextUnderline(effects, ok, nok) {\n const self = this\n let index = self.events.length\n /** @type {NonNullable<Code>} */\n\n let marker\n /** @type {boolean} */\n\n let paragraph // Find an opening.\n\n while (index--) {\n // Skip enter/exit of line ending, line prefix, and content.\n // We can now either have a definition or a paragraph.\n if (\n self.events[index][1].type !== 'lineEnding' &&\n self.events[index][1].type !== 'linePrefix' &&\n self.events[index][1].type !== 'content'\n ) {\n paragraph = self.events[index][1].type === 'paragraph'\n break\n }\n }\n\n return start\n /** @type {State} */\n\n function start(code) {\n if (!self.parser.lazy[self.now().line] && (self.interrupt || paragraph)) {\n effects.enter('setextHeadingLine')\n effects.enter('setextHeadingLineSequence')\n marker = code\n return closingSequence(code)\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function closingSequence(code) {\n if (code === marker) {\n effects.consume(code)\n return closingSequence\n }\n\n effects.exit('setextHeadingLineSequence')\n return factorySpace(effects, closingSequenceEnd, 'lineSuffix')(code)\n }\n /** @type {State} */\n\n function closingSequenceEnd(code) {\n if (code === null || markdownLineEnding(code)) {\n effects.exit('setextHeadingLine')\n return ok(code)\n }\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {blankLine, content} from 'micromark-core-commonmark'\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {InitialConstruct} */\nexport const flow = {\n tokenize: initializeFlow\n}\n/** @type {Initializer} */\n\nfunction initializeFlow(effects) {\n const self = this\n const initial = effects.attempt(\n // Try to parse a blank line.\n blankLine,\n atBlankEnding, // Try to parse initial flow (essentially, only code).\n effects.attempt(\n this.parser.constructs.flowInitial,\n afterConstruct,\n factorySpace(\n effects,\n effects.attempt(\n this.parser.constructs.flow,\n afterConstruct,\n effects.attempt(content, afterConstruct)\n ),\n 'linePrefix'\n )\n )\n )\n return initial\n /** @type {State} */\n\n function atBlankEnding(code) {\n if (code === null) {\n effects.consume(code)\n return\n }\n\n effects.enter('lineEndingBlank')\n effects.consume(code)\n effects.exit('lineEndingBlank')\n self.currentConstruct = undefined\n return initial\n }\n /** @type {State} */\n\n function afterConstruct(code) {\n if (code === null) {\n effects.consume(code)\n return\n }\n\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n self.currentConstruct = undefined\n return initial\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nexport const resolver = {\n resolveAll: createResolver()\n}\nexport const string = initializeFactory('string')\nexport const text = initializeFactory('text')\n/**\n * @param {'string'|'text'} field\n * @returns {InitialConstruct}\n */\n\nfunction initializeFactory(field) {\n return {\n tokenize: initializeText,\n resolveAll: createResolver(\n field === 'text' ? resolveAllLineSuffixes : undefined\n )\n }\n /** @type {Initializer} */\n\n function initializeText(effects) {\n const self = this\n const constructs = this.parser.constructs[field]\n const text = effects.attempt(constructs, start, notText)\n return start\n /** @type {State} */\n\n function start(code) {\n return atBreak(code) ? text(code) : notText(code)\n }\n /** @type {State} */\n\n function notText(code) {\n if (code === null) {\n effects.consume(code)\n return\n }\n\n effects.enter('data')\n effects.consume(code)\n return data\n }\n /** @type {State} */\n\n function data(code) {\n if (atBreak(code)) {\n effects.exit('data')\n return text(code)\n } // Data.\n\n effects.consume(code)\n return data\n }\n /**\n * @param {Code} code\n * @returns {boolean}\n */\n\n function atBreak(code) {\n if (code === null) {\n return true\n }\n\n const list = constructs[code]\n let index = -1\n\n if (list) {\n while (++index < list.length) {\n const item = list[index]\n\n if (!item.previous || item.previous.call(self, self.previous)) {\n return true\n }\n }\n }\n\n return false\n }\n }\n}\n/**\n * @param {Resolver} [extraResolver]\n * @returns {Resolver}\n */\n\nfunction createResolver(extraResolver) {\n return resolveAllText\n /** @type {Resolver} */\n\n function resolveAllText(events, context) {\n let index = -1\n /** @type {number|undefined} */\n\n let enter // A rather boring computation (to merge adjacent `data` events) which\n // improves mm performance by 29%.\n\n while (++index <= events.length) {\n if (enter === undefined) {\n if (events[index] && events[index][1].type === 'data') {\n enter = index\n index++\n }\n } else if (!events[index] || events[index][1].type !== 'data') {\n // Don’t do anything if there is one data token.\n if (index !== enter + 2) {\n events[enter][1].end = events[index - 1][1].end\n events.splice(enter + 2, index - enter - 2)\n index = enter + 2\n }\n\n enter = undefined\n }\n }\n\n return extraResolver ? extraResolver(events, context) : events\n }\n}\n/**\n * A rather ugly set of instructions which again looks at chunks in the input\n * stream.\n * The reason to do this here is that it is *much* faster to parse in reverse.\n * And that we can’t hook into `null` to split the line suffix before an EOF.\n * To do: figure out if we can make this into a clean utility, or even in core.\n * As it will be useful for GFMs literal autolink extension (and maybe even\n * tables?)\n *\n * @type {Resolver}\n */\n\nfunction resolveAllLineSuffixes(events, context) {\n let eventIndex = 0 // Skip first.\n\n while (++eventIndex <= events.length) {\n if (\n (eventIndex === events.length ||\n events[eventIndex][1].type === 'lineEnding') &&\n events[eventIndex - 1][1].type === 'data'\n ) {\n const data = events[eventIndex - 1][1]\n const chunks = context.sliceStream(data)\n let index = chunks.length\n let bufferIndex = -1\n let size = 0\n /** @type {boolean|undefined} */\n\n let tabs\n\n while (index--) {\n const chunk = chunks[index]\n\n if (typeof chunk === 'string') {\n bufferIndex = chunk.length\n\n while (chunk.charCodeAt(bufferIndex - 1) === 32) {\n size++\n bufferIndex--\n }\n\n if (bufferIndex) break\n bufferIndex = -1\n } // Number\n else if (chunk === -2) {\n tabs = true\n size++\n } else if (chunk === -1) {\n // Empty\n } else {\n // Replacement character, exit.\n index++\n break\n }\n }\n\n if (size) {\n const token = {\n type:\n eventIndex === events.length || tabs || size < 2\n ? 'lineSuffix'\n : 'hardBreakTrailing',\n start: {\n line: data.end.line,\n column: data.end.column - size,\n offset: data.end.offset - size,\n _index: data.start._index + index,\n _bufferIndex: index\n ? bufferIndex\n : data.start._bufferIndex + bufferIndex\n },\n end: Object.assign({}, data.end)\n }\n data.end = Object.assign({}, token.start)\n\n if (data.start.offset === data.end.offset) {\n Object.assign(data, token)\n } else {\n events.splice(\n eventIndex,\n 0,\n ['enter', token, context],\n ['exit', token, context]\n )\n eventIndex += 2\n }\n }\n\n eventIndex++\n }\n }\n\n return events\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Point} Point\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n */\n\n/**\n * @typedef Info\n * @property {() => void} restore\n * @property {number} from\n *\n * @callback ReturnHandle\n * Handle a successful run.\n * @param {Construct} construct\n * @param {Info} info\n * @returns {void}\n */\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {push, splice} from 'micromark-util-chunked'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\n/**\n * Create a tokenizer.\n * Tokenizers deal with one type of data (e.g., containers, flow, text).\n * The parser is the object dealing with it all.\n * `initialize` works like other constructs, except that only its `tokenize`\n * function is used, in which case it doesn’t receive an `ok` or `nok`.\n * `from` can be given to set the point before the first character, although\n * when further lines are indented, they must be set with `defineSkip`.\n *\n * @param {ParseContext} parser\n * @param {InitialConstruct} initialize\n * @param {Omit<Point, '_index'|'_bufferIndex'>} [from]\n * @returns {TokenizeContext}\n */\nexport function createTokenizer(parser, initialize, from) {\n /** @type {Point} */\n let point = Object.assign(\n from\n ? Object.assign({}, from)\n : {\n line: 1,\n column: 1,\n offset: 0\n },\n {\n _index: 0,\n _bufferIndex: -1\n }\n )\n /** @type {Record<string, number>} */\n\n const columnStart = {}\n /** @type {Construct[]} */\n\n const resolveAllConstructs = []\n /** @type {Chunk[]} */\n\n let chunks = []\n /** @type {Token[]} */\n\n let stack = []\n /** @type {boolean|undefined} */\n\n let consumed = true\n /**\n * Tools used for tokenizing.\n *\n * @type {Effects}\n */\n\n const effects = {\n consume,\n enter,\n exit,\n attempt: constructFactory(onsuccessfulconstruct),\n check: constructFactory(onsuccessfulcheck),\n interrupt: constructFactory(onsuccessfulcheck, {\n interrupt: true\n })\n }\n /**\n * State and tools for resolving and serializing.\n *\n * @type {TokenizeContext}\n */\n\n const context = {\n previous: null,\n code: null,\n containerState: {},\n events: [],\n parser,\n sliceStream,\n sliceSerialize,\n now,\n defineSkip,\n write\n }\n /**\n * The state function.\n *\n * @type {State|void}\n */\n\n let state = initialize.tokenize.call(context, effects)\n /**\n * Track which character we expect to be consumed, to catch bugs.\n *\n * @type {Code}\n */\n\n let expectedCode\n\n if (initialize.resolveAll) {\n resolveAllConstructs.push(initialize)\n }\n\n return context\n /** @type {TokenizeContext['write']} */\n\n function write(slice) {\n chunks = push(chunks, slice)\n main() // Exit if we’re not done, resolve might change stuff.\n\n if (chunks[chunks.length - 1] !== null) {\n return []\n }\n\n addResult(initialize, 0) // Otherwise, resolve, and exit.\n\n context.events = resolveAll(resolveAllConstructs, context.events, context)\n return context.events\n } //\n // Tools.\n //\n\n /** @type {TokenizeContext['sliceSerialize']} */\n\n function sliceSerialize(token, expandTabs) {\n return serializeChunks(sliceStream(token), expandTabs)\n }\n /** @type {TokenizeContext['sliceStream']} */\n\n function sliceStream(token) {\n return sliceChunks(chunks, token)\n }\n /** @type {TokenizeContext['now']} */\n\n function now() {\n return Object.assign({}, point)\n }\n /** @type {TokenizeContext['defineSkip']} */\n\n function defineSkip(value) {\n columnStart[value.line] = value.column\n accountForPotentialSkip()\n } //\n // State management.\n //\n\n /**\n * Main loop (note that `_index` and `_bufferIndex` in `point` are modified by\n * `consume`).\n * Here is where we walk through the chunks, which either include strings of\n * several characters, or numerical character codes.\n * The reason to do this in a loop instead of a call is so the stack can\n * drain.\n *\n * @returns {void}\n */\n\n function main() {\n /** @type {number} */\n let chunkIndex\n\n while (point._index < chunks.length) {\n const chunk = chunks[point._index] // If we’re in a buffer chunk, loop through it.\n\n if (typeof chunk === 'string') {\n chunkIndex = point._index\n\n if (point._bufferIndex < 0) {\n point._bufferIndex = 0\n }\n\n while (\n point._index === chunkIndex &&\n point._bufferIndex < chunk.length\n ) {\n go(chunk.charCodeAt(point._bufferIndex))\n }\n } else {\n go(chunk)\n }\n }\n }\n /**\n * Deal with one code.\n *\n * @param {Code} code\n * @returns {void}\n */\n\n function go(code) {\n consumed = undefined\n expectedCode = code\n state = state(code)\n }\n /** @type {Effects['consume']} */\n\n function consume(code) {\n if (markdownLineEnding(code)) {\n point.line++\n point.column = 1\n point.offset += code === -3 ? 2 : 1\n accountForPotentialSkip()\n } else if (code !== -1) {\n point.column++\n point.offset++\n } // Not in a string chunk.\n\n if (point._bufferIndex < 0) {\n point._index++\n } else {\n point._bufferIndex++ // At end of string chunk.\n // @ts-expect-error Points w/ non-negative `_bufferIndex` reference\n // strings.\n\n if (point._bufferIndex === chunks[point._index].length) {\n point._bufferIndex = -1\n point._index++\n }\n } // Expose the previous character.\n\n context.previous = code // Mark as consumed.\n\n consumed = true\n }\n /** @type {Effects['enter']} */\n\n function enter(type, fields) {\n /** @type {Token} */\n // @ts-expect-error Patch instead of assign required fields to help GC.\n const token = fields || {}\n token.type = type\n token.start = now()\n context.events.push(['enter', token, context])\n stack.push(token)\n return token\n }\n /** @type {Effects['exit']} */\n\n function exit(type) {\n const token = stack.pop()\n token.end = now()\n context.events.push(['exit', token, context])\n return token\n }\n /**\n * Use results.\n *\n * @type {ReturnHandle}\n */\n\n function onsuccessfulconstruct(construct, info) {\n addResult(construct, info.from)\n }\n /**\n * Discard results.\n *\n * @type {ReturnHandle}\n */\n\n function onsuccessfulcheck(_, info) {\n info.restore()\n }\n /**\n * Factory to attempt/check/interrupt.\n *\n * @param {ReturnHandle} onreturn\n * @param {Record<string, unknown>} [fields]\n */\n\n function constructFactory(onreturn, fields) {\n return hook\n /**\n * Handle either an object mapping codes to constructs, a list of\n * constructs, or a single construct.\n *\n * @param {Construct|Construct[]|ConstructRecord} constructs\n * @param {State} returnState\n * @param {State} [bogusState]\n * @returns {State}\n */\n\n function hook(constructs, returnState, bogusState) {\n /** @type {Construct[]} */\n let listOfConstructs\n /** @type {number} */\n\n let constructIndex\n /** @type {Construct} */\n\n let currentConstruct\n /** @type {Info} */\n\n let info\n return Array.isArray(constructs)\n ? /* c8 ignore next 1 */\n handleListOfConstructs(constructs)\n : 'tokenize' in constructs // @ts-expect-error Looks like a construct.\n ? handleListOfConstructs([constructs])\n : handleMapOfConstructs(constructs)\n /**\n * Handle a list of construct.\n *\n * @param {ConstructRecord} map\n * @returns {State}\n */\n\n function handleMapOfConstructs(map) {\n return start\n /** @type {State} */\n\n function start(code) {\n const def = code !== null && map[code]\n const all = code !== null && map.null\n const list = [\n // To do: add more extension tests.\n\n /* c8 ignore next 2 */\n ...(Array.isArray(def) ? def : def ? [def] : []),\n ...(Array.isArray(all) ? all : all ? [all] : [])\n ]\n return handleListOfConstructs(list)(code)\n }\n }\n /**\n * Handle a list of construct.\n *\n * @param {Construct[]} list\n * @returns {State}\n */\n\n function handleListOfConstructs(list) {\n listOfConstructs = list\n constructIndex = 0\n\n if (list.length === 0) {\n return bogusState\n }\n\n return handleConstruct(list[constructIndex])\n }\n /**\n * Handle a single construct.\n *\n * @param {Construct} construct\n * @returns {State}\n */\n\n function handleConstruct(construct) {\n return start\n /** @type {State} */\n\n function start(code) {\n // To do: not needed to store if there is no bogus state, probably?\n // Currently doesn’t work because `inspect` in document does a check\n // w/o a bogus, which doesn’t make sense. But it does seem to help perf\n // by not storing.\n info = store()\n currentConstruct = construct\n\n if (!construct.partial) {\n context.currentConstruct = construct\n }\n\n if (\n construct.name &&\n context.parser.constructs.disable.null.includes(construct.name)\n ) {\n return nok(code)\n }\n\n return construct.tokenize.call(\n // If we do have fields, create an object w/ `context` as its\n // prototype.\n // This allows a “live binding”, which is needed for `interrupt`.\n fields ? Object.assign(Object.create(context), fields) : context,\n effects,\n ok,\n nok\n )(code)\n }\n }\n /** @type {State} */\n\n function ok(code) {\n consumed = true\n onreturn(currentConstruct, info)\n return returnState\n }\n /** @type {State} */\n\n function nok(code) {\n consumed = true\n info.restore()\n\n if (++constructIndex < listOfConstructs.length) {\n return handleConstruct(listOfConstructs[constructIndex])\n }\n\n return bogusState\n }\n }\n }\n /**\n * @param {Construct} construct\n * @param {number} from\n * @returns {void}\n */\n\n function addResult(construct, from) {\n if (construct.resolveAll && !resolveAllConstructs.includes(construct)) {\n resolveAllConstructs.push(construct)\n }\n\n if (construct.resolve) {\n splice(\n context.events,\n from,\n context.events.length - from,\n construct.resolve(context.events.slice(from), context)\n )\n }\n\n if (construct.resolveTo) {\n context.events = construct.resolveTo(context.events, context)\n }\n }\n /**\n * Store state.\n *\n * @returns {Info}\n */\n\n function store() {\n const startPoint = now()\n const startPrevious = context.previous\n const startCurrentConstruct = context.currentConstruct\n const startEventsIndex = context.events.length\n const startStack = Array.from(stack)\n return {\n restore,\n from: startEventsIndex\n }\n /**\n * Restore state.\n *\n * @returns {void}\n */\n\n function restore() {\n point = startPoint\n context.previous = startPrevious\n context.currentConstruct = startCurrentConstruct\n context.events.length = startEventsIndex\n stack = startStack\n accountForPotentialSkip()\n }\n }\n /**\n * Move the current point a bit forward in the line when it’s on a column\n * skip.\n *\n * @returns {void}\n */\n\n function accountForPotentialSkip() {\n if (point.line in columnStart && point.column < 2) {\n point.column = columnStart[point.line]\n point.offset += columnStart[point.line] - 1\n }\n }\n}\n/**\n * Get the chunks from a slice of chunks in the range of a token.\n *\n * @param {Chunk[]} chunks\n * @param {Pick<Token, 'start'|'end'>} token\n * @returns {Chunk[]}\n */\n\nfunction sliceChunks(chunks, token) {\n const startIndex = token.start._index\n const startBufferIndex = token.start._bufferIndex\n const endIndex = token.end._index\n const endBufferIndex = token.end._bufferIndex\n /** @type {Chunk[]} */\n\n let view\n\n if (startIndex === endIndex) {\n // @ts-expect-error `_bufferIndex` is used on string chunks.\n view = [chunks[startIndex].slice(startBufferIndex, endBufferIndex)]\n } else {\n view = chunks.slice(startIndex, endIndex)\n\n if (startBufferIndex > -1) {\n // @ts-expect-error `_bufferIndex` is used on string chunks.\n view[0] = view[0].slice(startBufferIndex)\n }\n\n if (endBufferIndex > 0) {\n // @ts-expect-error `_bufferIndex` is used on string chunks.\n view.push(chunks[endIndex].slice(0, endBufferIndex))\n }\n }\n\n return view\n}\n/**\n * Get the string value of a slice of chunks.\n *\n * @param {Chunk[]} chunks\n * @param {boolean} [expandTabs=false]\n * @returns {string}\n */\n\nfunction serializeChunks(chunks, expandTabs) {\n let index = -1\n /** @type {string[]} */\n\n const result = []\n /** @type {boolean|undefined} */\n\n let atTab\n\n while (++index < chunks.length) {\n const chunk = chunks[index]\n /** @type {string} */\n\n let value\n\n if (typeof chunk === 'string') {\n value = chunk\n } else\n switch (chunk) {\n case -5: {\n value = '\\r'\n break\n }\n\n case -4: {\n value = '\\n'\n break\n }\n\n case -3: {\n value = '\\r' + '\\n'\n break\n }\n\n case -2: {\n value = expandTabs ? ' ' : '\\t'\n break\n }\n\n case -1: {\n if (!expandTabs && atTab) continue\n value = ' '\n break\n }\n\n default: {\n // Currently only replacement character.\n value = String.fromCharCode(chunk)\n }\n }\n\n atTab = chunk === -2\n result.push(value)\n }\n\n return result.join('')\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n */\nimport {\n attention,\n autolink,\n blockQuote,\n characterEscape,\n characterReference,\n codeFenced,\n codeIndented,\n codeText,\n definition,\n hardBreakEscape,\n headingAtx,\n htmlFlow,\n htmlText,\n labelEnd,\n labelStartImage,\n labelStartLink,\n lineEnding,\n list,\n setextUnderline,\n thematicBreak\n} from 'micromark-core-commonmark'\nimport {resolver as resolveText} from './initialize/text.js'\n/** @type {Extension['document']} */\n\nexport const document = {\n [42]: list,\n [43]: list,\n [45]: list,\n [48]: list,\n [49]: list,\n [50]: list,\n [51]: list,\n [52]: list,\n [53]: list,\n [54]: list,\n [55]: list,\n [56]: list,\n [57]: list,\n [62]: blockQuote\n}\n/** @type {Extension['contentInitial']} */\n\nexport const contentInitial = {\n [91]: definition\n}\n/** @type {Extension['flowInitial']} */\n\nexport const flowInitial = {\n [-2]: codeIndented,\n [-1]: codeIndented,\n [32]: codeIndented\n}\n/** @type {Extension['flow']} */\n\nexport const flow = {\n [35]: headingAtx,\n [42]: thematicBreak,\n [45]: [setextUnderline, thematicBreak],\n [60]: htmlFlow,\n [61]: setextUnderline,\n [95]: thematicBreak,\n [96]: codeFenced,\n [126]: codeFenced\n}\n/** @type {Extension['string']} */\n\nexport const string = {\n [38]: characterReference,\n [92]: characterEscape\n}\n/** @type {Extension['text']} */\n\nexport const text = {\n [-5]: lineEnding,\n [-4]: lineEnding,\n [-3]: lineEnding,\n [33]: labelStartImage,\n [38]: characterReference,\n [42]: attention,\n [60]: [autolink, htmlText],\n [91]: labelStartLink,\n [92]: [hardBreakEscape, characterEscape],\n [93]: labelEnd,\n [95]: attention,\n [96]: codeText\n}\n/** @type {Extension['insideSpan']} */\n\nexport const insideSpan = {\n null: [attention, resolveText]\n}\n/** @type {Extension['attentionMarkers']} */\n\nexport const attentionMarkers = {\n null: [42, 95]\n}\n/** @type {Extension['disable']} */\n\nexport const disable = {\n null: []\n}\n","/**\n * @typedef {import('micromark-util-types').Encoding} Encoding\n * @typedef {import('micromark-util-types').Value} Value\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Code} Code\n */\n\n/**\n * @callback Preprocessor\n * @param {Value} value\n * @param {Encoding} [encoding]\n * @param {boolean} [end=false]\n * @returns {Chunk[]}\n */\nconst search = /[\\0\\t\\n\\r]/g\n/**\n * @returns {Preprocessor}\n */\n\nexport function preprocess() {\n let column = 1\n let buffer = ''\n /** @type {boolean|undefined} */\n\n let start = true\n /** @type {boolean|undefined} */\n\n let atCarriageReturn\n return preprocessor\n /** @type {Preprocessor} */\n\n function preprocessor(value, encoding, end) {\n /** @type {Chunk[]} */\n const chunks = []\n /** @type {RegExpMatchArray|null} */\n\n let match\n /** @type {number} */\n\n let next\n /** @type {number} */\n\n let startPosition\n /** @type {number} */\n\n let endPosition\n /** @type {Code} */\n\n let code // @ts-expect-error `Buffer` does allow an encoding.\n\n value = buffer + value.toString(encoding)\n startPosition = 0\n buffer = ''\n\n if (start) {\n if (value.charCodeAt(0) === 65279) {\n startPosition++\n }\n\n start = undefined\n }\n\n while (startPosition < value.length) {\n search.lastIndex = startPosition\n match = search.exec(value)\n endPosition =\n match && match.index !== undefined ? match.index : value.length\n code = value.charCodeAt(endPosition)\n\n if (!match) {\n buffer = value.slice(startPosition)\n break\n }\n\n if (code === 10 && startPosition === endPosition && atCarriageReturn) {\n chunks.push(-3)\n atCarriageReturn = undefined\n } else {\n if (atCarriageReturn) {\n chunks.push(-5)\n atCarriageReturn = undefined\n }\n\n if (startPosition < endPosition) {\n chunks.push(value.slice(startPosition, endPosition))\n column += endPosition - startPosition\n }\n\n switch (code) {\n case 0: {\n chunks.push(65533)\n column++\n break\n }\n\n case 9: {\n next = Math.ceil(column / 4) * 4\n chunks.push(-2)\n\n while (column++ < next) chunks.push(-1)\n\n break\n }\n\n case 10: {\n chunks.push(-4)\n column = 1\n break\n }\n\n default: {\n atCarriageReturn = true\n column = 1\n }\n }\n }\n\n startPosition = endPosition + 1\n }\n\n if (end) {\n if (atCarriageReturn) chunks.push(-5)\n if (buffer) chunks.push(buffer)\n chunks.push(null)\n }\n\n return chunks\n }\n}\n","/**\n * Turn the number (in string form as either hexa- or plain decimal) coming from\n * a numeric character reference into a character.\n *\n * @param {string} value\n * Value to decode.\n * @param {number} base\n * Numeric base.\n * @returns {string}\n */\nexport function decodeNumericCharacterReference(value, base) {\n const code = Number.parseInt(value, base)\n\n if (\n // C0 except for HT, LF, FF, CR, space\n code < 9 ||\n code === 11 ||\n (code > 13 && code < 32) || // Control character (DEL) of the basic block and C1 controls.\n (code > 126 && code < 160) || // Lone high surrogates and low surrogates.\n (code > 55295 && code < 57344) || // Noncharacters.\n (code > 64975 && code < 65008) ||\n (code & 65535) === 65535 ||\n (code & 65535) === 65534 || // Out of range\n code > 1114111\n ) {\n return '\\uFFFD'\n }\n\n return String.fromCharCode(code)\n}\n","import {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {decodeNumericCharacterReference} from 'micromark-util-decode-numeric-character-reference'\nconst characterEscapeOrReference =\n /\\\\([!-/:-@[-`{-~])|&(#(?:\\d{1,7}|x[\\da-f]{1,6})|[\\da-z]{1,31});/gi\n/**\n * Utility to decode markdown strings (which occur in places such as fenced\n * code info strings, destinations, labels, and titles).\n * The “string” content type allows character escapes and -references.\n * This decodes those.\n *\n * @param {string} value\n * @returns {string}\n */\n\nexport function decodeString(value) {\n return value.replace(characterEscapeOrReference, decode)\n}\n/**\n * @param {string} $0\n * @param {string} $1\n * @param {string} $2\n * @returns {string}\n */\n\nfunction decode($0, $1, $2) {\n if ($1) {\n // Escape.\n return $1\n } // Reference.\n\n const head = $2.charCodeAt(0)\n\n if (head === 35) {\n const head = $2.charCodeAt(1)\n const hex = head === 120 || head === 88\n return decodeNumericCharacterReference($2.slice(hex ? 2 : 1), hex ? 16 : 10)\n }\n\n return decodeNamedCharacterReference($2) || $0\n}\n","/**\n * @typedef {import('micromark-util-types').Encoding} Encoding\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').ParseOptions} ParseOptions\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Value} Value\n * @typedef {import('unist').Parent} UnistParent\n * @typedef {import('unist').Point} Point\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n * @typedef {import('mdast').Content} Content\n * @typedef {Root|Content} Node\n * @typedef {Extract<Node, UnistParent>} Parent\n * @typedef {import('mdast').Break} Break\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('mdast').Code} Code\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('mdast').HTML} HTML\n * @typedef {import('mdast').Image} Image\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('mdast').Link} Link\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('mdast').List} List\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('mdast').Text} Text\n * @typedef {import('mdast').ThematicBreak} ThematicBreak\n *\n * @typedef {UnistParent & {type: 'fragment', children: Array<PhrasingContent>}} Fragment\n */\n\n/**\n * @typedef _CompileDataFields\n * @property {boolean|undefined} expectingFirstListItemValue\n * @property {boolean|undefined} flowCodeInside\n * @property {boolean|undefined} setextHeadingSlurpLineEnding\n * @property {boolean|undefined} atHardBreak\n * @property {'collapsed'|'full'} referenceType\n * @property {boolean|undefined} inReference\n * @property {'characterReferenceMarkerHexadecimal'|'characterReferenceMarkerNumeric'} characterReferenceType\n *\n * @typedef {Record<string, unknown> & Partial<_CompileDataFields>} CompileData\n *\n * @typedef {(tree: Root) => Root|void} Transform\n * @typedef {(this: CompileContext, token: Token) => void} Handle\n * @typedef {Record<string, Handle>} Handles\n * Token types mapping to handles\n * @typedef {Record<string, Record<string, unknown>|Array<unknown>> & {canContainEols: Array<string>, transforms: Array<Transform>, enter: Handles, exit: Handles}} NormalizedExtension\n * @typedef {Partial<NormalizedExtension>} Extension\n * An mdast extension changes how markdown tokens are turned into mdast.\n *\n * @typedef {(this: Omit<CompileContext, 'sliceSerialize'>, left: Token|undefined, right: Token) => void} OnEnterError\n * @typedef {(this: Omit<CompileContext, 'sliceSerialize'>, left: Token, right: Token) => void} OnExitError\n *\n * @typedef CompileContext\n * mdast compiler context\n * @property {Array<Node | Fragment>} stack\n * @property {Array<[Token, OnEnterError|undefined]>} tokenStack\n * @property {(key: string, value?: unknown) => void} setData\n * Set data into the key-value store.\n * @property {<K extends string>(key: K) => CompileData[K]} getData\n * Get data from the key-value store.\n * @property {(this: CompileContext) => void} buffer\n * Capture some of the output data.\n * @property {(this: CompileContext) => string} resume\n * Stop capturing and access the output data.\n * @property {<N extends Node>(this: CompileContext, node: N, token: Token, onError?: OnEnterError) => N} enter\n * Enter a token.\n * @property {(this: CompileContext, token: Token, onError?: OnExitError) => Node} exit\n * Exit a token.\n * @property {TokenizeContext['sliceSerialize']} sliceSerialize\n * Get the string value of a token.\n * @property {NormalizedExtension} config\n * Configuration.\n *\n * @typedef {{mdastExtensions?: Array<Extension|Array<Extension>>}} FromMarkdownOptions\n * @typedef {ParseOptions & FromMarkdownOptions} Options\n */\nimport {toString} from 'mdast-util-to-string'\nimport {parse} from 'micromark/lib/parse.js'\nimport {preprocess} from 'micromark/lib/preprocess.js'\nimport {postprocess} from 'micromark/lib/postprocess.js'\nimport {decodeNumericCharacterReference} from 'micromark-util-decode-numeric-character-reference'\nimport {decodeString} from 'micromark-util-decode-string'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {stringifyPosition} from 'unist-util-stringify-position'\nconst own = {}.hasOwnProperty\n/**\n * @param value Markdown to parse (`string` or `Buffer`).\n * @param [encoding] Character encoding to understand `value` as when it’s a `Buffer` (`string`, default: `'utf8'`).\n * @param [options] Configuration\n */\n\nexport const fromMarkdown =\n /**\n * @type {(\n * ((value: Value, encoding: Encoding, options?: Options) => Root) &\n * ((value: Value, options?: Options) => Root)\n * )}\n */\n\n /**\n * @param {Value} value\n * @param {Encoding} [encoding]\n * @param {Options} [options]\n * @returns {Root}\n */\n function (value, encoding, options) {\n if (typeof encoding !== 'string') {\n options = encoding\n encoding = undefined\n }\n\n return compiler(options)(\n postprocess(\n parse(options).document().write(preprocess()(value, encoding, true))\n )\n )\n }\n/**\n * Note this compiler only understand complete buffering, not streaming.\n *\n * @param {Options} [options]\n */\n\nfunction compiler(options = {}) {\n /** @type {NormalizedExtension} */\n // @ts-expect-error: our base has all required fields, so the result will too.\n const config = configure(\n {\n transforms: [],\n canContainEols: [\n 'emphasis',\n 'fragment',\n 'heading',\n 'paragraph',\n 'strong'\n ],\n enter: {\n autolink: opener(link),\n autolinkProtocol: onenterdata,\n autolinkEmail: onenterdata,\n atxHeading: opener(heading),\n blockQuote: opener(blockQuote),\n characterEscape: onenterdata,\n characterReference: onenterdata,\n codeFenced: opener(codeFlow),\n codeFencedFenceInfo: buffer,\n codeFencedFenceMeta: buffer,\n codeIndented: opener(codeFlow, buffer),\n codeText: opener(codeText, buffer),\n codeTextData: onenterdata,\n data: onenterdata,\n codeFlowValue: onenterdata,\n definition: opener(definition),\n definitionDestinationString: buffer,\n definitionLabelString: buffer,\n definitionTitleString: buffer,\n emphasis: opener(emphasis),\n hardBreakEscape: opener(hardBreak),\n hardBreakTrailing: opener(hardBreak),\n htmlFlow: opener(html, buffer),\n htmlFlowData: onenterdata,\n htmlText: opener(html, buffer),\n htmlTextData: onenterdata,\n image: opener(image),\n label: buffer,\n link: opener(link),\n listItem: opener(listItem),\n listItemValue: onenterlistitemvalue,\n listOrdered: opener(list, onenterlistordered),\n listUnordered: opener(list),\n paragraph: opener(paragraph),\n reference: onenterreference,\n referenceString: buffer,\n resourceDestinationString: buffer,\n resourceTitleString: buffer,\n setextHeading: opener(heading),\n strong: opener(strong),\n thematicBreak: opener(thematicBreak)\n },\n exit: {\n atxHeading: closer(),\n atxHeadingSequence: onexitatxheadingsequence,\n autolink: closer(),\n autolinkEmail: onexitautolinkemail,\n autolinkProtocol: onexitautolinkprotocol,\n blockQuote: closer(),\n characterEscapeValue: onexitdata,\n characterReferenceMarkerHexadecimal: onexitcharacterreferencemarker,\n characterReferenceMarkerNumeric: onexitcharacterreferencemarker,\n characterReferenceValue: onexitcharacterreferencevalue,\n codeFenced: closer(onexitcodefenced),\n codeFencedFence: onexitcodefencedfence,\n codeFencedFenceInfo: onexitcodefencedfenceinfo,\n codeFencedFenceMeta: onexitcodefencedfencemeta,\n codeFlowValue: onexitdata,\n codeIndented: closer(onexitcodeindented),\n codeText: closer(onexitcodetext),\n codeTextData: onexitdata,\n data: onexitdata,\n definition: closer(),\n definitionDestinationString: onexitdefinitiondestinationstring,\n definitionLabelString: onexitdefinitionlabelstring,\n definitionTitleString: onexitdefinitiontitlestring,\n emphasis: closer(),\n hardBreakEscape: closer(onexithardbreak),\n hardBreakTrailing: closer(onexithardbreak),\n htmlFlow: closer(onexithtmlflow),\n htmlFlowData: onexitdata,\n htmlText: closer(onexithtmltext),\n htmlTextData: onexitdata,\n image: closer(onexitimage),\n label: onexitlabel,\n labelText: onexitlabeltext,\n lineEnding: onexitlineending,\n link: closer(onexitlink),\n listItem: closer(),\n listOrdered: closer(),\n listUnordered: closer(),\n paragraph: closer(),\n referenceString: onexitreferencestring,\n resourceDestinationString: onexitresourcedestinationstring,\n resourceTitleString: onexitresourcetitlestring,\n resource: onexitresource,\n setextHeading: closer(onexitsetextheading),\n setextHeadingLineSequence: onexitsetextheadinglinesequence,\n setextHeadingText: onexitsetextheadingtext,\n strong: closer(),\n thematicBreak: closer()\n }\n },\n options.mdastExtensions || []\n )\n /** @type {CompileData} */\n\n const data = {}\n return compile\n /**\n * @param {Array<Event>} events\n * @returns {Root}\n */\n\n function compile(events) {\n /** @type {Root} */\n let tree = {\n type: 'root',\n children: []\n }\n /** @type {CompileContext['stack']} */\n\n const stack = [tree]\n /** @type {CompileContext['tokenStack']} */\n\n const tokenStack = []\n /** @type {Array<number>} */\n\n const listStack = []\n /** @type {Omit<CompileContext, 'sliceSerialize'>} */\n\n const context = {\n stack,\n tokenStack,\n config,\n enter,\n exit,\n buffer,\n resume,\n setData,\n getData\n }\n let index = -1\n\n while (++index < events.length) {\n // We preprocess lists to add `listItem` tokens, and to infer whether\n // items the list itself are spread out.\n if (\n events[index][1].type === 'listOrdered' ||\n events[index][1].type === 'listUnordered'\n ) {\n if (events[index][0] === 'enter') {\n listStack.push(index)\n } else {\n const tail = listStack.pop()\n index = prepareList(events, tail, index)\n }\n }\n }\n\n index = -1\n\n while (++index < events.length) {\n const handler = config[events[index][0]]\n\n if (own.call(handler, events[index][1].type)) {\n handler[events[index][1].type].call(\n Object.assign(\n {\n sliceSerialize: events[index][2].sliceSerialize\n },\n context\n ),\n events[index][1]\n )\n }\n }\n\n if (tokenStack.length > 0) {\n const tail = tokenStack[tokenStack.length - 1]\n const handler = tail[1] || defaultOnError\n handler.call(context, undefined, tail[0])\n } // Figure out `root` position.\n\n tree.position = {\n start: point(\n events.length > 0\n ? events[0][1].start\n : {\n line: 1,\n column: 1,\n offset: 0\n }\n ),\n end: point(\n events.length > 0\n ? events[events.length - 2][1].end\n : {\n line: 1,\n column: 1,\n offset: 0\n }\n )\n }\n index = -1\n\n while (++index < config.transforms.length) {\n tree = config.transforms[index](tree) || tree\n }\n\n return tree\n }\n /**\n * @param {Array<Event>} events\n * @param {number} start\n * @param {number} length\n * @returns {number}\n */\n\n function prepareList(events, start, length) {\n let index = start - 1\n let containerBalance = -1\n let listSpread = false\n /** @type {Token|undefined} */\n\n let listItem\n /** @type {number|undefined} */\n\n let lineIndex\n /** @type {number|undefined} */\n\n let firstBlankLineIndex\n /** @type {boolean|undefined} */\n\n let atMarker\n\n while (++index <= length) {\n const event = events[index]\n\n if (\n event[1].type === 'listUnordered' ||\n event[1].type === 'listOrdered' ||\n event[1].type === 'blockQuote'\n ) {\n if (event[0] === 'enter') {\n containerBalance++\n } else {\n containerBalance--\n }\n\n atMarker = undefined\n } else if (event[1].type === 'lineEndingBlank') {\n if (event[0] === 'enter') {\n if (\n listItem &&\n !atMarker &&\n !containerBalance &&\n !firstBlankLineIndex\n ) {\n firstBlankLineIndex = index\n }\n\n atMarker = undefined\n }\n } else if (\n event[1].type === 'linePrefix' ||\n event[1].type === 'listItemValue' ||\n event[1].type === 'listItemMarker' ||\n event[1].type === 'listItemPrefix' ||\n event[1].type === 'listItemPrefixWhitespace'\n ) {\n // Empty.\n } else {\n atMarker = undefined\n }\n\n if (\n (!containerBalance &&\n event[0] === 'enter' &&\n event[1].type === 'listItemPrefix') ||\n (containerBalance === -1 &&\n event[0] === 'exit' &&\n (event[1].type === 'listUnordered' ||\n event[1].type === 'listOrdered'))\n ) {\n if (listItem) {\n let tailIndex = index\n lineIndex = undefined\n\n while (tailIndex--) {\n const tailEvent = events[tailIndex]\n\n if (\n tailEvent[1].type === 'lineEnding' ||\n tailEvent[1].type === 'lineEndingBlank'\n ) {\n if (tailEvent[0] === 'exit') continue\n\n if (lineIndex) {\n events[lineIndex][1].type = 'lineEndingBlank'\n listSpread = true\n }\n\n tailEvent[1].type = 'lineEnding'\n lineIndex = tailIndex\n } else if (\n tailEvent[1].type === 'linePrefix' ||\n tailEvent[1].type === 'blockQuotePrefix' ||\n tailEvent[1].type === 'blockQuotePrefixWhitespace' ||\n tailEvent[1].type === 'blockQuoteMarker' ||\n tailEvent[1].type === 'listItemIndent'\n ) {\n // Empty\n } else {\n break\n }\n }\n\n if (\n firstBlankLineIndex &&\n (!lineIndex || firstBlankLineIndex < lineIndex)\n ) {\n // @ts-expect-error Patched.\n listItem._spread = true\n } // Fix position.\n\n listItem.end = Object.assign(\n {},\n lineIndex ? events[lineIndex][1].start : event[1].end\n )\n events.splice(lineIndex || index, 0, ['exit', listItem, event[2]])\n index++\n length++\n } // Create a new list item.\n\n if (event[1].type === 'listItemPrefix') {\n listItem = {\n type: 'listItem',\n // @ts-expect-error Patched\n _spread: false,\n start: Object.assign({}, event[1].start)\n } // @ts-expect-error: `listItem` is most definitely defined, TS...\n\n events.splice(index, 0, ['enter', listItem, event[2]])\n index++\n length++\n firstBlankLineIndex = undefined\n atMarker = true\n }\n }\n } // @ts-expect-error Patched.\n\n events[start][1]._spread = listSpread\n return length\n }\n /**\n * @type {CompileContext['setData']}\n * @param [value]\n */\n\n function setData(key, value) {\n data[key] = value\n }\n /**\n * @type {CompileContext['getData']}\n * @template {string} K\n * @param {K} key\n * @returns {CompileData[K]}\n */\n\n function getData(key) {\n return data[key]\n }\n /**\n * @param {Point} d\n * @returns {Point}\n */\n\n function point(d) {\n return {\n line: d.line,\n column: d.column,\n offset: d.offset\n }\n }\n /**\n * @param {(token: Token) => Node} create\n * @param {Handle} [and]\n * @returns {Handle}\n */\n\n function opener(create, and) {\n return open\n /**\n * @this {CompileContext}\n * @param {Token} token\n * @returns {void}\n */\n\n function open(token) {\n enter.call(this, create(token), token)\n if (and) and.call(this, token)\n }\n }\n /** @type {CompileContext['buffer']} */\n\n function buffer() {\n this.stack.push({\n type: 'fragment',\n children: []\n })\n }\n /**\n * @type {CompileContext['enter']}\n * @template {Node} N\n * @this {CompileContext}\n * @param {N} node\n * @param {Token} token\n * @param {OnEnterError} [errorHandler]\n * @returns {N}\n */\n\n function enter(node, token, errorHandler) {\n const parent = this.stack[this.stack.length - 1]\n // @ts-expect-error: Assume `Node` can exist as a child of `parent`.\n parent.children.push(node)\n this.stack.push(node)\n this.tokenStack.push([token, errorHandler]) // @ts-expect-error: `end` will be patched later.\n\n node.position = {\n start: point(token.start)\n }\n return node\n }\n /**\n * @param {Handle} [and]\n * @returns {Handle}\n */\n\n function closer(and) {\n return close\n /**\n * @this {CompileContext}\n * @param {Token} token\n * @returns {void}\n */\n\n function close(token) {\n if (and) and.call(this, token)\n exit.call(this, token)\n }\n }\n /**\n * @type {CompileContext['exit']}\n * @this {CompileContext}\n * @param {Token} token\n * @param {OnExitError} [onExitError]\n * @returns {Node}\n */\n\n function exit(token, onExitError) {\n const node = this.stack.pop()\n const open = this.tokenStack.pop()\n\n if (!open) {\n throw new Error(\n 'Cannot close `' +\n token.type +\n '` (' +\n stringifyPosition({\n start: token.start,\n end: token.end\n }) +\n '): it’s not open'\n )\n } else if (open[0].type !== token.type) {\n if (onExitError) {\n onExitError.call(this, token, open[0])\n } else {\n const handler = open[1] || defaultOnError\n handler.call(this, token, open[0])\n }\n }\n\n node.position.end = point(token.end)\n return node\n }\n /**\n * @this {CompileContext}\n * @returns {string}\n */\n\n function resume() {\n return toString(this.stack.pop())\n } //\n // Handlers.\n //\n\n /** @type {Handle} */\n\n function onenterlistordered() {\n setData('expectingFirstListItemValue', true)\n }\n /** @type {Handle} */\n\n function onenterlistitemvalue(token) {\n if (getData('expectingFirstListItemValue')) {\n const ancestor =\n /** @type {List} */\n this.stack[this.stack.length - 2]\n ancestor.start = Number.parseInt(this.sliceSerialize(token), 10)\n setData('expectingFirstListItemValue')\n }\n }\n /** @type {Handle} */\n\n function onexitcodefencedfenceinfo() {\n const data = this.resume()\n const node =\n /** @type {Code} */\n this.stack[this.stack.length - 1]\n node.lang = data\n }\n /** @type {Handle} */\n\n function onexitcodefencedfencemeta() {\n const data = this.resume()\n const node =\n /** @type {Code} */\n this.stack[this.stack.length - 1]\n node.meta = data\n }\n /** @type {Handle} */\n\n function onexitcodefencedfence() {\n // Exit if this is the closing fence.\n if (getData('flowCodeInside')) return\n this.buffer()\n setData('flowCodeInside', true)\n }\n /** @type {Handle} */\n\n function onexitcodefenced() {\n const data = this.resume()\n const node =\n /** @type {Code} */\n this.stack[this.stack.length - 1]\n node.value = data.replace(/^(\\r?\\n|\\r)|(\\r?\\n|\\r)$/g, '')\n setData('flowCodeInside')\n }\n /** @type {Handle} */\n\n function onexitcodeindented() {\n const data = this.resume()\n const node =\n /** @type {Code} */\n this.stack[this.stack.length - 1]\n node.value = data.replace(/(\\r?\\n|\\r)$/g, '')\n }\n /** @type {Handle} */\n\n function onexitdefinitionlabelstring(token) {\n // Discard label, use the source content instead.\n const label = this.resume()\n const node =\n /** @type {Definition} */\n this.stack[this.stack.length - 1]\n node.label = label\n node.identifier = normalizeIdentifier(\n this.sliceSerialize(token)\n ).toLowerCase()\n }\n /** @type {Handle} */\n\n function onexitdefinitiontitlestring() {\n const data = this.resume()\n const node =\n /** @type {Definition} */\n this.stack[this.stack.length - 1]\n node.title = data\n }\n /** @type {Handle} */\n\n function onexitdefinitiondestinationstring() {\n const data = this.resume()\n const node =\n /** @type {Definition} */\n this.stack[this.stack.length - 1]\n node.url = data\n }\n /** @type {Handle} */\n\n function onexitatxheadingsequence(token) {\n const node =\n /** @type {Heading} */\n this.stack[this.stack.length - 1]\n\n if (!node.depth) {\n const depth = this.sliceSerialize(token).length\n node.depth = depth\n }\n }\n /** @type {Handle} */\n\n function onexitsetextheadingtext() {\n setData('setextHeadingSlurpLineEnding', true)\n }\n /** @type {Handle} */\n\n function onexitsetextheadinglinesequence(token) {\n const node =\n /** @type {Heading} */\n this.stack[this.stack.length - 1]\n node.depth = this.sliceSerialize(token).charCodeAt(0) === 61 ? 1 : 2\n }\n /** @type {Handle} */\n\n function onexitsetextheading() {\n setData('setextHeadingSlurpLineEnding')\n }\n /** @type {Handle} */\n\n function onenterdata(token) {\n const parent =\n /** @type {Parent} */\n this.stack[this.stack.length - 1]\n /** @type {Node} */\n\n let tail = parent.children[parent.children.length - 1]\n\n if (!tail || tail.type !== 'text') {\n // Add a new text node.\n tail = text() // @ts-expect-error: we’ll add `end` later.\n\n tail.position = {\n start: point(token.start)\n } // @ts-expect-error: Assume `parent` accepts `text`.\n\n parent.children.push(tail)\n }\n\n this.stack.push(tail)\n }\n /** @type {Handle} */\n\n function onexitdata(token) {\n const tail = this.stack.pop()\n tail.value += this.sliceSerialize(token)\n tail.position.end = point(token.end)\n }\n /** @type {Handle} */\n\n function onexitlineending(token) {\n const context = this.stack[this.stack.length - 1]\n\n // If we’re at a hard break, include the line ending in there.\n if (getData('atHardBreak')) {\n const tail = context.children[context.children.length - 1]\n tail.position.end = point(token.end)\n setData('atHardBreak')\n return\n }\n\n if (\n !getData('setextHeadingSlurpLineEnding') &&\n config.canContainEols.includes(context.type)\n ) {\n onenterdata.call(this, token)\n onexitdata.call(this, token)\n }\n }\n /** @type {Handle} */\n\n function onexithardbreak() {\n setData('atHardBreak', true)\n }\n /** @type {Handle} */\n\n function onexithtmlflow() {\n const data = this.resume()\n const node =\n /** @type {HTML} */\n this.stack[this.stack.length - 1]\n node.value = data\n }\n /** @type {Handle} */\n\n function onexithtmltext() {\n const data = this.resume()\n const node =\n /** @type {HTML} */\n this.stack[this.stack.length - 1]\n node.value = data\n }\n /** @type {Handle} */\n\n function onexitcodetext() {\n const data = this.resume()\n const node =\n /** @type {InlineCode} */\n this.stack[this.stack.length - 1]\n node.value = data\n }\n /** @type {Handle} */\n\n function onexitlink() {\n const context =\n /** @type {Link & {identifier: string, label: string}} */\n this.stack[this.stack.length - 1] // To do: clean.\n\n if (getData('inReference')) {\n context.type += 'Reference' // @ts-expect-error: mutate.\n\n context.referenceType = getData('referenceType') || 'shortcut' // @ts-expect-error: mutate.\n\n delete context.url\n delete context.title\n } else {\n // @ts-expect-error: mutate.\n delete context.identifier // @ts-expect-error: mutate.\n\n delete context.label\n }\n\n setData('referenceType')\n }\n /** @type {Handle} */\n\n function onexitimage() {\n const context =\n /** @type {Image & {identifier: string, label: string}} */\n this.stack[this.stack.length - 1] // To do: clean.\n\n if (getData('inReference')) {\n context.type += 'Reference' // @ts-expect-error: mutate.\n\n context.referenceType = getData('referenceType') || 'shortcut' // @ts-expect-error: mutate.\n\n delete context.url\n delete context.title\n } else {\n // @ts-expect-error: mutate.\n delete context.identifier // @ts-expect-error: mutate.\n\n delete context.label\n }\n\n setData('referenceType')\n }\n /** @type {Handle} */\n\n function onexitlabeltext(token) {\n const ancestor =\n /** @type {(Link|Image) & {identifier: string, label: string}} */\n this.stack[this.stack.length - 2]\n const string = this.sliceSerialize(token)\n ancestor.label = decodeString(string)\n ancestor.identifier = normalizeIdentifier(string).toLowerCase()\n }\n /** @type {Handle} */\n\n function onexitlabel() {\n const fragment =\n /** @type {Fragment} */\n this.stack[this.stack.length - 1]\n const value = this.resume()\n const node =\n /** @type {(Link|Image) & {identifier: string, label: string}} */\n this.stack[this.stack.length - 1] // Assume a reference.\n\n setData('inReference', true)\n\n if (node.type === 'link') {\n // @ts-expect-error: Assume static phrasing content.\n node.children = fragment.children\n } else {\n node.alt = value\n }\n }\n /** @type {Handle} */\n\n function onexitresourcedestinationstring() {\n const data = this.resume()\n const node =\n /** @type {Link|Image} */\n this.stack[this.stack.length - 1]\n node.url = data\n }\n /** @type {Handle} */\n\n function onexitresourcetitlestring() {\n const data = this.resume()\n const node =\n /** @type {Link|Image} */\n this.stack[this.stack.length - 1]\n node.title = data\n }\n /** @type {Handle} */\n\n function onexitresource() {\n setData('inReference')\n }\n /** @type {Handle} */\n\n function onenterreference() {\n setData('referenceType', 'collapsed')\n }\n /** @type {Handle} */\n\n function onexitreferencestring(token) {\n const label = this.resume()\n const node =\n /** @type {LinkReference|ImageReference} */\n this.stack[this.stack.length - 1]\n node.label = label\n node.identifier = normalizeIdentifier(\n this.sliceSerialize(token)\n ).toLowerCase()\n setData('referenceType', 'full')\n }\n /** @type {Handle} */\n\n function onexitcharacterreferencemarker(token) {\n setData('characterReferenceType', token.type)\n }\n /** @type {Handle} */\n\n function onexitcharacterreferencevalue(token) {\n const data = this.sliceSerialize(token)\n const type = getData('characterReferenceType')\n /** @type {string} */\n\n let value\n\n if (type) {\n value = decodeNumericCharacterReference(\n data,\n type === 'characterReferenceMarkerNumeric' ? 10 : 16\n )\n setData('characterReferenceType')\n } else {\n // @ts-expect-error `decodeNamedCharacterReference` can return false for\n // invalid named character references, but everything we’ve tokenized is\n // valid.\n value = decodeNamedCharacterReference(data)\n }\n\n const tail = this.stack.pop()\n tail.value += value\n tail.position.end = point(token.end)\n }\n /** @type {Handle} */\n\n function onexitautolinkprotocol(token) {\n onexitdata.call(this, token)\n const node =\n /** @type {Link} */\n this.stack[this.stack.length - 1]\n node.url = this.sliceSerialize(token)\n }\n /** @type {Handle} */\n\n function onexitautolinkemail(token) {\n onexitdata.call(this, token)\n const node =\n /** @type {Link} */\n this.stack[this.stack.length - 1]\n node.url = 'mailto:' + this.sliceSerialize(token)\n } //\n // Creaters.\n //\n\n /** @returns {Blockquote} */\n\n function blockQuote() {\n return {\n type: 'blockquote',\n children: []\n }\n }\n /** @returns {Code} */\n\n function codeFlow() {\n return {\n type: 'code',\n lang: null,\n meta: null,\n value: ''\n }\n }\n /** @returns {InlineCode} */\n\n function codeText() {\n return {\n type: 'inlineCode',\n value: ''\n }\n }\n /** @returns {Definition} */\n\n function definition() {\n return {\n type: 'definition',\n identifier: '',\n label: null,\n title: null,\n url: ''\n }\n }\n /** @returns {Emphasis} */\n\n function emphasis() {\n return {\n type: 'emphasis',\n children: []\n }\n }\n /** @returns {Heading} */\n\n function heading() {\n // @ts-expect-error `depth` will be set later.\n return {\n type: 'heading',\n depth: undefined,\n children: []\n }\n }\n /** @returns {Break} */\n\n function hardBreak() {\n return {\n type: 'break'\n }\n }\n /** @returns {HTML} */\n\n function html() {\n return {\n type: 'html',\n value: ''\n }\n }\n /** @returns {Image} */\n\n function image() {\n return {\n type: 'image',\n title: null,\n url: '',\n alt: null\n }\n }\n /** @returns {Link} */\n\n function link() {\n return {\n type: 'link',\n title: null,\n url: '',\n children: []\n }\n }\n /**\n * @param {Token} token\n * @returns {List}\n */\n\n function list(token) {\n return {\n type: 'list',\n ordered: token.type === 'listOrdered',\n start: null,\n // @ts-expect-error Patched.\n spread: token._spread,\n children: []\n }\n }\n /**\n * @param {Token} token\n * @returns {ListItem}\n */\n\n function listItem(token) {\n return {\n type: 'listItem',\n // @ts-expect-error Patched.\n spread: token._spread,\n checked: null,\n children: []\n }\n }\n /** @returns {Paragraph} */\n\n function paragraph() {\n return {\n type: 'paragraph',\n children: []\n }\n }\n /** @returns {Strong} */\n\n function strong() {\n return {\n type: 'strong',\n children: []\n }\n }\n /** @returns {Text} */\n\n function text() {\n return {\n type: 'text',\n value: ''\n }\n }\n /** @returns {ThematicBreak} */\n\n function thematicBreak() {\n return {\n type: 'thematicBreak'\n }\n }\n}\n/**\n * @param {Extension} combined\n * @param {Array<Extension|Array<Extension>>} extensions\n * @returns {Extension}\n */\n\nfunction configure(combined, extensions) {\n let index = -1\n\n while (++index < extensions.length) {\n const value = extensions[index]\n\n if (Array.isArray(value)) {\n configure(combined, value)\n } else {\n extension(combined, value)\n }\n }\n\n return combined\n}\n/**\n * @param {Extension} combined\n * @param {Extension} extension\n * @returns {void}\n */\n\nfunction extension(combined, extension) {\n /** @type {string} */\n let key\n\n for (key in extension) {\n if (own.call(extension, key)) {\n const list = key === 'canContainEols' || key === 'transforms'\n const maybe = own.call(combined, key) ? combined[key] : undefined\n /* c8 ignore next */\n\n const left = maybe || (combined[key] = list ? [] : {})\n const right = extension[key]\n\n if (right) {\n if (list) {\n // @ts-expect-error: `left` is an array.\n combined[key] = [...left, ...right]\n } else {\n Object.assign(left, right)\n }\n }\n }\n }\n}\n/** @type {OnEnterError} */\n\nfunction defaultOnError(left, right) {\n if (left) {\n throw new Error(\n 'Cannot close `' +\n left.type +\n '` (' +\n stringifyPosition({\n start: left.start,\n end: left.end\n }) +\n '): a different token (`' +\n right.type +\n '`, ' +\n stringifyPosition({\n start: right.start,\n end: right.end\n }) +\n ') is open'\n )\n } else {\n throw new Error(\n 'Cannot close document, a token (`' +\n right.type +\n '`, ' +\n stringifyPosition({\n start: right.start,\n end: right.end\n }) +\n ') is still open'\n )\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Event} Event\n */\nimport {subtokenize} from 'micromark-util-subtokenize'\n/**\n * @param {Event[]} events\n * @returns {Event[]}\n */\n\nexport function postprocess(events) {\n while (!subtokenize(events)) {\n // Empty\n }\n\n return events\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').FullNormalizedExtension} FullNormalizedExtension\n * @typedef {import('micromark-util-types').ParseOptions} ParseOptions\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n * @typedef {import('micromark-util-types').Create} Create\n */\nimport {combineExtensions} from 'micromark-util-combine-extensions'\nimport {content} from './initialize/content.js'\nimport {document} from './initialize/document.js'\nimport {flow} from './initialize/flow.js'\nimport {text, string} from './initialize/text.js'\nimport {createTokenizer} from './create-tokenizer.js'\nimport * as defaultConstructs from './constructs.js'\n/**\n * @param {ParseOptions} [options]\n * @returns {ParseContext}\n */\n\nexport function parse(options = {}) {\n /** @type {FullNormalizedExtension} */\n // @ts-expect-error `defaultConstructs` is full, so the result will be too.\n const constructs = combineExtensions(\n // @ts-expect-error Same as above.\n [defaultConstructs].concat(options.extensions || [])\n )\n /** @type {ParseContext} */\n\n const parser = {\n defined: [],\n lazy: {},\n constructs,\n content: create(content),\n document: create(document),\n flow: create(flow),\n string: create(string),\n text: create(text)\n }\n return parser\n /**\n * @param {InitialConstruct} initial\n */\n\n function create(initial) {\n return creator\n /** @type {Create} */\n\n function creator(from) {\n return createTokenizer(parser, initial, from)\n }\n }\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast-util-from-markdown').Options} Options\n */\n\nimport {fromMarkdown} from 'mdast-util-from-markdown'\n\n/** @type {import('unified').Plugin<[Options?] | void[], string, Root>} */\nexport default function remarkParse(options) {\n /** @type {import('unified').ParserFunction<Root>} */\n const parser = (doc) => {\n // Assume options.\n const settings = /** @type {Options} */ (this.data('settings'))\n\n return fromMarkdown(\n doc,\n Object.assign({}, settings, options, {\n // Note: these options are not in the readme.\n // The goal is for them to be set by plugins on `data` instead of being\n // passed by users.\n extensions: this.data('micromarkExtensions') || [],\n mdastExtensions: this.data('fromMarkdownExtensions') || []\n })\n )\n }\n\n Object.assign(this, {Parser: parser})\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist').Literal} Literal\n * @typedef {Object.<string, unknown>} Props\n * @typedef {Array.<Node>|string} ChildrenOrValue\n *\n * @typedef {(<T extends string, P extends Record<string, unknown>, C extends Node[]>(type: T, props: P, children: C) => {type: T, children: C} & P)} BuildParentWithProps\n * @typedef {(<T extends string, P extends Record<string, unknown>>(type: T, props: P, value: string) => {type: T, value: string} & P)} BuildLiteralWithProps\n * @typedef {(<T extends string, P extends Record<string, unknown>>(type: T, props: P) => {type: T} & P)} BuildVoidWithProps\n * @typedef {(<T extends string, C extends Node[]>(type: T, children: C) => {type: T, children: C})} BuildParent\n * @typedef {(<T extends string>(type: T, value: string) => {type: T, value: string})} BuildLiteral\n * @typedef {(<T extends string>(type: T) => {type: T})} BuildVoid\n */\n\nexport var u = /**\n * @type {BuildVoid & BuildVoidWithProps & BuildLiteral & BuildLiteralWithProps & BuildParent & BuildParentWithProps}\n */ (\n /**\n * @param {string} type Type of node\n * @param {Props|ChildrenOrValue} [props] Additional properties for node (or `children` or `value`)\n * @param {ChildrenOrValue} [value] `children` or `value` of node\n * @returns {Node}\n */\n function (type, props, value) {\n /** @type {Node} */\n var node = {type: String(type)}\n\n if (\n (value === undefined || value === null) &&\n (typeof props === 'string' || Array.isArray(props))\n ) {\n value = props\n } else {\n Object.assign(node, props)\n }\n\n if (Array.isArray(value)) {\n node.children = value\n } else if (value !== undefined && value !== null) {\n node.value = String(value)\n }\n\n return node\n }\n)\n","/**\n * @typedef {import('mdast').Root|import('mdast').Parent['children'][number]} MdastNode\n * @typedef {import('./index.js').H} H\n * @typedef {import('./index.js').Handler} Handler\n * @typedef {import('./index.js').Content} Content\n */\n\nimport {u} from 'unist-builder'\n\nconst own = {}.hasOwnProperty\n\n/**\n * Transform an unknown node.\n * @type {Handler}\n * @param {MdastNode} node\n */\nfunction unknown(h, node) {\n const data = node.data || {}\n\n if (\n 'value' in node &&\n !(\n own.call(data, 'hName') ||\n own.call(data, 'hProperties') ||\n own.call(data, 'hChildren')\n )\n ) {\n return h.augment(node, u('text', node.value))\n }\n\n return h(node, 'div', all(h, node))\n}\n\n/**\n * @type {Handler}\n * @param {MdastNode} node\n */\nexport function one(h, node, parent) {\n const type = node && node.type\n /** @type {Handler} */\n let fn\n\n // Fail on non-nodes.\n if (!type) {\n throw new Error('Expected node, got `' + node + '`')\n }\n\n if (own.call(h.handlers, type)) {\n fn = h.handlers[type]\n } else if (h.passThrough && h.passThrough.includes(type)) {\n fn = returnNode\n } else {\n fn = h.unknownHandler\n }\n\n return (typeof fn === 'function' ? fn : unknown)(h, node, parent)\n}\n\n/**\n * @type {Handler}\n * @param {MdastNode} node\n */\nfunction returnNode(h, node) {\n // @ts-expect-error: Pass through custom node.\n return 'children' in node ? {...node, children: all(h, node)} : node\n}\n\n/**\n * @param {H} h\n * @param {MdastNode} parent\n */\nexport function all(h, parent) {\n /** @type {Array<Content>} */\n const values = []\n\n if ('children' in parent) {\n const nodes = parent.children\n let index = -1\n\n while (++index < nodes.length) {\n const result = one(h, nodes[index], parent)\n\n if (result) {\n if (index && nodes[index - 1].type === 'break') {\n if (!Array.isArray(result) && result.type === 'text') {\n result.value = result.value.replace(/^\\s+/, '')\n }\n\n if (!Array.isArray(result) && result.type === 'element') {\n const head = result.children[0]\n\n if (head && head.type === 'text') {\n head.value = head.value.replace(/^\\s+/, '')\n }\n }\n }\n\n if (Array.isArray(result)) {\n values.push(...result)\n } else {\n values.push(result)\n }\n }\n }\n }\n\n return values\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n *\n * @typedef {string} Type\n * @typedef {Object<string, unknown>} Props\n *\n * @typedef {null|undefined|Type|Props|TestFunctionAnything|Array.<Type|Props|TestFunctionAnything>} Test\n */\n\n/**\n * Check if a node passes a test\n *\n * @callback TestFunctionAnything\n * @param {Node} node\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {boolean|void}\n */\n\n/**\n * Check if a node passes a certain node test\n *\n * @template {Node} X\n * @callback TestFunctionPredicate\n * @param {Node} node\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {node is X}\n */\n\n/**\n * @callback AssertAnything\n * @param {unknown} [node]\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {boolean}\n */\n\n/**\n * Check if a node passes a certain node test\n *\n * @template {Node} Y\n * @callback AssertPredicate\n * @param {unknown} [node]\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {node is Y}\n */\n\nexport const is =\n /**\n * Check if a node passes a test.\n * When a `parent` node is known the `index` of node should also be given.\n *\n * @type {(\n * (<T extends Node>(node: unknown, test: T['type']|Partial<T>|TestFunctionPredicate<T>|Array.<T['type']|Partial<T>|TestFunctionPredicate<T>>, index?: number|null|undefined, parent?: Parent|null|undefined, context?: unknown) => node is T) &\n * ((node?: unknown, test?: Test, index?: number|null|undefined, parent?: Parent|null|undefined, context?: unknown) => boolean)\n * )}\n */\n (\n /**\n * Check if a node passes a test.\n * When a `parent` node is known the `index` of node should also be given.\n *\n * @param {unknown} [node] Node to check\n * @param {Test} [test]\n * When nullish, checks if `node` is a `Node`.\n * When `string`, works like passing `function (node) {return node.type === test}`.\n * When `function` checks if function passed the node is true.\n * When `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n * When `array`, checks any one of the subtests pass.\n * @param {number|null|undefined} [index] Position of `node` in `parent`\n * @param {Parent|null|undefined} [parent] Parent of `node`\n * @param {unknown} [context] Context object to invoke `test` with\n * @returns {boolean} Whether test passed and `node` is a `Node` (object with `type` set to non-empty `string`).\n */\n // eslint-disable-next-line max-params\n function is(node, test, index, parent, context) {\n const check = convert(test)\n\n if (\n index !== undefined &&\n index !== null &&\n (typeof index !== 'number' ||\n index < 0 ||\n index === Number.POSITIVE_INFINITY)\n ) {\n throw new Error('Expected positive finite index')\n }\n\n if (\n parent !== undefined &&\n parent !== null &&\n (!is(parent) || !parent.children)\n ) {\n throw new Error('Expected parent node')\n }\n\n if (\n (parent === undefined || parent === null) !==\n (index === undefined || index === null)\n ) {\n throw new Error('Expected both parent and index')\n }\n\n // @ts-expect-error Looks like a node.\n return node && node.type && typeof node.type === 'string'\n ? Boolean(check.call(context, node, index, parent))\n : false\n }\n )\n\nexport const convert =\n /**\n * @type {(\n * (<T extends Node>(test: T['type']|Partial<T>|TestFunctionPredicate<T>) => AssertPredicate<T>) &\n * ((test?: Test) => AssertAnything)\n * )}\n */\n (\n /**\n * Generate an assertion from a check.\n * @param {Test} [test]\n * When nullish, checks if `node` is a `Node`.\n * When `string`, works like passing `function (node) {return node.type === test}`.\n * When `function` checks if function passed the node is true.\n * When `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n * When `array`, checks any one of the subtests pass.\n * @returns {AssertAnything}\n */\n function (test) {\n if (test === undefined || test === null) {\n return ok\n }\n\n if (typeof test === 'string') {\n return typeFactory(test)\n }\n\n if (typeof test === 'object') {\n return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n }\n\n if (typeof test === 'function') {\n return castFactory(test)\n }\n\n throw new Error('Expected function, string, or object as test')\n }\n )\n/**\n * @param {Array.<Type|Props|TestFunctionAnything>} tests\n * @returns {AssertAnything}\n */\nfunction anyFactory(tests) {\n /** @type {Array.<AssertAnything>} */\n const checks = []\n let index = -1\n\n while (++index < tests.length) {\n checks[index] = convert(tests[index])\n }\n\n return castFactory(any)\n\n /**\n * @this {unknown}\n * @param {unknown[]} parameters\n * @returns {boolean}\n */\n function any(...parameters) {\n let index = -1\n\n while (++index < checks.length) {\n if (checks[index].call(this, ...parameters)) return true\n }\n\n return false\n }\n}\n\n/**\n * Utility to assert each property in `test` is represented in `node`, and each\n * values are strictly equal.\n *\n * @param {Props} check\n * @returns {AssertAnything}\n */\nfunction propsFactory(check) {\n return castFactory(all)\n\n /**\n * @param {Node} node\n * @returns {boolean}\n */\n function all(node) {\n /** @type {string} */\n let key\n\n for (key in check) {\n // @ts-expect-error: hush, it sure works as an index.\n if (node[key] !== check[key]) return false\n }\n\n return true\n }\n}\n\n/**\n * Utility to convert a string into a function which checks a given node’s type\n * for said string.\n *\n * @param {Type} check\n * @returns {AssertAnything}\n */\nfunction typeFactory(check) {\n return castFactory(type)\n\n /**\n * @param {Node} node\n */\n function type(node) {\n return node && node.type === check\n }\n}\n\n/**\n * Utility to convert a string into a function which checks a given node’s type\n * for said string.\n * @param {TestFunctionAnything} check\n * @returns {AssertAnything}\n */\nfunction castFactory(check) {\n return assertion\n\n /**\n * @this {unknown}\n * @param {Array.<unknown>} parameters\n * @returns {boolean}\n */\n function assertion(...parameters) {\n // @ts-expect-error: spreading is fine.\n return Boolean(check.call(this, ...parameters))\n }\n}\n\n// Utility to return true.\nfunction ok() {\n return true\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('./complex-types').Action} Action\n * @typedef {import('./complex-types').Index} Index\n * @typedef {import('./complex-types').ActionTuple} ActionTuple\n * @typedef {import('./complex-types').VisitorResult} VisitorResult\n * @typedef {import('./complex-types').Visitor} Visitor\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\n\n/**\n * Continue traversing as normal\n */\nexport const CONTINUE = true\n/**\n * Do not traverse this node’s children\n */\nexport const SKIP = 'skip'\n/**\n * Stop traversing immediately\n */\nexport const EXIT = false\n\n/**\n * Visit children of tree which pass a test\n *\n * @param tree Abstract syntax tree to walk\n * @param test Test node, optional\n * @param visitor Function to run for each node\n * @param reverse Visit the tree in reverse order, defaults to false\n */\nexport const visitParents =\n /**\n * @type {(\n * (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: import('./complex-types').BuildVisitor<Tree, Check>, reverse?: boolean) => void) &\n * (<Tree extends Node>(tree: Tree, visitor: import('./complex-types').BuildVisitor<Tree>, reverse?: boolean) => void)\n * )}\n */\n (\n /**\n * @param {Node} tree\n * @param {Test} test\n * @param {import('./complex-types').Visitor<Node>} visitor\n * @param {boolean} [reverse]\n */\n function (tree, test, visitor, reverse) {\n if (typeof test === 'function' && typeof visitor !== 'function') {\n reverse = visitor\n // @ts-expect-error no visitor given, so `visitor` is test.\n visitor = test\n test = null\n }\n\n const is = convert(test)\n const step = reverse ? -1 : 1\n\n factory(tree, null, [])()\n\n /**\n * @param {Node} node\n * @param {number?} index\n * @param {Array.<Parent>} parents\n */\n function factory(node, index, parents) {\n /** @type {Object.<string, unknown>} */\n // @ts-expect-error: hush\n const value = typeof node === 'object' && node !== null ? node : {}\n /** @type {string|undefined} */\n let name\n\n if (typeof value.type === 'string') {\n name =\n typeof value.tagName === 'string'\n ? value.tagName\n : typeof value.name === 'string'\n ? value.name\n : undefined\n\n Object.defineProperty(visit, 'name', {\n value:\n 'node (' +\n color(value.type + (name ? '<' + name + '>' : '')) +\n ')'\n })\n }\n\n return visit\n\n function visit() {\n /** @type {ActionTuple} */\n let result = []\n /** @type {ActionTuple} */\n let subresult\n /** @type {number} */\n let offset\n /** @type {Array.<Parent>} */\n let grandparents\n\n if (!test || is(node, index, parents[parents.length - 1] || null)) {\n result = toResult(visitor(node, parents))\n\n if (result[0] === EXIT) {\n return result\n }\n }\n\n // @ts-expect-error looks like a parent.\n if (node.children && result[0] !== SKIP) {\n // @ts-expect-error looks like a parent.\n offset = (reverse ? node.children.length : -1) + step\n // @ts-expect-error looks like a parent.\n grandparents = parents.concat(node)\n\n // @ts-expect-error looks like a parent.\n while (offset > -1 && offset < node.children.length) {\n // @ts-expect-error looks like a parent.\n subresult = factory(node.children[offset], offset, grandparents)()\n\n if (subresult[0] === EXIT) {\n return subresult\n }\n\n offset =\n typeof subresult[1] === 'number' ? subresult[1] : offset + step\n }\n }\n\n return result\n }\n }\n }\n )\n\n/**\n * @param {VisitorResult} value\n * @returns {ActionTuple}\n */\nfunction toResult(value) {\n if (Array.isArray(value)) {\n return value\n }\n\n if (typeof value === 'number') {\n return [CONTINUE, value]\n }\n\n return [value]\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n * @typedef {import('./complex-types').Visitor} Visitor\n */\n\nimport {visitParents, CONTINUE, SKIP, EXIT} from 'unist-util-visit-parents'\n\nexport {CONTINUE, SKIP, EXIT}\n\n/**\n * Visit children of tree which pass a test\n *\n * @param tree Abstract syntax tree to walk\n * @param test Test, optional\n * @param visitor Function to run for each node\n * @param reverse Fisit the tree in reverse, defaults to false\n */\nexport const visit =\n /**\n * @type {(\n * (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: import('./complex-types').BuildVisitor<Tree, Check>, reverse?: boolean) => void) &\n * (<Tree extends Node>(tree: Tree, visitor: import('./complex-types').BuildVisitor<Tree>, reverse?: boolean) => void)\n * )}\n */\n (\n /**\n * @param {Node} tree\n * @param {Test} test\n * @param {import('./complex-types').Visitor} visitor\n * @param {boolean} [reverse]\n */\n function (tree, test, visitor, reverse) {\n if (typeof test === 'function' && typeof visitor !== 'function') {\n reverse = visitor\n visitor = test\n test = null\n }\n\n visitParents(tree, test, overload, reverse)\n\n /**\n * @param {Node} node\n * @param {Array.<Parent>} parents\n */\n function overload(node, parents) {\n const parent = parents[parents.length - 1]\n return visitor(\n node,\n parent ? parent.children.indexOf(node) : null,\n parent\n )\n }\n }\n )\n","/**\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Node} Node\n * @typedef {Record<string, unknown> & {type: string, position?: PositionLike|undefined}} NodeLike\n * @typedef {import('unist').Point} Point\n *\n * @typedef {Partial<Point>} PointLike\n *\n * @typedef PositionLike\n * @property {PointLike} [start]\n * @property {PointLike} [end]\n */\n\nexport const pointStart = point('start')\nexport const pointEnd = point('end')\n\n/**\n * Get the positional info of `node`.\n *\n * @param {NodeLike|Node} [node]\n * @returns {Position}\n */\nexport function position(node) {\n return {start: pointStart(node), end: pointEnd(node)}\n}\n\n/**\n * Get the positional info of `node`.\n *\n * @param {'start'|'end'} type\n */\nfunction point(type) {\n return point\n\n /**\n * Get the positional info of `node`.\n *\n * @param {NodeLike|Node} [node]\n * @returns {Point}\n */\n function point(node) {\n const point = (node && node.position && node.position[type]) || {}\n\n return {\n line: point.line || null,\n column: point.column || null,\n offset: point.offset > -1 ? point.offset : null\n }\n }\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n */\n\n/**\n * @typedef {CONTINUE|SKIP|EXIT} Action Union of the action types\n * @typedef {number} Index Move to the sibling at index next (after node itself is completely traversed). Useful if mutating the tree, such as removing the node the visitor is currently on, or any of its previous siblings (or next siblings, in case of reverse) Results less than 0 or greater than or equal to children.length stop traversing the parent\n * @typedef {[(Action|null|undefined|void)?, (Index|null|undefined)?]} ActionTuple List with one or two values, the first an action, the second an index.\n * @typedef {null|undefined|Action|Index|ActionTuple|void} VisitorResult Any value that can be returned from a visitor\n */\n\n/**\n * Invoked when a node (matching test, if given) is found.\n * Visitors are free to transform node.\n * They can also transform the parent of node (the last of ancestors).\n * Replacing node itself, if `SKIP` is not returned, still causes its descendants to be visited.\n * If adding or removing previous siblings (or next siblings, in case of reverse) of node,\n * visitor should return a new index (number) to specify the sibling to traverse after node is traversed.\n * Adding or removing next siblings of node (or previous siblings, in case of reverse)\n * is handled as expected without needing to return a new index.\n * Removing the children property of an ancestor still results in them being traversed.\n *\n * @template {Node} V\n * @callback Visitor\n * @param {V} node Found node\n * @param {Array.<Parent>} ancestors Ancestors of node\n * @returns {VisitorResult}\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\n\n/**\n * Continue traversing as normal\n */\nexport const CONTINUE = true\n/**\n * Do not traverse this node’s children\n */\nexport const SKIP = 'skip'\n/**\n * Stop traversing immediately\n */\nexport const EXIT = false\n\nexport const visitParents =\n /**\n * @type {(\n * (<T extends Node>(tree: Node, test: T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>|Array.<T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>>, visitor: Visitor<T>, reverse?: boolean) => void) &\n * ((tree: Node, test: Test, visitor: Visitor<Node>, reverse?: boolean) => void) &\n * ((tree: Node, visitor: Visitor<Node>, reverse?: boolean) => void)\n * )}\n */\n (\n /**\n * Visit children of tree which pass a test\n *\n * @param {Node} tree Abstract syntax tree to walk\n * @param {Test} test test Test node\n * @param {Visitor<Node>} visitor Function to run for each node\n * @param {boolean} [reverse] Fisit the tree in reverse, defaults to false\n */\n function (tree, test, visitor, reverse) {\n if (typeof test === 'function' && typeof visitor !== 'function') {\n reverse = visitor\n // @ts-ignore no visitor given, so `visitor` is test.\n visitor = test\n test = null\n }\n\n var is = convert(test)\n var step = reverse ? -1 : 1\n\n factory(tree, null, [])()\n\n /**\n * @param {Node} node\n * @param {number?} index\n * @param {Array.<Parent>} parents\n */\n function factory(node, index, parents) {\n /** @type {Object.<string, unknown>} */\n var value = typeof node === 'object' && node !== null ? node : {}\n /** @type {string} */\n var name\n\n if (typeof value.type === 'string') {\n name =\n typeof value.tagName === 'string'\n ? value.tagName\n : typeof value.name === 'string'\n ? value.name\n : undefined\n\n Object.defineProperty(visit, 'name', {\n value:\n 'node (' +\n color(value.type + (name ? '<' + name + '>' : '')) +\n ')'\n })\n }\n\n return visit\n\n function visit() {\n /** @type {ActionTuple} */\n var result = []\n /** @type {ActionTuple} */\n var subresult\n /** @type {number} */\n var offset\n /** @type {Array.<Parent>} */\n var grandparents\n\n if (!test || is(node, index, parents[parents.length - 1] || null)) {\n result = toResult(visitor(node, parents))\n\n if (result[0] === EXIT) {\n return result\n }\n }\n\n if (node.children && result[0] !== SKIP) {\n // @ts-ignore looks like a parent.\n offset = (reverse ? node.children.length : -1) + step\n // @ts-ignore looks like a parent.\n grandparents = parents.concat(node)\n\n // @ts-ignore looks like a parent.\n while (offset > -1 && offset < node.children.length) {\n subresult = factory(node.children[offset], offset, grandparents)()\n\n if (subresult[0] === EXIT) {\n return subresult\n }\n\n offset =\n typeof subresult[1] === 'number' ? subresult[1] : offset + step\n }\n }\n\n return result\n }\n }\n }\n )\n\n/**\n * @param {VisitorResult} value\n * @returns {ActionTuple}\n */\nfunction toResult(value) {\n if (Array.isArray(value)) {\n return value\n }\n\n if (typeof value === 'number') {\n return [CONTINUE, value]\n }\n\n return [value]\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * Invoked when a node (matching test, if given) is found.\n * Visitors are free to transform node.\n * They can also transform the parent of node (the last of ancestors).\n * Replacing node itself, if `SKIP` is not returned, still causes its descendants to be visited.\n * If adding or removing previous siblings (or next siblings, in case of reverse) of node,\n * visitor should return a new index (number) to specify the sibling to traverse after node is traversed.\n * Adding or removing next siblings of node (or previous siblings, in case of reverse)\n * is handled as expected without needing to return a new index.\n * Removing the children property of an ancestor still results in them being traversed.\n *\n * @template {Node} V\n * @callback Visitor\n * @param {V} node Found node\n * @param {number|null} index Position of `node` in `parent`\n * @param {Parent|null} parent Parent of `node`\n * @returns {VisitorResult}\n */\n\nimport {visitParents, CONTINUE, SKIP, EXIT} from 'unist-util-visit-parents'\n\nexport {CONTINUE, SKIP, EXIT}\n\nexport const visit =\n /**\n * @type {(\n * (<T extends Node>(tree: Node, test: T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>|Array.<T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>>, visitor: Visitor<T>, reverse?: boolean) => void) &\n * ((tree: Node, test: Test, visitor: Visitor<Node>, reverse?: boolean) => void) &\n * ((tree: Node, visitor: Visitor<Node>, reverse?: boolean) => void)\n * )}\n */\n (\n /**\n * Visit children of tree which pass a test\n *\n * @param {Node} tree Abstract syntax tree to walk\n * @param {Test} test test Test node\n * @param {Visitor<Node>} visitor Function to run for each node\n * @param {boolean} [reverse] Fisit the tree in reverse, defaults to false\n */\n function (tree, test, visitor, reverse) {\n if (typeof test === 'function' && typeof visitor !== 'function') {\n reverse = visitor\n visitor = test\n test = null\n }\n\n visitParents(tree, test, overload, reverse)\n\n /**\n * @param {Node} node\n * @param {Array.<Parent>} parents\n */\n function overload(node, parents) {\n var parent = parents[parents.length - 1]\n return visitor(\n node,\n parent ? parent.children.indexOf(node) : null,\n parent\n )\n }\n }\n )\n","/**\n * @typedef {import('mdast').Root|import('mdast').Content} Node\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('unist-util-visit').Visitor<Definition>} DefinitionVisitor\n */\n\nimport {visit} from 'unist-util-visit'\n\nconst own = {}.hasOwnProperty\n\n/**\n *\n * @param {Node} node\n */\nexport function definitions(node) {\n /** @type {Object.<string, Definition>} */\n const cache = Object.create(null)\n\n if (!node || !node.type) {\n throw new Error('mdast-util-definitions expected node')\n }\n\n visit(node, 'definition', ondefinition)\n\n return getDefinition\n\n /** @type {DefinitionVisitor} */\n function ondefinition(definition) {\n const id = clean(definition.identifier)\n if (id && !own.call(cache, id)) {\n cache[id] = definition\n }\n }\n\n /**\n * Get a node from the bound definition-cache.\n *\n * @param {string} identifier\n * @returns {Definition|null}\n */\n function getDefinition(identifier) {\n const id = clean(identifier)\n return id && own.call(cache, id) ? cache[id] : null\n }\n}\n\n/**\n * @param {string} [value]\n * @returns {string}\n */\nfunction clean(value) {\n return String(value || '').toUpperCase()\n}\n","const characterReferences = {'\"': 'quot', '&': 'amp', '<': 'lt', '>': 'gt'}\n\n/**\n * Encode only the dangerous HTML characters.\n *\n * This ensures that certain characters which have special meaning in HTML are\n * dealt with.\n * Technically, we can skip `>` and `\"` in many cases, but CM includes them.\n *\n * @param {string} value\n * @returns {string}\n */\nexport function encode(value) {\n return value.replace(/[\"&<>]/g, replace)\n\n /**\n * @param {string} value\n * @returns {string}\n */\n function replace(value) {\n // @ts-expect-error Hush, it’s fine.\n return '&' + characterReferences[value] + ';'\n }\n}\n","import {asciiAlphanumeric} from 'micromark-util-character'\nimport {encode} from 'micromark-util-encode'\n\n/**\n * Make a value safe for injection as a URL.\n *\n * This encodes unsafe characters with percent-encoding and skips already\n * encoded sequences (see `normalizeUri` below).\n * Further unsafe characters are encoded as character references (see\n * `micromark-util-encode`).\n *\n * Then, a regex of allowed protocols can be given, in which case the URL is\n * sanitized.\n * For example, `/^(https?|ircs?|mailto|xmpp)$/i` can be used for `a[href]`,\n * or `/^https?$/i` for `img[src]`.\n * If the URL includes an unknown protocol (one not matched by `protocol`, such\n * as a dangerous example, `javascript:`), the value is ignored.\n *\n * @param {string|undefined} url\n * @param {RegExp} [protocol]\n * @returns {string}\n */\nexport function sanitizeUri(url, protocol) {\n const value = encode(normalizeUri(url || ''))\n\n if (!protocol) {\n return value\n }\n\n const colon = value.indexOf(':')\n const questionMark = value.indexOf('?')\n const numberSign = value.indexOf('#')\n const slash = value.indexOf('/')\n\n if (\n // If there is no protocol, it’s relative.\n colon < 0 || // If the first colon is after a `?`, `#`, or `/`, it’s not a protocol.\n (slash > -1 && colon > slash) ||\n (questionMark > -1 && colon > questionMark) ||\n (numberSign > -1 && colon > numberSign) || // It is a protocol, it should be allowed.\n protocol.test(value.slice(0, colon))\n ) {\n return value\n }\n\n return ''\n}\n/**\n * Normalize a URL (such as used in definitions).\n *\n * Encode unsafe characters with percent-encoding, skipping already encoded\n * sequences.\n *\n * @param {string} value\n * @returns {string}\n */\n\nfunction normalizeUri(value) {\n /** @type {string[]} */\n const result = []\n let index = -1\n let start = 0\n let skip = 0\n\n while (++index < value.length) {\n const code = value.charCodeAt(index)\n /** @type {string} */\n\n let replace = '' // A correct percent encoded value.\n\n if (\n code === 37 &&\n asciiAlphanumeric(value.charCodeAt(index + 1)) &&\n asciiAlphanumeric(value.charCodeAt(index + 2))\n ) {\n skip = 2\n } // ASCII.\n else if (code < 128) {\n if (!/[!#$&-;=?-Z_a-z~]/.test(String.fromCharCode(code))) {\n replace = String.fromCharCode(code)\n }\n } // Astral.\n else if (code > 55295 && code < 57344) {\n const next = value.charCodeAt(index + 1) // A correct surrogate pair.\n\n if (code < 56320 && next > 56319 && next < 57344) {\n replace = String.fromCharCode(code, next)\n skip = 1\n } // Lone surrogate.\n else {\n replace = '\\uFFFD'\n }\n } // Unicode.\n else {\n replace = String.fromCharCode(code)\n }\n\n if (replace) {\n result.push(value.slice(start, index), encodeURIComponent(replace))\n start = index + skip + 1\n replace = ''\n }\n\n if (skip) {\n index += skip\n skip = 0\n }\n }\n\n return result.join('') + value.slice(start)\n}\n","/**\n * @typedef {import('./index.js').Content} Content\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * Wrap `nodes` with line feeds between each entry.\n * Optionally adds line feeds at the start and end.\n *\n * @param {Array<Content>} nodes\n * @param {boolean} [loose=false]\n * @returns {Array<Content>}\n */\nexport function wrap(nodes, loose) {\n /** @type {Array<Content>} */\n const result = []\n let index = -1\n\n if (loose) {\n result.push(u('text', '\\n'))\n }\n\n while (++index < nodes.length) {\n if (index) result.push(u('text', '\\n'))\n result.push(nodes[index])\n }\n\n if (loose && nodes.length > 0) {\n result.push(u('text', '\\n'))\n }\n\n return result\n}\n","/**\n * @typedef {import('mdast').FootnoteReference} FootnoteReference\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {sanitizeUri} from 'micromark-util-sanitize-uri'\nimport {u} from 'unist-builder'\n\n/**\n * @type {Handler}\n * @param {FootnoteReference} node\n */\nexport function footnoteReference(h, node) {\n const id = String(node.identifier)\n const safeId = sanitizeUri(id.toLowerCase())\n const index = h.footnoteOrder.indexOf(id)\n /** @type {number} */\n let counter\n\n if (index === -1) {\n h.footnoteOrder.push(id)\n h.footnoteCounts[id] = 1\n counter = h.footnoteOrder.length\n } else {\n h.footnoteCounts[id]++\n counter = index + 1\n }\n\n const reuseCounter = h.footnoteCounts[id]\n\n return h(node, 'sup', [\n h(\n node.position,\n 'a',\n {\n href: '#' + h.clobberPrefix + 'fn-' + safeId,\n id:\n h.clobberPrefix +\n 'fnref-' +\n safeId +\n (reuseCounter > 1 ? '-' + reuseCounter : ''),\n dataFootnoteRef: true,\n ariaDescribedBy: 'footnote-label'\n },\n [u('text', String(counter))]\n )\n ])\n}\n","\n'use strict';\n\n\nvar encodeCache = {};\n\n\n// Create a lookup array where anything but characters in `chars` string\n// and alphanumeric chars is percent-encoded.\n//\nfunction getEncodeCache(exclude) {\n var i, ch, cache = encodeCache[exclude];\n if (cache) { return cache; }\n\n cache = encodeCache[exclude] = [];\n\n for (i = 0; i < 128; i++) {\n ch = String.fromCharCode(i);\n\n if (/^[0-9a-z]$/i.test(ch)) {\n // always allow unencoded alphanumeric characters\n cache.push(ch);\n } else {\n cache.push('%' + ('0' + i.toString(16).toUpperCase()).slice(-2));\n }\n }\n\n for (i = 0; i < exclude.length; i++) {\n cache[exclude.charCodeAt(i)] = exclude[i];\n }\n\n return cache;\n}\n\n\n// Encode unsafe characters with percent-encoding, skipping already\n// encoded sequences.\n//\n// - string - string to encode\n// - exclude - list of characters to ignore (in addition to a-zA-Z0-9)\n// - keepEscaped - don't encode '%' in a correct escape sequence (default: true)\n//\nfunction encode(string, exclude, keepEscaped) {\n var i, l, code, nextCode, cache,\n result = '';\n\n if (typeof exclude !== 'string') {\n // encode(string, keepEscaped)\n keepEscaped = exclude;\n exclude = encode.defaultChars;\n }\n\n if (typeof keepEscaped === 'undefined') {\n keepEscaped = true;\n }\n\n cache = getEncodeCache(exclude);\n\n for (i = 0, l = string.length; i < l; i++) {\n code = string.charCodeAt(i);\n\n if (keepEscaped && code === 0x25 /* % */ && i + 2 < l) {\n if (/^[0-9a-f]{2}$/i.test(string.slice(i + 1, i + 3))) {\n result += string.slice(i, i + 3);\n i += 2;\n continue;\n }\n }\n\n if (code < 128) {\n result += cache[code];\n continue;\n }\n\n if (code >= 0xD800 && code <= 0xDFFF) {\n if (code >= 0xD800 && code <= 0xDBFF && i + 1 < l) {\n nextCode = string.charCodeAt(i + 1);\n if (nextCode >= 0xDC00 && nextCode <= 0xDFFF) {\n result += encodeURIComponent(string[i] + string[i + 1]);\n i++;\n continue;\n }\n }\n result += '%EF%BF%BD';\n continue;\n }\n\n result += encodeURIComponent(string[i]);\n }\n\n return result;\n}\n\nencode.defaultChars = \";/?:@&=+$,-_.!~*'()#\";\nencode.componentChars = \"-_.!~*'()\";\n\n\nmodule.exports = encode;\n","/**\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('./index.js').Handler} Handler\n * @typedef {import('./index.js').Content} Content\n */\n\nimport {u} from 'unist-builder'\nimport {all} from './traverse.js'\n\n/**\n * Return the content of a reference without definition as plain text.\n *\n * @type {Handler}\n * @param {ImageReference|LinkReference} node\n * @returns {Content|Array<Content>}\n */\nexport function revert(h, node) {\n const subtype = node.referenceType\n let suffix = ']'\n\n if (subtype === 'collapsed') {\n suffix += '[]'\n } else if (subtype === 'full') {\n suffix += '[' + (node.label || node.identifier) + ']'\n }\n\n if (node.type === 'imageReference') {\n return u('text', '![' + node.alt + suffix)\n }\n\n const contents = all(h, node)\n const head = contents[0]\n\n if (head && head.type === 'text') {\n head.value = '[' + head.value\n } else {\n contents.unshift(u('text', '['))\n }\n\n const tail = contents[contents.length - 1]\n\n if (tail && tail.type === 'text') {\n tail.value += suffix\n } else {\n contents.push(u('text', suffix))\n }\n\n return contents\n}\n","/**\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').List} List\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('hast').Element} Element\n * @typedef {import('../index.js').Handler} Handler\n * @typedef {import('../index.js').Content} Content\n */\n\nimport {u} from 'unist-builder'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {ListItem} node\n * @param {List} parent\n */\nexport function listItem(h, node, parent) {\n const result = all(h, node)\n const loose = parent ? listLoose(parent) : listItemLoose(node)\n /** @type {Properties} */\n const props = {}\n /** @type {Array<Content>} */\n const wrapped = []\n\n if (typeof node.checked === 'boolean') {\n /** @type {Element} */\n let paragraph\n\n if (\n result[0] &&\n result[0].type === 'element' &&\n result[0].tagName === 'p'\n ) {\n paragraph = result[0]\n } else {\n paragraph = h(null, 'p', [])\n result.unshift(paragraph)\n }\n\n if (paragraph.children.length > 0) {\n paragraph.children.unshift(u('text', ' '))\n }\n\n paragraph.children.unshift(\n h(null, 'input', {\n type: 'checkbox',\n checked: node.checked,\n disabled: true\n })\n )\n\n // According to github-markdown-css, this class hides bullet.\n // See: <https://github.com/sindresorhus/github-markdown-css>.\n props.className = ['task-list-item']\n }\n\n let index = -1\n\n while (++index < result.length) {\n const child = result[index]\n\n // Add eols before nodes, except if this is a loose, first paragraph.\n if (\n loose ||\n index !== 0 ||\n child.type !== 'element' ||\n child.tagName !== 'p'\n ) {\n wrapped.push(u('text', '\\n'))\n }\n\n if (child.type === 'element' && child.tagName === 'p' && !loose) {\n wrapped.push(...child.children)\n } else {\n wrapped.push(child)\n }\n }\n\n const tail = result[result.length - 1]\n\n // Add a final eol.\n if (tail && (loose || !('tagName' in tail) || tail.tagName !== 'p')) {\n wrapped.push(u('text', '\\n'))\n }\n\n return h(node, 'li', props, wrapped)\n}\n\n/**\n * @param {List} node\n * @return {Boolean}\n */\nfunction listLoose(node) {\n let loose = node.spread\n const children = node.children\n let index = -1\n\n while (!loose && ++index < children.length) {\n loose = listItemLoose(children[index])\n }\n\n return Boolean(loose)\n}\n\n/**\n * @param {ListItem} node\n * @return {Boolean}\n */\nfunction listItemLoose(node) {\n const spread = node.spread\n\n return spread === undefined || spread === null\n ? node.children.length > 1\n : spread\n}\n","import {blockquote} from './blockquote.js'\nimport {hardBreak} from './break.js'\nimport {code} from './code.js'\nimport {strikethrough} from './delete.js'\nimport {emphasis} from './emphasis.js'\nimport {footnoteReference} from './footnote-reference.js'\nimport {footnote} from './footnote.js'\nimport {heading} from './heading.js'\nimport {html} from './html.js'\nimport {imageReference} from './image-reference.js'\nimport {image} from './image.js'\nimport {inlineCode} from './inline-code.js'\nimport {linkReference} from './link-reference.js'\nimport {link} from './link.js'\nimport {listItem} from './list-item.js'\nimport {list} from './list.js'\nimport {paragraph} from './paragraph.js'\nimport {root} from './root.js'\nimport {strong} from './strong.js'\nimport {table} from './table.js'\nimport {text} from './text.js'\nimport {thematicBreak} from './thematic-break.js'\n\nexport const handlers = {\n blockquote,\n break: hardBreak,\n code,\n delete: strikethrough,\n emphasis,\n footnoteReference,\n footnote,\n heading,\n html,\n imageReference,\n image,\n inlineCode,\n linkReference,\n link,\n listItem,\n list,\n paragraph,\n root,\n strong,\n table,\n text,\n thematicBreak,\n toml: ignore,\n yaml: ignore,\n definition: ignore,\n footnoteDefinition: ignore\n}\n\n// Return nothing for nodes that are ignored.\nfunction ignore() {\n return null\n}\n","/**\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {wrap} from '../wrap.js'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Blockquote} node\n */\nexport function blockquote(h, node) {\n return h(node, 'blockquote', wrap(all(h, node), true))\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Text} Text\n * @typedef {import('mdast').Break} Break\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * @type {Handler}\n * @param {Break} node\n * @returns {Array<Element|Text>}\n */\nexport function hardBreak(h, node) {\n return [h(node, 'br'), u('text', '\\n')]\n}\n","/**\n * @typedef {import('mdast').Code} Code\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * @type {Handler}\n * @param {Code} node\n */\nexport function code(h, node) {\n const value = node.value ? node.value + '\\n' : ''\n // To do: next major, use `node.lang` w/o regex, the splitting’s been going\n // on for years in remark now.\n const lang = node.lang && node.lang.match(/^[^ \\t]+(?=[ \\t]|$)/)\n /** @type {Properties} */\n const props = {}\n\n if (lang) {\n props.className = ['language-' + lang]\n }\n\n const code = h(node, 'code', props, [u('text', value)])\n\n if (node.meta) {\n code.data = {meta: node.meta}\n }\n\n return h(node.position, 'pre', [code])\n}\n","/**\n * @typedef {import('mdast').Delete} Delete\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Delete} node\n */\nexport function strikethrough(h, node) {\n return h(node, 'del', all(h, node))\n}\n","/**\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Emphasis} node\n */\nexport function emphasis(h, node) {\n return h(node, 'em', all(h, node))\n}\n","/**\n * @typedef {import('mdast').Footnote} Footnote\n * @typedef {import('../index.js').Handler} Handler\n *\n * @todo\n * `footnote` (or “inline note”) are a pandoc footnotes feature (`^[a note]`)\n * that does not exist in GFM.\n * We still have support for it, so that things remain working with\n * `micromark-extension-footnote` and `mdast-util-footnote`, but in the future\n * we might be able to remove it?\n */\n\nimport {footnoteReference} from './footnote-reference.js'\n\n/**\n * @type {Handler}\n * @param {Footnote} node\n */\nexport function footnote(h, node) {\n const footnoteById = h.footnoteById\n let no = 1\n\n while (no in footnoteById) no++\n\n const identifier = String(no)\n\n footnoteById[identifier] = {\n type: 'footnoteDefinition',\n identifier,\n children: [{type: 'paragraph', children: node.children}],\n position: node.position\n }\n\n return footnoteReference(h, {\n type: 'footnoteReference',\n identifier,\n position: node.position\n })\n}\n","/**\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Heading} node\n */\nexport function heading(h, node) {\n return h(node, 'h' + node.depth, all(h, node))\n}\n","/**\n * @typedef {import('mdast').HTML} HTML\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * Return either a `raw` node in dangerous mode, otherwise nothing.\n *\n * @type {Handler}\n * @param {HTML} node\n */\nexport function html(h, node) {\n return h.dangerous ? h.augment(node, u('raw', node.value)) : null\n}\n","/**\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport normalize from 'mdurl/encode.js'\nimport {revert} from '../revert.js'\n\n/**\n * @type {Handler}\n * @param {ImageReference} node\n */\nexport function imageReference(h, node) {\n const def = h.definition(node.identifier)\n\n if (!def) {\n return revert(h, node)\n }\n\n /** @type {Properties} */\n const props = {src: normalize(def.url || ''), alt: node.alt}\n\n if (def.title !== null && def.title !== undefined) {\n props.title = def.title\n }\n\n return h(node, 'img', props)\n}\n","/**\n * @typedef {import('mdast').Image} Image\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport normalize from 'mdurl/encode.js'\n\n/**\n * @type {Handler}\n * @param {Image} node\n */\nexport function image(h, node) {\n /** @type {Properties} */\n const props = {src: normalize(node.url), alt: node.alt}\n\n if (node.title !== null && node.title !== undefined) {\n props.title = node.title\n }\n\n return h(node, 'img', props)\n}\n","/**\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * @type {Handler}\n * @param {InlineCode} node\n */\nexport function inlineCode(h, node) {\n return h(node, 'code', [u('text', node.value.replace(/\\r?\\n|\\r/g, ' '))])\n}\n","/**\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport normalize from 'mdurl/encode.js'\nimport {revert} from '../revert.js'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {LinkReference} node\n */\nexport function linkReference(h, node) {\n const def = h.definition(node.identifier)\n\n if (!def) {\n return revert(h, node)\n }\n\n /** @type {Properties} */\n const props = {href: normalize(def.url || '')}\n\n if (def.title !== null && def.title !== undefined) {\n props.title = def.title\n }\n\n return h(node, 'a', props, all(h, node))\n}\n","/**\n * @typedef {import('mdast').Link} Link\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport normalize from 'mdurl/encode.js'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Link} node\n */\nexport function link(h, node) {\n /** @type {Properties} */\n const props = {href: normalize(node.url)}\n\n if (node.title !== null && node.title !== undefined) {\n props.title = node.title\n }\n\n return h(node, 'a', props, all(h, node))\n}\n","/**\n * @typedef {import('mdast').List} List\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {wrap} from '../wrap.js'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {List} node\n * @returns {Element}\n */\nexport function list(h, node) {\n /** @type {Properties} */\n const props = {}\n const name = node.ordered ? 'ol' : 'ul'\n const items = all(h, node)\n let index = -1\n\n if (typeof node.start === 'number' && node.start !== 1) {\n props.start = node.start\n }\n\n // Like GitHub, add a class for custom styling.\n while (++index < items.length) {\n const item = items[index]\n\n if (\n item.type === 'element' &&\n item.tagName === 'li' &&\n item.properties &&\n Array.isArray(item.properties.className) &&\n item.properties.className.includes('task-list-item')\n ) {\n props.className = ['contains-task-list']\n break\n }\n }\n\n return h(node, name, props, wrap(items, true))\n}\n","/**\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Paragraph} node\n */\nexport function paragraph(h, node) {\n return h(node, 'p', all(h, node))\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\nimport {all} from '../traverse.js'\nimport {wrap} from '../wrap.js'\n\n/**\n * @type {Handler}\n * @param {Root} node\n */\nexport function root(h, node) {\n // @ts-expect-error `root`s are also fine.\n return h.augment(node, u('root', wrap(all(h, node))))\n}\n","/**\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Strong} node\n */\nexport function strong(h, node) {\n return h(node, 'strong', all(h, node))\n}\n","/**\n * @typedef {import('mdast').Table} Table\n * @typedef {import('mdast').TableCell} TableCell\n * @typedef {import('hast').Element} Element\n * @typedef {import('../index.js').Handler} Handler\n * @typedef {import('../index.js').Content} Content\n */\n\nimport {pointStart, pointEnd} from 'unist-util-position'\nimport {wrap} from '../wrap.js'\nimport {all} from '../traverse.js'\n\n/**\n * @type {Handler}\n * @param {Table} node\n */\nexport function table(h, node) {\n const rows = node.children\n let index = -1\n const align = node.align || []\n /** @type {Array<Element>} */\n const result = []\n\n while (++index < rows.length) {\n const row = rows[index].children\n const name = index === 0 ? 'th' : 'td'\n /** @type {Array<Content>} */\n const out = []\n let cellIndex = -1\n const length = node.align ? align.length : row.length\n\n while (++cellIndex < length) {\n const cell = row[cellIndex]\n out.push(\n h(cell, name, {align: align[cellIndex]}, cell ? all(h, cell) : [])\n )\n }\n\n result[index] = h(rows[index], 'tr', wrap(out, true))\n }\n\n return h(\n node,\n 'table',\n wrap(\n [h(result[0].position, 'thead', wrap([result[0]], true))].concat(\n result[1]\n ? h(\n {\n start: pointStart(result[1]),\n end: pointEnd(result[result.length - 1])\n },\n 'tbody',\n wrap(result.slice(1), true)\n )\n : []\n ),\n true\n )\n )\n}\n","/**\n * @typedef {import('mdast').Text} Text\n * @typedef {import('../index.js').Handler} Handler\n */\n\nimport {u} from 'unist-builder'\n\n/**\n * @type {Handler}\n * @param {Text} node\n */\nexport function text(h, node) {\n return h.augment(\n node,\n u('text', String(node.value).replace(/[ \\t]*(\\r?\\n|\\r)[ \\t]*/g, '$1'))\n )\n}\n","/**\n * @typedef {import('mdast').ThematicBreak} ThematicBreak\n * @typedef {import('hast').Element} Element\n * @typedef {import('../index.js').Handler} Handler\n */\n\n/**\n * @type {Handler}\n * @param {ThematicBreak} [node]\n * @returns {Element}\n */\nexport function thematicBreak(h, node) {\n return h(node, 'hr')\n}\n","/**\n * @typedef {import('mdast').Root|import('mdast').Parent['children'][number]} MdastNode\n * @typedef {import('hast').Root|import('hast').Parent['children'][number]} HastNode\n * @typedef {import('mdast').Parent} Parent\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('mdast').FootnoteDefinition} FootnoteDefinition\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('hast').Text} Text\n * @typedef {import('hast').Comment} Comment\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Root} Root\n * @typedef {import('hast').ElementContent} Content\n * @typedef {import('unist-util-position').PositionLike} PositionLike\n *\n * @typedef EmbeddedHastFields\n * @property {string} [hName] Defines the tag name of an element\n * @property {Properties} [hProperties] Defines the properties of an element\n * @property {Array<Content>} [hChildren] Defines the (hast) children of an element\n *\n * @typedef {Record<string, unknown> & EmbeddedHastFields} Data unist data with embedded hast fields\n *\n * @typedef {MdastNode & {data?: Data}} NodeWithData unist node with embedded hast data\n *\n * @callback Handler\n * @param {H} h Handle context\n * @param {any} node mdast node to handle\n * @param {Parent|null} parent Parent of `node`\n * @returns {Content|Array<Content>|null|undefined} hast node\n *\n * @callback HFunctionProps\n * @param {MdastNode|PositionLike|null|undefined} node mdast node or unist position\n * @param {string} tagName HTML tag name\n * @param {Properties} props Properties\n * @param {Array<Content>?} [children] hast content\n * @returns {Element}\n *\n * @callback HFunctionNoProps\n * @param {MdastNode|PositionLike|null|undefined} node mdast node or unist position\n * @param {string} tagName HTML tag name\n * @param {Array<Content>?} [children] hast content\n * @returns {Element}\n *\n * @typedef HFields\n * @property {boolean} dangerous Whether HTML is allowed\n * @property {string} clobberPrefix Prefix to use to prevent DOM clobbering\n * @property {string} footnoteLabel Label to use to introduce the footnote section\n * @property {string} footnoteBackLabel Label to use to go back to a footnote call from the footnote section\n * @property {(identifier: string) => Definition|null} definition Definition cache\n * @property {Record<string, FootnoteDefinition>} footnoteById Footnote cache\n * @property {Array<string>} footnoteOrder Order in which footnotes occur\n * @property {Record<string, number>} footnoteCounts Counts the same footnote was used\n * @property {Handlers} handlers Applied handlers\n * @property {Handler} unknownHandler Handler for any none not in `passThrough` or otherwise handled\n * @property {(left: NodeWithData|PositionLike|null|undefined, right: Content) => Content} augment Like `h` but lower-level and usable on non-elements.\n * @property {Array<string>} passThrough List of node types to pass through untouched (except for their children).\n *\n * @typedef Options\n * @property {boolean} [allowDangerousHtml=false]\n * Whether to allow `html` nodes and inject them as `raw` HTML\n * @property {string} [clobberPrefix='user-content-']\n * Prefix to use before the `id` attribute to prevent it from *clobbering*.\n * attributes.\n * DOM clobbering is this:\n *\n * ```html\n * <p id=x></p>\n * <script>alert(x)</script>\n * ```\n *\n * Elements by their ID are made available in browsers on the `window` object.\n * Using a prefix prevents this from being a problem.\n * @property {string} [footnoteLabel='Footnotes']\n * Label to use for the footnotes section.\n * Affects screen reader users.\n * Change it if you’re authoring in a different language.\n * @property {string} [footnoteBackLabel='Back to content']\n * Label to use from backreferences back to their footnote call.\n * Affects screen reader users.\n * Change it if you’re authoring in a different language.\n * @property {Handlers} [handlers]\n * Object mapping mdast nodes to functions handling them\n * @property {Array<string>} [passThrough]\n * List of custom mdast node types to pass through (keep) in hast\n * @property {Handler} [unknownHandler]\n * Handler for all unknown nodes.\n *\n * @typedef {Record<string, Handler>} Handlers\n * Map of node types to handlers\n * @typedef {HFunctionProps & HFunctionNoProps & HFields} H\n * Handle context\n */\n\nimport {u} from 'unist-builder'\nimport {visit} from 'unist-util-visit'\nimport {pointStart, pointEnd} from 'unist-util-position'\nimport {generated} from 'unist-util-generated'\nimport {definitions} from 'mdast-util-definitions'\nimport {one} from './traverse.js'\nimport {footer} from './footer.js'\nimport {handlers} from './handlers/index.js'\n\nconst own = {}.hasOwnProperty\n\n/**\n * Factory to transform.\n * @param {MdastNode} tree mdast node\n * @param {Options} [options] Configuration\n * @returns {H} `h` function\n */\nfunction factory(tree, options) {\n const settings = options || {}\n const dangerous = settings.allowDangerousHtml || false\n /** @type {Record<string, FootnoteDefinition>} */\n const footnoteById = {}\n\n h.dangerous = dangerous\n h.clobberPrefix =\n settings.clobberPrefix === undefined || settings.clobberPrefix === null\n ? 'user-content-'\n : settings.clobberPrefix\n h.footnoteLabel = settings.footnoteLabel || 'Footnotes'\n h.footnoteBackLabel = settings.footnoteBackLabel || 'Back to content'\n h.definition = definitions(tree)\n h.footnoteById = footnoteById\n /** @type {Array<string>} */\n h.footnoteOrder = []\n /** @type {Record<string, number>} */\n h.footnoteCounts = {}\n h.augment = augment\n h.handlers = {...handlers, ...settings.handlers}\n h.unknownHandler = settings.unknownHandler\n h.passThrough = settings.passThrough\n\n visit(tree, 'footnoteDefinition', (definition) => {\n const id = String(definition.identifier).toUpperCase()\n\n // Mimick CM behavior of link definitions.\n // See: <https://github.com/syntax-tree/mdast-util-definitions/blob/8290999/index.js#L26>.\n if (!own.call(footnoteById, id)) {\n footnoteById[id] = definition\n }\n })\n\n // @ts-expect-error Hush, it’s fine!\n return h\n\n /**\n * Finalise the created `right`, a hast node, from `left`, an mdast node.\n * @param {(NodeWithData|PositionLike)?} left\n * @param {Content} right\n * @returns {Content}\n */\n function augment(left, right) {\n // Handle `data.hName`, `data.hProperties, `data.hChildren`.\n if (left && 'data' in left && left.data) {\n /** @type {Data} */\n const data = left.data\n\n if (data.hName) {\n if (right.type !== 'element') {\n right = {\n type: 'element',\n tagName: '',\n properties: {},\n children: []\n }\n }\n\n right.tagName = data.hName\n }\n\n if (right.type === 'element' && data.hProperties) {\n right.properties = {...right.properties, ...data.hProperties}\n }\n\n if ('children' in right && right.children && data.hChildren) {\n right.children = data.hChildren\n }\n }\n\n if (left) {\n const ctx = 'type' in left ? left : {position: left}\n\n if (!generated(ctx)) {\n right.position = {start: pointStart(ctx), end: pointEnd(ctx)}\n }\n }\n\n return right\n }\n\n /**\n * Create an element for `node`.\n *\n * @type {HFunctionProps}\n */\n function h(node, tagName, props, children) {\n if (Array.isArray(props)) {\n children = props\n props = {}\n }\n\n // @ts-expect-error augmenting an element yields an element.\n return augment(node, {\n type: 'element',\n tagName,\n properties: props || {},\n children: children || []\n })\n }\n}\n\n/**\n * Transform `tree` (an mdast node) to a hast node.\n *\n * @param {MdastNode} tree mdast node\n * @param {Options} [options] Configuration\n * @returns {HastNode|null|undefined} hast node\n */\nexport function toHast(tree, options) {\n const h = factory(tree, options)\n const node = one(h, tree, null)\n const foot = footer(h)\n\n if (foot) {\n // @ts-expect-error If there’s a footer, there were definitions, meaning block\n // content.\n // So assume `node` is a parent node.\n node.children.push(u('text', '\\n'), foot)\n }\n\n return Array.isArray(node) ? {type: 'root', children: node} : node\n}\n\nexport {handlers as defaultHandlers} from './handlers/index.js'\n","/**\n * @typedef {Object} PointLike\n * @property {number} [line]\n * @property {number} [column]\n * @property {number} [offset]\n *\n * @typedef {Object} PositionLike\n * @property {PointLike} [start]\n * @property {PointLike} [end]\n *\n * @typedef {Object} NodeLike\n * @property {PositionLike} [position]\n */\n\n/**\n * Check if `node` is *generated*.\n *\n * @param {NodeLike} [node]\n * @returns {boolean}\n */\nexport function generated(node) {\n return (\n !node ||\n !node.position ||\n !node.position.start ||\n !node.position.start.line ||\n !node.position.start.column ||\n !node.position.end ||\n !node.position.end.line ||\n !node.position.end.column\n )\n}\n","/**\n * @typedef {import('mdast').BlockContent} BlockContent\n * @typedef {import('mdast').FootnoteDefinition} FootnoteDefinition\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('./index.js').H} H\n */\n\nimport {sanitizeUri} from 'micromark-util-sanitize-uri'\nimport {u} from 'unist-builder'\nimport {all} from './traverse.js'\nimport {wrap} from './wrap.js'\n\n/**\n * @param {H} h\n */\nexport function footer(h) {\n let index = -1\n /** @type {Array<ElementContent>} */\n const listItems = []\n\n while (++index < h.footnoteOrder.length) {\n const def = h.footnoteById[h.footnoteOrder[index].toUpperCase()]\n\n if (!def) {\n continue\n }\n\n const content = all(h, def)\n const id = String(def.identifier)\n const safeId = sanitizeUri(id.toLowerCase())\n let referenceIndex = 0\n /** @type {Array<ElementContent>} */\n const backReferences = []\n\n while (++referenceIndex <= h.footnoteCounts[id]) {\n /** @type {Element} */\n const backReference = {\n type: 'element',\n tagName: 'a',\n properties: {\n href:\n '#' +\n h.clobberPrefix +\n 'fnref-' +\n safeId +\n (referenceIndex > 1 ? '-' + referenceIndex : ''),\n dataFootnoteBackref: true,\n className: ['data-footnote-backref'],\n ariaLabel: h.footnoteBackLabel\n },\n children: [{type: 'text', value: '↩'}]\n }\n\n if (referenceIndex > 1) {\n backReference.children.push({\n type: 'element',\n tagName: 'sup',\n children: [{type: 'text', value: String(referenceIndex)}]\n })\n }\n\n if (backReferences.length > 0) {\n backReferences.push({type: 'text', value: ' '})\n }\n\n backReferences.push(backReference)\n }\n\n const tail = content[content.length - 1]\n\n if (tail && tail.type === 'element' && tail.tagName === 'p') {\n const tailTail = tail.children[tail.children.length - 1]\n if (tailTail && tailTail.type === 'text') {\n tailTail.value += ' '\n } else {\n tail.children.push({type: 'text', value: ' '})\n }\n\n tail.children.push(...backReferences)\n } else {\n content.push(...backReferences)\n }\n\n /** @type {Element} */\n const listItem = {\n type: 'element',\n tagName: 'li',\n properties: {id: h.clobberPrefix + 'fn-' + safeId},\n children: wrap(content, true)\n }\n\n if (def.position) {\n listItem.position = def.position\n }\n\n listItems.push(listItem)\n }\n\n if (listItems.length === 0) {\n return null\n }\n\n return {\n type: 'element',\n tagName: 'section',\n properties: {dataFootnotes: true, className: ['footnotes']},\n children: [\n {\n type: 'element',\n tagName: 'h2',\n properties: {id: 'footnote-label', className: ['sr-only']},\n children: [u('text', h.footnoteLabel)]\n },\n {type: 'text', value: '\\n'},\n {\n type: 'element',\n tagName: 'ol',\n properties: {},\n children: wrap(listItems, true)\n },\n {type: 'text', value: '\\n'}\n ]\n }\n}\n","/**\n * @typedef {import('hast').Root} HastRoot\n * @typedef {import('mdast').Root} MdastRoot\n * @typedef {import('mdast-util-to-hast').Options} Options\n * @typedef {import('unified').Processor<any, any, any, any>} Processor\n *\n * @typedef {import('mdast-util-to-hast')} DoNotTouchAsThisImportIncludesRawInTree\n */\n\nimport {toHast} from 'mdast-util-to-hast'\n\n// Note: the `<MdastRoot, HastRoot>` overload doesn’t seem to work :'(\n\n/**\n * Plugin that turns markdown into HTML to support rehype.\n *\n * * If a destination processor is given, that processor runs with a new HTML\n * (hast) tree (bridge-mode).\n * As the given processor runs with a hast tree, and rehype plugins support\n * hast, that means rehype plugins can be used with the given processor.\n * The hast tree is discarded in the end.\n * It’s highly unlikely that you want to do this.\n * * The common case is to not pass a destination processor, in which case the\n * current processor continues running with a new HTML (hast) tree\n * (mutate-mode).\n * As the current processor continues with a hast tree, and rehype plugins\n * support hast, that means rehype plugins can be used after\n * `remark-rehype`.\n * It’s likely that this is what you want to do.\n *\n * @param destination\n * Optional unified processor.\n * @param options\n * Options passed to `mdast-util-to-hast`.\n */\nconst remarkRehype =\n /** @type {(import('unified').Plugin<[Processor, Options?]|[null|undefined, Options?]|[Options]|[], MdastRoot>)} */\n (\n function (destination, options) {\n return destination && 'run' in destination\n ? bridge(destination, options)\n : mutate(destination || options)\n }\n )\n\nexport default remarkRehype\n\n/**\n * Bridge-mode.\n * Runs the destination with the new hast tree.\n *\n * @type {import('unified').Plugin<[Processor, Options?], MdastRoot>}\n */\nfunction bridge(destination, options) {\n return (node, file, next) => {\n destination.run(toHast(node, options), file, (error) => {\n next(error)\n })\n }\n}\n\n/**\n * Mutate-mode.\n * Further plugins run on the hast tree.\n *\n * @type {import('unified').Plugin<[Options?]|void[], MdastRoot, HastRoot>}\n */\nfunction mutate(options) {\n // @ts-expect-error: assume a corresponding node is returned by `toHast`.\n return (node) => toHast(node, options)\n}\n","/**\n * @typedef {import('./info.js').Info} Info\n * @typedef {Record<string, Info>} Properties\n * @typedef {Record<string, string>} Normal\n */\n\nexport class Schema {\n /**\n * @constructor\n * @param {Properties} property\n * @param {Normal} normal\n * @param {string} [space]\n */\n constructor(property, normal, space) {\n this.property = property\n this.normal = normal\n if (space) {\n this.space = space\n }\n }\n}\n\n/** @type {Properties} */\nSchema.prototype.property = {}\n/** @type {Normal} */\nSchema.prototype.normal = {}\n/** @type {string|null} */\nSchema.prototype.space = null\n","/**\n * @typedef {import('./schema.js').Properties} Properties\n * @typedef {import('./schema.js').Normal} Normal\n */\n\nimport {Schema} from './schema.js'\n\n/**\n * @param {Schema[]} definitions\n * @param {string} [space]\n * @returns {Schema}\n */\nexport function merge(definitions, space) {\n /** @type {Properties} */\n const property = {}\n /** @type {Normal} */\n const normal = {}\n let index = -1\n\n while (++index < definitions.length) {\n Object.assign(property, definitions[index].property)\n Object.assign(normal, definitions[index].normal)\n }\n\n return new Schema(property, normal, space)\n}\n","/**\n * @param {string} value\n * @returns {string}\n */\nexport function normalize(value) {\n return value.toLowerCase()\n}\n","export class Info {\n /**\n * @constructor\n * @param {string} property\n * @param {string} attribute\n */\n constructor(property, attribute) {\n /** @type {string} */\n this.property = property\n /** @type {string} */\n this.attribute = attribute\n }\n}\n\n/** @type {string|null} */\nInfo.prototype.space = null\nInfo.prototype.boolean = false\nInfo.prototype.booleanish = false\nInfo.prototype.overloadedBoolean = false\nInfo.prototype.number = false\nInfo.prototype.commaSeparated = false\nInfo.prototype.spaceSeparated = false\nInfo.prototype.commaOrSpaceSeparated = false\nInfo.prototype.mustUseProperty = false\nInfo.prototype.defined = false\n","let powers = 0\n\nexport const boolean = increment()\nexport const booleanish = increment()\nexport const overloadedBoolean = increment()\nexport const number = increment()\nexport const spaceSeparated = increment()\nexport const commaSeparated = increment()\nexport const commaOrSpaceSeparated = increment()\n\nfunction increment() {\n return 2 ** ++powers\n}\n","import {Info} from './info.js'\nimport * as types from './types.js'\n\n/** @type {Array<keyof types>} */\n// @ts-expect-error: hush.\nconst checks = Object.keys(types)\n\nexport class DefinedInfo extends Info {\n /**\n * @constructor\n * @param {string} property\n * @param {string} attribute\n * @param {number|null} [mask]\n * @param {string} [space]\n */\n constructor(property, attribute, mask, space) {\n let index = -1\n\n super(property, attribute)\n\n mark(this, 'space', space)\n\n if (typeof mask === 'number') {\n while (++index < checks.length) {\n const check = checks[index]\n mark(this, checks[index], (mask & types[check]) === types[check])\n }\n }\n }\n}\n\nDefinedInfo.prototype.defined = true\n\n/**\n * @param {DefinedInfo} values\n * @param {string} key\n * @param {unknown} value\n */\nfunction mark(values, key, value) {\n if (value) {\n // @ts-expect-error: assume `value` matches the expected value of `key`.\n values[key] = value\n }\n}\n","/**\n * @typedef {import('./schema.js').Properties} Properties\n * @typedef {import('./schema.js').Normal} Normal\n *\n * @typedef {Record<string, string>} Attributes\n *\n * @typedef {Object} Definition\n * @property {Record<string, number|null>} properties\n * @property {(attributes: Attributes, property: string) => string} transform\n * @property {string} [space]\n * @property {Attributes} [attributes]\n * @property {Array<string>} [mustUseProperty]\n */\n\nimport {normalize} from '../normalize.js'\nimport {Schema} from './schema.js'\nimport {DefinedInfo} from './defined-info.js'\n\nconst own = {}.hasOwnProperty\n\n/**\n * @param {Definition} definition\n * @returns {Schema}\n */\nexport function create(definition) {\n /** @type {Properties} */\n const property = {}\n /** @type {Normal} */\n const normal = {}\n /** @type {string} */\n let prop\n\n for (prop in definition.properties) {\n if (own.call(definition.properties, prop)) {\n const value = definition.properties[prop]\n const info = new DefinedInfo(\n prop,\n definition.transform(definition.attributes || {}, prop),\n value,\n definition.space\n )\n\n if (\n definition.mustUseProperty &&\n definition.mustUseProperty.includes(prop)\n ) {\n info.mustUseProperty = true\n }\n\n property[prop] = info\n\n normal[normalize(prop)] = prop\n normal[normalize(info.attribute)] = prop\n }\n }\n\n return new Schema(property, normal, definition.space)\n}\n","import {create} from './util/create.js'\n\nexport const xlink = create({\n space: 'xlink',\n transform(_, prop) {\n return 'xlink:' + prop.slice(5).toLowerCase()\n },\n properties: {\n xLinkActuate: null,\n xLinkArcRole: null,\n xLinkHref: null,\n xLinkRole: null,\n xLinkShow: null,\n xLinkTitle: null,\n xLinkType: null\n }\n})\n","import {create} from './util/create.js'\n\nexport const xml = create({\n space: 'xml',\n transform(_, prop) {\n return 'xml:' + prop.slice(3).toLowerCase()\n },\n properties: {xmlLang: null, xmlBase: null, xmlSpace: null}\n})\n","/**\n * @param {Record<string, string>} attributes\n * @param {string} attribute\n * @returns {string}\n */\nexport function caseSensitiveTransform(attributes, attribute) {\n return attribute in attributes ? attributes[attribute] : attribute\n}\n","import {caseSensitiveTransform} from './case-sensitive-transform.js'\n\n/**\n * @param {Record<string, string>} attributes\n * @param {string} property\n * @returns {string}\n */\nexport function caseInsensitiveTransform(attributes, property) {\n return caseSensitiveTransform(attributes, property.toLowerCase())\n}\n","import {create} from './util/create.js'\nimport {caseInsensitiveTransform} from './util/case-insensitive-transform.js'\n\nexport const xmlns = create({\n space: 'xmlns',\n attributes: {xmlnsxlink: 'xmlns:xlink'},\n transform: caseInsensitiveTransform,\n properties: {xmlns: null, xmlnsXLink: null}\n})\n","import {booleanish, number, spaceSeparated} from './util/types.js'\nimport {create} from './util/create.js'\n\nexport const aria = create({\n transform(_, prop) {\n return prop === 'role' ? prop : 'aria-' + prop.slice(4).toLowerCase()\n },\n properties: {\n ariaActiveDescendant: null,\n ariaAtomic: booleanish,\n ariaAutoComplete: null,\n ariaBusy: booleanish,\n ariaChecked: booleanish,\n ariaColCount: number,\n ariaColIndex: number,\n ariaColSpan: number,\n ariaControls: spaceSeparated,\n ariaCurrent: null,\n ariaDescribedBy: spaceSeparated,\n ariaDetails: null,\n ariaDisabled: booleanish,\n ariaDropEffect: spaceSeparated,\n ariaErrorMessage: null,\n ariaExpanded: booleanish,\n ariaFlowTo: spaceSeparated,\n ariaGrabbed: booleanish,\n ariaHasPopup: null,\n ariaHidden: booleanish,\n ariaInvalid: null,\n ariaKeyShortcuts: null,\n ariaLabel: null,\n ariaLabelledBy: spaceSeparated,\n ariaLevel: number,\n ariaLive: null,\n ariaModal: booleanish,\n ariaMultiLine: booleanish,\n ariaMultiSelectable: booleanish,\n ariaOrientation: null,\n ariaOwns: spaceSeparated,\n ariaPlaceholder: null,\n ariaPosInSet: number,\n ariaPressed: booleanish,\n ariaReadOnly: booleanish,\n ariaRelevant: null,\n ariaRequired: booleanish,\n ariaRoleDescription: spaceSeparated,\n ariaRowCount: number,\n ariaRowIndex: number,\n ariaRowSpan: number,\n ariaSelected: booleanish,\n ariaSetSize: number,\n ariaSort: null,\n ariaValueMax: number,\n ariaValueMin: number,\n ariaValueNow: number,\n ariaValueText: null,\n role: null\n }\n})\n","import {\n boolean,\n overloadedBoolean,\n booleanish,\n number,\n spaceSeparated,\n commaSeparated\n} from './util/types.js'\nimport {create} from './util/create.js'\nimport {caseInsensitiveTransform} from './util/case-insensitive-transform.js'\n\nexport const html = create({\n space: 'html',\n attributes: {\n acceptcharset: 'accept-charset',\n classname: 'class',\n htmlfor: 'for',\n httpequiv: 'http-equiv'\n },\n transform: caseInsensitiveTransform,\n mustUseProperty: ['checked', 'multiple', 'muted', 'selected'],\n properties: {\n // Standard Properties.\n abbr: null,\n accept: commaSeparated,\n acceptCharset: spaceSeparated,\n accessKey: spaceSeparated,\n action: null,\n allow: null,\n allowFullScreen: boolean,\n allowPaymentRequest: boolean,\n allowUserMedia: boolean,\n alt: null,\n as: null,\n async: boolean,\n autoCapitalize: null,\n autoComplete: spaceSeparated,\n autoFocus: boolean,\n autoPlay: boolean,\n capture: boolean,\n charSet: null,\n checked: boolean,\n cite: null,\n className: spaceSeparated,\n cols: number,\n colSpan: null,\n content: null,\n contentEditable: booleanish,\n controls: boolean,\n controlsList: spaceSeparated,\n coords: number | commaSeparated,\n crossOrigin: null,\n data: null,\n dateTime: null,\n decoding: null,\n default: boolean,\n defer: boolean,\n dir: null,\n dirName: null,\n disabled: boolean,\n download: overloadedBoolean,\n draggable: booleanish,\n encType: null,\n enterKeyHint: null,\n form: null,\n formAction: null,\n formEncType: null,\n formMethod: null,\n formNoValidate: boolean,\n formTarget: null,\n headers: spaceSeparated,\n height: number,\n hidden: boolean,\n high: number,\n href: null,\n hrefLang: null,\n htmlFor: spaceSeparated,\n httpEquiv: spaceSeparated,\n id: null,\n imageSizes: null,\n imageSrcSet: null,\n inputMode: null,\n integrity: null,\n is: null,\n isMap: boolean,\n itemId: null,\n itemProp: spaceSeparated,\n itemRef: spaceSeparated,\n itemScope: boolean,\n itemType: spaceSeparated,\n kind: null,\n label: null,\n lang: null,\n language: null,\n list: null,\n loading: null,\n loop: boolean,\n low: number,\n manifest: null,\n max: null,\n maxLength: number,\n media: null,\n method: null,\n min: null,\n minLength: number,\n multiple: boolean,\n muted: boolean,\n name: null,\n nonce: null,\n noModule: boolean,\n noValidate: boolean,\n onAbort: null,\n onAfterPrint: null,\n onAuxClick: null,\n onBeforePrint: null,\n onBeforeUnload: null,\n onBlur: null,\n onCancel: null,\n onCanPlay: null,\n onCanPlayThrough: null,\n onChange: null,\n onClick: null,\n onClose: null,\n onContextLost: null,\n onContextMenu: null,\n onContextRestored: null,\n onCopy: null,\n onCueChange: null,\n onCut: null,\n onDblClick: null,\n onDrag: null,\n onDragEnd: null,\n onDragEnter: null,\n onDragExit: null,\n onDragLeave: null,\n onDragOver: null,\n onDragStart: null,\n onDrop: null,\n onDurationChange: null,\n onEmptied: null,\n onEnded: null,\n onError: null,\n onFocus: null,\n onFormData: null,\n onHashChange: null,\n onInput: null,\n onInvalid: null,\n onKeyDown: null,\n onKeyPress: null,\n onKeyUp: null,\n onLanguageChange: null,\n onLoad: null,\n onLoadedData: null,\n onLoadedMetadata: null,\n onLoadEnd: null,\n onLoadStart: null,\n onMessage: null,\n onMessageError: null,\n onMouseDown: null,\n onMouseEnter: null,\n onMouseLeave: null,\n onMouseMove: null,\n onMouseOut: null,\n onMouseOver: null,\n onMouseUp: null,\n onOffline: null,\n onOnline: null,\n onPageHide: null,\n onPageShow: null,\n onPaste: null,\n onPause: null,\n onPlay: null,\n onPlaying: null,\n onPopState: null,\n onProgress: null,\n onRateChange: null,\n onRejectionHandled: null,\n onReset: null,\n onResize: null,\n onScroll: null,\n onSecurityPolicyViolation: null,\n onSeeked: null,\n onSeeking: null,\n onSelect: null,\n onSlotChange: null,\n onStalled: null,\n onStorage: null,\n onSubmit: null,\n onSuspend: null,\n onTimeUpdate: null,\n onToggle: null,\n onUnhandledRejection: null,\n onUnload: null,\n onVolumeChange: null,\n onWaiting: null,\n onWheel: null,\n open: boolean,\n optimum: number,\n pattern: null,\n ping: spaceSeparated,\n placeholder: null,\n playsInline: boolean,\n poster: null,\n preload: null,\n readOnly: boolean,\n referrerPolicy: null,\n rel: spaceSeparated,\n required: boolean,\n reversed: boolean,\n rows: number,\n rowSpan: number,\n sandbox: spaceSeparated,\n scope: null,\n scoped: boolean,\n seamless: boolean,\n selected: boolean,\n shape: null,\n size: number,\n sizes: null,\n slot: null,\n span: number,\n spellCheck: booleanish,\n src: null,\n srcDoc: null,\n srcLang: null,\n srcSet: null,\n start: number,\n step: null,\n style: null,\n tabIndex: number,\n target: null,\n title: null,\n translate: null,\n type: null,\n typeMustMatch: boolean,\n useMap: null,\n value: booleanish,\n width: number,\n wrap: null,\n\n // Legacy.\n // See: https://html.spec.whatwg.org/#other-elements,-attributes-and-apis\n align: null, // Several. Use CSS `text-align` instead,\n aLink: null, // `<body>`. Use CSS `a:active {color}` instead\n archive: spaceSeparated, // `<object>`. List of URIs to archives\n axis: null, // `<td>` and `<th>`. Use `scope` on `<th>`\n background: null, // `<body>`. Use CSS `background-image` instead\n bgColor: null, // `<body>` and table elements. Use CSS `background-color` instead\n border: number, // `<table>`. Use CSS `border-width` instead,\n borderColor: null, // `<table>`. Use CSS `border-color` instead,\n bottomMargin: number, // `<body>`\n cellPadding: null, // `<table>`\n cellSpacing: null, // `<table>`\n char: null, // Several table elements. When `align=char`, sets the character to align on\n charOff: null, // Several table elements. When `char`, offsets the alignment\n classId: null, // `<object>`\n clear: null, // `<br>`. Use CSS `clear` instead\n code: null, // `<object>`\n codeBase: null, // `<object>`\n codeType: null, // `<object>`\n color: null, // `<font>` and `<hr>`. Use CSS instead\n compact: boolean, // Lists. Use CSS to reduce space between items instead\n declare: boolean, // `<object>`\n event: null, // `<script>`\n face: null, // `<font>`. Use CSS instead\n frame: null, // `<table>`\n frameBorder: null, // `<iframe>`. Use CSS `border` instead\n hSpace: number, // `<img>` and `<object>`\n leftMargin: number, // `<body>`\n link: null, // `<body>`. Use CSS `a:link {color: *}` instead\n longDesc: null, // `<frame>`, `<iframe>`, and `<img>`. Use an `<a>`\n lowSrc: null, // `<img>`. Use a `<picture>`\n marginHeight: number, // `<body>`\n marginWidth: number, // `<body>`\n noResize: boolean, // `<frame>`\n noHref: boolean, // `<area>`. Use no href instead of an explicit `nohref`\n noShade: boolean, // `<hr>`. Use background-color and height instead of borders\n noWrap: boolean, // `<td>` and `<th>`\n object: null, // `<applet>`\n profile: null, // `<head>`\n prompt: null, // `<isindex>`\n rev: null, // `<link>`\n rightMargin: number, // `<body>`\n rules: null, // `<table>`\n scheme: null, // `<meta>`\n scrolling: booleanish, // `<frame>`. Use overflow in the child context\n standby: null, // `<object>`\n summary: null, // `<table>`\n text: null, // `<body>`. Use CSS `color` instead\n topMargin: number, // `<body>`\n valueType: null, // `<param>`\n version: null, // `<html>`. Use a doctype.\n vAlign: null, // Several. Use CSS `vertical-align` instead\n vLink: null, // `<body>`. Use CSS `a:visited {color}` instead\n vSpace: number, // `<img>` and `<object>`\n\n // Non-standard Properties.\n allowTransparency: null,\n autoCorrect: null,\n autoSave: null,\n disablePictureInPicture: boolean,\n disableRemotePlayback: boolean,\n prefix: null,\n property: null,\n results: number,\n security: null,\n unselectable: null\n }\n})\n","import {\n boolean,\n number,\n spaceSeparated,\n commaSeparated,\n commaOrSpaceSeparated\n} from './util/types.js'\nimport {create} from './util/create.js'\nimport {caseSensitiveTransform} from './util/case-sensitive-transform.js'\n\nexport const svg = create({\n space: 'svg',\n attributes: {\n accentHeight: 'accent-height',\n alignmentBaseline: 'alignment-baseline',\n arabicForm: 'arabic-form',\n baselineShift: 'baseline-shift',\n capHeight: 'cap-height',\n className: 'class',\n clipPath: 'clip-path',\n clipRule: 'clip-rule',\n colorInterpolation: 'color-interpolation',\n colorInterpolationFilters: 'color-interpolation-filters',\n colorProfile: 'color-profile',\n colorRendering: 'color-rendering',\n crossOrigin: 'crossorigin',\n dataType: 'datatype',\n dominantBaseline: 'dominant-baseline',\n enableBackground: 'enable-background',\n fillOpacity: 'fill-opacity',\n fillRule: 'fill-rule',\n floodColor: 'flood-color',\n floodOpacity: 'flood-opacity',\n fontFamily: 'font-family',\n fontSize: 'font-size',\n fontSizeAdjust: 'font-size-adjust',\n fontStretch: 'font-stretch',\n fontStyle: 'font-style',\n fontVariant: 'font-variant',\n fontWeight: 'font-weight',\n glyphName: 'glyph-name',\n glyphOrientationHorizontal: 'glyph-orientation-horizontal',\n glyphOrientationVertical: 'glyph-orientation-vertical',\n hrefLang: 'hreflang',\n horizAdvX: 'horiz-adv-x',\n horizOriginX: 'horiz-origin-x',\n horizOriginY: 'horiz-origin-y',\n imageRendering: 'image-rendering',\n letterSpacing: 'letter-spacing',\n lightingColor: 'lighting-color',\n markerEnd: 'marker-end',\n markerMid: 'marker-mid',\n markerStart: 'marker-start',\n navDown: 'nav-down',\n navDownLeft: 'nav-down-left',\n navDownRight: 'nav-down-right',\n navLeft: 'nav-left',\n navNext: 'nav-next',\n navPrev: 'nav-prev',\n navRight: 'nav-right',\n navUp: 'nav-up',\n navUpLeft: 'nav-up-left',\n navUpRight: 'nav-up-right',\n onAbort: 'onabort',\n onActivate: 'onactivate',\n onAfterPrint: 'onafterprint',\n onBeforePrint: 'onbeforeprint',\n onBegin: 'onbegin',\n onCancel: 'oncancel',\n onCanPlay: 'oncanplay',\n onCanPlayThrough: 'oncanplaythrough',\n onChange: 'onchange',\n onClick: 'onclick',\n onClose: 'onclose',\n onCopy: 'oncopy',\n onCueChange: 'oncuechange',\n onCut: 'oncut',\n onDblClick: 'ondblclick',\n onDrag: 'ondrag',\n onDragEnd: 'ondragend',\n onDragEnter: 'ondragenter',\n onDragExit: 'ondragexit',\n onDragLeave: 'ondragleave',\n onDragOver: 'ondragover',\n onDragStart: 'ondragstart',\n onDrop: 'ondrop',\n onDurationChange: 'ondurationchange',\n onEmptied: 'onemptied',\n onEnd: 'onend',\n onEnded: 'onended',\n onError: 'onerror',\n onFocus: 'onfocus',\n onFocusIn: 'onfocusin',\n onFocusOut: 'onfocusout',\n onHashChange: 'onhashchange',\n onInput: 'oninput',\n onInvalid: 'oninvalid',\n onKeyDown: 'onkeydown',\n onKeyPress: 'onkeypress',\n onKeyUp: 'onkeyup',\n onLoad: 'onload',\n onLoadedData: 'onloadeddata',\n onLoadedMetadata: 'onloadedmetadata',\n onLoadStart: 'onloadstart',\n onMessage: 'onmessage',\n onMouseDown: 'onmousedown',\n onMouseEnter: 'onmouseenter',\n onMouseLeave: 'onmouseleave',\n onMouseMove: 'onmousemove',\n onMouseOut: 'onmouseout',\n onMouseOver: 'onmouseover',\n onMouseUp: 'onmouseup',\n onMouseWheel: 'onmousewheel',\n onOffline: 'onoffline',\n onOnline: 'ononline',\n onPageHide: 'onpagehide',\n onPageShow: 'onpageshow',\n onPaste: 'onpaste',\n onPause: 'onpause',\n onPlay: 'onplay',\n onPlaying: 'onplaying',\n onPopState: 'onpopstate',\n onProgress: 'onprogress',\n onRateChange: 'onratechange',\n onRepeat: 'onrepeat',\n onReset: 'onreset',\n onResize: 'onresize',\n onScroll: 'onscroll',\n onSeeked: 'onseeked',\n onSeeking: 'onseeking',\n onSelect: 'onselect',\n onShow: 'onshow',\n onStalled: 'onstalled',\n onStorage: 'onstorage',\n onSubmit: 'onsubmit',\n onSuspend: 'onsuspend',\n onTimeUpdate: 'ontimeupdate',\n onToggle: 'ontoggle',\n onUnload: 'onunload',\n onVolumeChange: 'onvolumechange',\n onWaiting: 'onwaiting',\n onZoom: 'onzoom',\n overlinePosition: 'overline-position',\n overlineThickness: 'overline-thickness',\n paintOrder: 'paint-order',\n panose1: 'panose-1',\n pointerEvents: 'pointer-events',\n referrerPolicy: 'referrerpolicy',\n renderingIntent: 'rendering-intent',\n shapeRendering: 'shape-rendering',\n stopColor: 'stop-color',\n stopOpacity: 'stop-opacity',\n strikethroughPosition: 'strikethrough-position',\n strikethroughThickness: 'strikethrough-thickness',\n strokeDashArray: 'stroke-dasharray',\n strokeDashOffset: 'stroke-dashoffset',\n strokeLineCap: 'stroke-linecap',\n strokeLineJoin: 'stroke-linejoin',\n strokeMiterLimit: 'stroke-miterlimit',\n strokeOpacity: 'stroke-opacity',\n strokeWidth: 'stroke-width',\n tabIndex: 'tabindex',\n textAnchor: 'text-anchor',\n textDecoration: 'text-decoration',\n textRendering: 'text-rendering',\n typeOf: 'typeof',\n underlinePosition: 'underline-position',\n underlineThickness: 'underline-thickness',\n unicodeBidi: 'unicode-bidi',\n unicodeRange: 'unicode-range',\n unitsPerEm: 'units-per-em',\n vAlphabetic: 'v-alphabetic',\n vHanging: 'v-hanging',\n vIdeographic: 'v-ideographic',\n vMathematical: 'v-mathematical',\n vectorEffect: 'vector-effect',\n vertAdvY: 'vert-adv-y',\n vertOriginX: 'vert-origin-x',\n vertOriginY: 'vert-origin-y',\n wordSpacing: 'word-spacing',\n writingMode: 'writing-mode',\n xHeight: 'x-height',\n // These were camelcased in Tiny. Now lowercased in SVG 2\n playbackOrder: 'playbackorder',\n timelineBegin: 'timelinebegin'\n },\n transform: caseSensitiveTransform,\n properties: {\n about: commaOrSpaceSeparated,\n accentHeight: number,\n accumulate: null,\n additive: null,\n alignmentBaseline: null,\n alphabetic: number,\n amplitude: number,\n arabicForm: null,\n ascent: number,\n attributeName: null,\n attributeType: null,\n azimuth: number,\n bandwidth: null,\n baselineShift: null,\n baseFrequency: null,\n baseProfile: null,\n bbox: null,\n begin: null,\n bias: number,\n by: null,\n calcMode: null,\n capHeight: number,\n className: spaceSeparated,\n clip: null,\n clipPath: null,\n clipPathUnits: null,\n clipRule: null,\n color: null,\n colorInterpolation: null,\n colorInterpolationFilters: null,\n colorProfile: null,\n colorRendering: null,\n content: null,\n contentScriptType: null,\n contentStyleType: null,\n crossOrigin: null,\n cursor: null,\n cx: null,\n cy: null,\n d: null,\n dataType: null,\n defaultAction: null,\n descent: number,\n diffuseConstant: number,\n direction: null,\n display: null,\n dur: null,\n divisor: number,\n dominantBaseline: null,\n download: boolean,\n dx: null,\n dy: null,\n edgeMode: null,\n editable: null,\n elevation: number,\n enableBackground: null,\n end: null,\n event: null,\n exponent: number,\n externalResourcesRequired: null,\n fill: null,\n fillOpacity: number,\n fillRule: null,\n filter: null,\n filterRes: null,\n filterUnits: null,\n floodColor: null,\n floodOpacity: null,\n focusable: null,\n focusHighlight: null,\n fontFamily: null,\n fontSize: null,\n fontSizeAdjust: null,\n fontStretch: null,\n fontStyle: null,\n fontVariant: null,\n fontWeight: null,\n format: null,\n fr: null,\n from: null,\n fx: null,\n fy: null,\n g1: commaSeparated,\n g2: commaSeparated,\n glyphName: commaSeparated,\n glyphOrientationHorizontal: null,\n glyphOrientationVertical: null,\n glyphRef: null,\n gradientTransform: null,\n gradientUnits: null,\n handler: null,\n hanging: number,\n hatchContentUnits: null,\n hatchUnits: null,\n height: null,\n href: null,\n hrefLang: null,\n horizAdvX: number,\n horizOriginX: number,\n horizOriginY: number,\n id: null,\n ideographic: number,\n imageRendering: null,\n initialVisibility: null,\n in: null,\n in2: null,\n intercept: number,\n k: number,\n k1: number,\n k2: number,\n k3: number,\n k4: number,\n kernelMatrix: commaOrSpaceSeparated,\n kernelUnitLength: null,\n keyPoints: null, // SEMI_COLON_SEPARATED\n keySplines: null, // SEMI_COLON_SEPARATED\n keyTimes: null, // SEMI_COLON_SEPARATED\n kerning: null,\n lang: null,\n lengthAdjust: null,\n letterSpacing: null,\n lightingColor: null,\n limitingConeAngle: number,\n local: null,\n markerEnd: null,\n markerMid: null,\n markerStart: null,\n markerHeight: null,\n markerUnits: null,\n markerWidth: null,\n mask: null,\n maskContentUnits: null,\n maskUnits: null,\n mathematical: null,\n max: null,\n media: null,\n mediaCharacterEncoding: null,\n mediaContentEncodings: null,\n mediaSize: number,\n mediaTime: null,\n method: null,\n min: null,\n mode: null,\n name: null,\n navDown: null,\n navDownLeft: null,\n navDownRight: null,\n navLeft: null,\n navNext: null,\n navPrev: null,\n navRight: null,\n navUp: null,\n navUpLeft: null,\n navUpRight: null,\n numOctaves: null,\n observer: null,\n offset: null,\n onAbort: null,\n onActivate: null,\n onAfterPrint: null,\n onBeforePrint: null,\n onBegin: null,\n onCancel: null,\n onCanPlay: null,\n onCanPlayThrough: null,\n onChange: null,\n onClick: null,\n onClose: null,\n onCopy: null,\n onCueChange: null,\n onCut: null,\n onDblClick: null,\n onDrag: null,\n onDragEnd: null,\n onDragEnter: null,\n onDragExit: null,\n onDragLeave: null,\n onDragOver: null,\n onDragStart: null,\n onDrop: null,\n onDurationChange: null,\n onEmptied: null,\n onEnd: null,\n onEnded: null,\n onError: null,\n onFocus: null,\n onFocusIn: null,\n onFocusOut: null,\n onHashChange: null,\n onInput: null,\n onInvalid: null,\n onKeyDown: null,\n onKeyPress: null,\n onKeyUp: null,\n onLoad: null,\n onLoadedData: null,\n onLoadedMetadata: null,\n onLoadStart: null,\n onMessage: null,\n onMouseDown: null,\n onMouseEnter: null,\n onMouseLeave: null,\n onMouseMove: null,\n onMouseOut: null,\n onMouseOver: null,\n onMouseUp: null,\n onMouseWheel: null,\n onOffline: null,\n onOnline: null,\n onPageHide: null,\n onPageShow: null,\n onPaste: null,\n onPause: null,\n onPlay: null,\n onPlaying: null,\n onPopState: null,\n onProgress: null,\n onRateChange: null,\n onRepeat: null,\n onReset: null,\n onResize: null,\n onScroll: null,\n onSeeked: null,\n onSeeking: null,\n onSelect: null,\n onShow: null,\n onStalled: null,\n onStorage: null,\n onSubmit: null,\n onSuspend: null,\n onTimeUpdate: null,\n onToggle: null,\n onUnload: null,\n onVolumeChange: null,\n onWaiting: null,\n onZoom: null,\n opacity: null,\n operator: null,\n order: null,\n orient: null,\n orientation: null,\n origin: null,\n overflow: null,\n overlay: null,\n overlinePosition: number,\n overlineThickness: number,\n paintOrder: null,\n panose1: null,\n path: null,\n pathLength: number,\n patternContentUnits: null,\n patternTransform: null,\n patternUnits: null,\n phase: null,\n ping: spaceSeparated,\n pitch: null,\n playbackOrder: null,\n pointerEvents: null,\n points: null,\n pointsAtX: number,\n pointsAtY: number,\n pointsAtZ: number,\n preserveAlpha: null,\n preserveAspectRatio: null,\n primitiveUnits: null,\n propagate: null,\n property: commaOrSpaceSeparated,\n r: null,\n radius: null,\n referrerPolicy: null,\n refX: null,\n refY: null,\n rel: commaOrSpaceSeparated,\n rev: commaOrSpaceSeparated,\n renderingIntent: null,\n repeatCount: null,\n repeatDur: null,\n requiredExtensions: commaOrSpaceSeparated,\n requiredFeatures: commaOrSpaceSeparated,\n requiredFonts: commaOrSpaceSeparated,\n requiredFormats: commaOrSpaceSeparated,\n resource: null,\n restart: null,\n result: null,\n rotate: null,\n rx: null,\n ry: null,\n scale: null,\n seed: null,\n shapeRendering: null,\n side: null,\n slope: null,\n snapshotTime: null,\n specularConstant: number,\n specularExponent: number,\n spreadMethod: null,\n spacing: null,\n startOffset: null,\n stdDeviation: null,\n stemh: null,\n stemv: null,\n stitchTiles: null,\n stopColor: null,\n stopOpacity: null,\n strikethroughPosition: number,\n strikethroughThickness: number,\n string: null,\n stroke: null,\n strokeDashArray: commaOrSpaceSeparated,\n strokeDashOffset: null,\n strokeLineCap: null,\n strokeLineJoin: null,\n strokeMiterLimit: number,\n strokeOpacity: number,\n strokeWidth: null,\n style: null,\n surfaceScale: number,\n syncBehavior: null,\n syncBehaviorDefault: null,\n syncMaster: null,\n syncTolerance: null,\n syncToleranceDefault: null,\n systemLanguage: commaOrSpaceSeparated,\n tabIndex: number,\n tableValues: null,\n target: null,\n targetX: number,\n targetY: number,\n textAnchor: null,\n textDecoration: null,\n textRendering: null,\n textLength: null,\n timelineBegin: null,\n title: null,\n transformBehavior: null,\n type: null,\n typeOf: commaOrSpaceSeparated,\n to: null,\n transform: null,\n u1: null,\n u2: null,\n underlinePosition: number,\n underlineThickness: number,\n unicode: null,\n unicodeBidi: null,\n unicodeRange: null,\n unitsPerEm: number,\n values: null,\n vAlphabetic: number,\n vMathematical: number,\n vectorEffect: null,\n vHanging: number,\n vIdeographic: number,\n version: null,\n vertAdvY: number,\n vertOriginX: number,\n vertOriginY: number,\n viewBox: null,\n viewTarget: null,\n visibility: null,\n width: null,\n widths: null,\n wordSpacing: null,\n writingMode: null,\n x: null,\n x1: null,\n x2: null,\n xChannelSelector: null,\n xHeight: number,\n y: null,\n y1: null,\n y2: null,\n yChannelSelector: null,\n z: null,\n zoomAndPan: null\n }\n})\n","/**\n * @typedef {import('./util/schema.js').Schema} Schema\n */\n\nimport {normalize} from './normalize.js'\nimport {DefinedInfo} from './util/defined-info.js'\nimport {Info} from './util/info.js'\n\nconst valid = /^data[-\\w.:]+$/i\nconst dash = /-[a-z]/g\nconst cap = /[A-Z]/g\n\n/**\n * @param {Schema} schema\n * @param {string} value\n * @returns {Info}\n */\nexport function find(schema, value) {\n const normal = normalize(value)\n let prop = value\n let Type = Info\n\n if (normal in schema.normal) {\n return schema.property[schema.normal[normal]]\n }\n\n if (normal.length > 4 && normal.slice(0, 4) === 'data' && valid.test(value)) {\n // Attribute or property.\n if (value.charAt(4) === '-') {\n // Turn it into a property.\n const rest = value.slice(5).replace(dash, camelcase)\n prop = 'data' + rest.charAt(0).toUpperCase() + rest.slice(1)\n } else {\n // Turn it into an attribute.\n const rest = value.slice(4)\n\n if (!dash.test(rest)) {\n let dashes = rest.replace(cap, kebab)\n\n if (dashes.charAt(0) !== '-') {\n dashes = '-' + dashes\n }\n\n value = 'data' + dashes\n }\n }\n\n Type = DefinedInfo\n }\n\n return new Type(prop, value)\n}\n\n/**\n * @param {string} $0\n * @returns {string}\n */\nfunction kebab($0) {\n return '-' + $0.toLowerCase()\n}\n\n/**\n * @param {string} $0\n * @returns {string}\n */\nfunction camelcase($0) {\n return $0.charAt(1).toUpperCase()\n}\n","export const hastToReact = {\n classId: 'classID',\n dataType: 'datatype',\n itemId: 'itemID',\n strokeDashArray: 'strokeDasharray',\n strokeDashOffset: 'strokeDashoffset',\n strokeLineCap: 'strokeLinecap',\n strokeLineJoin: 'strokeLinejoin',\n strokeMiterLimit: 'strokeMiterlimit',\n typeOf: 'typeof',\n xLinkActuate: 'xlinkActuate',\n xLinkArcRole: 'xlinkArcrole',\n xLinkHref: 'xlinkHref',\n xLinkRole: 'xlinkRole',\n xLinkShow: 'xlinkShow',\n xLinkTitle: 'xlinkTitle',\n xLinkType: 'xlinkType',\n xmlnsXLink: 'xmlnsXlink'\n}\n","/**\n * @typedef {import('./lib/util/info.js').Info} Info\n * @typedef {import('./lib/util/schema.js').Schema} Schema\n */\n\nimport {merge} from './lib/util/merge.js'\nimport {xlink} from './lib/xlink.js'\nimport {xml} from './lib/xml.js'\nimport {xmlns} from './lib/xmlns.js'\nimport {aria} from './lib/aria.js'\nimport {html as htmlBase} from './lib/html.js'\nimport {svg as svgBase} from './lib/svg.js'\n\nexport {find} from './lib/find.js'\nexport {hastToReact} from './lib/hast-to-react.js'\nexport {normalize} from './lib/normalize.js'\nexport const html = merge([xml, xlink, xmlns, aria, htmlBase], 'html')\nexport const svg = merge([xml, xlink, xmlns, aria, svgBase], 'svg')\n","import {visit} from 'unist-util-visit'\n\n/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('hast').Root} Root\n * @typedef {import('hast').Element} Element\n *\n * @callback AllowElement\n * @param {Element} element\n * @param {number} index\n * @param {Element|Root} parent\n * @returns {boolean|undefined}\n *\n * @typedef Options\n * @property {Array<string>} [allowedElements]\n * @property {Array<string>} [disallowedElements=[]]\n * @property {AllowElement} [allowElement]\n * @property {boolean} [unwrapDisallowed=false]\n */\n\n/**\n * @type {import('unified').Plugin<[Options], Root>}\n */\nexport default function rehypeFilter(options) {\n if (options.allowedElements && options.disallowedElements) {\n throw new TypeError(\n 'Only one of `allowedElements` and `disallowedElements` should be defined'\n )\n }\n\n if (\n options.allowedElements ||\n options.disallowedElements ||\n options.allowElement\n ) {\n return (tree) => {\n visit(tree, 'element', (node, index, parent_) => {\n const parent = /** @type {Element|Root} */ (parent_)\n /** @type {boolean|undefined} */\n let remove\n\n if (options.allowedElements) {\n remove = !options.allowedElements.includes(node.tagName)\n } else if (options.disallowedElements) {\n remove = options.disallowedElements.includes(node.tagName)\n }\n\n if (!remove && options.allowElement && typeof index === 'number') {\n remove = !options.allowElement(node, index, parent)\n }\n\n if (remove && typeof index === 'number') {\n if (options.unwrapDisallowed && node.children) {\n parent.children.splice(index, 1, ...node.children)\n } else {\n parent.children.splice(index, 1)\n }\n\n return index\n }\n\n return undefined\n })\n }\n }\n}\n","/**\n * @license React\n * react-is.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';var b=Symbol.for(\"react.element\"),c=Symbol.for(\"react.portal\"),d=Symbol.for(\"react.fragment\"),e=Symbol.for(\"react.strict_mode\"),f=Symbol.for(\"react.profiler\"),g=Symbol.for(\"react.provider\"),h=Symbol.for(\"react.context\"),k=Symbol.for(\"react.server_context\"),l=Symbol.for(\"react.forward_ref\"),m=Symbol.for(\"react.suspense\"),n=Symbol.for(\"react.suspense_list\"),p=Symbol.for(\"react.memo\"),q=Symbol.for(\"react.lazy\"),t=Symbol.for(\"react.offscreen\"),u=Symbol.for(\"react.module.reference\");\nfunction v(a){if(\"object\"===typeof a&&null!==a){var r=a.$$typeof;switch(r){case b:switch(a=a.type,a){case d:case f:case e:case m:case n:return a;default:switch(a=a&&a.$$typeof,a){case k:case h:case l:case q:case p:case g:return a;default:return r}}case c:return r}}}exports.ContextConsumer=h;exports.ContextProvider=g;exports.Element=b;exports.ForwardRef=l;exports.Fragment=d;exports.Lazy=q;exports.Memo=p;exports.Portal=c;exports.Profiler=f;exports.StrictMode=e;exports.Suspense=m;\nexports.SuspenseList=n;exports.isAsyncMode=function(){return!1};exports.isConcurrentMode=function(){return!1};exports.isContextConsumer=function(a){return v(a)===h};exports.isContextProvider=function(a){return v(a)===g};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===b};exports.isForwardRef=function(a){return v(a)===l};exports.isFragment=function(a){return v(a)===d};exports.isLazy=function(a){return v(a)===q};exports.isMemo=function(a){return v(a)===p};\nexports.isPortal=function(a){return v(a)===c};exports.isProfiler=function(a){return v(a)===f};exports.isStrictMode=function(a){return v(a)===e};exports.isSuspense=function(a){return v(a)===m};exports.isSuspenseList=function(a){return v(a)===n};\nexports.isValidElementType=function(a){return\"string\"===typeof a||\"function\"===typeof a||a===d||a===f||a===e||a===m||a===n||a===t||\"object\"===typeof a&&null!==a&&(a.$$typeof===q||a.$$typeof===p||a.$$typeof===g||a.$$typeof===h||a.$$typeof===l||a.$$typeof===u||void 0!==a.getModuleId)?!0:!1};exports.typeOf=v;\n","/**\n * @license React\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n (function() {\n'use strict';\n\n// ATTENTION\n// When adding new symbols to this file,\n// Please consider also adding to 'react-devtools-shared/src/backend/ReactSymbols'\n// The Symbol used to tag the ReactElement-like types.\nvar REACT_ELEMENT_TYPE = Symbol.for('react.element');\nvar REACT_PORTAL_TYPE = Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE = Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE = Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE = Symbol.for('react.context');\nvar REACT_SERVER_CONTEXT_TYPE = Symbol.for('react.server_context');\nvar REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE = Symbol.for('react.memo');\nvar REACT_LAZY_TYPE = Symbol.for('react.lazy');\nvar REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\n\n// -----------------------------------------------------------------------------\n\nvar enableScopeAPI = false; // Experimental Create Event Handle API.\nvar enableCacheElement = false;\nvar enableTransitionTracing = false; // No known bugs, but needs performance testing\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n// stuff. Intended to enable React core members to more easily debug scheduling\n// issues in DEV builds.\n\nvar enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n\nvar REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\nfunction isValidElementType(type) {\n if (typeof type === 'string' || typeof type === 'function') {\n return true;\n } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n\n if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden || type === REACT_OFFSCREEN_TYPE || enableScopeAPI || enableCacheElement || enableTransitionTracing ) {\n return true;\n }\n\n if (typeof type === 'object' && type !== null) {\n if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n // types supported by any Flight configuration anywhere since\n // we don't know which Flight build this will end up being used\n // with.\n type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== undefined) {\n return true;\n }\n }\n\n return false;\n}\n\nfunction typeOf(object) {\n if (typeof object === 'object' && object !== null) {\n var $$typeof = object.$$typeof;\n\n switch ($$typeof) {\n case REACT_ELEMENT_TYPE:\n var type = object.type;\n\n switch (type) {\n case REACT_FRAGMENT_TYPE:\n case REACT_PROFILER_TYPE:\n case REACT_STRICT_MODE_TYPE:\n case REACT_SUSPENSE_TYPE:\n case REACT_SUSPENSE_LIST_TYPE:\n return type;\n\n default:\n var $$typeofType = type && type.$$typeof;\n\n switch ($$typeofType) {\n case REACT_SERVER_CONTEXT_TYPE:\n case REACT_CONTEXT_TYPE:\n case REACT_FORWARD_REF_TYPE:\n case REACT_LAZY_TYPE:\n case REACT_MEMO_TYPE:\n case REACT_PROVIDER_TYPE:\n return $$typeofType;\n\n default:\n return $$typeof;\n }\n\n }\n\n case REACT_PORTAL_TYPE:\n return $$typeof;\n }\n }\n\n return undefined;\n}\nvar ContextConsumer = REACT_CONTEXT_TYPE;\nvar ContextProvider = REACT_PROVIDER_TYPE;\nvar Element = REACT_ELEMENT_TYPE;\nvar ForwardRef = REACT_FORWARD_REF_TYPE;\nvar Fragment = REACT_FRAGMENT_TYPE;\nvar Lazy = REACT_LAZY_TYPE;\nvar Memo = REACT_MEMO_TYPE;\nvar Portal = REACT_PORTAL_TYPE;\nvar Profiler = REACT_PROFILER_TYPE;\nvar StrictMode = REACT_STRICT_MODE_TYPE;\nvar Suspense = REACT_SUSPENSE_TYPE;\nvar SuspenseList = REACT_SUSPENSE_LIST_TYPE;\nvar hasWarnedAboutDeprecatedIsAsyncMode = false;\nvar hasWarnedAboutDeprecatedIsConcurrentMode = false; // AsyncMode should be deprecated\n\nfunction isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n }\n }\n\n return false;\n}\nfunction isConcurrentMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsConcurrentMode) {\n hasWarnedAboutDeprecatedIsConcurrentMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn']('The ReactIs.isConcurrentMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n }\n }\n\n return false;\n}\nfunction isContextConsumer(object) {\n return typeOf(object) === REACT_CONTEXT_TYPE;\n}\nfunction isContextProvider(object) {\n return typeOf(object) === REACT_PROVIDER_TYPE;\n}\nfunction isElement(object) {\n return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\nfunction isForwardRef(object) {\n return typeOf(object) === REACT_FORWARD_REF_TYPE;\n}\nfunction isFragment(object) {\n return typeOf(object) === REACT_FRAGMENT_TYPE;\n}\nfunction isLazy(object) {\n return typeOf(object) === REACT_LAZY_TYPE;\n}\nfunction isMemo(object) {\n return typeOf(object) === REACT_MEMO_TYPE;\n}\nfunction isPortal(object) {\n return typeOf(object) === REACT_PORTAL_TYPE;\n}\nfunction isProfiler(object) {\n return typeOf(object) === REACT_PROFILER_TYPE;\n}\nfunction isStrictMode(object) {\n return typeOf(object) === REACT_STRICT_MODE_TYPE;\n}\nfunction isSuspense(object) {\n return typeOf(object) === REACT_SUSPENSE_TYPE;\n}\nfunction isSuspenseList(object) {\n return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n}\n\nexports.ContextConsumer = ContextConsumer;\nexports.ContextProvider = ContextProvider;\nexports.Element = Element;\nexports.ForwardRef = ForwardRef;\nexports.Fragment = Fragment;\nexports.Lazy = Lazy;\nexports.Memo = Memo;\nexports.Portal = Portal;\nexports.Profiler = Profiler;\nexports.StrictMode = StrictMode;\nexports.Suspense = Suspense;\nexports.SuspenseList = SuspenseList;\nexports.isAsyncMode = isAsyncMode;\nexports.isConcurrentMode = isConcurrentMode;\nexports.isContextConsumer = isContextConsumer;\nexports.isContextProvider = isContextProvider;\nexports.isElement = isElement;\nexports.isForwardRef = isForwardRef;\nexports.isFragment = isFragment;\nexports.isLazy = isLazy;\nexports.isMemo = isMemo;\nexports.isPortal = isPortal;\nexports.isProfiler = isProfiler;\nexports.isStrictMode = isStrictMode;\nexports.isSuspense = isSuspense;\nexports.isSuspenseList = isSuspenseList;\nexports.isValidElementType = isValidElementType;\nexports.typeOf = typeOf;\n })();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/react-is.production.min.js');\n} else {\n module.exports = require('./cjs/react-is.development.js');\n}\n","// http://www.w3.org/TR/CSS21/grammar.html\n// https://github.com/visionmedia/css-parse/pull/49#issuecomment-30088027\nvar COMMENT_REGEX = /\\/\\*[^*]*\\*+([^/*][^*]*\\*+)*\\//g;\n\nvar NEWLINE_REGEX = /\\n/g;\nvar WHITESPACE_REGEX = /^\\s*/;\n\n// declaration\nvar PROPERTY_REGEX = /^(\\*?[-#/*\\\\\\w]+(\\[[0-9a-z_-]+\\])?)\\s*/;\nvar COLON_REGEX = /^:\\s*/;\nvar VALUE_REGEX = /^((?:'(?:\\\\'|.)*?'|\"(?:\\\\\"|.)*?\"|\\([^)]*?\\)|[^};])+)/;\nvar SEMICOLON_REGEX = /^[;\\s]*/;\n\n// https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String/Trim#Polyfill\nvar TRIM_REGEX = /^\\s+|\\s+$/g;\n\n// strings\nvar NEWLINE = '\\n';\nvar FORWARD_SLASH = '/';\nvar ASTERISK = '*';\nvar EMPTY_STRING = '';\n\n// types\nvar TYPE_COMMENT = 'comment';\nvar TYPE_DECLARATION = 'declaration';\n\n/**\n * @param {String} style\n * @param {Object} [options]\n * @return {Object[]}\n * @throws {TypeError}\n * @throws {Error}\n */\nmodule.exports = function(style, options) {\n if (typeof style !== 'string') {\n throw new TypeError('First argument must be a string');\n }\n\n if (!style) return [];\n\n options = options || {};\n\n /**\n * Positional.\n */\n var lineno = 1;\n var column = 1;\n\n /**\n * Update lineno and column based on `str`.\n *\n * @param {String} str\n */\n function updatePosition(str) {\n var lines = str.match(NEWLINE_REGEX);\n if (lines) lineno += lines.length;\n var i = str.lastIndexOf(NEWLINE);\n column = ~i ? str.length - i : column + str.length;\n }\n\n /**\n * Mark position and patch `node.position`.\n *\n * @return {Function}\n */\n function position() {\n var start = { line: lineno, column: column };\n return function(node) {\n node.position = new Position(start);\n whitespace();\n return node;\n };\n }\n\n /**\n * Store position information for a node.\n *\n * @constructor\n * @property {Object} start\n * @property {Object} end\n * @property {undefined|String} source\n */\n function Position(start) {\n this.start = start;\n this.end = { line: lineno, column: column };\n this.source = options.source;\n }\n\n /**\n * Non-enumerable source string.\n */\n Position.prototype.content = style;\n\n var errorsList = [];\n\n /**\n * Error `msg`.\n *\n * @param {String} msg\n * @throws {Error}\n */\n function error(msg) {\n var err = new Error(\n options.source + ':' + lineno + ':' + column + ': ' + msg\n );\n err.reason = msg;\n err.filename = options.source;\n err.line = lineno;\n err.column = column;\n err.source = style;\n\n if (options.silent) {\n errorsList.push(err);\n } else {\n throw err;\n }\n }\n\n /**\n * Match `re` and return captures.\n *\n * @param {RegExp} re\n * @return {undefined|Array}\n */\n function match(re) {\n var m = re.exec(style);\n if (!m) return;\n var str = m[0];\n updatePosition(str);\n style = style.slice(str.length);\n return m;\n }\n\n /**\n * Parse whitespace.\n */\n function whitespace() {\n match(WHITESPACE_REGEX);\n }\n\n /**\n * Parse comments.\n *\n * @param {Object[]} [rules]\n * @return {Object[]}\n */\n function comments(rules) {\n var c;\n rules = rules || [];\n while ((c = comment())) {\n if (c !== false) {\n rules.push(c);\n }\n }\n return rules;\n }\n\n /**\n * Parse comment.\n *\n * @return {Object}\n * @throws {Error}\n */\n function comment() {\n var pos = position();\n if (FORWARD_SLASH != style.charAt(0) || ASTERISK != style.charAt(1)) return;\n\n var i = 2;\n while (\n EMPTY_STRING != style.charAt(i) &&\n (ASTERISK != style.charAt(i) || FORWARD_SLASH != style.charAt(i + 1))\n ) {\n ++i;\n }\n i += 2;\n\n if (EMPTY_STRING === style.charAt(i - 1)) {\n return error('End of comment missing');\n }\n\n var str = style.slice(2, i - 2);\n column += 2;\n updatePosition(str);\n style = style.slice(i);\n column += 2;\n\n return pos({\n type: TYPE_COMMENT,\n comment: str\n });\n }\n\n /**\n * Parse declaration.\n *\n * @return {Object}\n * @throws {Error}\n */\n function declaration() {\n var pos = position();\n\n // prop\n var prop = match(PROPERTY_REGEX);\n if (!prop) return;\n comment();\n\n // :\n if (!match(COLON_REGEX)) return error(\"property missing ':'\");\n\n // val\n var val = match(VALUE_REGEX);\n\n var ret = pos({\n type: TYPE_DECLARATION,\n property: trim(prop[0].replace(COMMENT_REGEX, EMPTY_STRING)),\n value: val\n ? trim(val[0].replace(COMMENT_REGEX, EMPTY_STRING))\n : EMPTY_STRING\n });\n\n // ;\n match(SEMICOLON_REGEX);\n\n return ret;\n }\n\n /**\n * Parse declarations.\n *\n * @return {Object[]}\n */\n function declarations() {\n var decls = [];\n\n comments(decls);\n\n // declarations\n var decl;\n while ((decl = declaration())) {\n if (decl !== false) {\n decls.push(decl);\n comments(decls);\n }\n }\n\n return decls;\n }\n\n whitespace();\n return declarations();\n};\n\n/**\n * Trim `str`.\n *\n * @param {String} str\n * @return {String}\n */\nfunction trim(str) {\n return str ? str.replace(TRIM_REGEX, EMPTY_STRING) : EMPTY_STRING;\n}\n","var parse = require('inline-style-parser');\n\n/**\n * Parses inline style to object.\n *\n * @example\n * // returns { 'line-height': '42' }\n * StyleToObject('line-height: 42;');\n *\n * @param {String} style - The inline style.\n * @param {Function} [iterator] - The iterator function.\n * @return {null|Object}\n */\nfunction StyleToObject(style, iterator) {\n var output = null;\n if (!style || typeof style !== 'string') {\n return output;\n }\n\n var declaration;\n var declarations = parse(style);\n var hasIterator = typeof iterator === 'function';\n var property;\n var value;\n\n for (var i = 0, len = declarations.length; i < len; i++) {\n declaration = declarations[i];\n property = declaration.property;\n value = declaration.value;\n\n if (hasIterator) {\n iterator(property, value, declaration);\n } else if (value) {\n output || (output = {});\n output[property] = value;\n }\n }\n\n return output;\n}\n\nmodule.exports = StyleToObject;\n","/**\n * @template T\n * @typedef {import('react').ComponentType<T>} ComponentType<T>\n */\n\n/**\n * @template T\n * @typedef {import('react').ComponentPropsWithoutRef<T>} ComponentPropsWithoutRef<T>\n */\n\n/**\n * @typedef {import('react').ReactNode} ReactNode\n * @typedef {import('unist').Position} Position\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Root} Root\n * @typedef {import('hast').Text} Text\n * @typedef {import('hast').Comment} Comment\n * @typedef {import('hast').DocType} Doctype\n * @typedef {import('property-information').Info} Info\n * @typedef {import('property-information').Schema} Schema\n * @typedef {import('./complex-types').ReactMarkdownProps} ReactMarkdownProps\n *\n * @typedef Raw\n * @property {'raw'} type\n * @property {string} value\n *\n * @typedef Context\n * @property {Options} options\n * @property {Schema} schema\n * @property {number} listDepth\n *\n * @callback TransformLink\n * @param {string} href\n * @param {Array<ElementContent>} children\n * @param {string?} title\n * @returns {string}\n *\n * @callback TransformImage\n * @param {string} src\n * @param {string} alt\n * @param {string?} title\n * @returns {string}\n *\n * @typedef {import('react').HTMLAttributeAnchorTarget} TransformLinkTargetType\n *\n * @callback TransformLinkTarget\n * @param {string} href\n * @param {Array<ElementContent>} children\n * @param {string?} title\n * @returns {TransformLinkTargetType|undefined}\n *\n * @typedef {keyof JSX.IntrinsicElements} ReactMarkdownNames\n *\n * To do: is `data-sourcepos` typeable?\n *\n * @typedef {ComponentPropsWithoutRef<'code'> & ReactMarkdownProps & {inline?: boolean}} CodeProps\n * @typedef {ComponentPropsWithoutRef<'h1'> & ReactMarkdownProps & {level: number}} HeadingProps\n * @typedef {ComponentPropsWithoutRef<'li'> & ReactMarkdownProps & {checked: boolean|null, index: number, ordered: boolean}} LiProps\n * @typedef {ComponentPropsWithoutRef<'ol'> & ReactMarkdownProps & {depth: number, ordered: true}} OrderedListProps\n * @typedef {ComponentPropsWithoutRef<'table'> & ReactMarkdownProps & {style?: Record<string, unknown>, isHeader: boolean}} TableCellProps\n * @typedef {ComponentPropsWithoutRef<'tr'> & ReactMarkdownProps & {isHeader: boolean}} TableRowProps\n * @typedef {ComponentPropsWithoutRef<'ul'> & ReactMarkdownProps & {depth: number, ordered: false}} UnorderedListProps\n *\n * @typedef {ComponentType<CodeProps>} CodeComponent\n * @typedef {ComponentType<HeadingProps>} HeadingComponent\n * @typedef {ComponentType<LiProps>} LiComponent\n * @typedef {ComponentType<OrderedListProps>} OrderedListComponent\n * @typedef {ComponentType<TableCellProps>} TableCellComponent\n * @typedef {ComponentType<TableRowProps>} TableRowComponent\n * @typedef {ComponentType<UnorderedListProps>} UnorderedListComponent\n *\n * @typedef SpecialComponents\n * @property {CodeComponent|ReactMarkdownNames} code\n * @property {HeadingComponent|ReactMarkdownNames} h1\n * @property {HeadingComponent|ReactMarkdownNames} h2\n * @property {HeadingComponent|ReactMarkdownNames} h3\n * @property {HeadingComponent|ReactMarkdownNames} h4\n * @property {HeadingComponent|ReactMarkdownNames} h5\n * @property {HeadingComponent|ReactMarkdownNames} h6\n * @property {LiComponent|ReactMarkdownNames} li\n * @property {OrderedListComponent|ReactMarkdownNames} ol\n * @property {TableCellComponent|ReactMarkdownNames} td\n * @property {TableCellComponent|ReactMarkdownNames} th\n * @property {TableRowComponent|ReactMarkdownNames} tr\n * @property {UnorderedListComponent|ReactMarkdownNames} ul\n *\n * @typedef {Partial<Omit<import('./complex-types').NormalComponents, keyof SpecialComponents> & SpecialComponents>} Components\n *\n * @typedef Options\n * @property {boolean} [sourcePos=false]\n * @property {boolean} [rawSourcePos=false]\n * @property {boolean} [skipHtml=false]\n * @property {boolean} [includeElementIndex=false]\n * @property {null|false|TransformLink} [transformLinkUri]\n * @property {TransformImage} [transformImageUri]\n * @property {TransformLinkTargetType|TransformLinkTarget} [linkTarget]\n * @property {Components} [components]\n */\n\nimport React from 'react'\nimport ReactIs from 'react-is'\nimport {whitespace} from 'hast-util-whitespace'\nimport {svg, find, hastToReact} from 'property-information'\nimport {stringify as spaces} from 'space-separated-tokens'\nimport {stringify as commas} from 'comma-separated-tokens'\nimport style from 'style-to-object'\n\nconst own = {}.hasOwnProperty\n\n// The table-related elements that must not contain whitespace text according\n// to React.\nconst tableElements = new Set(['table', 'thead', 'tbody', 'tfoot', 'tr'])\n\n/**\n * @param {Context} context\n * @param {Element|Root} node\n */\nexport function childrenToReact(context, node) {\n /** @type {Array<ReactNode>} */\n const children = []\n let childIndex = -1\n /** @type {Comment|Doctype|Element|Raw|Text} */\n let child\n\n while (++childIndex < node.children.length) {\n child = node.children[childIndex]\n\n if (child.type === 'element') {\n children.push(toReact(context, child, childIndex, node))\n } else if (child.type === 'text') {\n // Currently, a warning is triggered by react for *any* white space in\n // tables.\n // So we drop it.\n // See: <https://github.com/facebook/react/pull/7081>.\n // See: <https://github.com/facebook/react/pull/7515>.\n // See: <https://github.com/remarkjs/remark-react/issues/64>.\n // See: <https://github.com/remarkjs/react-markdown/issues/576>.\n if (\n node.type !== 'element' ||\n !tableElements.has(node.tagName) ||\n !whitespace(child)\n ) {\n children.push(child.value)\n }\n } else if (child.type === 'raw' && !context.options.skipHtml) {\n // Default behavior is to show (encoded) HTML.\n children.push(child.value)\n }\n }\n\n return children\n}\n\n/**\n * @param {Context} context\n * @param {Element} node\n * @param {number} index\n * @param {Element|Root} parent\n */\nfunction toReact(context, node, index, parent) {\n const options = context.options\n const parentSchema = context.schema\n /** @type {ReactMarkdownNames} */\n // @ts-expect-error assume a known HTML/SVG element.\n const name = node.tagName\n /** @type {Record<string, unknown>} */\n const properties = {}\n let schema = parentSchema\n /** @type {string} */\n let property\n\n if (parentSchema.space === 'html' && name === 'svg') {\n schema = svg\n context.schema = schema\n }\n\n if (node.properties) {\n for (property in node.properties) {\n if (own.call(node.properties, property)) {\n addProperty(properties, property, node.properties[property], context)\n }\n }\n }\n\n if (name === 'ol' || name === 'ul') {\n context.listDepth++\n }\n\n const children = childrenToReact(context, node)\n\n if (name === 'ol' || name === 'ul') {\n context.listDepth--\n }\n\n // Restore parent schema.\n context.schema = parentSchema\n\n // Nodes created by plugins do not have positional info, in which case we use\n // an object that matches the position interface.\n const position = node.position || {\n start: {line: null, column: null, offset: null},\n end: {line: null, column: null, offset: null}\n }\n const component =\n options.components && own.call(options.components, name)\n ? options.components[name]\n : name\n const basic = typeof component === 'string' || component === React.Fragment\n\n if (!ReactIs.isValidElementType(component)) {\n throw new TypeError(\n `Component for name \\`${name}\\` not defined or is not renderable`\n )\n }\n\n properties.key = [\n name,\n position.start.line,\n position.start.column,\n index\n ].join('-')\n\n if (name === 'a' && options.linkTarget) {\n properties.target =\n typeof options.linkTarget === 'function'\n ? options.linkTarget(\n String(properties.href || ''),\n node.children,\n typeof properties.title === 'string' ? properties.title : null\n )\n : options.linkTarget\n }\n\n if (name === 'a' && options.transformLinkUri) {\n properties.href = options.transformLinkUri(\n String(properties.href || ''),\n node.children,\n typeof properties.title === 'string' ? properties.title : null\n )\n }\n\n if (\n !basic &&\n name === 'code' &&\n parent.type === 'element' &&\n parent.tagName !== 'pre'\n ) {\n properties.inline = true\n }\n\n if (\n !basic &&\n (name === 'h1' ||\n name === 'h2' ||\n name === 'h3' ||\n name === 'h4' ||\n name === 'h5' ||\n name === 'h6')\n ) {\n properties.level = Number.parseInt(name.charAt(1), 10)\n }\n\n if (name === 'img' && options.transformImageUri) {\n properties.src = options.transformImageUri(\n String(properties.src || ''),\n String(properties.alt || ''),\n typeof properties.title === 'string' ? properties.title : null\n )\n }\n\n if (!basic && name === 'li' && parent.type === 'element') {\n const input = getInputElement(node)\n properties.checked =\n input && input.properties ? Boolean(input.properties.checked) : null\n properties.index = getElementsBeforeCount(parent, node)\n properties.ordered = parent.tagName === 'ol'\n }\n\n if (!basic && (name === 'ol' || name === 'ul')) {\n properties.ordered = name === 'ol'\n properties.depth = context.listDepth\n }\n\n if (name === 'td' || name === 'th') {\n if (properties.align) {\n if (!properties.style) properties.style = {}\n // @ts-expect-error assume `style` is an object\n properties.style.textAlign = properties.align\n delete properties.align\n }\n\n if (!basic) {\n properties.isHeader = name === 'th'\n }\n }\n\n if (!basic && name === 'tr' && parent.type === 'element') {\n properties.isHeader = Boolean(parent.tagName === 'thead')\n }\n\n // If `sourcePos` is given, pass source information (line/column info from markdown source).\n if (options.sourcePos) {\n properties['data-sourcepos'] = flattenPosition(position)\n }\n\n if (!basic && options.rawSourcePos) {\n properties.sourcePosition = node.position\n }\n\n // If `includeElementIndex` is given, pass node index info to components.\n if (!basic && options.includeElementIndex) {\n properties.index = getElementsBeforeCount(parent, node)\n properties.siblingCount = getElementsBeforeCount(parent)\n }\n\n if (!basic) {\n properties.node = node\n }\n\n // Ensure no React warnings are emitted for void elements w/ children.\n return children.length > 0\n ? React.createElement(component, properties, children)\n : React.createElement(component, properties)\n}\n\n/**\n * @param {Element|Root} node\n * @returns {Element?}\n */\nfunction getInputElement(node) {\n let index = -1\n\n while (++index < node.children.length) {\n const child = node.children[index]\n\n if (child.type === 'element' && child.tagName === 'input') {\n return child\n }\n }\n\n return null\n}\n\n/**\n * @param {Element|Root} parent\n * @param {Element} [node]\n * @returns {number}\n */\nfunction getElementsBeforeCount(parent, node) {\n let index = -1\n let count = 0\n\n while (++index < parent.children.length) {\n if (parent.children[index] === node) break\n if (parent.children[index].type === 'element') count++\n }\n\n return count\n}\n\n/**\n * @param {Record<string, unknown>} props\n * @param {string} prop\n * @param {unknown} value\n * @param {Context} ctx\n */\nfunction addProperty(props, prop, value, ctx) {\n const info = find(ctx.schema, prop)\n let result = value\n\n // Ignore nullish and `NaN` values.\n // eslint-disable-next-line no-self-compare\n if (result === null || result === undefined || result !== result) {\n return\n }\n\n // Accept `array`.\n // Most props are space-separated.\n if (Array.isArray(result)) {\n result = info.commaSeparated ? commas(result) : spaces(result)\n }\n\n if (info.property === 'style' && typeof result === 'string') {\n result = parseStyle(result)\n }\n\n if (info.space && info.property) {\n props[\n own.call(hastToReact, info.property)\n ? hastToReact[info.property]\n : info.property\n ] = result\n } else if (info.attribute) {\n props[info.attribute] = result\n }\n}\n\n/**\n * @param {string} value\n * @returns {Record<string, string>}\n */\nfunction parseStyle(value) {\n /** @type {Record<string, string>} */\n const result = {}\n\n try {\n style(value, iterator)\n } catch {\n // Silent.\n }\n\n return result\n\n /**\n * @param {string} name\n * @param {string} v\n */\n function iterator(name, v) {\n const k = name.slice(0, 4) === '-ms-' ? `ms-${name.slice(4)}` : name\n result[k.replace(/-([a-z])/g, styleReplacer)] = v\n }\n}\n\n/**\n * @param {unknown} _\n * @param {string} $1\n */\nfunction styleReplacer(_, $1) {\n return $1.toUpperCase()\n}\n\n/**\n * @param {Position|{start: {line: null, column: null, offset: null}, end: {line: null, column: null, offset: null}}} pos\n * @returns {string}\n */\nfunction flattenPosition(pos) {\n return [\n pos.start.line,\n ':',\n pos.start.column,\n '-',\n pos.end.line,\n ':',\n pos.end.column\n ]\n .map((d) => String(d))\n .join('')\n}\n","/**\n * @param {unknown} thing\n * @returns {boolean}\n */\nexport function whitespace(thing) {\n /** @type {string} */\n var value =\n // @ts-ignore looks like a node.\n thing && typeof thing === 'object' && thing.type === 'text'\n ? // @ts-ignore looks like a text.\n thing.value || ''\n : thing\n\n // HTML whitespace expression.\n // See <https://html.spec.whatwg.org/#space-character>.\n return typeof value === 'string' && value.replace(/[ \\t\\n\\f\\r]/g, '') === ''\n}\n","/**\n * @typedef {Object} StringifyOptions\n * @property {boolean} [padLeft=true] Whether to pad a space before a token (`boolean`, default: `true`).\n * @property {boolean} [padRight=false] Whether to pad a space after a token (`boolean`, default: `false`).\n */\n\n/**\n * Parse comma separated tokens to an array.\n *\n * @param {string} value\n * @returns {Array.<string>}\n */\nexport function parse(value) {\n /** @type {Array.<string>} */\n var tokens = []\n var input = String(value || '')\n var index = input.indexOf(',')\n var start = 0\n /** @type {boolean} */\n var end\n /** @type {string} */\n var token\n\n while (!end) {\n if (index === -1) {\n index = input.length\n end = true\n }\n\n token = input.slice(start, index).trim()\n\n if (token || !end) {\n tokens.push(token)\n }\n\n start = index + 1\n index = input.indexOf(',', start)\n }\n\n return tokens\n}\n\n/**\n * Serialize an array of strings to comma separated tokens.\n *\n * @param {Array.<string|number>} values\n * @param {StringifyOptions} [options]\n * @returns {string}\n */\nexport function stringify(values, options) {\n var settings = options || {}\n\n // Ensure the last empty entry is seen.\n if (values[values.length - 1] === '') {\n values = values.concat('')\n }\n\n return values\n .join(\n (settings.padRight ? ' ' : '') +\n ',' +\n (settings.padLeft === false ? '' : ' ')\n )\n .trim()\n}\n","/**\n * Parse space separated tokens to an array of strings.\n *\n * @param {string} value Space separated tokens\n * @returns {Array.<string>} Tokens\n */\nexport function parse(value) {\n const input = String(value || '').trim()\n return input ? input.split(/[ \\t\\n\\r\\f]+/g) : []\n}\n\n/**\n * Serialize an array of strings as space separated tokens.\n *\n * @param {Array.<string|number>} values Tokens\n * @returns {string} Space separated tokens\n */\nexport function stringify(values) {\n return values.join(' ').trim()\n}\n","/**\n * @typedef {import('react').ReactNode} ReactNode\n * @typedef {import('react').ReactElement<{}>} ReactElement\n * @typedef {import('unified').PluggableList} PluggableList\n * @typedef {import('hast').Root} Root\n * @typedef {import('./rehype-filter.js').Options} FilterOptions\n * @typedef {import('./ast-to-react.js').Options} TransformOptions\n *\n * @typedef CoreOptions\n * @property {string} children\n *\n * @typedef PluginOptions\n * @property {PluggableList} [remarkPlugins=[]]\n * @property {PluggableList} [rehypePlugins=[]]\n * @property {import('remark-rehype').Options | undefined} [remarkRehypeOptions={}]\n *\n * @typedef LayoutOptions\n * @property {string} [className]\n *\n * @typedef {CoreOptions & PluginOptions & LayoutOptions & FilterOptions & TransformOptions} ReactMarkdownOptions\n *\n * @typedef Deprecation\n * @property {string} id\n * @property {string} [to]\n */\n\nimport React from 'react'\nimport {VFile} from 'vfile'\nimport {unified} from 'unified'\nimport remarkParse from 'remark-parse'\nimport remarkRehype from 'remark-rehype'\nimport PropTypes from 'prop-types'\nimport {html} from 'property-information'\nimport rehypeFilter from './rehype-filter.js'\nimport {uriTransformer} from './uri-transformer.js'\nimport {childrenToReact} from './ast-to-react.js'\n\nconst own = {}.hasOwnProperty\nconst changelog =\n 'https://github.com/remarkjs/react-markdown/blob/main/changelog.md'\n\n/** @type {Record<string, Deprecation>} */\nconst deprecated = {\n plugins: {to: 'plugins', id: 'change-plugins-to-remarkplugins'},\n renderers: {to: 'components', id: 'change-renderers-to-components'},\n astPlugins: {id: 'remove-buggy-html-in-markdown-parser'},\n allowDangerousHtml: {id: 'remove-buggy-html-in-markdown-parser'},\n escapeHtml: {id: 'remove-buggy-html-in-markdown-parser'},\n source: {to: 'children', id: 'change-source-to-children'},\n allowNode: {\n to: 'allowElement',\n id: 'replace-allownode-allowedtypes-and-disallowedtypes'\n },\n allowedTypes: {\n to: 'allowedElements',\n id: 'replace-allownode-allowedtypes-and-disallowedtypes'\n },\n disallowedTypes: {\n to: 'disallowedElements',\n id: 'replace-allownode-allowedtypes-and-disallowedtypes'\n },\n includeNodeIndex: {\n to: 'includeElementIndex',\n id: 'change-includenodeindex-to-includeelementindex'\n }\n}\n\n/**\n * React component to render markdown.\n *\n * @param {ReactMarkdownOptions} options\n * @returns {ReactElement}\n */\nexport function ReactMarkdown(options) {\n for (const key in deprecated) {\n if (own.call(deprecated, key) && own.call(options, key)) {\n const deprecation = deprecated[key]\n console.warn(\n `[react-markdown] Warning: please ${\n deprecation.to ? `use \\`${deprecation.to}\\` instead of` : 'remove'\n } \\`${key}\\` (see <${changelog}#${deprecation.id}> for more info)`\n )\n delete deprecated[key]\n }\n }\n\n const processor = unified()\n .use(remarkParse)\n .use(options.remarkPlugins || [])\n .use(remarkRehype, {\n ...options.remarkRehypeOptions,\n allowDangerousHtml: true\n })\n .use(options.rehypePlugins || [])\n .use(rehypeFilter, options)\n\n const file = new VFile()\n\n if (typeof options.children === 'string') {\n file.value = options.children\n } else if (options.children !== undefined && options.children !== null) {\n console.warn(\n `[react-markdown] Warning: please pass a string as \\`children\\` (not: \\`${options.children}\\`)`\n )\n }\n\n const hastNode = processor.runSync(processor.parse(file), file)\n\n if (hastNode.type !== 'root') {\n throw new TypeError('Expected a `root` node')\n }\n\n /** @type {ReactElement} */\n let result = React.createElement(\n React.Fragment,\n {},\n childrenToReact({options, schema: html, listDepth: 0}, hastNode)\n )\n\n if (options.className) {\n result = React.createElement('div', {className: options.className}, result)\n }\n\n return result\n}\n\nReactMarkdown.defaultProps = {transformLinkUri: uriTransformer}\n\nReactMarkdown.propTypes = {\n // Core options:\n children: PropTypes.string,\n // Layout options:\n className: PropTypes.string,\n // Filter options:\n allowElement: PropTypes.func,\n allowedElements: PropTypes.arrayOf(PropTypes.string),\n disallowedElements: PropTypes.arrayOf(PropTypes.string),\n unwrapDisallowed: PropTypes.bool,\n // Plugin options:\n remarkPlugins: PropTypes.arrayOf(\n PropTypes.oneOfType([\n PropTypes.object,\n PropTypes.func,\n PropTypes.arrayOf(\n PropTypes.oneOfType([\n PropTypes.bool,\n PropTypes.string,\n PropTypes.object,\n PropTypes.func,\n PropTypes.arrayOf(\n // prettier-ignore\n // type-coverage:ignore-next-line\n PropTypes.any\n )\n ])\n )\n ])\n ),\n rehypePlugins: PropTypes.arrayOf(\n PropTypes.oneOfType([\n PropTypes.object,\n PropTypes.func,\n PropTypes.arrayOf(\n PropTypes.oneOfType([\n PropTypes.bool,\n PropTypes.string,\n PropTypes.object,\n PropTypes.func,\n PropTypes.arrayOf(\n // prettier-ignore\n // type-coverage:ignore-next-line\n PropTypes.any\n )\n ])\n )\n ])\n ),\n // Transform options:\n sourcePos: PropTypes.bool,\n rawSourcePos: PropTypes.bool,\n skipHtml: PropTypes.bool,\n includeElementIndex: PropTypes.bool,\n transformLinkUri: PropTypes.oneOfType([PropTypes.func, PropTypes.bool]),\n linkTarget: PropTypes.oneOfType([PropTypes.func, PropTypes.string]),\n transformImageUri: PropTypes.func,\n components: PropTypes.object\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Previous} Previous\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {\n asciiAlpha,\n asciiAlphanumeric,\n asciiControl,\n asciiDigit,\n markdownLineEndingOrSpace,\n markdownLineEnding,\n unicodePunctuation,\n unicodeWhitespace\n} from 'micromark-util-character'\nconst www = {\n tokenize: tokenizeWww,\n partial: true\n}\nconst domain = {\n tokenize: tokenizeDomain,\n partial: true\n}\nconst path = {\n tokenize: tokenizePath,\n partial: true\n}\nconst punctuation = {\n tokenize: tokenizePunctuation,\n partial: true\n}\nconst namedCharacterReference = {\n tokenize: tokenizeNamedCharacterReference,\n partial: true\n}\nconst wwwAutolink = {\n tokenize: tokenizeWwwAutolink,\n previous: previousWww\n}\nconst httpAutolink = {\n tokenize: tokenizeHttpAutolink,\n previous: previousHttp\n}\nconst emailAutolink = {\n tokenize: tokenizeEmailAutolink,\n previous: previousEmail\n}\n/** @type {ConstructRecord} */\n\nconst text = {}\n/** @type {Extension} */\n\nexport const gfmAutolinkLiteral = {\n text\n}\nlet code = 48 // Add alphanumerics.\n\nwhile (code < 123) {\n text[code] = emailAutolink\n code++\n if (code === 58) code = 65\n else if (code === 91) code = 97\n}\n\ntext[43] = emailAutolink\ntext[45] = emailAutolink\ntext[46] = emailAutolink\ntext[95] = emailAutolink\ntext[72] = [emailAutolink, httpAutolink]\ntext[104] = [emailAutolink, httpAutolink]\ntext[87] = [emailAutolink, wwwAutolink]\ntext[119] = [emailAutolink, wwwAutolink]\n/** @type {Tokenizer} */\n\nfunction tokenizeEmailAutolink(effects, ok, nok) {\n const self = this\n /** @type {boolean} */\n\n let hasDot\n /** @type {boolean|undefined} */\n\n let hasDigitInLastSegment\n return start\n /** @type {State} */\n\n function start(code) {\n if (\n !gfmAtext(code) ||\n !previousEmail(self.previous) ||\n previousUnbalanced(self.events)\n ) {\n return nok(code)\n }\n\n effects.enter('literalAutolink')\n effects.enter('literalAutolinkEmail')\n return atext(code)\n }\n /** @type {State} */\n\n function atext(code) {\n if (gfmAtext(code)) {\n effects.consume(code)\n return atext\n }\n\n if (code === 64) {\n effects.consume(code)\n return label\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function label(code) {\n if (code === 46) {\n return effects.check(punctuation, done, dotContinuation)(code)\n }\n\n if (code === 45 || code === 95) {\n return effects.check(punctuation, nok, dashOrUnderscoreContinuation)(code)\n }\n\n if (asciiAlphanumeric(code)) {\n if (!hasDigitInLastSegment && asciiDigit(code)) {\n hasDigitInLastSegment = true\n }\n\n effects.consume(code)\n return label\n }\n\n return done(code)\n }\n /** @type {State} */\n\n function dotContinuation(code) {\n effects.consume(code)\n hasDot = true\n hasDigitInLastSegment = undefined\n return label\n }\n /** @type {State} */\n\n function dashOrUnderscoreContinuation(code) {\n effects.consume(code)\n return afterDashOrUnderscore\n }\n /** @type {State} */\n\n function afterDashOrUnderscore(code) {\n if (code === 46) {\n return effects.check(punctuation, nok, dotContinuation)(code)\n }\n\n return label(code)\n }\n /** @type {State} */\n\n function done(code) {\n if (hasDot && !hasDigitInLastSegment) {\n effects.exit('literalAutolinkEmail')\n effects.exit('literalAutolink')\n return ok(code)\n }\n\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeWwwAutolink(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n if (\n (code !== 87 && code !== 119) ||\n !previousWww(self.previous) ||\n previousUnbalanced(self.events)\n ) {\n return nok(code)\n }\n\n effects.enter('literalAutolink')\n effects.enter('literalAutolinkWww') // For `www.` we check instead of attempt, because when it matches, GH\n // treats it as part of a domain (yes, it says a valid domain must come\n // after `www.`, but that’s not how it’s implemented by them).\n\n return effects.check(\n www,\n effects.attempt(domain, effects.attempt(path, done), nok),\n nok\n )(code)\n }\n /** @type {State} */\n\n function done(code) {\n effects.exit('literalAutolinkWww')\n effects.exit('literalAutolink')\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHttpAutolink(effects, ok, nok) {\n const self = this\n return start\n /** @type {State} */\n\n function start(code) {\n if (\n (code !== 72 && code !== 104) ||\n !previousHttp(self.previous) ||\n previousUnbalanced(self.events)\n ) {\n return nok(code)\n }\n\n effects.enter('literalAutolink')\n effects.enter('literalAutolinkHttp')\n effects.consume(code)\n return t1\n }\n /** @type {State} */\n\n function t1(code) {\n if (code === 84 || code === 116) {\n effects.consume(code)\n return t2\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function t2(code) {\n if (code === 84 || code === 116) {\n effects.consume(code)\n return p\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function p(code) {\n if (code === 80 || code === 112) {\n effects.consume(code)\n return s\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function s(code) {\n if (code === 83 || code === 115) {\n effects.consume(code)\n return colon\n }\n\n return colon(code)\n }\n /** @type {State} */\n\n function colon(code) {\n if (code === 58) {\n effects.consume(code)\n return slash1\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function slash1(code) {\n if (code === 47) {\n effects.consume(code)\n return slash2\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function slash2(code) {\n if (code === 47) {\n effects.consume(code)\n return after\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n return code === null ||\n asciiControl(code) ||\n unicodeWhitespace(code) ||\n unicodePunctuation(code)\n ? nok(code)\n : effects.attempt(domain, effects.attempt(path, done), nok)(code)\n }\n /** @type {State} */\n\n function done(code) {\n effects.exit('literalAutolinkHttp')\n effects.exit('literalAutolink')\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeWww(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.consume(code)\n return w2\n }\n /** @type {State} */\n\n function w2(code) {\n if (code === 87 || code === 119) {\n effects.consume(code)\n return w3\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function w3(code) {\n if (code === 87 || code === 119) {\n effects.consume(code)\n return dot\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function dot(code) {\n if (code === 46) {\n effects.consume(code)\n return after\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n return code === null || markdownLineEnding(code) ? nok(code) : ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeDomain(effects, ok, nok) {\n /** @type {boolean|undefined} */\n let hasUnderscoreInLastSegment\n /** @type {boolean|undefined} */\n\n let hasUnderscoreInLastLastSegment\n return domain\n /** @type {State} */\n\n function domain(code) {\n if (code === 38) {\n return effects.check(\n namedCharacterReference,\n done,\n punctuationContinuation\n )(code)\n }\n\n if (code === 46 || code === 95) {\n return effects.check(punctuation, done, punctuationContinuation)(code)\n } // GH documents that only alphanumerics (other than `-`, `.`, and `_`) can\n // occur, which sounds like ASCII only, but they also support `www.點看.com`,\n // so that’s Unicode.\n // Instead of some new production for Unicode alphanumerics, markdown\n // already has that for Unicode punctuation and whitespace, so use those.\n\n if (\n code === null ||\n asciiControl(code) ||\n unicodeWhitespace(code) ||\n (code !== 45 && unicodePunctuation(code))\n ) {\n return done(code)\n }\n\n effects.consume(code)\n return domain\n }\n /** @type {State} */\n\n function punctuationContinuation(code) {\n if (code === 46) {\n hasUnderscoreInLastLastSegment = hasUnderscoreInLastSegment\n hasUnderscoreInLastSegment = undefined\n effects.consume(code)\n return domain\n }\n\n if (code === 95) hasUnderscoreInLastSegment = true\n effects.consume(code)\n return domain\n }\n /** @type {State} */\n\n function done(code) {\n if (!hasUnderscoreInLastLastSegment && !hasUnderscoreInLastSegment) {\n return ok(code)\n }\n\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizePath(effects, ok) {\n let balance = 0\n return inPath\n /** @type {State} */\n\n function inPath(code) {\n if (code === 38) {\n return effects.check(\n namedCharacterReference,\n ok,\n continuedPunctuation\n )(code)\n }\n\n if (code === 40) {\n balance++\n }\n\n if (code === 41) {\n return effects.check(\n punctuation,\n parenAtPathEnd,\n continuedPunctuation\n )(code)\n }\n\n if (pathEnd(code)) {\n return ok(code)\n }\n\n if (trailingPunctuation(code)) {\n return effects.check(punctuation, ok, continuedPunctuation)(code)\n }\n\n effects.consume(code)\n return inPath\n }\n /** @type {State} */\n\n function continuedPunctuation(code) {\n effects.consume(code)\n return inPath\n }\n /** @type {State} */\n\n function parenAtPathEnd(code) {\n balance--\n return balance < 0 ? ok(code) : continuedPunctuation(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeNamedCharacterReference(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.consume(code)\n return inside\n }\n /** @type {State} */\n\n function inside(code) {\n if (asciiAlpha(code)) {\n effects.consume(code)\n return inside\n }\n\n if (code === 59) {\n effects.consume(code)\n return after\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function after(code) {\n // If the named character reference is followed by the end of the path, it’s\n // not continued punctuation.\n return pathEnd(code) ? ok(code) : nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizePunctuation(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.consume(code)\n return after\n }\n /** @type {State} */\n\n function after(code) {\n // Check the next.\n if (trailingPunctuation(code)) {\n effects.consume(code)\n return after\n } // If the punctuation marker is followed by the end of the path, it’s not\n // continued punctuation.\n\n return pathEnd(code) ? ok(code) : nok(code)\n }\n}\n/**\n * @param {Code} code\n * @returns {boolean}\n */\n\nfunction trailingPunctuation(code) {\n return (\n code === 33 ||\n code === 34 ||\n code === 39 ||\n code === 41 ||\n code === 42 ||\n code === 44 ||\n code === 46 ||\n code === 58 ||\n code === 59 ||\n code === 60 ||\n code === 63 ||\n code === 95 ||\n code === 126\n )\n}\n/**\n * @param {Code} code\n * @returns {boolean}\n */\n\nfunction pathEnd(code) {\n return code === null || code === 60 || markdownLineEndingOrSpace(code)\n}\n/**\n * @param {Code} code\n * @returns {boolean}\n */\n\nfunction gfmAtext(code) {\n return (\n code === 43 ||\n code === 45 ||\n code === 46 ||\n code === 95 ||\n asciiAlphanumeric(code)\n )\n}\n/** @type {Previous} */\n\nfunction previousWww(code) {\n return (\n code === null ||\n code === 40 ||\n code === 42 ||\n code === 95 ||\n code === 126 ||\n markdownLineEndingOrSpace(code)\n )\n}\n/** @type {Previous} */\n\nfunction previousHttp(code) {\n return code === null || !asciiAlpha(code)\n}\n/** @type {Previous} */\n\nfunction previousEmail(code) {\n return code !== 47 && previousHttp(code)\n}\n/**\n * @param {Array<Event>} events\n * @returns {boolean}\n */\n\nfunction previousUnbalanced(events) {\n let index = events.length\n let result = false\n\n while (index--) {\n const token = events[index][1]\n\n if (\n (token.type === 'labelLink' || token.type === 'labelImage') &&\n !token._balanced\n ) {\n result = true\n break\n } // @ts-expect-error If we’ve seen this token, and it was marked as not\n // having any unbalanced bracket before it, we can exit.\n\n if (token._gfmAutolinkLiteralWalkedInto) {\n result = false\n break\n }\n }\n\n if (events.length > 0 && !result) {\n // @ts-expect-error Mark the last token as “walked into” w/o finding\n // anything.\n events[events.length - 1][1]._gfmAutolinkLiteralWalkedInto = true\n }\n\n return result\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Event} Event\n */\nimport {blankLine} from 'micromark-core-commonmark'\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n markdownLineEnding,\n markdownLineEndingOrSpace\n} from 'micromark-util-character'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nconst indent = {\n tokenize: tokenizeIndent,\n partial: true\n}\n/**\n * @returns {Extension}\n */\n\nexport function gfmFootnote() {\n /** @type {Extension} */\n return {\n document: {\n [91]: {\n tokenize: tokenizeDefinitionStart,\n continuation: {\n tokenize: tokenizeDefinitionContinuation\n },\n exit: gfmFootnoteDefinitionEnd\n }\n },\n text: {\n [91]: {\n tokenize: tokenizeGfmFootnoteCall\n },\n [93]: {\n add: 'after',\n tokenize: tokenizePotentialGfmFootnoteCall,\n resolveTo: resolveToPotentialGfmFootnoteCall\n }\n }\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizePotentialGfmFootnoteCall(effects, ok, nok) {\n const self = this\n let index = self.events.length\n /** @type {Array<string>} */\n // @ts-expect-error It’s fine!\n\n const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = [])\n /** @type {Token} */\n\n let labelStart // Find an opening.\n\n while (index--) {\n const token = self.events[index][1]\n\n if (token.type === 'labelImage') {\n labelStart = token\n break\n } // Exit if we’ve walked far enough.\n\n if (\n token.type === 'gfmFootnoteCall' ||\n token.type === 'labelLink' ||\n token.type === 'label' ||\n token.type === 'image' ||\n token.type === 'link'\n ) {\n break\n }\n }\n\n return start\n /** @type {State} */\n\n function start(code) {\n if (!labelStart || !labelStart._balanced) {\n return nok(code)\n }\n\n const id = normalizeIdentifier(\n self.sliceSerialize({\n start: labelStart.end,\n end: self.now()\n })\n )\n\n if (id.charCodeAt(0) !== 94 || !defined.includes(id.slice(1))) {\n return nok(code)\n }\n\n effects.enter('gfmFootnoteCallLabelMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteCallLabelMarker')\n return ok(code)\n }\n}\n/** @type {Resolver} */\n\nfunction resolveToPotentialGfmFootnoteCall(events, context) {\n let index = events.length\n /** @type {Token|undefined} */\n\n let labelStart // Find an opening.\n\n while (index--) {\n if (\n events[index][1].type === 'labelImage' &&\n events[index][0] === 'enter'\n ) {\n labelStart = events[index][1]\n break\n }\n }\n\n // Change the `labelImageMarker` to a `data`.\n events[index + 1][1].type = 'data'\n events[index + 3][1].type = 'gfmFootnoteCallLabelMarker' // The whole (without `!`):\n\n const call = {\n type: 'gfmFootnoteCall',\n start: Object.assign({}, events[index + 3][1].start),\n end: Object.assign({}, events[events.length - 1][1].end)\n } // The `^` marker\n\n const marker = {\n type: 'gfmFootnoteCallMarker',\n start: Object.assign({}, events[index + 3][1].end),\n end: Object.assign({}, events[index + 3][1].end)\n } // Increment the end 1 character.\n\n marker.end.column++\n marker.end.offset++\n marker.end._bufferIndex++\n const string = {\n type: 'gfmFootnoteCallString',\n start: Object.assign({}, marker.end),\n end: Object.assign({}, events[events.length - 1][1].start)\n }\n const chunk = {\n type: 'chunkString',\n contentType: 'string',\n start: Object.assign({}, string.start),\n end: Object.assign({}, string.end)\n }\n /** @type {Array<Event>} */\n\n const replacement = [\n // Take the `labelImageMarker` (now `data`, the `!`)\n events[index + 1],\n events[index + 2],\n ['enter', call, context], // The `[`\n events[index + 3],\n events[index + 4], // The `^`.\n ['enter', marker, context],\n ['exit', marker, context], // Everything in between.\n ['enter', string, context],\n ['enter', chunk, context],\n ['exit', chunk, context],\n ['exit', string, context], // The ending (`]`, properly parsed and labelled).\n events[events.length - 2],\n events[events.length - 1],\n ['exit', call, context]\n ]\n events.splice(index, events.length - index + 1, ...replacement)\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeGfmFootnoteCall(effects, ok, nok) {\n const self = this\n /** @type {Array<string>} */\n // @ts-expect-error It’s fine!\n\n const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = [])\n let size = 0\n /** @type {boolean} */\n\n let data\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('gfmFootnoteCall')\n effects.enter('gfmFootnoteCallLabelMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteCallLabelMarker')\n return callStart\n }\n /** @type {State} */\n\n function callStart(code) {\n if (code !== 94) return nok(code)\n effects.enter('gfmFootnoteCallMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteCallMarker')\n effects.enter('gfmFootnoteCallString')\n effects.enter('chunkString').contentType = 'string'\n return callData\n }\n /** @type {State} */\n\n function callData(code) {\n /** @type {Token} */\n let token\n\n if (code === null || code === 91 || size++ > 999) {\n return nok(code)\n }\n\n if (code === 93) {\n if (!data) {\n return nok(code)\n }\n\n effects.exit('chunkString')\n token = effects.exit('gfmFootnoteCallString')\n return defined.includes(normalizeIdentifier(self.sliceSerialize(token)))\n ? end(code)\n : nok(code)\n }\n\n effects.consume(code)\n\n if (!markdownLineEndingOrSpace(code)) {\n data = true\n }\n\n return code === 92 ? callEscape : callData\n }\n /** @type {State} */\n\n function callEscape(code) {\n if (code === 91 || code === 92 || code === 93) {\n effects.consume(code)\n size++\n return callData\n }\n\n return callData(code)\n }\n /** @type {State} */\n\n function end(code) {\n effects.enter('gfmFootnoteCallLabelMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteCallLabelMarker')\n effects.exit('gfmFootnoteCall')\n return ok\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeDefinitionStart(effects, ok, nok) {\n const self = this\n /** @type {Array<string>} */\n // @ts-expect-error It’s fine!\n\n const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = [])\n /** @type {string} */\n\n let identifier\n let size = 0\n /** @type {boolean|undefined} */\n\n let data\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('gfmFootnoteDefinition')._container = true\n effects.enter('gfmFootnoteDefinitionLabel')\n effects.enter('gfmFootnoteDefinitionLabelMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteDefinitionLabelMarker')\n return labelStart\n }\n /** @type {State} */\n\n function labelStart(code) {\n if (code === 94) {\n effects.enter('gfmFootnoteDefinitionMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteDefinitionMarker')\n effects.enter('gfmFootnoteDefinitionLabelString')\n return atBreak\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function atBreak(code) {\n /** @type {Token} */\n let token\n\n if (code === null || code === 91 || size > 999) {\n return nok(code)\n }\n\n if (code === 93) {\n if (!data) {\n return nok(code)\n }\n\n token = effects.exit('gfmFootnoteDefinitionLabelString')\n identifier = normalizeIdentifier(self.sliceSerialize(token))\n effects.enter('gfmFootnoteDefinitionLabelMarker')\n effects.consume(code)\n effects.exit('gfmFootnoteDefinitionLabelMarker')\n effects.exit('gfmFootnoteDefinitionLabel')\n return labelAfter\n }\n\n if (markdownLineEnding(code)) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n size++\n return atBreak\n }\n\n effects.enter('chunkString').contentType = 'string'\n return label(code)\n }\n /** @type {State} */\n\n function label(code) {\n if (\n code === null ||\n markdownLineEnding(code) ||\n code === 91 ||\n code === 93 ||\n size > 999\n ) {\n effects.exit('chunkString')\n return atBreak(code)\n }\n\n if (!markdownLineEndingOrSpace(code)) {\n data = true\n }\n\n size++\n effects.consume(code)\n return code === 92 ? labelEscape : label\n }\n /** @type {State} */\n\n function labelEscape(code) {\n if (code === 91 || code === 92 || code === 93) {\n effects.consume(code)\n size++\n return label\n }\n\n return label(code)\n }\n /** @type {State} */\n\n function labelAfter(code) {\n if (code === 58) {\n effects.enter('definitionMarker')\n effects.consume(code)\n effects.exit('definitionMarker') // Any whitespace after the marker is eaten, forming indented code\n // is not possible.\n // No space is also fine, just like a block quote marker.\n\n return factorySpace(effects, done, 'gfmFootnoteDefinitionWhitespace')\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function done(code) {\n if (!defined.includes(identifier)) {\n defined.push(identifier)\n }\n\n return ok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeDefinitionContinuation(effects, ok, nok) {\n // Either a blank line, which is okay, or an indented thing.\n return effects.check(blankLine, ok, effects.attempt(indent, ok, nok))\n}\n/** @type {Exiter} */\n\nfunction gfmFootnoteDefinitionEnd(effects) {\n effects.exit('gfmFootnoteDefinition')\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeIndent(effects, ok, nok) {\n const self = this\n return factorySpace(\n effects,\n afterPrefix,\n 'gfmFootnoteDefinitionIndent',\n 4 + 1\n )\n /** @type {State} */\n\n function afterPrefix(code) {\n const tail = self.events[self.events.length - 1]\n return tail &&\n tail[1].type === 'gfmFootnoteDefinitionIndent' &&\n tail[2].sliceSerialize(tail[1], true).length === 4\n ? ok(code)\n : nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {\n markdownLineEndingOrSpace,\n unicodePunctuation,\n unicodeWhitespace\n} from 'micromark-util-character'\n\n/**\n * Classify whether a character code represents whitespace, punctuation, or\n * something else.\n *\n * Used for attention (emphasis, strong), whose sequences can open or close\n * based on the class of surrounding characters.\n *\n * Note that eof (`null`) is seen as whitespace.\n *\n * @param {Code} code\n * @returns {number|undefined}\n */\nexport function classifyCharacter(code) {\n if (\n code === null ||\n markdownLineEndingOrSpace(code) ||\n unicodeWhitespace(code)\n ) {\n return 1\n }\n\n if (unicodePunctuation(code)) {\n return 2\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Event} Event\n */\n\n/**\n * @typedef Options\n * Configuration (optional).\n * @property {boolean} [singleTilde=true]\n * Whether to support strikethrough with a single tilde (`boolean`, default:\n * `true`).\n * Single tildes work on github.com, but are technically prohibited by the\n * GFM spec.\n */\nimport {splice} from 'micromark-util-chunked'\nimport {classifyCharacter} from 'micromark-util-classify-character'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\n/**\n * @param {Options} [options]\n * @returns {Extension}\n */\nexport function gfmStrikethrough(options = {}) {\n let single = options.singleTilde\n const tokenizer = {\n tokenize: tokenizeStrikethrough,\n resolveAll: resolveAllStrikethrough\n }\n\n if (single === null || single === undefined) {\n single = true\n }\n\n return {\n text: {\n [126]: tokenizer\n },\n insideSpan: {\n null: [tokenizer]\n },\n attentionMarkers: {\n null: [126]\n }\n }\n /**\n * Take events and resolve strikethrough.\n *\n * @type {Resolver}\n */\n\n function resolveAllStrikethrough(events, context) {\n let index = -1 // Walk through all events.\n\n while (++index < events.length) {\n // Find a token that can close.\n if (\n events[index][0] === 'enter' &&\n events[index][1].type === 'strikethroughSequenceTemporary' &&\n events[index][1]._close\n ) {\n let open = index // Now walk back to find an opener.\n\n while (open--) {\n // Find a token that can open the closer.\n if (\n events[open][0] === 'exit' &&\n events[open][1].type === 'strikethroughSequenceTemporary' &&\n events[open][1]._open && // If the sizes are the same:\n events[index][1].end.offset - events[index][1].start.offset ===\n events[open][1].end.offset - events[open][1].start.offset\n ) {\n events[index][1].type = 'strikethroughSequence'\n events[open][1].type = 'strikethroughSequence'\n const strikethrough = {\n type: 'strikethrough',\n start: Object.assign({}, events[open][1].start),\n end: Object.assign({}, events[index][1].end)\n }\n const text = {\n type: 'strikethroughText',\n start: Object.assign({}, events[open][1].end),\n end: Object.assign({}, events[index][1].start)\n } // Opening.\n\n const nextEvents = [\n ['enter', strikethrough, context],\n ['enter', events[open][1], context],\n ['exit', events[open][1], context],\n ['enter', text, context]\n ] // Between.\n\n splice(\n nextEvents,\n nextEvents.length,\n 0,\n resolveAll(\n context.parser.constructs.insideSpan.null,\n events.slice(open + 1, index),\n context\n )\n ) // Closing.\n\n splice(nextEvents, nextEvents.length, 0, [\n ['exit', text, context],\n ['enter', events[index][1], context],\n ['exit', events[index][1], context],\n ['exit', strikethrough, context]\n ])\n splice(events, open - 1, index - open + 3, nextEvents)\n index = open + nextEvents.length - 2\n break\n }\n }\n }\n }\n\n index = -1\n\n while (++index < events.length) {\n if (events[index][1].type === 'strikethroughSequenceTemporary') {\n events[index][1].type = 'data'\n }\n }\n\n return events\n }\n /** @type {Tokenizer} */\n\n function tokenizeStrikethrough(effects, ok, nok) {\n const previous = this.previous\n const events = this.events\n let size = 0\n return start\n /** @type {State} */\n\n function start(code) {\n if (\n previous === 126 &&\n events[events.length - 1][1].type !== 'characterEscape'\n ) {\n return nok(code)\n }\n\n effects.enter('strikethroughSequenceTemporary')\n return more(code)\n }\n /** @type {State} */\n\n function more(code) {\n const before = classifyCharacter(previous)\n\n if (code === 126) {\n // If this is the third marker, exit.\n if (size > 1) return nok(code)\n effects.consume(code)\n size++\n return more\n }\n\n if (size < 2 && !single) return nok(code)\n const token = effects.exit('strikethroughSequenceTemporary')\n const after = classifyCharacter(code)\n token._open = !after || (after === 2 && Boolean(before))\n token._close = !before || (before === 2 && Boolean(after))\n return ok(code)\n }\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n */\n\n/**\n * @typedef {'left'|'center'|'right'|'none'} Align\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n markdownLineEnding,\n markdownLineEndingOrSpace,\n markdownSpace\n} from 'micromark-util-character'\n\n/** @type {Extension} */\nexport const gfmTable = {\n flow: {\n null: {\n tokenize: tokenizeTable,\n resolve: resolveTable\n }\n }\n}\nconst nextPrefixedOrBlank = {\n tokenize: tokenizeNextPrefixedOrBlank,\n partial: true\n}\n/** @type {Resolver} */\n\nfunction resolveTable(events, context) {\n let index = -1\n /** @type {boolean|undefined} */\n\n let inHead\n /** @type {boolean|undefined} */\n\n let inDelimiterRow\n /** @type {boolean|undefined} */\n\n let inRow\n /** @type {number|undefined} */\n\n let contentStart\n /** @type {number|undefined} */\n\n let contentEnd\n /** @type {number|undefined} */\n\n let cellStart\n /** @type {boolean|undefined} */\n\n let seenCellInRow\n\n while (++index < events.length) {\n const token = events[index][1]\n\n if (inRow) {\n if (token.type === 'temporaryTableCellContent') {\n contentStart = contentStart || index\n contentEnd = index\n }\n\n if (\n // Combine separate content parts into one.\n (token.type === 'tableCellDivider' || token.type === 'tableRow') &&\n contentEnd\n ) {\n const content = {\n type: 'tableContent',\n start: events[contentStart][1].start,\n end: events[contentEnd][1].end\n }\n /** @type {Token} */\n\n const text = {\n type: 'chunkText',\n start: content.start,\n end: content.end,\n // @ts-expect-error It’s fine.\n contentType: 'text'\n }\n events.splice(\n contentStart,\n contentEnd - contentStart + 1,\n ['enter', content, context],\n ['enter', text, context],\n ['exit', text, context],\n ['exit', content, context]\n )\n index -= contentEnd - contentStart - 3\n contentStart = undefined\n contentEnd = undefined\n }\n }\n\n if (\n events[index][0] === 'exit' &&\n cellStart !== undefined &&\n cellStart + (seenCellInRow ? 0 : 1) < index &&\n (token.type === 'tableCellDivider' ||\n (token.type === 'tableRow' &&\n (cellStart + 3 < index ||\n events[cellStart][1].type !== 'whitespace')))\n ) {\n const cell = {\n type: inDelimiterRow\n ? 'tableDelimiter'\n : inHead\n ? 'tableHeader'\n : 'tableData',\n start: events[cellStart][1].start,\n end: events[index][1].end\n }\n events.splice(index + (token.type === 'tableCellDivider' ? 1 : 0), 0, [\n 'exit',\n cell,\n context\n ])\n events.splice(cellStart, 0, ['enter', cell, context])\n index += 2\n cellStart = index + 1\n seenCellInRow = true\n }\n\n if (token.type === 'tableRow') {\n inRow = events[index][0] === 'enter'\n\n if (inRow) {\n cellStart = index + 1\n seenCellInRow = false\n }\n }\n\n if (token.type === 'tableDelimiterRow') {\n inDelimiterRow = events[index][0] === 'enter'\n\n if (inDelimiterRow) {\n cellStart = index + 1\n seenCellInRow = false\n }\n }\n\n if (token.type === 'tableHead') {\n inHead = events[index][0] === 'enter'\n }\n }\n\n return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeTable(effects, ok, nok) {\n const self = this\n /** @type {Array<Align>} */\n\n const align = []\n let tableHeaderCount = 0\n /** @type {boolean|undefined} */\n\n let seenDelimiter\n /** @type {boolean|undefined} */\n\n let hasDash\n return start\n /** @type {State} */\n\n function start(code) {\n // @ts-expect-error Custom.\n effects.enter('table')._align = align\n effects.enter('tableHead')\n effects.enter('tableRow') // If we start with a pipe, we open a cell marker.\n\n if (code === 124) {\n return cellDividerHead(code)\n }\n\n tableHeaderCount++\n effects.enter('temporaryTableCellContent') // Can’t be space or eols at the start of a construct, so we’re in a cell.\n\n return inCellContentHead(code)\n }\n /** @type {State} */\n\n function cellDividerHead(code) {\n effects.enter('tableCellDivider')\n effects.consume(code)\n effects.exit('tableCellDivider')\n seenDelimiter = true\n return cellBreakHead\n }\n /** @type {State} */\n\n function cellBreakHead(code) {\n if (code === null || markdownLineEnding(code)) {\n return atRowEndHead(code)\n }\n\n if (markdownSpace(code)) {\n effects.enter('whitespace')\n effects.consume(code)\n return inWhitespaceHead\n }\n\n if (seenDelimiter) {\n seenDelimiter = undefined\n tableHeaderCount++\n }\n\n if (code === 124) {\n return cellDividerHead(code)\n } // Anything else is cell content.\n\n effects.enter('temporaryTableCellContent')\n return inCellContentHead(code)\n }\n /** @type {State} */\n\n function inWhitespaceHead(code) {\n if (markdownSpace(code)) {\n effects.consume(code)\n return inWhitespaceHead\n }\n\n effects.exit('whitespace')\n return cellBreakHead(code)\n }\n /** @type {State} */\n\n function inCellContentHead(code) {\n // EOF, whitespace, pipe\n if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {\n effects.exit('temporaryTableCellContent')\n return cellBreakHead(code)\n }\n\n effects.consume(code)\n return code === 92 ? inCellContentEscapeHead : inCellContentHead\n }\n /** @type {State} */\n\n function inCellContentEscapeHead(code) {\n if (code === 92 || code === 124) {\n effects.consume(code)\n return inCellContentHead\n } // Anything else.\n\n return inCellContentHead(code)\n }\n /** @type {State} */\n\n function atRowEndHead(code) {\n if (code === null) {\n return nok(code)\n }\n\n effects.exit('tableRow')\n effects.exit('tableHead')\n const originalInterrupt = self.interrupt\n self.interrupt = true\n return effects.attempt(\n {\n tokenize: tokenizeRowEnd,\n partial: true\n },\n function (code) {\n self.interrupt = originalInterrupt\n effects.enter('tableDelimiterRow')\n return atDelimiterRowBreak(code)\n },\n function (code) {\n self.interrupt = originalInterrupt\n return nok(code)\n }\n )(code)\n }\n /** @type {State} */\n\n function atDelimiterRowBreak(code) {\n if (code === null || markdownLineEnding(code)) {\n return rowEndDelimiter(code)\n }\n\n if (markdownSpace(code)) {\n effects.enter('whitespace')\n effects.consume(code)\n return inWhitespaceDelimiter\n }\n\n if (code === 45) {\n effects.enter('tableDelimiterFiller')\n effects.consume(code)\n hasDash = true\n align.push('none')\n return inFillerDelimiter\n }\n\n if (code === 58) {\n effects.enter('tableDelimiterAlignment')\n effects.consume(code)\n effects.exit('tableDelimiterAlignment')\n align.push('left')\n return afterLeftAlignment\n } // If we start with a pipe, we open a cell marker.\n\n if (code === 124) {\n effects.enter('tableCellDivider')\n effects.consume(code)\n effects.exit('tableCellDivider')\n return atDelimiterRowBreak\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function inWhitespaceDelimiter(code) {\n if (markdownSpace(code)) {\n effects.consume(code)\n return inWhitespaceDelimiter\n }\n\n effects.exit('whitespace')\n return atDelimiterRowBreak(code)\n }\n /** @type {State} */\n\n function inFillerDelimiter(code) {\n if (code === 45) {\n effects.consume(code)\n return inFillerDelimiter\n }\n\n effects.exit('tableDelimiterFiller')\n\n if (code === 58) {\n effects.enter('tableDelimiterAlignment')\n effects.consume(code)\n effects.exit('tableDelimiterAlignment')\n align[align.length - 1] =\n align[align.length - 1] === 'left' ? 'center' : 'right'\n return afterRightAlignment\n }\n\n return atDelimiterRowBreak(code)\n }\n /** @type {State} */\n\n function afterLeftAlignment(code) {\n if (code === 45) {\n effects.enter('tableDelimiterFiller')\n effects.consume(code)\n hasDash = true\n return inFillerDelimiter\n } // Anything else is not ok.\n\n return nok(code)\n }\n /** @type {State} */\n\n function afterRightAlignment(code) {\n if (code === null || markdownLineEnding(code)) {\n return rowEndDelimiter(code)\n }\n\n if (markdownSpace(code)) {\n effects.enter('whitespace')\n effects.consume(code)\n return inWhitespaceDelimiter\n } // `|`\n\n if (code === 124) {\n effects.enter('tableCellDivider')\n effects.consume(code)\n effects.exit('tableCellDivider')\n return atDelimiterRowBreak\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function rowEndDelimiter(code) {\n effects.exit('tableDelimiterRow') // Exit if there was no dash at all, or if the header cell count is not the\n // delimiter cell count.\n\n if (!hasDash || tableHeaderCount !== align.length) {\n return nok(code)\n }\n\n if (code === null) {\n return tableClose(code)\n }\n\n return effects.check(\n nextPrefixedOrBlank,\n tableClose,\n effects.attempt(\n {\n tokenize: tokenizeRowEnd,\n partial: true\n },\n factorySpace(effects, bodyStart, 'linePrefix', 4),\n tableClose\n )\n )(code)\n }\n /** @type {State} */\n\n function tableClose(code) {\n effects.exit('table')\n return ok(code)\n }\n /** @type {State} */\n\n function bodyStart(code) {\n effects.enter('tableBody')\n return rowStartBody(code)\n }\n /** @type {State} */\n\n function rowStartBody(code) {\n effects.enter('tableRow') // If we start with a pipe, we open a cell marker.\n\n if (code === 124) {\n return cellDividerBody(code)\n }\n\n effects.enter('temporaryTableCellContent') // Can’t be space or eols at the start of a construct, so we’re in a cell.\n\n return inCellContentBody(code)\n }\n /** @type {State} */\n\n function cellDividerBody(code) {\n effects.enter('tableCellDivider')\n effects.consume(code)\n effects.exit('tableCellDivider')\n return cellBreakBody\n }\n /** @type {State} */\n\n function cellBreakBody(code) {\n if (code === null || markdownLineEnding(code)) {\n return atRowEndBody(code)\n }\n\n if (markdownSpace(code)) {\n effects.enter('whitespace')\n effects.consume(code)\n return inWhitespaceBody\n } // `|`\n\n if (code === 124) {\n return cellDividerBody(code)\n } // Anything else is cell content.\n\n effects.enter('temporaryTableCellContent')\n return inCellContentBody(code)\n }\n /** @type {State} */\n\n function inWhitespaceBody(code) {\n if (markdownSpace(code)) {\n effects.consume(code)\n return inWhitespaceBody\n }\n\n effects.exit('whitespace')\n return cellBreakBody(code)\n }\n /** @type {State} */\n\n function inCellContentBody(code) {\n // EOF, whitespace, pipe\n if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {\n effects.exit('temporaryTableCellContent')\n return cellBreakBody(code)\n }\n\n effects.consume(code)\n return code === 92 ? inCellContentEscapeBody : inCellContentBody\n }\n /** @type {State} */\n\n function inCellContentEscapeBody(code) {\n if (code === 92 || code === 124) {\n effects.consume(code)\n return inCellContentBody\n } // Anything else.\n\n return inCellContentBody(code)\n }\n /** @type {State} */\n\n function atRowEndBody(code) {\n effects.exit('tableRow')\n\n if (code === null) {\n return tableBodyClose(code)\n }\n\n return effects.check(\n nextPrefixedOrBlank,\n tableBodyClose,\n effects.attempt(\n {\n tokenize: tokenizeRowEnd,\n partial: true\n },\n factorySpace(effects, rowStartBody, 'linePrefix', 4),\n tableBodyClose\n )\n )(code)\n }\n /** @type {State} */\n\n function tableBodyClose(code) {\n effects.exit('tableBody')\n return tableClose(code)\n }\n /** @type {Tokenizer} */\n\n function tokenizeRowEnd(effects, ok, nok) {\n return start\n /** @type {State} */\n\n function start(code) {\n effects.enter('lineEnding')\n effects.consume(code)\n effects.exit('lineEnding')\n return factorySpace(effects, prefixed, 'linePrefix')\n }\n /** @type {State} */\n\n function prefixed(code) {\n // Blank or interrupting line.\n if (\n self.parser.lazy[self.now().line] ||\n code === null ||\n markdownLineEnding(code)\n ) {\n return nok(code)\n }\n\n const tail = self.events[self.events.length - 1] // Indented code can interrupt delimiter and body rows.\n\n if (\n !self.parser.constructs.disable.null.includes('codeIndented') &&\n tail &&\n tail[1].type === 'linePrefix' &&\n tail[2].sliceSerialize(tail[1], true).length >= 4\n ) {\n return nok(code)\n }\n\n self._gfmTableDynamicInterruptHack = true\n return effects.check(\n self.parser.constructs.flow,\n function (code) {\n self._gfmTableDynamicInterruptHack = false\n return nok(code)\n },\n function (code) {\n self._gfmTableDynamicInterruptHack = false\n return ok(code)\n }\n )(code)\n }\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeNextPrefixedOrBlank(effects, ok, nok) {\n let size = 0\n return start\n /** @type {State} */\n\n function start(code) {\n // This is a check, so we don’t care about tokens, but we open a bogus one\n // so we’re valid.\n effects.enter('check') // EOL.\n\n effects.consume(code)\n return whitespace\n }\n /** @type {State} */\n\n function whitespace(code) {\n if (code === -1 || code === 32) {\n effects.consume(code)\n size++\n return size === 4 ? ok : whitespace\n } // EOF or whitespace\n\n if (code === null || markdownLineEndingOrSpace(code)) {\n return ok(code)\n } // Anything else.\n\n return nok(code)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Previous} Previous\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n markdownLineEndingOrSpace,\n markdownLineEnding\n} from 'micromark-util-character'\nconst tasklistCheck = {\n tokenize: tokenizeTasklistCheck\n}\nexport const gfmTaskListItem = {\n text: {\n [91]: tasklistCheck\n }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeTasklistCheck(effects, ok, nok) {\n const self = this\n return open\n /** @type {State} */\n\n function open(code) {\n if (\n // Exit if there’s stuff before.\n self.previous !== null || // Exit if not in the first content that is the first child of a list\n // item.\n !self._gfmTasklistFirstContentOfListItem\n ) {\n return nok(code)\n }\n\n effects.enter('taskListCheck')\n effects.enter('taskListCheckMarker')\n effects.consume(code)\n effects.exit('taskListCheckMarker')\n return inside\n }\n /** @type {State} */\n\n function inside(code) {\n // To match how GH works in comments, use `markdownSpace` (`[ \\t]`) instead\n // of `markdownLineEndingOrSpace` (`[ \\t\\r\\n]`).\n if (markdownLineEndingOrSpace(code)) {\n effects.enter('taskListCheckValueUnchecked')\n effects.consume(code)\n effects.exit('taskListCheckValueUnchecked')\n return close\n }\n\n if (code === 88 || code === 120) {\n effects.enter('taskListCheckValueChecked')\n effects.consume(code)\n effects.exit('taskListCheckValueChecked')\n return close\n }\n\n return nok(code)\n }\n /** @type {State} */\n\n function close(code) {\n if (code === 93) {\n effects.enter('taskListCheckMarker')\n effects.consume(code)\n effects.exit('taskListCheckMarker')\n effects.exit('taskListCheck')\n return effects.check(\n {\n tokenize: spaceThenNonSpace\n },\n ok,\n nok\n )\n }\n\n return nok(code)\n }\n}\n/** @type {Tokenizer} */\n\nfunction spaceThenNonSpace(effects, ok, nok) {\n const self = this\n return factorySpace(effects, after, 'whitespace')\n /** @type {State} */\n\n function after(code) {\n const tail = self.events[self.events.length - 1]\n return (\n // We either found spaces…\n ((tail && tail[1].type === 'whitespace') || // …or it was followed by a line ending, in which case, there has to be\n // non-whitespace after that line ending, because otherwise we’d get an\n // EOF as the content is closed with blank lines.\n markdownLineEnding(code)) &&\n code !== null\n ? ok(code)\n : nok(code)\n )\n }\n}\n","/**\n * Count how often a character (or substring) is used in a string.\n *\n * @param {string} value\n * Value to search in.\n * @param {string} character\n * Character (or substring) to look for.\n * @return {number}\n * Number of times `character` occurred in `value`.\n */\nexport function ccount(value, character) {\n const source = String(value)\n\n if (typeof character !== 'string') {\n throw new TypeError('Expected character')\n }\n\n let count = 0\n let index = source.indexOf(character)\n\n while (index !== -1) {\n count++\n index = source.indexOf(character, index + character.length)\n }\n\n return count\n}\n","/**\n * @typedef Options Configuration.\n * @property {Test} [ignore] `unist-util-is` test used to assert parents\n *\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast').Content} Content\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n * @typedef {import('mdast').Text} Text\n * @typedef {Content|Root} Node\n * @typedef {Extract<Node, import('mdast').Parent>} Parent\n *\n * @typedef {import('unist-util-visit-parents').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n *\n * @typedef RegExpMatchObject\n * @property {number} index\n * @property {string} input\n *\n * @typedef {string|RegExp} Find\n * @typedef {string|ReplaceFunction} Replace\n *\n * @typedef {[Find, Replace]} FindAndReplaceTuple\n * @typedef {Object.<string, Replace>} FindAndReplaceSchema\n * @typedef {Array.<FindAndReplaceTuple>} FindAndReplaceList\n *\n * @typedef {[RegExp, ReplaceFunction]} Pair\n * @typedef {Array.<Pair>} Pairs\n */\n\n/**\n * @callback ReplaceFunction\n * @param {...any} parameters\n * @returns {Array.<PhrasingContent>|PhrasingContent|string|false|undefined|null}\n */\n\nimport escape from 'escape-string-regexp'\nimport {visitParents} from 'unist-util-visit-parents'\nimport {convert} from 'unist-util-is'\n\nconst own = {}.hasOwnProperty\n\n/**\n * @param tree mdast tree\n * @param find Value to find and remove. When `string`, escaped and made into a global `RegExp`\n * @param [replace] Value to insert.\n * * When `string`, turned into a Text node.\n * * When `Function`, called with the results of calling `RegExp.exec` as\n * arguments, in which case it can return a single or a list of `Node`,\n * a `string` (which is wrapped in a `Text` node), or `false` to not replace\n * @param [options] Configuration.\n */\nexport const findAndReplace =\n /**\n * @type {(\n * ((tree: Node, find: Find, replace?: Replace, options?: Options) => Node) &\n * ((tree: Node, schema: FindAndReplaceSchema|FindAndReplaceList, options?: Options) => Node)\n * )}\n **/\n (\n /**\n * @param {Node} tree\n * @param {Find|FindAndReplaceSchema|FindAndReplaceList} find\n * @param {Replace|Options} [replace]\n * @param {Options} [options]\n */\n function (tree, find, replace, options) {\n /** @type {Options|undefined} */\n let settings\n /** @type {FindAndReplaceSchema|FindAndReplaceList} */\n let schema\n\n if (typeof find === 'string' || find instanceof RegExp) {\n // @ts-expect-error don’t expect options twice.\n schema = [[find, replace]]\n settings = options\n } else {\n schema = find\n // @ts-expect-error don’t expect replace twice.\n settings = replace\n }\n\n if (!settings) {\n settings = {}\n }\n\n const ignored = convert(settings.ignore || [])\n const pairs = toPairs(schema)\n let pairIndex = -1\n\n while (++pairIndex < pairs.length) {\n visitParents(tree, 'text', visitor)\n }\n\n return tree\n\n /** @type {import('unist-util-visit-parents').Visitor<Text>} */\n function visitor(node, parents) {\n let index = -1\n /** @type {Parent|undefined} */\n let grandparent\n\n while (++index < parents.length) {\n const parent = /** @type {Parent} */ (parents[index])\n\n if (\n ignored(\n parent,\n // @ts-expect-error mdast vs. unist parent.\n grandparent ? grandparent.children.indexOf(parent) : undefined,\n grandparent\n )\n ) {\n return\n }\n\n grandparent = parent\n }\n\n if (grandparent) {\n return handler(node, grandparent)\n }\n }\n\n /**\n * @param {Text} node\n * @param {Parent} parent\n * @returns {VisitorResult}\n */\n function handler(node, parent) {\n const find = pairs[pairIndex][0]\n const replace = pairs[pairIndex][1]\n let start = 0\n // @ts-expect-error: TS is wrong, some of these children can be text.\n let index = parent.children.indexOf(node)\n /** @type {Array.<PhrasingContent>} */\n let nodes = []\n /** @type {number|undefined} */\n let position\n\n find.lastIndex = 0\n\n let match = find.exec(node.value)\n\n while (match) {\n position = match.index\n // @ts-expect-error this is perfectly fine, typescript.\n let value = replace(...match, {\n index: match.index,\n input: match.input\n })\n\n if (typeof value === 'string') {\n value = value.length > 0 ? {type: 'text', value} : undefined\n }\n\n if (value !== false) {\n if (start !== position) {\n nodes.push({\n type: 'text',\n value: node.value.slice(start, position)\n })\n }\n\n if (Array.isArray(value)) {\n nodes.push(...value)\n } else if (value) {\n nodes.push(value)\n }\n\n start = position + match[0].length\n }\n\n if (!find.global) {\n break\n }\n\n match = find.exec(node.value)\n }\n\n if (position === undefined) {\n nodes = [node]\n index--\n } else {\n if (start < node.value.length) {\n nodes.push({type: 'text', value: node.value.slice(start)})\n }\n\n parent.children.splice(index, 1, ...nodes)\n }\n\n return index + nodes.length + 1\n }\n }\n )\n\n/**\n * @param {FindAndReplaceSchema|FindAndReplaceList} schema\n * @returns {Pairs}\n */\nfunction toPairs(schema) {\n /** @type {Pairs} */\n const result = []\n\n if (typeof schema !== 'object') {\n throw new TypeError('Expected array or object as schema')\n }\n\n if (Array.isArray(schema)) {\n let index = -1\n\n while (++index < schema.length) {\n result.push([\n toExpression(schema[index][0]),\n toFunction(schema[index][1])\n ])\n }\n } else {\n /** @type {string} */\n let key\n\n for (key in schema) {\n if (own.call(schema, key)) {\n result.push([toExpression(key), toFunction(schema[key])])\n }\n }\n }\n\n return result\n}\n\n/**\n * @param {Find} find\n * @returns {RegExp}\n */\nfunction toExpression(find) {\n return typeof find === 'string' ? new RegExp(escape(find), 'g') : find\n}\n\n/**\n * @param {Replace} replace\n * @returns {ReplaceFunction}\n */\nfunction toFunction(replace) {\n return typeof replace === 'function' ? replace : () => replace\n}\n","export default function escapeStringRegexp(string) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\t// Escape characters with special meaning either inside or outside character sets.\n\t// Use a simple backslash escape when it’s always valid, and a `\\xnn` escape when the simpler form would be disallowed by Unicode patterns’ stricter grammar.\n\treturn string\n\t\t.replace(/[|\\\\{}()[\\]^$+*?.]/g, '\\\\$&')\n\t\t.replace(/-/g, '\\\\x2d');\n}\n","/**\n * @typedef {import('mdast').Link} Link\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Transform} FromMarkdownTransform\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown/lib/types.js').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-find-and-replace').ReplaceFunction} ReplaceFunction\n * @typedef {import('mdast-util-find-and-replace').RegExpMatchObject} RegExpMatchObject\n * @typedef {import('mdast-util-find-and-replace').PhrasingContent} PhrasingContent\n */\n\nimport {ccount} from 'ccount'\nimport {findAndReplace} from 'mdast-util-find-and-replace'\nimport {unicodePunctuation, unicodeWhitespace} from 'micromark-util-character'\n\nconst inConstruct = 'phrasing'\nconst notInConstruct = ['autolink', 'link', 'image', 'label']\n\n/** @type {FromMarkdownExtension} */\nexport const gfmAutolinkLiteralFromMarkdown = {\n transforms: [transformGfmAutolinkLiterals],\n enter: {\n literalAutolink: enterLiteralAutolink,\n literalAutolinkEmail: enterLiteralAutolinkValue,\n literalAutolinkHttp: enterLiteralAutolinkValue,\n literalAutolinkWww: enterLiteralAutolinkValue\n },\n exit: {\n literalAutolink: exitLiteralAutolink,\n literalAutolinkEmail: exitLiteralAutolinkEmail,\n literalAutolinkHttp: exitLiteralAutolinkHttp,\n literalAutolinkWww: exitLiteralAutolinkWww\n }\n}\n\n/** @type {ToMarkdownExtension} */\nexport const gfmAutolinkLiteralToMarkdown = {\n unsafe: [\n {\n character: '@',\n before: '[+\\\\-.\\\\w]',\n after: '[\\\\-.\\\\w]',\n inConstruct,\n notInConstruct\n },\n {\n character: '.',\n before: '[Ww]',\n after: '[\\\\-.\\\\w]',\n inConstruct,\n notInConstruct\n },\n {character: ':', before: '[ps]', after: '\\\\/', inConstruct, notInConstruct}\n ]\n}\n\n/** @type {FromMarkdownHandle} */\nfunction enterLiteralAutolink(token) {\n this.enter({type: 'link', title: null, url: '', children: []}, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction enterLiteralAutolinkValue(token) {\n this.config.enter.autolinkProtocol.call(this, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitLiteralAutolinkHttp(token) {\n this.config.exit.autolinkProtocol.call(this, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitLiteralAutolinkWww(token) {\n this.config.exit.data.call(this, token)\n const node = /** @type {Link} */ (this.stack[this.stack.length - 1])\n node.url = 'http://' + this.sliceSerialize(token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitLiteralAutolinkEmail(token) {\n this.config.exit.autolinkEmail.call(this, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitLiteralAutolink(token) {\n this.exit(token)\n}\n\n/** @type {FromMarkdownTransform} */\nfunction transformGfmAutolinkLiterals(tree) {\n findAndReplace(\n tree,\n [\n [/(https?:\\/\\/|www(?=\\.))([-.\\w]+)([^ \\t\\r\\n]*)/gi, findUrl],\n [/([-.\\w+]+)@([-\\w]+(?:\\.[-\\w]+)+)/g, findEmail]\n ],\n {ignore: ['link', 'linkReference']}\n )\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} protocol\n * @param {string} domain\n * @param {string} path\n * @param {RegExpMatchObject} match\n */\n// eslint-disable-next-line max-params\nfunction findUrl(_, protocol, domain, path, match) {\n let prefix = ''\n\n // Not an expected previous character.\n if (!previous(match)) {\n return false\n }\n\n // Treat `www` as part of the domain.\n if (/^w/i.test(protocol)) {\n domain = protocol + domain\n protocol = ''\n prefix = 'http://'\n }\n\n if (!isCorrectDomain(domain)) {\n return false\n }\n\n const parts = splitUrl(domain + path)\n\n if (!parts[0]) return false\n\n /** @type {PhrasingContent} */\n const result = {\n type: 'link',\n title: null,\n url: prefix + protocol + parts[0],\n children: [{type: 'text', value: protocol + parts[0]}]\n }\n\n if (parts[1]) {\n return [result, {type: 'text', value: parts[1]}]\n }\n\n return result\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} atext\n * @param {string} label\n * @param {RegExpMatchObject} match\n */\nfunction findEmail(_, atext, label, match) {\n if (\n // Not an expected previous character.\n !previous(match, true) ||\n // Label ends in not allowed character.\n /[_-\\d]$/.test(label)\n ) {\n return false\n }\n\n return {\n type: 'link',\n title: null,\n url: 'mailto:' + atext + '@' + label,\n children: [{type: 'text', value: atext + '@' + label}]\n }\n}\n\n/**\n * @param {string} domain\n * @returns {boolean}\n */\nfunction isCorrectDomain(domain) {\n const parts = domain.split('.')\n\n if (\n parts.length < 2 ||\n (parts[parts.length - 1] &&\n (/_/.test(parts[parts.length - 1]) ||\n !/[a-zA-Z\\d]/.test(parts[parts.length - 1]))) ||\n (parts[parts.length - 2] &&\n (/_/.test(parts[parts.length - 2]) ||\n !/[a-zA-Z\\d]/.test(parts[parts.length - 2])))\n ) {\n return false\n }\n\n return true\n}\n\n/**\n * @param {string} url\n * @returns {[string, string|undefined]}\n */\nfunction splitUrl(url) {\n const trailExec = /[!\"&'),.:;<>?\\]}]+$/.exec(url)\n /** @type {number} */\n let closingParenIndex\n /** @type {number} */\n let openingParens\n /** @type {number} */\n let closingParens\n /** @type {string|undefined} */\n let trail\n\n if (trailExec) {\n url = url.slice(0, trailExec.index)\n trail = trailExec[0]\n closingParenIndex = trail.indexOf(')')\n openingParens = ccount(url, '(')\n closingParens = ccount(url, ')')\n\n while (closingParenIndex !== -1 && openingParens > closingParens) {\n url += trail.slice(0, closingParenIndex + 1)\n trail = trail.slice(closingParenIndex + 1)\n closingParenIndex = trail.indexOf(')')\n closingParens++\n }\n }\n\n return [url, trail]\n}\n\n/**\n * @param {RegExpMatchObject} match\n * @param {boolean} [email=false]\n * @returns {boolean}\n */\nfunction previous(match, email) {\n const code = match.input.charCodeAt(match.index - 1)\n\n return (\n (match.index === 0 ||\n unicodeWhitespace(code) ||\n unicodePunctuation(code)) &&\n (!email || code !== 47)\n )\n}\n","/**\n * @typedef {import('mdast').Association} Association\n */\n\nimport {decodeString} from 'micromark-util-decode-string'\n\n/**\n * The `label` of an association is the string value: character escapes and\n * references work, and casing is intact.\n * The `identifier` is used to match one association to another: controversially,\n * character escapes and references don’t work in this matching: `&copy;` does\n * not match `©`, and `\\+` does not match `+`.\n * But casing is ignored (and whitespace) is trimmed and collapsed: ` A\\nb`\n * matches `a b`.\n * So, we do prefer the label when figuring out how we’re going to serialize:\n * it has whitespace, casing, and we can ignore most useless character escapes\n * and all character references.\n *\n * @param {Association} node\n * @returns {string}\n */\nexport function association(node) {\n if (node.label || !node.identifier) {\n return node.label || ''\n }\n\n return decodeString(node.identifier)\n}\n","/**\n * @typedef {import('unist').Point} Point\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * Functions to track output positions.\n * This info isn’t used yet but suchs functionality allows line wrapping,\n * and theoretically source maps (though, is there practical use in that?).\n *\n * @param {TrackFields} options_\n */\nexport function track(options_) {\n // Defaults are used to prevent crashes when older utilities somehow activate\n // this code.\n /* c8 ignore next 5 */\n const options = options_ || {}\n const now = options.now || {}\n let lineShift = options.lineShift || 0\n let line = now.line || 1\n let column = now.column || 1\n\n return {move, current, shift}\n\n /**\n * Get the current tracked info.\n *\n * @returns {{now: Point, lineShift: number}}\n */\n function current() {\n return {now: {line, column}, lineShift}\n }\n\n /**\n * Define an increased line shift (the typical indent for lines).\n *\n * @param {number} value\n */\n function shift(value) {\n lineShift += value\n }\n\n /**\n * Move past a string.\n *\n * @param {string} value\n * @returns {string}\n */\n function move(value = '') {\n const chunks = value.split(/\\r?\\n|\\r/g)\n const tail = chunks[chunks.length - 1]\n line += chunks.length - 1\n column =\n chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift\n return value\n }\n}\n","/**\n * @typedef {import('../types.js').Node} Node\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').Join} Join\n * @typedef {import('../types.js').Context} Context\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\nimport {track} from './track.js'\n\n/**\n * @param {Parent} parent\n * @param {Context} context\n * @param {TrackFields} safeOptions\n * @returns {string}\n */\nexport function containerFlow(parent, context, safeOptions) {\n const indexStack = context.indexStack\n const children = parent.children || []\n const tracker = track(safeOptions)\n /** @type {Array<string>} */\n const results = []\n let index = -1\n\n indexStack.push(-1)\n\n while (++index < children.length) {\n const child = children[index]\n\n indexStack[indexStack.length - 1] = index\n\n results.push(\n tracker.move(\n context.handle(child, parent, context, {\n before: '\\n',\n after: '\\n',\n ...tracker.current()\n })\n )\n )\n\n if (child.type !== 'list') {\n context.bulletLastUsed = undefined\n }\n\n if (index < children.length - 1) {\n results.push(tracker.move(between(child, children[index + 1])))\n }\n }\n\n indexStack.pop()\n\n return results.join('')\n\n /**\n * @param {Node} left\n * @param {Node} right\n * @returns {string}\n */\n function between(left, right) {\n let index = context.join.length\n\n while (index--) {\n const result = context.join[index](left, right, parent, context)\n\n if (result === true || result === 1) {\n break\n }\n\n if (typeof result === 'number') {\n return '\\n'.repeat(1 + result)\n }\n\n if (result === false) {\n return '\\n\\n<!---->\\n\\n'\n }\n }\n\n return '\\n\\n'\n }\n}\n","/**\n * @callback Map\n * @param {string} value\n * @param {number} line\n * @param {boolean} blank\n * @returns {string}\n */\n\nconst eol = /\\r?\\n|\\r/g\n\n/**\n * @param {string} value\n * @param {Map} map\n * @returns {string}\n */\nexport function indentLines(value, map) {\n /** @type {Array<string>} */\n const result = []\n let start = 0\n let line = 0\n /** @type {RegExpExecArray|null} */\n let match\n\n while ((match = eol.exec(value))) {\n one(value.slice(start, match.index))\n result.push(match[0])\n start = match.index + match[0].length\n line++\n }\n\n one(value.slice(start))\n\n return result.join('')\n\n /**\n * @param {string} value\n */\n function one(value) {\n result.push(map(value, line, !value))\n }\n}\n","/**\n * @typedef {import('../types.js').Unsafe} Unsafe\n */\n\n/**\n * @param {Unsafe} pattern\n * @returns {RegExp}\n */\nexport function patternCompile(pattern) {\n if (!pattern._compiled) {\n const before =\n (pattern.atBreak ? '[\\\\r\\\\n][\\\\t ]*' : '') +\n (pattern.before ? '(?:' + pattern.before + ')' : '')\n\n pattern._compiled = new RegExp(\n (before ? '(' + before + ')' : '') +\n (/[|\\\\{}()[\\]^$+*?.-]/.test(pattern.character) ? '\\\\' : '') +\n pattern.character +\n (pattern.after ? '(?:' + pattern.after + ')' : ''),\n 'g'\n )\n }\n\n return pattern._compiled\n}\n","/**\n * @typedef {import('../types.js').Unsafe} Unsafe\n */\n\n/**\n * @param {Array<string>} stack\n * @param {Unsafe} pattern\n * @returns {boolean}\n */\nexport function patternInScope(stack, pattern) {\n return (\n listInScope(stack, pattern.inConstruct, true) &&\n !listInScope(stack, pattern.notInConstruct, false)\n )\n}\n\n/**\n * @param {Array<string>} stack\n * @param {Unsafe['inConstruct']} list\n * @param {boolean} none\n * @returns {boolean}\n */\nfunction listInScope(stack, list, none) {\n if (!list) {\n return none\n }\n\n if (typeof list === 'string') {\n list = [list]\n }\n\n let index = -1\n\n while (++index < list.length) {\n if (stack.includes(list[index])) {\n return true\n }\n }\n\n return false\n}\n","/**\n * @typedef {import('../types.js').Context} Context\n * @typedef {import('../types.js').SafeOptions} SafeOptions\n */\n\nimport {patternCompile} from './pattern-compile.js'\nimport {patternInScope} from './pattern-in-scope.js'\n\n/**\n * @param {Context} context\n * @param {string|null|undefined} input\n * @param {SafeOptions & {encode?: Array<string>}} config\n * @returns {string}\n */\nexport function safe(context, input, config) {\n const value = (config.before || '') + (input || '') + (config.after || '')\n /** @type {Array<number>} */\n const positions = []\n /** @type {Array<string>} */\n const result = []\n /** @type {Record<number, {before: boolean, after: boolean}>} */\n const infos = {}\n let index = -1\n\n while (++index < context.unsafe.length) {\n const pattern = context.unsafe[index]\n\n if (!patternInScope(context.stack, pattern)) {\n continue\n }\n\n const expression = patternCompile(pattern)\n /** @type {RegExpExecArray|null} */\n let match\n\n while ((match = expression.exec(value))) {\n const before = 'before' in pattern || Boolean(pattern.atBreak)\n const after = 'after' in pattern\n const position = match.index + (before ? match[1].length : 0)\n\n if (positions.includes(position)) {\n if (infos[position].before && !before) {\n infos[position].before = false\n }\n\n if (infos[position].after && !after) {\n infos[position].after = false\n }\n } else {\n positions.push(position)\n infos[position] = {before, after}\n }\n }\n }\n\n positions.sort(numerical)\n\n let start = config.before ? config.before.length : 0\n const end = value.length - (config.after ? config.after.length : 0)\n index = -1\n\n while (++index < positions.length) {\n const position = positions[index]\n\n // Character before or after matched:\n if (position < start || position >= end) {\n continue\n }\n\n // If this character is supposed to be escaped because it has a condition on\n // the next character, and the next character is definitly being escaped,\n // then skip this escape.\n if (\n (position + 1 < end &&\n positions[index + 1] === position + 1 &&\n infos[position].after &&\n !infos[position + 1].before &&\n !infos[position + 1].after) ||\n (positions[index - 1] === position - 1 &&\n infos[position].before &&\n !infos[position - 1].before &&\n !infos[position - 1].after)\n ) {\n continue\n }\n\n if (start !== position) {\n // If we have to use a character reference, an ampersand would be more\n // correct, but as backslashes only care about punctuation, either will\n // do the trick\n result.push(escapeBackslashes(value.slice(start, position), '\\\\'))\n }\n\n start = position\n\n if (\n /[!-/:-@[-`{-~]/.test(value.charAt(position)) &&\n (!config.encode || !config.encode.includes(value.charAt(position)))\n ) {\n // Character escape.\n result.push('\\\\')\n } else {\n // Character reference.\n result.push(\n '&#x' + value.charCodeAt(position).toString(16).toUpperCase() + ';'\n )\n start++\n }\n }\n\n result.push(escapeBackslashes(value.slice(start, end), config.after))\n\n return result.join('')\n}\n\n/**\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction numerical(a, b) {\n return a - b\n}\n\n/**\n * @param {string} value\n * @param {string} after\n * @returns {string}\n */\nfunction escapeBackslashes(value, after) {\n const expression = /\\\\(?=[!-/:-@[-`{-~])/g\n /** @type {Array<number>} */\n const positions = []\n /** @type {Array<string>} */\n const results = []\n const whole = value + after\n let index = -1\n let start = 0\n /** @type {RegExpExecArray|null} */\n let match\n\n while ((match = expression.exec(whole))) {\n positions.push(match.index)\n }\n\n while (++index < positions.length) {\n if (start !== positions[index]) {\n results.push(value.slice(start, positions[index]))\n }\n\n results.push('\\\\')\n start = positions[index]\n }\n\n results.push(value.slice(start))\n\n return results.join('')\n}\n","/**\n * @typedef {import('mdast').FootnoteReference} FootnoteReference\n * @typedef {import('mdast').FootnoteDefinition} FootnoteDefinition\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Map} Map\n */\n\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {association} from 'mdast-util-to-markdown/lib/util/association.js'\nimport {containerFlow} from 'mdast-util-to-markdown/lib/util/container-flow.js'\nimport {indentLines} from 'mdast-util-to-markdown/lib/util/indent-lines.js'\nimport {safe} from 'mdast-util-to-markdown/lib/util/safe.js'\nimport {track} from 'mdast-util-to-markdown/lib/util/track.js'\n\n/**\n * @returns {FromMarkdownExtension}\n */\nexport function gfmFootnoteFromMarkdown() {\n return {\n enter: {\n gfmFootnoteDefinition: enterFootnoteDefinition,\n gfmFootnoteDefinitionLabelString: enterFootnoteDefinitionLabelString,\n gfmFootnoteCall: enterFootnoteCall,\n gfmFootnoteCallString: enterFootnoteCallString\n },\n exit: {\n gfmFootnoteDefinition: exitFootnoteDefinition,\n gfmFootnoteDefinitionLabelString: exitFootnoteDefinitionLabelString,\n gfmFootnoteCall: exitFootnoteCall,\n gfmFootnoteCallString: exitFootnoteCallString\n }\n }\n\n /** @type {FromMarkdownHandle} */\n function enterFootnoteDefinition(token) {\n this.enter(\n {type: 'footnoteDefinition', identifier: '', label: '', children: []},\n token\n )\n }\n\n /** @type {FromMarkdownHandle} */\n function enterFootnoteDefinitionLabelString() {\n this.buffer()\n }\n\n /** @type {FromMarkdownHandle} */\n function exitFootnoteDefinitionLabelString(token) {\n const label = this.resume()\n const node = /** @type {FootnoteDefinition} */ (\n this.stack[this.stack.length - 1]\n )\n node.label = label\n node.identifier = normalizeIdentifier(\n this.sliceSerialize(token)\n ).toLowerCase()\n }\n\n /** @type {FromMarkdownHandle} */\n function exitFootnoteDefinition(token) {\n this.exit(token)\n }\n\n /** @type {FromMarkdownHandle} */\n function enterFootnoteCall(token) {\n this.enter({type: 'footnoteReference', identifier: '', label: ''}, token)\n }\n\n /** @type {FromMarkdownHandle} */\n function enterFootnoteCallString() {\n this.buffer()\n }\n\n /** @type {FromMarkdownHandle} */\n function exitFootnoteCallString(token) {\n const label = this.resume()\n const node = /** @type {FootnoteDefinition} */ (\n this.stack[this.stack.length - 1]\n )\n node.label = label\n node.identifier = normalizeIdentifier(\n this.sliceSerialize(token)\n ).toLowerCase()\n }\n\n /** @type {FromMarkdownHandle} */\n function exitFootnoteCall(token) {\n this.exit(token)\n }\n}\n\n/**\n * @returns {ToMarkdownExtension}\n */\nexport function gfmFootnoteToMarkdown() {\n footnoteReference.peek = footnoteReferencePeek\n\n return {\n // This is on by default already.\n unsafe: [{character: '[', inConstruct: ['phrasing', 'label', 'reference']}],\n handlers: {footnoteDefinition, footnoteReference}\n }\n\n /**\n * @type {ToMarkdownHandle}\n * @param {FootnoteReference} node\n */\n function footnoteReference(node, _, context, safeOptions) {\n const tracker = track(safeOptions)\n let value = tracker.move('[^')\n const exit = context.enter('footnoteReference')\n const subexit = context.enter('reference')\n value += tracker.move(\n safe(context, association(node), {\n ...tracker.current(),\n before: value,\n after: ']'\n })\n )\n subexit()\n exit()\n value += tracker.move(']')\n return value\n }\n\n /** @type {ToMarkdownHandle} */\n function footnoteReferencePeek() {\n return '['\n }\n\n /**\n * @type {ToMarkdownHandle}\n * @param {FootnoteDefinition} node\n */\n function footnoteDefinition(node, _, context, safeOptions) {\n const tracker = track(safeOptions)\n let value = tracker.move('[^')\n const exit = context.enter('footnoteDefinition')\n const subexit = context.enter('label')\n value += tracker.move(\n safe(context, association(node), {\n ...tracker.current(),\n before: value,\n after: ']'\n })\n )\n subexit()\n value += tracker.move(\n ']:' + (node.children && node.children.length > 0 ? ' ' : '')\n )\n tracker.shift(4)\n value += tracker.move(\n indentLines(containerFlow(node, context, tracker.current()), map)\n )\n exit()\n\n return value\n\n /** @type {Map} */\n function map(line, index, blank) {\n if (index) {\n return (blank ? '' : ' ') + line\n }\n\n return line\n }\n }\n}\n","/**\n * @typedef {import('unist').Point} Point\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * Functions to track output positions.\n * This info isn’t used yet but suchs functionality allows line wrapping,\n * and theoretically source maps (though, is there practical use in that?).\n *\n * @param {TrackFields} options_\n */\nexport function track(options_) {\n // Defaults are used to prevent crashes when older utilities somehow activate\n // this code.\n /* c8 ignore next 5 */\n const options = options_ || {}\n const now = options.now || {}\n let lineShift = options.lineShift || 0\n let line = now.line || 1\n let column = now.column || 1\n\n return {move, current, shift}\n\n /**\n * Get the current tracked info.\n *\n * @returns {{now: Point, lineShift: number}}\n */\n function current() {\n return {now: {line, column}, lineShift}\n }\n\n /**\n * Define an increased line shift (the typical indent for lines).\n *\n * @param {number} value\n */\n function shift(value) {\n lineShift += value\n }\n\n /**\n * Move past a string.\n *\n * @param {string} value\n * @returns {string}\n */\n function move(value = '') {\n const chunks = value.split(/\\r?\\n|\\r/g)\n const tail = chunks[chunks.length - 1]\n line += chunks.length - 1\n column =\n chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift\n return value\n }\n}\n","/**\n * @typedef {import('mdast').Delete} Delete\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n */\n\nimport {containerPhrasing} from 'mdast-util-to-markdown/lib/util/container-phrasing.js'\nimport {track} from 'mdast-util-to-markdown/lib/util/track.js'\n\n/** @type {FromMarkdownExtension} */\nexport const gfmStrikethroughFromMarkdown = {\n canContainEols: ['delete'],\n enter: {strikethrough: enterStrikethrough},\n exit: {strikethrough: exitStrikethrough}\n}\n\n/** @type {ToMarkdownExtension} */\nexport const gfmStrikethroughToMarkdown = {\n unsafe: [{character: '~', inConstruct: 'phrasing'}],\n handlers: {delete: handleDelete}\n}\n\nhandleDelete.peek = peekDelete\n\n/** @type {FromMarkdownHandle} */\nfunction enterStrikethrough(token) {\n this.enter({type: 'delete', children: []}, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitStrikethrough(token) {\n this.exit(token)\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {Delete} node\n */\nfunction handleDelete(node, _, context, safeOptions) {\n const tracker = track(safeOptions)\n const exit = context.enter('emphasis')\n let value = tracker.move('~~')\n value += containerPhrasing(node, context, {\n ...tracker.current(),\n before: value,\n after: '~'\n })\n value += tracker.move('~~')\n exit()\n return value\n}\n\n/** @type {ToMarkdownHandle} */\nfunction peekDelete() {\n return '~'\n}\n","/**\n * @typedef {import('../types.js').Node} Node\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').SafeOptions} SafeOptions\n * @typedef {import('../types.js').Context} Context\n */\n\nimport {track} from './track.js'\n\n/**\n * @param {Parent} parent\n * @param {Context} context\n * @param {SafeOptions} safeOptions\n * @returns {string}\n */\nexport function containerPhrasing(parent, context, safeOptions) {\n const indexStack = context.indexStack\n const children = parent.children || []\n /** @type {Array<string>} */\n const results = []\n let index = -1\n let before = safeOptions.before\n\n indexStack.push(-1)\n let tracker = track(safeOptions)\n\n while (++index < children.length) {\n const child = children[index]\n /** @type {string} */\n let after\n\n indexStack[indexStack.length - 1] = index\n\n if (index + 1 < children.length) {\n // @ts-expect-error: hush, it’s actually a `zwitch`.\n let handle = context.handle.handlers[children[index + 1].type]\n if (handle && handle.peek) handle = handle.peek\n after = handle\n ? handle(children[index + 1], parent, context, {\n before: '',\n after: '',\n ...tracker.current()\n }).charAt(0)\n : ''\n } else {\n after = safeOptions.after\n }\n\n // In some cases, html (text) can be found in phrasing right after an eol.\n // When we’d serialize that, in most cases that would be seen as html\n // (flow).\n // As we can’t escape or so to prevent it from happening, we take a somewhat\n // reasonable approach: replace that eol with a space.\n // See: <https://github.com/syntax-tree/mdast-util-to-markdown/issues/15>\n if (\n results.length > 0 &&\n (before === '\\r' || before === '\\n') &&\n child.type === 'html'\n ) {\n results[results.length - 1] = results[results.length - 1].replace(\n /(\\r?\\n|\\r)$/,\n ' '\n )\n before = ' '\n\n // To do: does this work to reset tracker?\n tracker = track(safeOptions)\n tracker.move(results.join(''))\n }\n\n results.push(\n tracker.move(\n context.handle(child, parent, context, {\n ...tracker.current(),\n before,\n after\n })\n )\n )\n\n before = results[results.length - 1].slice(-1)\n }\n\n indexStack.pop()\n\n return results.join('')\n}\n","/**\n * @typedef {import('unist').Point} Point\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * Functions to track output positions.\n * This info isn’t used yet but suchs functionality allows line wrapping,\n * and theoretically source maps (though, is there practical use in that?).\n *\n * @param {TrackFields} options_\n */\nexport function track(options_) {\n // Defaults are used to prevent crashes when older utilities somehow activate\n // this code.\n /* c8 ignore next 5 */\n const options = options_ || {}\n const now = options.now || {}\n let lineShift = options.lineShift || 0\n let line = now.line || 1\n let column = now.column || 1\n\n return {move, current, shift}\n\n /**\n * Get the current tracked info.\n *\n * @returns {{now: Point, lineShift: number}}\n */\n function current() {\n return {now: {line, column}, lineShift}\n }\n\n /**\n * Define an increased line shift (the typical indent for lines).\n *\n * @param {number} value\n */\n function shift(value) {\n lineShift += value\n }\n\n /**\n * Move past a string.\n *\n * @param {string} value\n * @returns {string}\n */\n function move(value = '') {\n const chunks = value.split(/\\r?\\n|\\r/g)\n const tail = chunks[chunks.length - 1]\n line += chunks.length - 1\n column =\n chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift\n return value\n }\n}\n","/**\n * @typedef {import('../types.js').Unsafe} Unsafe\n */\n\n/**\n * @param {Unsafe} pattern\n * @returns {RegExp}\n */\nexport function patternCompile(pattern) {\n if (!pattern._compiled) {\n const before =\n (pattern.atBreak ? '[\\\\r\\\\n][\\\\t ]*' : '') +\n (pattern.before ? '(?:' + pattern.before + ')' : '')\n\n pattern._compiled = new RegExp(\n (before ? '(' + before + ')' : '') +\n (/[|\\\\{}()[\\]^$+*?.-]/.test(pattern.character) ? '\\\\' : '') +\n pattern.character +\n (pattern.after ? '(?:' + pattern.after + ')' : ''),\n 'g'\n )\n }\n\n return pattern._compiled\n}\n","/**\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('../types.js').Handle} Handle\n */\n\nimport {patternCompile} from '../util/pattern-compile.js'\n\ninlineCode.peek = inlineCodePeek\n\n/**\n * @type {Handle}\n * @param {InlineCode} node\n */\nexport function inlineCode(node, _, context) {\n let value = node.value || ''\n let sequence = '`'\n let index = -1\n\n // If there is a single grave accent on its own in the code, use a fence of\n // two.\n // If there are two in a row, use one.\n while (new RegExp('(^|[^`])' + sequence + '([^`]|$)').test(value)) {\n sequence += '`'\n }\n\n // If this is not just spaces or eols (tabs don’t count), and either the\n // first or last character are a space, eol, or tick, then pad with spaces.\n if (\n /[^ \\r\\n]/.test(value) &&\n ((/^[ \\r\\n]/.test(value) && /[ \\r\\n]$/.test(value)) || /^`|`$/.test(value))\n ) {\n value = ' ' + value + ' '\n }\n\n // We have a potential problem: certain characters after eols could result in\n // blocks being seen.\n // For example, if someone injected the string `'\\n# b'`, then that would\n // result in an ATX heading.\n // We can’t escape characters in `inlineCode`, but because eols are\n // transformed to spaces when going from markdown to HTML anyway, we can swap\n // them out.\n while (++index < context.unsafe.length) {\n const pattern = context.unsafe[index]\n const expression = patternCompile(pattern)\n /** @type {RegExpExecArray|null} */\n let match\n\n // Only look for `atBreak`s.\n // Btw: note that `atBreak` patterns will always start the regex at LF or\n // CR.\n if (!pattern.atBreak) continue\n\n while ((match = expression.exec(value))) {\n let position = match.index\n\n // Support CRLF (patterns only look for one of the characters).\n if (\n value.charCodeAt(position) === 10 /* `\\n` */ &&\n value.charCodeAt(position - 1) === 13 /* `\\r` */\n ) {\n position--\n }\n\n value = value.slice(0, position) + ' ' + value.slice(match.index + 1)\n }\n }\n\n return sequence + value + sequence\n}\n\n/**\n * @type {Handle}\n */\nfunction inlineCodePeek() {\n return '`'\n}\n","/**\n * @typedef Options\n * Configuration (optional).\n * @property {string|null|Array<string|null|undefined>} [align]\n * One style for all columns, or styles for their respective columns.\n * Each style is either `'l'` (left), `'r'` (right), or `'c'` (center).\n * Other values are treated as `''`, which doesn’t place the colon in the\n * alignment row but does align left.\n * *Only the lowercased first character is used, so `Right` is fine.*\n * @property {boolean} [padding=true]\n * Whether to add a space of padding between delimiters and cells.\n *\n * When `true`, there is padding:\n *\n * ```markdown\n * | Alpha | B |\n * | ----- | ----- |\n * | C | Delta |\n * ```\n *\n * When `false`, there is no padding:\n *\n * ```markdown\n * |Alpha|B |\n * |-----|-----|\n * |C |Delta|\n * ```\n * @property {boolean} [delimiterStart=true]\n * Whether to begin each row with the delimiter.\n *\n * > 👉 **Note**: please don’t use this: it could create fragile structures\n * > that aren’t understandable to some markdown parsers.\n *\n * When `true`, there are starting delimiters:\n *\n * ```markdown\n * | Alpha | B |\n * | ----- | ----- |\n * | C | Delta |\n * ```\n *\n * When `false`, there are no starting delimiters:\n *\n * ```markdown\n * Alpha | B |\n * ----- | ----- |\n * C | Delta |\n * ```\n * @property {boolean} [delimiterEnd=true]\n * Whether to end each row with the delimiter.\n *\n * > 👉 **Note**: please don’t use this: it could create fragile structures\n * > that aren’t understandable to some markdown parsers.\n *\n * When `true`, there are ending delimiters:\n *\n * ```markdown\n * | Alpha | B |\n * | ----- | ----- |\n * | C | Delta |\n * ```\n *\n * When `false`, there are no ending delimiters:\n *\n * ```markdown\n * | Alpha | B\n * | ----- | -----\n * | C | Delta\n * ```\n * @property {boolean} [alignDelimiters=true]\n * Whether to align the delimiters.\n * By default, they are aligned:\n *\n * ```markdown\n * | Alpha | B |\n * | ----- | ----- |\n * | C | Delta |\n * ```\n *\n * Pass `false` to make them staggered:\n *\n * ```markdown\n * | Alpha | B |\n * | - | - |\n * | C | Delta |\n * ```\n * @property {(value: string) => number} [stringLength]\n * Function to detect the length of table cell content.\n * This is used when aligning the delimiters (`|`) between table cells.\n * Full-width characters and emoji mess up delimiter alignment when viewing\n * the markdown source.\n * To fix this, you can pass this function, which receives the cell content\n * and returns its “visible” size.\n * Note that what is and isn’t visible depends on where the text is displayed.\n *\n * Without such a function, the following:\n *\n * ```js\n * markdownTable([\n * ['Alpha', 'Bravo'],\n * ['中文', 'Charlie'],\n * ['👩‍❤️‍👩', 'Delta']\n * ])\n * ```\n *\n * Yields:\n *\n * ```markdown\n * | Alpha | Bravo |\n * | - | - |\n * | 中文 | Charlie |\n * | 👩‍❤️‍👩 | Delta |\n * ```\n *\n * With [`string-width`](https://github.com/sindresorhus/string-width):\n *\n * ```js\n * import stringWidth from 'string-width'\n *\n * markdownTable(\n * [\n * ['Alpha', 'Bravo'],\n * ['中文', 'Charlie'],\n * ['👩‍❤️‍👩', 'Delta']\n * ],\n * {stringLength: stringWidth}\n * )\n * ```\n *\n * Yields:\n *\n * ```markdown\n * | Alpha | Bravo |\n * | ----- | ------- |\n * | 中文 | Charlie |\n * | 👩‍❤️‍👩 | Delta |\n * ```\n */\n\n/**\n * @typedef {Options} MarkdownTableOptions\n * @todo\n * Remove next major.\n */\n\n/**\n * Generate a markdown ([GFM](https://docs.github.com/en/github/writing-on-github/working-with-advanced-formatting/organizing-information-with-tables)) table..\n *\n * @param {Array<Array<string|null|undefined>>} table\n * Table data (matrix of strings).\n * @param {Options} [options]\n * Configuration (optional).\n * @returns {string}\n */\nexport function markdownTable(table, options = {}) {\n const align = (options.align || []).concat()\n const stringLength = options.stringLength || defaultStringLength\n /** @type {Array<number>} Character codes as symbols for alignment per column. */\n const alignments = []\n /** @type {Array<Array<string>>} Cells per row. */\n const cellMatrix = []\n /** @type {Array<Array<number>>} Sizes of each cell per row. */\n const sizeMatrix = []\n /** @type {Array<number>} */\n const longestCellByColumn = []\n let mostCellsPerRow = 0\n let rowIndex = -1\n\n // This is a superfluous loop if we don’t align delimiters, but otherwise we’d\n // do superfluous work when aligning, so optimize for aligning.\n while (++rowIndex < table.length) {\n /** @type {Array<string>} */\n const row = []\n /** @type {Array<number>} */\n const sizes = []\n let columnIndex = -1\n\n if (table[rowIndex].length > mostCellsPerRow) {\n mostCellsPerRow = table[rowIndex].length\n }\n\n while (++columnIndex < table[rowIndex].length) {\n const cell = serialize(table[rowIndex][columnIndex])\n\n if (options.alignDelimiters !== false) {\n const size = stringLength(cell)\n sizes[columnIndex] = size\n\n if (\n longestCellByColumn[columnIndex] === undefined ||\n size > longestCellByColumn[columnIndex]\n ) {\n longestCellByColumn[columnIndex] = size\n }\n }\n\n row.push(cell)\n }\n\n cellMatrix[rowIndex] = row\n sizeMatrix[rowIndex] = sizes\n }\n\n // Figure out which alignments to use.\n let columnIndex = -1\n\n if (typeof align === 'object' && 'length' in align) {\n while (++columnIndex < mostCellsPerRow) {\n alignments[columnIndex] = toAlignment(align[columnIndex])\n }\n } else {\n const code = toAlignment(align)\n\n while (++columnIndex < mostCellsPerRow) {\n alignments[columnIndex] = code\n }\n }\n\n // Inject the alignment row.\n columnIndex = -1\n /** @type {Array<string>} */\n const row = []\n /** @type {Array<number>} */\n const sizes = []\n\n while (++columnIndex < mostCellsPerRow) {\n const code = alignments[columnIndex]\n let before = ''\n let after = ''\n\n if (code === 99 /* `c` */) {\n before = ':'\n after = ':'\n } else if (code === 108 /* `l` */) {\n before = ':'\n } else if (code === 114 /* `r` */) {\n after = ':'\n }\n\n // There *must* be at least one hyphen-minus in each alignment cell.\n let size =\n options.alignDelimiters === false\n ? 1\n : Math.max(\n 1,\n longestCellByColumn[columnIndex] - before.length - after.length\n )\n\n const cell = before + '-'.repeat(size) + after\n\n if (options.alignDelimiters !== false) {\n size = before.length + size + after.length\n\n if (size > longestCellByColumn[columnIndex]) {\n longestCellByColumn[columnIndex] = size\n }\n\n sizes[columnIndex] = size\n }\n\n row[columnIndex] = cell\n }\n\n // Inject the alignment row.\n cellMatrix.splice(1, 0, row)\n sizeMatrix.splice(1, 0, sizes)\n\n rowIndex = -1\n /** @type {Array<string>} */\n const lines = []\n\n while (++rowIndex < cellMatrix.length) {\n const row = cellMatrix[rowIndex]\n const sizes = sizeMatrix[rowIndex]\n columnIndex = -1\n /** @type {Array<string>} */\n const line = []\n\n while (++columnIndex < mostCellsPerRow) {\n const cell = row[columnIndex] || ''\n let before = ''\n let after = ''\n\n if (options.alignDelimiters !== false) {\n const size =\n longestCellByColumn[columnIndex] - (sizes[columnIndex] || 0)\n const code = alignments[columnIndex]\n\n if (code === 114 /* `r` */) {\n before = ' '.repeat(size)\n } else if (code === 99 /* `c` */) {\n if (size % 2) {\n before = ' '.repeat(size / 2 + 0.5)\n after = ' '.repeat(size / 2 - 0.5)\n } else {\n before = ' '.repeat(size / 2)\n after = before\n }\n } else {\n after = ' '.repeat(size)\n }\n }\n\n if (options.delimiterStart !== false && !columnIndex) {\n line.push('|')\n }\n\n if (\n options.padding !== false &&\n // Don’t add the opening space if we’re not aligning and the cell is\n // empty: there will be a closing space.\n !(options.alignDelimiters === false && cell === '') &&\n (options.delimiterStart !== false || columnIndex)\n ) {\n line.push(' ')\n }\n\n if (options.alignDelimiters !== false) {\n line.push(before)\n }\n\n line.push(cell)\n\n if (options.alignDelimiters !== false) {\n line.push(after)\n }\n\n if (options.padding !== false) {\n line.push(' ')\n }\n\n if (\n options.delimiterEnd !== false ||\n columnIndex !== mostCellsPerRow - 1\n ) {\n line.push('|')\n }\n }\n\n lines.push(\n options.delimiterEnd === false\n ? line.join('').replace(/ +$/, '')\n : line.join('')\n )\n }\n\n return lines.join('\\n')\n}\n\n/**\n * @param {string|null|undefined} [value]\n * @returns {string}\n */\nfunction serialize(value) {\n return value === null || value === undefined ? '' : String(value)\n}\n\n/**\n * @param {string} value\n * @returns {number}\n */\nfunction defaultStringLength(value) {\n return value.length\n}\n\n/**\n * @param {string|null|undefined} value\n * @returns {number}\n */\nfunction toAlignment(value) {\n const code = typeof value === 'string' ? value.codePointAt(0) : 0\n\n return code === 67 /* `C` */ || code === 99 /* `c` */\n ? 99 /* `c` */\n : code === 76 /* `L` */ || code === 108 /* `l` */\n ? 108 /* `l` */\n : code === 82 /* `R` */ || code === 114 /* `r` */\n ? 114 /* `r` */\n : 0\n}\n","/**\n * @typedef {import('mdast').AlignType} AlignType\n * @typedef {import('mdast').Table} Table\n * @typedef {import('mdast').TableRow} TableRow\n * @typedef {import('mdast').TableCell} TableCell\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('markdown-table').MarkdownTableOptions} MarkdownTableOptions\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Context} ToMarkdownContext\n * @typedef {import('mdast-util-to-markdown').SafeOptions} SafeOptions\n *\n * @typedef Options\n * @property {boolean} [tableCellPadding=true]\n * @property {boolean} [tablePipeAlign=true]\n * @property {MarkdownTableOptions['stringLength']} [stringLength]\n */\n\nimport {containerPhrasing} from 'mdast-util-to-markdown/lib/util/container-phrasing.js'\nimport {inlineCode} from 'mdast-util-to-markdown/lib/handle/inline-code.js'\nimport {markdownTable} from 'markdown-table'\n\n/** @type {FromMarkdownExtension} */\nexport const gfmTableFromMarkdown = {\n enter: {\n table: enterTable,\n tableData: enterCell,\n tableHeader: enterCell,\n tableRow: enterRow\n },\n exit: {\n codeText: exitCodeText,\n table: exitTable,\n tableData: exit,\n tableHeader: exit,\n tableRow: exit\n }\n}\n\n/** @type {FromMarkdownHandle} */\nfunction enterTable(token) {\n /** @type {Array<'left'|'right'|'center'|'none'>} */\n // @ts-expect-error: `align` is custom.\n const align = token._align\n this.enter(\n {\n type: 'table',\n align: align.map((d) => (d === 'none' ? null : d)),\n children: []\n },\n token\n )\n this.setData('inTable', true)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitTable(token) {\n this.exit(token)\n this.setData('inTable')\n}\n\n/** @type {FromMarkdownHandle} */\nfunction enterRow(token) {\n this.enter({type: 'tableRow', children: []}, token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exit(token) {\n this.exit(token)\n}\n\n/** @type {FromMarkdownHandle} */\nfunction enterCell(token) {\n this.enter({type: 'tableCell', children: []}, token)\n}\n\n// Overwrite the default code text data handler to unescape escaped pipes when\n// they are in tables.\n/** @type {FromMarkdownHandle} */\nfunction exitCodeText(token) {\n let value = this.resume()\n\n if (this.getData('inTable')) {\n value = value.replace(/\\\\([\\\\|])/g, replace)\n }\n\n const node = /** @type {InlineCode} */ (this.stack[this.stack.length - 1])\n node.value = value\n this.exit(token)\n}\n\n/**\n * @param {string} $0\n * @param {string} $1\n * @returns {string}\n */\nfunction replace($0, $1) {\n // Pipes work, backslashes don’t (but can’t escape pipes).\n return $1 === '|' ? $1 : $0\n}\n\n/**\n * @param {Options} [options]\n * @returns {ToMarkdownExtension}\n */\nexport function gfmTableToMarkdown(options) {\n const settings = options || {}\n const padding = settings.tableCellPadding\n const alignDelimiters = settings.tablePipeAlign\n const stringLength = settings.stringLength\n const around = padding ? ' ' : '|'\n\n return {\n unsafe: [\n {character: '\\r', inConstruct: 'tableCell'},\n {character: '\\n', inConstruct: 'tableCell'},\n // A pipe, when followed by a tab or space (padding), or a dash or colon\n // (unpadded delimiter row), could result in a table.\n {atBreak: true, character: '|', after: '[\\t :-]'},\n // A pipe in a cell must be encoded.\n {character: '|', inConstruct: 'tableCell'},\n // A colon must be followed by a dash, in which case it could start a\n // delimiter row.\n {atBreak: true, character: ':', after: '-'},\n // A delimiter row can also start with a dash, when followed by more\n // dashes, a colon, or a pipe.\n // This is a stricter version than the built in check for lists, thematic\n // breaks, and setex heading underlines though:\n // <https://github.com/syntax-tree/mdast-util-to-markdown/blob/51a2038/lib/unsafe.js#L57>\n {atBreak: true, character: '-', after: '[:|-]'}\n ],\n handlers: {\n table: handleTable,\n tableRow: handleTableRow,\n tableCell: handleTableCell,\n inlineCode: inlineCodeWithTable\n }\n }\n\n /**\n * @type {ToMarkdownHandle}\n * @param {Table} node\n */\n function handleTable(node, _, context, safeOptions) {\n return serializeData(\n handleTableAsData(node, context, safeOptions),\n // @ts-expect-error: fixed in `markdown-table@3.0.1`.\n node.align\n )\n }\n\n /**\n * This function isn’t really used normally, because we handle rows at the\n * table level.\n * But, if someone passes in a table row, this ensures we make somewhat sense.\n *\n * @type {ToMarkdownHandle}\n * @param {TableRow} node\n */\n function handleTableRow(node, _, context, safeOptions) {\n const row = handleTableRowAsData(node, context, safeOptions)\n // `markdown-table` will always add an align row\n const value = serializeData([row])\n return value.slice(0, value.indexOf('\\n'))\n }\n\n /**\n * @type {ToMarkdownHandle}\n * @param {TableCell} node\n */\n function handleTableCell(node, _, context, safeOptions) {\n const exit = context.enter('tableCell')\n const subexit = context.enter('phrasing')\n const value = containerPhrasing(node, context, {\n ...safeOptions,\n before: around,\n after: around\n })\n subexit()\n exit()\n return value\n }\n\n /**\n * @param {Array<Array<string>>} matrix\n * @param {Array<string>} [align]\n */\n function serializeData(matrix, align) {\n return markdownTable(matrix, {\n align,\n alignDelimiters,\n padding,\n stringLength\n })\n }\n\n /**\n * @param {Table} node\n * @param {ToMarkdownContext} context\n * @param {SafeOptions} safeOptions\n */\n function handleTableAsData(node, context, safeOptions) {\n const children = node.children\n let index = -1\n /** @type {Array<Array<string>>} */\n const result = []\n const subexit = context.enter('table')\n\n while (++index < children.length) {\n result[index] = handleTableRowAsData(\n children[index],\n context,\n safeOptions\n )\n }\n\n subexit()\n\n return result\n }\n\n /**\n * @param {TableRow} node\n * @param {ToMarkdownContext} context\n * @param {SafeOptions} safeOptions\n */\n function handleTableRowAsData(node, context, safeOptions) {\n const children = node.children\n let index = -1\n /** @type {Array<string>} */\n const result = []\n const subexit = context.enter('tableRow')\n\n while (++index < children.length) {\n // Note: the positional info as used here is incorrect.\n // Making it correct would be impossible due to aligning cells?\n // And it would need copy/pasting `markdown-table` into this project.\n result[index] = handleTableCell(\n children[index],\n node,\n context,\n safeOptions\n )\n }\n\n subexit()\n\n return result\n }\n\n /**\n * @type {ToMarkdownHandle}\n * @param {InlineCode} node\n */\n function inlineCodeWithTable(node, parent, context) {\n let value = inlineCode(node, parent, context)\n\n if (context.stack.includes('tableCell')) {\n value = value.replace(/\\|/g, '\\\\$&')\n }\n\n return value\n }\n}\n","/**\n * @typedef {import('../types.js').Node} Node\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').SafeOptions} SafeOptions\n * @typedef {import('../types.js').Context} Context\n */\n\nimport {track} from './track.js'\n\n/**\n * @param {Parent} parent\n * @param {Context} context\n * @param {SafeOptions} safeOptions\n * @returns {string}\n */\nexport function containerPhrasing(parent, context, safeOptions) {\n const indexStack = context.indexStack\n const children = parent.children || []\n /** @type {Array<string>} */\n const results = []\n let index = -1\n let before = safeOptions.before\n\n indexStack.push(-1)\n let tracker = track(safeOptions)\n\n while (++index < children.length) {\n const child = children[index]\n /** @type {string} */\n let after\n\n indexStack[indexStack.length - 1] = index\n\n if (index + 1 < children.length) {\n // @ts-expect-error: hush, it’s actually a `zwitch`.\n let handle = context.handle.handlers[children[index + 1].type]\n if (handle && handle.peek) handle = handle.peek\n after = handle\n ? handle(children[index + 1], parent, context, {\n before: '',\n after: '',\n ...tracker.current()\n }).charAt(0)\n : ''\n } else {\n after = safeOptions.after\n }\n\n // In some cases, html (text) can be found in phrasing right after an eol.\n // When we’d serialize that, in most cases that would be seen as html\n // (flow).\n // As we can’t escape or so to prevent it from happening, we take a somewhat\n // reasonable approach: replace that eol with a space.\n // See: <https://github.com/syntax-tree/mdast-util-to-markdown/issues/15>\n if (\n results.length > 0 &&\n (before === '\\r' || before === '\\n') &&\n child.type === 'html'\n ) {\n results[results.length - 1] = results[results.length - 1].replace(\n /(\\r?\\n|\\r)$/,\n ' '\n )\n before = ' '\n\n // To do: does this work to reset tracker?\n tracker = track(safeOptions)\n tracker.move(results.join(''))\n }\n\n results.push(\n tracker.move(\n context.handle(child, parent, context, {\n ...tracker.current(),\n before,\n after\n })\n )\n )\n\n before = results[results.length - 1].slice(-1)\n }\n\n indexStack.pop()\n\n return results.join('')\n}\n","/**\n * @typedef {import('unist').Point} Point\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * Functions to track output positions.\n * This info isn’t used yet but suchs functionality allows line wrapping,\n * and theoretically source maps (though, is there practical use in that?).\n *\n * @param {TrackFields} options_\n */\nexport function track(options_) {\n // Defaults are used to prevent crashes when older utilities somehow activate\n // this code.\n /* c8 ignore next 5 */\n const options = options_ || {}\n const now = options.now || {}\n let lineShift = options.lineShift || 0\n let line = now.line || 1\n let column = now.column || 1\n\n return {move, current, shift}\n\n /**\n * Get the current tracked info.\n *\n * @returns {{now: Point, lineShift: number}}\n */\n function current() {\n return {now: {line, column}, lineShift}\n }\n\n /**\n * Define an increased line shift (the typical indent for lines).\n *\n * @param {number} value\n */\n function shift(value) {\n lineShift += value\n }\n\n /**\n * Move past a string.\n *\n * @param {string} value\n * @returns {string}\n */\n function move(value = '') {\n const chunks = value.split(/\\r?\\n|\\r/g)\n const tail = chunks[chunks.length - 1]\n line += chunks.length - 1\n column =\n chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift\n return value\n }\n}\n","/**\n * @callback Map\n * @param {string} value\n * @param {number} line\n * @param {boolean} blank\n * @returns {string}\n */\n\nconst eol = /\\r?\\n|\\r/g\n\n/**\n * @param {string} value\n * @param {Map} map\n * @returns {string}\n */\nexport function indentLines(value, map) {\n /** @type {Array<string>} */\n const result = []\n let start = 0\n let line = 0\n /** @type {RegExpExecArray|null} */\n let match\n\n while ((match = eol.exec(value))) {\n one(value.slice(start, match.index))\n result.push(match[0])\n start = match.index + match[0].length\n line++\n }\n\n one(value.slice(start))\n\n return result.join('')\n\n /**\n * @param {string} value\n */\n function one(value) {\n result.push(map(value, line, !value))\n }\n}\n","/**\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').List} List\n * @typedef {import('../util/indent-lines.js').Map} Map\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').Handle} Handle\n */\n\nimport {checkBullet} from '../util/check-bullet.js'\nimport {checkListItemIndent} from '../util/check-list-item-indent.js'\nimport {containerFlow} from '../util/container-flow.js'\nimport {indentLines} from '../util/indent-lines.js'\nimport {track} from '../util/track.js'\n\n/**\n * @type {Handle}\n * @param {ListItem} node\n */\nexport function listItem(node, parent, context, safeOptions) {\n const listItemIndent = checkListItemIndent(context)\n let bullet = context.bulletCurrent || checkBullet(context)\n\n // Add the marker value for ordered lists.\n if (parent && parent.type === 'list' && parent.ordered) {\n bullet =\n (typeof parent.start === 'number' && parent.start > -1\n ? parent.start\n : 1) +\n (context.options.incrementListMarker === false\n ? 0\n : parent.children.indexOf(node)) +\n bullet\n }\n\n let size = bullet.length + 1\n\n if (\n listItemIndent === 'tab' ||\n (listItemIndent === 'mixed' &&\n ((parent && parent.type === 'list' && parent.spread) || node.spread))\n ) {\n size = Math.ceil(size / 4) * 4\n }\n\n const tracker = track(safeOptions)\n tracker.move(bullet + ' '.repeat(size - bullet.length))\n tracker.shift(size)\n const exit = context.enter('listItem')\n const value = indentLines(\n containerFlow(node, context, tracker.current()),\n map\n )\n exit()\n\n return value\n\n /** @type {Map} */\n function map(line, index, blank) {\n if (index) {\n return (blank ? '' : ' '.repeat(size)) + line\n }\n\n return (blank ? bullet : bullet + ' '.repeat(size - bullet.length)) + line\n }\n}\n","/**\n * @typedef {import('../types.js').Context} Context\n * @typedef {import('../types.js').Options} Options\n */\n\n/**\n * @param {Context} context\n * @returns {Exclude<Options['listItemIndent'], undefined>}\n */\nexport function checkListItemIndent(context) {\n const style = context.options.listItemIndent || 'tab'\n\n // To do: remove in a major.\n // @ts-expect-error: deprecated.\n if (style === 1 || style === '1') {\n return 'one'\n }\n\n if (style !== 'tab' && style !== 'one' && style !== 'mixed') {\n throw new Error(\n 'Cannot serialize items with `' +\n style +\n '` for `options.listItemIndent`, expected `tab`, `one`, or `mixed`'\n )\n }\n\n return style\n}\n","/**\n * @typedef {import('../types.js').Context} Context\n * @typedef {import('../types.js').Options} Options\n */\n\n/**\n * @param {Context} context\n * @returns {Exclude<Options['bullet'], undefined>}\n */\nexport function checkBullet(context) {\n const marker = context.options.bullet || '*'\n\n if (marker !== '*' && marker !== '+' && marker !== '-') {\n throw new Error(\n 'Cannot serialize items with `' +\n marker +\n '` for `options.bullet`, expected `*`, `+`, or `-`'\n )\n }\n\n return marker\n}\n","/**\n * @typedef {import('../types.js').Node} Node\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').Join} Join\n * @typedef {import('../types.js').Context} Context\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\nimport {track} from './track.js'\n\n/**\n * @param {Parent} parent\n * @param {Context} context\n * @param {TrackFields} safeOptions\n * @returns {string}\n */\nexport function containerFlow(parent, context, safeOptions) {\n const indexStack = context.indexStack\n const children = parent.children || []\n const tracker = track(safeOptions)\n /** @type {Array<string>} */\n const results = []\n let index = -1\n\n indexStack.push(-1)\n\n while (++index < children.length) {\n const child = children[index]\n\n indexStack[indexStack.length - 1] = index\n\n results.push(\n tracker.move(\n context.handle(child, parent, context, {\n before: '\\n',\n after: '\\n',\n ...tracker.current()\n })\n )\n )\n\n if (child.type !== 'list') {\n context.bulletLastUsed = undefined\n }\n\n if (index < children.length - 1) {\n results.push(tracker.move(between(child, children[index + 1])))\n }\n }\n\n indexStack.pop()\n\n return results.join('')\n\n /**\n * @param {Node} left\n * @param {Node} right\n * @returns {string}\n */\n function between(left, right) {\n let index = context.join.length\n\n while (index--) {\n const result = context.join[index](left, right, parent, context)\n\n if (result === true || result === 1) {\n break\n }\n\n if (typeof result === 'number') {\n return '\\n'.repeat(1 + result)\n }\n\n if (result === false) {\n return '\\n\\n<!---->\\n\\n'\n }\n }\n\n return '\\n\\n'\n }\n}\n","/**\n * @typedef {Extract<import('mdast').Root|import('mdast').Content, import('unist').Parent>} Parent\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('mdast').BlockContent} BlockContent\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n */\n\nimport {listItem} from 'mdast-util-to-markdown/lib/handle/list-item.js'\nimport {track} from 'mdast-util-to-markdown/lib/util/track.js'\n\n/** @type {FromMarkdownExtension} */\nexport const gfmTaskListItemFromMarkdown = {\n exit: {\n taskListCheckValueChecked: exitCheck,\n taskListCheckValueUnchecked: exitCheck,\n paragraph: exitParagraphWithTaskListItem\n }\n}\n\n/** @type {ToMarkdownExtension} */\nexport const gfmTaskListItemToMarkdown = {\n unsafe: [{atBreak: true, character: '-', after: '[:|-]'}],\n handlers: {listItem: listItemWithTaskListItem}\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitCheck(token) {\n const node = /** @type {ListItem} */ (this.stack[this.stack.length - 2])\n // We’re always in a paragraph, in a list item.\n node.checked = token.type === 'taskListCheckValueChecked'\n}\n\n/** @type {FromMarkdownHandle} */\nfunction exitParagraphWithTaskListItem(token) {\n const parent = /** @type {Parent} */ (this.stack[this.stack.length - 2])\n const node = /** @type {Paragraph} */ (this.stack[this.stack.length - 1])\n const siblings = parent.children\n const head = node.children[0]\n let index = -1\n /** @type {Paragraph|undefined} */\n let firstParaghraph\n\n if (\n parent &&\n parent.type === 'listItem' &&\n typeof parent.checked === 'boolean' &&\n head &&\n head.type === 'text'\n ) {\n while (++index < siblings.length) {\n const sibling = siblings[index]\n if (sibling.type === 'paragraph') {\n firstParaghraph = sibling\n break\n }\n }\n\n if (firstParaghraph === node) {\n // Must start with a space or a tab.\n head.value = head.value.slice(1)\n\n if (head.value.length === 0) {\n node.children.shift()\n } else if (\n node.position &&\n head.position &&\n typeof head.position.start.offset === 'number'\n ) {\n head.position.start.column++\n head.position.start.offset++\n node.position.start = Object.assign({}, head.position.start)\n }\n }\n }\n\n this.exit(token)\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {ListItem} node\n */\nfunction listItemWithTaskListItem(node, parent, context, safeOptions) {\n const head = node.children[0]\n const checkable =\n typeof node.checked === 'boolean' && head && head.type === 'paragraph'\n const checkbox = '[' + (node.checked ? 'x' : ' ') + '] '\n const tracker = track(safeOptions)\n\n if (checkable) {\n tracker.move(checkbox)\n }\n\n let value = listItem(node, parent, context, {\n ...safeOptions,\n ...tracker.current()\n })\n\n if (checkable) {\n value = value.replace(/^(?:[*+-]|\\d+\\.)([\\r\\n]| {1,3})/, check)\n }\n\n return value\n\n /**\n * @param {string} $0\n * @returns {string}\n */\n function check($0) {\n return $0 + checkbox\n }\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('micromark-extension-gfm').Options & import('mdast-util-gfm').Options} Options\n */\n\nimport {gfm} from 'micromark-extension-gfm'\nimport {gfmFromMarkdown, gfmToMarkdown} from 'mdast-util-gfm'\n\n/**\n * Plugin to support GFM (autolink literals, footnotes, strikethrough, tables, tasklists).\n *\n * @type {import('unified').Plugin<[Options?]|void[], Root>}\n */\nexport default function remarkGfm(options = {}) {\n const data = this.data()\n\n add('micromarkExtensions', gfm(options))\n add('fromMarkdownExtensions', gfmFromMarkdown())\n add('toMarkdownExtensions', gfmToMarkdown(options))\n\n /**\n * @param {string} field\n * @param {unknown} value\n */\n function add(field, value) {\n const list = /** @type {unknown[]} */ (\n // Other extensions\n /* c8 ignore next 2 */\n data[field] ? data[field] : (data[field] = [])\n )\n\n list.push(value)\n }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').HtmlExtension} HtmlExtension\n * @typedef {import('micromark-extension-gfm-strikethrough').Options} Options\n * @typedef {import('micromark-extension-gfm-footnote').HtmlOptions} HtmlOptions\n */\n\nimport {\n combineExtensions,\n combineHtmlExtensions\n} from 'micromark-util-combine-extensions'\nimport {\n gfmAutolinkLiteral,\n gfmAutolinkLiteralHtml\n} from 'micromark-extension-gfm-autolink-literal'\nimport {gfmFootnote, gfmFootnoteHtml} from 'micromark-extension-gfm-footnote'\nimport {\n gfmStrikethrough,\n gfmStrikethroughHtml\n} from 'micromark-extension-gfm-strikethrough'\nimport {gfmTable, gfmTableHtml} from 'micromark-extension-gfm-table'\nimport {gfmTagfilterHtml} from 'micromark-extension-gfm-tagfilter'\nimport {\n gfmTaskListItem,\n gfmTaskListItemHtml\n} from 'micromark-extension-gfm-task-list-item'\n\n/**\n * Support GFM or markdown on github.com.\n *\n * @param {Options} [options]\n * @returns {Extension}\n */\nexport function gfm(options) {\n return combineExtensions([\n gfmAutolinkLiteral,\n gfmFootnote(),\n gfmStrikethrough(options),\n gfmTable,\n gfmTaskListItem\n ])\n}\n\n/**\n * Support to compile GFM to HTML.\n *\n * @param {HtmlOptions} [options]\n * @returns {HtmlExtension}\n */\nexport function gfmHtml(options) {\n return combineHtmlExtensions([\n gfmAutolinkLiteralHtml,\n gfmFootnoteHtml(options),\n gfmStrikethroughHtml,\n gfmTableHtml,\n gfmTagfilterHtml,\n gfmTaskListItemHtml\n ])\n}\n","/**\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n *\n * @typedef {import('mdast-util-gfm-table').Options} Options\n */\n\nimport {\n gfmAutolinkLiteralFromMarkdown,\n gfmAutolinkLiteralToMarkdown\n} from 'mdast-util-gfm-autolink-literal'\nimport {\n gfmFootnoteFromMarkdown,\n gfmFootnoteToMarkdown\n} from 'mdast-util-gfm-footnote'\nimport {\n gfmStrikethroughFromMarkdown,\n gfmStrikethroughToMarkdown\n} from 'mdast-util-gfm-strikethrough'\nimport {gfmTableFromMarkdown, gfmTableToMarkdown} from 'mdast-util-gfm-table'\nimport {\n gfmTaskListItemFromMarkdown,\n gfmTaskListItemToMarkdown\n} from 'mdast-util-gfm-task-list-item'\n\n/**\n * @returns {Array<FromMarkdownExtension>}\n */\nexport function gfmFromMarkdown() {\n return [\n gfmAutolinkLiteralFromMarkdown,\n gfmFootnoteFromMarkdown(),\n gfmStrikethroughFromMarkdown,\n gfmTableFromMarkdown,\n gfmTaskListItemFromMarkdown\n ]\n}\n\n/**\n * @param {Options} [options]\n * @returns {ToMarkdownExtension}\n */\nexport function gfmToMarkdown(options) {\n return {\n extensions: [\n gfmAutolinkLiteralToMarkdown,\n gfmFootnoteToMarkdown(),\n gfmStrikethroughToMarkdown,\n gfmTableToMarkdown(options),\n gfmTaskListItemToMarkdown\n ]\n }\n}\n","var deepFreezeEs6 = {exports: {}};\n\nfunction deepFreeze(obj) {\n if (obj instanceof Map) {\n obj.clear = obj.delete = obj.set = function () {\n throw new Error('map is read-only');\n };\n } else if (obj instanceof Set) {\n obj.add = obj.clear = obj.delete = function () {\n throw new Error('set is read-only');\n };\n }\n\n // Freeze self\n Object.freeze(obj);\n\n Object.getOwnPropertyNames(obj).forEach(function (name) {\n var prop = obj[name];\n\n // Freeze prop if it is an object\n if (typeof prop == 'object' && !Object.isFrozen(prop)) {\n deepFreeze(prop);\n }\n });\n\n return obj;\n}\n\ndeepFreezeEs6.exports = deepFreeze;\ndeepFreezeEs6.exports.default = deepFreeze;\n\nvar deepFreeze$1 = deepFreezeEs6.exports;\n\n/** @typedef {import('highlight.js').CallbackResponse} CallbackResponse */\n/** @typedef {import('highlight.js').CompiledMode} CompiledMode */\n/** @implements CallbackResponse */\n\nclass Response {\n /**\n * @param {CompiledMode} mode\n */\n constructor(mode) {\n // eslint-disable-next-line no-undefined\n if (mode.data === undefined) mode.data = {};\n\n this.data = mode.data;\n this.isMatchIgnored = false;\n }\n\n ignoreMatch() {\n this.isMatchIgnored = true;\n }\n}\n\n/**\n * @param {string} value\n * @returns {string}\n */\nfunction escapeHTML(value) {\n return value\n .replace(/&/g, '&amp;')\n .replace(/</g, '&lt;')\n .replace(/>/g, '&gt;')\n .replace(/\"/g, '&quot;')\n .replace(/'/g, '&#x27;');\n}\n\n/**\n * performs a shallow merge of multiple objects into one\n *\n * @template T\n * @param {T} original\n * @param {Record<string,any>[]} objects\n * @returns {T} a single new object\n */\nfunction inherit$1(original, ...objects) {\n /** @type Record<string,any> */\n const result = Object.create(null);\n\n for (const key in original) {\n result[key] = original[key];\n }\n objects.forEach(function(obj) {\n for (const key in obj) {\n result[key] = obj[key];\n }\n });\n return /** @type {T} */ (result);\n}\n\n/**\n * @typedef {object} Renderer\n * @property {(text: string) => void} addText\n * @property {(node: Node) => void} openNode\n * @property {(node: Node) => void} closeNode\n * @property {() => string} value\n */\n\n/** @typedef {{kind?: string, sublanguage?: boolean}} Node */\n/** @typedef {{walk: (r: Renderer) => void}} Tree */\n/** */\n\nconst SPAN_CLOSE = '</span>';\n\n/**\n * Determines if a node needs to be wrapped in <span>\n *\n * @param {Node} node */\nconst emitsWrappingTags = (node) => {\n return !!node.kind;\n};\n\n/**\n *\n * @param {string} name\n * @param {{prefix:string}} options\n */\nconst expandScopeName = (name, { prefix }) => {\n if (name.includes(\".\")) {\n const pieces = name.split(\".\");\n return [\n `${prefix}${pieces.shift()}`,\n ...(pieces.map((x, i) => `${x}${\"_\".repeat(i + 1)}`))\n ].join(\" \");\n }\n return `${prefix}${name}`;\n};\n\n/** @type {Renderer} */\nclass HTMLRenderer {\n /**\n * Creates a new HTMLRenderer\n *\n * @param {Tree} parseTree - the parse tree (must support `walk` API)\n * @param {{classPrefix: string}} options\n */\n constructor(parseTree, options) {\n this.buffer = \"\";\n this.classPrefix = options.classPrefix;\n parseTree.walk(this);\n }\n\n /**\n * Adds texts to the output stream\n *\n * @param {string} text */\n addText(text) {\n this.buffer += escapeHTML(text);\n }\n\n /**\n * Adds a node open to the output stream (if needed)\n *\n * @param {Node} node */\n openNode(node) {\n if (!emitsWrappingTags(node)) return;\n\n let scope = node.kind;\n if (node.sublanguage) {\n scope = `language-${scope}`;\n } else {\n scope = expandScopeName(scope, { prefix: this.classPrefix });\n }\n this.span(scope);\n }\n\n /**\n * Adds a node close to the output stream (if needed)\n *\n * @param {Node} node */\n closeNode(node) {\n if (!emitsWrappingTags(node)) return;\n\n this.buffer += SPAN_CLOSE;\n }\n\n /**\n * returns the accumulated buffer\n */\n value() {\n return this.buffer;\n }\n\n // helpers\n\n /**\n * Builds a span element\n *\n * @param {string} className */\n span(className) {\n this.buffer += `<span class=\"${className}\">`;\n }\n}\n\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} | string} Node */\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} } DataNode */\n/** @typedef {import('highlight.js').Emitter} Emitter */\n/** */\n\nclass TokenTree {\n constructor() {\n /** @type DataNode */\n this.rootNode = { children: [] };\n this.stack = [this.rootNode];\n }\n\n get top() {\n return this.stack[this.stack.length - 1];\n }\n\n get root() { return this.rootNode; }\n\n /** @param {Node} node */\n add(node) {\n this.top.children.push(node);\n }\n\n /** @param {string} kind */\n openNode(kind) {\n /** @type Node */\n const node = { kind, children: [] };\n this.add(node);\n this.stack.push(node);\n }\n\n closeNode() {\n if (this.stack.length > 1) {\n return this.stack.pop();\n }\n // eslint-disable-next-line no-undefined\n return undefined;\n }\n\n closeAllNodes() {\n while (this.closeNode());\n }\n\n toJSON() {\n return JSON.stringify(this.rootNode, null, 4);\n }\n\n /**\n * @typedef { import(\"./html_renderer\").Renderer } Renderer\n * @param {Renderer} builder\n */\n walk(builder) {\n // this does not\n return this.constructor._walk(builder, this.rootNode);\n // this works\n // return TokenTree._walk(builder, this.rootNode);\n }\n\n /**\n * @param {Renderer} builder\n * @param {Node} node\n */\n static _walk(builder, node) {\n if (typeof node === \"string\") {\n builder.addText(node);\n } else if (node.children) {\n builder.openNode(node);\n node.children.forEach((child) => this._walk(builder, child));\n builder.closeNode(node);\n }\n return builder;\n }\n\n /**\n * @param {Node} node\n */\n static _collapse(node) {\n if (typeof node === \"string\") return;\n if (!node.children) return;\n\n if (node.children.every(el => typeof el === \"string\")) {\n // node.text = node.children.join(\"\");\n // delete node.children;\n node.children = [node.children.join(\"\")];\n } else {\n node.children.forEach((child) => {\n TokenTree._collapse(child);\n });\n }\n }\n}\n\n/**\n Currently this is all private API, but this is the minimal API necessary\n that an Emitter must implement to fully support the parser.\n\n Minimal interface:\n\n - addKeyword(text, kind)\n - addText(text)\n - addSublanguage(emitter, subLanguageName)\n - finalize()\n - openNode(kind)\n - closeNode()\n - closeAllNodes()\n - toHTML()\n\n*/\n\n/**\n * @implements {Emitter}\n */\nclass TokenTreeEmitter extends TokenTree {\n /**\n * @param {*} options\n */\n constructor(options) {\n super();\n this.options = options;\n }\n\n /**\n * @param {string} text\n * @param {string} kind\n */\n addKeyword(text, kind) {\n if (text === \"\") { return; }\n\n this.openNode(kind);\n this.addText(text);\n this.closeNode();\n }\n\n /**\n * @param {string} text\n */\n addText(text) {\n if (text === \"\") { return; }\n\n this.add(text);\n }\n\n /**\n * @param {Emitter & {root: DataNode}} emitter\n * @param {string} name\n */\n addSublanguage(emitter, name) {\n /** @type DataNode */\n const node = emitter.root;\n node.kind = name;\n node.sublanguage = true;\n this.add(node);\n }\n\n toHTML() {\n const renderer = new HTMLRenderer(this, this.options);\n return renderer.value();\n }\n\n finalize() {\n return true;\n }\n}\n\n/**\n * @param {string} value\n * @returns {RegExp}\n * */\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction source(re) {\n if (!re) return null;\n if (typeof re === \"string\") return re;\n\n return re.source;\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction lookahead(re) {\n return concat('(?=', re, ')');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction anyNumberOfTimes(re) {\n return concat('(?:', re, ')*');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction optional(re) {\n return concat('(?:', re, ')?');\n}\n\n/**\n * @param {...(RegExp | string) } args\n * @returns {string}\n */\nfunction concat(...args) {\n const joined = args.map((x) => source(x)).join(\"\");\n return joined;\n}\n\n/**\n * @param { Array<string | RegExp | Object> } args\n * @returns {object}\n */\nfunction stripOptionsFromArgs(args) {\n const opts = args[args.length - 1];\n\n if (typeof opts === 'object' && opts.constructor === Object) {\n args.splice(args.length - 1, 1);\n return opts;\n } else {\n return {};\n }\n}\n\n/** @typedef { {capture?: boolean} } RegexEitherOptions */\n\n/**\n * Any of the passed expresssions may match\n *\n * Creates a huge this | this | that | that match\n * @param {(RegExp | string)[] | [...(RegExp | string)[], RegexEitherOptions]} args\n * @returns {string}\n */\nfunction either(...args) {\n /** @type { object & {capture?: boolean} } */\n const opts = stripOptionsFromArgs(args);\n const joined = '('\n + (opts.capture ? \"\" : \"?:\")\n + args.map((x) => source(x)).join(\"|\") + \")\";\n return joined;\n}\n\n/**\n * @param {RegExp | string} re\n * @returns {number}\n */\nfunction countMatchGroups(re) {\n return (new RegExp(re.toString() + '|')).exec('').length - 1;\n}\n\n/**\n * Does lexeme start with a regular expression match at the beginning\n * @param {RegExp} re\n * @param {string} lexeme\n */\nfunction startsWith(re, lexeme) {\n const match = re && re.exec(lexeme);\n return match && match.index === 0;\n}\n\n// BACKREF_RE matches an open parenthesis or backreference. To avoid\n// an incorrect parse, it additionally matches the following:\n// - [...] elements, where the meaning of parentheses and escapes change\n// - other escape sequences, so we do not misparse escape sequences as\n// interesting elements\n// - non-matching or lookahead parentheses, which do not capture. These\n// follow the '(' with a '?'.\nconst BACKREF_RE = /\\[(?:[^\\\\\\]]|\\\\.)*\\]|\\(\\??|\\\\([1-9][0-9]*)|\\\\./;\n\n// **INTERNAL** Not intended for outside usage\n// join logically computes regexps.join(separator), but fixes the\n// backreferences so they continue to match.\n// it also places each individual regular expression into it's own\n// match group, keeping track of the sequencing of those match groups\n// is currently an exercise for the caller. :-)\n/**\n * @param {(string | RegExp)[]} regexps\n * @param {{joinWith: string}} opts\n * @returns {string}\n */\nfunction _rewriteBackreferences(regexps, { joinWith }) {\n let numCaptures = 0;\n\n return regexps.map((regex) => {\n numCaptures += 1;\n const offset = numCaptures;\n let re = source(regex);\n let out = '';\n\n while (re.length > 0) {\n const match = BACKREF_RE.exec(re);\n if (!match) {\n out += re;\n break;\n }\n out += re.substring(0, match.index);\n re = re.substring(match.index + match[0].length);\n if (match[0][0] === '\\\\' && match[1]) {\n // Adjust the backreference.\n out += '\\\\' + String(Number(match[1]) + offset);\n } else {\n out += match[0];\n if (match[0] === '(') {\n numCaptures++;\n }\n }\n }\n return out;\n }).map(re => `(${re})`).join(joinWith);\n}\n\n/** @typedef {import('highlight.js').Mode} Mode */\n/** @typedef {import('highlight.js').ModeCallback} ModeCallback */\n\n// Common regexps\nconst MATCH_NOTHING_RE = /\\b\\B/;\nconst IDENT_RE = '[a-zA-Z]\\\\w*';\nconst UNDERSCORE_IDENT_RE = '[a-zA-Z_]\\\\w*';\nconst NUMBER_RE = '\\\\b\\\\d+(\\\\.\\\\d+)?';\nconst C_NUMBER_RE = '(-?)(\\\\b0[xX][a-fA-F0-9]+|(\\\\b\\\\d+(\\\\.\\\\d*)?|\\\\.\\\\d+)([eE][-+]?\\\\d+)?)'; // 0x..., 0..., decimal, float\nconst BINARY_NUMBER_RE = '\\\\b(0b[01]+)'; // 0b...\nconst RE_STARTERS_RE = '!|!=|!==|%|%=|&|&&|&=|\\\\*|\\\\*=|\\\\+|\\\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\\\?|\\\\[|\\\\{|\\\\(|\\\\^|\\\\^=|\\\\||\\\\|=|\\\\|\\\\||~';\n\n/**\n* @param { Partial<Mode> & {binary?: string | RegExp} } opts\n*/\nconst SHEBANG = (opts = {}) => {\n const beginShebang = /^#![ ]*\\//;\n if (opts.binary) {\n opts.begin = concat(\n beginShebang,\n /.*\\b/,\n opts.binary,\n /\\b.*/);\n }\n return inherit$1({\n scope: 'meta',\n begin: beginShebang,\n end: /$/,\n relevance: 0,\n /** @type {ModeCallback} */\n \"on:begin\": (m, resp) => {\n if (m.index !== 0) resp.ignoreMatch();\n }\n }, opts);\n};\n\n// Common modes\nconst BACKSLASH_ESCAPE = {\n begin: '\\\\\\\\[\\\\s\\\\S]', relevance: 0\n};\nconst APOS_STRING_MODE = {\n scope: 'string',\n begin: '\\'',\n end: '\\'',\n illegal: '\\\\n',\n contains: [BACKSLASH_ESCAPE]\n};\nconst QUOTE_STRING_MODE = {\n scope: 'string',\n begin: '\"',\n end: '\"',\n illegal: '\\\\n',\n contains: [BACKSLASH_ESCAPE]\n};\nconst PHRASAL_WORDS_MODE = {\n begin: /\\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\\b/\n};\n/**\n * Creates a comment mode\n *\n * @param {string | RegExp} begin\n * @param {string | RegExp} end\n * @param {Mode | {}} [modeOptions]\n * @returns {Partial<Mode>}\n */\nconst COMMENT = function(begin, end, modeOptions = {}) {\n const mode = inherit$1(\n {\n scope: 'comment',\n begin,\n end,\n contains: []\n },\n modeOptions\n );\n mode.contains.push({\n scope: 'doctag',\n // hack to avoid the space from being included. the space is necessary to\n // match here to prevent the plain text rule below from gobbling up doctags\n begin: '[ ]*(?=(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):)',\n end: /(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):/,\n excludeBegin: true,\n relevance: 0\n });\n const ENGLISH_WORD = either(\n // list of common 1 and 2 letter words in English\n \"I\",\n \"a\",\n \"is\",\n \"so\",\n \"us\",\n \"to\",\n \"at\",\n \"if\",\n \"in\",\n \"it\",\n \"on\",\n // note: this is not an exhaustive list of contractions, just popular ones\n /[A-Za-z]+['](d|ve|re|ll|t|s|n)/, // contractions - can't we'd they're let's, etc\n /[A-Za-z]+[-][a-z]+/, // `no-way`, etc.\n /[A-Za-z][a-z]{2,}/ // allow capitalized words at beginning of sentences\n );\n // looking like plain text, more likely to be a comment\n mode.contains.push(\n {\n // TODO: how to include \", (, ) without breaking grammars that use these for\n // comment delimiters?\n // begin: /[ ]+([()\"]?([A-Za-z'-]{3,}|is|a|I|so|us|[tT][oO]|at|if|in|it|on)[.]?[()\":]?([.][ ]|[ ]|\\))){3}/\n // ---\n\n // this tries to find sequences of 3 english words in a row (without any\n // \"programming\" type syntax) this gives us a strong signal that we've\n // TRULY found a comment - vs perhaps scanning with the wrong language.\n // It's possible to find something that LOOKS like the start of the\n // comment - but then if there is no readable text - good chance it is a\n // false match and not a comment.\n //\n // for a visual example please see:\n // https://github.com/highlightjs/highlight.js/issues/2827\n\n begin: concat(\n /[ ]+/, // necessary to prevent us gobbling up doctags like /* @author Bob Mcgill */\n '(',\n ENGLISH_WORD,\n /[.]?[:]?([.][ ]|[ ])/,\n '){3}') // look for 3 words in a row\n }\n );\n return mode;\n};\nconst C_LINE_COMMENT_MODE = COMMENT('//', '$');\nconst C_BLOCK_COMMENT_MODE = COMMENT('/\\\\*', '\\\\*/');\nconst HASH_COMMENT_MODE = COMMENT('#', '$');\nconst NUMBER_MODE = {\n scope: 'number',\n begin: NUMBER_RE,\n relevance: 0\n};\nconst C_NUMBER_MODE = {\n scope: 'number',\n begin: C_NUMBER_RE,\n relevance: 0\n};\nconst BINARY_NUMBER_MODE = {\n scope: 'number',\n begin: BINARY_NUMBER_RE,\n relevance: 0\n};\nconst REGEXP_MODE = {\n // this outer rule makes sure we actually have a WHOLE regex and not simply\n // an expression such as:\n //\n // 3 / something\n //\n // (which will then blow up when regex's `illegal` sees the newline)\n begin: /(?=\\/[^/\\n]*\\/)/,\n contains: [{\n scope: 'regexp',\n begin: /\\//,\n end: /\\/[gimuy]*/,\n illegal: /\\n/,\n contains: [\n BACKSLASH_ESCAPE,\n {\n begin: /\\[/,\n end: /\\]/,\n relevance: 0,\n contains: [BACKSLASH_ESCAPE]\n }\n ]\n }]\n};\nconst TITLE_MODE = {\n scope: 'title',\n begin: IDENT_RE,\n relevance: 0\n};\nconst UNDERSCORE_TITLE_MODE = {\n scope: 'title',\n begin: UNDERSCORE_IDENT_RE,\n relevance: 0\n};\nconst METHOD_GUARD = {\n // excludes method names from keyword processing\n begin: '\\\\.\\\\s*' + UNDERSCORE_IDENT_RE,\n relevance: 0\n};\n\n/**\n * Adds end same as begin mechanics to a mode\n *\n * Your mode must include at least a single () match group as that first match\n * group is what is used for comparison\n * @param {Partial<Mode>} mode\n */\nconst END_SAME_AS_BEGIN = function(mode) {\n return Object.assign(mode,\n {\n /** @type {ModeCallback} */\n 'on:begin': (m, resp) => { resp.data._beginMatch = m[1]; },\n /** @type {ModeCallback} */\n 'on:end': (m, resp) => { if (resp.data._beginMatch !== m[1]) resp.ignoreMatch(); }\n });\n};\n\nvar MODES = /*#__PURE__*/Object.freeze({\n __proto__: null,\n MATCH_NOTHING_RE: MATCH_NOTHING_RE,\n IDENT_RE: IDENT_RE,\n UNDERSCORE_IDENT_RE: UNDERSCORE_IDENT_RE,\n NUMBER_RE: NUMBER_RE,\n C_NUMBER_RE: C_NUMBER_RE,\n BINARY_NUMBER_RE: BINARY_NUMBER_RE,\n RE_STARTERS_RE: RE_STARTERS_RE,\n SHEBANG: SHEBANG,\n BACKSLASH_ESCAPE: BACKSLASH_ESCAPE,\n APOS_STRING_MODE: APOS_STRING_MODE,\n QUOTE_STRING_MODE: QUOTE_STRING_MODE,\n PHRASAL_WORDS_MODE: PHRASAL_WORDS_MODE,\n COMMENT: COMMENT,\n C_LINE_COMMENT_MODE: C_LINE_COMMENT_MODE,\n C_BLOCK_COMMENT_MODE: C_BLOCK_COMMENT_MODE,\n HASH_COMMENT_MODE: HASH_COMMENT_MODE,\n NUMBER_MODE: NUMBER_MODE,\n C_NUMBER_MODE: C_NUMBER_MODE,\n BINARY_NUMBER_MODE: BINARY_NUMBER_MODE,\n REGEXP_MODE: REGEXP_MODE,\n TITLE_MODE: TITLE_MODE,\n UNDERSCORE_TITLE_MODE: UNDERSCORE_TITLE_MODE,\n METHOD_GUARD: METHOD_GUARD,\n END_SAME_AS_BEGIN: END_SAME_AS_BEGIN\n});\n\n/**\n@typedef {import('highlight.js').CallbackResponse} CallbackResponse\n@typedef {import('highlight.js').CompilerExt} CompilerExt\n*/\n\n// Grammar extensions / plugins\n// See: https://github.com/highlightjs/highlight.js/issues/2833\n\n// Grammar extensions allow \"syntactic sugar\" to be added to the grammar modes\n// without requiring any underlying changes to the compiler internals.\n\n// `compileMatch` being the perfect small example of now allowing a grammar\n// author to write `match` when they desire to match a single expression rather\n// than being forced to use `begin`. The extension then just moves `match` into\n// `begin` when it runs. Ie, no features have been added, but we've just made\n// the experience of writing (and reading grammars) a little bit nicer.\n\n// ------\n\n// TODO: We need negative look-behind support to do this properly\n/**\n * Skip a match if it has a preceding dot\n *\n * This is used for `beginKeywords` to prevent matching expressions such as\n * `bob.keyword.do()`. The mode compiler automatically wires this up as a\n * special _internal_ 'on:begin' callback for modes with `beginKeywords`\n * @param {RegExpMatchArray} match\n * @param {CallbackResponse} response\n */\nfunction skipIfHasPrecedingDot(match, response) {\n const before = match.input[match.index - 1];\n if (before === \".\") {\n response.ignoreMatch();\n }\n}\n\n/**\n *\n * @type {CompilerExt}\n */\nfunction scopeClassName(mode, _parent) {\n // eslint-disable-next-line no-undefined\n if (mode.className !== undefined) {\n mode.scope = mode.className;\n delete mode.className;\n }\n}\n\n/**\n * `beginKeywords` syntactic sugar\n * @type {CompilerExt}\n */\nfunction beginKeywords(mode, parent) {\n if (!parent) return;\n if (!mode.beginKeywords) return;\n\n // for languages with keywords that include non-word characters checking for\n // a word boundary is not sufficient, so instead we check for a word boundary\n // or whitespace - this does no harm in any case since our keyword engine\n // doesn't allow spaces in keywords anyways and we still check for the boundary\n // first\n mode.begin = '\\\\b(' + mode.beginKeywords.split(' ').join('|') + ')(?!\\\\.)(?=\\\\b|\\\\s)';\n mode.__beforeBegin = skipIfHasPrecedingDot;\n mode.keywords = mode.keywords || mode.beginKeywords;\n delete mode.beginKeywords;\n\n // prevents double relevance, the keywords themselves provide\n // relevance, the mode doesn't need to double it\n // eslint-disable-next-line no-undefined\n if (mode.relevance === undefined) mode.relevance = 0;\n}\n\n/**\n * Allow `illegal` to contain an array of illegal values\n * @type {CompilerExt}\n */\nfunction compileIllegal(mode, _parent) {\n if (!Array.isArray(mode.illegal)) return;\n\n mode.illegal = either(...mode.illegal);\n}\n\n/**\n * `match` to match a single expression for readability\n * @type {CompilerExt}\n */\nfunction compileMatch(mode, _parent) {\n if (!mode.match) return;\n if (mode.begin || mode.end) throw new Error(\"begin & end are not supported with match\");\n\n mode.begin = mode.match;\n delete mode.match;\n}\n\n/**\n * provides the default 1 relevance to all modes\n * @type {CompilerExt}\n */\nfunction compileRelevance(mode, _parent) {\n // eslint-disable-next-line no-undefined\n if (mode.relevance === undefined) mode.relevance = 1;\n}\n\n// allow beforeMatch to act as a \"qualifier\" for the match\n// the full match begin must be [beforeMatch][begin]\nconst beforeMatchExt = (mode, parent) => {\n if (!mode.beforeMatch) return;\n // starts conflicts with endsParent which we need to make sure the child\n // rule is not matched multiple times\n if (mode.starts) throw new Error(\"beforeMatch cannot be used with starts\");\n\n const originalMode = Object.assign({}, mode);\n Object.keys(mode).forEach((key) => { delete mode[key]; });\n\n mode.keywords = originalMode.keywords;\n mode.begin = concat(originalMode.beforeMatch, lookahead(originalMode.begin));\n mode.starts = {\n relevance: 0,\n contains: [\n Object.assign(originalMode, { endsParent: true })\n ]\n };\n mode.relevance = 0;\n\n delete originalMode.beforeMatch;\n};\n\n// keywords that should have no default relevance value\nconst COMMON_KEYWORDS = [\n 'of',\n 'and',\n 'for',\n 'in',\n 'not',\n 'or',\n 'if',\n 'then',\n 'parent', // common variable name\n 'list', // common variable name\n 'value' // common variable name\n];\n\nconst DEFAULT_KEYWORD_SCOPE = \"keyword\";\n\n/**\n * Given raw keywords from a language definition, compile them.\n *\n * @param {string | Record<string,string|string[]> | Array<string>} rawKeywords\n * @param {boolean} caseInsensitive\n */\nfunction compileKeywords(rawKeywords, caseInsensitive, scopeName = DEFAULT_KEYWORD_SCOPE) {\n /** @type KeywordDict */\n const compiledKeywords = Object.create(null);\n\n // input can be a string of keywords, an array of keywords, or a object with\n // named keys representing scopeName (which can then point to a string or array)\n if (typeof rawKeywords === 'string') {\n compileList(scopeName, rawKeywords.split(\" \"));\n } else if (Array.isArray(rawKeywords)) {\n compileList(scopeName, rawKeywords);\n } else {\n Object.keys(rawKeywords).forEach(function(scopeName) {\n // collapse all our objects back into the parent object\n Object.assign(\n compiledKeywords,\n compileKeywords(rawKeywords[scopeName], caseInsensitive, scopeName)\n );\n });\n }\n return compiledKeywords;\n\n // ---\n\n /**\n * Compiles an individual list of keywords\n *\n * Ex: \"for if when while|5\"\n *\n * @param {string} scopeName\n * @param {Array<string>} keywordList\n */\n function compileList(scopeName, keywordList) {\n if (caseInsensitive) {\n keywordList = keywordList.map(x => x.toLowerCase());\n }\n keywordList.forEach(function(keyword) {\n const pair = keyword.split('|');\n compiledKeywords[pair[0]] = [scopeName, scoreForKeyword(pair[0], pair[1])];\n });\n }\n}\n\n/**\n * Returns the proper score for a given keyword\n *\n * Also takes into account comment keywords, which will be scored 0 UNLESS\n * another score has been manually assigned.\n * @param {string} keyword\n * @param {string} [providedScore]\n */\nfunction scoreForKeyword(keyword, providedScore) {\n // manual scores always win over common keywords\n // so you can force a score of 1 if you really insist\n if (providedScore) {\n return Number(providedScore);\n }\n\n return commonKeyword(keyword) ? 0 : 1;\n}\n\n/**\n * Determines if a given keyword is common or not\n *\n * @param {string} keyword */\nfunction commonKeyword(keyword) {\n return COMMON_KEYWORDS.includes(keyword.toLowerCase());\n}\n\n/*\n\nFor the reasoning behind this please see:\nhttps://github.com/highlightjs/highlight.js/issues/2880#issuecomment-747275419\n\n*/\n\n/**\n * @type {Record<string, boolean>}\n */\nconst seenDeprecations = {};\n\n/**\n * @param {string} message\n */\nconst error = (message) => {\n console.error(message);\n};\n\n/**\n * @param {string} message\n * @param {any} args\n */\nconst warn = (message, ...args) => {\n console.log(`WARN: ${message}`, ...args);\n};\n\n/**\n * @param {string} version\n * @param {string} message\n */\nconst deprecated = (version, message) => {\n if (seenDeprecations[`${version}/${message}`]) return;\n\n console.log(`Deprecated as of ${version}. ${message}`);\n seenDeprecations[`${version}/${message}`] = true;\n};\n\n/* eslint-disable no-throw-literal */\n\n/**\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n*/\n\nconst MultiClassError = new Error();\n\n/**\n * Renumbers labeled scope names to account for additional inner match\n * groups that otherwise would break everything.\n *\n * Lets say we 3 match scopes:\n *\n * { 1 => ..., 2 => ..., 3 => ... }\n *\n * So what we need is a clean match like this:\n *\n * (a)(b)(c) => [ \"a\", \"b\", \"c\" ]\n *\n * But this falls apart with inner match groups:\n *\n * (a)(((b)))(c) => [\"a\", \"b\", \"b\", \"b\", \"c\" ]\n *\n * Our scopes are now \"out of alignment\" and we're repeating `b` 3 times.\n * What needs to happen is the numbers are remapped:\n *\n * { 1 => ..., 2 => ..., 5 => ... }\n *\n * We also need to know that the ONLY groups that should be output\n * are 1, 2, and 5. This function handles this behavior.\n *\n * @param {CompiledMode} mode\n * @param {Array<RegExp | string>} regexes\n * @param {{key: \"beginScope\"|\"endScope\"}} opts\n */\nfunction remapScopeNames(mode, regexes, { key }) {\n let offset = 0;\n const scopeNames = mode[key];\n /** @type Record<number,boolean> */\n const emit = {};\n /** @type Record<number,string> */\n const positions = {};\n\n for (let i = 1; i <= regexes.length; i++) {\n positions[i + offset] = scopeNames[i];\n emit[i + offset] = true;\n offset += countMatchGroups(regexes[i - 1]);\n }\n // we use _emit to keep track of which match groups are \"top-level\" to avoid double\n // output from inside match groups\n mode[key] = positions;\n mode[key]._emit = emit;\n mode[key]._multi = true;\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction beginMultiClass(mode) {\n if (!Array.isArray(mode.begin)) return;\n\n if (mode.skip || mode.excludeBegin || mode.returnBegin) {\n error(\"skip, excludeBegin, returnBegin not compatible with beginScope: {}\");\n throw MultiClassError;\n }\n\n if (typeof mode.beginScope !== \"object\" || mode.beginScope === null) {\n error(\"beginScope must be object\");\n throw MultiClassError;\n }\n\n remapScopeNames(mode, mode.begin, { key: \"beginScope\" });\n mode.begin = _rewriteBackreferences(mode.begin, { joinWith: \"\" });\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction endMultiClass(mode) {\n if (!Array.isArray(mode.end)) return;\n\n if (mode.skip || mode.excludeEnd || mode.returnEnd) {\n error(\"skip, excludeEnd, returnEnd not compatible with endScope: {}\");\n throw MultiClassError;\n }\n\n if (typeof mode.endScope !== \"object\" || mode.endScope === null) {\n error(\"endScope must be object\");\n throw MultiClassError;\n }\n\n remapScopeNames(mode, mode.end, { key: \"endScope\" });\n mode.end = _rewriteBackreferences(mode.end, { joinWith: \"\" });\n}\n\n/**\n * this exists only to allow `scope: {}` to be used beside `match:`\n * Otherwise `beginScope` would necessary and that would look weird\n\n {\n match: [ /def/, /\\w+/ ]\n scope: { 1: \"keyword\" , 2: \"title\" }\n }\n\n * @param {CompiledMode} mode\n */\nfunction scopeSugar(mode) {\n if (mode.scope && typeof mode.scope === \"object\" && mode.scope !== null) {\n mode.beginScope = mode.scope;\n delete mode.scope;\n }\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction MultiClass(mode) {\n scopeSugar(mode);\n\n if (typeof mode.beginScope === \"string\") {\n mode.beginScope = { _wrap: mode.beginScope };\n }\n if (typeof mode.endScope === \"string\") {\n mode.endScope = { _wrap: mode.endScope };\n }\n\n beginMultiClass(mode);\n endMultiClass(mode);\n}\n\n/**\n@typedef {import('highlight.js').Mode} Mode\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n@typedef {import('highlight.js').Language} Language\n@typedef {import('highlight.js').HLJSPlugin} HLJSPlugin\n@typedef {import('highlight.js').CompiledLanguage} CompiledLanguage\n*/\n\n// compilation\n\n/**\n * Compiles a language definition result\n *\n * Given the raw result of a language definition (Language), compiles this so\n * that it is ready for highlighting code.\n * @param {Language} language\n * @returns {CompiledLanguage}\n */\nfunction compileLanguage(language) {\n /**\n * Builds a regex with the case sensitivity of the current language\n *\n * @param {RegExp | string} value\n * @param {boolean} [global]\n */\n function langRe(value, global) {\n return new RegExp(\n source(value),\n 'm'\n + (language.case_insensitive ? 'i' : '')\n + (language.unicodeRegex ? 'u' : '')\n + (global ? 'g' : '')\n );\n }\n\n /**\n Stores multiple regular expressions and allows you to quickly search for\n them all in a string simultaneously - returning the first match. It does\n this by creating a huge (a|b|c) regex - each individual item wrapped with ()\n and joined by `|` - using match groups to track position. When a match is\n found checking which position in the array has content allows us to figure\n out which of the original regexes / match groups triggered the match.\n\n The match object itself (the result of `Regex.exec`) is returned but also\n enhanced by merging in any meta-data that was registered with the regex.\n This is how we keep track of which mode matched, and what type of rule\n (`illegal`, `begin`, end, etc).\n */\n class MultiRegex {\n constructor() {\n this.matchIndexes = {};\n // @ts-ignore\n this.regexes = [];\n this.matchAt = 1;\n this.position = 0;\n }\n\n // @ts-ignore\n addRule(re, opts) {\n opts.position = this.position++;\n // @ts-ignore\n this.matchIndexes[this.matchAt] = opts;\n this.regexes.push([opts, re]);\n this.matchAt += countMatchGroups(re) + 1;\n }\n\n compile() {\n if (this.regexes.length === 0) {\n // avoids the need to check length every time exec is called\n // @ts-ignore\n this.exec = () => null;\n }\n const terminators = this.regexes.map(el => el[1]);\n this.matcherRe = langRe(_rewriteBackreferences(terminators, { joinWith: '|' }), true);\n this.lastIndex = 0;\n }\n\n /** @param {string} s */\n exec(s) {\n this.matcherRe.lastIndex = this.lastIndex;\n const match = this.matcherRe.exec(s);\n if (!match) { return null; }\n\n // eslint-disable-next-line no-undefined\n const i = match.findIndex((el, i) => i > 0 && el !== undefined);\n // @ts-ignore\n const matchData = this.matchIndexes[i];\n // trim off any earlier non-relevant match groups (ie, the other regex\n // match groups that make up the multi-matcher)\n match.splice(0, i);\n\n return Object.assign(match, matchData);\n }\n }\n\n /*\n Created to solve the key deficiently with MultiRegex - there is no way to\n test for multiple matches at a single location. Why would we need to do\n that? In the future a more dynamic engine will allow certain matches to be\n ignored. An example: if we matched say the 3rd regex in a large group but\n decided to ignore it - we'd need to started testing again at the 4th\n regex... but MultiRegex itself gives us no real way to do that.\n\n So what this class creates MultiRegexs on the fly for whatever search\n position they are needed.\n\n NOTE: These additional MultiRegex objects are created dynamically. For most\n grammars most of the time we will never actually need anything more than the\n first MultiRegex - so this shouldn't have too much overhead.\n\n Say this is our search group, and we match regex3, but wish to ignore it.\n\n regex1 | regex2 | regex3 | regex4 | regex5 ' ie, startAt = 0\n\n What we need is a new MultiRegex that only includes the remaining\n possibilities:\n\n regex4 | regex5 ' ie, startAt = 3\n\n This class wraps all that complexity up in a simple API... `startAt` decides\n where in the array of expressions to start doing the matching. It\n auto-increments, so if a match is found at position 2, then startAt will be\n set to 3. If the end is reached startAt will return to 0.\n\n MOST of the time the parser will be setting startAt manually to 0.\n */\n class ResumableMultiRegex {\n constructor() {\n // @ts-ignore\n this.rules = [];\n // @ts-ignore\n this.multiRegexes = [];\n this.count = 0;\n\n this.lastIndex = 0;\n this.regexIndex = 0;\n }\n\n // @ts-ignore\n getMatcher(index) {\n if (this.multiRegexes[index]) return this.multiRegexes[index];\n\n const matcher = new MultiRegex();\n this.rules.slice(index).forEach(([re, opts]) => matcher.addRule(re, opts));\n matcher.compile();\n this.multiRegexes[index] = matcher;\n return matcher;\n }\n\n resumingScanAtSamePosition() {\n return this.regexIndex !== 0;\n }\n\n considerAll() {\n this.regexIndex = 0;\n }\n\n // @ts-ignore\n addRule(re, opts) {\n this.rules.push([re, opts]);\n if (opts.type === \"begin\") this.count++;\n }\n\n /** @param {string} s */\n exec(s) {\n const m = this.getMatcher(this.regexIndex);\n m.lastIndex = this.lastIndex;\n let result = m.exec(s);\n\n // The following is because we have no easy way to say \"resume scanning at the\n // existing position but also skip the current rule ONLY\". What happens is\n // all prior rules are also skipped which can result in matching the wrong\n // thing. Example of matching \"booger\":\n\n // our matcher is [string, \"booger\", number]\n //\n // ....booger....\n\n // if \"booger\" is ignored then we'd really need a regex to scan from the\n // SAME position for only: [string, number] but ignoring \"booger\" (if it\n // was the first match), a simple resume would scan ahead who knows how\n // far looking only for \"number\", ignoring potential string matches (or\n // future \"booger\" matches that might be valid.)\n\n // So what we do: We execute two matchers, one resuming at the same\n // position, but the second full matcher starting at the position after:\n\n // /--- resume first regex match here (for [number])\n // |/---- full match here for [string, \"booger\", number]\n // vv\n // ....booger....\n\n // Which ever results in a match first is then used. So this 3-4 step\n // process essentially allows us to say \"match at this position, excluding\n // a prior rule that was ignored\".\n //\n // 1. Match \"booger\" first, ignore. Also proves that [string] does non match.\n // 2. Resume matching for [number]\n // 3. Match at index + 1 for [string, \"booger\", number]\n // 4. If #2 and #3 result in matches, which came first?\n if (this.resumingScanAtSamePosition()) {\n if (result && result.index === this.lastIndex) ; else { // use the second matcher result\n const m2 = this.getMatcher(0);\n m2.lastIndex = this.lastIndex + 1;\n result = m2.exec(s);\n }\n }\n\n if (result) {\n this.regexIndex += result.position + 1;\n if (this.regexIndex === this.count) {\n // wrap-around to considering all matches again\n this.considerAll();\n }\n }\n\n return result;\n }\n }\n\n /**\n * Given a mode, builds a huge ResumableMultiRegex that can be used to walk\n * the content and find matches.\n *\n * @param {CompiledMode} mode\n * @returns {ResumableMultiRegex}\n */\n function buildModeRegex(mode) {\n const mm = new ResumableMultiRegex();\n\n mode.contains.forEach(term => mm.addRule(term.begin, { rule: term, type: \"begin\" }));\n\n if (mode.terminatorEnd) {\n mm.addRule(mode.terminatorEnd, { type: \"end\" });\n }\n if (mode.illegal) {\n mm.addRule(mode.illegal, { type: \"illegal\" });\n }\n\n return mm;\n }\n\n /** skip vs abort vs ignore\n *\n * @skip - The mode is still entered and exited normally (and contains rules apply),\n * but all content is held and added to the parent buffer rather than being\n * output when the mode ends. Mostly used with `sublanguage` to build up\n * a single large buffer than can be parsed by sublanguage.\n *\n * - The mode begin ands ends normally.\n * - Content matched is added to the parent mode buffer.\n * - The parser cursor is moved forward normally.\n *\n * @abort - A hack placeholder until we have ignore. Aborts the mode (as if it\n * never matched) but DOES NOT continue to match subsequent `contains`\n * modes. Abort is bad/suboptimal because it can result in modes\n * farther down not getting applied because an earlier rule eats the\n * content but then aborts.\n *\n * - The mode does not begin.\n * - Content matched by `begin` is added to the mode buffer.\n * - The parser cursor is moved forward accordingly.\n *\n * @ignore - Ignores the mode (as if it never matched) and continues to match any\n * subsequent `contains` modes. Ignore isn't technically possible with\n * the current parser implementation.\n *\n * - The mode does not begin.\n * - Content matched by `begin` is ignored.\n * - The parser cursor is not moved forward.\n */\n\n /**\n * Compiles an individual mode\n *\n * This can raise an error if the mode contains certain detectable known logic\n * issues.\n * @param {Mode} mode\n * @param {CompiledMode | null} [parent]\n * @returns {CompiledMode | never}\n */\n function compileMode(mode, parent) {\n const cmode = /** @type CompiledMode */ (mode);\n if (mode.isCompiled) return cmode;\n\n [\n scopeClassName,\n // do this early so compiler extensions generally don't have to worry about\n // the distinction between match/begin\n compileMatch,\n MultiClass,\n beforeMatchExt\n ].forEach(ext => ext(mode, parent));\n\n language.compilerExtensions.forEach(ext => ext(mode, parent));\n\n // __beforeBegin is considered private API, internal use only\n mode.__beforeBegin = null;\n\n [\n beginKeywords,\n // do this later so compiler extensions that come earlier have access to the\n // raw array if they wanted to perhaps manipulate it, etc.\n compileIllegal,\n // default to 1 relevance if not specified\n compileRelevance\n ].forEach(ext => ext(mode, parent));\n\n mode.isCompiled = true;\n\n let keywordPattern = null;\n if (typeof mode.keywords === \"object\" && mode.keywords.$pattern) {\n // we need a copy because keywords might be compiled multiple times\n // so we can't go deleting $pattern from the original on the first\n // pass\n mode.keywords = Object.assign({}, mode.keywords);\n keywordPattern = mode.keywords.$pattern;\n delete mode.keywords.$pattern;\n }\n keywordPattern = keywordPattern || /\\w+/;\n\n if (mode.keywords) {\n mode.keywords = compileKeywords(mode.keywords, language.case_insensitive);\n }\n\n cmode.keywordPatternRe = langRe(keywordPattern, true);\n\n if (parent) {\n if (!mode.begin) mode.begin = /\\B|\\b/;\n cmode.beginRe = langRe(cmode.begin);\n if (!mode.end && !mode.endsWithParent) mode.end = /\\B|\\b/;\n if (mode.end) cmode.endRe = langRe(cmode.end);\n cmode.terminatorEnd = source(cmode.end) || '';\n if (mode.endsWithParent && parent.terminatorEnd) {\n cmode.terminatorEnd += (mode.end ? '|' : '') + parent.terminatorEnd;\n }\n }\n if (mode.illegal) cmode.illegalRe = langRe(/** @type {RegExp | string} */ (mode.illegal));\n if (!mode.contains) mode.contains = [];\n\n mode.contains = [].concat(...mode.contains.map(function(c) {\n return expandOrCloneMode(c === 'self' ? mode : c);\n }));\n mode.contains.forEach(function(c) { compileMode(/** @type Mode */ (c), cmode); });\n\n if (mode.starts) {\n compileMode(mode.starts, parent);\n }\n\n cmode.matcher = buildModeRegex(cmode);\n return cmode;\n }\n\n if (!language.compilerExtensions) language.compilerExtensions = [];\n\n // self is not valid at the top-level\n if (language.contains && language.contains.includes('self')) {\n throw new Error(\"ERR: contains `self` is not supported at the top-level of a language. See documentation.\");\n }\n\n // we need a null object, which inherit will guarantee\n language.classNameAliases = inherit$1(language.classNameAliases || {});\n\n return compileMode(/** @type Mode */ (language));\n}\n\n/**\n * Determines if a mode has a dependency on it's parent or not\n *\n * If a mode does have a parent dependency then often we need to clone it if\n * it's used in multiple places so that each copy points to the correct parent,\n * where-as modes without a parent can often safely be re-used at the bottom of\n * a mode chain.\n *\n * @param {Mode | null} mode\n * @returns {boolean} - is there a dependency on the parent?\n * */\nfunction dependencyOnParent(mode) {\n if (!mode) return false;\n\n return mode.endsWithParent || dependencyOnParent(mode.starts);\n}\n\n/**\n * Expands a mode or clones it if necessary\n *\n * This is necessary for modes with parental dependenceis (see notes on\n * `dependencyOnParent`) and for nodes that have `variants` - which must then be\n * exploded into their own individual modes at compile time.\n *\n * @param {Mode} mode\n * @returns {Mode | Mode[]}\n * */\nfunction expandOrCloneMode(mode) {\n if (mode.variants && !mode.cachedVariants) {\n mode.cachedVariants = mode.variants.map(function(variant) {\n return inherit$1(mode, { variants: null }, variant);\n });\n }\n\n // EXPAND\n // if we have variants then essentially \"replace\" the mode with the variants\n // this happens in compileMode, where this function is called from\n if (mode.cachedVariants) {\n return mode.cachedVariants;\n }\n\n // CLONE\n // if we have dependencies on parents then we need a unique\n // instance of ourselves, so we can be reused with many\n // different parents without issue\n if (dependencyOnParent(mode)) {\n return inherit$1(mode, { starts: mode.starts ? inherit$1(mode.starts) : null });\n }\n\n if (Object.isFrozen(mode)) {\n return inherit$1(mode);\n }\n\n // no special dependency issues, just return ourselves\n return mode;\n}\n\nvar version = \"11.5.1\";\n\nclass HTMLInjectionError extends Error {\n constructor(reason, html) {\n super(reason);\n this.name = \"HTMLInjectionError\";\n this.html = html;\n }\n}\n\n/*\nSyntax highlighting with language autodetection.\nhttps://highlightjs.org/\n*/\n\n/**\n@typedef {import('highlight.js').Mode} Mode\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n@typedef {import('highlight.js').CompiledScope} CompiledScope\n@typedef {import('highlight.js').Language} Language\n@typedef {import('highlight.js').HLJSApi} HLJSApi\n@typedef {import('highlight.js').HLJSPlugin} HLJSPlugin\n@typedef {import('highlight.js').PluginEvent} PluginEvent\n@typedef {import('highlight.js').HLJSOptions} HLJSOptions\n@typedef {import('highlight.js').LanguageFn} LanguageFn\n@typedef {import('highlight.js').HighlightedHTMLElement} HighlightedHTMLElement\n@typedef {import('highlight.js').BeforeHighlightContext} BeforeHighlightContext\n@typedef {import('highlight.js/private').MatchType} MatchType\n@typedef {import('highlight.js/private').KeywordData} KeywordData\n@typedef {import('highlight.js/private').EnhancedMatch} EnhancedMatch\n@typedef {import('highlight.js/private').AnnotatedError} AnnotatedError\n@typedef {import('highlight.js').AutoHighlightResult} AutoHighlightResult\n@typedef {import('highlight.js').HighlightOptions} HighlightOptions\n@typedef {import('highlight.js').HighlightResult} HighlightResult\n*/\n\n\nconst escape = escapeHTML;\nconst inherit = inherit$1;\nconst NO_MATCH = Symbol(\"nomatch\");\nconst MAX_KEYWORD_HITS = 7;\n\n/**\n * @param {any} hljs - object that is extended (legacy)\n * @returns {HLJSApi}\n */\nconst HLJS = function(hljs) {\n // Global internal variables used within the highlight.js library.\n /** @type {Record<string, Language>} */\n const languages = Object.create(null);\n /** @type {Record<string, string>} */\n const aliases = Object.create(null);\n /** @type {HLJSPlugin[]} */\n const plugins = [];\n\n // safe/production mode - swallows more errors, tries to keep running\n // even if a single syntax or parse hits a fatal error\n let SAFE_MODE = true;\n const LANGUAGE_NOT_FOUND = \"Could not find the language '{}', did you forget to load/include a language module?\";\n /** @type {Language} */\n const PLAINTEXT_LANGUAGE = { disableAutodetect: true, name: 'Plain text', contains: [] };\n\n // Global options used when within external APIs. This is modified when\n // calling the `hljs.configure` function.\n /** @type HLJSOptions */\n let options = {\n ignoreUnescapedHTML: false,\n throwUnescapedHTML: false,\n noHighlightRe: /^(no-?highlight)$/i,\n languageDetectRe: /\\blang(?:uage)?-([\\w-]+)\\b/i,\n classPrefix: 'hljs-',\n cssSelector: 'pre code',\n languages: null,\n // beta configuration options, subject to change, welcome to discuss\n // https://github.com/highlightjs/highlight.js/issues/1086\n __emitter: TokenTreeEmitter\n };\n\n /* Utility functions */\n\n /**\n * Tests a language name to see if highlighting should be skipped\n * @param {string} languageName\n */\n function shouldNotHighlight(languageName) {\n return options.noHighlightRe.test(languageName);\n }\n\n /**\n * @param {HighlightedHTMLElement} block - the HTML element to determine language for\n */\n function blockLanguage(block) {\n let classes = block.className + ' ';\n\n classes += block.parentNode ? block.parentNode.className : '';\n\n // language-* takes precedence over non-prefixed class names.\n const match = options.languageDetectRe.exec(classes);\n if (match) {\n const language = getLanguage(match[1]);\n if (!language) {\n warn(LANGUAGE_NOT_FOUND.replace(\"{}\", match[1]));\n warn(\"Falling back to no-highlight mode for this block.\", block);\n }\n return language ? match[1] : 'no-highlight';\n }\n\n return classes\n .split(/\\s+/)\n .find((_class) => shouldNotHighlight(_class) || getLanguage(_class));\n }\n\n /**\n * Core highlighting function.\n *\n * OLD API\n * highlight(lang, code, ignoreIllegals, continuation)\n *\n * NEW API\n * highlight(code, {lang, ignoreIllegals})\n *\n * @param {string} codeOrLanguageName - the language to use for highlighting\n * @param {string | HighlightOptions} optionsOrCode - the code to highlight\n * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n *\n * @returns {HighlightResult} Result - an object that represents the result\n * @property {string} language - the language name\n * @property {number} relevance - the relevance score\n * @property {string} value - the highlighted HTML code\n * @property {string} code - the original raw code\n * @property {CompiledMode} top - top of the current mode stack\n * @property {boolean} illegal - indicates whether any illegal matches were found\n */\n function highlight(codeOrLanguageName, optionsOrCode, ignoreIllegals) {\n let code = \"\";\n let languageName = \"\";\n if (typeof optionsOrCode === \"object\") {\n code = codeOrLanguageName;\n ignoreIllegals = optionsOrCode.ignoreIllegals;\n languageName = optionsOrCode.language;\n } else {\n // old API\n deprecated(\"10.7.0\", \"highlight(lang, code, ...args) has been deprecated.\");\n deprecated(\"10.7.0\", \"Please use highlight(code, options) instead.\\nhttps://github.com/highlightjs/highlight.js/issues/2277\");\n languageName = codeOrLanguageName;\n code = optionsOrCode;\n }\n\n // https://github.com/highlightjs/highlight.js/issues/3149\n // eslint-disable-next-line no-undefined\n if (ignoreIllegals === undefined) { ignoreIllegals = true; }\n\n /** @type {BeforeHighlightContext} */\n const context = {\n code,\n language: languageName\n };\n // the plugin can change the desired language or the code to be highlighted\n // just be changing the object it was passed\n fire(\"before:highlight\", context);\n\n // a before plugin can usurp the result completely by providing it's own\n // in which case we don't even need to call highlight\n const result = context.result\n ? context.result\n : _highlight(context.language, context.code, ignoreIllegals);\n\n result.code = context.code;\n // the plugin can change anything in result to suite it\n fire(\"after:highlight\", result);\n\n return result;\n }\n\n /**\n * private highlight that's used internally and does not fire callbacks\n *\n * @param {string} languageName - the language to use for highlighting\n * @param {string} codeToHighlight - the code to highlight\n * @param {boolean?} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n * @param {CompiledMode?} [continuation] - current continuation mode, if any\n * @returns {HighlightResult} - result of the highlight operation\n */\n function _highlight(languageName, codeToHighlight, ignoreIllegals, continuation) {\n const keywordHits = Object.create(null);\n\n /**\n * Return keyword data if a match is a keyword\n * @param {CompiledMode} mode - current mode\n * @param {string} matchText - the textual match\n * @returns {KeywordData | false}\n */\n function keywordData(mode, matchText) {\n return mode.keywords[matchText];\n }\n\n function processKeywords() {\n if (!top.keywords) {\n emitter.addText(modeBuffer);\n return;\n }\n\n let lastIndex = 0;\n top.keywordPatternRe.lastIndex = 0;\n let match = top.keywordPatternRe.exec(modeBuffer);\n let buf = \"\";\n\n while (match) {\n buf += modeBuffer.substring(lastIndex, match.index);\n const word = language.case_insensitive ? match[0].toLowerCase() : match[0];\n const data = keywordData(top, word);\n if (data) {\n const [kind, keywordRelevance] = data;\n emitter.addText(buf);\n buf = \"\";\n\n keywordHits[word] = (keywordHits[word] || 0) + 1;\n if (keywordHits[word] <= MAX_KEYWORD_HITS) relevance += keywordRelevance;\n if (kind.startsWith(\"_\")) {\n // _ implied for relevance only, do not highlight\n // by applying a class name\n buf += match[0];\n } else {\n const cssClass = language.classNameAliases[kind] || kind;\n emitter.addKeyword(match[0], cssClass);\n }\n } else {\n buf += match[0];\n }\n lastIndex = top.keywordPatternRe.lastIndex;\n match = top.keywordPatternRe.exec(modeBuffer);\n }\n buf += modeBuffer.substr(lastIndex);\n emitter.addText(buf);\n }\n\n function processSubLanguage() {\n if (modeBuffer === \"\") return;\n /** @type HighlightResult */\n let result = null;\n\n if (typeof top.subLanguage === 'string') {\n if (!languages[top.subLanguage]) {\n emitter.addText(modeBuffer);\n return;\n }\n result = _highlight(top.subLanguage, modeBuffer, true, continuations[top.subLanguage]);\n continuations[top.subLanguage] = /** @type {CompiledMode} */ (result._top);\n } else {\n result = highlightAuto(modeBuffer, top.subLanguage.length ? top.subLanguage : null);\n }\n\n // Counting embedded language score towards the host language may be disabled\n // with zeroing the containing mode relevance. Use case in point is Markdown that\n // allows XML everywhere and makes every XML snippet to have a much larger Markdown\n // score.\n if (top.relevance > 0) {\n relevance += result.relevance;\n }\n emitter.addSublanguage(result._emitter, result.language);\n }\n\n function processBuffer() {\n if (top.subLanguage != null) {\n processSubLanguage();\n } else {\n processKeywords();\n }\n modeBuffer = '';\n }\n\n /**\n * @param {CompiledScope} scope\n * @param {RegExpMatchArray} match\n */\n function emitMultiClass(scope, match) {\n let i = 1;\n const max = match.length - 1;\n while (i <= max) {\n if (!scope._emit[i]) { i++; continue; }\n const klass = language.classNameAliases[scope[i]] || scope[i];\n const text = match[i];\n if (klass) {\n emitter.addKeyword(text, klass);\n } else {\n modeBuffer = text;\n processKeywords();\n modeBuffer = \"\";\n }\n i++;\n }\n }\n\n /**\n * @param {CompiledMode} mode - new mode to start\n * @param {RegExpMatchArray} match\n */\n function startNewMode(mode, match) {\n if (mode.scope && typeof mode.scope === \"string\") {\n emitter.openNode(language.classNameAliases[mode.scope] || mode.scope);\n }\n if (mode.beginScope) {\n // beginScope just wraps the begin match itself in a scope\n if (mode.beginScope._wrap) {\n emitter.addKeyword(modeBuffer, language.classNameAliases[mode.beginScope._wrap] || mode.beginScope._wrap);\n modeBuffer = \"\";\n } else if (mode.beginScope._multi) {\n // at this point modeBuffer should just be the match\n emitMultiClass(mode.beginScope, match);\n modeBuffer = \"\";\n }\n }\n\n top = Object.create(mode, { parent: { value: top } });\n return top;\n }\n\n /**\n * @param {CompiledMode } mode - the mode to potentially end\n * @param {RegExpMatchArray} match - the latest match\n * @param {string} matchPlusRemainder - match plus remainder of content\n * @returns {CompiledMode | void} - the next mode, or if void continue on in current mode\n */\n function endOfMode(mode, match, matchPlusRemainder) {\n let matched = startsWith(mode.endRe, matchPlusRemainder);\n\n if (matched) {\n if (mode[\"on:end\"]) {\n const resp = new Response(mode);\n mode[\"on:end\"](match, resp);\n if (resp.isMatchIgnored) matched = false;\n }\n\n if (matched) {\n while (mode.endsParent && mode.parent) {\n mode = mode.parent;\n }\n return mode;\n }\n }\n // even if on:end fires an `ignore` it's still possible\n // that we might trigger the end node because of a parent mode\n if (mode.endsWithParent) {\n return endOfMode(mode.parent, match, matchPlusRemainder);\n }\n }\n\n /**\n * Handle matching but then ignoring a sequence of text\n *\n * @param {string} lexeme - string containing full match text\n */\n function doIgnore(lexeme) {\n if (top.matcher.regexIndex === 0) {\n // no more regexes to potentially match here, so we move the cursor forward one\n // space\n modeBuffer += lexeme[0];\n return 1;\n } else {\n // no need to move the cursor, we still have additional regexes to try and\n // match at this very spot\n resumeScanAtSamePosition = true;\n return 0;\n }\n }\n\n /**\n * Handle the start of a new potential mode match\n *\n * @param {EnhancedMatch} match - the current match\n * @returns {number} how far to advance the parse cursor\n */\n function doBeginMatch(match) {\n const lexeme = match[0];\n const newMode = match.rule;\n\n const resp = new Response(newMode);\n // first internal before callbacks, then the public ones\n const beforeCallbacks = [newMode.__beforeBegin, newMode[\"on:begin\"]];\n for (const cb of beforeCallbacks) {\n if (!cb) continue;\n cb(match, resp);\n if (resp.isMatchIgnored) return doIgnore(lexeme);\n }\n\n if (newMode.skip) {\n modeBuffer += lexeme;\n } else {\n if (newMode.excludeBegin) {\n modeBuffer += lexeme;\n }\n processBuffer();\n if (!newMode.returnBegin && !newMode.excludeBegin) {\n modeBuffer = lexeme;\n }\n }\n startNewMode(newMode, match);\n return newMode.returnBegin ? 0 : lexeme.length;\n }\n\n /**\n * Handle the potential end of mode\n *\n * @param {RegExpMatchArray} match - the current match\n */\n function doEndMatch(match) {\n const lexeme = match[0];\n const matchPlusRemainder = codeToHighlight.substr(match.index);\n\n const endMode = endOfMode(top, match, matchPlusRemainder);\n if (!endMode) { return NO_MATCH; }\n\n const origin = top;\n if (top.endScope && top.endScope._wrap) {\n processBuffer();\n emitter.addKeyword(lexeme, top.endScope._wrap);\n } else if (top.endScope && top.endScope._multi) {\n processBuffer();\n emitMultiClass(top.endScope, match);\n } else if (origin.skip) {\n modeBuffer += lexeme;\n } else {\n if (!(origin.returnEnd || origin.excludeEnd)) {\n modeBuffer += lexeme;\n }\n processBuffer();\n if (origin.excludeEnd) {\n modeBuffer = lexeme;\n }\n }\n do {\n if (top.scope) {\n emitter.closeNode();\n }\n if (!top.skip && !top.subLanguage) {\n relevance += top.relevance;\n }\n top = top.parent;\n } while (top !== endMode.parent);\n if (endMode.starts) {\n startNewMode(endMode.starts, match);\n }\n return origin.returnEnd ? 0 : lexeme.length;\n }\n\n function processContinuations() {\n const list = [];\n for (let current = top; current !== language; current = current.parent) {\n if (current.scope) {\n list.unshift(current.scope);\n }\n }\n list.forEach(item => emitter.openNode(item));\n }\n\n /** @type {{type?: MatchType, index?: number, rule?: Mode}}} */\n let lastMatch = {};\n\n /**\n * Process an individual match\n *\n * @param {string} textBeforeMatch - text preceding the match (since the last match)\n * @param {EnhancedMatch} [match] - the match itself\n */\n function processLexeme(textBeforeMatch, match) {\n const lexeme = match && match[0];\n\n // add non-matched text to the current mode buffer\n modeBuffer += textBeforeMatch;\n\n if (lexeme == null) {\n processBuffer();\n return 0;\n }\n\n // we've found a 0 width match and we're stuck, so we need to advance\n // this happens when we have badly behaved rules that have optional matchers to the degree that\n // sometimes they can end up matching nothing at all\n // Ref: https://github.com/highlightjs/highlight.js/issues/2140\n if (lastMatch.type === \"begin\" && match.type === \"end\" && lastMatch.index === match.index && lexeme === \"\") {\n // spit the \"skipped\" character that our regex choked on back into the output sequence\n modeBuffer += codeToHighlight.slice(match.index, match.index + 1);\n if (!SAFE_MODE) {\n /** @type {AnnotatedError} */\n const err = new Error(`0 width match regex (${languageName})`);\n err.languageName = languageName;\n err.badRule = lastMatch.rule;\n throw err;\n }\n return 1;\n }\n lastMatch = match;\n\n if (match.type === \"begin\") {\n return doBeginMatch(match);\n } else if (match.type === \"illegal\" && !ignoreIllegals) {\n // illegal match, we do not continue processing\n /** @type {AnnotatedError} */\n const err = new Error('Illegal lexeme \"' + lexeme + '\" for mode \"' + (top.scope || '<unnamed>') + '\"');\n err.mode = top;\n throw err;\n } else if (match.type === \"end\") {\n const processed = doEndMatch(match);\n if (processed !== NO_MATCH) {\n return processed;\n }\n }\n\n // edge case for when illegal matches $ (end of line) which is technically\n // a 0 width match but not a begin/end match so it's not caught by the\n // first handler (when ignoreIllegals is true)\n if (match.type === \"illegal\" && lexeme === \"\") {\n // advance so we aren't stuck in an infinite loop\n return 1;\n }\n\n // infinite loops are BAD, this is a last ditch catch all. if we have a\n // decent number of iterations yet our index (cursor position in our\n // parsing) still 3x behind our index then something is very wrong\n // so we bail\n if (iterations > 100000 && iterations > match.index * 3) {\n const err = new Error('potential infinite loop, way more iterations than matches');\n throw err;\n }\n\n /*\n Why might be find ourselves here? An potential end match that was\n triggered but could not be completed. IE, `doEndMatch` returned NO_MATCH.\n (this could be because a callback requests the match be ignored, etc)\n\n This causes no real harm other than stopping a few times too many.\n */\n\n modeBuffer += lexeme;\n return lexeme.length;\n }\n\n const language = getLanguage(languageName);\n if (!language) {\n error(LANGUAGE_NOT_FOUND.replace(\"{}\", languageName));\n throw new Error('Unknown language: \"' + languageName + '\"');\n }\n\n const md = compileLanguage(language);\n let result = '';\n /** @type {CompiledMode} */\n let top = continuation || md;\n /** @type Record<string,CompiledMode> */\n const continuations = {}; // keep continuations for sub-languages\n const emitter = new options.__emitter(options);\n processContinuations();\n let modeBuffer = '';\n let relevance = 0;\n let index = 0;\n let iterations = 0;\n let resumeScanAtSamePosition = false;\n\n try {\n top.matcher.considerAll();\n\n for (;;) {\n iterations++;\n if (resumeScanAtSamePosition) {\n // only regexes not matched previously will now be\n // considered for a potential match\n resumeScanAtSamePosition = false;\n } else {\n top.matcher.considerAll();\n }\n top.matcher.lastIndex = index;\n\n const match = top.matcher.exec(codeToHighlight);\n // console.log(\"match\", match[0], match.rule && match.rule.begin)\n\n if (!match) break;\n\n const beforeMatch = codeToHighlight.substring(index, match.index);\n const processedCount = processLexeme(beforeMatch, match);\n index = match.index + processedCount;\n }\n processLexeme(codeToHighlight.substr(index));\n emitter.closeAllNodes();\n emitter.finalize();\n result = emitter.toHTML();\n\n return {\n language: languageName,\n value: result,\n relevance: relevance,\n illegal: false,\n _emitter: emitter,\n _top: top\n };\n } catch (err) {\n if (err.message && err.message.includes('Illegal')) {\n return {\n language: languageName,\n value: escape(codeToHighlight),\n illegal: true,\n relevance: 0,\n _illegalBy: {\n message: err.message,\n index: index,\n context: codeToHighlight.slice(index - 100, index + 100),\n mode: err.mode,\n resultSoFar: result\n },\n _emitter: emitter\n };\n } else if (SAFE_MODE) {\n return {\n language: languageName,\n value: escape(codeToHighlight),\n illegal: false,\n relevance: 0,\n errorRaised: err,\n _emitter: emitter,\n _top: top\n };\n } else {\n throw err;\n }\n }\n }\n\n /**\n * returns a valid highlight result, without actually doing any actual work,\n * auto highlight starts with this and it's possible for small snippets that\n * auto-detection may not find a better match\n * @param {string} code\n * @returns {HighlightResult}\n */\n function justTextHighlightResult(code) {\n const result = {\n value: escape(code),\n illegal: false,\n relevance: 0,\n _top: PLAINTEXT_LANGUAGE,\n _emitter: new options.__emitter(options)\n };\n result._emitter.addText(code);\n return result;\n }\n\n /**\n Highlighting with language detection. Accepts a string with the code to\n highlight. Returns an object with the following properties:\n\n - language (detected language)\n - relevance (int)\n - value (an HTML string with highlighting markup)\n - secondBest (object with the same structure for second-best heuristically\n detected language, may be absent)\n\n @param {string} code\n @param {Array<string>} [languageSubset]\n @returns {AutoHighlightResult}\n */\n function highlightAuto(code, languageSubset) {\n languageSubset = languageSubset || options.languages || Object.keys(languages);\n const plaintext = justTextHighlightResult(code);\n\n const results = languageSubset.filter(getLanguage).filter(autoDetection).map(name =>\n _highlight(name, code, false)\n );\n results.unshift(plaintext); // plaintext is always an option\n\n const sorted = results.sort((a, b) => {\n // sort base on relevance\n if (a.relevance !== b.relevance) return b.relevance - a.relevance;\n\n // always award the tie to the base language\n // ie if C++ and Arduino are tied, it's more likely to be C++\n if (a.language && b.language) {\n if (getLanguage(a.language).supersetOf === b.language) {\n return 1;\n } else if (getLanguage(b.language).supersetOf === a.language) {\n return -1;\n }\n }\n\n // otherwise say they are equal, which has the effect of sorting on\n // relevance while preserving the original ordering - which is how ties\n // have historically been settled, ie the language that comes first always\n // wins in the case of a tie\n return 0;\n });\n\n const [best, secondBest] = sorted;\n\n /** @type {AutoHighlightResult} */\n const result = best;\n result.secondBest = secondBest;\n\n return result;\n }\n\n /**\n * Builds new class name for block given the language name\n *\n * @param {HTMLElement} element\n * @param {string} [currentLang]\n * @param {string} [resultLang]\n */\n function updateClassName(element, currentLang, resultLang) {\n const language = (currentLang && aliases[currentLang]) || resultLang;\n\n element.classList.add(\"hljs\");\n element.classList.add(`language-${language}`);\n }\n\n /**\n * Applies highlighting to a DOM node containing code.\n *\n * @param {HighlightedHTMLElement} element - the HTML element to highlight\n */\n function highlightElement(element) {\n /** @type HTMLElement */\n let node = null;\n const language = blockLanguage(element);\n\n if (shouldNotHighlight(language)) return;\n\n fire(\"before:highlightElement\",\n { el: element, language: language });\n\n // we should be all text, no child nodes (unescaped HTML) - this is possibly\n // an HTML injection attack - it's likely too late if this is already in\n // production (the code has likely already done its damage by the time\n // we're seeing it)... but we yell loudly about this so that hopefully it's\n // more likely to be caught in development before making it to production\n if (element.children.length > 0) {\n if (!options.ignoreUnescapedHTML) {\n console.warn(\"One of your code blocks includes unescaped HTML. This is a potentially serious security risk.\");\n console.warn(\"https://github.com/highlightjs/highlight.js/wiki/security\");\n console.warn(\"The element with unescaped HTML:\");\n console.warn(element);\n }\n if (options.throwUnescapedHTML) {\n const err = new HTMLInjectionError(\n \"One of your code blocks includes unescaped HTML.\",\n element.innerHTML\n );\n throw err;\n }\n }\n\n node = element;\n const text = node.textContent;\n const result = language ? highlight(text, { language, ignoreIllegals: true }) : highlightAuto(text);\n\n element.innerHTML = result.value;\n updateClassName(element, language, result.language);\n element.result = {\n language: result.language,\n // TODO: remove with version 11.0\n re: result.relevance,\n relevance: result.relevance\n };\n if (result.secondBest) {\n element.secondBest = {\n language: result.secondBest.language,\n relevance: result.secondBest.relevance\n };\n }\n\n fire(\"after:highlightElement\", { el: element, result, text });\n }\n\n /**\n * Updates highlight.js global options with the passed options\n *\n * @param {Partial<HLJSOptions>} userOptions\n */\n function configure(userOptions) {\n options = inherit(options, userOptions);\n }\n\n // TODO: remove v12, deprecated\n const initHighlighting = () => {\n highlightAll();\n deprecated(\"10.6.0\", \"initHighlighting() deprecated. Use highlightAll() now.\");\n };\n\n // TODO: remove v12, deprecated\n function initHighlightingOnLoad() {\n highlightAll();\n deprecated(\"10.6.0\", \"initHighlightingOnLoad() deprecated. Use highlightAll() now.\");\n }\n\n let wantsHighlight = false;\n\n /**\n * auto-highlights all pre>code elements on the page\n */\n function highlightAll() {\n // if we are called too early in the loading process\n if (document.readyState === \"loading\") {\n wantsHighlight = true;\n return;\n }\n\n const blocks = document.querySelectorAll(options.cssSelector);\n blocks.forEach(highlightElement);\n }\n\n function boot() {\n // if a highlight was requested before DOM was loaded, do now\n if (wantsHighlight) highlightAll();\n }\n\n // make sure we are in the browser environment\n if (typeof window !== 'undefined' && window.addEventListener) {\n window.addEventListener('DOMContentLoaded', boot, false);\n }\n\n /**\n * Register a language grammar module\n *\n * @param {string} languageName\n * @param {LanguageFn} languageDefinition\n */\n function registerLanguage(languageName, languageDefinition) {\n let lang = null;\n try {\n lang = languageDefinition(hljs);\n } catch (error$1) {\n error(\"Language definition for '{}' could not be registered.\".replace(\"{}\", languageName));\n // hard or soft error\n if (!SAFE_MODE) { throw error$1; } else { error(error$1); }\n // languages that have serious errors are replaced with essentially a\n // \"plaintext\" stand-in so that the code blocks will still get normal\n // css classes applied to them - and one bad language won't break the\n // entire highlighter\n lang = PLAINTEXT_LANGUAGE;\n }\n // give it a temporary name if it doesn't have one in the meta-data\n if (!lang.name) lang.name = languageName;\n languages[languageName] = lang;\n lang.rawDefinition = languageDefinition.bind(null, hljs);\n\n if (lang.aliases) {\n registerAliases(lang.aliases, { languageName });\n }\n }\n\n /**\n * Remove a language grammar module\n *\n * @param {string} languageName\n */\n function unregisterLanguage(languageName) {\n delete languages[languageName];\n for (const alias of Object.keys(aliases)) {\n if (aliases[alias] === languageName) {\n delete aliases[alias];\n }\n }\n }\n\n /**\n * @returns {string[]} List of language internal names\n */\n function listLanguages() {\n return Object.keys(languages);\n }\n\n /**\n * @param {string} name - name of the language to retrieve\n * @returns {Language | undefined}\n */\n function getLanguage(name) {\n name = (name || '').toLowerCase();\n return languages[name] || languages[aliases[name]];\n }\n\n /**\n *\n * @param {string|string[]} aliasList - single alias or list of aliases\n * @param {{languageName: string}} opts\n */\n function registerAliases(aliasList, { languageName }) {\n if (typeof aliasList === 'string') {\n aliasList = [aliasList];\n }\n aliasList.forEach(alias => { aliases[alias.toLowerCase()] = languageName; });\n }\n\n /**\n * Determines if a given language has auto-detection enabled\n * @param {string} name - name of the language\n */\n function autoDetection(name) {\n const lang = getLanguage(name);\n return lang && !lang.disableAutodetect;\n }\n\n /**\n * Upgrades the old highlightBlock plugins to the new\n * highlightElement API\n * @param {HLJSPlugin} plugin\n */\n function upgradePluginAPI(plugin) {\n // TODO: remove with v12\n if (plugin[\"before:highlightBlock\"] && !plugin[\"before:highlightElement\"]) {\n plugin[\"before:highlightElement\"] = (data) => {\n plugin[\"before:highlightBlock\"](\n Object.assign({ block: data.el }, data)\n );\n };\n }\n if (plugin[\"after:highlightBlock\"] && !plugin[\"after:highlightElement\"]) {\n plugin[\"after:highlightElement\"] = (data) => {\n plugin[\"after:highlightBlock\"](\n Object.assign({ block: data.el }, data)\n );\n };\n }\n }\n\n /**\n * @param {HLJSPlugin} plugin\n */\n function addPlugin(plugin) {\n upgradePluginAPI(plugin);\n plugins.push(plugin);\n }\n\n /**\n *\n * @param {PluginEvent} event\n * @param {any} args\n */\n function fire(event, args) {\n const cb = event;\n plugins.forEach(function(plugin) {\n if (plugin[cb]) {\n plugin[cb](args);\n }\n });\n }\n\n /**\n * DEPRECATED\n * @param {HighlightedHTMLElement} el\n */\n function deprecateHighlightBlock(el) {\n deprecated(\"10.7.0\", \"highlightBlock will be removed entirely in v12.0\");\n deprecated(\"10.7.0\", \"Please use highlightElement now.\");\n\n return highlightElement(el);\n }\n\n /* Interface definition */\n Object.assign(hljs, {\n highlight,\n highlightAuto,\n highlightAll,\n highlightElement,\n // TODO: Remove with v12 API\n highlightBlock: deprecateHighlightBlock,\n configure,\n initHighlighting,\n initHighlightingOnLoad,\n registerLanguage,\n unregisterLanguage,\n listLanguages,\n getLanguage,\n registerAliases,\n autoDetection,\n inherit,\n addPlugin\n });\n\n hljs.debugMode = function() { SAFE_MODE = false; };\n hljs.safeMode = function() { SAFE_MODE = true; };\n hljs.versionString = version;\n\n hljs.regex = {\n concat: concat,\n lookahead: lookahead,\n either: either,\n optional: optional,\n anyNumberOfTimes: anyNumberOfTimes\n };\n\n for (const key in MODES) {\n // @ts-ignore\n if (typeof MODES[key] === \"object\") {\n // @ts-ignore\n deepFreeze$1(MODES[key]);\n }\n }\n\n // merge all the modes/regexes into our main object\n Object.assign(hljs, MODES);\n\n return hljs;\n};\n\n// export an \"instance\" of the highlighter\nvar highlight = HLJS({});\n\nmodule.exports = highlight;\nhighlight.HighlightJS = highlight;\nhighlight.default = highlight;\n","//\n// format - printf-like string formatting for JavaScript\n// github.com/samsonjs/format\n// @_sjs\n//\n// Copyright 2010 - 2013 Sami Samhuri <sami@samhuri.net>\n//\n// MIT License\n// http://sjs.mit-license.org\n//\n\n;(function() {\n\n //// Export the API\n var namespace;\n\n // CommonJS / Node module\n if (typeof module !== 'undefined') {\n namespace = module.exports = format;\n }\n\n // Browsers and other environments\n else {\n // Get the global object. Works in ES3, ES5, and ES5 strict mode.\n namespace = (function(){ return this || (1,eval)('this') }());\n }\n\n namespace.format = format;\n namespace.vsprintf = vsprintf;\n\n if (typeof console !== 'undefined' && typeof console.log === 'function') {\n namespace.printf = printf;\n }\n\n function printf(/* ... */) {\n console.log(format.apply(null, arguments));\n }\n\n function vsprintf(fmt, replacements) {\n return format.apply(null, [fmt].concat(replacements));\n }\n\n function format(fmt) {\n var argIndex = 1 // skip initial format argument\n , args = [].slice.call(arguments)\n , i = 0\n , n = fmt.length\n , result = ''\n , c\n , escaped = false\n , arg\n , tmp\n , leadingZero = false\n , precision\n , nextArg = function() { return args[argIndex++]; }\n , slurpNumber = function() {\n var digits = '';\n while (/\\d/.test(fmt[i])) {\n digits += fmt[i++];\n c = fmt[i];\n }\n return digits.length > 0 ? parseInt(digits) : null;\n }\n ;\n for (; i < n; ++i) {\n c = fmt[i];\n if (escaped) {\n escaped = false;\n if (c == '.') {\n leadingZero = false;\n c = fmt[++i];\n }\n else if (c == '0' && fmt[i + 1] == '.') {\n leadingZero = true;\n i += 2;\n c = fmt[i];\n }\n else {\n leadingZero = true;\n }\n precision = slurpNumber();\n switch (c) {\n case 'b': // number in binary\n result += parseInt(nextArg(), 10).toString(2);\n break;\n case 'c': // character\n arg = nextArg();\n if (typeof arg === 'string' || arg instanceof String)\n result += arg;\n else\n result += String.fromCharCode(parseInt(arg, 10));\n break;\n case 'd': // number in decimal\n result += parseInt(nextArg(), 10);\n break;\n case 'f': // floating point number\n tmp = String(parseFloat(nextArg()).toFixed(precision || 6));\n result += leadingZero ? tmp : tmp.replace(/^0/, '');\n break;\n case 'j': // JSON\n result += JSON.stringify(nextArg());\n break;\n case 'o': // number in octal\n result += '0' + parseInt(nextArg(), 10).toString(8);\n break;\n case 's': // string\n result += nextArg();\n break;\n case 'x': // lowercase hexadecimal\n result += '0x' + parseInt(nextArg(), 10).toString(16);\n break;\n case 'X': // uppercase hexadecimal\n result += '0x' + parseInt(nextArg(), 10).toString(16).toUpperCase();\n break;\n default:\n result += c;\n break;\n }\n } else if (c === '%') {\n escaped = true;\n } else {\n result += c;\n }\n }\n return result;\n }\n\n}());\n","// @ts-expect-error\nimport formatter from 'format'\n\nexport const fault = Object.assign(create(Error), {\n eval: create(EvalError),\n range: create(RangeError),\n reference: create(ReferenceError),\n syntax: create(SyntaxError),\n type: create(TypeError),\n uri: create(URIError)\n})\n\n/**\n * Create a new `EConstructor`, with the formatted `format` as a first argument.\n *\n * @template {Error} Fault\n * @template {new (reason: string) => Fault} Class\n * @param {Class} Constructor\n */\nexport function create(Constructor) {\n /** @type {string} */\n // @ts-expect-error\n FormattedError.displayName = Constructor.displayName || Constructor.name\n\n return FormattedError\n\n /**\n * Create an error with a printf-like formatted message.\n *\n * @param {string|null} [format]\n * Template string.\n * @param {...unknown} values\n * Values to render in `format`.\n * @returns {Fault}\n */\n function FormattedError(format, ...values) {\n /** @type {string} */\n const reason = format ? formatter(format, ...values) : format\n return new Constructor(reason)\n }\n}\n","/**\n * @typedef {import('hast').Text} Text\n * @typedef {import('highlight.js').HighlightResult} HighlightResult\n * @typedef {import('highlight.js').HLJSOptions} HighlightOptions\n * @typedef {import('highlight.js').LanguageFn} HighlightSyntax\n * @typedef {import('highlight.js').Emitter} HighlightEmitter\n *\n * @typedef {{type: 'element', tagName: 'span', properties: {className: Array<string>}, children: Array<Span|Text>}} Span\n * @typedef {{type: 'root', data: {language: string|null, relevance: number}, children: Array<Span|Text>}} Root\n *\n * @typedef {Object} ExtraOptions\n * @property {Array<string>} [subset]\n * List of allowed languages, defaults to all registered languages.\n *\n * @typedef {Object} Options\n * Configuration.\n * @property {string} [prefix='hljs-']\n * Class prefix.\n *\n * @typedef {Options & ExtraOptions} AutoOptions\n */\n\nimport high from 'highlight.js/lib/core'\nimport {fault} from 'fault'\n\nconst own = {}.hasOwnProperty\n\nconst defaultPrefix = 'hljs-'\n\n/**\n * Highlight `value` (code) as `language` (name).\n *\n * @param {string} language\n * Programming language name.\n * @param {string} value\n * Code to highlight.\n * @param {Options} [options={}]\n * Configuration.\n * @returns {Root}\n * A hast `Root` node.\n */\nfunction highlight(language, value, options = {}) {\n let prefix = options.prefix\n\n if (typeof language !== 'string') {\n throw fault('Expected `string` for name, got `%s`', language)\n }\n\n if (!high.getLanguage(language)) {\n throw fault('Unknown language: `%s` is not registered', language)\n }\n\n if (typeof value !== 'string') {\n throw fault('Expected `string` for value, got `%s`', value)\n }\n\n if (prefix === null || prefix === undefined) {\n prefix = defaultPrefix\n }\n\n high.configure({__emitter: HastEmitter, classPrefix: prefix})\n\n const result = /** @type {HighlightResult & {_emitter: HastEmitter}} */ (\n high.highlight(value, {language, ignoreIllegals: true})\n )\n\n high.configure({})\n\n // `highlight.js` seems to use this (currently) for broken grammars, so let’s\n // keep it in there just to be sure.\n /* c8 ignore next 3 */\n if (result.errorRaised) {\n throw result.errorRaised\n }\n\n // @ts-expect-error: `language` is always defined in `highlight`.\n result._emitter.root.data.language = result.language\n result._emitter.root.data.relevance = result.relevance\n\n return result._emitter.root\n}\n\n/**\n * Highlight `value` (code) and guess its programming language.\n *\n * @param {string} value\n * Code to highlight.\n * @param {AutoOptions} [options={}]\n * Configuration.\n * @returns {Root}\n * A hast `Root` node.\n */\nfunction highlightAuto(value, options = {}) {\n const subset = options.subset || high.listLanguages()\n let prefix = options.prefix\n let index = -1\n /** @type {Root} */\n let result = {\n type: 'root',\n data: {language: null, relevance: 0},\n children: []\n }\n\n if (prefix === null || prefix === undefined) {\n prefix = defaultPrefix\n }\n\n if (typeof value !== 'string') {\n throw fault('Expected `string` for value, got `%s`', value)\n }\n\n while (++index < subset.length) {\n const name = subset[index]\n\n if (!high.getLanguage(name)) continue\n\n const current = highlight(name, value, options)\n\n if (current.data.relevance > result.data.relevance) result = current\n }\n\n return result\n}\n\n/**\n * Register a language.\n *\n * @param {string} language\n * Programming language name.\n * @param {HighlightSyntax} syntax\n * `highlight.js` language syntax.\n * @returns {void}\n */\nfunction registerLanguage(language, syntax) {\n high.registerLanguage(language, syntax)\n}\n\n/**\n * Register aliases for already registered languages.\n *\n * @param {string|Record<string, string|Array<string>>} language\n * Programming language name or a map of `language`s to `alias`es or `list`s\n * @param {string|Array<string>} [alias]\n * New aliases for the programming language.\n * @returns {void}\n */\nconst registerAlias =\n /**\n * @type {(\n * ((language: string, alias: string|Array<string>) => void) &\n * ((aliases: Record<string, string|Array<string>>) => void)\n * )}\n */\n (\n /**\n * @param {string|Record<string, string|Array<string>>} language\n * @param {string|Array<string>} [alias]\n * @returns {void}\n */\n function (language, alias) {\n if (typeof language === 'string') {\n // @ts-expect-error: should be a string in this overload.\n high.registerAliases(alias, {languageName: language})\n } else {\n /** @type {string} */\n let key\n\n for (key in language) {\n if (own.call(language, key)) {\n high.registerAliases(language[key], {languageName: key})\n }\n }\n }\n }\n )\n\n/**\n * Check whether an `alias` or `language` is registered.\n *\n * @param {string} aliasOrLanguage\n * Name of a registered language or alias.\n * @returns {boolean}\n * Whether `aliasOrlanguage` is registered.\n */\nfunction registered(aliasOrLanguage) {\n return Boolean(high.getLanguage(aliasOrLanguage))\n}\n\n/**\n * List registered languages.\n *\n * @returns {Array<string>}\n * Names of registered language.\n */\nfunction listLanguages() {\n return high.listLanguages()\n}\n\n/** @type {HighlightEmitter} */\nclass HastEmitter {\n /**\n * @param {HighlightOptions} options\n */\n constructor(options) {\n /** @type {HighlightOptions} */\n this.options = options\n /** @type {Root} */\n this.root = {\n type: 'root',\n data: {language: null, relevance: 0},\n children: []\n }\n /** @type {[Root, ...Span[]]} */\n this.stack = [this.root]\n }\n\n /**\n * @param {string} value\n */\n addText(value) {\n if (value === '') return\n\n const current = this.stack[this.stack.length - 1]\n const tail = current.children[current.children.length - 1]\n\n if (tail && tail.type === 'text') {\n tail.value += value\n } else {\n current.children.push({type: 'text', value})\n }\n }\n\n /**\n * @param {string} value\n * @param {string} name\n */\n addKeyword(value, name) {\n this.openNode(name)\n this.addText(value)\n this.closeNode()\n }\n\n /**\n * @param {HastEmitter} other\n * @param {string} name\n */\n addSublanguage(other, name) {\n const current = this.stack[this.stack.length - 1]\n const results = other.root.children\n\n if (name) {\n current.children.push({\n type: 'element',\n tagName: 'span',\n properties: {className: [name]},\n children: results\n })\n } else {\n current.children.push(...results)\n }\n }\n\n /**\n * @param {string} name\n */\n openNode(name) {\n // First “class” gets the prefix. Rest gets a repeated underscore suffix.\n // See: <https://github.com/highlightjs/highlight.js/commit/51806aa>\n // See: <https://github.com/wooorm/lowlight/issues/43>\n const className = name\n .split('.')\n .map((d, i) => (i ? d + '_'.repeat(i) : this.options.classPrefix + d))\n const current = this.stack[this.stack.length - 1]\n /** @type {Span} */\n const child = {\n type: 'element',\n tagName: 'span',\n properties: {className},\n children: []\n }\n\n current.children.push(child)\n this.stack.push(child)\n }\n\n /**\n */\n closeNode() {\n this.stack.pop()\n }\n\n /**\n */\n closeAllNodes() {}\n\n /**\n */\n finalize() {}\n\n /**\n */\n toHTML() {\n return ''\n }\n}\n\nexport const lowlight = {\n highlight,\n highlightAuto,\n registerLanguage,\n registered,\n listLanguages,\n registerAlias\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('hast').Element} Element\n *\n * @typedef {string} TagName\n * @typedef {null|undefined|TagName|TestFunctionAnything|Array.<TagName|TestFunctionAnything>} Test\n */\n\n/**\n * @template {Element} T\n * @typedef {null|undefined|T['tagName']|TestFunctionPredicate<T>|Array.<T['tagName']|TestFunctionPredicate<T>>} PredicateTest\n */\n\n/**\n * Check if an element passes a test\n *\n * @callback TestFunctionAnything\n * @param {Element} element\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {boolean|void}\n */\n\n/**\n * Check if an element passes a certain node test\n *\n * @template {Element} X\n * @callback TestFunctionPredicate\n * @param {Element} element\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {element is X}\n */\n\n/**\n * Check if a node is an element and passes a certain node test\n *\n * @callback AssertAnything\n * @param {unknown} [node]\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {boolean}\n */\n\n/**\n * Check if a node is an element and passes a certain node test\n *\n * @template {Element} Y\n * @callback AssertPredicate\n * @param {unknown} [node]\n * @param {number|null|undefined} [index]\n * @param {Parent|null|undefined} [parent]\n * @returns {node is Y}\n */\n\n// Check if `node` is an `element` and whether it passes the given test.\nexport const isElement =\n /**\n * Check if a node is an element and passes a test.\n * When a `parent` node is known the `index` of node should also be given.\n *\n * @type {(\n * (() => false) &\n * (<T extends Element = Element>(node: unknown, test?: PredicateTest<T>, index?: number, parent?: Parent, context?: unknown) => node is T) &\n * ((node: unknown, test: Test, index?: number, parent?: Parent, context?: unknown) => boolean)\n * )}\n */\n (\n /**\n * Check if a node passes a test.\n * When a `parent` node is known the `index` of node should also be given.\n *\n * @param {unknown} [node] Node to check\n * @param {Test} [test] When nullish, checks if `node` is a `Node`.\n * When `string`, works like passing `function (node) {return node.type === test}`.\n * When `function` checks if function passed the node is true.\n * When `array`, checks any one of the subtests pass.\n * @param {number} [index] Position of `node` in `parent`\n * @param {Parent} [parent] Parent of `node`\n * @param {unknown} [context] Context object to invoke `test` with\n * @returns {boolean} Whether test passed and `node` is an `Element` (object with `type` set to `element` and `tagName` set to a non-empty string).\n */\n // eslint-disable-next-line max-params\n function (node, test, index, parent, context) {\n const check = convertElement(test)\n\n if (\n index !== undefined &&\n index !== null &&\n (typeof index !== 'number' ||\n index < 0 ||\n index === Number.POSITIVE_INFINITY)\n ) {\n throw new Error('Expected positive finite index for child node')\n }\n\n if (\n parent !== undefined &&\n parent !== null &&\n (!parent.type || !parent.children)\n ) {\n throw new Error('Expected parent node')\n }\n\n // @ts-expect-error Looks like a node.\n if (!node || !node.type || typeof node.type !== 'string') {\n return false\n }\n\n if (\n (parent === undefined || parent === null) !==\n (index === undefined || index === null)\n ) {\n throw new Error('Expected both parent and index')\n }\n\n return check.call(context, node, index, parent)\n }\n )\n\nexport const convertElement =\n /**\n * @type {(\n * (<T extends Element>(test: T['tagName']|TestFunctionPredicate<T>) => AssertPredicate<T>) &\n * ((test?: Test) => AssertAnything)\n * )}\n */\n (\n /**\n * Generate an assertion from a check.\n * @param {Test} [test]\n * When nullish, checks if `node` is a `Node`.\n * When `string`, works like passing `function (node) {return node.type === test}`.\n * When `function` checks if function passed the node is true.\n * When `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n * When `array`, checks any one of the subtests pass.\n * @returns {AssertAnything}\n */\n function (test) {\n if (test === undefined || test === null) {\n return element\n }\n\n if (typeof test === 'string') {\n return tagNameFactory(test)\n }\n\n if (typeof test === 'object') {\n return anyFactory(test)\n }\n\n if (typeof test === 'function') {\n return castFactory(test)\n }\n\n throw new Error('Expected function, string, or array as test')\n }\n )\n\n/**\n * @param {Array.<TagName|TestFunctionAnything>} tests\n * @returns {AssertAnything}\n */\nfunction anyFactory(tests) {\n /** @type {Array.<AssertAnything>} */\n const checks = []\n let index = -1\n\n while (++index < tests.length) {\n checks[index] = convertElement(tests[index])\n }\n\n return castFactory(any)\n\n /**\n * @this {unknown}\n * @param {unknown[]} parameters\n * @returns {boolean}\n */\n function any(...parameters) {\n let index = -1\n\n while (++index < checks.length) {\n if (checks[index].call(this, ...parameters)) {\n return true\n }\n }\n\n return false\n }\n}\n\n/**\n * Utility to convert a string into a function which checks a given node’s tag\n * name for said string.\n *\n * @param {TagName} check\n * @returns {AssertAnything}\n */\nfunction tagNameFactory(check) {\n return tagName\n\n /**\n * @param {unknown} node\n * @returns {boolean}\n */\n function tagName(node) {\n return element(node) && node.tagName === check\n }\n}\n\n/**\n * @param {TestFunctionAnything} check\n * @returns {AssertAnything}\n */\nfunction castFactory(check) {\n return assertion\n\n /**\n * @this {unknown}\n * @param {unknown} node\n * @param {Array.<unknown>} parameters\n * @returns {boolean}\n */\n function assertion(node, ...parameters) {\n // @ts-expect-error: fine.\n return element(node) && Boolean(check.call(this, node, ...parameters))\n }\n}\n\n/**\n * Utility to return true if this is an element.\n * @param {unknown} node\n * @returns {node is Element}\n */\nfunction element(node) {\n return Boolean(\n node &&\n typeof node === 'object' &&\n // @ts-expect-error Looks like a node.\n node.type === 'element' &&\n // @ts-expect-error Looks like an element.\n typeof node.tagName === 'string'\n )\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n *\n * @typedef {import('unist-util-is').Type} Type\n * @typedef {import('unist-util-is').Props} Props\n * @typedef {import('unist-util-is').TestFunctionAnything} TestFunctionAnything\n */\n\nimport {convert} from 'unist-util-is'\n\nexport var findAfter =\n /**\n * @type {(\n * (<T extends Node>(node: Parent, index: Node|number, test: T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>|Array.<T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>>) => T|null) &\n * ((node: Parent, index: Node|number, test?: null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>) => Node|null)\n * )}\n */\n (\n /**\n * @param {Parent} parent Parent node\n * @param {Node|number} index Child of `parent`, or it’s index\n * @param {null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>} [test] is-compatible test (such as a type)\n * @returns {Node|null}\n */\n function (parent, index, test) {\n var is = convert(test)\n\n if (!parent || !parent.type || !parent.children) {\n throw new Error('Expected parent node')\n }\n\n if (typeof index === 'number') {\n if (index < 0 || index === Number.POSITIVE_INFINITY) {\n throw new Error('Expected positive finite number as index')\n }\n } else {\n index = parent.children.indexOf(index)\n\n if (index < 0) {\n throw new Error('Expected child node or index')\n }\n }\n\n while (++index < parent.children.length) {\n if (is(parent.children[index], index, parent)) {\n return parent.children[index]\n }\n }\n\n return null\n }\n )\n","/**\n * @typedef {import('hast-util-is-element').TestFunctionAnything} TestFunctionAnything\n * @typedef {import('hast').Parent['children'][number]} HastChild\n * @typedef {import('hast').Text} HastText\n * @typedef {import('hast').Comment} HastComment\n * @typedef {import('hast').Root} HastRoot\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('hast').Properties} HastProperties\n * @typedef {HastChild|HastRoot} HastNode\n * @typedef {HastRoot|HastElement} HastParent\n *\n * @typedef {'normal'|'pre'|'nowrap'|'pre-wrap'} Whitespace\n * @typedef {boolean} BreakValue\n * @typedef {1|2} BreakNumber\n * @typedef {'\\n'} BreakForce\n * @typedef {BreakValue|BreakNumber|undefined} BreakBefore\n * @typedef {BreakValue|BreakNumber|BreakForce|undefined} BreakAfter\n *\n * @typedef CollectionOptions\n * @property {Whitespace} whitespace\n * @property {BreakBefore} breakBefore\n * @property {BreakAfter} breakAfter\n *\n * @typedef Options\n * Configuration.\n * @property {Whitespace} [whitespace='normal']\n * Initial CSS whitespace setting to use.\n */\n\nimport {convertElement} from 'hast-util-is-element'\nimport {findAfter} from 'unist-util-find-after'\n\nconst searchLineFeeds = /\\n/g\nconst searchTabOrSpaces = /[\\t ]+/g\n\nconst br = convertElement('br')\nconst p = convertElement('p')\nconst cell = convertElement(['th', 'td'])\nconst row = convertElement('tr')\n\n// Note that we don’t need to include void elements here as they don’t have text.\n// See: <https://github.com/wooorm/html-void-elements>\nconst notRendered = convertElement([\n // List from: <https://html.spec.whatwg.org/#hidden-elements>\n 'datalist',\n 'head',\n 'noembed',\n 'noframes',\n 'noscript', // Act as if we support scripting.\n 'rp',\n 'script',\n 'style',\n 'template',\n 'title',\n // Hidden attribute.\n hidden,\n // From: <https://html.spec.whatwg.org/#flow-content-3>\n closedDialog\n])\n\n// See: <https://html.spec.whatwg.org/#the-css-user-agent-style-sheet-and-presentational-hints>\nconst blockOrCaption = convertElement([\n 'address', // Flow content\n 'article', // Sections and headings\n 'aside', // Sections and headings\n 'blockquote', // Flow content\n 'body', // Page\n 'caption', // `table-caption`\n 'center', // Flow content (legacy)\n 'dd', // Lists\n 'dialog', // Flow content\n 'dir', // Lists (legacy)\n 'dl', // Lists\n 'dt', // Lists\n 'div', // Flow content\n 'figure', // Flow content\n 'figcaption', // Flow content\n 'footer', // Flow content\n 'form,', // Flow content\n 'h1', // Sections and headings\n 'h2', // Sections and headings\n 'h3', // Sections and headings\n 'h4', // Sections and headings\n 'h5', // Sections and headings\n 'h6', // Sections and headings\n 'header', // Flow content\n 'hgroup', // Sections and headings\n 'hr', // Flow content\n 'html', // Page\n 'legend', // Flow content\n 'listing', // Flow content (legacy)\n 'main', // Flow content\n 'menu', // Lists\n 'nav', // Sections and headings\n 'ol', // Lists\n 'p', // Flow content\n 'plaintext', // Flow content (legacy)\n 'pre', // Flow content\n 'section', // Sections and headings\n 'ul', // Lists\n 'xmp' // Flow content (legacy)\n])\n\n/**\n * Implementation of the `innerText` getter:\n * <https://html.spec.whatwg.org/#the-innertext-idl-attribute>\n * Note that we act as if `node` is being rendered, and as if we’re a\n * CSS-supporting user agent.\n *\n * @param {HastNode} node\n * @param {Options} [options={}]\n * @returns {string}\n */\nexport function toText(node, options = {}) {\n /** @type {Array.<HastChild>} */\n // @ts-ignore looks like a parent.\n const children = node.children || []\n const block = blockOrCaption(node)\n const whitespace = inferWhitespace(node, {\n whitespace: options.whitespace || 'normal',\n breakBefore: false,\n breakAfter: false\n })\n let index = -1\n /** @type {Array.<string|BreakNumber>} */\n let results\n /** @type {string|BreakNumber} */\n let value\n /** @type {number|undefined} */\n let count\n\n // Treat `text` and `comment` as having normal white-space.\n // This deviates from the spec as in the DOM the node’s `.data` has to be\n // returned.\n // If you want that behavior use `hast-util-to-string`.\n // All other nodes are later handled as if they are `element`s (so the\n // algorithm also works on a `root`).\n // Nodes without children are treated as a void element, so `doctype` is thus\n // ignored.\n if (node.type === 'text' || node.type === 'comment') {\n return collectText(node, {whitespace, breakBefore: true, breakAfter: true})\n }\n\n // 1. If this element is not being rendered, or if the user agent is a\n // non-CSS user agent, then return the same value as the textContent IDL\n // attribute on this element.\n //\n // Note: we’re not supporting stylesheets so we’re acting as if the node\n // is rendered.\n //\n // If you want that behavior use `hast-util-to-string`.\n // Important: we’ll have to account for this later though.\n\n // 2. Let results be a new empty list.\n results = []\n\n // 3. For each child node node of this element:\n while (++index < children.length) {\n // 3.1. Let current be the list resulting in running the inner text\n // collection steps with node.\n // Each item in results will either be a JavaScript string or a\n // positive integer (a required line break count).\n // 3.2. For each item item in current, append item to results.\n results = results.concat(\n // @ts-ignore Looks like a parent.\n innerTextCollection(children[index], node, {\n whitespace,\n breakBefore: index ? null : block,\n breakAfter:\n index < children.length - 1 ? br(children[index + 1]) : block\n })\n )\n }\n\n // 4. Remove any items from results that are the empty string.\n // 5. Remove any runs of consecutive required line break count items at the\n // start or end of results.\n // 6. Replace each remaining run of consecutive required line break count\n // items with a string consisting of as many U+000A LINE FEED (LF)\n // characters as the maximum of the values in the required line break\n // count items.\n index = -1\n /** @type {Array.<string>} */\n const result = []\n\n while (++index < results.length) {\n value = results[index]\n\n if (typeof value === 'number') {\n if (count !== undefined && value > count) count = value\n } else if (value) {\n if (count) result.push('\\n'.repeat(count))\n count = 0\n result.push(value)\n }\n }\n\n // 7. Return the concatenation of the string items in results.\n return result.join('')\n}\n\n/**\n * <https://html.spec.whatwg.org/#inner-text-collection-steps>\n *\n * @param {HastNode} node\n * @param {HastParent} parent\n * @param {CollectionOptions} options\n * @returns {Array.<string|BreakNumber>}\n */\nfunction innerTextCollection(node, parent, options) {\n if (node.type === 'element') {\n return collectElement(node, parent, options)\n }\n\n if (node.type === 'text') {\n return [\n options.whitespace === 'normal'\n ? collectText(node, options)\n : collectPreText(node)\n ]\n }\n\n return []\n}\n\n/**\n * Collect an element.\n *\n * @param {HastElement} node\n * @param {HastParent} parent\n * @param {CollectionOptions} options\n */\nfunction collectElement(node, parent, options) {\n // First we infer the `white-space` property.\n const whitespace = inferWhitespace(node, options)\n const children = node.children || []\n let index = -1\n /** @type {Array.<string|BreakNumber>} */\n let items = []\n /** @type {BreakNumber|undefined} */\n let prefix\n /** @type {BreakNumber|BreakForce|undefined} */\n let suffix\n\n // We’re ignoring point 3, and exiting without any content here, because we\n // deviated from the spec in `toText` at step 3.\n if (notRendered(node)) {\n return items\n }\n\n // Note: we first detect if there is going to be a break before or after the\n // contents, as that changes the white-space handling.\n\n // 2. If node’s computed value of `visibility` is not `visible`, then return\n // items.\n //\n // Note: Ignored, as everything is visible by default user agent styles.\n\n // 3. If node is not being rendered, then return items. [...]\n //\n // Note: We already did this above.\n\n // See `collectText` for step 4.\n\n // 5. If node is a `<br>` element, then append a string containing a single\n // U+000A LINE FEED (LF) character to items.\n if (br(node)) {\n suffix = '\\n'\n }\n\n // 7. If node’s computed value of `display` is `table-row`, and node’s CSS\n // box is not the last `table-row` box of the nearest ancestor `table`\n // box, then append a string containing a single U+000A LINE FEED (LF)\n // character to items.\n //\n // See: <https://html.spec.whatwg.org/#tables-2>\n // Note: needs further investigation as this does not account for implicit\n // rows.\n else if (row(node) && findAfter(parent, node, row)) {\n suffix = '\\n'\n }\n\n // 8. If node is a `<p>` element, then append 2 (a required line break count)\n // at the beginning and end of items.\n else if (p(node)) {\n prefix = 2\n suffix = 2\n }\n\n // 9. If node’s used value of `display` is block-level or `table-caption`,\n // then append 1 (a required line break count) at the beginning and end of\n // items.\n else if (blockOrCaption(node)) {\n prefix = 1\n suffix = 1\n }\n\n // 1. Let items be the result of running the inner text collection steps with\n // each child node of node in tree order, and then concatenating the\n // results to a single list.\n while (++index < children.length) {\n items = items.concat(\n innerTextCollection(children[index], node, {\n whitespace,\n breakBefore: index ? undefined : prefix,\n breakAfter:\n index < children.length - 1 ? br(children[index + 1]) : suffix\n })\n )\n }\n\n // 6. If node’s computed value of `display` is `table-cell`, and node’s CSS\n // box is not the last `table-cell` box of its enclosing `table-row` box,\n // then append a string containing a single U+0009 CHARACTER TABULATION\n // (tab) character to items.\n //\n // See: <https://html.spec.whatwg.org/#tables-2>\n if (cell(node) && findAfter(parent, node, cell)) {\n items.push('\\t')\n }\n\n // Add the pre- and suffix.\n if (prefix) items.unshift(prefix)\n if (suffix) items.push(suffix)\n\n return items\n}\n\n/**\n * 4. If node is a Text node, then for each CSS text box produced by node,\n * in content order, compute the text of the box after application of the\n * CSS `white-space` processing rules and `text-transform` rules, set\n * items to the list of the resulting strings, and return items.\n * The CSS `white-space` processing rules are slightly modified:\n * collapsible spaces at the end of lines are always collapsed, but they\n * are only removed if the line is the last line of the block, or it ends\n * with a br element.\n * Soft hyphens should be preserved.\n *\n * Note: See `collectText` and `collectPreText`.\n * Note: we don’t deal with `text-transform`, no element has that by\n * default.\n *\n * See: <https://drafts.csswg.org/css-text/#white-space-phase-1>\n *\n * @param {HastText|HastComment} node\n * @param {CollectionOptions} options\n * @returns {string}\n */\nfunction collectText(node, options) {\n const value = String(node.value)\n /** @type {Array.<string>} */\n const lines = []\n /** @type {Array.<string>} */\n const result = []\n let start = 0\n let index = -1\n /** @type {RegExpMatchArray|null} */\n let match\n /** @type {number} */\n let end\n /** @type {string|undefined} */\n let join\n\n while (start < value.length) {\n searchLineFeeds.lastIndex = start\n match = searchLineFeeds.exec(value)\n // @ts-expect-error: `index` is set.\n end = match ? match.index : value.length\n\n lines.push(\n // Any sequence of collapsible spaces and tabs immediately preceding or\n // following a segment break is removed.\n trimAndCollapseSpacesAndTabs(\n // [...] ignoring bidi formatting characters (characters with the\n // Bidi_Control property [UAX9]: ALM, LTR, RTL, LRE-RLO, LRI-PDI) as if\n // they were not there.\n value\n .slice(start, end)\n .replace(/[\\u061C\\u200E\\u200F\\u202A-\\u202E\\u2066-\\u2069]/g, ''),\n options.breakBefore,\n options.breakAfter\n )\n )\n\n start = end + 1\n }\n\n // Collapsible segment breaks are transformed for rendering according to the\n // segment break transformation rules.\n // So here we jump to 4.1.2 of [CSSTEXT]:\n // Any collapsible segment break immediately following another collapsible\n // segment break is removed\n while (++index < lines.length) {\n // * If the character immediately before or immediately after the segment\n // break is the zero-width space character (U+200B), then the break is\n // removed, leaving behind the zero-width space.\n if (\n lines[index].charCodeAt(lines[index].length - 1) === 0x200b /* ZWSP */ ||\n (index < lines.length - 1 &&\n lines[index + 1].charCodeAt(0) === 0x200b) /* ZWSP */\n ) {\n result.push(lines[index])\n join = ''\n }\n\n // * Otherwise, if the East Asian Width property [UAX11] of both the\n // character before and after the segment break is Fullwidth, Wide, or\n // Halfwidth (not Ambiguous), and neither side is Hangul, then the\n // segment break is removed.\n //\n // Note: ignored.\n // * Otherwise, if the writing system of the segment break is Chinese,\n // Japanese, or Yi, and the character before or after the segment break\n // is punctuation or a symbol (Unicode general category P* or S*) and\n // has an East Asian Width property of Ambiguous, and the character on\n // the other side of the segment break is Fullwidth, Wide, or Halfwidth,\n // and not Hangul, then the segment break is removed.\n //\n // Note: ignored.\n\n // * Otherwise, the segment break is converted to a space (U+0020).\n else if (lines[index]) {\n if (join) result.push(join)\n result.push(lines[index])\n join = ' '\n }\n }\n\n return result.join('')\n}\n\n/**\n * @param {HastText|HastComment} node\n * @returns {string}\n */\nfunction collectPreText(node) {\n return String(node.value)\n}\n\n/**\n * 3. Every collapsible tab is converted to a collapsible space (U+0020).\n * 4. Any collapsible space immediately following another collapsible\n * space—even one outside the boundary of the inline containing that\n * space, provided both spaces are within the same inline formatting\n * context—is collapsed to have zero advance width. (It is invisible,\n * but retains its soft wrap opportunity, if any.)\n *\n * @param {string} value\n * @param {BreakBefore} breakBefore\n * @param {BreakAfter} breakAfter\n * @returns {string}\n */\nfunction trimAndCollapseSpacesAndTabs(value, breakBefore, breakAfter) {\n /** @type {Array.<string>} */\n const result = []\n let start = 0\n /** @type {RegExpMatchArray|null} */\n let match\n /** @type {number} */\n let end\n\n while (start < value.length) {\n searchTabOrSpaces.lastIndex = start\n match = searchTabOrSpaces.exec(value)\n // @ts-expect-error: `index` is set.\n end = match ? match.index : value.length\n\n // If we’re not directly after a segment break, but there was white space,\n // add an empty value that will be turned into a space.\n if (!start && !end && match && !breakBefore) {\n result.push('')\n }\n\n if (start !== end) {\n result.push(value.slice(start, end))\n }\n\n start = match ? end + match[0].length : end\n }\n\n // If we reached the end, there was trailing white space, and there’s no\n // segment break after this node, add an empty value that will be turned\n // into a space.\n // @ts-expect-error: `end` is defined.\n if (start !== end && !breakAfter) {\n result.push('')\n }\n\n return result.join(' ')\n}\n\n/**\n * We don’t support void elements here (so `nobr wbr` -> `normal` is ignored).\n *\n * @param {HastNode} node\n * @param {CollectionOptions} options\n * @returns {Whitespace}\n */\nfunction inferWhitespace(node, options) {\n /** @type {HastProperties} */\n let props\n\n if (node.type === 'element') {\n props = node.properties || {}\n switch (node.tagName) {\n case 'listing':\n case 'plaintext':\n case 'xmp':\n return 'pre'\n case 'nobr':\n return 'nowrap'\n case 'pre':\n return props.wrap ? 'pre-wrap' : 'pre'\n case 'td':\n case 'th':\n return props.noWrap ? 'nowrap' : options.whitespace\n case 'textarea':\n return 'pre-wrap'\n default:\n }\n }\n\n return options.whitespace\n}\n\n/** @type {TestFunctionAnything} */\nfunction hidden(node) {\n return Boolean((node.properties || {}).hidden)\n}\n\n/** @type {TestFunctionAnything} */\nfunction closedDialog(node) {\n return node.tagName === 'dialog' && !(node.properties || {}).open\n}\n","/**\n * @typedef {import('lowlight').Root} LowlightRoot\n * @typedef {import('lowlight/lib/core.js').HighlightSyntax} HighlightSyntax\n * @typedef {import('hast').Root} Root\n * @typedef {import('hast').Element} Element\n * @typedef {Root|Root['children'][number]} Node\n *\n * @typedef Options\n * Configuration (optional).\n * @property {string} [prefix='hljs-']\n * Prefix to use before classes.\n * @property {boolean|Array<string>} [subset]\n * Scope of languages to check when auto-detecting (default: all languages).\n * Pass `false` to not highlight code without language classes.\n * @property {boolean} [ignoreMissing=false]\n * Swallow errors for missing languages.\n * By default, unregistered syntaxes throw an error when they are used.\n * Pass `true` to swallow those errors and thus ignore code with unknown code\n * languages.\n * @property {Array<string>} [plainText=[]]\n * List of plain-text languages.\n * Pass any languages you would like to be kept as plain-text instead of\n * getting highlighted.\n * @property {Record<string, string|Array<string>>} [aliases={}]\n * Register more aliases.\n * Passed to `lowlight.registerAlias`.\n * @property {Record<string, HighlightSyntax>} [languages={}]\n * Register more languages.\n * Each key/value pair passed as arguments to `lowlight.registerLanguage`.\n */\n\nimport {lowlight} from 'lowlight'\nimport {toText} from 'hast-util-to-text'\nimport {visit} from 'unist-util-visit'\n\nconst own = {}.hasOwnProperty\n\n/**\n * Plugin to highlight the syntax of code with lowlight (`highlight.js`).\n *\n * @type {import('unified').Plugin<[Options?] | Array<void>, Root>}\n */\nexport default function rehypeHighlight(options = {}) {\n const {aliases, languages, prefix, plainText, ignoreMissing, subset} = options\n let name = 'hljs'\n\n if (aliases) {\n lowlight.registerAlias(aliases)\n }\n\n if (languages) {\n /** @type {string} */\n let key\n\n for (key in languages) {\n if (own.call(languages, key)) {\n lowlight.registerLanguage(key, languages[key])\n }\n }\n }\n\n if (prefix) {\n const pos = prefix.indexOf('-')\n name = pos > -1 ? prefix.slice(0, pos) : prefix\n }\n\n return (tree) => {\n // eslint-disable-next-line complexity\n visit(tree, 'element', (node, _, givenParent) => {\n const parent = /** @type {Node?} */ (givenParent)\n\n if (\n !parent ||\n !('tagName' in parent) ||\n parent.tagName !== 'pre' ||\n node.tagName !== 'code' ||\n !node.properties\n ) {\n return\n }\n\n const lang = language(node)\n\n if (\n lang === false ||\n (!lang && subset === false) ||\n (lang && plainText && plainText.includes(lang))\n ) {\n return\n }\n\n if (!Array.isArray(node.properties.className)) {\n node.properties.className = []\n }\n\n if (!node.properties.className.includes(name)) {\n node.properties.className.unshift(name)\n }\n\n /** @type {LowlightRoot} */\n let result\n\n try {\n result = lang\n ? lowlight.highlight(lang, toText(parent), {prefix})\n : // @ts-expect-error: we checked that `subset` is not a boolean.\n lowlight.highlightAuto(toText(parent), {prefix, subset})\n } catch (error) {\n const exception = /** @type {Error} */ (error)\n if (!ignoreMissing || !/Unknown language/.test(exception.message)) {\n throw error\n }\n\n return\n }\n\n if (!lang && result.data.language) {\n node.properties.className.push('language-' + result.data.language)\n }\n\n if (Array.isArray(result.children) && result.children.length > 0) {\n node.children = result.children\n }\n })\n }\n}\n\n/**\n * Get the programming language of `node`.\n *\n * @param {Element} node\n * @returns {false|string|undefined}\n */\nfunction language(node) {\n const className = node.properties && node.properties.className\n let index = -1\n\n if (!Array.isArray(className)) {\n return\n }\n\n while (++index < className.length) {\n const value = String(className[index])\n\n if (value === 'no-highlight' || value === 'nohighlight') {\n return false\n }\n\n if (value.slice(0, 5) === 'lang-') {\n return value.slice(5)\n }\n\n if (value.slice(0, 9) === 'language-') {\n return value.slice(9)\n }\n }\n}\n","import React from 'react'\nimport ReactMarkdown from 'react-markdown'\nimport PropTypes from 'prop-types'\n\nimport remarkGfm from 'remark-gfm'\nimport rehypeHighlight from 'rehype-highlight'\n\nconst FormReadOnlyMarkdown = ({ content }) => (\n <ReactMarkdown\n remarkPlugins={[remarkGfm]}\n rehypePlugins={[rehypeHighlight]}\n >\n {content}\n </ReactMarkdown>\n)\n\nFormReadOnlyMarkdown.propTypes = {\n content: PropTypes.string\n}\n\nexport default FormReadOnlyMarkdown\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport { castToNumber } from '../helpers'\nimport FormReadOnlyText from './FormReadOnlyText'\n\nconst FormReadOnlyNumber = ({ value }) => <FormReadOnlyText value={castToNumber(value)} />\n\nFormReadOnlyNumber.propTypes = {\n value: PropTypes.oneOfType([\n PropTypes.number,\n PropTypes.string\n ])\n}\n\nexport default FormReadOnlyNumber\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport FormReadOnlyText from './FormReadOnlyText'\n\nconst FormReadOnlySelect = ({ value, options }) => (\n <FormReadOnlyText value={options.find(o => o.value === value)?.label} />\n)\n\nFormReadOnlySelect.propTypes = {\n value: PropTypes.string,\n options: PropTypes.arrayOf(PropTypes.shape({\n label: PropTypes.string.isRequired,\n value: PropTypes.any\n })).isRequired\n}\n\nexport default FormReadOnlySelect\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Checkbox, FormControlLabel, Switch\n} from '@mui/material'\n\nconst isBoolean = val => val === false || val === true\nconst isChecked = (value, defaultValue) => (isBoolean(value) ? value : (defaultValue || false))\n\nconst FormReadOnlyBoolean = ({ variant, name, value, defaultValue, label, labelPlacement }) => {\n if (variant === 'checkbox') {\n return (\n <FormControlLabel\n label={label}\n labelPlacement={labelPlacement || 'end'}\n disabled\n control={(\n <Checkbox\n name={name}\n checked={isChecked(value, defaultValue)}\n />\n )}\n />\n )\n }\n\n return (\n <FormControlLabel\n label={label}\n labelPlacement={labelPlacement || 'end'}\n disabled\n control={(\n <Switch\n name={name}\n checked={isChecked(value, defaultValue)}\n />\n )}\n />\n )\n}\n\nFormReadOnlyBoolean.propTypes = {\n variant: PropTypes.string,\n name: PropTypes.string.isRequired,\n value: PropTypes.bool,\n defaultValue: PropTypes.bool,\n label: PropTypes.string,\n labelPlacement: PropTypes.string\n}\n\nexport default FormReadOnlyBoolean\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n List,\n ListItem,\n ListItemText\n} from '@mui/material'\n\nimport makeStyles from '@mui/styles/makeStyles'\n\nconst useStyles = makeStyles(() => ({\n formRepeater: {\n padding: 0,\n margin: 0\n }\n}))\n\nconst getValue = (value, catalog) => {\n if (catalog && catalog[value] !== undefined) return catalog[value]\n return value\n}\n\nconst FormReadOnlyRepeater = ({ value, options }) => {\n const styles = useStyles()\n\n return (\n <List\n className={styles.formRepeater}\n dense\n >\n {\n value && value.map((entry, index) => (\n // eslint-disable-next-line react/no-array-index-key\n <ListItem key={`entry-${index}`}>\n <ListItemText\n primary={getValue(entry, options)}\n style={{ margin: 0 }}\n />\n </ListItem>\n ))\n }\n </List>\n )\n}\n\nFormReadOnlyRepeater.propTypes = {\n value: PropTypes.array,\n options: PropTypes.object\n}\n\nexport default FormReadOnlyRepeater\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box, Typography, Alert\n} from '@mui/material'\n\nconst HiddenData = ({ subject, label }) => (\n <Box mb={2}>\n <Alert severity=\"warning\">\n <Typography variant=\"body1\">\n {subject ? `${subject} ` : ''}\n <span style={{ fontWeight: 'bold' }}>{label}</span>\n &nbsp;ist ausgeblendet.\n </Typography>\n </Alert>\n </Box>\n)\n\nHiddenData.propTypes = {\n subject: PropTypes.string,\n label: PropTypes.string.isRequired\n}\n\nexport default HiddenData\n","import React, {\n useState, useEffect\n} from 'react'\n\nimport { Snackbar } from '@mui/material'\n\nimport { useReservationStore } from '../context/ReservationContext'\n\nconst ReservationExpiredSnackbar = () => {\n const reservationStore = useReservationStore()\n const [notification, setNotification] = useState()\n\n useEffect(() => {\n if (!reservationStore) return undefined\n\n const unsubscribe = reservationStore.subscribe(() => {\n const { expiredNotification } = reservationStore.getState()\n if (expiredNotification) {\n setNotification(expiredNotification)\n // Clear from store so it doesn't re-trigger\n reservationStore.setState({ expiredNotification: undefined })\n }\n })\n\n return unsubscribe\n }, [reservationStore])\n\n if (!reservationStore) return false\n\n return (\n <Snackbar\n open={!!notification}\n autoHideDuration={4000}\n anchorOrigin={{ vertical: 'bottom', horizontal: 'right' }}\n message={notification ? `Reservierung für \"${notification.label}\" ist abgelaufen.` : ''}\n onClose={() => setNotification(undefined)}\n />\n )\n}\n\nexport default ReservationExpiredSnackbar\n","import { Input } from '@mui/material'\n\nimport FormSectionCard from '../FormSectionCard'\nimport FormSectionBlock from '../FormSectionBlock'\n\nimport FormField from '../Editable/FormField'\nimport FormText from '../Editable/FormText'\nimport FormNumber from '../Editable/FormNumber'\nimport FormCatalogType from '../Editable/FormCatalogType'\nimport FormBoolean from '../Editable/FormBoolean'\nimport FormRepeater from '../Editable/FormRepeater/FormRepeater'\n\nimport FormReadOnlyField from '../ReadOnly/FormReadOnlyField'\nimport FormReadOnlyText from '../ReadOnly/FormReadOnlyText'\nimport FormReadOnlyMarkdown from '../ReadOnly/FormReadOnlyMarkdown'\nimport FormReadOnlyNumber from '../ReadOnly/FormReadOnlyNumber'\nimport FormReadOnlySelect from '../ReadOnly/FormReadOnlySelect'\nimport FormReadOnlyBoolean from '../ReadOnly/FormReadOnlyBoolean'\nimport FormReadOnlyRepeater from '../ReadOnly/FormReadOnlyRepeater'\n\nimport HiddenData from '../Components/HiddenData'\nimport ReservationExpiredSnackbar from '../Components/ReservationExpiredSnackbar'\n\n/**\n * Default slot components — the library's built-in field type mapping.\n *\n * Overridden by:\n * - `slots` prop on FormulatorForm (type-level override)\n * - `fieldSlots` prop on FormulatorForm (field-name-level override)\n */\nexport const defaultSlots = {\n // Editable field types\n default: FormText,\n string: FormText,\n text: FormText,\n number: FormNumber,\n select: FormCatalogType,\n boolean: FormBoolean,\n array: FormRepeater,\n\n // Read-only field types\n readOnlyDefault: FormReadOnlyText,\n readOnlyString: FormReadOnlyText,\n readOnlyText: FormReadOnlyText,\n readOnlyMarkdown: FormReadOnlyMarkdown,\n readOnlyNumber: FormReadOnlyNumber,\n readOnlySelect: FormReadOnlySelect,\n readOnlyBoolean: FormReadOnlyBoolean,\n readOnlyArray: FormReadOnlyRepeater,\n\n // Adornment (append/prepend) types\n apDefault: Input,\n apString: Input,\n apNumber: FormNumber,\n apSelect: FormCatalogType,\n apBoolean: FormBoolean,\n\n // Structural\n field: FormField,\n readOnlyField: FormReadOnlyField,\n sectionCard: FormSectionCard,\n sectionBlock: FormSectionBlock,\n hiddenData: HiddenData,\n reservationExpiredNotification: ReservationExpiredSnackbar\n}\n","import {\n createContext, useContext\n} from 'react'\n\nconst GroupDisabledContext = createContext(false)\n\nexport default GroupDisabledContext\n\nexport const useGroupDisabled = () => useContext(GroupDisabledContext)\n","const abortableOAuthFetch = async (url, { token, signal, method = 'GET', body } = {}) => {\n let response\n let text\n\n try {\n const options = { method }\n\n if (token) {\n options.headers = {\n 'Content-Type': 'application/json',\n Authorization: `Bearer ${token}`\n }\n }\n\n if (signal) {\n options.signal = signal\n }\n\n if (body !== undefined) {\n options.body = JSON.stringify(body)\n }\n\n response = await fetch(url, options)\n\n text = await response.text()\n } catch (e) {\n throw new Error(text)\n }\n\n const result = JSON.parse(text)\n\n if (!response.ok) throw new Error(result.error)\n\n return result\n}\n\nexport default abortableOAuthFetch\n","import {\n useCallback, useEffect, useRef, useState\n} from 'react'\n\nimport abortableOAuthFetch from '../utils/fetch'\nimport { useReservationStore } from '../context/ReservationContext'\n\n/**\n * useReservation — manages the full lifecycle of a pessimistic reservation.\n *\n * - generate(): fetches a new reservation from the configured URL\n * - release(): releases the current reservation (calls server + clears state)\n * - countdown: 1s interval, auto-expires when remaining hits 0\n * - cleanup: releases on unmount\n *\n * @param {object} config\n * @param {string} config.reservationId — unique key (fieldName or groupId)\n * @param {string} config.url — endpoint to fetch generated values\n * @param {string} [config.token] — bearer token for auth\n * @param {string} [config.label] — human-readable label for expiry notification\n * @param {string[]} config.fieldNames — field names covered by this reservation\n * @param {function} config.setFieldValues — ({ name: value, ... }) => void\n */\nconst useReservation = ({ reservationId, url, token, label, fieldNames, setFieldValues }) => {\n const reservationStore = useReservationStore()\n const [loading, setLoading] = useState(false)\n\n const controllerRef = useRef()\n const intervalRef = useRef()\n const configRef = useRef({ reservationId, url, token, label, fieldNames, setFieldValues })\n\n // Keep config ref current without restarting effects\n configRef.current = { reservationId, url, token, label, fieldNames, setFieldValues }\n\n /**\n * Stop the countdown interval.\n */\n const stopCountdown = useCallback(() => {\n if (intervalRef.current) {\n clearInterval(intervalRef.current)\n intervalRef.current = undefined\n }\n }, [])\n\n /**\n * Build a clear-values object: { field1: undefined, field2: undefined, ... }\n */\n const buildClearValues = () => {\n const values = {}\n configRef.current.fieldNames.forEach(name => { values[name] = undefined })\n return values\n }\n\n /**\n * Release the current reservation — calls the release endpoint (best effort),\n * clears field values, and removes the reservation from the store.\n */\n const release = useCallback(async (options = {}) => {\n const { skipServerCall = false } = options\n stopCountdown()\n\n const state = reservationStore.getState()\n const reservation = state.reservations[reservationId]\n if (!reservation) return\n\n // Remove from store immediately\n const { [reservationId]: _, ...rest } = state.reservations\n reservationStore.setState({ reservations: rest })\n\n // Clear field values in one batch\n configRef.current.setFieldValues(buildClearValues())\n\n // Call release endpoint (fire-and-forget)\n if (!skipServerCall && reservation.releaseUrl) {\n try {\n await abortableOAuthFetch(reservation.releaseUrl, {\n method: 'DELETE',\n token: configRef.current.token\n })\n } catch (e) {\n // Best effort — server must handle idempotent release\n }\n }\n }, [reservationStore, reservationId, stopCountdown])\n\n /**\n * Start the 1s countdown. When remaining reaches 0, expire the reservation.\n */\n const startCountdown = useCallback(() => {\n stopCountdown()\n\n intervalRef.current = setInterval(() => {\n const state = reservationStore.getState()\n const reservation = state.reservations[reservationId]\n if (!reservation || reservation.status !== 'active') {\n stopCountdown()\n return\n }\n\n const nextRemaining = reservation.remaining - 1\n\n if (nextRemaining <= 0) {\n // Expired — clear values, notify, release\n stopCountdown()\n\n const { [reservationId]: _, ...rest } = state.reservations\n reservationStore.setState({\n reservations: {\n ...rest,\n [reservationId]: { ...reservation, remaining: 0, status: 'expired' }\n },\n expiredNotification: {\n reservationId,\n label: configRef.current.label || reservationId\n }\n })\n\n // Clear field values in one batch\n configRef.current.setFieldValues(buildClearValues())\n\n if (reservation.releaseUrl) {\n abortableOAuthFetch(reservation.releaseUrl, {\n method: 'DELETE',\n token: configRef.current.token\n }).catch(() => {})\n }\n\n // Remove the expired reservation from store after a tick\n setTimeout(() => {\n const currentState = reservationStore.getState()\n const { [reservationId]: expired, ...remaining } = currentState.reservations\n if (expired && expired.status === 'expired') {\n reservationStore.setState({ reservations: remaining })\n }\n }, 100)\n\n return\n }\n\n // Decrement\n reservationStore.setState({\n reservations: {\n ...state.reservations,\n [reservationId]: { ...reservation, remaining: nextRemaining }\n }\n })\n }, 1000)\n }, [reservationStore, reservationId, stopCountdown])\n\n /**\n * Generate a new reservation — fetches from the configured URL,\n * populates field values, and starts the countdown.\n */\n const generate = useCallback(async () => {\n // Release any existing reservation first\n const existing = reservationStore.getState().reservations[reservationId]\n if (existing && existing.status === 'active') {\n await release()\n }\n\n // Cancel any in-flight fetch\n if (controllerRef.current) {\n controllerRef.current.abort()\n }\n controllerRef.current = new AbortController()\n\n setLoading(true)\n\n try {\n const { url: configUrl, token: configToken } = configRef.current\n let result\n\n if (typeof configUrl === 'function') {\n result = await configUrl(controllerRef.current.signal)\n } else {\n result = await abortableOAuthFetch(configUrl, {\n token: configToken,\n signal: controllerRef.current.signal\n })\n }\n\n controllerRef.current = undefined\n\n const reservation = {\n voucher: result.voucher,\n fields: result.fields,\n releaseUrl: result.links?.release,\n validFor: result.validFor,\n remaining: result.validFor,\n status: 'active'\n }\n\n // Populate field values first — must happen before storing the\n // reservation so that the override-detection effect (which fires\n // when isActive flips to true) already sees the generated values.\n configRef.current.setFieldValues(result.fields)\n\n // Store the reservation (isActive becomes true)\n reservationStore.setState({\n reservations: {\n ...reservationStore.getState().reservations,\n [reservationId]: reservation\n }\n })\n\n // Start countdown\n startCountdown()\n } catch (e) {\n // Silently handle abort errors\n if (e.name !== 'AbortError') {\n // eslint-disable-next-line no-console\n console.error('Reservation generate failed:', e)\n }\n }\n\n setLoading(false)\n }, [reservationStore, reservationId, release, startCountdown])\n\n // Cleanup on unmount — release active reservation\n useEffect(() => () => {\n stopCountdown()\n if (controllerRef.current) {\n controllerRef.current.abort()\n }\n\n const state = reservationStore.getState()\n const reservation = state.reservations[reservationId]\n if (reservation && reservation.status === 'active' && reservation.releaseUrl) {\n // Fire-and-forget release on unmount\n abortableOAuthFetch(reservation.releaseUrl, {\n method: 'DELETE',\n token: configRef.current.token\n }).catch(() => {})\n\n const { [reservationId]: _, ...rest } = state.reservations\n reservationStore.setState({ reservations: rest })\n }\n }, [reservationStore, reservationId, stopCountdown])\n\n return {\n loading,\n generate,\n release\n }\n}\n\nexport default useReservation\n","import React, {\n useEffect, useRef\n} from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box,\n Button,\n CircularProgress,\n Typography\n} from '@mui/material'\n\nimport {\n AutoFixHigh as GenerateIcon,\n Close as ReleaseIcon\n} from '@mui/icons-material'\n\nimport { useFormContext } from '../context/FormContext'\nimport { useReservationStore } from '../context/ReservationContext'\nimport useStoreSelector from '../store/useStoreSelector'\nimport useReservation from '../hooks/useReservation'\n\n/**\n * Format remaining time.\n * >= 10 min: show hours/minutes only (no seconds ticking)\n * < 10 min: show m:ss with seconds\n * < 60s: show seconds only\n */\nconst formatRemaining = seconds => {\n if (seconds >= 600) {\n const h = Math.floor(seconds / 3600)\n const m = Math.ceil((seconds % 3600) / 60)\n if (h > 0) return `${h}h ${m}min`\n return `${m} min`\n }\n if (seconds >= 60) {\n const m = Math.floor(seconds / 60)\n const s = seconds % 60\n return `${m}:${s.toString().padStart(2, '0')}`\n }\n return `${seconds}s`\n}\n\n/**\n * FormAutoGenerate — wraps a single field with reservation controls.\n *\n * Below the field, renders a small info card (outlined in primary) with:\n * - The reservation countdown when active\n * - A labeled generate/regenerate button\n *\n * Disables field editing unless allowManualOverride is true.\n *\n * Used internally by FieldRenderer when a field entry has autoGenerate config.\n */\nconst FormAutoGenerate = ({\n fieldName,\n config,\n label,\n disabled,\n children,\n onChange\n}) => {\n const {\n url,\n token,\n buttonLabel = 'Generieren',\n releaseLabel,\n activeLabel = 'Reserviert',\n inactiveLabel = 'Nicht reserviert',\n allowManualOverride = false\n } = config\n\n const resolvedReleaseLabel = releaseLabel || `${label || fieldName} zurücksetzen`\n const { setFieldValues } = useFormContext()\n const reservationStore = useReservationStore()\n\n const { generate, release, loading } = useReservation({\n reservationId: fieldName,\n url,\n token,\n label: label || fieldName,\n fieldNames: [fieldName],\n setFieldValues\n })\n\n // Subscribe to reservation state for this field\n const reservation = useStoreSelector(\n reservationStore,\n s => s.reservations[fieldName]\n )\n\n const isActive = reservation && reservation.status === 'active'\n\n // Override detection — when user edits a reserved field, release the reservation\n const prevValueRef = useRef()\n\n useEffect(() => {\n if (!isActive || !allowManualOverride) return\n\n prevValueRef.current = reservation.fields[fieldName]\n }, [isActive, allowManualOverride, reservation, fieldName])\n\n // Wrap onChange to detect manual override\n const handleChange = e => {\n if (isActive && allowManualOverride) {\n const newValue = e.target.value\n if (newValue !== prevValueRef.current) {\n release()\n }\n }\n if (onChange) onChange(e)\n }\n\n // Clone children with modified props\n const childProps = {}\n if (isActive && !allowManualOverride) {\n childProps.disabled = true\n }\n if (isActive && allowManualOverride) {\n childProps.onChange = handleChange\n }\n\n return (\n <Box sx={{ width: '100%' }}>\n {\n React.Children.map(children, child => {\n if (!React.isValidElement(child)) return child\n return React.cloneElement(child, childProps)\n })\n }\n <Box\n sx={theme => ({\n display: 'flex',\n alignItems: 'center',\n justifyContent: 'space-between',\n width: '100%',\n mt: 0.5,\n px: 1.5,\n py: 0.75,\n border: `1px solid ${theme.palette.primary.main}`,\n borderRadius: 1\n })}\n >\n {\n isActive\n && (\n <Typography\n variant=\"caption\"\n sx={theme => ({\n color: reservation.remaining <= 30\n ? theme.palette.warning.main\n : theme.palette.text.secondary\n })}\n >\n {activeLabel} — {formatRemaining(reservation.remaining)}\n </Typography>\n )\n }\n {\n !isActive\n && (\n <Typography\n variant=\"caption\"\n sx={{ color: 'text.secondary' }}\n >\n {inactiveLabel}\n </Typography>\n )\n }\n {\n (!isActive && !loading)\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n startIcon={<GenerateIcon />}\n disabled={disabled}\n onClick={generate}\n >\n {buttonLabel}\n </Button>\n )\n }\n {\n loading\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n startIcon={<CircularProgress size={16} thickness={4} />}\n disabled\n >\n {buttonLabel}\n </Button>\n )\n }\n {\n (isActive && !loading)\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n color=\"warning\"\n startIcon={<ReleaseIcon />}\n disabled={disabled}\n onClick={release}\n >\n {resolvedReleaseLabel}\n </Button>\n )\n }\n </Box>\n </Box>\n )\n}\n\nFormAutoGenerate.propTypes = {\n fieldName: PropTypes.string.isRequired,\n config: PropTypes.shape({\n url: PropTypes.oneOfType([PropTypes.string, PropTypes.func]).isRequired,\n token: PropTypes.string,\n buttonLabel: PropTypes.string,\n releaseLabel: PropTypes.string,\n activeLabel: PropTypes.string,\n inactiveLabel: PropTypes.string,\n allowManualOverride: PropTypes.bool\n }).isRequired,\n children: PropTypes.node.isRequired\n}\n\nexport default FormAutoGenerate\n","import React, { createElement } from 'react'\n\nimport { render as mm } from 'micromustache'\n\nimport { useInternalFormContext } from '../context/FormContext'\nimport useStoreSelector from '../store/useStoreSelector'\n\nconst resolveErrors = (fieldResult, errorMessages) => {\n if (!fieldResult || !fieldResult.errors) return []\n return fieldResult.errors.map(({ message, options, validator: eVal, ...restError }) => {\n let finalMessage = message\n if (options && options.human) finalMessage = options.human\n else if (errorMessages[eVal]) finalMessage = mm(errorMessages[eVal], options)\n return { message: finalMessage, options, validator: eVal, ...restError }\n })\n}\n\nconst AdornmentField = React.memo(({ adornmentEntry, mainFieldName, position, inputVariant }) => {\n const {\n store,\n schema,\n translations,\n errorMessages,\n resolvedSlots,\n handleFieldChange,\n propDisabled\n } = useInternalFormContext()\n\n const apName = adornmentEntry[0]\n const preSubmit = useStoreSelector(store, s => s.preSubmitValidation)\n const value = useStoreSelector(store, s => s.data[apName])\n const fieldResult = useStoreSelector(store, s => s.results?.[apName])\n\n const disabled = preSubmit || propDisabled\n const schemaField = schema.properties[apName]\n if (!schemaField) return false\n\n const apType = schemaField.type\n const apSlotKey = `ap${apType.charAt(0).toUpperCase() + apType.slice(1)}`\n const apComponent = resolvedSlots[apSlotKey] || resolvedSlots.apDefault\n\n return createElement(apComponent, {\n key: `form-field-${mainFieldName}-${position}-${apName}`,\n variant: inputVariant,\n disabled,\n onChange: handleFieldChange,\n name: apName,\n value,\n required: fieldResult?.required,\n hasErrors: fieldResult?.hasErrors,\n errors: resolveErrors(fieldResult, errorMessages),\n label: translations?.labels?.[apName] || apName\n })\n})\n\nexport default AdornmentField\n","import React from 'react'\n\nimport { render as mm } from 'micromustache'\n\nimport { useInternalFormContext } from '../context/FormContext'\nimport { useGroupDisabled } from '../context/GroupDisabledContext'\nimport useStoreSelector from '../store/useStoreSelector'\nimport FormAutoGenerate from '../Components/FormAutoGenerate'\nimport AdornmentField from './AdornmentField'\n\n/**\n * Resolve the field name (string) from various field entry formats:\n * 'fieldName' → 'fieldName'\n * ['fieldName', props] → 'fieldName'\n * ['@@render', 'fieldName', props] → 'fieldName'\n * ['@@markdown', 'id', content] → 'id'\n */\nconst resolveFieldName = fieldEntry => {\n if (typeof fieldEntry === 'string') return fieldEntry\n if (!Array.isArray(fieldEntry)) return null\n if (fieldEntry[0] === '@@render') return fieldEntry[1]\n if (fieldEntry[0] === '@@markdown') return fieldEntry[1]\n return fieldEntry[0]\n}\n\n/**\n * Resolve specialProps from a field entry.\n */\nconst resolveSpecialProps = fieldEntry => {\n if (typeof fieldEntry === 'string') return {}\n if (!Array.isArray(fieldEntry)) return {}\n if (fieldEntry[0] === '@@render') return fieldEntry[2] || {}\n if (fieldEntry[0] === '@@markdown') return {}\n return fieldEntry[1] || {}\n}\n\nconst resolveErrors = (fieldResult, errorMessages) => {\n if (!fieldResult || !fieldResult.errors) return []\n return fieldResult.errors.map(({ message, options, validator: eVal, ...restError }) => {\n let finalMessage = message\n if (options && options.human) finalMessage = options.human\n else if (errorMessages[eVal]) finalMessage = mm(errorMessages[eVal], options)\n return { message: finalMessage, options, validator: eVal, ...restError }\n })\n}\n\n/**\n * Resolve which component to use for a field.\n * Priority (highest to lowest):\n * 1. @@render → renderComponentMap[fieldName]\n * 2. fieldSlots[fieldName] (per-name override)\n * 3. resolvedSlots[type] (per-type override, defaultSlots merged with slots prop)\n * 4. resolvedSlots.default (catch-all)\n * 5. throw\n */\nconst resolveComponent = ({\n fieldName, isRender, schemaType, resolvedSlots, fieldSlots, renderComponentMap\n}) => {\n if (isRender) {\n const component = renderComponentMap[fieldName]\n if (!component) throw new Error(`renderComponentMap has no entry for field \"${fieldName}\"`)\n return { component, props: {} }\n }\n\n if (fieldSlots[fieldName] !== undefined) {\n return { component: fieldSlots[fieldName], props: {} }\n }\n\n let slotKey\n if (typeof schemaType === 'string' && resolvedSlots[schemaType] !== undefined) {\n slotKey = schemaType\n } else if (Array.isArray(schemaType)) {\n slotKey = 'select'\n } else if (resolvedSlots.default !== undefined) {\n slotKey = 'default'\n } else {\n throw new Error(`Could not find a component to render for field \"${fieldName}\" (type: ${JSON.stringify(schemaType)})`)\n }\n\n const entry = resolvedSlots[slotKey]\n if (!entry) throw new Error(`Could not find a component to render for field \"${fieldName}\"`)\n\n // Support legacy [Component, defaultProps] tuple\n if (Array.isArray(entry)) return { component: entry[0], props: entry[1] }\n\n return { component: entry, props: {} }\n}\n\n/**\n * Build options for select/array fields from schema and translations.\n */\nconst buildOptions = ({ schemaType, fieldName, schemaField, translations }) => {\n if (Array.isArray(schemaType)) {\n return schemaType.map(value => ({\n label: translations?.[fieldName]?.[value] || value,\n value\n }))\n }\n if (schemaType === 'array' && schemaField.options) {\n return schemaField.options.reduce((acc, r) => ({\n ...acc,\n [r]: translations?.[fieldName]?.[r] || r\n }), {})\n }\n return undefined\n}\n\n/**\n * Scan allFields for adornment entries targeting fieldName,\n * and return arrays of <AdornmentField> components (each with its own subscriptions).\n */\nconst buildAdornmentElements = ({ allFields, fieldName, inputVariant }) => {\n const append = []\n const prepend = []\n\n allFields.forEach(apField => {\n if (!Array.isArray(apField) || !apField[1]) return\n\n const isAppend = apField[1].appends === fieldName\n const isPrepend = apField[1].prepends === fieldName\n if (!isAppend && !isPrepend) return\n\n const el = (\n <AdornmentField\n key={`adornment-${apField[0]}`}\n adornmentEntry={apField}\n mainFieldName={fieldName}\n position={isAppend ? 'append' : 'prepend'}\n inputVariant={inputVariant}\n />\n )\n\n if (isAppend) append.push(el)\n if (isPrepend) prepend.push(el)\n })\n\n return {\n append: append.length > 0 ? append : undefined,\n prepend: prepend.length > 0 ? prepend : undefined\n }\n}\n\n// ---------------------------------------------------------------------------\n// FieldRenderer\n// ---------------------------------------------------------------------------\n\n/**\n * FieldRenderer — renders a single field with fine-grained store subscriptions.\n * Only re-renders when THIS field's data, result, or fieldState changes.\n *\n * @param {string|Array} fieldEntry - the raw field descriptor from renderSchema\n * @param {Array} allFields - all sibling fields in the same section (for adornments)\n */\nconst FieldRenderer = ({ fieldEntry, allFields }) => {\n const {\n store,\n schema,\n translations,\n errorMessages,\n readOnly,\n inputVariant,\n variant,\n resolvedSlots,\n slotProps,\n fieldSlots,\n fieldSlotProps,\n renderComponentMap,\n handleFieldChange,\n handleFocus,\n handleBlur,\n obscuredFields,\n propDisabled\n } = useInternalFormContext()\n\n const fieldName = resolveFieldName(fieldEntry)\n const isMarkdown = Array.isArray(fieldEntry) && fieldEntry[0] === '@@markdown'\n const isRender = Array.isArray(fieldEntry) && fieldEntry[0] === '@@render'\n const isApField = !isRender && Array.isArray(fieldEntry) && (fieldEntry[1]?.appends || fieldEntry[1]?.prepends)\n\n const groupDisabled = useGroupDisabled()\n\n // ALL hooks called unconditionally — Rules of Hooks requires this order to be stable\n const value = useStoreSelector(store, s => s.data[fieldName])\n const fieldResult = useStoreSelector(store, s => s.results?.[fieldName])\n const fieldState = useStoreSelector(store, s => s.fieldStates?.[fieldName])\n const preSubmitValidation = useStoreSelector(store, s => s.preSubmitValidation)\n\n // @@markdown: purely static, no field in schema\n if (isMarkdown) {\n const MarkdownComponent = resolvedSlots.readOnlyMarkdown\n return <MarkdownComponent content={fieldEntry[2]} />\n }\n\n // Adornment-only fields are not rendered standalone (they attach to a sibling field)\n if (isApField) return false\n\n const specialProps = resolveSpecialProps(fieldEntry)\n const { hidden, hideLabel, autoGenerate, ...extraProps } = specialProps\n\n if (hidden === true) return false\n\n const disabled = preSubmitValidation || propDisabled || groupDisabled\n\n if (!fieldResult) return false\n\n const { prohibited, required, optional, hasErrors, errors, data: fieldData } = fieldResult\n\n // Don't render prohibited or optional fields with no data\n if (prohibited === true || (!required && !optional && fieldData === undefined)) return false\n\n // In read-only mode: skip empty fields\n if (readOnly && (value === '' || value === undefined)) return false\n\n // Obscured fields in read-only mode\n if (readOnly && Array.isArray(obscuredFields) && obscuredFields.includes(fieldName)) {\n const HiddenDataComponent = resolvedSlots.hiddenData\n const label = hideLabel !== true && (translations?.labels?.[fieldName] || fieldName)\n return <HiddenDataComponent subject=\"Das Feld\" label={label} />\n }\n\n const schemaField = schema.properties[fieldName]\n if (!schemaField) return false\n\n const { type: schemaType, default: defaultValue } = schemaField\n\n // Resolve which component to render\n let component; let\n componentDefaultProps\n try {\n const resolved = resolveComponent({ fieldName, isRender, schemaType, resolvedSlots, fieldSlots, renderComponentMap })\n component = resolved.component\n componentDefaultProps = resolved.props\n } catch (e) {\n console.error(e)\n return false\n }\n\n const label = hideLabel !== true && (translations?.labels?.[fieldName] || fieldName)\n\n // Build options for select/array fields\n const options = buildOptions({ schemaType, fieldName, schemaField, translations })\n\n // Resolve slot key for slotProps lookup\n const resolvedTypeKey = isRender ? '@@render' : (Array.isArray(schemaType) ? 'select' : (schemaType || 'default'))\n const typeSlotProps = slotProps?.[resolvedTypeKey] || {}\n const namedSlotProps = fieldSlotProps?.[fieldName] || {}\n const finalComponentProps = { ...componentDefaultProps, ...typeSlotProps, ...namedSlotProps, ...extraProps }\n\n const resolvedErrors = resolveErrors(fieldResult, errorMessages)\n\n if (readOnly) {\n const ReadOnlyFieldWrapper = resolvedSlots.readOnlyField\n\n // Use the actual schema type for read-only resolution, never '@@render'\n const readOnlySchemaTypeKey = Array.isArray(schemaType)\n ? 'select'\n : (schemaType || 'string')\n const readOnlyTypeKey = `readOnly${readOnlySchemaTypeKey.charAt(0).toUpperCase() + readOnlySchemaTypeKey.slice(1)}`\n const readOnlyComponent = fieldSlots[fieldName] || resolvedSlots[readOnlyTypeKey] || resolvedSlots.readOnlyDefault\n\n return (\n <ReadOnlyFieldWrapper\n type={readOnlySchemaTypeKey}\n name={fieldName}\n label={label}\n value={value}\n options={options}\n required={required}\n hasErrors={hasErrors}\n errors={resolvedErrors}\n component={readOnlyComponent}\n componentProps={finalComponentProps}\n {...fieldState}\n />\n )\n }\n\n // Adornments — each is a reactive sub-component with its own subscriptions\n const adornments = buildAdornmentElements({ allFields, fieldName, inputVariant })\n\n const FormFieldWrapper = resolvedSlots.field\n\n const fieldElement = (\n <FormFieldWrapper\n variant={inputVariant}\n formVariant={variant}\n type={resolvedTypeKey}\n name={fieldName}\n label={label}\n defaultValue={defaultValue}\n value={value}\n options={options}\n required={required}\n hasErrors={hasErrors}\n errors={resolvedErrors}\n validating={fieldState?.validating}\n dirty={fieldState?.dirty}\n component={component}\n componentProps={finalComponentProps}\n prepend={adornments.prepend}\n append={adornments.append}\n disabled={disabled}\n onChange={handleFieldChange}\n onFocus={handleFocus}\n onBlur={handleBlur}\n />\n )\n\n if (autoGenerate) {\n return (\n <FormAutoGenerate\n fieldName={fieldName}\n config={autoGenerate}\n label={label}\n disabled={disabled}\n onChange={handleFieldChange}\n >\n {fieldElement}\n </FormAutoGenerate>\n )\n }\n\n return fieldElement\n}\n\nexport default React.memo(FieldRenderer)\n","import React, {\n useEffect, useRef\n} from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n Box,\n Button,\n CircularProgress,\n Typography\n} from '@mui/material'\n\nimport {\n AutoFixHigh as GenerateIcon,\n Close as ReleaseIcon\n} from '@mui/icons-material'\n\nimport {\n useFormContext, useFormSelector\n} from '../context/FormContext'\nimport GroupDisabledContext from '../context/GroupDisabledContext'\nimport { useReservationStore } from '../context/ReservationContext'\nimport useStoreSelector from '../store/useStoreSelector'\nimport useReservation from '../hooks/useReservation'\n\n/**\n * Format remaining time.\n * >= 10 min: show hours/minutes only (no seconds ticking)\n * < 10 min: show m:ss with seconds\n * < 60s: show seconds only\n */\nconst formatRemaining = seconds => {\n if (seconds >= 600) {\n const h = Math.floor(seconds / 3600)\n const m = Math.ceil((seconds % 3600) / 60)\n if (h > 0) return `${h}h ${m}min`\n return `${m} min`\n }\n if (seconds >= 60) {\n const m = Math.floor(seconds / 60)\n const s = seconds % 60\n return `${m}:${s.toString().padStart(2, '0')}`\n }\n return `${seconds}s`\n}\n\n/**\n * FormGroupAutoGenerate — wraps an entire form group with reservation controls.\n *\n * Renders a small info card (outlined in primary) above the fields with\n * countdown and a labeled generate/regenerate button.\n */\nconst FormGroupAutoGenerate = ({\n groupId,\n config,\n label,\n fieldNames,\n disabled,\n children\n}) => {\n const {\n url,\n token,\n buttonLabel = 'Generieren',\n releaseLabel,\n activeLabel = 'Reserviert',\n inactiveLabel = 'Nicht reserviert',\n allowManualOverride = false\n } = config\n\n const resolvedReleaseLabel = releaseLabel || `${label || groupId} zurücksetzen`\n\n const { setFieldValues } = useFormContext()\n const reservationStore = useReservationStore()\n\n const { generate, release, loading } = useReservation({\n reservationId: groupId,\n url,\n token,\n label: label || groupId,\n fieldNames,\n setFieldValues\n })\n\n const reservation = useStoreSelector(\n reservationStore,\n s => s.reservations[groupId]\n )\n\n const isActive = reservation && reservation.status === 'active'\n\n // Override detection — release reservation if any field value diverges\n const generatedFieldsRef = useRef()\n\n useEffect(() => {\n if (isActive) {\n generatedFieldsRef.current = reservation.fields\n } else {\n generatedFieldsRef.current = undefined\n }\n }, [isActive, reservation])\n\n // Subscribe to form data for the group's fields — release if any was manually edited\n const selectGroupValues = React.useCallback(\n s => {\n const values = {}\n fieldNames.forEach(name => { values[name] = s.data[name] })\n return values\n },\n [fieldNames]\n )\n\n const currentValues = useFormSelector(selectGroupValues, (a, b) => {\n for (let i = 0; i < fieldNames.length; i++) {\n if (a[fieldNames[i]] !== b[fieldNames[i]]) return false\n }\n return true\n })\n\n useEffect(() => {\n if (!isActive || !allowManualOverride || !generatedFieldsRef.current) return\n\n const generated = generatedFieldsRef.current\n const wasOverridden = fieldNames.some(name => currentValues[name] !== generated[name])\n\n if (wasOverridden) {\n release()\n }\n }, [isActive, allowManualOverride, fieldNames, currentValues, release])\n\n return (\n <Box sx={{ width: '100%' }}>\n <Box\n sx={theme => ({\n display: 'flex',\n alignItems: 'center',\n justifyContent: 'space-between',\n width: '100%',\n mb: 1.5,\n px: 1.5,\n py: 0.75,\n border: `1px solid ${theme.palette.primary.main}`,\n borderRadius: 1\n })}\n >\n {\n isActive\n && (\n <Typography\n variant=\"caption\"\n sx={theme => ({\n color: reservation.remaining <= 30\n ? theme.palette.warning.main\n : theme.palette.text.secondary\n })}\n >\n {activeLabel} — {formatRemaining(reservation.remaining)}\n </Typography>\n )\n }\n {\n !isActive\n && (\n <Typography\n variant=\"caption\"\n sx={{ color: 'text.secondary' }}\n >\n {inactiveLabel}\n </Typography>\n )\n }\n {\n (!isActive && !loading)\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n startIcon={<GenerateIcon />}\n disabled={disabled}\n onClick={generate}\n >\n {buttonLabel}\n </Button>\n )\n }\n {\n loading\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n startIcon={<CircularProgress size={16} thickness={4} />}\n disabled\n >\n {buttonLabel}\n </Button>\n )\n }\n {\n (isActive && !loading)\n && (\n <Button\n size=\"small\"\n variant=\"outlined\"\n color=\"warning\"\n startIcon={<ReleaseIcon />}\n disabled={disabled}\n onClick={release}\n >\n {resolvedReleaseLabel}\n </Button>\n )\n }\n </Box>\n <GroupDisabledContext.Provider value={isActive && !allowManualOverride}>\n {children}\n </GroupDisabledContext.Provider>\n </Box>\n )\n}\n\nFormGroupAutoGenerate.propTypes = {\n groupId: PropTypes.string.isRequired,\n config: PropTypes.shape({\n url: PropTypes.oneOfType([PropTypes.string, PropTypes.func]).isRequired,\n token: PropTypes.string,\n buttonLabel: PropTypes.string,\n releaseLabel: PropTypes.string,\n activeLabel: PropTypes.string,\n inactiveLabel: PropTypes.string,\n allowManualOverride: PropTypes.bool\n }).isRequired,\n fieldNames: PropTypes.arrayOf(PropTypes.string).isRequired,\n children: PropTypes.node.isRequired\n}\n\nexport default FormGroupAutoGenerate\n","import React from 'react'\nimport PropTypes from 'prop-types'\n\nimport FormSectionBlock from './FormSectionBlock'\nimport { useInternalFormContext } from './context/FormContext'\nimport FieldRenderer from './internal/FieldRenderer'\nimport FormGroupAutoGenerate from './Components/FormGroupAutoGenerate'\n\n/**\n * Derives a stable key for a field entry (to use as React key).\n */\nconst getFieldKey = (fieldEntry, index) => {\n if (typeof fieldEntry === 'string') return fieldEntry\n if (Array.isArray(fieldEntry)) return `${fieldEntry[0]}-${fieldEntry[1] || index}`\n if (fieldEntry && fieldEntry.id) return fieldEntry.id\n return String(index)\n}\n\n/**\n * Extract plain field names from the fields array (for group-level reservation).\n * Skips @@render, @@markdown, and nested section objects.\n */\nconst extractFieldNames = fields => {\n const names = []\n\n for (let i = 0; i < fields.length; i++) {\n const entry = fields[i]\n if (typeof entry === 'string') {\n names.push(entry)\n } else if (Array.isArray(entry)) {\n if (entry[0] !== '@@render' && entry[0] !== '@@markdown') {\n names.push(entry[0])\n }\n }\n }\n\n return names\n}\n\n/**\n * FormulatorFormSection — renders a single render group (section) from the renderSchema.\n *\n * All dynamic data (schema, results, data, fieldStates, translations, etc.) is consumed\n * from FormContext — no prop drilling needed beyond structural section properties.\n */\nconst FormulatorFormSection = ({\n sectionId,\n label,\n desc,\n fields,\n autoGenerate,\n labelVariant,\n descVariant,\n textAlign,\n nested = 0\n}) => {\n const { variant, resolvedSlots } = useInternalFormContext()\n\n const SectionWrapper = (nested === 0 && variant === 'card')\n ? resolvedSlots.sectionCard\n : FormSectionBlock\n\n const fieldElements = fields.map((fieldEntry, i) => {\n if (fieldEntry === false) return false\n\n // Nested section (object with `fields` property)\n if (fieldEntry && typeof fieldEntry === 'object' && !Array.isArray(fieldEntry) && fieldEntry.fields) {\n return (\n <FormulatorFormSection\n key={`form-section-${fieldEntry.id}`}\n sectionId={fieldEntry.id}\n label={fieldEntry.label}\n desc={fieldEntry.description}\n fields={fieldEntry.fields}\n autoGenerate={fieldEntry.autoGenerate}\n labelVariant={labelVariant}\n descVariant={descVariant}\n textAlign={textAlign}\n nested={(nested || 0) + 1}\n />\n )\n }\n\n return (\n <FieldRenderer\n key={getFieldKey(fieldEntry, i)}\n fieldEntry={fieldEntry}\n allFields={fields}\n />\n )\n })\n\n return (\n <SectionWrapper\n groupId={sectionId}\n label={label}\n labelVariant={labelVariant}\n desc={desc}\n descVariant={descVariant}\n textAlign={textAlign}\n >\n {\n autoGenerate\n && (\n <FormGroupAutoGenerate\n groupId={sectionId}\n config={autoGenerate}\n label={label}\n fieldNames={extractFieldNames(fields)}\n >\n {fieldElements}\n </FormGroupAutoGenerate>\n )\n }\n {\n !autoGenerate\n && fieldElements\n }\n </SectionWrapper>\n )\n}\n\nFormulatorFormSection.propTypes = {\n sectionId: PropTypes.string.isRequired,\n label: PropTypes.string,\n desc: PropTypes.string,\n labelVariant: PropTypes.string,\n descVariant: PropTypes.string,\n textAlign: PropTypes.oneOf(['left', 'center', 'right']),\n fields: PropTypes.array.isRequired,\n autoGenerate: PropTypes.shape({\n url: PropTypes.string.isRequired,\n token: PropTypes.string,\n allowManualOverride: PropTypes.bool,\n allowRegenerate: PropTypes.bool\n }),\n nested: PropTypes.number\n}\n\nexport default React.memo(FormulatorFormSection)\n","import React, {\n useRef,\n useEffect,\n useLayoutEffect,\n useCallback,\n useMemo\n} from 'react'\nimport PropTypes from 'prop-types'\n\nimport { validate as validator } from '@scenid/formulator'\nimport isEqual from 'fast-deep-equal'\nimport { render as mm } from 'micromustache'\n\nimport FormContext from './context/FormContext'\nimport ReservationContext from './context/ReservationContext'\nimport FormStore from './store/FormStore'\nimport createReservationStore from './store/ReservationStore'\nimport { defaultSlots } from './slots/defaultSlots'\nimport FormulatorFormSection from './FormulatorFormSection'\nimport HiddenData from './Components/HiddenData'\nimport abortableOAuthFetch from './utils/fetch'\n\nimport 'highlight.js/styles/shades-of-purple.css'\n\n// ---------------------------------------------------------------------------\n// Pure helpers (same logic as original class, but free functions)\n// ---------------------------------------------------------------------------\n\nconst asyncValidatorEnvelope = async (path, func) => {\n const r = await func()\n if (r !== true) return { path, validator: 'Async', message: r }\n return true\n}\n\nconst validateSync = (schema, data) => validator(schema, data)\n\n/**\n * After full-form validation, the validator returns fresh object references for\n * every field result — even fields that didn't change. This causes every\n * FieldRenderer (which subscribes via Object.is equality) to re-render.\n *\n * preserveResultRefs compares each field result with its previous version and\n * keeps the old reference when deeply equal, so only actually-changed fields\n * trigger a React update.\n */\nconst preserveResultRefs = (prevResults, nextResults) => {\n if (!prevResults) return nextResults\n\n const merged = {}\n const keys = Object.keys(nextResults)\n\n for (let i = 0; i < keys.length; i++) {\n const k = keys[i]\n if (prevResults[k] && isEqual(prevResults[k], nextResults[k])) {\n merged[k] = prevResults[k]\n } else {\n merged[k] = nextResults[k]\n }\n }\n\n return merged\n}\n\n/**\n * Compute isDirty with early exit instead of reducing over all field states.\n */\nconst computeIsDirty = fieldStates => {\n const values = Object.values(fieldStates)\n for (let i = 0; i < values.length; i++) {\n if (values[i].dirty) return true\n }\n return false\n}\n\nconst getInitialData = (schema, iniData, transientData, iniFieldStates) => {\n const { hasErrors, errors, results, data, sanitizedData } = validateSync(schema, { ...iniData, ...transientData })\n\n const fieldStates = iniFieldStates || (\n Object\n .keys(results)\n .map(path => ({\n [path]: {\n validating: false,\n active: false,\n touched: false,\n dirty: false,\n inactive: true,\n pristine: true,\n clean: true\n }\n }))\n .reduce((l, r) => ({ ...l, ...r }), {})\n )\n\n const finalData = (\n Object\n .entries(data)\n .map(e => {\n let value = e[1]\n if (value === undefined && sanitizedData[e[0]] !== undefined) value = sanitizedData[e[0]]\n return { [e[0]]: value }\n })\n .reduce((l, r) => ({ ...l, ...r }), {})\n )\n\n return {\n preSubmitValidation: false,\n hasErrors,\n isDirty: computeIsDirty(fieldStates),\n errors,\n results,\n data: finalData,\n asyncErrors: [],\n fieldStates\n }\n}\n\n// ---------------------------------------------------------------------------\n// FormErrorList — subscribes to store errors, rendered inside FormulatorForm\n// ---------------------------------------------------------------------------\n\nconst FormErrorList = ({ store, errorMessages, translations }) => {\n const [state, setState] = React.useState(() => ({\n hasErrors: store.getState().hasErrors,\n errors: store.getState().errors\n }))\n\n useEffect(() => {\n const unsubscribe = store.subscribe(() => {\n const { hasErrors, errors } = store.getState()\n setState(prev => {\n if (prev.hasErrors === hasErrors && isEqual(prev.errors, errors)) return prev\n return { hasErrors, errors }\n })\n })\n return unsubscribe\n }, [store])\n\n if (!state.hasErrors) return false\n\n return (\n <div className=\"errors\">\n {state.errors.map(({ path, message, options, validator: eVal }) => {\n let finalMessage = message\n if (options && options.human) finalMessage = options.human\n else if (errorMessages[eVal]) finalMessage = mm(errorMessages[eVal], options)\n\n return (\n <div key={`form-error-${path}-${eVal}`} className=\"error\">\n <div className=\"field\">{translations?.labels?.[path] || path}</div>\n <div className=\"message\">{finalMessage}</div>\n </div>\n )\n })}\n </div>\n )\n}\n\n// ---------------------------------------------------------------------------\n// FormulatorForm — functional component\n// ---------------------------------------------------------------------------\n\nconst FormulatorForm = props => {\n const {\n id,\n variant = 'card',\n inputVariant,\n groupLabelVariant,\n groupDescVariant,\n textAlign,\n readOnly,\n submitOnEnter,\n listErrors,\n schema,\n renderSchema,\n data,\n transientData,\n fieldStates: initialFieldStates,\n disabled: propDisabled,\n translations,\n slots,\n slotProps,\n fieldSlots,\n fieldSlotProps,\n renderComponentMap,\n obscuredFields,\n obscuredGroups,\n errorMessages = {},\n asyncValidators,\n onSubmit,\n onReset,\n onStatusUpdate,\n onStateChange,\n onUnmount\n } = props\n\n // -------------------------------------------------------------------------\n // Store — created once, never recreated\n // -------------------------------------------------------------------------\n const storeRef = useRef(null)\n if (storeRef.current === null) {\n storeRef.current = new FormStore(getInitialData(schema, data, transientData, initialFieldStates))\n }\n const store = storeRef.current\n\n // -------------------------------------------------------------------------\n // ReservationStore — created once, manages pessimistic reservation state\n // -------------------------------------------------------------------------\n const reservationStoreRef = useRef(null)\n if (reservationStoreRef.current === null) {\n reservationStoreRef.current = createReservationStore()\n }\n const reservationStore = reservationStoreRef.current\n\n // Keep a ref to the initial data for dirty checking (updated on full reinitialize)\n const initialDataRef = useRef(data)\n\n // -------------------------------------------------------------------------\n // Stable callback refs (prevent effect restarts when parent re-renders with new callbacks)\n // -------------------------------------------------------------------------\n const callbacksRef = useRef({ onSubmit, onReset, onStatusUpdate, onStateChange, onUnmount })\n useLayoutEffect(() => {\n callbacksRef.current = { onSubmit, onReset, onStatusUpdate, onStateChange, onUnmount }\n })\n\n // Stable ref for propDisabled (read inside async callbacks without dependency)\n const propDisabledRef = useRef(propDisabled)\n useLayoutEffect(() => { propDisabledRef.current = propDisabled })\n\n // -------------------------------------------------------------------------\n // fireCallbacks — replaces handleValidation + ee.emit('validation', ...)\n // -------------------------------------------------------------------------\n const fireCallbacks = useCallback((result, wasPreSubmit) => {\n const { onStateChange: cbState, onStatusUpdate: cbStatus, onSubmit: cbSubmit } = callbacksRef.current\n const storeState = store.getState()\n\n if (cbState) cbState(result)\n\n if (cbStatus) {\n cbStatus({\n preSubmitValidation: storeState.preSubmitValidation,\n hasErrors: result.hasErrors,\n errors: result.errors,\n isDirty: storeState.isDirty\n })\n }\n\n if (wasPreSubmit && !result.hasErrors && cbSubmit) {\n cbSubmit(result.sanitizedData)\n }\n }, [store])\n\n // -------------------------------------------------------------------------\n // Async validation — replaces the module-level validate() + EventEmitter\n // -------------------------------------------------------------------------\n const asyncControllerRef = useRef(null)\n const validationFrameRef = useRef(null)\n\n /**\n * Core validation logic — extracted so it can run immediately (submit) or\n * deferred (field change). Preserves result references for unchanged fields\n * so only actually-changed FieldRenderers re-render.\n */\n const executeValidation = useCallback(async (newData, newFieldStates, newAsyncErrors) => {\n // Cancel any in-flight async validation\n if (asyncControllerRef.current) {\n asyncControllerRef.current.abort()\n }\n asyncControllerRef.current = new AbortController()\n const { signal } = asyncControllerRef.current\n\n const syncResult = validator(schema, newData)\n const prevResults = store.getState().results\n syncResult.results = preserveResultRefs(prevResults, syncResult.results)\n\n if (!asyncValidators) {\n const wasPreSubmit = store.getState().preSubmitValidation\n store.setState({\n ...syncResult,\n data: newData,\n fieldStates: newFieldStates,\n asyncErrors: [],\n preSubmitValidation: false,\n isDirty: computeIsDirty(newFieldStates)\n })\n fireCallbacks(syncResult, wasPreSubmit)\n asyncControllerRef.current = undefined\n return\n }\n\n const activeValidators = (\n Object\n .entries(asyncValidators)\n .map(e => ({ path: e[0], func: e[1] }))\n .filter(({ path }) => syncResult.results[path]?.sanitizedData !== undefined)\n )\n\n if (activeValidators.length === 0) {\n const wasPreSubmit = store.getState().preSubmitValidation\n store.setState({\n ...syncResult,\n data: newData,\n fieldStates: newFieldStates,\n asyncErrors: newAsyncErrors || [],\n preSubmitValidation: false,\n isDirty: computeIsDirty(newFieldStates)\n })\n fireCallbacks({ ...syncResult, asyncErrors: newAsyncErrors || [] }, wasPreSubmit)\n asyncControllerRef.current = undefined\n return\n }\n\n // Set validating flags for async fields\n const validatingFieldStates = { ...newFieldStates }\n activeValidators.forEach(({ path }) => {\n validatingFieldStates[path] = { ...validatingFieldStates[path], validating: true }\n })\n store.setState({ data: newData, fieldStates: validatingFieldStates })\n\n let asyncResults\n try {\n asyncResults = await Promise.all(\n activeValidators.map(({ path, func }) => {\n if (signal.aborted) return Promise.resolve(true)\n if (newData[path]) {\n return asyncValidatorEnvelope(path, () => func(path, newData[path]))\n }\n return Promise.resolve(true)\n })\n )\n } catch (e) {\n if (e.name === 'AbortError') return\n throw e\n }\n\n if (signal.aborted) return\n\n const asyncErrors = asyncResults.filter(m => m !== true)\n\n // Merge async errors into results\n const mergedResults = { ...syncResult.results }\n asyncErrors.forEach(e => {\n const fr = mergedResults[e.path]\n if (fr) {\n fr.errors = [...(fr.errors || []), e]\n fr.hasErrors = true\n fr.sanitizedData = undefined\n }\n })\n\n const mergedErrors = [...syncResult.errors, ...asyncErrors]\n const mergedResult = {\n ...syncResult,\n hasErrors: mergedErrors.length > 0,\n errors: mergedErrors,\n asyncErrors,\n results: mergedResults\n }\n\n const wasPreSubmit = store.getState().preSubmitValidation\n store.setState({\n ...mergedResult,\n data: newData,\n fieldStates: newFieldStates,\n preSubmitValidation: false,\n isDirty: computeIsDirty(newFieldStates)\n })\n fireCallbacks(mergedResult, wasPreSubmit)\n asyncControllerRef.current = undefined\n }, [schema, asyncValidators, store, fireCallbacks])\n\n /**\n * Deferred validation — updates data immediately so the input stays\n * responsive, then schedules the expensive validator() call on the next\n * animation frame. Rapid keystrokes coalesce into a single validation run.\n */\n const runValidation = useCallback((newData, newFieldStates, newAsyncErrors) => {\n // Update data + fieldStates immediately so the typed character appears\n store.setState({\n data: newData,\n fieldStates: newFieldStates,\n isDirty: computeIsDirty(newFieldStates)\n })\n\n // Coalesce: cancel any pending validation frame\n if (validationFrameRef.current) {\n cancelAnimationFrame(validationFrameRef.current)\n }\n\n validationFrameRef.current = requestAnimationFrame(() => {\n validationFrameRef.current = undefined\n executeValidation(newData, newFieldStates, newAsyncErrors)\n })\n }, [store, executeValidation])\n\n /**\n * Immediate validation — used by submit and other operations that need\n * results right away (no deferral).\n */\n const runValidationImmediate = useCallback((newData, newFieldStates, newAsyncErrors) => {\n if (validationFrameRef.current) {\n cancelAnimationFrame(validationFrameRef.current)\n validationFrameRef.current = undefined\n }\n return executeValidation(newData, newFieldStates, newAsyncErrors)\n }, [executeValidation])\n\n // -------------------------------------------------------------------------\n // handleFieldChange\n // -------------------------------------------------------------------------\n const handleFieldChange = useCallback(e => {\n const { name, value } = e.target\n const { preSubmitValidation, data: oldData, asyncErrors, fieldStates } = store.getState()\n\n if (preSubmitValidation || propDisabledRef.current) return\n\n const isDirty = initialDataRef.current[name] !== value\n const newData = { ...oldData, [name]: value }\n const newFieldStates = {\n ...fieldStates,\n [name]: { ...fieldStates[name], dirty: isDirty, clean: !isDirty }\n }\n const newAsyncErrors = asyncErrors.filter(({ path }) => path !== name)\n\n runValidation(newData, newFieldStates, newAsyncErrors)\n }, [store, runValidation])\n\n /**\n * Set multiple field values in a single store update.\n * @param {object} fieldValues — { fieldName: value, ... }\n */\n const handleFieldValues = useCallback(fieldValues => {\n const { preSubmitValidation, data: oldData, asyncErrors, fieldStates } = store.getState()\n\n if (preSubmitValidation || propDisabledRef.current) return\n\n const entries = Object.entries(fieldValues)\n const newData = { ...oldData }\n const newFieldStates = { ...fieldStates }\n const paths = []\n\n entries.forEach(([name, value]) => {\n const isDirty = initialDataRef.current[name] !== value\n newData[name] = value\n newFieldStates[name] = { ...newFieldStates[name], dirty: isDirty, clean: !isDirty }\n paths.push(name)\n })\n\n const newAsyncErrors = asyncErrors.filter(({ path }) => !paths.includes(path))\n\n runValidation(newData, newFieldStates, newAsyncErrors)\n }, [store, runValidation])\n\n // -------------------------------------------------------------------------\n // handleFocus / handleBlur\n // -------------------------------------------------------------------------\n const handleFocus = useCallback(e => {\n const path = e.target.name\n store.setState(s => ({\n fieldStates: {\n ...s.fieldStates,\n [path]: { ...s.fieldStates[path], active: true, inactive: false }\n }\n }))\n }, [store])\n\n const handleBlur = useCallback(e => {\n const path = e.target.name\n store.setState(s => ({\n fieldStates: {\n ...s.fieldStates,\n [path]: { ...s.fieldStates[path], active: false, inactive: true, touched: true, pristine: false }\n }\n }))\n }, [store])\n\n // -------------------------------------------------------------------------\n // reportStatus — initial status report on mount\n // -------------------------------------------------------------------------\n const reportStatus = useCallback(() => {\n const { hasErrors, fieldStates } = store.getState()\n const { onStatusUpdate: cbStatus } = callbacksRef.current\n if (cbStatus) {\n cbStatus({\n preSubmitValidation: false,\n hasErrors,\n isDirty: computeIsDirty(fieldStates)\n })\n }\n }, [store])\n\n // -------------------------------------------------------------------------\n // reinitialize — reset to initial data prop\n // -------------------------------------------------------------------------\n const reinitialize = useCallback(() => {\n initialDataRef.current = data\n store.setState(getInitialData(schema, data, transientData))\n reportStatus()\n }, [data, schema, transientData, store, reportStatus])\n\n // -------------------------------------------------------------------------\n // forceFieldChanges — apply transientData updates without full reinit\n // -------------------------------------------------------------------------\n const forceFieldChanges = useCallback(changedEntries => {\n const { preSubmitValidation, data: oldData, asyncErrors, fieldStates } = store.getState()\n if (preSubmitValidation || propDisabledRef.current) return\n\n const newData = { ...oldData }\n let newAsyncErrors = []\n const newFieldStates = { ...fieldStates }\n\n changedEntries.forEach(({ name, value }) => {\n let finalValue = value\n // Preserve the boolean toggle behavior from the original class\n if (schema.properties[name] && schema.properties[name].type === 'boolean') {\n finalValue = oldData[name] !== true\n }\n\n const isDirty = initialDataRef.current[name] !== value\n newAsyncErrors = asyncErrors.filter(({ path }) => path !== name).concat(newAsyncErrors)\n newFieldStates[name] = { ...fieldStates[name], dirty: isDirty, clean: !isDirty }\n newData[name] = finalValue\n })\n\n runValidationImmediate(newData, newFieldStates, newAsyncErrors)\n }, [store, schema, runValidationImmediate])\n\n // -------------------------------------------------------------------------\n // handleSubmit\n // -------------------------------------------------------------------------\n const handleSubmit = useCallback(() => {\n const { errors, hasErrors, data: currentData, asyncErrors, fieldStates } = store.getState()\n const { onStatusUpdate: cbStatus } = callbacksRef.current\n\n store.setState({ preSubmitValidation: true })\n\n const isDirty = computeIsDirty(fieldStates)\n if (cbStatus) {\n cbStatus({ preSubmitValidation: true, hasErrors, errors, isDirty })\n }\n\n runValidationImmediate(currentData, fieldStates, asyncErrors)\n }, [store, runValidationImmediate])\n\n // -------------------------------------------------------------------------\n // Lifecycle: componentDidMount equivalent\n // -------------------------------------------------------------------------\n useEffect(() => {\n reportStatus()\n return () => {\n if (validationFrameRef.current) cancelAnimationFrame(validationFrameRef.current)\n\n // Release all active reservations on unmount\n const { reservations } = reservationStore.getState()\n Object.values(reservations).forEach(r => {\n if (r.status === 'active' && r.releaseUrl) {\n abortableOAuthFetch(r.releaseUrl, { method: 'DELETE' }).catch(() => {})\n }\n })\n\n const { hasErrors, isDirty, data: storeData, fieldStates } = store.getState()\n const { onUnmount: cbUnmount } = callbacksRef.current\n if (cbUnmount) cbUnmount({ hasErrors, isDirty, data: storeData, fieldStates })\n }\n }, []) // eslint-disable-line react-hooks/exhaustive-deps\n\n // -------------------------------------------------------------------------\n // Lifecycle: watch `data` prop — full reinitialize on change\n // -------------------------------------------------------------------------\n const prevDataRef = useRef(data)\n useEffect(() => {\n if (!isEqual(prevDataRef.current, data)) {\n prevDataRef.current = data\n initialDataRef.current = data\n store.setState(getInitialData(schema, data, transientData))\n reportStatus()\n }\n }, [data]) // eslint-disable-line react-hooks/exhaustive-deps\n\n // -------------------------------------------------------------------------\n // Lifecycle: watch `transientData` prop — partial field update\n // -------------------------------------------------------------------------\n const prevTransientRef = useRef(transientData)\n useEffect(() => {\n if (transientData && !isEqual(transientData, prevTransientRef.current)) {\n prevTransientRef.current = transientData\n\n const changedEntries = Object\n .entries(transientData)\n .filter(([k, v]) => v !== prevDataRef.current[k])\n .map(([name, value]) => ({ name, value }))\n\n if (changedEntries.length > 0) forceFieldChanges(changedEntries)\n }\n }, [transientData]) // eslint-disable-line react-hooks/exhaustive-deps\n\n // -------------------------------------------------------------------------\n // Stable API exposed via context (for useFormContext)\n // -------------------------------------------------------------------------\n const api = useMemo(() => ({\n submitForm: handleSubmit,\n resetForm: () => { reinitialize(); if (callbacksRef.current.onReset) callbacksRef.current.onReset() },\n setFieldValue: (name, value) => handleFieldChange({ target: { name, value } }),\n setFieldValues: handleFieldValues\n }), [handleSubmit, reinitialize, handleFieldChange, handleFieldValues])\n\n // -------------------------------------------------------------------------\n // Resolved slots — merge defaultSlots with user-provided slots\n // -------------------------------------------------------------------------\n const resolvedSlots = useMemo(() => ({\n ...defaultSlots,\n ...slots\n }), [slots])\n\n // -------------------------------------------------------------------------\n // Context value — stable config; dynamic data goes through the store\n // -------------------------------------------------------------------------\n const contextValue = useMemo(() => ({\n store,\n api,\n id,\n schema,\n translations: translations || {},\n errorMessages: errorMessages || {},\n readOnly: readOnly || false,\n inputVariant: inputVariant || 'standard',\n variant: variant || 'card',\n propDisabled: propDisabled || false,\n resolvedSlots,\n slotProps: slotProps || {},\n fieldSlots: fieldSlots || {},\n fieldSlotProps: fieldSlotProps || {},\n renderComponentMap: renderComponentMap || {},\n handleFocus,\n handleBlur,\n handleFieldChange,\n obscuredFields: obscuredFields || [],\n obscuredGroups: obscuredGroups || []\n }), [\n store, api, id, schema, translations, errorMessages, readOnly,\n inputVariant, variant, propDisabled, resolvedSlots, slotProps,\n fieldSlots, fieldSlotProps, renderComponentMap,\n handleFocus, handleBlur, handleFieldChange,\n obscuredFields, obscuredGroups\n ])\n\n // -------------------------------------------------------------------------\n // Render\n // -------------------------------------------------------------------------\n const disabled = store.getState().preSubmitValidation || propDisabled\n\n const ReservationSnackbar = resolvedSlots.reservationExpiredNotification\n\n return (\n <FormContext.Provider value={contextValue}>\n <ReservationContext.Provider value={reservationStore}>\n <form\n id={id}\n className=\"formulator-form\"\n disabled={disabled}\n onSubmit={e => e.preventDefault()}\n onKeyDown={submitOnEnter ? e => {\n if (e.key === 'Enter' && e.target.tagName !== 'TEXTAREA' && !disabled) {\n e.preventDefault()\n handleSubmit()\n }\n } : undefined}\n onReset={e => {\n e.preventDefault()\n reinitialize()\n if (callbacksRef.current.onReset) callbacksRef.current.onReset()\n }}\n >\n {renderSchema.title && <h5>{renderSchema.title}</h5>}\n {renderSchema.description && <h5>{renderSchema.description}</h5>}\n\n {renderSchema.groups.map(({ id: sectionId, label, description, fields, autoGenerate }) => {\n if (readOnly && Array.isArray(obscuredGroups) && obscuredGroups.includes(sectionId)) {\n return <HiddenData key={`hidden-group-${sectionId}`} subject=\"Der Bereich\" label={label} />\n }\n\n return (\n <FormulatorFormSection\n key={`form-section-${sectionId}`}\n sectionId={sectionId}\n label={label}\n desc={description}\n fields={fields}\n autoGenerate={autoGenerate}\n labelVariant={groupLabelVariant}\n descVariant={groupDescVariant}\n textAlign={textAlign}\n nested={0}\n />\n )\n })}\n\n {listErrors && (\n <FormErrorList\n store={store}\n errorMessages={errorMessages || {}}\n translations={translations || {}}\n />\n )}\n </form>\n <ReservationSnackbar />\n </ReservationContext.Provider>\n </FormContext.Provider>\n )\n}\n\nFormulatorForm.propTypes = {\n id: PropTypes.string.isRequired,\n variant: PropTypes.oneOf(['card', 'block']),\n inputVariant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n textAlign: PropTypes.oneOf(['left', 'center', 'right']),\n groupLabelVariant: PropTypes.oneOf([\n 'h1', 'h2', 'h3', 'h4', 'h5', 'h6',\n 'subtitle1', 'subtitle2', 'body1', 'body2',\n 'button', 'caption', 'overline'\n ]),\n groupDescVariant: PropTypes.oneOf([\n 'h1', 'h2', 'h3', 'h4', 'h5', 'h6',\n 'subtitle1', 'subtitle2', 'body1', 'body2',\n 'button', 'caption', 'overline'\n ]),\n disabled: PropTypes.bool,\n readOnly: PropTypes.bool,\n submitOnEnter: PropTypes.bool,\n listErrors: PropTypes.bool,\n schema: PropTypes.object.isRequired,\n data: PropTypes.object.isRequired,\n transientData: PropTypes.object,\n fieldStates: PropTypes.object,\n renderSchema: PropTypes.object.isRequired,\n translations: PropTypes.object.isRequired,\n asyncValidators: PropTypes.object,\n errorMessages: PropTypes.object,\n // New slots API\n slots: PropTypes.object,\n slotProps: PropTypes.object,\n fieldSlots: PropTypes.object,\n fieldSlotProps: PropTypes.object,\n // Component overrides\n renderComponentMap: PropTypes.object,\n obscuredFields: PropTypes.array,\n obscuredGroups: PropTypes.array,\n // Callbacks\n onSubmit: PropTypes.func,\n onReset: PropTypes.func,\n onStatusUpdate: PropTypes.func,\n onStateChange: PropTypes.func,\n onUnmount: PropTypes.func\n}\n\nexport default FormulatorForm\n","import FormStore from './FormStore'\n\n/**\n * ReservationStore — manages pessimistic reservation state.\n *\n * Kept separate from the form's FormStore so that countdown ticks\n * (once per second) don't trigger selector re-evaluations on every\n * field subscription.\n *\n * State shape:\n * {\n * reservations: {\n * [reservationId]: {\n * voucher: string,\n * fields: { [fieldName]: generatedValue },\n * releaseUrl: string,\n * validFor: number, // original TTL in seconds\n * remaining: number, // countdown (decremented every second)\n * status: 'active' | 'expired' | 'overridden'\n * }\n * },\n * expiredNotification: undefined | { reservationId, label }\n * }\n */\nconst createReservationStore = () => new FormStore({\n reservations: {},\n expiredNotification: undefined\n})\n\nexport default createReservationStore\n","import {\n useCallback, useRef, useState\n} from 'react'\n\nimport abortableOAuthFetch from '../utils/fetch'\n\nconst useFetchOptions = (arg, fetchOptions = {}) => {\n const controllerRef = useRef()\n\n const [loading, setLoading] = useState(false)\n const [options, setOptions] = useState()\n\n const fetch = useCallback(async () => {\n if (Array.isArray(arg)) return setOptions(arg)\n if (typeof arg !== 'string' && typeof arg !== 'function') return setOptions([])\n\n let fetcher = arg\n if (typeof arg === 'string') {\n fetcher = signal => abortableOAuthFetch(arg, { token: fetchOptions.token, signal })\n }\n\n controllerRef.current = new AbortController()\n setOptions(undefined)\n setLoading(true)\n\n try {\n const r = await fetcher(controllerRef.current.signal)\n controllerRef.current = undefined\n\n if (!Array.isArray(r)) throw new Error('autocomplete fetcher returned a non array value')\n\n setOptions(r)\n } catch (e) {\n setLoading(false)\n }\n\n setLoading(false)\n }, [arg, fetchOptions.token])\n\n const abort = useCallback(() => {\n if (loading) setLoading(false)\n\n if (controllerRef.current) {\n controllerRef.current.abort()\n controllerRef.current = undefined\n }\n }, [loading])\n\n return {\n loading,\n fetch,\n abort,\n options\n }\n}\n\nexport default useFetchOptions\n","import React, {\n useEffect, cloneElement\n} from 'react'\nimport PropTypes from 'prop-types'\n\nimport {\n FormControl,\n TextField,\n InputAdornment,\n CircularProgress\n} from '@mui/material'\n\nimport useFetchOptions from '../hooks/useFetchOptions'\n\nconst FormOptionsLoader = ({\n dirty,\n hasErrors,\n required,\n label,\n value,\n variant,\n options: optionsArg,\n baererToken,\n formElement,\n ...inputProps\n}) => {\n const { loading, fetch, abort, options } = useFetchOptions(optionsArg, { token: baererToken })\n\n useEffect(() => { fetch() }, [])\n\n if (!options) {\n return (\n <FormControl\n error={dirty && hasErrors}\n margin=\"dense\"\n fullWidth\n required={required}\n >\n <TextField\n label={label}\n variant={variant}\n value={value}\n disabled\n InputProps={{\n endAdornment: (\n <InputAdornment position=\"end\">\n <CircularProgress\n size={20}\n thickness={4}\n />\n </InputAdornment>\n )\n }}\n />\n </FormControl>\n )\n }\n\n return (\n <FormControl\n error={dirty && hasErrors}\n margin=\"dense\"\n fullWidth\n required={required}\n >\n {\n cloneElement(\n formElement,\n {\n label,\n dirty,\n value,\n variant,\n hasErrors,\n required,\n loading,\n options: options.map(o => ({\n entry: o.entry,\n label: o.entry,\n value: o.entry,\n count: o.count\n })),\n fetch,\n abort,\n ...inputProps\n }\n )\n }\n </FormControl>\n )\n}\n\nFormOptionsLoader.propTypes = {\n name: PropTypes.string,\n label: PropTypes.string,\n value: PropTypes.any,\n options: PropTypes.oneOfType([\n PropTypes.array,\n PropTypes.string,\n PropTypes.func\n ]).isRequired,\n baererToken: PropTypes.string,\n allowCreate: PropTypes.bool,\n variant: PropTypes.oneOf(['standard', 'filled', 'outlined']),\n required: PropTypes.bool,\n disabled: PropTypes.bool,\n readOnly: PropTypes.bool,\n dirty: PropTypes.bool,\n hasErrors: PropTypes.bool,\n errors: PropTypes.array,\n onChange: PropTypes.func,\n formElement: PropTypes.elementType\n}\n\nexport default FormOptionsLoader\n","import React from 'react'\nimport PropTypes from 'prop-types'\nimport cx from 'classnames'\n\nimport {\n Paper,\n Box,\n Typography,\n Switch\n} from '@mui/material'\n\nimport {\n Check as CheckIcon,\n Close as CloseIcon\n} from '@mui/icons-material'\n\nimport {\n makeStyles, useTheme\n} from '@mui/styles'\nimport { alpha } from '@mui/material/styles'\n\nconst useStyles = makeStyles(theme => ({\n default: {\n margin: 0,\n userSelect: 'none',\n '&.clickable': {\n cursor: 'pointer'\n }\n },\n sharpEdges: { borderRadius: 0 },\n spanSolitaryToCard: {\n margin: (theme.spacing(2) * -1),\n padding: theme.spacing(2)\n },\n spanBannerToCard: {\n marginRight: (theme.spacing(2) * -1),\n marginLeft: (theme.spacing(2) * -1),\n padding: theme.spacing(2),\n '&.clickable': {\n marginTop: theme.spacing(1),\n marginBottom: theme.spacing(0.5),\n paddingTop: theme.spacing(1.5),\n paddingRight: theme.spacing(2),\n paddingBottom: theme.spacing(1.5),\n paddingLeft: theme.spacing(2)\n }\n },\n checked: { backgroundColor: alpha(theme.palette.primary.main, 0.12) },\n unchecked: { backgroundColor: theme.palette.grey[200] }\n}))\n\nconst isBoolean = val => val === false || val === true\nconst isChecked = (value, defaultValue) => (isBoolean(value) ? value : (defaultValue || false))\n\nconst FormPrimaryToggle = ({\n formVariant,\n solitary,\n name,\n value,\n defaultValue,\n onChange,\n readOnly,\n checkedLabel,\n uncheckedLabel\n}) => {\n const styles = useStyles()\n const theme = useTheme()\n\n const handleChange = e => {\n const newValue = e.target.checked\n onChange({ target: { name, value: newValue } })\n }\n\n const handleToggleChange = () => {\n if (!readOnly) {\n const newValue = !value\n onChange({ target: { name, value: newValue } })\n }\n }\n\n const checked = isChecked(value, defaultValue)\n\n return (\n <Paper\n elevation={0}\n className={\n cx(\n styles.default,\n {\n clickable: !readOnly,\n [styles.spanSolitaryToCard]: solitary && formVariant === 'card',\n [styles.spanBannerToCard]: !solitary && formVariant === 'card',\n [styles.sharpEdges]: !solitary,\n [styles.checked]: checked,\n [styles.unchecked]: !checked\n }\n )\n }\n onClick={handleToggleChange}\n >\n <Box\n display=\"flex\"\n flexDirection=\"row\"\n justifyContent={readOnly ? 'flex-start' : 'space-between'}\n alignItems=\"center\"\n >\n {\n (readOnly && checked)\n && (\n <Box\n mr={2}\n mb={-0.5}\n >\n <CheckIcon\n fontSize={solitary ? 'large' : 'medium'}\n htmlColor={theme.palette.text.secondary}\n />\n </Box>\n )\n }\n {\n (readOnly && !checked)\n && (\n <Box\n mr={2}\n mb={-0.5}\n >\n <CloseIcon\n fontSize={solitary ? 'large' : 'medium'}\n htmlColor={theme.palette.text.secondary}\n />\n </Box>\n )\n }\n {\n checked\n && (\n <Typography\n variant={solitary ? 'h5' : 'body1'}\n color={!readOnly ? 'primary' : 'textSecondary'}\n >\n {checkedLabel}\n </Typography>\n )\n }\n {\n !checked\n && (\n <Typography\n variant={solitary ? 'h5' : 'body1'}\n color=\"textSecondary\"\n >\n {uncheckedLabel}\n </Typography>\n )\n }\n {\n !readOnly\n && (\n <Switch\n color=\"primary\"\n name={name}\n checked={checked}\n onChange={handleChange}\n />\n )\n }\n </Box>\n </Paper>\n )\n}\n\nFormPrimaryToggle.propTypes = {\n formVariant: PropTypes.oneOf(['block', 'card']).isRequired,\n solitary: PropTypes.bool,\n name: PropTypes.string.isRequired,\n value: PropTypes.bool,\n defaultValue: PropTypes.bool,\n onChange: PropTypes.func.isRequired,\n readOnly: PropTypes.bool,\n checkedLabel: PropTypes.string.isRequired,\n uncheckedLabel: PropTypes.string.isRequired\n}\n\nexport default FormPrimaryToggle\n"],"names":["module","equal","a","b","constructor","length","i","keys","Array","isArray","RegExp","source","flags","valueOf","Object","prototype","toString","hasOwnProperty","call","key","numberConstructor","isFinite","isInteger","isObj","x","isStr","minLength","isNum","isArr","isProp","propName","useStoreSelector","store","selector","equals","arguments","undefined","is","_useState","useState","getState","_useState2","_slicedToArray","value","setValue","selectorRef","useRef","current","useEffect","currentValue","subscribe","newValue","FormContext","createContext","useInternalFormContext","useContext","useFormContext","ctx","Error","useMemo","listener","submitForm","api","resetForm","setFieldValue","setFieldValues","useFormSelector","ReservationContext","useReservationStore","FormStore","initialState","_classCallCheck","this","_state","_listeners","Set","_batchDepth","updater","_objectSpread","_notify","fn","forEach","l","_this","add","FormGroupHeader","_ref","label","_ref$labelVariant","labelVariant","desc","_ref$descVariant","descVariant","_ref$textAlign","textAlign","React","Box","style","width","display","flexDirection","createElement","mb","Typography","variant","align","propTypes","PropTypes","string","oneOf","FormSectionCard","children","Paper","elevation","p","node","useStyles","makeStyles","theme","formSectionBlock","marginBottom","spacing","FormSectionBlock","styles","className","hasOwn","classNames","classes","arg","argType","push","inner","apply","join","exports","default","window","error","color","palette","main","FormControlField","control","formVariant","type","name","component","componentProps","defaultValue","options","hasErrors","errors","required","disabled","validating","dirty","onChange","finalProps","isRender","endAdornment","InputAdornment","position","AutorenewIcon","oldProps","props","cloneElement","e","message","isBoolean","isBooleanButtons","isRepeater","FormControl","margin","fullWidth","FormControlLabel","cx","labelPlacement","FormHelperText","map","any","isRequired","object","oneOfType","bool","number","array","arrayOf","shape","func","FormField","_ref2","prepend","append","fieldProps","_objectWithoutProperties","_excluded","FormGroup","FormDateRange","loading","changeHandler","target","Stack","direction","sx","flex","TextField","InputLabelProps","shrink","start","max","end","structuredClone","justifyContent","alignItems","ml","mr","min","FormText","multiline","minRows","range","extraProps","_extends","castToNumber","step","Number","isNaN","isSafeInteger","parseFloat","parseInt","FormNumber","inputProps","formatDate","renderFormat","formatter","DateTime","DATETIME_FULL","fromISO","toLocaleString","FormReadOnlyText","finalValue","concat","whiteSpace","filter","createFilterOptions","SelectOrCreate","id","allowCreate","searchKey","renderOption","renderNewOption","onOpen","onClose","onInputChange","Autocomplete","_","find","o","entry","_defineProperty","inputValue","filterOptions","allOptions","params","filtered","selectOnFocus","clearOnBlur","handleHomeEndKeys","freeSolo","getOptionLabel","option","isOptionEqualToValue","testValue","renderInput","InputProps","CircularProgress","size","thickness","FormAutocomplete","readOnly","fetch","abort","changeValue","useCallback","count","FormSelect","noSort","sort","r","localeCompare","unshift","select","itemLabel","itemValue","MenuItem","FormCatalogType","autocomplete","isChecked","val","FormBoolean","needsToBeTrue","firstOption","labelTrue","labelFalse","handleChange","checked","Checkbox","buttonFalse","Button","disableElevation","height","onClick","buttonTrue","Fragment","Switch","FormRepeaterDefault","entries","blockedOptions","inEdit","setInEdit","_useState4","_useState3","setInputValue","_useState6","_useState5","catalogSelectValue","setCatalogSelectValue","handleCancelNewEntry","handleEntryAdd","_toConsumableArray","mt","pl","index","px","py","border","grey","borderRadius","text","secondary","fontSize","typography","caption","fontWeight","fontWeightMedium","lineHeight","catalog","IconButton","handleEntryDel","delIndex","newEntries","splice","ClearIcon","gap","ClickAwayListener","onClickAway","onKeyDown","minWidth","AddIcon","onBlur","includes","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","INFINITY","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboRange","rsComboMarksRange","rsDingbatRange","rsLowerRange","rsUpperRange","rsVarRange","rsBreakRange","rsMathOpRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","freeParseInt","freeGlobal","global","freeSelf","self","root","Function","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","require","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","thisArg","args","arrayAggregator","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","baseTimes","n","baseTrim","slice","trimmedEndIndex","replace","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","test","mapToArray","overArg","transform","replaceHolders","placeholder","setToArray","set","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","match","unicodeToArray","split","asciiToArray","charAt","unescapeHtmlChar","runInContext","context","uid","defaults","pick","Date","Math","String","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","isObjectLike","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","clear","ListCache","MapCache","SetCache","__data__","data","arrayLikeKeys","inherited","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","configurable","enumerable","writable","baseAt","paths","skip","get","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","escape","evaluate","interpolate","variable","imports","pop","hash","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","othProps","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","criteria","comparer","baseSortBy","objCriteria","othCriteria","ordersLength","compareAscending","compareMultiple","basePickBy","baseSet","basePullAll","indexOf","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","trailing","createCompounder","callback","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","WRAP_CURRY_FLAG","isFlip","getHolder","holdersCount","countHolders","newHolders","createRecurry","arrLength","oldArray","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","createOver","arrayFunc","createPadding","chars","charsLength","createRange","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","WRAP_BIND_FLAG","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","lastCalled","stamp","remaining","rand","memoize","memoizeCapped","charCodeAt","quote","subString","clone","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bind","bindKey","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","leadingEdge","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isNumber","isString","lt","lte","toArray","next","done","iteratorToArray","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","toUpperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","method","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","reject","remove","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNative","isNil","isNull","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","settings","isEscaping","isEvaluating","importsKeys","importsValues","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","FormRepeaterGrid","mappedEntries","selected","row","ei","pr","toggleEntry","entryIndex","noWrap","FormRepeater","maxEntries","optionsAsGrid","setEntries","Repeater","readOnlyField","_ref$componentProps","isSwitch","readOnlyHidden","FormReadOnlyField","FormReadOnlyField$1","memo","protocols","obj","stringifyPosition","point","line","column","pos","VFileMessage","reason","place","origin","parts","super","fatal","ruleId","actual","expected","file","url","note","basename","ext","assertPath","seenNonSlash","firstNonSlashEnd","extIndex","dirname","unmatchedSlash","extname","startPart","startDot","preDotState","code","segments","joined","absolute","allowAboveRoot","lastSlashIndex","lastSegmentLength","lastSlash","dots","normalizeString","normalize","sep","JSON","stringify","proc","cwd","isUrl","fileURLOrPath","href","urlToPath","URL","protocol","getPathFromURLPosix","hostname","pathname","third","decodeURIComponent","order","VFile","messages","history","stored","assertNonEmpty","assertPart","stem","encoding","info","fail","part","bail","toStr","gOPD","getOwnPropertyDescriptor","arr","hasOwnConstructor","hasIsPrototypeOf","setProperty","getProperty","src","copyIsArray","deep","trough","fns","pipeline","run","middlewareIndex","output","middleware","called","parameters","fnExpectsCallback","then","use","middelware","unified","base","transformers","attachers","namespace","frozen","freezeIndex","processor","assertUnfrozen","own","Parser","Compiler","freeze","attacher","transformer","POSITIVE_INFINITY","addPlugin","addList","addPreset","plugin","plugins","isPlainObj","parse","doc","vfile","assertParser","newable","assertCompiler","assertNode","compile","executor","tree","runSync","complete","assertDone","processSync","destination","asyncName","looksLikeAVFile","Boolean","one","includeImageAlt","alt","all","list","items","chunkStart","from","combineExtensions","extensions","syntaxExtension","extension","hook","left","right","constructs","existing","asciiAlpha","regexCheck","asciiDigit","asciiHexDigit","asciiAlphanumeric","asciiPunctuation","asciiAtext","asciiControl","markdownLineEndingOrSpace","markdownLineEnding","markdownSpace","unicodeWhitespace","unicodePunctuation","regex","check","fromCharCode","factorySpace","effects","ok","enter","consume","exit","content","tokenize","contentStart","parser","contentInitial","afterContentStartConstruct","paragraphInitial","lineStart","token","contentType","document","continued","childFlow","childToken","lineStartOffset","item","containerState","continuation","documentContinue","checkNewContainers","_closeFlow","closeFlow","indexBeforeExits","events","indexBeforeFlow","exitContainers","documentContinued","currentConstruct","concrete","flowStart","interrupt","_gfmTableDynamicInterruptHack","containerConstruct","thereIsANewContainer","thereIsNoNewContainer","lazy","containerContinue","_tokenizer","flowContinue","writeToChild","eof","stream","sliceStream","defineSkip","write","nok","disable","null","classifyCharacter","resolveAll","attention","attentionMarkers","marker","sequence","open","close","_open","_close","openingSequence","closingSequence","nextEvents","sliceSerialize","movePoint","insideSpan","_bufferIndex","autolink","schemeOrEmailAtext","emailAtext","schemeInsideOrEmailAtext","urlInside","emailAtSignOrDot","emailLabel","emailValue","blankLine","afterWhitespace","blockQuote","state","_container","characterEscape","element","decodeNamedCharacterReference","characterReference","innerHTML","char","textContent","numeric","codeFenced","closingFenceConstruct","closingSequenceStart","sizeOpen","closingSequenceEnd","nonLazyLine","initialPrefix","sequenceOpen","infoOpen","openAfter","infoAfter","meta","contentContinue","codeIndented","afterStartPrefix","afterPrefix","indentedContent","codeText","tailExitIndex","headEnterIndex","subtokenize","jumps","event","lineIndex","otherIndex","otherEvent","subevents","more","_isInFirstContentOfListItem","subcontent","eventIndex","startPosition","startPositions","tokenizer","childEvents","gaps","adjust","breaks","_gfmTasklistFirstContentOfListItem","contentEnd","continuationConstruct","startLookahead","prefixed","factoryDestination","literalType","literalMarkerType","rawType","stringType","balance","destinationEnclosedBefore","destinationRaw","destinationEnclosed","destinationEnclosedEscape","destinationRawEscape","factoryLabel","markerType","atBreak","labelEscape","factoryTitle","atFirstTitleBreak","atTitleBreak","title","titleEscape","factoryWhitespace","normalizeIdentifier","definition","identifier","labelAfter","titleConstruct","defined","hardBreakEscape","headingAtx","fenceOpenInside","headingBreak","htmlBlockNames","htmlRawNames","htmlFlow","kind","startTag","declarationStart","tagCloseStart","continuationDeclarationInside","tagName","commentOpenInside","cdataOpenInside","basicSelfClosing","completeAttributeNameBefore","completeClosingTagAfter","completeEnd","completeAttributeName","completeAttributeNameAfter","completeAttributeValueBefore","completeAttributeValueQuoted","completeAttributeValueUnquoted","completeAttributeValueQuotedAfter","completeAfter","continuationCommentInside","continuationRawTagOpen","continuationClose","continuationCharacterDataInside","continuationAtLineEnding","nextBlankConstruct","htmlContinueStart","htmlLineEnd","continuationRawEndTag","resolveTo","htmlText","returnState","declarationOpen","instruction","tagOpen","commentOpen","cdataOpen","declaration","commentStart","commentStartDash","comment","commentClose","atLineEnding","cdata","cdataClose","cdataEnd","instructionClose","tagClose","tagCloseBetween","tagOpenBetween","tagOpenAttributeName","tagOpenAttributeNameAfter","tagOpenAttributeValueBefore","tagOpenAttributeValueQuoted","tagOpenAttributeValueUnquoted","tagOpenAttributeValueQuotedAfter","labelEnd","labelStart","_balanced","_inactive","balanced","afterLabelEnd","resourceConstruct","fullReferenceConstruct","collapsedReferenceConstruct","media","destinationAfter","between","afterLabel","labelStartImage","labelStartLink","lineEnding","thematicBreak","initialSize","atMarker","inside","onBlank","listItemPrefixWhitespaceConstruct","endOfPrefix","otherPrefix","initialBlankLine","notBlank","furtherBlankLines","notInCurrentItem","indentConstruct","setextUnderline","paragraph","heading","atBlankEnding","flowInitial","afterConstruct","createResolver","initializeFactory","field","initializeText","notText","resolveAllLineSuffixes","extraResolver","chunks","tabs","bufferIndex","_index","createTokenizer","initialize","columnStart","resolveAllConstructs","accountForPotentialSkip","fields","constructFactory","construct","addResult","onsuccessfulcheck","expandTabs","serializeChunks","atTab","startIndex","startBufferIndex","endIndex","endBufferIndex","sliceChunks","chunkIndex","go","restore","onreturn","bogusState","listOfConstructs","constructIndex","handleListOfConstructs","handleMapOfConstructs","def","handleConstruct","startPoint","startPrevious","startCurrentConstruct","startEventsIndex","startStack","resolveText","decodeNumericCharacterReference","characterEscapeOrReference","decodeString","decode","$0","$1","$2","hex","fromMarkdown","compiler","config","configure","canContainEols","opener","link","autolinkProtocol","onenterdata","autolinkEmail","atxHeading","codeFlow","codeFencedFenceInfo","codeFencedFenceMeta","codeTextData","codeFlowValue","definitionDestinationString","definitionLabelString","definitionTitleString","emphasis","hardBreak","hardBreakTrailing","html","htmlFlowData","htmlTextData","image","listItem","listItemValue","onenterlistitemvalue","listOrdered","onenterlistordered","listUnordered","onenterreference","referenceString","resourceDestinationString","resourceTitleString","setextHeading","strong","closer","atxHeadingSequence","onexitatxheadingsequence","onexitautolinkemail","onexitautolinkprotocol","characterEscapeValue","onexitdata","characterReferenceMarkerHexadecimal","onexitcharacterreferencemarker","characterReferenceMarkerNumeric","characterReferenceValue","onexitcharacterreferencevalue","onexitcodefenced","codeFencedFence","onexitcodefencedfence","onexitcodefencedfenceinfo","onexitcodefencedfencemeta","onexitcodeindented","onexitcodetext","onexitdefinitiondestinationstring","onexitdefinitionlabelstring","onexitdefinitiontitlestring","onexithardbreak","onexithtmlflow","onexithtmltext","onexitimage","onexitlabel","labelText","onexitlabeltext","onexitlineending","onexitlink","onexitreferencestring","onexitresourcedestinationstring","onexitresourcetitlestring","resource","onexitresource","onexitsetextheading","setextHeadingLineSequence","onexitsetextheadinglinesequence","setextHeadingText","onexitsetextheadingtext","mdastExtensions","tokenStack","listStack","resume","prepareList","handler","defaultOnError","firstBlankLineIndex","containerBalance","listSpread","tailIndex","tailEvent","_spread","d","and","errorHandler","onExitError","lang","referenceType","ancestor","fragment","ordered","postprocess","defaultConstructs","creator","atCarriageReturn","endPosition","preprocess","combined","remarkParse","u","unknown","h","augment","handlers","passThrough","returnNode","unknownHandler","nodes","typeFactory","castFactory","tests","checks","anyFactory","propsFactory","visitParents","visitor","factory","parents","visit","subresult","grandparents","toResult","pointStart","pointEnd","clean","characterReferences","sanitizeUri","encode","encodeURIComponent","normalizeUri","colon","questionMark","numberSign","slash","loose","footnoteReference","safeId","footnoteOrder","counter","footnoteCounts","reuseCounter","clobberPrefix","dataFootnoteRef","ariaDescribedBy","encodeCache","exclude","keepEscaped","nextCode","defaultChars","ch","getEncodeCache","componentChars","revert","subtype","suffix","contents","listItemLoose","blockquote","break","delete","footnote","footnoteById","no","dangerous","imageReference","inlineCode","linkReference","listLoose","child","table","rows","out","cellIndex","cell","toml","ignore","yaml","footnoteDefinition","allowDangerousHtml","footnoteLabel","footnoteBackLabel","ondefinition","getDefinition","definitions","hName","hProperties","hChildren","toHast","foot","listItems","referenceIndex","backReferences","backReference","dataFootnoteBackref","ariaLabel","tailTail","dataFootnotes","footer","remarkRehype$1","bridge","mutate","Schema","normal","space","Info","attribute","boolean","booleanish","overloadedBoolean","commaSeparated","spaceSeparated","commaOrSpaceSeparated","mustUseProperty","powers","increment","DefinedInfo","mask","mark","attributes","xlink","xLinkActuate","xLinkArcRole","xLinkHref","xLinkRole","xLinkShow","xLinkTitle","xLinkType","xml","xmlLang","xmlBase","xmlSpace","caseSensitiveTransform","caseInsensitiveTransform","xmlns","xmlnsxlink","xmlnsXLink","aria","ariaActiveDescendant","ariaAtomic","ariaAutoComplete","ariaBusy","ariaChecked","ariaColCount","ariaColIndex","ariaColSpan","ariaControls","ariaCurrent","ariaDetails","ariaDisabled","ariaDropEffect","ariaErrorMessage","ariaExpanded","ariaFlowTo","ariaGrabbed","ariaHasPopup","ariaHidden","ariaInvalid","ariaKeyShortcuts","ariaLabelledBy","ariaLevel","ariaLive","ariaModal","ariaMultiLine","ariaMultiSelectable","ariaOrientation","ariaOwns","ariaPlaceholder","ariaPosInSet","ariaPressed","ariaReadOnly","ariaRelevant","ariaRequired","ariaRoleDescription","ariaRowCount","ariaRowIndex","ariaRowSpan","ariaSelected","ariaSetSize","ariaSort","ariaValueMax","ariaValueMin","ariaValueNow","ariaValueText","role","acceptcharset","classname","htmlfor","httpequiv","abbr","accept","acceptCharset","accessKey","allow","allowFullScreen","allowPaymentRequest","allowUserMedia","as","async","autoCapitalize","autoComplete","autoFocus","autoPlay","capture","charSet","cite","cols","colSpan","contentEditable","controls","controlsList","coords","crossOrigin","dateTime","decoding","dirName","download","draggable","encType","enterKeyHint","form","formAction","formEncType","formMethod","formNoValidate","formTarget","headers","hidden","hrefLang","htmlFor","httpEquiv","imageSizes","imageSrcSet","inputMode","integrity","itemId","itemProp","itemRef","itemScope","itemType","language","loop","manifest","multiple","muted","nonce","noModule","noValidate","onAbort","onAfterPrint","onAuxClick","onBeforePrint","onBeforeUnload","onCancel","onCanPlay","onCanPlayThrough","onContextLost","onContextMenu","onContextRestored","onCopy","onCueChange","onCut","onDblClick","onDrag","onDragEnd","onDragEnter","onDragExit","onDragLeave","onDragOver","onDragStart","onDrop","onDurationChange","onEmptied","onEnded","onError","onFocus","onFormData","onHashChange","onInput","onInvalid","onKeyPress","onKeyUp","onLanguageChange","onLoad","onLoadedData","onLoadedMetadata","onLoadEnd","onLoadStart","onMessage","onMessageError","onMouseDown","onMouseEnter","onMouseLeave","onMouseMove","onMouseOut","onMouseOver","onMouseUp","onOffline","onOnline","onPageHide","onPageShow","onPaste","onPause","onPlay","onPlaying","onPopState","onProgress","onRateChange","onRejectionHandled","onReset","onResize","onScroll","onSecurityPolicyViolation","onSeeked","onSeeking","onSelect","onSlotChange","onStalled","onStorage","onSubmit","onSuspend","onTimeUpdate","onToggle","onUnhandledRejection","onUnload","onVolumeChange","onWaiting","onWheel","optimum","ping","playsInline","poster","preload","referrerPolicy","rel","reversed","rowSpan","sandbox","scope","scoped","seamless","sizes","slot","span","spellCheck","srcDoc","srcLang","srcSet","tabIndex","translate","typeMustMatch","useMap","aLink","archive","axis","background","bgColor","borderColor","bottomMargin","cellPadding","cellSpacing","charOff","classId","codeBase","codeType","declare","face","frame","frameBorder","hSpace","leftMargin","longDesc","lowSrc","marginHeight","marginWidth","noResize","noHref","noShade","profile","prompt","rev","rightMargin","rules","scheme","scrolling","standby","summary","topMargin","valueType","version","vAlign","vLink","vSpace","allowTransparency","autoCorrect","autoSave","disablePictureInPicture","disableRemotePlayback","results","security","unselectable","svg","accentHeight","alignmentBaseline","arabicForm","baselineShift","capHeight","clipPath","clipRule","colorInterpolation","colorInterpolationFilters","colorProfile","colorRendering","dataType","dominantBaseline","enableBackground","fillOpacity","fillRule","floodColor","floodOpacity","fontFamily","fontSizeAdjust","fontStretch","fontStyle","fontVariant","glyphName","glyphOrientationHorizontal","glyphOrientationVertical","horizAdvX","horizOriginX","horizOriginY","imageRendering","letterSpacing","lightingColor","markerEnd","markerMid","markerStart","navDown","navDownLeft","navDownRight","navLeft","navNext","navPrev","navRight","navUp","navUpLeft","navUpRight","onActivate","onBegin","onEnd","onFocusIn","onFocusOut","onMouseWheel","onRepeat","onShow","onZoom","overlinePosition","overlineThickness","paintOrder","panose1","pointerEvents","renderingIntent","shapeRendering","stopColor","stopOpacity","strikethroughPosition","strikethroughThickness","strokeDashArray","strokeDashOffset","strokeLineCap","strokeLineJoin","strokeMiterLimit","strokeOpacity","strokeWidth","textAnchor","textDecoration","textRendering","typeOf","underlinePosition","underlineThickness","unicodeBidi","unicodeRange","unitsPerEm","vAlphabetic","vHanging","vIdeographic","vMathematical","vectorEffect","vertAdvY","vertOriginX","vertOriginY","wordSpacing","writingMode","xHeight","playbackOrder","timelineBegin","about","accumulate","additive","alphabetic","amplitude","ascent","attributeName","attributeType","azimuth","bandwidth","baseFrequency","baseProfile","bbox","begin","bias","by","calcMode","clip","clipPathUnits","contentScriptType","contentStyleType","cursor","cy","defaultAction","descent","diffuseConstant","dur","dx","dy","edgeMode","editable","exponent","externalResourcesRequired","filterRes","filterUnits","focusable","focusHighlight","format","fr","fx","fy","g1","g2","glyphRef","gradientTransform","gradientUnits","hanging","hatchContentUnits","hatchUnits","ideographic","initialVisibility","in","in2","intercept","k","k1","k2","k3","k4","kernelMatrix","kernelUnitLength","keyPoints","keySplines","keyTimes","kerning","lengthAdjust","limitingConeAngle","local","markerHeight","markerUnits","markerWidth","maskContentUnits","maskUnits","mathematical","mediaCharacterEncoding","mediaContentEncodings","mediaSize","mediaTime","mode","numOctaves","observer","opacity","orient","orientation","overflow","overlay","pathLength","patternContentUnits","patternTransform","patternUnits","phase","pitch","points","pointsAtX","pointsAtY","pointsAtZ","preserveAlpha","preserveAspectRatio","primitiveUnits","propagate","radius","refX","refY","repeatCount","repeatDur","requiredExtensions","requiredFeatures","requiredFonts","requiredFormats","restart","rotate","rx","ry","scale","seed","side","slope","snapshotTime","specularConstant","specularExponent","spreadMethod","startOffset","stdDeviation","stemh","stemv","stitchTiles","stroke","surfaceScale","syncBehavior","syncBehaviorDefault","syncMaster","syncTolerance","syncToleranceDefault","systemLanguage","tableValues","targetX","targetY","textLength","transformBehavior","to","u1","u2","unicode","viewBox","viewTarget","visibility","widths","x1","x2","xChannelSelector","y","y1","y2","yChannelSelector","z","zoomAndPan","valid","dash","cap","kebab","camelcase","hastToReact","htmlBase","svgBase","rehypeFilter","allowedElements","disallowedElements","allowElement","parent_","unwrapDisallowed","for","c","f","g","m","q","t","v","$$typeof","getModuleId","env","NODE_ENV","REACT_ELEMENT_TYPE","REACT_PORTAL_TYPE","REACT_FRAGMENT_TYPE","REACT_STRICT_MODE_TYPE","REACT_PROFILER_TYPE","REACT_PROVIDER_TYPE","REACT_CONTEXT_TYPE","REACT_SERVER_CONTEXT_TYPE","REACT_FORWARD_REF_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_MEMO_TYPE","REACT_LAZY_TYPE","REACT_OFFSCREEN_TYPE","REACT_MODULE_REFERENCE","$$typeofType","ContextConsumer","ContextProvider","Element","ForwardRef","Lazy","Memo","Portal","Profiler","StrictMode","Suspense","SuspenseList","hasWarnedAboutDeprecatedIsAsyncMode","hasWarnedAboutDeprecatedIsConcurrentMode","isAsyncMode","console","isConcurrentMode","isContextConsumer","isContextProvider","isForwardRef","isFragment","isMemo","isPortal","isProfiler","isStrictMode","isSuspense","isSuspenseList","isValidElementType","COMMENT_REGEX","NEWLINE_REGEX","WHITESPACE_REGEX","PROPERTY_REGEX","COLON_REGEX","VALUE_REGEX","SEMICOLON_REGEX","TRIM_REGEX","EMPTY_STRING","str","declarations","lineno","updatePosition","lines","Position","whitespace","msg","err","filename","silent","re","comments","ret","decls","decl","hasIterator","len","tableElements","childrenToReact","childIndex","toReact","thing","skipHtml","parentSchema","schema","addProperty","listDepth","components","basic","ReactIs","linkTarget","transformLinkUri","inline","level","transformImageUri","getInputElement","getElementsBeforeCount","isHeader","sourcePos","rawSourcePos","sourcePosition","includeElementIndex","siblingCount","Type","dashes","padRight","padLeft","spaces","styleReplacer","parseStyle","deprecated","renderers","astPlugins","escapeHtml","allowNode","allowedTypes","disallowedTypes","includeNodeIndex","ReactMarkdown","deprecation","warn","remarkPlugins","remarkRehype","remarkRehypeOptions","rehypePlugins","hastNode","defaultProps","uri","www","w2","w3","dot","domain","hasUnderscoreInLastSegment","hasUnderscoreInLastLastSegment","namedCharacterReference","punctuationContinuation","punctuation","inPath","continuedPunctuation","parenAtPathEnd","pathEnd","trailingPunctuation","wwwAutolink","previousWww","previousUnbalanced","httpAutolink","previousHttp","t1","t2","s","slash1","slash2","emailAutolink","hasDot","hasDigitInLastSegment","gfmAtext","previousEmail","atext","dotContinuation","dashOrUnderscoreContinuation","afterDashOrUnderscore","gfmAutolinkLiteral","_gfmAutolinkLiteralWalkedInto","indent","tokenizePotentialGfmFootnoteCall","gfmFootnotes","resolveToPotentialGfmFootnoteCall","replacement","tokenizeGfmFootnoteCall","callStart","callData","callEscape","tokenizeDefinitionStart","tokenizeDefinitionContinuation","gfmFootnoteDefinitionEnd","gfmStrikethrough","single","singleTilde","strikethrough","gfmTable","tableHeaderCount","seenDelimiter","hasDash","_align","cellDividerHead","inCellContentHead","cellBreakHead","atRowEndHead","originalInterrupt","tokenizeRowEnd","atDelimiterRowBreak","inWhitespaceHead","inCellContentEscapeHead","rowEndDelimiter","inWhitespaceDelimiter","inFillerDelimiter","afterLeftAlignment","afterRightAlignment","tableClose","nextPrefixedOrBlank","bodyStart","rowStartBody","cellDividerBody","inCellContentBody","cellBreakBody","atRowEndBody","tableBodyClose","inWhitespaceBody","inCellContentEscapeBody","inHead","inDelimiterRow","inRow","cellStart","seenCellInRow","tasklistCheck","spaceThenNonSpace","gfmTaskListItem","ccount","character","findAndReplace","ignored","toExpression","toFunction","pairIndex","grandparent","inConstruct","notInConstruct","gfmAutolinkLiteralFromMarkdown","findUrl","findEmail","literalAutolink","literalAutolinkEmail","enterLiteralAutolinkValue","literalAutolinkHttp","literalAutolinkWww","gfmAutolinkLiteralToMarkdown","unsafe","isCorrectDomain","trailExec","closingParenIndex","openingParens","closingParens","trail","splitUrl","email","association","track","options_","lineShift","move","shift","containerFlow","safeOptions","indexStack","tracker","handle","bulletLastUsed","eol","indentLines","patternCompile","_compiled","patternInScope","listInScope","none","safe","positions","infos","expression","numerical","escapeBackslashes","whole","gfmFootnoteToMarkdown","peek","subexit","blank","gfmStrikethroughFromMarkdown","gfmStrikethroughToMarkdown","handleDelete","containerPhrasing","defaultStringLength","toAlignment","codePointAt","gfmTableFromMarkdown","tableData","enterCell","tableHeader","tableRow","gfmTableToMarkdown","padding","tableCellPadding","alignDelimiters","tablePipeAlign","stringLength","around","handleTable","serializeData","handleTableRowAsData","handleTableAsData","handleTableRow","tableCell","handleTableCell","matrix","markdownTable","alignments","cellMatrix","sizeMatrix","longestCellByColumn","mostCellsPerRow","rowIndex","columnIndex","delimiterStart","delimiterEnd","listItemIndent","checkListItemIndent","bullet","bulletCurrent","checkBullet","incrementListMarker","gfmTaskListItemFromMarkdown","taskListCheckValueChecked","exitCheck","taskListCheckValueUnchecked","siblings","firstParaghraph","sibling","gfmTaskListItemToMarkdown","checkable","checkbox","remarkGfm","gfm","gfmFootnoteDefinition","enterFootnoteDefinition","gfmFootnoteDefinitionLabelString","gfmFootnoteCall","enterFootnoteCall","gfmFootnoteCallString","exitFootnoteDefinition","exitFootnoteDefinitionLabelString","exitFootnoteCall","exitFootnoteCallString","gfmToMarkdown","deepFreezeEs6","deepFreeze","getOwnPropertyNames","isFrozen","deepFreeze$1","Response","isMatchIgnored","ignoreMatch","escapeHTML","inherit$1","original","objects","emitsWrappingTags","HTMLRenderer","parseTree","classPrefix","walk","addText","openNode","sublanguage","pieces","expandScopeName","closeNode","TokenTree","rootNode","top","closeAllNodes","builder","_walk","_collapse","el","TokenTreeEmitter","addKeyword","addSublanguage","emitter","toHTML","renderer","finalize","lookahead","anyNumberOfTimes","optional","either","opts","stripOptionsFromArgs","countMatchGroups","BACKREF_RE","_rewriteBackreferences","regexps","joinWith","numCaptures","IDENT_RE","UNDERSCORE_IDENT_RE","NUMBER_RE","C_NUMBER_RE","BINARY_NUMBER_RE","BACKSLASH_ESCAPE","relevance","APOS_STRING_MODE","illegal","contains","QUOTE_STRING_MODE","COMMENT","modeOptions","excludeBegin","ENGLISH_WORD","C_LINE_COMMENT_MODE","C_BLOCK_COMMENT_MODE","HASH_COMMENT_MODE","NUMBER_MODE","C_NUMBER_MODE","BINARY_NUMBER_MODE","REGEXP_MODE","TITLE_MODE","UNDERSCORE_TITLE_MODE","METHOD_GUARD","MODES","__proto__","MATCH_NOTHING_RE","RE_STARTERS_RE","SHEBANG","beginShebang","binary","resp","PHRASAL_WORDS_MODE","END_SAME_AS_BEGIN","_beginMatch","skipIfHasPrecedingDot","response","scopeClassName","_parent","beginKeywords","__beforeBegin","keywords","compileIllegal","compileMatch","compileRelevance","beforeMatchExt","beforeMatch","starts","originalMode","endsParent","COMMON_KEYWORDS","DEFAULT_KEYWORD_SCOPE","compileKeywords","rawKeywords","caseInsensitive","scopeName","compiledKeywords","compileList","keywordList","keyword","scoreForKeyword","providedScore","commonKeyword","seenDeprecations","log","MultiClassError","remapScopeNames","regexes","scopeNames","emit","_emit","_multi","MultiClass","beginScope","scopeSugar","_wrap","endScope","returnBegin","beginMultiClass","excludeEnd","returnEnd","endMultiClass","compileLanguage","langRe","case_insensitive","unicodeRegex","MultiRegex","matchIndexes","matchAt","addRule","terminators","matcherRe","ResumableMultiRegex","multiRegexes","regexIndex","getMatcher","matcher","resumingScanAtSamePosition","considerAll","m2","compilerExtensions","classNameAliases","compileMode","cmode","isCompiled","keywordPattern","$pattern","keywordPatternRe","beginRe","endsWithParent","endRe","terminatorEnd","illegalRe","expandOrCloneMode","variants","cachedVariants","dependencyOnParent","buildModeRegex","mm","term","rule","HTMLInjectionError","inherit","NO_MATCH","highlight","hljs","languages","aliases","SAFE_MODE","LANGUAGE_NOT_FOUND","PLAINTEXT_LANGUAGE","disableAutodetect","ignoreUnescapedHTML","throwUnescapedHTML","noHighlightRe","languageDetectRe","cssSelector","__emitter","shouldNotHighlight","languageName","codeOrLanguageName","optionsOrCode","ignoreIllegals","fire","_highlight","codeToHighlight","keywordHits","processKeywords","modeBuffer","buf","matchText","keywordRelevance","cssClass","substr","processBuffer","subLanguage","continuations","_top","highlightAuto","_emitter","processSubLanguage","emitMultiClass","klass","startNewMode","endOfMode","matchPlusRemainder","matched","lexeme","doIgnore","resumeScanAtSamePosition","doEndMatch","endMode","lastMatch","processLexeme","textBeforeMatch","badRule","doBeginMatch","newMode","beforeCallbacks","cb","processed","iterations","getLanguage","md","processContinuations","processedCount","_illegalBy","resultSoFar","errorRaised","languageSubset","plaintext","justTextHighlightResult","autoDetection","sorted","supersetOf","best","secondBest","highlightElement","blockLanguage","block","parentNode","_class","currentLang","resultLang","classList","updateClassName","wantsHighlight","highlightAll","readyState","querySelectorAll","registerAliases","aliasList","alias","addEventListener","highlightBlock","deprecateHighlightBlock","userOptions","initHighlighting","initHighlightingOnLoad","registerLanguage","languageDefinition","error$1","rawDefinition","unregisterLanguage","listLanguages","upgradePluginAPI","debugMode","safeMode","versionString","HLJS","core","HighlightJS","fmt","argIndex","tmp","escaped","leadingZero","nextArg","slurpNumber","digits","toFixed","vsprintf","replacements","printf","fault","eval","EvalError","RangeError","ReferenceError","syntax","SyntaxError","URIError","Constructor","FormattedError","displayName","defaultPrefix","HastEmitter","lowlight","subset","registered","aliasOrLanguage","registerAlias","convertElement","tagNameFactory","findAfter","searchLineFeeds","searchTabOrSpaces","br","notRendered","blockOrCaption","toText","inferWhitespace","breakBefore","breakAfter","collectText","innerTextCollection","collectElement","collectPreText","trimAndCollapseSpacesAndTabs","rehypeHighlight","plainText","ignoreMissing","givenParent","FormReadOnlyMarkdown","FormReadOnlyNumber","FormReadOnlySelect","_options$find","FormReadOnlyBoolean","formRepeater","FormReadOnlyRepeater","List","dense","ListItem","ListItemText","primary","HiddenData","subject","Alert","severity","ReservationExpiredSnackbar","reservationStore","notification","setNotification","expiredNotification","setState","Snackbar","autoHideDuration","anchorOrigin","vertical","horizontal","defaultSlots","readOnlyDefault","readOnlyString","readOnlyText","readOnlyMarkdown","readOnlyNumber","readOnlySelect","readOnlyBoolean","readOnlyArray","apDefault","Input","apString","apNumber","apSelect","apBoolean","sectionCard","sectionBlock","hiddenData","reservationExpiredNotification","GroupDisabledContext","abortableOAuthFetch","_asyncToGenerator","_regeneratorRuntime","signal","_ref2$method","body","_args","_context","prev","Authorization","sent","t0","abrupt","stop","_callee","_x","useReservation","reservationId","fieldNames","setLoading","controllerRef","intervalRef","configRef","stopCountdown","clearInterval","buildClearValues","release","_options$skipServerCa","skipServerCall","reservation","_state$reservations","reservations","_toPropertyKey","releaseUrl","startCountdown","setInterval","status","nextRemaining","currentState","expired","generate","_callee2","_result$links","_configRef$current","configUrl","configToken","_context2","AbortController","voucher","links","validFor","FormAutoGenerate","fieldName","buttonLabel","_config$buttonLabel","releaseLabel","activeLabel","_config$activeLabel","inactiveLabel","_config$inactiveLabel","allowManualOverride","_config$allowManualOv","resolvedReleaseLabel","_useReservation","isActive","prevValueRef","childProps","Children","isValidElement","warning","seconds","formatRemaining","startIcon","GenerateIcon","ReleaseIcon","resolveErrors","fieldResult","errorMessages","eVal","validator","restError","finalMessage","human","AdornmentField","_translations$labels","adornmentEntry","mainFieldName","inputVariant","_useInternalFormConte","translations","resolvedSlots","handleFieldChange","propDisabled","apName","preSubmit","preSubmitValidation","_s$results","schemaField","apType","apComponent","labels","FieldRenderer","_ref5","_fieldEntry$","_fieldEntry$2","_translations$labels2","fieldEntry","allFields","slotProps","fieldSlots","fieldSlotProps","renderComponentMap","handleFocus","handleBlur","obscuredFields","resolveFieldName","isMarkdown","isApField","appends","prepends","groupDisabled","fieldState","_s$fieldStates","fieldStates","MarkdownComponent","specialProps","resolveSpecialProps","hideLabel","autoGenerate","_excluded2","prohibited","fieldData","HiddenDataComponent","componentDefaultProps","schemaType","resolved","slotKey","resolveComponent","_ref3","_translations$fieldNa","acc","_translations$fieldNa2","buildOptions","resolvedTypeKey","typeSlotProps","namedSlotProps","finalComponentProps","resolvedErrors","ReadOnlyFieldWrapper","readOnlySchemaTypeKey","readOnlyTypeKey","readOnlyComponent","adornments","_ref4","apField","isAppend","isPrepend","buildAdornmentElements","FormFieldWrapper","fieldElement","FieldRenderer$1","FormGroupAutoGenerate","groupId","generatedFieldsRef","selectGroupValues","currentValues","generated","Provider","getFieldKey","extractFieldNames","names","FormulatorFormSection","sectionId","_ref$nested","SectionWrapper","fieldElements","_typeof","description","allowRegenerate","FormulatorFormSection$1","asyncValidatorEnvelope","_x2","preserveResultRefs","prevResults","nextResults","merged","computeIsDirty","getInitialData","iniData","transientData","iniFieldStates","_validateSync","validateSync","sanitizedData","active","touched","inactive","pristine","finalData","isDirty","asyncErrors","FormErrorList","_React$useState2","_React$useState","FormulatorForm","_props$variant","groupLabelVariant","groupDescVariant","submitOnEnter","listErrors","renderSchema","initialFieldStates","slots","obscuredGroups","_props$errorMessages","asyncValidators","onStatusUpdate","onStateChange","onUnmount","storeRef","reservationStoreRef","initialDataRef","callbacksRef","useLayoutEffect","propDisabledRef","fireCallbacks","wasPreSubmit","cbState","cbStatus","cbSubmit","storeState","asyncControllerRef","validationFrameRef","executeValidation","_ref6","newFieldStates","newAsyncErrors","syncResult","_wasPreSubmit","activeValidators","_wasPreSubmit2","validatingFieldStates","asyncResults","mergedResults","mergedErrors","mergedResult","_ref7","_syncResult$results$p","_ref8","_ref9","aborted","_x3","_x4","_x5","runValidation","cancelAnimationFrame","requestAnimationFrame","runValidationImmediate","oldData","_ref10","handleFieldValues","fieldValues","_ref11","_ref12","_ref13","reportStatus","reinitialize","forceFieldChanges","changedEntries","_ref14","_ref15","handleSubmit","currentData","storeData","cbUnmount","prevDataRef","prevTransientRef","_ref16","_ref17","_ref18","_ref19","contextValue","ReservationSnackbar","preventDefault","groups","_ref20","FormOptionsLoader","optionsArg","baererToken","formElement","useFetchOptions","fetchOptions","setOptions","fetcher","elementType","userSelect","sharpEdges","spanSolitaryToCard","spanBannerToCard","marginRight","marginLeft","marginTop","paddingTop","paddingRight","paddingBottom","paddingLeft","backgroundColor","alpha","unchecked","FormPrimaryToggle","_cx","solitary","checkedLabel","uncheckedLabel","useTheme","clickable","CheckIcon","htmlColor","CloseIcon"],"mappings":"y9CAMAA,IAAAA,GAAiB,SAASC,EAAMC,EAAGC,GACjC,GAAID,IAAMC,EAAG,OAAO,EAEpB,GAAID,GAAKC,GAAiB,iBAALD,GAA6B,iBAALC,EAAe,CACtDD,GAAAA,EAAEE,cAAgBD,EAAEC,YAAa,OAAO,EAE5C,IAAIC,EAAQC,EAAGC,EACf,GAAIC,MAAMC,QAAQP,GAAI,CAEpB,IADAG,EAASH,EAAEG,SACGF,EAAEE,OAAQ,OAAO,EAC1BC,IAAAA,EAAID,EAAgB,GAARC,KACf,IAAKL,EAAMC,EAAEI,GAAIH,EAAEG,IAAK,OAAO,EACjC,OAAO,CACR,CAIGJ,GAAAA,EAAEE,cAAgBM,OAAQ,OAAOR,EAAES,SAAWR,EAAEQ,QAAUT,EAAEU,QAAUT,EAAES,MAC5E,GAAIV,EAAEW,UAAYC,OAAOC,UAAUF,QAAS,OAAOX,EAAEW,YAAcV,EAAEU,UACrE,GAAIX,EAAEc,WAAaF,OAAOC,UAAUC,SAAU,OAAOd,EAAEc,aAAeb,EAAEa,WAIpEX,IADJA,GADAE,EAAOO,OAAOP,KAAKL,IACLG,UACCS,OAAOP,KAAKJ,GAAGE,OAAQ,OAAO,EAExCC,IAAAA,EAAID,EAAgB,GAARC,KACf,IAAKQ,OAAOC,UAAUE,eAAeC,KAAKf,EAAGI,EAAKD,IAAK,OAAO,EAEhE,IAAKA,EAAID,EAAgB,GAARC,KAAY,CAC3B,IAAIa,EAAMZ,EAAKD,GAEf,IAAKL,EAAMC,EAAEiB,GAAMhB,EAAEgB,IAAO,OAAO,CACpC,CAED,OAAO,CAlC2B,CAsCpC,OAAOjB,GAAIA,GAAKC,GAAIA,CACrB,ECxCKiB,IAAqB,GAAGhB,YAGxBiB,GAAWD,GAAkBC,SAGjBD,GAAkBE,UAGpC,IAAMb,GAAW,GAAGL,YAAiCK,QAIrCc,SAAAA,GAAMC,GACpB,OAAa,OAANA,GAA2B,iBAANA,CAC7B,CASeC,SAAAA,GAAMD,EAAYE,GACzB,YADyB,IAAAA,IAAAA,EAAAA,GACZ,iBAANF,GAAkBA,EAAEnB,QAAUqB,CAC7C,CAGeC,SAAAA,GAAMH,GACbH,OAAAA,GAASG,EACjB,CAQeI,SAAAA,GAAMJ,GACbf,OAAAA,GAAQe,EAChB,CAGeK,SAAAA,GACdL,EACAM,GAEA,OAAOP,GAAMC,IAAMM,KAAYN,CACjC,2zGA7BsB,yoDCbtB,IAAMO,GAAmB,SAACC,EAAOC,GAAiC,IAAvBC,EAAuBC,UAAA9B,OAAA,QAAA+B,IAAAD,UAAA,GAAAA,UAAA,GAAdrB,OAAOuB,GACzDC,EAA0BC,GAAS,WAAA,OAAMN,EAASD,EAAMQ,WAArB,IAAnCC,EAAAC,EAAAJ,EAAA,GAAOK,EAAPF,EAAA,GAAcG,OAGRC,EAAcC,EAAOb,GAmB3B,OAlBAY,EAAYE,QAAUd,EAEtBe,GAAU,WAGJC,IAAAA,EAAeJ,EAAYE,QAAQf,EAAMQ,YAU7C,OARoBR,EAAMkB,WAAU,WAC5BC,IAAAA,EAAWN,EAAYE,QAAQf,EAAMQ,YACtCN,EAAOe,EAAcE,KACxBF,EAAeE,EACfP,EAASO,GAEZ,GAGF,GAAE,CAACnB,EAAOE,IAEJS,CACR,EC9BKS,GAAcC,EAAc,MASrBC,GAAyB,WAAMC,OAAAA,EAAWH,GAAjB,EAUzBI,GAAiB,WAC5B,IAAMC,EAAMF,EAAWH,IACnB,IAACK,EAAK,MAAM,IAAIC,MAAM,uDAG1B,OAAOC,GAAQ,WAAO,MAAA,CACpBnB,SAAU,WAAA,OAAMiB,EAAIzB,MAAMQ,UADN,EAEpBU,UAAW,SAAAU,GAAQ,OAAIH,EAAIzB,MAAMkB,UAAUU,EAFvB,EAGpBC,WAAYJ,EAAIK,IAAID,WACpBE,UAAWN,EAAIK,IAAIC,UACnBC,cAAeP,EAAIK,IAAIE,cACvBC,eAAgBR,EAAIK,IAAIG,eANZ,GAQV,CAACR,EAAIK,IAAKL,EAAIzB,OACnB,EAgBYkC,GAAkB,SAACjC,GAAiC,IAAvBC,EAAuBC,UAAA9B,OAAA,QAAA+B,IAAAD,UAAA,GAAAA,UAAA,GAAdrB,OAAOuB,GAClDoB,EAAMF,EAAWH,IACnB,IAACK,EAAK,MAAM,IAAIC,MAAM,wDACnB3B,OAAAA,GAAiB0B,EAAIzB,MAAOC,EAAUC,EAC9C,ECvDKiC,GAAqBd,OAAcjB,GAQ5BgC,GAAsB,WAAMb,OAAAA,EAAWY,GAAjB,ykBCP7BE,cACJ,SAAAA,EAAYC,GAAcC,EAAAC,KAAAH,GACnBI,KAAAA,OAASH,EACdE,KAAKE,WAAa,IAAIC,IACjBC,KAAAA,YAAc,CACpB,mCAED,WACE,OAAOJ,KAAKC,MACb,mBAED9B,MAAA,SAASkC,GACPL,KAAKC,OAA4B,mBAAZI,EACjBA,EAAQL,KAAKC,QADHK,GAAAA,GAAA,CAAA,EAELN,KAAKC,QAAWI,GACA,IAArBL,KAAKI,aAAmBJ,KAAKO,SAClC,gBAGDpC,MAAA,SAAMqC,GACJR,KAAKI,cACD,IACFI,GACD,CAAS,QACRR,KAAKI,cACoB,IAArBJ,KAAKI,aAAmBJ,KAAKO,SAClC,CACF,wBAED,WACEP,KAAKE,WAAWO,SAAQ,SAAAC,GAAC,OAAIA,GAAJ,GAC1B,oBAEDvC,MAAA,SAAUiB,GAAU,IAAAuB,EAAAX,KAEX,OADPA,KAAKE,WAAWU,IAAIxB,GACb,WAAA,OAAMuB,EAAKT,WAAL,OAAuBd,EAA7B,CACR,UClCGyB,GAAkB,SAMlBC,GALJC,IAAAA,IAAAA,MAKIC,EAAAF,EAJJG,aAAAA,aAAe,KAIXD,EAHJE,IAAAA,KAGIC,EAAAL,EAFJM,YAAAA,aAAc,QAEVD,EAAAE,EAAAP,EADJQ,UAAAA,aAAY,OACRD,EACJ,SAAKN,IAAUG,IAGbK,gBAACC,EAAD,CACEC,MAAO,CACLC,MAAO,OACPC,QAAS,OACTC,cAAe,WAIfb,GAEIQ,EAAAM,cAACL,EAAD,CAAKM,GAAI,GACPP,gBAACQ,EAAD,CACEC,QAASf,EACTgB,MAAOX,GAENP,IAMTG,GAEIK,gBAACC,EAAD,CAAKM,GAAI,GACPP,gBAACQ,EAAD,CACEC,QAASZ,EACTa,MAAOX,GAENJ,IAOhB,EAEDL,GAAgBqB,UAAY,CAC1BnB,MAAOoB,EAAUC,OACjBnB,aAAckB,EAAUE,MAAM,CAC5B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFnB,KAAMiB,EAAUC,OAChBhB,YAAae,EAAUE,MAAM,CAC3B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFf,UAAWa,EAAUE,MAAM,CAAC,OAAQ,SAAU,WC9EhD,IAAMC,GAAkB,SAAAxB,GAAGC,IAAAA,IAAAA,MAAOE,IAAAA,aAAcC,IAAAA,KAAME,IAAAA,YAAaE,IAAAA,UAAWiB,IAAAA,SAAtD,OACtBhB,gBAACC,EAAD,CAAKM,GAAI,GACPP,gBAACiB,EAAD,CAAOC,UAAW,GAChBlB,gBAACC,EAAD,CAAKkB,EAAG,GACNnB,gBAACV,GAAD,CACEE,MAAOA,EACPE,aAAcA,EACdC,KAAMA,EACNE,YAAaA,EACbE,UAAWA,IAEZiB,IAXe,EAiBxBD,GAAgBJ,UAAY,CAC1BnB,MAAOoB,EAAUC,OACjBnB,aAAckB,EAAUE,MAAM,CAC5B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFnB,KAAMiB,EAAUC,OAChBhB,YAAae,EAAUE,MAAM,CAC3B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFf,UAAWa,EAAUE,MAAM,CAAC,OAAQ,SAAU,UAC9CE,SAAUJ,EAAUQ,MCpDtB,IAAMC,GAAYC,GAAW,SAAAC,GAAU,MAAA,CACrCC,iBAAkB,CACM,qBAAA,CACpBC,aAAcF,EAAMG,QAAQ,KAHA,IAQ5BC,GAAmB,SAAqEpC,GAAlEC,IAAAA,IAAAA,MAAOE,IAAAA,aAAcC,IAAAA,KAAME,IAAAA,YAAaE,IAAAA,UAAWiB,IAAAA,SACvEY,EAASP,KAEf,OACErB,gBAACC,EAAD,CAAK4B,UAAWD,EAAOJ,kBACrBxB,gBAACV,GAAD,CACEE,MAAOA,EACPE,aAAcA,EACdC,KAAMA,EACNE,YAAaA,EACbE,UAAWA,IAEZiB,EAGN,EAEDW,GAAiBhB,UAAY,CAC3BnB,MAAOoB,EAAUC,OACjBnB,aAAckB,EAAUE,MAAM,CAC5B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFnB,KAAMiB,EAAUC,OAChBhB,YAAae,EAAUE,MAAM,CAC3B,KACA,KACA,KACA,KACA,KACA,KACA,YACA,YACA,QACA,QACA,SACA,UACA,aAEFf,UAAWa,EAAUE,MAAM,CAAC,OAAQ,SAAU,UAC9CE,SAAUJ,EAAUQ;;;;;2BC5DrB,WAGIU,IAAAA,EAAS,CAAA,EAAG5G,eAEhB,SAAS6G,IAGR,IAFIC,IAAAA,EAAU,GAELzH,EAAI,EAAGA,EAAI6B,UAAU9B,OAAQC,IAAK,CAC1C,IAAI0H,EAAM7F,UAAU7B,GAChB,GAAC0H,EAAD,CAEAC,IAAAA,SAAiBD,EAErB,GAAgB,WAAZC,GAAoC,WAAZA,EAC3BF,EAAQG,KAAKF,QACP,GAAIxH,MAAMC,QAAQuH,IACpBA,GAAAA,EAAI3H,OAAQ,CACX8H,IAAAA,EAAQL,EAAWM,MAAM,KAAMJ,GAC/BG,GACHJ,EAAQG,KAAKC,EAEd,OACK,GAAgB,WAAZF,EACND,GAAAA,EAAIhH,WAAaF,OAAOC,UAAUC,SACrC,IAAK,IAAIG,KAAO6G,EACXH,EAAO3G,KAAK8G,EAAK7G,IAAQ6G,EAAI7G,IAChC4G,EAAQG,KAAK/G,QAIf4G,EAAQG,KAAKF,EAAIhH,WArBT,CAwBV,CAED,OAAO+G,EAAQM,KAAK,IACpB,CAEoCrI,EAAOsI,SAC3CR,EAAWS,QAAUT,EACrB9H,EAAAA,QAAiB8H,GAOjBU,OAAOV,WAAaA,CAhDrB,CAAA,knBCSD,IAAMV,GAAYC,GAAW,SAAAC,GAAU,MAAA,CAAEmB,MAAO,CAAEC,MAAOpB,EAAMqB,QAAQF,MAAMG,MAA3C,IAE5BC,GAAmB,SAkBnBvD,GAjBJkB,IA2CIsC,EA3CJtC,IAAAA,QACAuC,IAAAA,YACAC,IAAAA,KACAC,IAAAA,KACA1D,IAAAA,MACA2D,IAAAA,UACAC,IAAAA,eACAC,IAAAA,aACAzG,IAAAA,MACA0G,IAAAA,QACAC,IAAAA,UACAC,IAAAA,OACAC,IAAAA,SACAC,IAAAA,SACAC,IAAAA,WACAC,IAAAA,MACAC,IAAAA,SAEMjC,EAASP,KAETyC,EAAU/E,GAAAA,GAAA,CACdiE,YAAAA,EACAE,KAAAA,EACA1D,MAAAA,EACA6D,aAAAA,EACAzG,MAAAA,EACA0G,QAAAA,EACAG,SAAAA,EACAC,SAAAA,GACGN,GATW,GAAA,CAUdS,SAAAA,IAGIE,EAAoB,aAATd,EAWjB,GATIU,IACFG,EAAWE,aAAe,CACxBhE,gBAACiE,EAAD,CAAgBC,SAAS,OACvBlE,EAACM,cAAA6D,EADH,SAOAJ,EACE,IACF,IAAMK,EAAWjB,EAAUkB,OAAS,GACpCtB,EAAU/C,EAAMsE,aACdnB,EADQpE,GAAAA,GAAAA,GAAA,CAGN0B,QAAAA,GACGqD,GACAM,GALG,GAAA,CAMN5E,MAAAA,EACA+D,UAAAA,EACAC,OAAAA,EACAI,MAAAA,IAXN,CAcE,MAAOW,GACD,MAAA,IAAI5G,MAA2CuF,qCAAAA,OAAAA,gBAAUqB,EAAEC,SAClE,MAEG,IACFzB,EAAU/C,EAAMM,cACd6C,EADQpE,GAAA,CAGN0B,QAAAA,GACGqD,GALT,CAQE,MAAOS,GACD,MAAA,IAAI5G,MAA2CuF,qCAAAA,OAAAA,gBAAUqB,EAAEC,SAClE,CAGH,IAAMC,EAAqB,YAATxB,EACZyB,EAAmBD,GAAoC,YAAvBX,EAAWrD,QAC3CkE,EAAsB,UAAT1B,EAEf0B,OAAAA,GAAcZ,EACThB,EAIP/C,gBAAC4E,EAAD,CACE/C,UAAU,kBACVa,MAAOkB,GAASL,EAChB9C,QAASA,EACToE,OAAO,QACPC,WALF,EAMErB,SAAUA,GAGPgB,IAAcC,GAEX1E,gBAAC+E,EAAD,CACElD,UAAWmD,GAAMpD,EAAAA,CAAAA,EAAAA,EAAOc,MAAQkB,GAASL,IACzCR,QAASA,EACTvD,MAAOA,EACPyF,eAAgBnB,EAAWmB,gBAAkB,UAM/CR,IAAcE,IAAeZ,GAC1BW,IAEF3B,EAGJa,IAAUF,GAAYH,GAEnBvD,EAAAM,cAAC4E,EAAD,KACG1B,EAAO2B,KAAI,SAAAZ,GAAKA,OAAAA,EAAEC,OAAlB,IAA2BlC,KAAK,OAM9C,EAEDQ,GAAiBnC,UAAY,CAC3BF,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChDkC,YAAapC,EAAUE,MAAM,CAAC,QAAS,SACvCqC,UAAWvC,EAAUwE,IAAIC,WACzBjC,eAAgBxC,EAAU0E,OAC1BrC,KAAMrC,EAAUC,OAAOwE,WACvBnC,KAAMtC,EAAUC,OAAOwE,WACvB7F,MAAOoB,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU4E,OAEZnC,aAAczC,EAAU2E,UAAU,CAChC3E,EAAUC,OACVD,EAAU6E,OACV7E,EAAU4E,KACV5E,EAAU8E,MACV9E,EAAU0E,SAEZ1I,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU6E,OACV7E,EAAU4E,KACV5E,EAAU8E,MACV9E,EAAU0E,SAEZhC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OAEnB7B,UAAW3C,EAAU4E,KACrBhC,OAAQ5C,EAAU8E,MAClB/B,WAAY/C,EAAU4E,KACtB5B,MAAOhD,EAAU4E,KACjB/B,SAAU7C,EAAU4E,KACpB9B,SAAU9C,EAAU4E,KACpB3B,SAAUjD,EAAUiF,KAAKR,YAG3B,IAAMS,GAAY,SAKZC,GAJJC,IAAAA,IAAAA,QACAC,IAAAA,OACA7C,IAAAA,eACG8C,EACCC,EAAAJ,EAAAK,IACEtC,EAAU/E,GAAA,CACdqE,eAAAA,GACG8C,GAGL,MAA6B,YAAzB9C,aAAAA,EAAAA,EAAgBH,MACXjD,EAAAM,cAAA,QAAA,CAAO2C,KAAK,SAASC,KAAMgD,EAAWhD,KAAMtG,MAAOsJ,EAAWtJ,QAIrEoD,EAACM,cAAA+F,EACEL,KAAAA,EAEDhG,EAAAM,cAACwC,GAAqBgB,GACrBmC,EAGN,EAEDH,GAAUnF,UAAY,CACpBF,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChDqC,UAAWvC,EAAUwE,IAAIC,WACzBjC,eAAgBxC,EAAU0E,OAC1BrC,KAAMrC,EAAUC,OAAOwE,WACvBnC,KAAMtC,EAAUC,OAAOwE,WACvB7F,MAAOoB,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU4E,OAEZ5I,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU6E,OACV7E,EAAU4E,KACV5E,EAAU8E,MACV9E,EAAU0E,SAEZhC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OAEnBY,QAASpF,EAAU8E,MACnBO,OAAQrF,EAAU8E,MAClBnC,UAAW3C,EAAU4E,KACrBhC,OAAQ5C,EAAU8E,MAClB/B,WAAY/C,EAAU4E,KACtB/B,SAAU7C,EAAU4E,KACpB5B,MAAOhD,EAAU4E,KACjB3B,SAAUjD,EAAUiF,KAAKR,YC/N3B,IAAMiB,GAAgB,SAWhB/G,GAVJ0D,IAAAA,IAAAA,KACAC,IAAAA,KACA1D,IAAAA,MACAiB,IAAAA,QACA7D,IAAAA,MACAyG,IAAAA,aACAI,IAAAA,SACA8C,IAAAA,QACA7C,IAAAA,SACAG,IAAAA,SAEM2C,EAAgB,SAAApJ,GAChByG,GACFA,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAOQ,IAErC,EAcD,OACE4C,EAACM,cAAAoG,EACC,KAAA1G,EAAAM,cAACE,EAAD,CAAYD,GAAI,GACbf,GAEHQ,EAAAM,cAACoG,EAAD,CACEC,UAAU,MACVC,GAAI,CACFC,KAAM,WACN1G,MAAO,SAGTH,gBAAC8G,EAAD,CACEF,GAAI,CAAEC,KAAM,YACZ5D,KAAMA,EACNC,KAASA,GAAAA,OAAAA,EAHX,UAIE1D,MAAM,MACNiB,QAASA,EACTsG,gBAAiB,CAAEC,QAAQ,GAC3BpK,OAAOA,aAAAA,EAAAA,EAAOqK,SAAS5D,eAAAA,EAAc4D,QAAS,GAC9CC,KAAKtK,aAAAA,EAAAA,EAAOuK,OAAO9D,eAAAA,EAAc8D,MAAO,GACxC1D,SAAUA,EACVC,SAAUA,GAAY6C,EACtB1C,SAnCkB,SAAAU,GACxB,IAAMnH,EAAWgK,gBAAgBxK,GAAS,CAAV,GAChCQ,EAAS6J,MAAQ1C,EAAEkC,OAAO7J,MAC1B4J,EAAcpJ,EACf,IAiCK4C,gBAACC,EAAD,CACE2G,GAAI,CACFxG,QAAS,OACTiH,eAAgB,SAChBC,WAAY,SACZC,GAAI,EACJC,GAAI,IAGNxH,gBAACQ,EAAD,CAAYmC,MAAM,YATpB,MAaA3C,EAAAM,cAACwG,EAAD,CACEF,GAAI,CAAEC,KAAM,YACZ5D,KAAMA,EACNC,KAASA,GAAAA,OAAAA,EAHX,QAIE1D,MAAM,MACNiB,QAASA,EACTsG,gBAAiB,CAAEC,QAAQ,GAC3BpK,OAAOA,aAAAA,EAAAA,EAAOuK,OAAO9D,eAAAA,EAAc8D,MAAO,GAC1CM,KAAK7K,aAAAA,EAAAA,EAAOqK,SAAS5D,eAAAA,EAAc4D,QAAS,GAC5CxD,SAAUA,EACVC,SAAUA,GAAY6C,EACtB1C,SAvDgB,SAAAU,GACtB,IAAMnH,EAAWgK,gBAAgBxK,GAAS,CAAV,GAChCQ,EAAS+J,IAAM5C,EAAEkC,OAAO7J,MACxB4J,EAAcpJ,EACf,KAwDF,EAEDkJ,GAAc3F,UAAY,CACxBsC,KAAMrC,EAAUC,OAChBqC,KAAMtC,EAAUC,OAChBrB,MAAOoB,EAAUC,OACjBJ,QAASG,EAAUC,OACnBjE,MAAOgE,EAAU0E,OACjBjC,aAAczC,EAAUC,OACxB4C,SAAU7C,EAAU4E,KACpBe,QAAS3F,EAAU4E,KACnB9B,SAAU9C,EAAU4E,KACpB3B,SAAUjD,EAAUiF,MCnGtB,IAAM6B,GAAW,SAcXnI,GAbJ0D,IAAAA,IAAAA,KACAC,IAAAA,KACA1D,IAAAA,MACAiB,IAAAA,QACA7D,IAAAA,MACAyG,IAAAA,aACAsE,IAAAA,UACAC,IAAAA,QACAC,IAAAA,MACApE,IAAAA,SACA8C,IAAAA,QACA7C,IAAAA,SACAG,IAAAA,SAEMiE,EAAa,CAAA,EAMnB,MAJa,SAAT7E,GAA4B,mBAATA,IACrB6E,EAAWf,gBAAkB,CAAEC,QAAQ,IAGrCa,EAEA7H,gBAACsG,GAAD,CACErD,KAAMA,EACNC,KAAMA,EACN1D,MAAOA,EACPiB,QAASA,EACT7D,MAAOA,GAASyG,GAAgB,GAChCI,SAAUA,EACVC,SAAUA,GAAY6C,EACtB1C,SAAUA,GAAa,WAAQ,IAMnC7D,gBAAC8G,EAADiB,EAAA,CACE9E,KAAMA,EACNC,KAAMA,EACN1D,MAAOA,EACPiB,QAASA,EACT7D,MAAOA,GAASyG,GAAgB,GAChCsE,UAAWA,EACXC,QAASA,EACTC,MAAOA,EACPpE,SAAUA,EACVC,SAAUA,GAAY6C,EACtB1C,SAAUA,GAAa,WAXzB,GAaMiE,GAGT,EAEDJ,GAAS/G,UAAY,CACnBsC,KAAMrC,EAAUC,OAChBqC,KAAMtC,EAAUC,OAChBrB,MAAOoB,EAAUC,OACjBJ,QAASG,EAAUC,OACnBjE,MAAOgE,EAAUC,OACjBwC,aAAczC,EAAUC,OACxB8G,UAAW/G,EAAU4E,KACrBoC,QAAShH,EAAU6E,OACnBoC,MAAOjH,EAAU4E,KACjB/B,SAAU7C,EAAU4E,KACpBe,QAAS3F,EAAU4E,KACnB9B,SAAU9C,EAAU4E,KACpB3B,SAAUjD,EAAUiF,MC1Ef,IAAMmC,GAAe,SAACpL,EAAOqL,GAClC,YACY5L,IAAVO,GACGsL,OAAOC,MAAMvL,IACH,KAAVA,EAEI,GAGLqL,IAASC,OAAOE,cAAcH,GAAcI,WAAWzL,EAAO,IAE3D0L,SAAS1L,EAAO,GACxB,oDCNK2L,GAAa,SAAAhJ,GAAG2D,IAAAA,IAAAA,KAAMtG,IAAAA,MAAO6K,IAAAA,IAAKP,IAAAA,IAAKe,IAAAA,KAAMpE,IAAAA,SAAaQ,EAA7C8B,EAAA5G,EAAA6G,IAAA,OACjBpG,gBAAC8G,EAADiB,EAAA,CACE7E,KAAMA,EACND,KAAK,SACLrG,MAAOoL,GAAapL,EAAOqL,GAC3BO,WAAY,CAAEf,IAAAA,EAAKP,IAAAA,EAAKe,KAAAA,GACxBpE,SAAU,SAAAU,GAAC,OAAIV,EAAS,CACtB4C,OAAQ,CACNvD,KAAAA,EACAtG,MAAOoL,GAAazD,EAAEkC,OAAO7J,MAAOqL,KAR1C,GAYM5D,GAbW,EAiBnBkE,GAAW5H,UAAY,CACrBuC,KAAMtC,EAAUC,OAAOwE,WACvBoC,IAAK7G,EAAU6E,OACfyB,IAAKtG,EAAU6E,OACfwC,KAAMrH,EAAU6E,OAChB7I,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAU6E,OACV7E,EAAUC,SAEZgD,SAAUjD,EAAUiF,KAAKR,YC1B3B,IAAMoD,GAAa,SAAC7L,EAAO8L,GACzB,IAAIC,EAAYC,GAASC,cAOlBD,OALHF,IACoCC,EAAV,iBAAjBD,EAAuCE,GAASF,GAC1CA,GAGZE,GAASE,QAAQlM,GAAOmM,eAAeJ,EAC/C,EAEKK,GAAmB,SAAqDzJ,GAAlD3C,IAAAA,IAAAA,MAAOqG,IAAAA,KAAMyF,IAAAA,aAAcb,IAAAA,MAAOF,IAAAA,UACxDsB,EAAarM,EAUjB,MARa,SAATqG,GAA4B,mBAATA,IAEnBgG,EADEpB,EACcY,GAAAA,OAAAA,IAAW7L,eAAAA,EAAOqK,QAAS,GAAIyB,GAArC,OAAAQ,OAAwDT,IAAW7L,aAAAA,EAAAA,EAAOuK,MAAO,GAAIuB,IAElFD,GAAW7L,EAAO8L,IAKjC1I,gBAACQ,EAAD,CACEC,QAAQ,QACRP,MAAO,CAAEiJ,WAAYxB,EAAY,WAAa,YAE7CsB,EAGN,EAEDD,GAAiBrI,UAAY,CAC3B/D,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAU6E,OACV7E,EAAUC,SAEZoC,KAAMrC,EAAUC,OAChBgH,MAAOjH,EAAU4E,KACjBkD,aAAc9H,EAAU2E,UAAU,CAChC3E,EAAUC,OACVD,EAAU0E,SAEZqC,UAAW/G,EAAU4E,MCzCvB,IAAM4D,GAASC,KAwCTC,GAAiB,SAAAvD,GACrBwD,IAAAA,IAAAA,GACA/J,IAAAA,MACAiB,IAAAA,QACA8F,IAAAA,QACA9C,IAAAA,SACAC,IAAAA,SACA8F,IAAAA,YACAlG,IAAAA,QACAmG,IAAAA,UACAC,IAAAA,aACAC,IAAAA,gBACA/M,IAAAA,MACAgN,IAAAA,OACAC,IAAAA,QACAhG,IAAAA,SACAiG,IAAAA,cAhBqB,OAkBrB9J,gBAAC+J,GAAD,CACER,GAAIA,EACJ3M,MAAOA,GAAS,GAChBkI,WAHF,EAIEpB,SAAUA,EACVkG,OAAQA,EACRC,QAASA,EACThG,SAAU,SAACmG,EAAG5M,GACY,iBAAbA,EACJoM,IAAe/O,MAAMC,QAAQ4I,IAAaA,EAAQ2G,MAAK,SAAAC,GAAC,OAAIA,EAAEC,QAAU/M,CAAhB,IACxDyG,EAAQuG,EAAA,GAAIX,EAAYrM,IAD2DyG,OAASxH,GAExFmN,GAAepM,GAAYA,EAASiN,WAE7CxG,EAAY4F,EAAAA,CAAAA,EAAAA,EAAYrM,EAASiN,aAEjCxG,EAASzG,EAff,EAkBEkN,cAAe,SAACC,EAAYC,GACpBC,IAAAA,EAAWrB,GAAOmB,EAAYC,GAUpC,OAPIhB,GAAqC,KAAtBgB,EAAOH,YACxBI,EAAStI,KAATiI,EAAA,CACEC,WAAYG,EAAOH,YAClBZ,EAAYE,EAAgBa,EAAOH,cAIjCI,CA7BX,EA+BEC,eA/BF,EAgCEC,aAhCF,EAiCEC,mBAjCF,EAkCEtH,QAASA,EACTuH,SAAUrB,EACVsB,eAAgB,SAAAC,GAEd,MAAsB,iBAAXA,EACJvB,IAAe/O,MAAMC,QAAQ4I,IAAaA,EAAQ2G,MAAK,SAAAC,GAAC,OAAIA,EAAEC,QAAUY,CAAhB,IACtDA,EADsF,GAK3FA,SAAAA,EAAQV,WACHU,aAAAA,EAAAA,EAAQV,WAIVU,EAAOtB,EAjDlB,EAmDEuB,qBAAsB,SAACD,EAAQE,GAAT,OAAuBF,EAAOtB,KAAewB,CAnDrE,EAoDEvB,aAAcA,EACdwB,YAAa,SAAAV,GAAM,OA7GH,SAAAjL,EAQlBiL,GANE/G,IAAAA,IAAAA,SACAjE,IAAAA,MACAsK,IAAAA,cACArJ,IAAAA,QACA8F,IAAAA,QAIE4E,EAAaX,EAAOW,YAAc,GAgBpC,OAdE5E,IACF4E,EAAa,CACXnH,aACEhE,EAAAM,cAAC2D,EAAD,CAAgBC,SAAS,OACvBlE,gBAACoL,EAAD,CACEC,KAAM,GACNC,UAAW,OAQnBtL,EAAAM,cAACwG,EAADiB,EAAA,CAAA,EAEMyC,EAFN,CAGE/G,SAAUA,EACVjE,MAAOA,EACPiB,QAASA,EACToD,SAAUiG,EACVqB,WAAYA,IAGjB,CA0EKD,CACE,CACEzH,SAAAA,EACAC,SAAAA,EACAlE,MAAAA,EACAsK,cAAAA,EACArJ,QAAAA,EACA8F,QAAAA,GAEFiE,EAVe,GAvEA,EAuFvBlB,GAAe3I,UAAY,CACzB4I,GAAI3I,EAAUC,OACdrB,MAAOoB,EAAUC,OAAOwE,WACxB5E,QAASG,EAAUC,OACnB0F,QAAS3F,EAAU4E,KACnB/B,SAAU7C,EAAU4E,KACpB9B,SAAU9C,EAAU4E,KACpBgE,YAAa5I,EAAU4E,KACvBlC,QAAS1C,EAAU8E,MAAML,WACzBoE,UAAW7I,EAAUC,OAAOwE,WAC5BqE,aAAc9I,EAAUiF,KAAKR,WAC7BsE,gBAAiB/I,EAAUiF,KAAKR,WAChCzI,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU0E,SAEZsE,OAAQhJ,EAAUiF,KAClBgE,QAASjJ,EAAUiF,KACnBhC,SAAUjD,EAAUiF,KACpBiE,cAAelJ,EAAUiF,MC3I3B,IAAM0F,GAAmB,SAiBnBhM,GAhBJgH,IAAAA,IAAAA,QACArD,IAAAA,KACA1D,IAAAA,MACA5C,IAAAA,MACA0G,IAAAA,QACAkG,IAAAA,YACA5F,IAAAA,MACAL,IAAAA,UACAC,IAAAA,OACA/C,IAAAA,QACAgD,IAAAA,SACAC,IAAAA,SACA8H,IAAAA,SACAC,IAAAA,MACAC,IAAAA,MACA7H,IAAAA,SAEM8H,EAAcC,GAAY,SAAAxO,GAAcyG,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,OAAOQ,aAAAA,EAAAA,EAAU+M,QAAS,KAAS,GAAE,CAACtG,IAE/G,OAAI2H,EACKxL,gBAACgJ,GAAD,CAAkB9F,KAAMA,EAAMtG,MAAOA,IAGzC0G,EA6BHtD,gBAAC4E,EAAD,CACElC,MAAOkB,GAASL,EAChBsB,OAAO,QACPC,WAHF,EAIErB,SAAUA,GAEVzD,gBAACsJ,GAAD,CACE/C,QAASA,EACT/G,MAAOA,EACPiB,QAASA,EACT+I,YAAaA,EACblG,QAASA,EACTmG,UAAU,QACVhG,SAAUA,EACVC,SAAUA,EACVgG,aAAc,SAACrF,EAAO0G,GACpB,OAAA/K,EAAAM,cAACL,EAAD8H,EAAA,CAAA,EAEM1D,EAFN,CAGEuC,GAAI,CACFxG,QAAS,OACTC,cAAe,SACfgH,eAAgB,aAChBC,WAAY,gBAGdtH,gBAACQ,EAAD,CAAYC,QAAQ,SACjBsK,EAAOZ,YAGS9N,IAAjB0O,EAAOc,OAEH7L,EAAAM,cAACE,EAAD,CAAYC,QAAQ,WAApB,GAAAyI,OACM6B,EAAOc,MADb,cA1BZ,EAiCElC,gBAAiB,SAAAvM,GAAQ,OACvB4C,gBAACQ,EAAD,CAAYC,QAAQ,SAClBT,EAAAM,cAAA,SAAA,KAAA,IAAA4I,OAAa9L,EAAb,OAFqB,YAjC3B,EAuCER,MAAOA,EACPgN,OAAQ,WACN+B,EAAY,CAAExB,MAAOvN,IACjB6O,GAAOA,GA1Cf,EA4CE5B,QAAS,WACH6B,GAAOA,GA7Cf,EA+CE7H,SAAU8H,IAGT/H,IAAUF,GAAYH,GAEnBvD,EAACM,cAAA4E,OACE1B,EAAO2B,KAAI,SAAAZ,GAAKA,OAAAA,EAAEC,OAAlB,IAA2BlC,KAAK,QAtFzCtC,gBAAC4E,EAAD,CACElC,MAAOkB,GAASL,EAChBsB,OAAO,QACPC,WAHF,EAIErB,SAAUA,GAEVzD,gBAAC8G,EAAD,CACEtH,MAAOA,EACPiB,QAASA,EACT7D,MAAOA,EACP8G,UAJF,EAKEyH,WAAY,CACVnH,aACEhE,EAAAM,cAAC2D,EAAD,CAAgBC,SAAS,OACvBlE,gBAACoL,EAAD,CACEC,KAAM,GACNC,UAAW,QA4E5B,EAEDC,GAAiB5K,UAAY,CAC3B4F,QAAS3F,EAAU4E,KACnBtC,KAAMtC,EAAUC,OAChBrB,MAAOoB,EAAUC,OACjBjE,MAAOgE,EAAUwE,IACjB9B,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCuE,MAAOvJ,EAAUC,OAAOwE,WACxBwG,MAAOjL,EAAU6E,UAEnB+D,YAAa5I,EAAU4E,KACvB/E,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChD2C,SAAU7C,EAAU4E,KACpB9B,SAAU9C,EAAU4E,KACpBgG,SAAU5K,EAAU4E,KACpB5B,MAAOhD,EAAU4E,KACjBjC,UAAW3C,EAAU4E,KACrBhC,OAAQ5C,EAAU8E,MAClB+F,MAAO7K,EAAUiF,KACjB6F,MAAO9K,EAAUiF,KACjBhC,SAAUjD,EAAUiF,sFCpJhBiG,GAAa,SAAkFvM,GAA/E2D,IAAAA,IAAAA,KAAMI,IAAAA,QAASG,IAAAA,SAAUJ,IAAAA,aAAczG,IAAAA,MAAOmP,IAAAA,OAAQlI,IAAAA,SAAaQ,EAAY8B,EAAA5G,EAAA6G,IAC7FmE,EACJwB,EACIzI,EACAA,EAAQ0I,MAAK,SAAC7M,EAAG8M,GAAM9M,OAAAA,EAAEK,MAAM0M,cAAcD,EAAEzM,MAAlC,IAGdiE,GAAaJ,GAChBkH,EAAW4B,QAAQ,CACjB3M,MAAO,kBACP5C,MAAO,KAIPqM,IAAAA,EAAa,GAIjB,YAHc5M,IAAVO,IAAqBqM,EAAarM,GACnB,KAAfqM,QAAsC5M,IAAjBgH,IAA4B4F,EAAa5F,GAGhErD,gBAAC8G,EAADiB,EAAA,CACE7E,KAAMA,EACNkJ,QAFF,EAGE3I,SAAUA,EACV7G,MAAOqM,GAEH5E,EANN,CAOER,SAAUA,IAGR0G,EACGpF,KAAI,SAAAY,GAAUsG,IAAAA,IAAP7M,MAAyB8M,IAAP1P,MAArB,OACHoD,gBAACuM,EAAD,CACEnR,IAAKiR,EACLzP,MAAO0P,GAEND,EANP,IAYP,EAEDP,GAAWnL,UAAY,CACrBuC,KAAMtC,EAAUC,OAChBwC,aAAczC,EAAUC,OACxBjE,MAAOgE,EAAUC,OACjByC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OAEnB3B,SAAU7C,EAAU4E,KACpBuG,OAAQnL,EAAU4E,KAClB3B,SAAUjD,EAAUiF,+CCtDhB2G,GAAkB,SAA+CjN,GAA5C0D,IAAAA,IAAAA,KAAMK,IAAAA,QAASmJ,IAAAA,aAAiBpI,EAAY8B,EAAA5G,EAAA6G,IACjEqG,OAAiB,IAAjBA,EAEAzM,gBAACuL,GAADxD,EAAA,CACE9E,KAAK,gBAEDoB,EAHN,CAIEf,QAASA,EAAQ6B,KAAI,SAAAgF,GAAU,MAAA,CAAEA,MAAOA,EAAMvN,MAApB,OAMzBoD,gBAAC8L,GAAD/D,EAAA,CAAY9E,KAAMA,EAAMK,QAASA,GAAae,GACtD,EAEDmI,GAAgB7L,UAAY,CAC1BsC,KAAMrC,EAAUC,OAAOwE,WACvB/B,QAAS1C,EAAU8E,MAAML,WACzBoH,aAAc7L,EAAU4E,MCf1B,IACMkH,GAAY,SAAC9P,EAAOyG,GAAkBoB,OADX,KAAfkI,EACoC/P,KADJ,IAAR+P,EACqB/P,EAASyG,IAAgB,EADtE,IAAAsJ,CACA,EAEZC,GAAc,SAWdrN,GAVJkB,IAAAA,IAAAA,QACAyC,IAAAA,KACAtG,IAAAA,MACAyG,IAAAA,aACAK,IAAAA,SACAmJ,IAAAA,cACAC,IAAAA,YACAC,IAAAA,UACAC,IAAAA,WACAnJ,IAAAA,SAEMoJ,EAAe,SAAA1I,GACnB,IAAInH,EAAWmH,EAAEkC,OAAOyG,SACF,IAAlBL,IAAuC,IAAbzP,IAAoBA,OAAWf,GAC7DwH,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAOQ,IACnC,EAEKP,EAAW,SAAAO,GACfyG,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAOQ,IACnC,EAEGqD,GAAY,aAAZA,EACF,OACET,gBAACmN,EAAD,CACExK,MAAM,UACNO,KAAMA,EACNgK,QAASR,GAAU9P,EAAOyG,GAC1BQ,SAAUoJ,IAKZxM,GAAY,YAAZA,EAAuB,CACnB2M,IAAAA,EACJpN,EAAAM,cAAC+M,EAAD,CACE3J,SAAUA,EACV4J,kBAFF,EAGE7M,QACGiM,GAAU9P,EAAOyG,GAEd,WADA,YAGNV,MACG+J,GAAU9P,EAAOyG,GAEd,UADA,UAGNuD,GAAI,CACFzF,EAAG,EACHoM,OAAQ,SAAAhM,GAAK,OAAIA,EAAMG,QAAQ,EAF7B,EAGFmF,KAAM,YACNW,IACkB,IAAhBsF,EACI,EACA,GAGRU,QAAS,WAAM3Q,OAAAA,GAAS,EAAf,GAERmQ,GAAc,QAIbS,EACJzN,EAAAM,cAAC+M,EAAD,CACE3J,SAAUA,EACV4J,kBAFF,EAGE7M,QACEiM,GAAU9P,EAAOyG,GACb,YACA,WAENV,MACE+J,GAAU9P,EAAOyG,GACb,UACA,UAENuD,GAAI,CACFzF,EAAG,EACHoM,OAAQ,SAAAhM,GAAK,OAAIA,EAAMG,QAAQ,EAF7B,EAGFmF,KAAM,YACNW,IACkB,IAAhBsF,EACI,EACA,GAGRU,QAAS,WAAM3Q,OAAAA,GAAS,EAAf,GAERkQ,GAAa,MAIlB,OACE/M,gBAAC0G,EAAD,CAAOC,UAAU,QAEG,IAAhBmG,GAEI9M,EACGyN,cAAAA,EAAAA,SAAAA,KAAAA,EACAL,IAKS,IAAhBN,GAEI9M,EAAAM,cAAAN,EAAA0N,SAAA,KACGN,EACAK,GAMd,CAED,OACEzN,gBAAC2N,EAAD,CACEhL,MAAM,UACNO,KAAMA,EACNgK,QAASR,GAAU9P,EAAOyG,GAC1BQ,SAAUoJ,GAGf,EAEDL,GAAYjM,UAAY,CACtBF,QAASG,EAAUC,OACnBqC,KAAMtC,EAAUC,OAAOwE,WACvBzI,MAAOgE,EAAU4E,KACjBnC,aAAczC,EAAU4E,KACxB9B,SAAU9C,EAAU4E,KACpBqH,cAAejM,EAAU4E,KACzBsH,YAAalM,EAAU4E,KACvBuH,UAAWnM,EAAUC,OACrBmM,WAAYpM,EAAUC,OACtBgD,SAAUjD,EAAUiF,KAAKR,YCnI3B,IAKMuI,GAAsB,SAMtBrO,GALJkB,IAAAA,IAAAA,QACAoN,IAAAA,QACAvK,IAAAA,QACAwK,IAAAA,eACAjK,IAAAA,SAE4BrH,EAAAA,GAAS,GAArCE,EAAAC,EAAAJ,EAAA,GAAOwR,EAAPrR,EAAA,GAAesR,EAAftR,EAAA,GACoCF,EAAAA,EAAS,IAA7CyR,EAAAtR,EAAAuR,EAAA,GAAO7D,EAAP4D,EAAA,GAAmBE,EAAnBF,EAAA,GACoDzR,EAAAA,EAAS,IAA7D4R,EAAAzR,EAAA0R,EAAA,GAAOC,EAAPF,EAAA,GAA2BG,EAA3BH,EAAA,GAEMI,EAAuB,WAC3BR,GAAU,GACVG,EAAc,IACdI,EAAsB,GACvB,EAEKE,EAAiB,WACjBpE,EAAW/P,OAAS,IACtBuJ,EAAQ,GAAAqF,OAAAwF,EAAKb,GAAL,CAAcxD,KACtB8D,EAAc,IAEjB,EAQD,OACEnO,gBAACC,EAAD,CAAKE,MAAM,UAEL0N,GAA+B,KAApBA,aAAA,EAAAA,EAASvT,UAElB0F,gBAACC,EAAD,CAAK0O,GAAI,EAAGC,GAAI,GACd5O,gBAACQ,EAAD,CAAYC,QAAQ,QAAQkC,MAAM,iBADpC,6BAQJkL,EAAQ1I,KAAI,SAACgF,EAAO0E,GAClB,OAAA7O,EAAAM,cAACL,EAAD,CAEE7E,IAAcyT,SAAAA,OAAAA,GACdjI,GAAI,SAAArF,GAAU,MAAA,CACZnB,QAAS,OACTkH,WAAY,SACZnH,MAAO,OACPwO,GAAI,EACJG,GAAI,IACJC,GAAI,IACJC,OAAqBzN,aAAAA,OAAAA,EAAMqB,QAAQqM,KAAK,MACxCC,aAAc,EARP,GAWTlP,gBAACQ,EAAD,CACEC,QAAQ,QACRmG,GAAI,SAAArF,GAAU,MAAA,CACZiG,GAAI,IACJsH,GAAI,GACJnM,MAAOpB,EAAMqB,QAAQuM,KAAKC,UAC1BC,SAAU9N,EAAM+N,WAAWC,QAAQF,SACnCG,WAAYjO,EAAM+N,WAAWG,iBAC7BC,WAAY,EANL,GASRb,EAAQ,GAEX7O,gBAACQ,EAAD,CACEC,QAAQ,QACRmG,GAAI,CAAEC,KAAM,cA9ERjK,EAgFMuN,GAhFCwF,EAgFMrM,SA/EKjH,IAAnBsT,EAAQ/S,GAA6B+S,EAAQ/S,GACrDA,IAgFGoD,EAAAM,cAACsP,EAAD,CACEvE,KAAK,QACLmC,QAAS,WAAMqC,OAvDJC,EAuDmBjB,GAtDlCkB,EAAiBlC,EAAAA,IACZmC,OAAOF,EAAU,QAC5BjM,EAASkM,GAHY,IAAAD,EACfC,CAsDa,GAET/P,gBAACiQ,EAAD,CAAWZ,SAAS,YAtFjB,IAACzS,EAAO+S,CAgDjB,KA4CC5B,GAEG/N,gBAACC,EAAD,CAAK0O,GAAI,GACP3O,gBAACqN,EAAD,CACE1K,MAAM,UACNlC,QAAQ,WACR+M,QAAS,WAAMQ,OAAAA,GAAU,EAAhB,GAJb,wBAYHD,IAAWzK,GAERtD,gBAACC,EAAD,CACEE,MAAM,OACNC,QAAQ,OACRkH,WAAW,UACXqH,GAAI,EACJuB,IAAK,GAELlQ,gBAACmQ,EAAD,CACEC,YAAa,WACQ,KAAf/F,GACF2D,GAAU,EAEb,GAEDhO,gBAAC4E,EAAD,CACEnE,QAAQ,SACRqE,WAAS,GAET9E,gBAAC8G,EAAD,CACEtH,MAAM,gBACNiB,QAASA,EACT7D,MAAOyN,EACPgG,UAAW,SAAA9L,GACK,UAAVA,EAAEnJ,KAAiBqT,IACT,WAAVlK,EAAEnJ,KAAkBoT,GAN5B,EAQE3K,SAAU,SAAAU,GAAC,OAAI4J,EAAc5J,EAAEkC,OAAO7J,MAA3B,MAIjBoD,EAAAM,cAAC+M,EAAD,CACE5M,QAAQ,WACRkC,MAAM,UACNiE,GAAI,CAAE0J,SAAU,EAAGxB,GAAI,GACvBtB,QAASiB,GAETzO,EAAAM,cAACiQ,EAAD,QAMPxC,GAAUzK,GAEPtD,EAAAM,cAACL,EAAD,CACEE,MAAM,OACNC,QAAQ,OACRkH,WAAW,UACXqH,GAAI,GAEJ3O,gBAAC4E,EAAD,CACEnE,QAAQ,SACRqE,WAAS,GAET9E,gBAAC8G,EAAD,CACEtH,MAAM,oBACN4M,QAFF,EAGE3L,QAASA,EACT7D,MAAO0R,EACPkC,OAAQhC,EACR3K,SAAU,SAAAU,GACRgK,EAAsB,IACtB1K,cAAagK,GAAL,CAActJ,EAAEkC,OAAO7J,QAChC,GAGC7B,OACG8S,QAAQvK,GACR0I,MAAK,SAAC7R,EAAGC,GAAMD,OAAAA,EAAE,GAAG+R,cAAc9R,EAAE,GAA/B,IACL+K,KAAI,SAAAZ,GAAC,OACJvE,gBAACuM,EAAD,CACEnR,IAAemJ,UAAAA,OAAAA,EAAE,IACjB3H,MAAO2H,EAAE,GACTb,SAAUoK,EAAe2C,SAASlM,EAAE,KAEnCA,EAAE,GAND,OAiB3B,EAEDqJ,GAAoBjN,UAAY,CAC9BF,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChD+M,QAASjN,EAAU8E,MAAML,WACzB/B,QAAS1C,EAAU8E,MAAML,WACzByI,eAAgBlN,EAAU8E,MAAML,WAChCxB,SAAUjD,EAAUiF,KAAKR;;;;;;;;;0BCrNzB,WAGA,IAAIhJ,EAUAqU,EAAkB,sBAIlBC,EAAiB,4BAMjBC,EAAc,yBAgBdC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAiBlBC,EAAW,IACXC,EAAmB,iBAEnBC,EAAM,IAGNC,EAAmB,WAKnBC,EAAY,CACd,CAAC,MAAON,GACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aAAcH,GACf,CAAC,OAjCkB,KAkCnB,CAAC,UAAWC,GACZ,CAAC,eAAgBC,GACjB,CAAC,QAASE,IAIRM,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBACZC,EAAa,mBAEbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmB5Y,OAAO0Y,EAAczY,QACxC4Y,EAAqB7Y,OAAO2Y,EAAgB1Y,QAG5C6Y,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBrZ,OAAOoZ,GAAanZ,QAGtCqZ,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,GAAgB,kBAIhBC,GAAeC,gDACfC,GAAiB,kBACjBC,GAAe,4BAKfC,GAAe,4BACfC,GAAa,iBACbC,GAAeC,8OAGfC,GAAS,OACTC,GAAW,IAAMV,GAAgB,IACjCW,GAAU,IAAMJ,GAAe,IAC/BK,GAAU,IAAMX,GAAe,IAC/BY,GAAW,OACXC,GAAY,IAAMX,GAAiB,IACnCY,GAAU,IAAMX,GAAe,IAC/BY,GAAS,KAAOhB,GAAgBO,GAAeM,GAAWV,GAAiBC,GAAeC,GAAe,IACzGY,GAAS,2BAETC,GAAc,KAAOlB,GAAgB,IACrCmB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMhB,GAAe,IAC/BiB,GAAQ,UAGRC,GAAc,MAAQR,GAAU,IAAMC,GAAS,IAC/CQ,GAAc,MAAQH,GAAU,IAAML,GAAS,IAC/CS,GAAkB,gCAClBC,GAAkB,gCAClBC,GAZa,MAAQf,GAAU,IAAMK,GAAS,IAYtB,IACxBW,GAAW,IAAMtB,GAAa,KAI9BuB,GAAQD,GAAWD,IAHP,MAAQL,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAYjU,KAAK,KAAO,IAAMyU,GAAWD,GAAW,MAIlHG,GAAU,MAAQ,CAAChB,GAAWK,GAAYC,IAAYjU,KAAK,KAAO,IAAM0U,GACxEE,GAAW,MAAQ,CAACb,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUvT,KAAK,KAAO,IAGxG6U,GAASxc,OAAOib,GAAQ,KAMxBwB,GAAczc,OAAOob,GAAS,KAG9BsB,GAAY1c,OAAOyb,GAAS,MAAQA,GAAS,KAAOc,GAAWF,GAAO,KAGtEM,GAAgB3c,OAAO,CACzB6b,GAAU,IAAMN,GAAU,IAAMU,GAAkB,MAAQ,CAACd,GAASU,GAAS,KAAKlU,KAAK,KAAO,IAC9FqU,GAAc,IAAME,GAAkB,MAAQ,CAACf,GAASU,GAAUE,GAAa,KAAKpU,KAAK,KAAO,IAChGkU,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAtBD,mDADA,mDA0Bfb,GACAiB,IACA3U,KAAK,KAAM,KAGTiV,GAAe5c,OAAO,IAAM8b,GAAQtB,GAAiBC,GAAeK,GAAa,KAGjF+B,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,CAAA,EACrBA,GAAelF,GAAckF,GAAejF,GAC5CiF,GAAehF,GAAWgF,GAAe/E,GACzC+E,GAAe9E,GAAY8E,GAAe7E,GAC1C6E,GAAe5E,GAAmB4E,GAAe3E,GACjD2E,GAAe1E,IAAa,EAC5B0E,GAAepG,GAAWoG,GAAenG,GACzCmG,GAAepF,GAAkBoF,GAAelG,GAChDkG,GAAenF,GAAemF,GAAejG,GAC7CiG,GAAehG,GAAYgG,GAAe/F,GAC1C+F,GAAe7F,GAAU6F,GAAe5F,GACxC4F,GAAe3F,GAAa2F,GAAezF,GAC3CyF,GAAexF,GAAUwF,GAAevF,GACxCuF,GAAerF,IAAc,EAG7B,IAAIsF,GAAgB,CAApB,EACAA,GAAcrG,GAAWqG,GAAcpG,GACvCoG,GAAcrF,GAAkBqF,GAAcpF,GAC9CoF,GAAcnG,GAAWmG,GAAclG,GACvCkG,GAAcnF,GAAcmF,GAAclF,GAC1CkF,GAAcjF,GAAWiF,GAAchF,GACvCgF,GAAc/E,GAAY+E,GAAc9F,GACxC8F,GAAc7F,GAAa6F,GAAc5F,GACzC4F,GAAc1F,GAAa0F,GAAczF,GACzCyF,GAAcxF,GAAawF,GAAcvF,GACzCuF,GAAc9E,GAAY8E,GAAc7E,GACxC6E,GAAc5E,GAAa4E,GAAc3E,IAAa,EACtD2E,GAAcjG,GAAYiG,GAAchG,GACxCgG,GAActF,IAAc,EAG5B,IA4EIuF,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBzP,WACjB0P,GAAezP,SAGf0P,GAA8B,iBAAVC,IAAsBA,IAAUA,GAAOld,SAAWA,QAAUkd,GAGhFC,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKpd,SAAWA,QAAUod,KAGxEC,GAAOJ,IAAcE,IAAYG,SAAS,cAATA,GAGjCC,GAA4C/V,IAAYA,EAAQgW,UAAYhW,EAG5EiW,GAAaF,IAA4Cre,IAAWA,EAAOse,UAAYte,EAGvFwe,GAAgBD,IAAcA,GAAWjW,UAAY+V,GAGrDI,GAAcD,IAAiBT,GAAWW,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWM,SAAWN,GAAWM,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,OAClE,CAAC,MAAOxU,GAAG,CACb,CAZe,GAeZyU,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAAStX,GAAMwD,EAAM+T,EAASC,GAC5B,OAAQA,EAAKvf,QACX,KAAK,EAAG,OAAOuL,EAAK1K,KAAKye,GACzB,KAAK,EAAG,OAAO/T,EAAK1K,KAAKye,EAASC,EAAK,IACvC,OAAQ,OAAOhU,EAAK1K,KAAKye,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOhU,EAAK1K,KAAKye,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOhU,EAAKxD,MAAMuX,EAASC,EAC5B,CAYD,SAASC,GAAgBpU,EAAOqU,EAAQC,EAAUC,GAIhD,IAHA,IAAIpL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,SAE9BuU,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GAClBkL,EAAOE,EAAard,EAAOod,EAASpd,GAAQ8I,EAC7C,CACD,OAAOuU,CACR,CAWD,SAASC,GAAUxU,EAAOsU,GAIxB,IAHA,IAAInL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,SAE9BuU,EAAQvU,IAC8B,IAAzC0f,EAAStU,EAAMmJ,GAAQA,EAAOnJ,KAIpC,OAAOA,CACR,CAWD,SAASyU,GAAezU,EAAOsU,GAG7B,IAFA,IAAI1f,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OAEhCA,MAC0C,IAA3C0f,EAAStU,EAAMpL,GAASA,EAAQoL,KAItC,OAAOA,CACR,CAYD,SAAS0U,GAAW1U,EAAO2U,GAIzB,IAHA,IAAIxL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,SAE9BuU,EAAQvU,GACf,IAAK+f,EAAU3U,EAAMmJ,GAAQA,EAAOnJ,GAClC,OAAO,EAGX,OAAA,CACD,CAWD,SAAS4U,GAAY5U,EAAO2U,GAM1B,IALA,IAAIxL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACnCigB,EAAW,EACXC,EAAS,KAEJ3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdwL,EAAUzd,EAAOiS,EAAOnJ,KAC1B8U,EAAOD,KAAc3d,EAExB,CACD,OAAO4d,CACR,CAWD,SAASC,GAAc/U,EAAO9I,GAE5B,SADsB,MAAT8I,EAAgB,EAAIA,EAAMpL,SACpBogB,GAAYhV,EAAO9I,EAAO,IAAM,CACpD,CAWD,SAAS+d,GAAkBjV,EAAO9I,EAAOge,GAIvC,IAHA,IAAI/L,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,SAE9BuU,EAAQvU,GACf,GAAIsgB,EAAWhe,EAAO8I,EAAMmJ,IAC1B,OAAO,EAGX,OAAA,CACD,CAWD,SAASgM,GAASnV,EAAOsU,GAKvB,IAJA,IAAInL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACnCkgB,EAAS/f,MAAMH,KAEVuU,EAAQvU,GACfkgB,EAAO3L,GAASmL,EAAStU,EAAMmJ,GAAQA,EAAOnJ,GAEhD,OAAO8U,CACR,CAUD,SAASM,GAAUpV,EAAOqV,GAKxB,IAJA,IAAIlM,GAAS,EACTvU,EAASygB,EAAOzgB,OAChB0gB,EAAStV,EAAMpL,SAEVuU,EAAQvU,GACfoL,EAAMsV,EAASnM,GAASkM,EAAOlM,GAEjC,OAAOnJ,CACR,CAcD,SAASuV,GAAYvV,EAAOsU,EAAUC,EAAaiB,GACjD,IAAIrM,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OAKvC,IAHI4gB,GAAa5gB,IACf2f,EAAcvU,IAAQmJ,MAEfA,EAAQvU,GACf2f,EAAcD,EAASC,EAAavU,EAAMmJ,GAAQA,EAAOnJ,GAE3D,OAAOuU,CACR,CAcD,SAASkB,GAAiBzV,EAAOsU,EAAUC,EAAaiB,GACtD,IAAI5gB,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OAIvC,IAHI4gB,GAAa5gB,IACf2f,EAAcvU,IAAQpL,IAEjBA,KACL2f,EAAcD,EAASC,EAAavU,EAAMpL,GAASA,EAAQoL,GAE7D,OAAOuU,CACR,CAYD,SAASmB,GAAU1V,EAAO2U,GAIxB,IAHA,IAAIxL,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,SAE9BuU,EAAQvU,GACf,GAAI+f,EAAU3U,EAAMmJ,GAAQA,EAAOnJ,GACjC,OAAO,EAGX,OAAA,CACD,CASD,IAAI2V,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYnB,EAAWoB,GAC1C,IAAIjB,EAOJ,OANAiB,EAASD,GAAY,SAAS5e,EAAOxB,EAAKogB,GACxC,GAAInB,EAAUzd,EAAOxB,EAAKogB,GAExB,OADAhB,EAASpf,GACT,CAEH,IACMof,CACR,CAaD,SAASkB,GAAchW,EAAO2U,EAAWsB,EAAWC,GAIlD,IAHA,IAAIthB,EAASoL,EAAMpL,OACfuU,EAAQ8M,GAAaC,EAAY,GAAK,GAElCA,EAAY/M,MAAYA,EAAQvU,GACtC,GAAI+f,EAAU3U,EAAMmJ,GAAQA,EAAOnJ,GACjC,OAAOmJ,EAGX,OAAQ,CACT,CAWD,SAAS6L,GAAYhV,EAAO9I,EAAO+e,GACjC,OAAO/e,GAAUA,EAidnB,SAAuB8I,EAAO9I,EAAO+e,GACnC,IAAI9M,EAAQ8M,EAAY,EACpBrhB,EAASoL,EAAMpL,OAEnB,OAASuU,EAAQvU,GACf,GAAIoL,EAAMmJ,KAAWjS,EACnB,OAAOiS,EAGX,OAAQ,CACT,CA1dKgN,CAAcnW,EAAO9I,EAAO+e,GAC5BD,GAAchW,EAAOoW,GAAWH,EACrC,CAYD,SAASI,GAAgBrW,EAAO9I,EAAO+e,EAAWf,GAIhD,IAHA,IAAI/L,EAAQ8M,EAAY,EACpBrhB,EAASoL,EAAMpL,SAEVuU,EAAQvU,GACf,GAAIsgB,EAAWlV,EAAMmJ,GAAQjS,GAC3B,OAAOiS,EAGX,OAAQ,CACT,CASD,SAASiN,GAAUlf,GACjB,OAAOA,GAAUA,CAClB,CAWD,SAASof,GAAStW,EAAOsU,GACvB,IAAI1f,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAOA,EAAU2hB,GAAQvW,EAAOsU,GAAY1f,EAAU8W,CACvD,CASD,SAASkK,GAAalgB,GACpB,OAAO,SAASkK,GACd,OAAiB,MAAVA,EAAiBjJ,EAAYiJ,EAAOlK,EAC5C,CACF,CASD,SAAS8gB,GAAe5W,GACtB,OAAO,SAASlK,GACd,OAAiB,MAAVkK,EAAiBjJ,EAAYiJ,EAAOlK,EAC5C,CACF,CAeD,SAAS+gB,GAAWX,EAAYxB,EAAUC,EAAaiB,EAAWO,GAMhE,OALAA,EAASD,GAAY,SAAS5e,EAAOiS,EAAO2M,GAC1CvB,EAAciB,GACTA,GAAY,EAAOte,GACpBod,EAASC,EAAard,EAAOiS,EAAO2M,EACzC,IACMvB,CACR,CA+BD,SAASgC,GAAQvW,EAAOsU,GAKtB,IAJA,IAAIQ,EACA3L,GAAS,EACTvU,EAASoL,EAAMpL,SAEVuU,EAAQvU,GAAQ,CACvB,IAAI0C,EAAUgd,EAAStU,EAAMmJ,IACzB7R,IAAYX,IACdme,EAASA,IAAWne,EAAYW,EAAWwd,EAASxd,EAEvD,CACD,OAAOwd,CACR,CAWD,SAAS4B,GAAUC,EAAGrC,GAIpB,IAHA,IAAInL,GAAS,EACT2L,EAAS/f,MAAM4hB,KAEVxN,EAAQwN,GACf7B,EAAO3L,GAASmL,EAASnL,GAE3B,OAAO2L,CACR,CAwBD,SAAS8B,GAASzb,GAChB,OAAOA,EACHA,EAAO0b,MAAM,EAAGC,GAAgB3b,GAAU,GAAG4b,QAAQxI,GAAa,IAClEpT,CACL,CASD,SAAS6b,GAAU7W,GACjB,OAAgBjJ,SAAAA,GACd,OAAOiJ,EAAKjJ,EACb,CACF,CAYD,SAAS+f,GAAWrX,EAAQjB,GAC1B,OAAOwW,GAASxW,GAAO,SAASjJ,GAC9B,OAAOkK,EAAOlK,EACf,GACF,CAUD,SAASwhB,GAASC,EAAOzhB,GACvB,OAAOyhB,EAAMC,IAAI1hB,EAClB,CAWD,SAAS2hB,GAAgBC,EAAYC,GAInC,IAHA,IAAIpO,GAAS,EACTvU,EAAS0iB,EAAW1iB,SAEfuU,EAAQvU,GAAUogB,GAAYuC,EAAYD,EAAWnO,GAAQ,IAAM,IAC5E,OAAOA,CACR,CAWD,SAASqO,GAAcF,EAAYC,GAGjC,IAFA,IAAIpO,EAAQmO,EAAW1iB,OAEhBuU,KAAW6L,GAAYuC,EAAYD,EAAWnO,GAAQ,IAAM,IACnE,OAAOA,CACR,CA8BD,IAAIsO,GAAejB,GAjxBG,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,MAouBxBkB,GAAiBlB,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASmB,GAAiBC,GACxB,MAAO,KAAOzF,GAAcyF,EAC7B,CAqBD,SAASC,GAAW1c,GAClB,OAAO0W,GAAaiG,KAAK3c,EAC1B,CAqCD,SAAS4c,GAAWtY,GAClB,IAAI0J,GAAS,EACT2L,EAAS/f,MAAM0K,EAAIkG,MAKvB,OAHAlG,EAAIjG,SAAQ,SAAStC,EAAOxB,GAC1Bof,IAAS3L,GAAS,CAACzT,EAAKwB,EACzB,IACM4d,CACR,CAUD,SAASkD,GAAQ7X,EAAM8X,GACrB,OAAO,SAAS1b,GACd,OAAO4D,EAAK8X,EAAU1b,GACvB,CACF,CAWD,SAAS2b,GAAelY,EAAOmY,GAM7B,IALA,IAAIhP,GAAS,EACTvU,EAASoL,EAAMpL,OACfigB,EAAW,EACXC,EAAS,KAEJ3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdjS,IAAUihB,GAAejhB,IAAUgU,IACrClL,EAAMmJ,GAAS+B,EACf4J,EAAOD,KAAc1L,EAExB,CACD,OAAO2L,CACR,CASD,SAASsD,GAAWC,GAClB,IAAIlP,GAAS,EACT2L,EAAS/f,MAAMsjB,EAAI1S,MAKvB,OAHA0S,EAAI7e,SAAQ,SAAStC,GACnB4d,IAAS3L,GAASjS,CACnB,IACM4d,CACR,CASD,SAASwD,GAAWD,GAClB,IAAIlP,GAAS,EACT2L,EAAS/f,MAAMsjB,EAAI1S,MAKvB,OAHA0S,EAAI7e,SAAQ,SAAStC,GACnB4d,IAAS3L,GAAS,CAACjS,EAAOA,EAC3B,IACM4d,CACR,CAmDD,SAASyD,GAAWpd,GAClB,OAAO0c,GAAW1c,GAiDpB,SAAqBA,GACnB,IAAI2Z,EAASnD,GAAU6G,UAAY,EACnC,KAAO7G,GAAUmG,KAAK3c,MAClB2Z,EAEJ,OAAOA,CACR,CAtDK2D,CAAYtd,GACZwa,GAAUxa,EACf,CASD,SAASud,GAAcvd,GACrB,OAAO0c,GAAW1c,GAmDpB,SAAwBA,GACtB,OAAOA,EAAOwd,MAAMhH,KAAc,EACnC,CApDKiH,CAAezd,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAO0d,MAAM,GACrB,CA4kBKC,CAAa3d,EAClB,CAUD,SAAS2b,GAAgB3b,GAGvB,IAFA,IAAIgO,EAAQhO,EAAOvG,OAEZuU,KAAWqF,GAAasJ,KAAK3c,EAAO4d,OAAO5P,MAClD,OAAOA,CACR,CASD,IAAI6P,GAAmBxC,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MA4gCX,IAs3eIlS,GAt3egB,SAAS2U,EAAaC,GAIxC,IA6BMC,GA7BFpkB,IAHJmkB,EAAqB,MAAXA,EAAkBxG,GAAOpO,GAAE8U,SAAS1G,GAAKrd,SAAU6jB,EAAS5U,GAAE+U,KAAK3G,GAAMX,MAG/Dhd,MAChBukB,GAAOJ,EAAQI,KACfrhB,GAAQihB,EAAQjhB,MAChB0a,GAAWuG,EAAQvG,SACnB4G,GAAOL,EAAQK,KACflkB,GAAS6jB,EAAQ7jB,OACjBJ,GAASikB,EAAQjkB,OACjBukB,GAASN,EAAQM,OACjBC,GAAYP,EAAQO,UAGpBC,GAAa3kB,GAAMO,UACnBqkB,GAAYhH,GAASrd,UACrBskB,GAAcvkB,GAAOC,UAGrBukB,GAAaX,EAAQ,sBAGrBY,GAAeH,GAAUpkB,SAGzBC,GAAiBokB,GAAYpkB,eAG7BukB,GAAY,EAGZC,IACEb,GAAM,SAASc,KAAKJ,IAAcA,GAAW/kB,MAAQ+kB,GAAW/kB,KAAKolB,UAAY,KACvE,iBAAmBf,GAAO,GAQtCgB,GAAuBP,GAAYrkB,SAGnC6kB,GAAmBN,GAAarkB,KAAKJ,IAGrCglB,GAAU3H,GAAKpO,EAGfgW,GAAarlB,GAAO,IACtB6kB,GAAarkB,KAAKD,IAAgBuhB,QAAQ1I,GAAc,QACvD0I,QAAQ,yDAA0D,SAAW,KAI5EwD,GAASxH,GAAgBmG,EAAQqB,OAAS5jB,EAC1C6jB,GAAStB,EAAQsB,OACjBC,GAAavB,EAAQuB,WACrBC,GAAcH,GAASA,GAAOG,YAAc/jB,EAC5CgkB,GAAe3C,GAAQ3iB,GAAOulB,eAAgBvlB,IAC9CwlB,GAAexlB,GAAOylB,OACtBC,GAAuBnB,GAAYmB,qBACnCzQ,GAASoP,GAAWpP,OACpB0Q,GAAmBR,GAASA,GAAOS,mBAAqBtkB,EACxDukB,GAAcV,GAASA,GAAOW,SAAWxkB,EACzCykB,GAAiBZ,GAASA,GAAOa,YAAc1kB,EAE/C2kB,GAAkB,WACpB,IACE,IAAInb,EAAOob,GAAUlmB,GAAQ,kBAE7B,OADA8K,EAAK,CAAA,EAAI,GAAI,CAAT,GACGA,CACR,CAAC,MAAOtB,GAAG,CACb,CANqB,GASlB2c,GAAkBtC,EAAQuC,eAAiB/I,GAAK+I,cAAgBvC,EAAQuC,aACxEC,GAASpC,IAAQA,GAAKqC,MAAQjJ,GAAK4G,KAAKqC,KAAOrC,GAAKqC,IACpDC,GAAgB1C,EAAQ2C,aAAenJ,GAAKmJ,YAAc3C,EAAQ2C,WAGlEC,GAAavC,GAAKwC,KAClBC,GAAczC,GAAK0C,MACnBC,GAAmB7mB,GAAO8mB,sBAC1BC,GAAiB7B,GAASA,GAAO8B,SAAW1lB,EAC5C2lB,GAAiBpD,EAAQtjB,SACzB2mB,GAAa7C,GAAW9c,KACxB4f,GAAaxE,GAAQ3iB,GAAOP,KAAMO,IAClConB,GAAYlD,GAAK/X,IACjBkb,GAAYnD,GAAKxX,IACjB4a,GAAYrD,GAAKqC,IACjBiB,GAAiB1D,EAAQtW,SACzBia,GAAetD,GAAKuD,OACpBC,GAAgBrD,GAAWsD,QAG3BC,GAAW1B,GAAUrC,EAAS,YAC9BgE,GAAM3B,GAAUrC,EAAS,OACzBiE,GAAU5B,GAAUrC,EAAS,WAC7BhgB,GAAMqiB,GAAUrC,EAAS,OACzBkE,GAAU7B,GAAUrC,EAAS,WAC7BmE,GAAe9B,GAAUlmB,GAAQ,UAGjCioB,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,CAAA,EAGZC,GAAqBC,GAASR,IAC9BS,GAAgBD,GAASP,IACzBS,GAAoBF,GAASN,IAC7BS,GAAgBH,GAASvkB,IACzB2kB,GAAoBJ,GAASL,IAG7BU,GAActD,GAASA,GAAOllB,UAAYqB,EAC1ConB,GAAgBD,GAAcA,GAAY1oB,QAAUuB,EACpDqnB,GAAiBF,GAAcA,GAAYvoB,SAAWoB,EAyH1D,SAASsnB,GAAO/mB,GACd,GAAIgnB,GAAahnB,KAAWlC,GAAQkC,MAAYA,aAAiBinB,IAAc,CAC7E,GAAIjnB,aAAiBknB,GACnB,OAAOlnB,EAET,GAAI1B,GAAeC,KAAKyB,EAAO,eAC7B,OAAOmnB,GAAannB,EAEvB,CACD,OAAWknB,IAAAA,GAAclnB,EAC1B,CAUD,IAAIonB,GAAc,WAChB,SAAS1e,IACT,CAAA,gBAAgB2e,GACd,IAAKC,GAASD,GACZ,MAAO,CAAA,EAET,GAAI1D,GACF,OAAOA,GAAa0D,GAEtB3e,EAAOtK,UAAYipB,EACnB,IAAIzJ,EAAS,IAAIlV,EAEjB,OADAA,EAAOtK,UAAYqB,EACZme,CACR,CACF,CAdiB,GAqBlB,SAAS2J,KAER,CASD,SAASL,GAAclnB,EAAOwnB,GAC5B3lB,KAAK4lB,YAAcznB,EACnB6B,KAAK6lB,YAAc,GACnB7lB,KAAK8lB,YAAcH,EACnB3lB,KAAK+lB,UAAY,EACjB/lB,KAAKgmB,WAAapoB,CACnB,CA+ED,SAASwnB,GAAYjnB,GACnB6B,KAAK4lB,YAAcznB,EACnB6B,KAAK6lB,YAAc,GACnB7lB,KAAKimB,QAAU,EACfjmB,KAAKkmB,cAAe,EACpBlmB,KAAKmmB,cAAgB,GACrBnmB,KAAKomB,cAAgBxT,EACrB5S,KAAKqmB,UAAY,EAClB,CA+GD,SAASC,GAAKlX,GACZ,IAAIgB,GAAS,EACTvU,EAAoB,MAAXuT,EAAkB,EAAIA,EAAQvT,OAG3C,IADAmE,KAAKumB,UACInW,EAAQvU,GAAQ,CACvB,IAAI6P,EAAQ0D,EAAQgB,GACpBpQ,KAAKsf,IAAI5T,EAAM,GAAIA,EAAM,GAC1B,CACF,CA+FD,SAAS8a,GAAUpX,GACjB,IAAIgB,GAAS,EACTvU,EAAoB,MAAXuT,EAAkB,EAAIA,EAAQvT,OAG3C,IADAmE,KAAKumB,UACInW,EAAQvU,GAAQ,CACvB,IAAI6P,EAAQ0D,EAAQgB,GACpBpQ,KAAKsf,IAAI5T,EAAM,GAAIA,EAAM,GAC1B,CACF,CA4GD,SAAS+a,GAASrX,GAChB,IAAIgB,GAAS,EACTvU,EAAoB,MAAXuT,EAAkB,EAAIA,EAAQvT,OAG3C,IADAmE,KAAKumB,UACInW,EAAQvU,GAAQ,CACvB,IAAI6P,EAAQ0D,EAAQgB,GACpBpQ,KAAKsf,IAAI5T,EAAM,GAAIA,EAAM,GAC1B,CACF,CA+FD,SAASgb,GAASpK,GAChB,IAAIlM,GAAS,EACTvU,EAAmB,MAAVygB,EAAiB,EAAIA,EAAOzgB,OAGzC,IADAmE,KAAK2mB,SAAW,IAAIF,KACXrW,EAAQvU,GACfmE,KAAKY,IAAI0b,EAAOlM,GAEnB,CA2CD,SAASnI,GAAMmH,GACb,IAAIwX,EAAO5mB,KAAK2mB,SAAW,IAAIH,GAAUpX,GACzCpP,KAAK4M,KAAOga,EAAKha,IAClB,CAoGD,SAASia,GAAc1oB,EAAO2oB,GAC5B,IAAI1pB,EAAQnB,GAAQkC,GAChB4oB,GAAS3pB,GAAS4pB,GAAY7oB,GAC9B8oB,GAAU7pB,IAAU2pB,GAASzD,GAASnlB,GACtC+oB,GAAU9pB,IAAU2pB,IAAUE,GAAU/L,GAAa/c,GACrDgpB,EAAc/pB,GAAS2pB,GAASE,GAAUC,EAC1CnL,EAASoL,EAAcxJ,GAAUxf,EAAMtC,OAAQ4kB,IAAU,GACzD5kB,EAASkgB,EAAOlgB,OAEpB,IAAK,IAAIc,KAAOwB,GACT2oB,IAAarqB,GAAeC,KAAKyB,EAAOxB,IACvCwqB,IAEQ,UAAPxqB,GAECsqB,IAAkB,UAAPtqB,GAA0B,UAAPA,IAE9BuqB,IAAkB,UAAPvqB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDyqB,GAAQzqB,EAAKd,KAElBkgB,EAAOrY,KAAK/G,GAGhB,OAAOof,CACR,CASD,SAASsL,GAAYpgB,GACnB,IAAIpL,EAASoL,EAAMpL,OACnB,OAAOA,EAASoL,EAAMqgB,GAAW,EAAGzrB,EAAS,IAAM+B,CACpD,CAUD,SAAS2pB,GAAgBtgB,EAAO2W,GAC9B,OAAO4J,GAAYC,GAAUxgB,GAAQygB,GAAU9J,EAAG,EAAG3W,EAAMpL,QAC5D,CASD,SAAS8rB,GAAa1gB,GACpB,OAAOugB,GAAYC,GAAUxgB,GAC9B,CAWD,SAAS2gB,GAAiB/gB,EAAQlK,EAAKwB,IAChCA,IAAUP,IAAciqB,GAAGhhB,EAAOlK,GAAMwB,IACxCA,IAAUP,KAAejB,KAAOkK,KACnCihB,GAAgBjhB,EAAQlK,EAAKwB,EAEhC,CAYD,SAAS4pB,GAAYlhB,EAAQlK,EAAKwB,GAChC,IAAI6pB,EAAWnhB,EAAOlK,GAChBF,GAAeC,KAAKmK,EAAQlK,IAAQkrB,GAAGG,EAAU7pB,KAClDA,IAAUP,GAAejB,KAAOkK,IACnCihB,GAAgBjhB,EAAQlK,EAAKwB,EAEhC,CAUD,SAAS8pB,GAAahhB,EAAOtK,GAE3B,IADA,IAAId,EAASoL,EAAMpL,OACZA,KACL,GAAIgsB,GAAG5gB,EAAMpL,GAAQ,GAAIc,GACvB,OAAOd,EAGX,OAAQ,CACT,CAaD,SAASqsB,GAAenL,EAAYzB,EAAQC,EAAUC,GAIpD,OAHA2M,GAASpL,GAAY,SAAS5e,EAAOxB,EAAKogB,GACxCzB,EAAOE,EAAard,EAAOod,EAASpd,GAAQ4e,EAC7C,IACMvB,CACR,CAWD,SAAS4M,GAAWvhB,EAAQ1K,GAC1B,OAAO0K,GAAUwhB,GAAWlsB,EAAQJ,GAAKI,GAAS0K,EACnD,CAwBD,SAASihB,GAAgBjhB,EAAQlK,EAAKwB,GACzB,aAAPxB,GAAsB4lB,GACxBA,GAAe1b,EAAQlK,EAAK,CAC1B2rB,cAAgB,EAChBC,YAAc,EACdpqB,MAASA,EACTqqB,UAAY,IAGd3hB,EAAOlK,GAAOwB,CAEjB,CAUD,SAASsqB,GAAO5hB,EAAQ6hB,GAMtB,IALA,IAAItY,GAAS,EACTvU,EAAS6sB,EAAM7sB,OACfkgB,EAAS/f,GAAMH,GACf8sB,EAAiB,MAAV9hB,IAEFuJ,EAAQvU,GACfkgB,EAAO3L,GAASuY,EAAO/qB,EAAYgrB,GAAI/hB,EAAQ6hB,EAAMtY,IAEvD,OAAO2L,CACR,CAWD,SAAS2L,GAAU1gB,EAAQ6hB,EAAOC,GAShC,OARI9hB,GAAWA,IACT8hB,IAAUlrB,IACZoJ,EAASA,GAAU8hB,EAAQ9hB,EAAS8hB,GAElCD,IAAUjrB,IACZoJ,EAASA,GAAU6hB,EAAQ7hB,EAAS6hB,IAGjC7hB,CACR,CAkBD,SAAS+hB,GAAU5qB,EAAO6qB,EAASC,EAAYtsB,EAAKkK,EAAQqiB,GAC1D,IAAInN,EACAoN,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACFlN,EAASlV,EAASoiB,EAAW9qB,EAAOxB,EAAKkK,EAAQqiB,GAASD,EAAW9qB,IAEnE4d,IAAWne,EACb,OAAOme,EAET,IAAK0J,GAAStnB,GACZ,OAAOA,EAET,IAAIf,EAAQnB,GAAQkC,GACpB,GAAIf,GAEF,GADA2e,EA68GJ,SAAwB9U,GACtB,IAAIpL,EAASoL,EAAMpL,OACfkgB,EAAS,IAAI9U,EAAMrL,YAAYC,GAG/BA,GAA6B,iBAAZoL,EAAM,IAAkBxK,GAAeC,KAAKuK,EAAO,WACtE8U,EAAO3L,MAAQnJ,EAAMmJ,MACrB2L,EAAOuN,MAAQriB,EAAMqiB,OAEvB,OAAOvN,CACR,CAv9GYwN,CAAeprB,IACnBgrB,EACH,OAAO1B,GAAUtpB,EAAO4d,OAErB,CACL,IAAIyN,EAAMC,GAAOtrB,GACburB,EAASF,GAAOrW,GAAWqW,GAAOpW,EAEtC,GAAIkQ,GAASnlB,GACX,OAAOwrB,GAAYxrB,EAAOgrB,GAE5B,GAAIK,GAAOjW,GAAaiW,GAAO1W,GAAY4W,IAAW7iB,GAEpD,GADAkV,EAAUqN,GAAUM,EAAU,CAArB,EAA0BE,GAAgBzrB,IAC9CgrB,EACH,OAAOC,EA+nEf,SAAuBjtB,EAAQ0K,GAC7B,OAAOwhB,GAAWlsB,EAAQ0tB,GAAa1tB,GAAS0K,EACjD,CAhoEWijB,CAAc3rB,EAnH1B,SAAsB0I,EAAQ1K,GAC5B,OAAO0K,GAAUwhB,GAAWlsB,EAAQ4tB,GAAO5tB,GAAS0K,EACrD,CAiHgCmjB,CAAajO,EAAQ5d,IAknEtD,SAAqBhC,EAAQ0K,GAC3B,OAAOwhB,GAAWlsB,EAAQ8tB,GAAW9tB,GAAS0K,EAC/C,CAnnEWqjB,CAAY/rB,EAAOiqB,GAAWrM,EAAQ5d,QAEvC,CACL,IAAKgb,GAAcqQ,GACjB,OAAO3iB,EAAS1I,EAAQ,CAAA,EAE1B4d,EA49GN,SAAwBlV,EAAQ2iB,EAAKL,GACnC,IAAIgB,EAAOtjB,EAAOjL,YAClB,OAAQ4tB,GACN,KAAK1V,EACH,OAAOsW,GAAiBvjB,GAE1B,KAAKmM,EACL,KAAKC,EACH,WAAWkX,GAAMtjB,GAEnB,KAAKkN,EACH,OA5nDN,SAAuBsW,EAAUlB,GAC/B,IAAImB,EAASnB,EAASiB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASzuB,YAAY0uB,EAAQD,EAASE,WAAYF,EAASG,WACvE,CAynDYC,CAAc5jB,EAAQsiB,GAE/B,KAAKnV,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OAAOkW,GAAgB7jB,EAAQsiB,GAEjC,KAAK9V,EACH,OAAW8W,IAAAA,EAEb,KAAK7W,EACL,KAAKK,EACH,OAAO,IAAIwW,EAAKtjB,GAElB,KAAK4M,EACH,OA/nDN,SAAqBkX,GACnB,IAAI5O,EAAS,IAAI4O,EAAO/uB,YAAY+uB,EAAOxuB,OAAQ8Z,GAAQiL,KAAKyJ,IAEhE,OADA5O,EAAO0D,UAAYkL,EAAOlL,UACnB1D,CACR,CA2nDY6O,CAAY/jB,GAErB,KAAK6M,EACH,OAAWyW,IAAAA,EAEb,KAAKvW,EACH,OAxnDeiX,EAwnDIhkB,EAvnDhBme,GAAgB1oB,GAAO0oB,GAActoB,KAAKmuB,IAAW,CAA5D,EADF,IAAqBA,CA0nDpB,CA9/GcC,CAAe3sB,EAAOqrB,EAAKL,EACrC,CACF,CAEDD,IAAUA,EAAQ,IAAIjhB,IACtB,IAAI8iB,EAAU7B,EAAMN,IAAIzqB,GACxB,GAAI4sB,EACF,OAAOA,EAET7B,EAAM5J,IAAInhB,EAAO4d,GAEbf,GAAM7c,GACRA,EAAMsC,SAAQ,SAASuqB,GACrBjP,EAAOnb,IAAImoB,GAAUiC,EAAUhC,EAASC,EAAY+B,EAAU7sB,EAAO+qB,GACtE,IACQtO,GAAMzc,IACfA,EAAMsC,SAAQ,SAASuqB,EAAUruB,GAC/Bof,EAAOuD,IAAI3iB,EAAKosB,GAAUiC,EAAUhC,EAASC,EAAYtsB,EAAKwB,EAAO+qB,GACtE,IAGH,IAIItjB,EAAQxI,EAAQQ,GAJLyrB,EACVD,EAAS6B,GAAeC,GACxB9B,EAASW,GAAShuB,IAEkBoC,GASzC,OARAsd,GAAU7V,GAASzH,GAAO,SAAS6sB,EAAUruB,GACvCiJ,IAEFolB,EAAW7sB,EADXxB,EAAMquB,IAIRjD,GAAYhM,EAAQpf,EAAKosB,GAAUiC,EAAUhC,EAASC,EAAYtsB,EAAKwB,EAAO+qB,GAC/E,IACMnN,CACR,CAwBD,SAASoP,GAAetkB,EAAQ1K,EAAQyJ,GACtC,IAAI/J,EAAS+J,EAAM/J,OACnB,GAAc,MAAVgL,EACF,OAAQhL,EAGV,IADAgL,EAASvK,GAAOuK,GACThL,KAAU,CACf,IAAIc,EAAMiJ,EAAM/J,GACZ+f,EAAYzf,EAAOQ,GACnBwB,EAAQ0I,EAAOlK,GAEnB,GAAKwB,IAAUP,KAAejB,KAAOkK,KAAa+U,EAAUzd,GAC1D,QAEH,CACD,OAAO,CACR,CAYD,SAASitB,GAAUhkB,EAAMikB,EAAMjQ,GAC7B,GAAmB,mBAARhU,EACT,MAAM,IAAIsZ,GAAUzO,GAEtB,OAAO6Q,IAAW,WAAa1b,EAAKxD,MAAMhG,EAAWwd,EAAQ,GAAEiQ,EAChE,CAaD,SAASC,GAAerkB,EAAOqV,EAAQf,EAAUY,GAC/C,IAAI/L,GAAS,EACT4B,EAAWgK,GACXuP,GAAW,EACX1vB,EAASoL,EAAMpL,OACfkgB,EAAS,GACTyP,EAAelP,EAAOzgB,OAE1B,IAAKA,EACH,OAAOkgB,EAELR,IACFe,EAASF,GAASE,EAAQ2B,GAAU1C,KAElCY,GACFnK,EAAWkK,GACXqP,GAAW,GAEJjP,EAAOzgB,QAtvFG,MAuvFjBmW,EAAWmM,GACXoN,GAAW,EACXjP,EAAS,IAAIoK,GAASpK,IAExBmP,EACA,OAASrb,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdsb,EAAuB,MAAZnQ,EAAmBpd,EAAQod,EAASpd,GAGnD,GADAA,EAASge,GAAwB,IAAVhe,EAAeA,EAAQ,EAC1CotB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIrP,EAAOqP,KAAiBD,EAC1B,SAASD,EAGb1P,EAAOrY,KAAKvF,EACb,MACS6T,EAASsK,EAAQoP,EAAUvP,IACnCJ,EAAOrY,KAAKvF,EAEf,CACD,OAAO4d,CACR,CAlkCDmJ,GAAO0G,iBAAmB,CAQxBC,OAAU7W,EAQV8W,SAAY7W,EAQZ8W,YAAe7W,EAQf8W,SAAY,GAQZC,QAAW,CAQT1gB,EAAK2Z,KAKTA,GAAO3oB,UAAYmpB,GAAWnpB,UAC9B2oB,GAAO3oB,UAAUX,YAAcspB,GAE/BG,GAAc9oB,UAAYgpB,GAAWG,GAAWnpB,WAChD8oB,GAAc9oB,UAAUX,YAAcypB,GAsHtCD,GAAY7oB,UAAYgpB,GAAWG,GAAWnpB,WAC9C6oB,GAAY7oB,UAAUX,YAAcwpB,GAoGpCkB,GAAK/pB,UAAUgqB,MAvEf,WACEvmB,KAAK2mB,SAAWrC,GAAeA,GAAa,MAAQ,CAAA,EACpDtkB,KAAK4M,KAAO,CACb,EAqED0Z,GAAK/pB,UAAL,OAzDA,SAAoBI,GAClB,IAAIof,EAAS/b,KAAKqe,IAAI1hB,WAAeqD,KAAK2mB,SAAShqB,GAEnD,OADAqD,KAAK4M,MAAQmP,EAAS,EAAI,EACnBA,CACR,EAsDDuK,GAAK/pB,UAAUqsB,IA3Cf,SAAiBjsB,GACf,IAAIiqB,EAAO5mB,KAAK2mB,SAChB,GAAIrC,GAAc,CAChB,IAAIvI,EAAS6K,EAAKjqB,GAClB,OAAOof,IAAW7J,EAAiBtU,EAAYme,CAChD,CACD,OAAOtf,GAAeC,KAAKkqB,EAAMjqB,GAAOiqB,EAAKjqB,GAAOiB,CACrD,EAqCD0oB,GAAK/pB,UAAU8hB,IA1Bf,SAAiB1hB,GACf,IAAIiqB,EAAO5mB,KAAK2mB,SAChB,OAAOrC,GAAgBsC,EAAKjqB,KAASiB,EAAanB,GAAeC,KAAKkqB,EAAMjqB,EAC7E,EAwBD2pB,GAAK/pB,UAAU+iB,IAZf,SAAiB3iB,EAAKwB,GACpB,IAAIyoB,EAAO5mB,KAAK2mB,SAGhB,OAFA3mB,KAAK4M,MAAQ5M,KAAKqe,IAAI1hB,GAAO,EAAI,EACjCiqB,EAAKjqB,GAAQ2nB,IAAgBnmB,IAAUP,EAAasU,EAAiB/T,EACrE6B,IACD,EAwHDwmB,GAAUjqB,UAAUgqB,MApFpB,WACEvmB,KAAK2mB,SAAW,GAChB3mB,KAAK4M,KAAO,CACb,EAkFD4Z,GAAUjqB,UAAV,OAvEA,SAAyBI,GACvB,IAAIiqB,EAAO5mB,KAAK2mB,SACZvW,EAAQ6X,GAAarB,EAAMjqB,GAE/B,QAAIyT,EAAQ,KAIRA,GADYwW,EAAK/qB,OAAS,EAE5B+qB,EAAKsF,MAEL3a,GAAO7U,KAAKkqB,EAAMxW,EAAO,KAEzBpQ,KAAK4M,MACA,EACR,EAyDD4Z,GAAUjqB,UAAUqsB,IA9CpB,SAAsBjsB,GACpB,IAAIiqB,EAAO5mB,KAAK2mB,SACZvW,EAAQ6X,GAAarB,EAAMjqB,GAE/B,OAAOyT,EAAQ,EAAIxS,EAAYgpB,EAAKxW,GAAO,EAC5C,EA0CDoW,GAAUjqB,UAAU8hB,IA/BpB,SAAsB1hB,GACpB,OAAOsrB,GAAajoB,KAAK2mB,SAAUhqB,IAAQ,CAC5C,EA8BD6pB,GAAUjqB,UAAU+iB,IAlBpB,SAAsB3iB,EAAKwB,GACzB,IAAIyoB,EAAO5mB,KAAK2mB,SACZvW,EAAQ6X,GAAarB,EAAMjqB,GAQ/B,OANIyT,EAAQ,KACRpQ,KAAK4M,KACPga,EAAKljB,KAAK,CAAC/G,EAAKwB,KAEhByoB,EAAKxW,GAAO,GAAKjS,EAEZ6B,IACR,EA0GDymB,GAASlqB,UAAUgqB,MAtEnB,WACEvmB,KAAK4M,KAAO,EACZ5M,KAAK2mB,SAAW,CACdwF,KAAQ,IAAI7F,GACZ5f,IAAO,IAAKyd,IAAOqC,IACnBpkB,OAAU,IAAIkkB,GAEjB,EAgEDG,GAASlqB,UAAT,OArDA,SAAwBI,GACtB,IAAIof,EAASqQ,GAAWpsB,KAAMrD,GAAjB,OAAgCA,GAE7C,OADAqD,KAAK4M,MAAQmP,EAAS,EAAI,EACnBA,CACR,EAkDD0K,GAASlqB,UAAUqsB,IAvCnB,SAAqBjsB,GACnB,OAAOyvB,GAAWpsB,KAAMrD,GAAKisB,IAAIjsB,EAClC,EAsCD8pB,GAASlqB,UAAU8hB,IA3BnB,SAAqB1hB,GACnB,OAAOyvB,GAAWpsB,KAAMrD,GAAK0hB,IAAI1hB,EAClC,EA0BD8pB,GAASlqB,UAAU+iB,IAdnB,SAAqB3iB,EAAKwB,GACxB,IAAIyoB,EAAOwF,GAAWpsB,KAAMrD,GACxBiQ,EAAOga,EAAKha,KAIhB,OAFAga,EAAKtH,IAAI3iB,EAAKwB,GACd6B,KAAK4M,MAAQga,EAAKha,MAAQA,EAAO,EAAI,EACrC5M,IACD,EA0DD0mB,GAASnqB,UAAUqE,IAAM8lB,GAASnqB,UAAUmH,KAnB5C,SAAqBvF,GAEnB,OADA6B,KAAK2mB,SAASrH,IAAInhB,EAAO+T,GAClBlS,IACR,EAiBD0mB,GAASnqB,UAAU8hB,IANnB,SAAqBlgB,GACnB,OAAYwoB,KAAAA,SAAStI,IAAIlgB,EAC1B,EAsGD8J,GAAM1L,UAAUgqB,MA3EhB,WACEvmB,KAAK2mB,SAAW,IAAIH,GACpBxmB,KAAK4M,KAAO,CACb,EAyED3E,GAAM1L,UAAN,OA9DA,SAAqBI,GACnB,IAAIiqB,EAAO5mB,KAAK2mB,SACZ5K,EAAS6K,EAAI,OAAWjqB,GAG5B,OADAqD,KAAK4M,KAAOga,EAAKha,KACVmP,CACR,EAyDD9T,GAAM1L,UAAUqsB,IA9ChB,SAAkBjsB,GAChB,OAAYgqB,KAAAA,SAASiC,IAAIjsB,EAC1B,EA6CDsL,GAAM1L,UAAU8hB,IAlChB,SAAkB1hB,GAChB,OAAYgqB,KAAAA,SAAStI,IAAI1hB,EAC1B,EAiCDsL,GAAM1L,UAAU+iB,IArBhB,SAAkB3iB,EAAKwB,GACrB,IAAIyoB,EAAO5mB,KAAK2mB,SAChB,GAAIC,aAAgBJ,GAAW,CAC7B,IAAI6F,EAAQzF,EAAKD,SACjB,IAAKxC,IAAQkI,EAAMxwB,OAASywB,IAG1B,OAFAD,EAAM3oB,KAAK,CAAC/G,EAAKwB,IACjB6B,KAAK4M,OAASga,EAAKha,UAGrBga,EAAO5mB,KAAK2mB,SAAW,IAAIF,GAAS4F,EACrC,CAGD,OAFAzF,EAAKtH,IAAI3iB,EAAKwB,GACd6B,KAAK4M,KAAOga,EAAKha,KACjB5M,IACD,EAqcD,IAAImoB,GAAWoE,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU5P,EAAYnB,GAC7B,IAAIG,GAAS,EAKb,OAJAoM,GAASpL,GAAY,SAAS5e,EAAOiS,EAAO2M,GAE1C,OADAhB,IAAWH,EAAUzd,EAAOiS,EAAO2M,EAEpC,IACMhB,CACR,CAYD,SAAS6Q,GAAa3lB,EAAOsU,EAAUY,GAIrC,IAHA,IAAI/L,GAAS,EACTvU,EAASoL,EAAMpL,SAEVuU,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACd7R,EAAUgd,EAASpd,GAEvB,GAAe,MAAXI,IAAoBmtB,IAAa9tB,EAC5BW,GAAYA,IAAYsuB,GAAStuB,GAClC4d,EAAW5d,EAASmtB,IAE1B,IAAIA,EAAWntB,EACXwd,EAAS5d,CAEhB,CACD,OAAO4d,CACR,CAsCD,SAAS+Q,GAAW/P,EAAYnB,GAC9B,IAAIG,EAAS,GAMb,OALAoM,GAASpL,GAAY,SAAS5e,EAAOiS,EAAO2M,GACtCnB,EAAUzd,EAAOiS,EAAO2M,IAC1BhB,EAAOrY,KAAKvF,EAEf,IACM4d,CACR,CAaD,SAASgR,GAAY9lB,EAAO+lB,EAAOpR,EAAWqR,EAAUlR,GACtD,IAAI3L,GAAS,EACTvU,EAASoL,EAAMpL,OAKnB,IAHA+f,IAAcA,EAAYsR,IAC1BnR,IAAWA,EAAS,MAEX3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACd4c,EAAQ,GAAKpR,EAAUzd,GACrB6uB,EAAQ,EAEVD,GAAY5uB,EAAO6uB,EAAQ,EAAGpR,EAAWqR,EAAUlR,GAEnDM,GAAUN,EAAQ5d,GAEV8uB,IACVlR,EAAOA,EAAOlgB,QAAUsC,EAE3B,CACD,OAAO4d,CACR,CAaD,IAAIoR,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAW3lB,EAAQ0U,GAC1B,OAAO1U,GAAUsmB,GAAQtmB,EAAQ0U,EAAUxf,GAC5C,CAUD,SAAS2wB,GAAgB7lB,EAAQ0U,GAC/B,OAAO1U,GAAUwmB,GAAaxmB,EAAQ0U,EAAUxf,GACjD,CAWD,SAASuxB,GAAczmB,EAAQjB,GAC7B,OAAOiW,GAAYjW,GAAO,SAASjJ,GACjC,OAAO4wB,GAAW1mB,EAAOlK,GAC1B,GACF,CAUD,SAAS6wB,GAAQ3mB,EAAQ4mB,GAMvB,IAHA,IAAIrd,EAAQ,EACRvU,GAHJ4xB,EAAOC,GAASD,EAAM5mB,IAGJhL,OAED,MAAVgL,GAAkBuJ,EAAQvU,GAC/BgL,EAASA,EAAO8mB,GAAMF,EAAKrd,OAE7B,OAAQA,GAASA,GAASvU,EAAUgL,EAASjJ,CAC9C,CAaD,SAASgwB,GAAe/mB,EAAQgnB,EAAUC,GACxC,IAAI/R,EAAS8R,EAAShnB,GACtB,OAAO5K,GAAQ4K,GAAUkV,EAASM,GAAUN,EAAQ+R,EAAYjnB,GACjE,CASD,SAASknB,GAAW5vB,GAClB,OAAa,MAATA,EACKA,IAAUP,EAn7FJ,qBARL,gBA67FFykB,IAAkBA,MAAkB/lB,GAAO6B,GA23FrD,SAAmBA,GACjB,IAAI6vB,EAAQvxB,GAAeC,KAAKyB,EAAOkkB,IACnCmH,EAAMrrB,EAAMkkB,IAEhB,IACElkB,EAAMkkB,IAAkBzkB,EACxB,IAAIqwB,GAAW,CAChB,CAAC,MAAOnoB,IAET,IAAIiW,EAASqF,GAAqB1kB,KAAKyB,GACnC8vB,IACED,EACF7vB,EAAMkkB,IAAkBmH,SAEjBrrB,EAAMkkB,KAGjB,OAAOtG,CACR,CA54FKmS,CAAU/vB,GA+5GhB,SAAwBA,GACtB,OAAOijB,GAAqB1kB,KAAKyB,EAClC,CAh6GKgwB,CAAehwB,EACpB,CAWD,SAASiwB,GAAOjwB,EAAOkwB,GACrB,OAAOlwB,EAAQkwB,CAChB,CAUD,SAASC,GAAQznB,EAAQlK,GACvB,OAAiB,MAAVkK,GAAkBpK,GAAeC,KAAKmK,EAAQlK,EACtD,CAUD,SAAS4xB,GAAU1nB,EAAQlK,GACzB,OAAiB,MAAVkK,GAAkBlK,KAAOL,GAAOuK,EACxC,CAyBD,SAAS2nB,GAAiBC,EAAQlT,EAAUY,GAS1C,IARA,IAAInK,EAAWmK,EAAaD,GAAoBF,GAC5CngB,EAAS4yB,EAAO,GAAG5yB,OACnB6yB,EAAYD,EAAO5yB,OACnB8yB,EAAWD,EACXE,EAAS5yB,GAAM0yB,GACfG,EAAYC,IACZ/S,EAAS,GAEN4S,KAAY,CACjB,IAAI1nB,EAAQwnB,EAAOE,GACfA,GAAYpT,IACdtU,EAAQmV,GAASnV,EAAOgX,GAAU1C,KAEpCsT,EAAYlL,GAAU1c,EAAMpL,OAAQgzB,GACpCD,EAAOD,IAAaxS,IAAeZ,GAAa1f,GAAU,KAAOoL,EAAMpL,QAAU,KAC7E,IAAI6qB,GAASiI,GAAY1nB,GACzBrJ,CACL,CACDqJ,EAAQwnB,EAAO,GAEf,IAAIre,GAAS,EACT2e,EAAOH,EAAO,GAElBnD,EACA,OAASrb,EAAQvU,GAAUkgB,EAAOlgB,OAASgzB,GAAW,CACpD,IAAI1wB,EAAQ8I,EAAMmJ,GACdsb,EAAWnQ,EAAWA,EAASpd,GAASA,EAG5C,GADAA,EAASge,GAAwB,IAAVhe,EAAeA,EAAQ,IACxC4wB,EACE5Q,GAAS4Q,EAAMrD,GACf1Z,EAAS+J,EAAQ2P,EAAUvP,IAC5B,CAEL,IADAwS,EAAWD,IACFC,GAAU,CACjB,IAAIvQ,EAAQwQ,EAAOD,GACnB,KAAMvQ,EACED,GAASC,EAAOsN,GAChB1Z,EAASyc,EAAOE,GAAWjD,EAAUvP,IAE3C,SAASsP,CAEZ,CACGsD,GACFA,EAAKrrB,KAAKgoB,GAEZ3P,EAAOrY,KAAKvF,EACb,CACF,CACD,OAAO4d,CACR,CA8BD,SAASiT,GAAWnoB,EAAQ4mB,EAAMrS,GAGhC,IAAIhU,EAAiB,OADrBP,EAASooB,GAAOpoB,EADhB4mB,EAAOC,GAASD,EAAM5mB,KAEMA,EAASA,EAAO8mB,GAAMuB,GAAKzB,KACvD,OAAe,MAARrmB,EAAexJ,EAAYgG,GAAMwD,EAAMP,EAAQuU,EACvD,CASD,SAAS+T,GAAgBhxB,GACvB,OAAOgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAU2U,CACpD,CAsCD,SAASsc,GAAYjxB,EAAOkwB,EAAOrF,EAASC,EAAYC,GACtD,OAAI/qB,IAAUkwB,IAGD,MAATlwB,GAA0B,MAATkwB,IAAmBlJ,GAAahnB,KAAWgnB,GAAakJ,GACpElwB,GAAUA,GAASkwB,GAAUA,EAmBxC,SAAyBxnB,EAAQwnB,EAAOrF,EAASC,EAAYoG,EAAWnG,GACtE,IAAIoG,EAAWrzB,GAAQ4K,GACnB0oB,EAAWtzB,GAAQoyB,GACnBmB,EAASF,EAAWvc,EAAW0W,GAAO5iB,GACtC4oB,EAASF,EAAWxc,EAAW0W,GAAO4E,GAKtCqB,GAHJF,EAASA,GAAU1c,EAAUS,EAAYic,IAGhBjc,EACrBoc,GAHJF,EAASA,GAAU3c,EAAUS,EAAYkc,IAGhBlc,EACrBqc,EAAYJ,GAAUC,EAE1B,GAAIG,GAAatM,GAASzc,GAAS,CACjC,IAAKyc,GAAS+K,GACZ,SAEFiB,GAAW,EACXI,GAAW,CACZ,CACD,GAAIE,IAAcF,EAEhB,OADAxG,IAAUA,EAAQ,IAAIjhB,IACdqnB,GAAYpU,GAAarU,GAC7BgpB,GAAYhpB,EAAQwnB,EAAOrF,EAASC,EAAYoG,EAAWnG,GA81EnE,SAAoBriB,EAAQwnB,EAAO7E,EAAKR,EAASC,EAAYoG,EAAWnG,GACtE,OAAQM,GACN,KAAKzV,EACH,GAAKlN,EAAO2jB,YAAc6D,EAAM7D,YAC3B3jB,EAAO0jB,YAAc8D,EAAM9D,WAC9B,OAAA,EAEF1jB,EAASA,EAAOyjB,OAChB+D,EAAQA,EAAM/D,OAEhB,KAAKxW,EACH,QAAKjN,EAAO2jB,YAAc6D,EAAM7D,aAC3B6E,EAAU,IAAI3N,GAAW7a,GAAS,IAAI6a,GAAW2M,KAKxD,KAAKrb,EACL,KAAKC,EACL,KAAKK,EAGH,OAAOuU,IAAIhhB,GAASwnB,GAEtB,KAAKnb,EACH,OAAOrM,EAAOpC,MAAQ4pB,EAAM5pB,MAAQoC,EAAOd,SAAWsoB,EAAMtoB,QAE9D,KAAK0N,EACL,KAAKE,EAIH,OAAO9M,GAAWwnB,EAAQ,GAE5B,KAAKhb,EACH,IAAIyc,EAAU9Q,GAEhB,KAAKtL,EACH,IAAIqc,EAxnLe,EAwnLH/G,EAGhB,GAFA8G,IAAYA,EAAUzQ,IAElBxY,EAAO+F,MAAQyhB,EAAMzhB,OAASmjB,EAChC,OAAA,EAGF,IAAIhF,EAAU7B,EAAMN,IAAI/hB,GACxB,GAAIkkB,EACF,OAAOA,GAAWsD,EAEpBrF,GAloLqB,EAqoLrBE,EAAM5J,IAAIzY,EAAQwnB,GAClB,IAAItS,EAAS8T,GAAYC,EAAQjpB,GAASipB,EAAQzB,GAAQrF,EAASC,EAAYoG,EAAWnG,GAE1F,OADAA,EAAK,OAAWriB,GACTkV,EAET,KAAKnI,EACH,GAAIoR,GACF,OAAOA,GAActoB,KAAKmK,IAAWme,GAActoB,KAAK2xB,GAG9D,OAAO,CACR,CA55EO2B,CAAWnpB,EAAQwnB,EAAOmB,EAAQxG,EAASC,EAAYoG,EAAWnG,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAIiH,EAAeP,GAAYjzB,GAAeC,KAAKmK,EAAQ,eACvDqpB,EAAeP,GAAYlzB,GAAeC,KAAK2xB,EAAO,eAE1D,GAAI4B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAeppB,EAAO1I,QAAU0I,EAC/CupB,EAAeF,EAAe7B,EAAMlwB,QAAUkwB,EAGlD,OADAnF,IAAUA,EAAQ,IAAIjhB,IACfonB,EAAUc,EAAcC,EAAcpH,EAASC,EAAYC,EACnE,CACF,CACD,IAAK0G,EACH,OAAA,EAGF,OADA1G,IAAUA,EAAQ,IAAIjhB,IA05ExB,SAAsBpB,EAAQwnB,EAAOrF,EAASC,EAAYoG,EAAWnG,GACnE,IAAI6G,EAjqLmB,EAiqLP/G,EACZqH,EAAWnF,GAAWrkB,GACtBypB,EAAYD,EAASx0B,OACrB00B,EAAWrF,GAAWmD,GACtBK,EAAY6B,EAAS10B,OAEzB,GAAIy0B,GAAa5B,IAAcqB,EAC7B,SAEF,IAAI3f,EAAQkgB,EACZ,KAAOlgB,KAAS,CACd,IAAIzT,EAAM0zB,EAASjgB,GACnB,KAAM2f,EAAYpzB,KAAO0xB,EAAQ5xB,GAAeC,KAAK2xB,EAAO1xB,IAC1D,OAAO,CAEV,CAED,IAAI6zB,EAAatH,EAAMN,IAAI/hB,GACvB4pB,EAAavH,EAAMN,IAAIyF,GAC3B,GAAImC,GAAcC,EAChB,OAAOD,GAAcnC,GAASoC,GAAc5pB,EAE9C,IAAIkV,GAAS,EACbmN,EAAM5J,IAAIzY,EAAQwnB,GAClBnF,EAAM5J,IAAI+O,EAAOxnB,GAEjB,IAAI6pB,EAAWX,EACf,OAAS3f,EAAQkgB,GAAW,CAE1B,IAAItI,EAAWnhB,EADflK,EAAM0zB,EAASjgB,IAEXugB,EAAWtC,EAAM1xB,GAErB,GAAIssB,EACF,IAAI2H,EAAWb,EACX9G,EAAW0H,EAAU3I,EAAUrrB,EAAK0xB,EAAOxnB,EAAQqiB,GACnDD,EAAWjB,EAAU2I,EAAUh0B,EAAKkK,EAAQwnB,EAAOnF,GAGzD,KAAM0H,IAAahzB,EACVoqB,IAAa2I,GAAYtB,EAAUrH,EAAU2I,EAAU3H,EAASC,EAAYC,GAC7E0H,GACD,CACL7U,GAAS,EACT,KACD,CACD2U,IAAaA,EAAkB,eAAP/zB,EACzB,CACD,GAAIof,IAAW2U,EAAU,CACvB,IAAIG,EAAUhqB,EAAOjL,YACjBk1B,EAAUzC,EAAMzyB,YAGhBi1B,GAAWC,KACV,gBAAiBjqB,MAAU,gBAAiBwnB,IACzB,mBAAXwC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD/U,GAAS,EAEZ,CAGD,OAFAmN,EAAK,OAAWriB,GAChBqiB,EAAK,OAAWmF,GACTtS,CACR,CAx9EQgV,CAAalqB,EAAQwnB,EAAOrF,EAASC,EAAYoG,EAAWnG,EACpE,CA5DQ8H,CAAgB7yB,EAAOkwB,EAAOrF,EAASC,EAAYmG,GAAalG,GACxE,CAkFD,SAAS+H,GAAYpqB,EAAQ1K,EAAQ+0B,EAAWjI,GAC9C,IAAI7Y,EAAQ8gB,EAAUr1B,OAClBA,EAASuU,EACT+gB,GAAgBlI,EAEpB,GAAc,MAAVpiB,EACF,OAAQhL,EAGV,IADAgL,EAASvK,GAAOuK,GACTuJ,KAAS,CACd,IAAIwW,EAAOsK,EAAU9gB,GACrB,GAAK+gB,GAAgBvK,EAAK,GAClBA,EAAK,KAAO/f,EAAO+f,EAAK,MACtBA,EAAK,KAAM/f,GAEnB,OAAA,CAEH,CACD,OAASuJ,EAAQvU,GAAQ,CAEvB,IAAIc,GADJiqB,EAAOsK,EAAU9gB,IACF,GACX4X,EAAWnhB,EAAOlK,GAClBy0B,EAAWxK,EAAK,GAEpB,GAAIuK,GAAgBvK,EAAK,IACvB,GAAIoB,IAAapqB,KAAejB,KAAOkK,GACrC,OAAO,MAEJ,CACL,IAAIqiB,EAAQ,IAAIjhB,GAChB,GAAIghB,EACF,IAAIlN,EAASkN,EAAWjB,EAAUoJ,EAAUz0B,EAAKkK,EAAQ1K,EAAQ+sB,GAEnE,KAAMnN,IAAWne,EACTwxB,GAAYgC,EAAUpJ,EAAUqJ,EAA+CpI,EAAYC,GAC3FnN,GAEN,OAAA,CAEH,CACF,CACD,OAAA,CACD,CAUD,SAASuV,GAAanzB,GACpB,SAAKsnB,GAAStnB,KA05FEiJ,EA15FiBjJ,EA25FxB8iB,IAAeA,MAAc7Z,MAx5FxBmmB,GAAWpvB,GAASojB,GAAanL,IAChC2I,KAAK2F,GAASvmB,IAs5F/B,IAAkBiJ,CAr5FjB,CA2CD,SAASmqB,GAAapzB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKqzB,GAEW,iBAATrzB,EACFlC,GAAQkC,GACXszB,GAAoBtzB,EAAM,GAAIA,EAAM,IACpCuzB,GAAYvzB,GAEXwzB,GAASxzB,EACjB,CASD,SAASyzB,GAAS/qB,GAChB,IAAKgrB,GAAYhrB,GACf,OAAO4c,GAAW5c,GAEpB,IAAIkV,EAAS,GACb,IAAK,IAAIpf,KAAOL,GAAOuK,GACjBpK,GAAeC,KAAKmK,EAAQlK,IAAe,eAAPA,GACtCof,EAAOrY,KAAK/G,GAGhB,OAAOof,CACR,CASD,SAAS+V,GAAWjrB,GAClB,IAAK4e,GAAS5e,GACZ,OA09FJ,SAAsBA,GACpB,IAAIkV,EAAS,GACb,GAAc,MAAVlV,EACF,IAAK,IAAIlK,KAAOL,GAAOuK,GACrBkV,EAAOrY,KAAK/G,GAGhB,OAAOof,CACR,CAl+FUgW,CAAalrB,GAEtB,IAAImrB,EAAUH,GAAYhrB,GACtBkV,EAAS,GAEb,IAAK,IAAIpf,KAAOkK,GACD,eAAPlK,IAAyBq1B,GAAYv1B,GAAeC,KAAKmK,EAAQlK,KACrEof,EAAOrY,KAAK/G,GAGhB,OAAOof,CACR,CAWD,SAASkW,GAAO9zB,EAAOkwB,GACrB,OAAOlwB,EAAQkwB,CAChB,CAUD,SAAS6D,GAAQnV,EAAYxB,GAC3B,IAAInL,GAAS,EACT2L,EAASoW,GAAYpV,GAAc/gB,GAAM+gB,EAAWlhB,QAAU,GAKlE,OAHAssB,GAASpL,GAAY,SAAS5e,EAAOxB,EAAKogB,GACxChB,IAAS3L,GAASmL,EAASpd,EAAOxB,EAAKogB,EACxC,IACMhB,CACR,CASD,SAAS2V,GAAYv1B,GACnB,IAAI+0B,EAAYkB,GAAaj2B,GAC7B,OAAwB,GAApB+0B,EAAUr1B,QAAeq1B,EAAU,GAAG,GACjCmB,GAAwBnB,EAAU,GAAG,GAAIA,EAAU,GAAG,aAE/CrqB,GACd,OAAOA,IAAW1K,GAAU80B,GAAYpqB,EAAQ1K,EAAQ+0B,EACzD,CACF,CAUD,SAASO,GAAoBhE,EAAM2D,GACjC,OAAIkB,GAAM7E,IAAS8E,GAAmBnB,GAC7BiB,GAAwB1E,GAAMF,GAAO2D,GAE9BvqB,SAAAA,GACd,IAAImhB,EAAWY,GAAI/hB,EAAQ4mB,GAC3B,OAAQzF,IAAapqB,GAAaoqB,IAAaoJ,EAC3CoB,GAAM3rB,EAAQ4mB,GACd2B,GAAYgC,EAAUpJ,EAAUqJ,EACrC,CACF,CAaD,SAASoB,GAAU5rB,EAAQ1K,EAAQu2B,EAAUzJ,EAAYC,GACnDriB,IAAW1K,GAGfgxB,GAAQhxB,GAAQ,SAASi1B,EAAUz0B,GAEjC,GADAusB,IAAUA,EAAQ,IAAIjhB,IAClBwd,GAAS2L,IA+BjB,SAAuBvqB,EAAQ1K,EAAQQ,EAAK+1B,EAAUC,EAAW1J,EAAYC,GAC3E,IAAIlB,EAAW4K,GAAQ/rB,EAAQlK,GAC3By0B,EAAWwB,GAAQz2B,EAAQQ,GAC3BouB,EAAU7B,EAAMN,IAAIwI,GAExB,GAAIrG,EAEF,YADAnD,GAAiB/gB,EAAQlK,EAAKouB,GAGhC,IAAIpsB,EAAWsqB,EACXA,EAAWjB,EAAUoJ,EAAWz0B,EAAM,GAAKkK,EAAQ1K,EAAQ+sB,GAC3DtrB,EAEA2tB,EAAW5sB,IAAaf,EAE5B,GAAI2tB,EAAU,CACZ,IAAInuB,EAAQnB,GAAQm1B,GAChBnK,GAAU7pB,GAASkmB,GAAS8N,GAC5ByB,GAAWz1B,IAAU6pB,GAAU/L,GAAakW,GAEhDzyB,EAAWyyB,EACPh0B,GAAS6pB,GAAU4L,EACjB52B,GAAQ+rB,GACVrpB,EAAWqpB,EAEJ8K,GAAkB9K,GACzBrpB,EAAW8oB,GAAUO,GAEdf,GACPsE,GAAW,EACX5sB,EAAWgrB,GAAYyH,GAAU,IAE1ByB,GACPtH,GAAW,EACX5sB,EAAW+rB,GAAgB0G,GAAU,IAGrCzyB,EAAW,GAGNo0B,GAAc3B,IAAapK,GAAYoK,IAC9CzyB,EAAWqpB,EACPhB,GAAYgB,GACdrpB,EAAWq0B,GAAchL,GAEjBvC,GAASuC,KAAauF,GAAWvF,KACzCrpB,EAAWirB,GAAgBwH,KAI7B7F,GAAW,CAEd,CACGA,IAEFrC,EAAM5J,IAAI8R,EAAUzyB,GACpBg0B,EAAUh0B,EAAUyyB,EAAUsB,EAAUzJ,EAAYC,GACpDA,EAAK,OAAWkI,IAElBxJ,GAAiB/gB,EAAQlK,EAAKgC,EAC/B,CA1FKs0B,CAAcpsB,EAAQ1K,EAAQQ,EAAK+1B,EAAUD,GAAWxJ,EAAYC,OAEjE,CACH,IAAIvqB,EAAWsqB,EACXA,EAAW2J,GAAQ/rB,EAAQlK,GAAMy0B,EAAWz0B,EAAM,GAAKkK,EAAQ1K,EAAQ+sB,GACvEtrB,EAEAe,IAAaf,IACfe,EAAWyyB,GAEbxJ,GAAiB/gB,EAAQlK,EAAKgC,EAC/B,CACF,GAAEorB,GACJ,CAuFD,SAASmJ,GAAQjsB,EAAO2W,GACtB,IAAI/hB,EAASoL,EAAMpL,OACnB,GAAKA,EAIL,OAAOurB,GADPxJ,GAAKA,EAAI,EAAI/hB,EAAS,EACJA,GAAUoL,EAAM2W,GAAKhgB,CACxC,CAWD,SAASu1B,GAAYpW,EAAYqW,EAAWC,GAExCD,EADEA,EAAUv3B,OACAugB,GAASgX,GAAW,SAAS7X,GACvC,OAAItf,GAAQsf,GACMpd,SAAAA,GACd,OAAOqvB,GAAQrvB,EAA2B,IAApBod,EAAS1f,OAAe0f,EAAS,GAAKA,EAC7D,EAEIA,CACR,IAEW,CAACiW,IAGf,IAAIphB,GAAS,EACbgjB,EAAYhX,GAASgX,EAAWnV,GAAUqV,OAE1C,IAAIvX,EAASmW,GAAQnV,GAAY,SAAS5e,EAAOxB,EAAKogB,GACpD,IAAIwW,EAAWnX,GAASgX,GAAW,SAAS7X,GAC1C,OAAOA,EAASpd,EACjB,IACD,MAAO,CAAEo1B,SAAYA,EAAUnjB,QAAWA,EAAOjS,MAASA,EAC3D,IAED,OA5xFJ,SAAoB8I,EAAOusB,GACzB,IAAI33B,EAASoL,EAAMpL,OAGnB,IADAoL,EAAMsG,KAAKimB,GACJ33B,KACLoL,EAAMpL,GAAUoL,EAAMpL,GAAQsC,MAEhC,OAAO8I,CACR,CAoxFUwsB,CAAW1X,GAAQ,SAASlV,EAAQwnB,GACzC,OA04BJ,SAAyBxnB,EAAQwnB,EAAOgF,GACtC,IAAIjjB,GAAS,EACTsjB,EAAc7sB,EAAO0sB,SACrBI,EAActF,EAAMkF,SACpB13B,EAAS63B,EAAY73B,OACrB+3B,EAAeP,EAAOx3B,OAE1B,OAASuU,EAAQvU,GAAQ,CACvB,IAAIkgB,EAAS8X,GAAiBH,EAAYtjB,GAAQujB,EAAYvjB,IAC9D,GAAI2L,EACF,OAAI3L,GAASwjB,EACJ7X,EAGFA,GAAmB,QADdsX,EAAOjjB,IACiB,EAAI,EAE3C,CAQD,OAAOvJ,EAAOuJ,MAAQie,EAAMje,KAC7B,CAn6BU0jB,CAAgBjtB,EAAQwnB,EAAOgF,EACvC,GACF,CA0BD,SAASU,GAAWltB,EAAQ6hB,EAAO9M,GAKjC,IAJA,IAAIxL,GAAS,EACTvU,EAAS6sB,EAAM7sB,OACfkgB,EAAS,CAAA,IAEJ3L,EAAQvU,GAAQ,CACvB,IAAI4xB,EAAO/E,EAAMtY,GACbjS,EAAQqvB,GAAQ3mB,EAAQ4mB,GAExB7R,EAAUzd,EAAOsvB,IACnBuG,GAAQjY,EAAQ2R,GAASD,EAAM5mB,GAAS1I,EAE3C,CACD,OAAO4d,CACR,CA0BD,SAASkY,GAAYhtB,EAAOqV,EAAQf,EAAUY,GAC5C,IAAI+X,EAAU/X,EAAamB,GAAkBrB,GACzC7L,GAAS,EACTvU,EAASygB,EAAOzgB,OAChBkzB,EAAO9nB,EAQX,IANIA,IAAUqV,IACZA,EAASmL,GAAUnL,IAEjBf,IACFwT,EAAO3S,GAASnV,EAAOgX,GAAU1C,OAE1BnL,EAAQvU,GAKf,IAJA,IAAIqhB,EAAY,EACZ/e,EAAQme,EAAOlM,GACfsb,EAAWnQ,EAAWA,EAASpd,GAASA,GAEpC+e,EAAYgX,EAAQnF,EAAMrD,EAAUxO,EAAWf,KAAgB,GACjE4S,IAAS9nB,GACXsK,GAAO7U,KAAKqyB,EAAM7R,EAAW,GAE/B3L,GAAO7U,KAAKuK,EAAOiW,EAAW,GAGlC,OAAOjW,CACR,CAWD,SAASktB,GAAWltB,EAAOmtB,GAIzB,IAHA,IAAIv4B,EAASoL,EAAQmtB,EAAQv4B,OAAS,EAClC4jB,EAAY5jB,EAAS,EAElBA,KAAU,CACf,IAAIuU,EAAQgkB,EAAQv4B,GACpB,GAAIA,GAAU4jB,GAAarP,IAAUikB,EAAU,CAC7C,IAAIA,EAAWjkB,EACXgX,GAAQhX,GACVmB,GAAO7U,KAAKuK,EAAOmJ,EAAO,GAE1BkkB,GAAUrtB,EAAOmJ,EAEpB,CACF,CACD,OAAOnJ,CACR,CAWD,SAASqgB,GAAWuB,EAAOC,GACzB,OAAOD,EAAQ5F,GAAYa,MAAkBgF,EAAQD,EAAQ,GAC9D,CAiCD,SAAS0L,GAAWnyB,EAAQwb,GAC1B,IAAI7B,EAAS,GACb,IAAK3Z,GAAUwb,EAAI,GAAKA,EAAIlL,EAC1B,OAAOqJ,EAIT,GACM6B,EAAI,IACN7B,GAAU3Z,IAEZwb,EAAIqF,GAAYrF,EAAI,MAElBxb,GAAUA,SAELwb,GAET,OAAO7B,CACR,CAUD,SAASyY,GAASptB,EAAMoB,GACtB,OAAOisB,GAAYC,GAASttB,EAAMoB,EAAOgpB,IAAWpqB,EAAO,GAC5D,CASD,SAASutB,GAAW5X,GAClB,OAAOsK,GAAY/K,GAAOS,GAC3B,CAUD,SAAS6X,GAAe7X,EAAYa,GAClC,IAAI3W,EAAQqV,GAAOS,GACnB,OAAOyK,GAAYvgB,EAAOygB,GAAU9J,EAAG,EAAG3W,EAAMpL,QACjD,CAYD,SAASm4B,GAAQntB,EAAQ4mB,EAAMtvB,EAAO8qB,GACpC,IAAKxD,GAAS5e,GACZ,OAAOA,EAST,IALA,IAAIuJ,GAAS,EACTvU,GAHJ4xB,EAAOC,GAASD,EAAM5mB,IAGJhL,OACd4jB,EAAY5jB,EAAS,EACrBg5B,EAAShuB,EAEI,MAAVguB,KAAoBzkB,EAAQvU,GAAQ,CACzC,IAAIc,EAAMgxB,GAAMF,EAAKrd,IACjBzR,EAAWR,EAEf,GAAY,cAARxB,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOkK,EAGT,GAAIuJ,GAASqP,EAAW,CACtB,IAAIuI,EAAW6M,EAAOl4B,IACtBgC,EAAWsqB,EAAaA,EAAWjB,EAAUrrB,EAAKk4B,GAAUj3B,KAC3CA,IACfe,EAAW8mB,GAASuC,GAChBA,EACCZ,GAAQqG,EAAKrd,EAAQ,IAAM,GAAK,GAExC,CACD2X,GAAY8M,EAAQl4B,EAAKgC,GACzBk2B,EAASA,EAAOl4B,EACjB,CACD,OAAOkK,CACR,CAUD,IAAIiuB,GAAevQ,GAAqB,SAASnd,EAAMwf,GAErD,OADArC,GAAQjF,IAAIlY,EAAMwf,GACXxf,CACR,EAH4BoqB,GAazBuD,GAAmBxS,GAA4B,SAASnb,EAAMhF,GAChE,OAAOmgB,GAAenb,EAAM,WAAY,CACtCkhB,cAAgB,EAChBC,YAAc,EACdpqB,MAAS62B,GAAS5yB,GAClBomB,UAAY,GAEf,EAPuCgJ,GAgBxC,SAASyD,GAAYlY,GACnB,OAAOyK,GAAYlL,GAAOS,GAC3B,CAWD,SAASmY,GAAUjuB,EAAOuB,EAAOE,GAC/B,IAAI0H,GAAS,EACTvU,EAASoL,EAAMpL,OAEf2M,EAAQ,IACVA,GAASA,EAAQ3M,EAAS,EAAKA,EAAS2M,IAE1CE,EAAMA,EAAM7M,EAASA,EAAS6M,GACpB,IACRA,GAAO7M,GAETA,EAAS2M,EAAQE,EAAM,EAAMA,EAAMF,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIuT,EAAS/f,GAAMH,KACVuU,EAAQvU,GACfkgB,EAAO3L,GAASnJ,EAAMmJ,EAAQ5H,GAEhC,OAAOuT,CACR,CAWD,SAASoZ,GAASpY,EAAYnB,GAC5B,IAAIG,EAMJ,OAJAoM,GAASpL,GAAY,SAAS5e,EAAOiS,EAAO2M,GAE1C,QADAhB,EAASH,EAAUzd,EAAOiS,EAAO2M,GAElC,MACQhB,CACV,CAcD,SAASqZ,GAAgBnuB,EAAO9I,EAAOk3B,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATtuB,EAAgBquB,EAAMruB,EAAMpL,OAEvC,GAAoB,iBAATsC,GAAqBA,GAAUA,GAASo3B,GAn/H3B3iB,WAm/H0D,CAChF,KAAO0iB,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB7J,EAAWzkB,EAAMuuB,GAEJ,OAAb9J,IAAsBmB,GAASnB,KAC9B2J,EAAc3J,GAAYvtB,EAAUutB,EAAWvtB,GAClDm3B,EAAME,EAAM,EAEZD,EAAOC,CAEV,CACD,OAAOD,CACR,CACD,OAAOE,GAAkBxuB,EAAO9I,EAAOqzB,GAAU6D,EAClD,CAeD,SAASI,GAAkBxuB,EAAO9I,EAAOod,EAAU8Z,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATtuB,EAAgB,EAAIA,EAAMpL,OACrC,GAAa,IAAT05B,EACF,OAAA,EASF,IALA,IAAIG,GADJv3B,EAAQod,EAASpd,KACQA,EACrBw3B,EAAsB,OAAVx3B,EACZy3B,EAAc/I,GAAS1uB,GACvB03B,EAAiB13B,IAAUP,EAExB03B,EAAMC,GAAM,CACjB,IAAIC,EAAMvS,IAAaqS,EAAMC,GAAQ,GACjC7J,EAAWnQ,EAAStU,EAAMuuB,IAC1BM,EAAepK,IAAa9tB,EAC5Bm4B,EAAyB,OAAbrK,EACZsK,EAAiBtK,GAAaA,EAC9BuK,EAAcpJ,GAASnB,GAE3B,GAAIgK,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAc3J,GAAYvtB,EAAUutB,EAAWvtB,GAEtD+3B,EACFZ,EAAME,EAAM,EAEZD,EAAOC,CAEV,CACD,OAAO7R,GAAU4R,EA1jIC3iB,WA2jInB,CAWD,SAASujB,GAAelvB,EAAOsU,GAM7B,IALA,IAAInL,GAAS,EACTvU,EAASoL,EAAMpL,OACfigB,EAAW,EACXC,EAAS,KAEJ3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdsb,EAAWnQ,EAAWA,EAASpd,GAASA,EAE5C,IAAKiS,IAAUyX,GAAG6D,EAAUqD,GAAO,CACjC,IAAIA,EAAOrD,EACX3P,EAAOD,KAAwB,IAAV3d,EAAc,EAAIA,CACxC,CACF,CACD,OAAO4d,CACR,CAUD,SAASqa,GAAaj4B,GACpB,MAAoB,iBAATA,EACFA,EAEL0uB,GAAS1uB,GACJwU,GAEDxU,CACT,CAUD,SAASk4B,GAAal4B,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIlC,GAAQkC,GAEV,OAAOie,GAASje,EAAOk4B,IAAgB,GAEzC,GAAIxJ,GAAS1uB,GACX,OAAO8mB,GAAiBA,GAAevoB,KAAKyB,GAAS,GAEvD,IAAI4d,EAAU5d,EAAQ,GACtB,MAAkB,KAAV4d,GAAkB,EAAI5d,IAAU,IAAa,KAAO4d,CAC7D,CAWD,SAASua,GAASrvB,EAAOsU,EAAUY,GACjC,IAAI/L,GAAS,EACT4B,EAAWgK,GACXngB,EAASoL,EAAMpL,OACf0vB,GAAW,EACXxP,EAAS,GACTgT,EAAOhT,EAEX,GAAII,EACFoP,GAAW,EACXvZ,EAAWkK,QAEJrgB,GAAAA,GAjtIU,IAitIkB,CACnC,IAAIyjB,EAAM/D,EAAW,KAAOgb,GAAUtvB,GACtC,GAAIqY,EACF,OAAOD,GAAWC,GAEpBiM,GAAW,EACXvZ,EAAWmM,GACX4Q,EAAO,IAAIrI,EACZ,MAECqI,EAAOxT,EAAW,GAAKQ,EAEzB0P,EACA,OAASrb,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdsb,EAAWnQ,EAAWA,EAASpd,GAASA,EAG5C,GADAA,EAASge,GAAwB,IAAVhe,EAAeA,EAAQ,EAC1CotB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAI8K,EAAYzH,EAAKlzB,OACd26B,KACL,GAAIzH,EAAKyH,KAAe9K,EACtB,SAASD,EAGTlQ,GACFwT,EAAKrrB,KAAKgoB,GAEZ3P,EAAOrY,KAAKvF,EACb,MACS6T,EAAS+c,EAAMrD,EAAUvP,KAC7B4S,IAAShT,GACXgT,EAAKrrB,KAAKgoB,GAEZ3P,EAAOrY,KAAKvF,GAEf,CACD,OAAO4d,CACR,CAUD,SAASuY,GAAUztB,EAAQ4mB,GAGzB,OAAiB,OADjB5mB,EAASooB,GAAOpoB,EADhB4mB,EAAOC,GAASD,EAAM5mB,aAEUA,EAAO8mB,GAAMuB,GAAKzB,IACnD,CAYD,SAASgJ,GAAW5vB,EAAQ4mB,EAAMptB,EAAS4oB,GACzC,OAAO+K,GAAQntB,EAAQ4mB,EAAMptB,EAAQmtB,GAAQ3mB,EAAQ4mB,IAAQxE,EAC9D,CAaD,SAASyN,GAAUzvB,EAAO2U,EAAW+a,EAAQxZ,GAI3C,IAHA,IAAIthB,EAASoL,EAAMpL,OACfuU,EAAQ+M,EAAYthB,GAAU,GAE1BshB,EAAY/M,MAAYA,EAAQvU,IACtC+f,EAAU3U,EAAMmJ,GAAQA,EAAOnJ,KAEjC,OAAO0vB,EACHzB,GAAUjuB,EAAQkW,EAAY,EAAI/M,EAAS+M,EAAY/M,EAAQ,EAAIvU,GACnEq5B,GAAUjuB,EAAQkW,EAAY/M,EAAQ,EAAI,EAAK+M,EAAYthB,EAASuU,EACzE,CAYD,SAASwmB,GAAiBz4B,EAAO04B,GAC/B,IAAI9a,EAAS5d,EAIb,OAHI4d,aAAkBqJ,KACpBrJ,EAASA,EAAO5d,SAEXqe,GAAYqa,GAAS,SAAS9a,EAAQ+a,GAC3C,OAAOA,EAAO1vB,KAAKxD,MAAMkzB,EAAO3b,QAASkB,GAAU,CAACN,GAAS+a,EAAO1b,MACrE,GAAEW,EACJ,CAYD,SAASgb,GAAQtI,EAAQlT,EAAUY,GACjC,IAAItgB,EAAS4yB,EAAO5yB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASy6B,GAAS7H,EAAO,IAAM,GAKxC,IAHA,IAAIre,GAAS,EACT2L,EAAS/f,GAAMH,KAEVuU,EAAQvU,GAIf,IAHA,IAAIoL,EAAQwnB,EAAOre,GACfue,GAAY,IAEPA,EAAW9yB,GACd8yB,GAAYve,IACd2L,EAAO3L,GAASkb,GAAevP,EAAO3L,IAAUnJ,EAAOwnB,EAAOE,GAAWpT,EAAUY,IAIzF,OAAOma,GAASvJ,GAAYhR,EAAQ,GAAIR,EAAUY,EACnD,CAWD,SAAS6a,GAAcpxB,EAAO0W,EAAQ2a,GAMpC,IALA,IAAI7mB,GAAS,EACTvU,EAAS+J,EAAM/J,OACfq7B,EAAa5a,EAAOzgB,OACpBkgB,EAAS,CAAA,IAEJ3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQiS,EAAQ8mB,EAAa5a,EAAOlM,GAASxS,EACjDq5B,EAAWlb,EAAQnW,EAAMwK,GAAQjS,EAClC,CACD,OAAO4d,CACR,CASD,SAASob,GAAoBh5B,GAC3B,OAAO20B,GAAkB30B,GAASA,EAAQ,EAC3C,CASD,SAASi5B,GAAaj5B,GACpB,MAAuB,mBAATA,EAAsBA,EAAQqzB,EAC7C,CAUD,SAAS9D,GAASvvB,EAAO0I,GACvB,OAAI5K,GAAQkC,GACHA,EAEFm0B,GAAMn0B,EAAO0I,GAAU,CAAC1I,GAASk5B,GAAa76B,GAAS2B,GAC/D,CAWD,IAAIm5B,GAAW9C,GAWf,SAAS+C,GAAUtwB,EAAOuB,EAAOE,GAC/B,IAAI7M,EAASoL,EAAMpL,OAEnB,OADA6M,EAAMA,IAAQ9K,EAAY/B,EAAS6M,GAC1BF,GAASE,GAAO7M,EAAUoL,EAAQiuB,GAAUjuB,EAAOuB,EAAOE,EACpE,CAQD,IAAIga,GAAeD,IAAmB,SAAS3X,GAC7C,OAAO6O,GAAK+I,aAAa5X,EAC1B,EAUD,SAAS6e,GAAYW,EAAQnB,GAC3B,GAAIA,EACF,OAAOmB,EAAOxM,QAEhB,IAAIjiB,EAASyuB,EAAOzuB,OAChBkgB,EAAS4F,GAAcA,GAAY9lB,GAAU,IAAIyuB,EAAO1uB,YAAYC,GAGxE,OADAyuB,EAAOkN,KAAKzb,GACLA,CACR,CASD,SAASqO,GAAiBqN,GACxB,IAAI1b,EAAS,IAAI0b,EAAY77B,YAAY67B,EAAYjN,YAErD,OADA,IAAI9I,GAAW3F,GAAQuD,IAAI,IAAIoC,GAAW+V,IACnC1b,CACR,CA+CD,SAAS2O,GAAgBgN,EAAYvO,GACnC,IAAImB,EAASnB,EAASiB,GAAiBsN,EAAWpN,QAAUoN,EAAWpN,OACvE,OAAO,IAAIoN,EAAW97B,YAAY0uB,EAAQoN,EAAWnN,WAAYmN,EAAW77B,OAC7E,CAUD,SAASg4B,GAAiB11B,EAAOkwB,GAC/B,GAAIlwB,IAAUkwB,EAAO,CACnB,IAAIsJ,EAAex5B,IAAUP,EACzB+3B,EAAsB,OAAVx3B,EACZy5B,EAAiBz5B,GAAUA,EAC3By3B,EAAc/I,GAAS1uB,GAEvB23B,EAAezH,IAAUzwB,EACzBm4B,EAAsB,OAAV1H,EACZ2H,EAAiB3H,GAAUA,EAC3B4H,EAAcpJ,GAASwB,GAE3B,IAAM0H,IAAcE,IAAgBL,GAAez3B,EAAQkwB,GACtDuH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B2B,GAAgB3B,IACjB4B,EACH,OAAA,EAEF,IAAMjC,IAAcC,IAAgBK,GAAe93B,EAAQkwB,GACtD4H,GAAe0B,GAAgBC,IAAmBjC,IAAcC,GAChEG,GAAa4B,GAAgBC,IAC5B9B,GAAgB8B,IACjB5B,EACH,OAAQ,CAEX,CACD,OAAO,CACR,CAsDD,SAAS6B,GAAYzc,EAAM0c,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAa9c,EAAKvf,OAClBs8B,EAAgBJ,EAAQl8B,OACxBu8B,GAAa,EACbC,EAAaP,EAASj8B,OACtBy8B,EAAc5U,GAAUwU,EAAaC,EAAe,GACpDpc,EAAS/f,GAAMq8B,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBtc,EAAOqc,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7Bnc,EAAOgc,EAAQE,IAAc7c,EAAK6c,IAGtC,KAAOK,KACLvc,EAAOqc,KAAehd,EAAK6c,KAE7B,OAAOlc,CACR,CAaD,SAASyc,GAAiBpd,EAAM0c,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAa9c,EAAKvf,OAClB48B,GAAgB,EAChBN,EAAgBJ,EAAQl8B,OACxB68B,GAAc,EACdC,EAAcb,EAASj8B,OACvBy8B,EAAc5U,GAAUwU,EAAaC,EAAe,GACpDpc,EAAS/f,GAAMs8B,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBvc,EAAOkc,GAAa7c,EAAK6c,GAG3B,IADA,IAAI1b,EAAS0b,IACJS,EAAaC,GACpB5c,EAAOQ,EAASmc,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7Bnc,EAAOQ,EAASwb,EAAQU,IAAiBrd,EAAK6c,MAGlD,OAAOlc,CACR,CAUD,SAAS0L,GAAUtrB,EAAQ8K,GACzB,IAAImJ,GAAS,EACTvU,EAASM,EAAON,OAGpB,IADAoL,IAAUA,EAAQjL,GAAMH,MACfuU,EAAQvU,GACfoL,EAAMmJ,GAASjU,EAAOiU,GAExB,OAAOnJ,CACR,CAYD,SAASohB,GAAWlsB,EAAQyJ,EAAOiB,EAAQoiB,GACzC,IAAI2P,GAAS/xB,EACbA,IAAWA,EAAS,CAAA,GAKpB,IAHA,IAAIuJ,GAAS,EACTvU,EAAS+J,EAAM/J,SAEVuU,EAAQvU,GAAQ,CACvB,IAAIc,EAAMiJ,EAAMwK,GAEZzR,EAAWsqB,EACXA,EAAWpiB,EAAOlK,GAAMR,EAAOQ,GAAMA,EAAKkK,EAAQ1K,GAClDyB,EAEAe,IAAaf,IACfe,EAAWxC,EAAOQ,IAEhBi8B,EACF9Q,GAAgBjhB,EAAQlK,EAAKgC,GAE7BopB,GAAYlhB,EAAQlK,EAAKgC,EAE5B,CACD,OAAOkI,CACR,CAkCD,SAASgyB,GAAiBvd,EAAQwd,GAChC,OAAO,SAAS/b,EAAYxB,GAC1B,IAAInU,EAAOnL,GAAQ8gB,GAAc1B,GAAkB6M,GAC/C1M,EAAcsd,EAAcA,IAAgB,CADhD,EAGA,OAAO1xB,EAAK2V,EAAYzB,EAAQgY,GAAY/X,EAAU,GAAIC,EAC3D,CACF,CASD,SAASud,GAAeC,GACtB,OAAOxE,IAAS,SAAS3tB,EAAQoyB,GAC/B,IAAI7oB,GAAS,EACTvU,EAASo9B,EAAQp9B,OACjBotB,EAAaptB,EAAS,EAAIo9B,EAAQp9B,EAAS,GAAK+B,EAChDs7B,EAAQr9B,EAAS,EAAIo9B,EAAQ,GAAKr7B,EAWtC,IATAqrB,EAAc+P,EAASn9B,OAAS,GAA0B,mBAAdotB,GACvCptB,IAAUotB,GACXrrB,EAEAs7B,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDjQ,EAAaptB,EAAS,EAAI+B,EAAYqrB,EACtCptB,EAAS,GAEXgL,EAASvK,GAAOuK,KACPuJ,EAAQvU,GAAQ,CACvB,IAAIM,EAAS88B,EAAQ7oB,GACjBjU,GACF68B,EAASnyB,EAAQ1K,EAAQiU,EAAO6Y,EAEnC,CACD,OAAOpiB,CACR,GACF,CAUD,SAAS0lB,GAAevP,EAAUG,GAChC,OAAO,SAASJ,EAAYxB,GAC1B,GAAkB,MAAdwB,EACF,OAAOA,EAET,IAAKoV,GAAYpV,GACf,OAAOC,EAASD,EAAYxB,GAM9B,IAJA,IAAI1f,EAASkhB,EAAWlhB,OACpBuU,EAAQ+M,EAAYthB,GAAU,EAC9Bu9B,EAAW98B,GAAOygB,IAEdI,EAAY/M,MAAYA,EAAQvU,KACa,IAA/C0f,EAAS6d,EAAShpB,GAAQA,EAAOgpB,KAIvC,OAAOrc,CACR,CACF,CASD,SAASqQ,GAAcjQ,GACrB,OAAO,SAAStW,EAAQ0U,EAAUsS,GAMhC,IALA,IAAIzd,GAAS,EACTgpB,EAAW98B,GAAOuK,GAClBjB,EAAQioB,EAAShnB,GACjBhL,EAAS+J,EAAM/J,OAEZA,KAAU,CACf,IAAIc,EAAMiJ,EAAMuX,EAAYthB,IAAWuU,GACvC,IAA+C,IAA3CmL,EAAS6d,EAASz8B,GAAMA,EAAKy8B,GAC/B,KAEH,CACD,OAAOvyB,CACR,CACF,CA8BD,SAASwyB,GAAgBC,GACvB,OAAO,SAASl3B,GAGd,IAAImc,EAAaO,GAFjB1c,EAAS5F,GAAS4F,IAGdud,GAAcvd,GACdxE,EAEAihB,EAAMN,EACNA,EAAW,GACXnc,EAAO4d,OAAO,GAEduZ,EAAWhb,EACXgZ,GAAUhZ,EAAY,GAAG1a,KAAK,IAC9BzB,EAAO0b,MAAM,GAEjB,OAAOe,EAAIya,KAAgBC,CAC5B,CACF,CASD,SAASC,GAAiBC,GACxB,OAAgBr3B,SAAAA,GACd,OAAOoa,GAAYkd,GAAMC,GAAOv3B,GAAQ4b,QAAQtF,GAAQ,KAAM+gB,EAAU,GACzE,CACF,CAUD,SAASG,GAAWzP,GAClB,OAAO,WAIL,IAAI/O,EAAOzd,UACX,OAAQyd,EAAKvf,QACX,KAAA,EAAQ,OAAO,IAAIsuB,EACnB,KAAK,EAAG,OAAWA,IAAAA,EAAK/O,EAAK,IAC7B,KAAA,EAAQ,OAAO,IAAI+O,EAAK/O,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAW+O,IAAAA,EAAK/O,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAA,EAAQ,OAAO,IAAI+O,EAAK/O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAA,EAAQ,OAAO,IAAI+O,EAAK/O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAW+O,IAAAA,EAAK/O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAW+O,IAAAA,EAAK/O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIye,EAActU,GAAW4E,EAAK5tB,WAC9Bwf,EAASoO,EAAKvmB,MAAMi2B,EAAaze,GAIrC,OAAOqK,GAAS1J,GAAUA,EAAS8d,CACpC,CACF,CA8CD,SAASC,GAAWC,GAClB,OAAgBhd,SAAAA,EAAYnB,EAAWsB,GACrC,IAAIkc,EAAW98B,GAAOygB,GACtB,IAAKoV,GAAYpV,GAAa,CAC5B,IAAIxB,EAAW+X,GAAY1X,EAAW,GACtCmB,EAAahhB,GAAKghB,GAClBnB,EAAY,SAASjf,GAAO,OAAO4e,EAAS6d,EAASz8B,GAAMA,EAAKy8B,EAAY,CAC7E,CACD,IAAIhpB,EAAQ2pB,EAAchd,EAAYnB,EAAWsB,GACjD,OAAO9M,GAAS,EAAIgpB,EAAS7d,EAAWwB,EAAW3M,GAASA,GAASxS,CACtE,CACF,CASD,SAASo8B,GAAW7c,GAClB,OAAO8c,IAAS,SAASC,GACvB,IAAIr+B,EAASq+B,EAAMr+B,OACfuU,EAAQvU,EACRs+B,EAAS9U,GAAc9oB,UAAU69B,KAKrC,IAHIjd,GACF+c,EAAMjW,UAED7T,KAAS,CACd,IAAIhJ,EAAO8yB,EAAM9pB,GACjB,GAAmB,mBAARhJ,EACT,UAAUsZ,GAAUzO,GAEtB,GAAIkoB,IAAWE,GAAgC,WAArBC,GAAYlzB,GACpC,IAAIizB,EAAU,IAAIhV,GAAc,IAAI,EAEvC,CAED,IADAjV,EAAQiqB,EAAUjqB,EAAQvU,IACjBuU,EAAQvU,GAAQ,CAGvB,IAAI0+B,EAAWD,GAFflzB,EAAO8yB,EAAM9pB,IAGTwW,EAAmB,WAAZ2T,EAAwBC,GAAQpzB,GAAQxJ,EAMjDy8B,EAJEzT,GAAQ6T,GAAW7T,EAAK,KACtB,KAAAA,EAAK,KACJA,EAAK,GAAG/qB,QAAqB,GAAX+qB,EAAK,GAElByT,EAAQC,GAAY1T,EAAK,KAAKhjB,MAAMy2B,EAASzT,EAAK,IAElC,GAAfxf,EAAKvL,QAAe4+B,GAAWrzB,GACtCizB,EAAQE,KACRF,EAAQD,KAAKhzB,EAEpB,CACD,OAAO,WACL,IAAIgU,EAAOzd,UACPQ,EAAQid,EAAK,GAEjB,GAAIif,GAA0B,GAAfjf,EAAKvf,QAAeI,GAAQkC,GACzC,OAAOk8B,EAAQK,MAAMv8B,GAAOA,QAK9B,IAHA,IAAIiS,EAAQ,EACR2L,EAASlgB,EAASq+B,EAAM9pB,GAAOxM,MAAM5D,KAAMob,GAAQjd,IAE9CiS,EAAQvU,GACfkgB,EAASme,EAAM9pB,GAAO1T,KAAKsD,KAAM+b,GAEnC,OAAOA,CACR,CACF,GACF,CAqBD,SAAS4e,GAAavzB,EAAM4hB,EAAS7N,EAAS2c,EAAUC,EAAS6C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EAAQjS,EAAUzW,EAClB2oB,EA5iKa,EA4iKJlS,EACTmS,EA5iKiB,EA4iKLnS,EACZgP,EAAuBoD,GAAXpS,EACZqS,EAtiKa,IAsiKJrS,EACTmB,EAAOgR,EAAYv9B,EAAYg8B,GAAWxyB,GA6C9C,OA3CA,SAASizB,IAKP,IAJA,IAAIx+B,EAAS8B,UAAU9B,OACnBuf,EAAOpf,GAAMH,GACbuU,EAAQvU,EAELuU,KACLgL,EAAKhL,GAASzS,UAAUyS,GAE1B,GAAI4nB,EACF,IAAI5Y,EAAckc,GAAUjB,GACxBkB,EAvhIZ,SAAsBt0B,EAAOmY,GAI3B,IAHA,IAAIvjB,EAASoL,EAAMpL,OACfkgB,EAAS,EAENlgB,KACDoL,EAAMpL,KAAYujB,KAClBrD,EAGN,OAAOA,CACR,CA6gI0Byf,CAAapgB,EAAMgE,GASxC,GAPI0Y,IACF1c,EAAOyc,GAAYzc,EAAM0c,EAAUC,EAASC,IAE1C4C,IACFxf,EAAOod,GAAiBpd,EAAMwf,EAAeC,EAAc7C,IAE7Dn8B,GAAU0/B,EACNvD,GAAan8B,EAASm/B,EAAO,CAC/B,IAAIS,EAAatc,GAAe/D,EAAMgE,GACtC,OAAOsc,GACLt0B,EAAM4hB,EAAS2R,GAAcN,EAAQjb,YAAajE,EAClDC,EAAMqgB,EAAYX,EAAQC,EAAKC,EAAQn/B,EAE1C,CACD,IAAIg+B,EAAcqB,EAAS/f,EAAUnb,KACjCQ,EAAK26B,EAAYtB,EAAYzyB,GAAQA,EAczC,OAZAvL,EAASuf,EAAKvf,OACVi/B,EACF1f,EAg4CN,SAAiBnU,EAAOmtB,GACtB,IAAIuH,EAAY10B,EAAMpL,OAClBA,EAAS8nB,GAAUyQ,EAAQv4B,OAAQ8/B,GACnCC,EAAWnU,GAAUxgB,GAEzB,KAAOpL,KAAU,CACf,IAAIuU,EAAQgkB,EAAQv4B,GACpBoL,EAAMpL,GAAUurB,GAAQhX,EAAOurB,GAAaC,EAASxrB,GAASxS,CAC/D,CACD,OAAOqJ,CACR,CA14CY40B,CAAQzgB,EAAM0f,GACZO,GAAUx/B,EAAS,GAC5Buf,EAAK6I,UAEHgX,GAASF,EAAMl/B,IACjBuf,EAAKvf,OAASk/B,GAEZ/6B,MAAQA,OAAS2Z,IAAQ3Z,gBAAgBq6B,IAC3C75B,EAAK2pB,GAAQyP,GAAWp5B,IAEnBA,EAAGoD,MAAMi2B,EAAaze,EAC9B,CAEF,CAUD,SAAS0gB,GAAexgB,EAAQygB,GAC9B,OAAgBl1B,SAAAA,EAAQ0U,GACtB,OAh/DJ,SAAsB1U,EAAQyU,EAAQC,EAAUC,GAI9C,OAHAgR,GAAW3lB,GAAQ,SAAS1I,EAAOxB,EAAKkK,GACtCyU,EAAOE,EAAaD,EAASpd,GAAQxB,EAAKkK,EAC3C,IACM2U,CACR,CA2+DUwgB,CAAan1B,EAAQyU,EAAQygB,EAAWxgB,GAAW,CAAvC,EACpB,CACF,CAUD,SAAS0gB,GAAoBC,EAAUt3B,GACrC,OAAgBzG,SAAAA,EAAOkwB,GACrB,IAAItS,EACJ,GAAI5d,IAAUP,GAAaywB,IAAUzwB,EACnC,OAAOgH,EAKT,GAHIzG,IAAUP,IACZme,EAAS5d,GAEPkwB,IAAUzwB,EAAW,CACvB,GAAIme,IAAWne,EACb,OAAOywB,EAEW,iBAATlwB,GAAqC,iBAATkwB,GACrClwB,EAAQk4B,GAAal4B,GACrBkwB,EAAQgI,GAAahI,KAErBlwB,EAAQi4B,GAAaj4B,GACrBkwB,EAAQ+H,GAAa/H,IAEvBtS,EAASmgB,EAAS/9B,EAAOkwB,EAC1B,CACD,OAAOtS,CACR,CACF,CASD,SAASogB,GAAWC,GAClB,OAAOnC,IAAS,SAAS7G,GAEvB,OADAA,EAAYhX,GAASgX,EAAWnV,GAAUqV,OACnCkB,IAAS,SAASpZ,GACvB,IAAID,EAAUnb,KACd,OAAOo8B,EAAUhJ,GAAW,SAAS7X,GACnC,OAAO3X,GAAM2X,EAAUJ,EAASC,EACjC,GACF,GACF,GACF,CAWD,SAASihB,GAAcxgC,EAAQygC,GAG7B,IAAIC,GAFJD,EAAQA,IAAU1+B,EAAY,IAAMy4B,GAAaiG,IAEzBzgC,OACxB,GAAI0gC,EAAc,EAChB,OAAOA,EAAchI,GAAW+H,EAAOzgC,GAAUygC,EAEnD,IAAIvgB,EAASwY,GAAW+H,EAAOvZ,GAAWlnB,EAAS2jB,GAAW8c,KAC9D,OAAOxd,GAAWwd,GACd/E,GAAU5X,GAAc5D,GAAS,EAAGlgB,GAAQgI,KAAK,IACjDkY,EAAO+B,MAAM,EAAGjiB,EACrB,CA4CD,SAAS2gC,GAAYrf,GACnB,OAAO,SAAS3U,EAAOE,EAAKc,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB2vB,GAAe3wB,EAAOE,EAAKc,KAChEd,EAAMc,EAAO5L,GAGf4K,EAAQi0B,GAASj0B,GACbE,IAAQ9K,GACV8K,EAAMF,EACNA,EAAQ,GAERE,EAAM+zB,GAAS/zB,GA57CrB,SAAmBF,EAAOE,EAAKc,EAAM2T,GAKnC,IAJA,IAAI/M,GAAS,EACTvU,EAAS6nB,GAAUX,IAAYra,EAAMF,IAAUgB,GAAQ,IAAK,GAC5DuS,EAAS/f,GAAMH,GAEZA,KACLkgB,EAAOoB,EAAYthB,IAAWuU,GAAS5H,EACvCA,GAASgB,EAEX,OAAOuS,CACR,CAq7CU2gB,CAAUl0B,EAAOE,EADxBc,EAAOA,IAAS5L,EAAa4K,EAAQE,EAAM,GAAK,EAAK+zB,GAASjzB,GAC3B2T,EACpC,CACF,CASD,SAASwf,GAA0BT,GACjC,OAAO,SAAS/9B,EAAOkwB,GAKrB,MAJsB,iBAATlwB,GAAqC,iBAATkwB,IACvClwB,EAAQy+B,GAASz+B,GACjBkwB,EAAQuO,GAASvO,IAEZ6N,EAAS/9B,EAAOkwB,EACxB,CACF,CAmBD,SAASqN,GAAct0B,EAAM4hB,EAAS6T,EAAUzd,EAAajE,EAAS2c,EAAUC,EAAS+C,EAAQC,EAAKC,GACpG,IAAI8B,EArxKc,EAqxKJ9T,EAMdA,GAAY8T,EAAUzqB,EAAoBC,EA5xKlB,GA6xKxB0W,KAAa8T,EAAUxqB,EAA0BD,MAG/C2W,IAAW,GAEb,IAAI+T,EAAU,CACZ31B,EAAM4hB,EAAS7N,EAVC2hB,EAAUhF,EAAWl6B,EAFtBk/B,EAAU/E,EAAUn6B,EAGdk/B,EAAUl/B,EAAYk6B,EAFvBgF,EAAUl/B,EAAYm6B,EAYzB+C,EAAQC,EAAKC,GAG5Bjf,EAAS8gB,EAASj5B,MAAMhG,EAAWm/B,GAKvC,OAJItC,GAAWrzB,IACb41B,GAAQjhB,EAAQghB,GAElBhhB,EAAOqD,YAAcA,EACd6d,GAAgBlhB,EAAQ3U,EAAM4hB,EACtC,CASD,SAASkU,GAAY5D,GACnB,IAAIlyB,EAAOoZ,GAAK8Y,GAChB,OAAO,SAAStyB,EAAQm2B,GAGtB,GAFAn2B,EAAS41B,GAAS51B,IAClBm2B,EAAyB,MAAbA,EAAoB,EAAIxZ,GAAUyZ,GAAUD,GAAY,OACnD5Z,GAAevc,GAAS,CAGvC,IAAIq2B,GAAQ7gC,GAASwK,GAAU,KAAK8Y,MAAM,KAI1C,SADAud,GAAQ7gC,GAFI4K,EAAKi2B,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKrd,MAAM,MACvB,GAAK,MAAQud,EAAK,GAAKF,GACtC,CACD,OAAO/1B,EAAKJ,EACb,CACF,CASD,IAAIuvB,GAAcp2B,IAAQ,EAAIkf,GAAW,IAAIlf,GAAI,CAAA,EAAG,KAAK,IAAOsS,EAAmB,SAAS6J,GAC1F,OAAO,IAAInc,GAAImc,EAChB,EAF2EghB,GAW5E,SAASC,GAAc1P,GACrB,OAAgBhnB,SAAAA,GACd,IAAI2iB,EAAMC,GAAO5iB,GACjB,OAAI2iB,GAAOnW,EACF2L,GAAWnY,GAEhB2iB,GAAO9V,EACF6L,GAAW1Y,GAn6I1B,SAAqBA,EAAQjB,GAC3B,OAAOwW,GAASxW,GAAO,SAASjJ,GAC9B,MAAO,CAACA,EAAKkK,EAAOlK,GACrB,GACF,CAi6IY6gC,CAAY32B,EAAQgnB,EAAShnB,GACrC,CACF,CA2BD,SAAS42B,GAAWr2B,EAAM4hB,EAAS7N,EAAS2c,EAAUC,EAAS+C,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KLnS,EAChB,IAAKmS,GAA4B,mBAAR/zB,EACvB,MAAM,IAAIsZ,GAAUzO,GAEtB,IAAIpW,EAASi8B,EAAWA,EAASj8B,OAAS,EAS1C,GARKA,IACHmtB,IAAW,GACX8O,EAAWC,EAAUn6B,GAEvBm9B,EAAMA,IAAQn9B,EAAYm9B,EAAMrX,GAAU0Z,GAAUrC,GAAM,GAC1DC,EAAQA,IAAUp9B,EAAYo9B,EAAQoC,GAAUpC,GAChDn/B,GAAUk8B,EAAUA,EAAQl8B,OAAS,EAEjCmtB,EAAU1W,EAAyB,CACrC,IAAIsoB,EAAgB9C,EAChB+C,EAAe9C,EAEnBD,EAAWC,EAAUn6B,CACtB,CACD,IAAIgpB,EAAOuU,EAAYv9B,EAAY48B,GAAQpzB,GAEvC21B,EAAU,CACZ31B,EAAM4hB,EAAS7N,EAAS2c,EAAUC,EAAS6C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfIpU,GA26BN,SAAmBA,EAAMzqB,GACvB,IAAI6sB,EAAUpC,EAAK,GACf8W,EAAavhC,EAAO,GACpBwhC,EAAa3U,EAAU0U,EACvBnS,EAAWoS,EAAcC,IAEzBC,EACAH,GAAcnrB,GA50MA,GA40MmByW,GACjC0U,GAAcnrB,GAAmByW,GAAWxW,GAAqBoU,EAAK,GAAG/qB,QAAUM,EAAO,IAChF,KAAVuhC,GAAqDvhC,EAAO,GAAGN,QAAUM,EAAO,IA90MlE,GA80M0E6sB,EAG5F,IAAMuC,IAAYsS,EAChB,OAAOjX,EAr1MQ,EAw1Mb8W,IACF9W,EAAK,GAAKzqB,EAAO,GAEjBwhC,GA31Me,EA21MD3U,EAA2B,EAz1MnB,GA41MxB,IAAI7qB,EAAQhC,EAAO,GACnB,GAAIgC,EAAO,CACT,IAAI25B,EAAWlR,EAAK,GACpBA,EAAK,GAAKkR,EAAWD,GAAYC,EAAU35B,EAAOhC,EAAO,IAAMgC,EAC/DyoB,EAAK,GAAKkR,EAAW3Y,GAAeyH,EAAK,GAAIzU,GAAehW,EAAO,EACpE,CAEDgC,EAAQhC,EAAO,GACXgC,IACF25B,EAAWlR,EAAK,GAChBA,EAAK,GAAKkR,EAAWU,GAAiBV,EAAU35B,EAAOhC,EAAO,IAAMgC,EACpEyoB,EAAK,GAAKkR,EAAW3Y,GAAeyH,EAAK,GAAIzU,GAAehW,EAAO,IAGrEgC,EAAQhC,EAAO,GACXgC,IACFyoB,EAAK,GAAKzoB,GAGRu/B,EAAanrB,IACfqU,EAAK,GAAgB,MAAXA,EAAK,GAAazqB,EAAO,GAAKwnB,GAAUiD,EAAK,GAAIzqB,EAAO,KAGrD,MAAXyqB,EAAK,KACPA,EAAK,GAAKzqB,EAAO,IAGnByqB,EAAK,GAAKzqB,EAAO,GACjByqB,EAAK,GAAK+W,CAGX,CA/9BGG,CAAUf,EAASnW,GAErBxf,EAAO21B,EAAQ,GACf/T,EAAU+T,EAAQ,GAClB5hB,EAAU4hB,EAAQ,GAClBjF,EAAWiF,EAAQ,GACnBhF,EAAUgF,EAAQ,KAClB/B,EAAQ+B,EAAQ,GAAKA,EAAQ,KAAOn/B,EAC/Bu9B,EAAY,EAAI/zB,EAAKvL,OACtB6nB,GAAUqZ,EAAQ,GAAKlhC,EAAQ,QAErBmtB,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGdjN,EA56KgB,GA26KPiN,GAA8BA,GAAW5W,EApgBtD,SAAqBhL,EAAM4hB,EAASgS,GAClC,IAAI7Q,EAAOyP,GAAWxyB,GAwBtB,OAtBA,SAASizB,IAMP,IALA,IAAIx+B,EAAS8B,UAAU9B,OACnBuf,EAAOpf,GAAMH,GACbuU,EAAQvU,EACRujB,EAAckc,GAAUjB,GAErBjqB,KACLgL,EAAKhL,GAASzS,UAAUyS,GAE1B,IAAI2nB,EAAWl8B,EAAS,GAAKuf,EAAK,KAAOgE,GAAehE,EAAKvf,EAAS,KAAOujB,EACzE,GACAD,GAAe/D,EAAMgE,GAGzB,OADAvjB,GAAUk8B,EAAQl8B,QACLm/B,EACJU,GACLt0B,EAAM4hB,EAAS2R,GAAcN,EAAQjb,YAAaxhB,EAClDwd,EAAM2c,EAASn6B,EAAWA,EAAWo9B,EAAQn/B,GAG1C+H,GADG5D,MAAQA,OAAS2Z,IAAQ3Z,gBAAgBq6B,EAAWlQ,EAAO/iB,EACpDpH,KAAMob,EACxB,CAEF,CA2eY2iB,CAAY32B,EAAM4hB,EAASgS,GAC1BhS,GAAW3W,OAAqB2W,GAAqD+O,EAAQl8B,OAG9F8+B,GAAa/2B,MAAMhG,EAAWm/B,GA9O3C,SAAuB31B,EAAM4hB,EAAS7N,EAAS2c,GAC7C,IAAIoD,EAtsKa,EAssKJlS,EACTmB,EAAOyP,GAAWxyB,GAkBtB,OAhBA,SAASizB,IAQP,IAPA,IAAIpC,GAAa,EACbC,EAAav6B,UAAU9B,OACvBu8B,GAAa,EACbC,EAAaP,EAASj8B,OACtBuf,EAAOpf,GAAMq8B,EAAaH,GAC1B13B,EAAMR,MAAQA,OAAS2Z,IAAQ3Z,gBAAgBq6B,EAAWlQ,EAAO/iB,IAE5DgxB,EAAYC,GACnBjd,EAAKgd,GAAaN,EAASM,GAE7B,KAAOF,KACL9c,EAAKgd,KAAez6B,YAAYs6B,GAElC,OAAOr0B,GAAMpD,EAAI06B,EAAS/f,EAAUnb,KAAMob,EAC3C,CAEF,CAuNY4iB,CAAc52B,EAAM4hB,EAAS7N,EAAS2c,QAJ/C,IAAI/b,EAhmBR,SAAoB3U,EAAM4hB,EAAS7N,GACjC,IAAI+f,EA90Ja,EA80JJlS,EACTmB,EAAOyP,GAAWxyB,GAMtB,OAJA,SAASizB,IAEP,OADUr6B,MAAQA,OAAS2Z,IAAQ3Z,gBAAgBq6B,EAAWlQ,EAAO/iB,GAC3DxD,MAAMs3B,EAAS/f,EAAUnb,KAAMrC,UAC1C,CAEF,CAulBgBsgC,CAAW72B,EAAM4hB,EAAS7N,GASzC,OAAO8hB,IADMrW,EAAOkO,GAAckI,IACJjhB,EAAQghB,GAAU31B,EAAM4hB,EACvD,CAcD,SAASkV,GAAuBlW,EAAUoJ,EAAUz0B,EAAKkK,GACvD,OAAImhB,IAAapqB,GACZiqB,GAAGG,EAAUnH,GAAYlkB,MAAUF,GAAeC,KAAKmK,EAAQlK,GAC3Dy0B,EAEFpJ,CACR,CAgBD,SAASmW,GAAoBnW,EAAUoJ,EAAUz0B,EAAKkK,EAAQ1K,EAAQ+sB,GAOpE,OANIzD,GAASuC,IAAavC,GAAS2L,KAEjClI,EAAM5J,IAAI8R,EAAUpJ,GACpByK,GAAUzK,EAAUoJ,EAAUxzB,EAAWugC,GAAqBjV,GAC9DA,EAAK,OAAWkI,IAEXpJ,CACR,CAWD,SAASoW,GAAgBjgC,GACvB,OAAO40B,GAAc50B,GAASP,EAAYO,CAC3C,CAeD,SAAS0xB,GAAY5oB,EAAOonB,EAAOrF,EAASC,EAAYoG,EAAWnG,GACjE,IAAI6G,EApgLmB,EAogLP/G,EACZ2S,EAAY10B,EAAMpL,OAClB6yB,EAAYL,EAAMxyB,OAEtB,GAAI8/B,GAAajN,KAAeqB,GAAarB,EAAYiN,GACvD,OAAA,EAGF,IAAI0C,EAAanV,EAAMN,IAAI3hB,GACvBwpB,EAAavH,EAAMN,IAAIyF,GAC3B,GAAIgQ,GAAc5N,EAChB,OAAO4N,GAAchQ,GAASoC,GAAcxpB,EAE9C,IAAImJ,GAAS,EACT2L,GAAS,EACTgT,EAlhLqB,EAkhLb/F,EAAoC,IAAItC,GAAW9oB,EAM/D,IAJAsrB,EAAM5J,IAAIrY,EAAOonB,GACjBnF,EAAM5J,IAAI+O,EAAOpnB,KAGRmJ,EAAQurB,GAAW,CAC1B,IAAI2C,EAAWr3B,EAAMmJ,GACjBugB,EAAWtC,EAAMje,GAErB,GAAI6Y,EACF,IAAI2H,EAAWb,EACX9G,EAAW0H,EAAU2N,EAAUluB,EAAOie,EAAOpnB,EAAOiiB,GACpDD,EAAWqV,EAAU3N,EAAUvgB,EAAOnJ,EAAOonB,EAAOnF,GAE1D,GAAI0H,IAAahzB,EAAW,CAC1B,GAAIgzB,EACF,SAEF7U,GAAS,EACT,KACD,CAED,GAAIgT,GACF,IAAKpS,GAAU0R,GAAO,SAASsC,EAAUhC,GACnC,IAAKxQ,GAAS4Q,EAAMJ,KACf2P,IAAa3N,GAAYtB,EAAUiP,EAAU3N,EAAU3H,EAASC,EAAYC,IAC/E,OAAO6F,EAAKrrB,KAAKirB,EAEpB,IAAG,CACN5S,GAAS,EACT,KACD,OACQ,GACLuiB,IAAa3N,IACXtB,EAAUiP,EAAU3N,EAAU3H,EAASC,EAAYC,GACpD,CACLnN,GAAS,EACT,KACD,CACF,CAGD,OAFAmN,EAAK,OAAWjiB,GAChBiiB,EAAK,OAAWmF,GACTtS,CACR,CAyKD,SAASke,GAAS7yB,GAChB,OAAOqtB,GAAYC,GAASttB,EAAMxJ,EAAW2gC,IAAUn3B,EAAO,GAC/D,CASD,SAAS8jB,GAAWrkB,GAClB,OAAO+mB,GAAe/mB,EAAQ9K,GAAMkuB,GACrC,CAUD,SAASgB,GAAapkB,GACpB,OAAO+mB,GAAe/mB,EAAQkjB,GAAQF,GACvC,CASD,IAAI2Q,GAAWjW,GAAiB,SAASnd,GACvC,OAAOmd,GAAQqE,IAAIxhB,EACpB,EAFwBk2B,GAWzB,SAAShD,GAAYlzB,GAKnB,IAJA,IAAI2U,EAAU3U,EAAK3C,KAAO,GACtBwC,EAAQud,GAAUzI,GAClBlgB,EAASY,GAAeC,KAAK8nB,GAAWzI,GAAU9U,EAAMpL,OAAS,EAE9DA,KAAU,CACf,IAAI+qB,EAAO3f,EAAMpL,GACb2iC,EAAY5X,EAAKxf,KACrB,GAAiB,MAAbo3B,GAAqBA,GAAap3B,EACpC,OAAOwf,EAAKniB,IAEf,CACD,OAAOsX,CACR,CASD,SAASuf,GAAUl0B,GAEjB,OADa3K,GAAeC,KAAKwoB,GAAQ,eAAiBA,GAAS9d,GACrDgY,WACf,CAaD,SAASkU,KACP,IAAIvX,EAASmJ,GAAO3J,UAAYA,GAEhC,OADAQ,EAASA,IAAWR,GAAWgW,GAAexV,EACvCpe,UAAU9B,OAASkgB,EAAOpe,UAAU,GAAIA,UAAU,IAAMoe,CAChE,CAUD,SAASqQ,GAAW1lB,EAAK/J,GACvB,IAgYiBwB,EACbqG,EAjYAoiB,EAAOlgB,EAAIigB,SACf,OAiYgB,WADZniB,SADarG,EA/XAxB,KAiYmB,UAAR6H,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVrG,EACU,OAAVA,GAlYDyoB,EAAmB,iBAAPjqB,EAAkB,SAAW,QACzCiqB,EAAKlgB,GACV,CASD,SAAS0rB,GAAavrB,GAIpB,IAHA,IAAIkV,EAAShgB,GAAK8K,GACdhL,EAASkgB,EAAOlgB,OAEbA,KAAU,CACf,IAAIc,EAAMof,EAAOlgB,GACbsC,EAAQ0I,EAAOlK,GAEnBof,EAAOlgB,GAAU,CAACc,EAAKwB,EAAOo0B,GAAmBp0B,GAClD,CACD,OAAO4d,CACR,CAUD,SAASyG,GAAU3b,EAAQlK,GACzB,IAAIwB,EAlxJR,SAAkB0I,EAAQlK,GACxB,OAAiB,MAAVkK,EAAiBjJ,EAAYiJ,EAAOlK,EAC5C,CAgxJe8hC,CAAS53B,EAAQlK,GAC7B,OAAO20B,GAAanzB,GAASA,EAAQP,CACtC,CAoCD,IAAIqsB,GAAc9G,GAA+B,SAAStc,GACxD,OAAc,MAAVA,EACK,IAETA,EAASvK,GAAOuK,GACTgV,GAAYsH,GAAiBtc,IAAS,SAASgkB,GACpD,OAAO7I,GAAqBtlB,KAAKmK,EAAQgkB,EAC1C,IACF,EARoC6T,GAiBjC7U,GAAgB1G,GAA+B,SAAStc,GAE1D,IADA,IAAIkV,EAAS,GACNlV,GACLwV,GAAUN,EAAQkO,GAAWpjB,IAC7BA,EAAS+a,GAAa/a,GAExB,OAAOkV,CACR,EAPsC2iB,GAgBnCjV,GAASsE,GA2Eb,SAAS4Q,GAAQ93B,EAAQ4mB,EAAMmR,GAO7B,IAJA,IAAIxuB,GAAS,EACTvU,GAHJ4xB,EAAOC,GAASD,EAAM5mB,IAGJhL,OACdkgB,GAAS,IAEJ3L,EAAQvU,GAAQ,CACvB,IAAIc,EAAMgxB,GAAMF,EAAKrd,IACrB,KAAM2L,EAAmB,MAAVlV,GAAkB+3B,EAAQ/3B,EAAQlK,IAC/C,MAEFkK,EAASA,EAAOlK,EACjB,CACD,OAAIof,KAAY3L,GAASvU,EAChBkgB,KAETlgB,EAAmB,MAAVgL,EAAiB,EAAIA,EAAOhL,SAClBgjC,GAAShjC,IAAWurB,GAAQzqB,EAAKd,KACjDI,GAAQ4K,IAAWmgB,GAAYngB,GACnC,CA4BD,SAAS+iB,GAAgB/iB,GACvB,MAAqC,mBAAtBA,EAAOjL,aAA8Bi2B,GAAYhrB,GAE5D,CAAA,EADA0e,GAAW3D,GAAa/a,GAE7B,CA4ED,SAASqmB,GAAc/uB,GACrB,OAAOlC,GAAQkC,IAAU6oB,GAAY7oB,OAChC8jB,IAAoB9jB,GAASA,EAAM8jB,IACzC,CAUD,SAASmF,GAAQjpB,EAAOtC,GACtB,IAAI2I,SAAcrG,EAGlB,SAFAtC,EAAmB,MAAVA,EAAiB6W,EAAmB7W,KAGlC,UAAR2I,GACU,UAARA,GAAoB8R,GAASyI,KAAK5gB,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQtC,CAChD,CAYD,SAASs9B,GAAeh7B,EAAOiS,EAAOvJ,GACpC,IAAK4e,GAAS5e,GACZ,SAEF,IAAIrC,SAAc4L,EAClB,SAAY,UAAR5L,EACK2tB,GAAYtrB,IAAWugB,GAAQhX,EAAOvJ,EAAOhL,QACrC,UAAR2I,GAAoB4L,KAASvJ,IAE7BghB,GAAGhhB,EAAOuJ,GAAQjS,EAG5B,CAUD,SAASm0B,GAAMn0B,EAAO0I,GACpB,GAAI5K,GAAQkC,GACV,OAAA,EAEF,IAAIqG,SAAcrG,EAClB,QAAY,UAARqG,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATrG,IAAiB0uB,GAAS1uB,MAGvBiX,GAAc2J,KAAK5gB,KAAWgX,EAAa4J,KAAK5gB,IAC1C,MAAV0I,GAAkB1I,KAAS7B,GAAOuK,GACtC,CAwBD,SAAS4zB,GAAWrzB,GAClB,IAAImzB,EAAWD,GAAYlzB,GACvBinB,EAAQnJ,GAAOqV,GAEnB,GAAoB,mBAATlM,KAAyBkM,KAAYnV,GAAY7oB,WAC1D,OAAO,EAET,GAAI6K,IAASinB,EACX,OAAO,EAET,IAAIzH,EAAO4T,GAAQnM,GACnB,QAASzH,GAAQxf,IAASwf,EAAK,EAChC,EA9SI1C,IAAYuF,GAAO,IAAIvF,GAAS,IAAI4a,YAAY,MAAQ/qB,GACxDoQ,IAAOsF,GAAO,IAAItF,KAAQ9Q,GAC1B+Q,IAAWqF,GAAOrF,GAAQ2a,YAAcvrB,GACxCrT,IAAOspB,GAAO,IAAItpB,KAAQuT,GAC1B2Q,IAAWoF,GAAO,IAAIpF,KAAYxQ,KACrC4V,GAAS,SAAStrB,GAChB,IAAI4d,EAASgS,GAAW5vB,GACpBgsB,EAAOpO,GAAUxI,EAAYpV,EAAMvC,YAAcgC,EACjDohC,EAAa7U,EAAOzF,GAASyF,GAAQ,GAEzC,GAAI6U,EACF,OAAQA,GACN,KAAKva,GAAoB,OAAO1Q,EAChC,KAAK4Q,GAAe,OAAOtR,EAC3B,KAAKuR,GAAmB,OAAOpR,EAC/B,KAAKqR,GAAe,OAAOnR,EAC3B,KAAKoR,GAAmB,OAAOjR,EAGnC,OAAOkI,CACR,GA8SH,IAAIkjB,GAAane,GAAayM,GAAa2R,GAS3C,SAASrN,GAAY1zB,GACnB,IAAIgsB,EAAOhsB,GAASA,EAAMvC,YAG1B,OAAOuC,KAFqB,mBAARgsB,GAAsBA,EAAK5tB,WAAcskB,GAG9D,CAUD,SAAS0R,GAAmBp0B,GAC1B,OAAOA,GAAUA,IAAUsnB,GAAStnB,EACrC,CAWD,SAASk0B,GAAwB11B,EAAKy0B,GACpC,OAAO,SAASvqB,GACd,OAAc,MAAVA,IAGGA,EAAOlK,KAASy0B,IACpBA,IAAaxzB,GAAcjB,KAAOL,GAAOuK,IAC7C,CACF,CAoID,SAAS6tB,GAASttB,EAAMoB,EAAO0W,GAE7B,OADA1W,EAAQkb,GAAUlb,IAAU5K,EAAawJ,EAAKvL,OAAS,EAAK2M,EAAO,cAOjE,IALA,IAAI4S,EAAOzd,UACPyS,GAAS,EACTvU,EAAS6nB,GAAUtI,EAAKvf,OAAS2M,EAAO,GACxCvB,EAAQjL,GAAMH,KAETuU,EAAQvU,GACfoL,EAAMmJ,GAASgL,EAAK5S,EAAQ4H,GAE9BA,GAAS,EAET,IADA,IAAI+uB,EAAYnjC,GAAMwM,EAAQ,KACrB4H,EAAQ5H,GACf22B,EAAU/uB,GAASgL,EAAKhL,GAG1B,OADA+uB,EAAU32B,GAAS0W,EAAUjY,GACtBrD,GAAMwD,EAAMpH,KAAMm/B,EAC1B,CACF,CAUD,SAASlQ,GAAOpoB,EAAQ4mB,GACtB,OAAOA,EAAK5xB,OAAS,EAAIgL,EAAS2mB,GAAQ3mB,EAAQquB,GAAUzH,EAAM,GAAI,GACvE,CAgCD,SAASmF,GAAQ/rB,EAAQlK,GACvB,IAAY,gBAARA,GAAgD,mBAAhBkK,EAAOlK,KAIhC,aAAPA,EAIJ,OAAOkK,EAAOlK,EACf,CAgBD,IAAIqgC,GAAUoC,GAAStK,IAUnBhS,GAAaD,IAAiB,SAASzb,EAAMikB,GAC/C,OAAO1R,GAAKmJ,WAAW1b,EAAMikB,EAC9B,EAUGoJ,GAAc2K,GAASrK,IAY3B,SAASkI,GAAgB5C,EAASgF,EAAWrW,GAC3C,IAAI7sB,EAAUkjC,EAAY,GAC1B,OAAO5K,GAAY4F,EA1brB,SAA2Bl+B,EAAQmjC,GACjC,IAAIzjC,EAASyjC,EAAQzjC,OACrB,IAAKA,EACH,OAAOM,EAET,IAAIsjB,EAAY5jB,EAAS,EAGzB,OAFAyjC,EAAQ7f,IAAc5jB,EAAS,EAAI,KAAO,IAAMyjC,EAAQ7f,GACxD6f,EAAUA,EAAQz7B,KAAKhI,EAAS,EAAI,KAAO,KACpCM,EAAO6hB,QAAQtI,GAAe,uBAAyB4pB,EAAU,SACzE,CAib6BC,CAAkBpjC,EAqHhD,SAA2BmjC,EAAStW,GAOlC,OANAvN,GAAU5I,GAAW,SAASwqB,GAC5B,IAAIl/B,EAAQ,KAAOk/B,EAAK,GACnBrU,EAAUqU,EAAK,KAAQrhB,GAAcsjB,EAASnhC,IACjDmhC,EAAQ57B,KAAKvF,EAEhB,IACMmhC,EAAQ/xB,MAChB,CA7HuDiyB,CAtjBxD,SAAwBrjC,GACtB,IAAIyjB,EAAQzjB,EAAOyjB,MAAMjK,IACzB,OAAOiK,EAAQA,EAAM,GAAGE,MAAMlK,IAAkB,EACjD,CAmjByE6pB,CAAetjC,GAAS6sB,IACjG,CAWD,SAASoW,GAASh4B,GAChB,IAAIgG,EAAQ,EACRsyB,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ/b,KACRgc,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMxyB,GAziNE,IA0iNN,OAAOzP,UAAU,QAGnByP,EAAQ,EAEV,OAAOhG,EAAKxD,MAAMhG,EAAWD,UAC9B,CACF,CAUD,SAAS6pB,GAAYvgB,EAAO2F,GAC1B,IAAIwD,GAAS,EACTvU,EAASoL,EAAMpL,OACf4jB,EAAY5jB,EAAS,EAGzB,IADA+Q,EAAOA,IAAShP,EAAY/B,EAAS+Q,IAC5BwD,EAAQxD,GAAM,CACrB,IAAIizB,EAAOvY,GAAWlX,EAAOqP,GACzBthB,EAAQ8I,EAAM44B,GAElB54B,EAAM44B,GAAQ54B,EAAMmJ,GACpBnJ,EAAMmJ,GAASjS,CAChB,CAED,OADA8I,EAAMpL,OAAS+Q,EACR3F,CACR,CASD,IAAIowB,GAvTJ,SAAuBjwB,GACrB,IAAI2U,EAAS+jB,GAAQ14B,GAAM,SAASzK,GAIlC,OAh0MiB,MA6zMbyhB,EAAMxR,MACRwR,EAAMmI,QAED5pB,CACR,IAEGyhB,EAAQrC,EAAOqC,MACnB,OAAOrC,CACR,CA6SkBgkB,EAAc,SAAS39B,GACxC,IAAI2Z,EAAS,GAOb,OAN6B,KAAzB3Z,EAAO49B,WAAW,IACpBjkB,EAAOrY,KAAK,IAEdtB,EAAO4b,QAAQ3I,IAAY,SAASuK,EAAO5Y,EAAQi5B,EAAOC,GACxDnkB,EAAOrY,KAAKu8B,EAAQC,EAAUliB,QAAQjI,GAAc,MAAS/O,GAAU4Y,EACxE,IACM7D,CACR,IASD,SAAS4R,GAAMxvB,GACb,GAAoB,iBAATA,GAAqB0uB,GAAS1uB,GACvC,OAAOA,EAET,IAAI4d,EAAU5d,EAAQ,GACtB,MAAkB,KAAV4d,GAAkB,EAAI5d,IAAU,IAAa,KAAO4d,CAC7D,CASD,SAAS2I,GAAStd,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO2Z,GAAarkB,KAAK0K,EAC1B,CAAC,MAAOtB,GAAG,CACZ,IACE,OAAQsB,EAAO,EAChB,CAAC,MAAOtB,GAAG,CACb,CACD,MAAO,EACR,CA2BD,SAASwf,GAAa+U,GACpB,GAAIA,aAAmBjV,GACrB,OAAOiV,EAAQ8F,QAEjB,IAAIpkB,EAAS,IAAIsJ,GAAcgV,EAAQzU,YAAayU,EAAQvU,WAI5D,OAHA/J,EAAO8J,YAAc4B,GAAU4S,EAAQxU,aACvC9J,EAAOgK,UAAasU,EAAQtU,UAC5BhK,EAAOiK,WAAaqU,EAAQrU,WACrBjK,CACR,CAqID,IAAIqkB,GAAa5L,IAAS,SAASvtB,EAAOqV,GACxC,OAAOwW,GAAkB7rB,GACrBqkB,GAAerkB,EAAO8lB,GAAYzQ,EAAQ,EAAGwW,IAAmB,IAChE,EACL,IA4BGuN,GAAe7L,IAAS,SAASvtB,EAAOqV,GAC1C,IAAIf,EAAW2T,GAAK5S,GAIpB,OAHIwW,GAAkBvX,KACpBA,EAAW3d,GAENk1B,GAAkB7rB,GACrBqkB,GAAerkB,EAAO8lB,GAAYzQ,EAAQ,EAAGwW,IAAmB,GAAOQ,GAAY/X,EAAU,IAC7F,EACL,IAyBG+kB,GAAiB9L,IAAS,SAASvtB,EAAOqV,GAC5C,IAAIH,EAAa+S,GAAK5S,GAItB,OAHIwW,GAAkB3W,KACpBA,EAAave,GAERk1B,GAAkB7rB,GACrBqkB,GAAerkB,EAAO8lB,GAAYzQ,EAAQ,EAAGwW,IAAmB,GAAOl1B,EAAWue,GAClF,EACL,IAqOD,SAASokB,GAAUt5B,EAAO2U,EAAWsB,GACnC,IAAIrhB,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAqB,MAAb8M,EAAoB,EAAIkgB,GAAUlgB,GAI9C,OAHI9M,EAAQ,IACVA,EAAQsT,GAAU7nB,EAASuU,EAAO,IAE7B6M,GAAchW,EAAOqsB,GAAY1X,EAAW,GAAIxL,EACxD,CAqCD,SAASowB,GAAcv5B,EAAO2U,EAAWsB,GACvC,IAAIrhB,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAQvU,EAAS,EAOrB,OANIqhB,IAActf,IAChBwS,EAAQgtB,GAAUlgB,GAClB9M,EAAQ8M,EAAY,EAChBwG,GAAU7nB,EAASuU,EAAO,GAC1BuT,GAAUvT,EAAOvU,EAAS,IAEzBohB,GAAchW,EAAOqsB,GAAY1X,EAAW,GAAIxL,GAAO,EAC/D,CAgBD,SAASmuB,GAAQt3B,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMpL,QACvBkxB,GAAY9lB,EAAO,GAAK,EACzC,CA+FD,SAASw5B,GAAKx5B,GACZ,OAAQA,GAASA,EAAMpL,OAAUoL,EAAM,GAAKrJ,CAC7C,CAyED,IAAI8iC,GAAelM,IAAS,SAAS/F,GACnC,IAAIkS,EAASvkB,GAASqS,EAAQ0I,IAC9B,OAAQwJ,EAAO9kC,QAAU8kC,EAAO,KAAOlS,EAAO,GAC1CD,GAAiBmS,GACjB,EACL,IAyBGC,GAAiBpM,IAAS,SAAS/F,GACrC,IAAIlT,EAAW2T,GAAKT,GAChBkS,EAASvkB,GAASqS,EAAQ0I,IAO9B,OALI5b,IAAa2T,GAAKyR,GACpBplB,EAAW3d,EAEX+iC,EAAOzU,MAEDyU,EAAO9kC,QAAU8kC,EAAO,KAAOlS,EAAO,GAC1CD,GAAiBmS,EAAQrN,GAAY/X,EAAU,IAC/C,EACL,IAuBGslB,GAAmBrM,IAAS,SAAS/F,GACvC,IAAItS,EAAa+S,GAAKT,GAClBkS,EAASvkB,GAASqS,EAAQ0I,IAM9B,OAJAhb,EAAkC,mBAAdA,EAA2BA,EAAave,IAE1D+iC,EAAOzU,MAEDyU,EAAO9kC,QAAU8kC,EAAO,KAAOlS,EAAO,GAC1CD,GAAiBmS,EAAQ/iC,EAAWue,GACpC,EACL,IAmCD,SAAS+S,GAAKjoB,GACZ,IAAIpL,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAOA,EAASoL,EAAMpL,EAAS,GAAK+B,CACrC,CAsFD,IAAIkjC,GAAOtM,GAASuM,IAsBpB,SAASA,GAAQ95B,EAAOqV,GACtB,OAAQrV,GAASA,EAAMpL,QAAUygB,GAAUA,EAAOzgB,OAC9Co4B,GAAYhtB,EAAOqV,GACnBrV,CACL,CAoFD,IAAI+5B,GAAS/G,IAAS,SAAShzB,EAAOmtB,GACpC,IAAIv4B,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACnCkgB,EAAS0M,GAAOxhB,EAAOmtB,GAM3B,OAJAD,GAAWltB,EAAOmV,GAASgY,GAAS,SAAShkB,GAC3C,OAAOgX,GAAQhX,EAAOvU,IAAWuU,EAAQA,CAC1C,IAAE7C,KAAKsmB,KAED9X,CACR,IA0ED,SAASkI,GAAQhd,GACf,OAAgB,MAATA,EAAgBA,EAAQ+c,GAActnB,KAAKuK,EACnD,CAiaD,IAAIg6B,GAAQzM,IAAS,SAAS/F,GAC5B,OAAO6H,GAASvJ,GAAY0B,EAAQ,EAAGqE,IAAmB,GAC3D,IAyBGoO,GAAU1M,IAAS,SAAS/F,GAC9B,IAAIlT,EAAW2T,GAAKT,GAIpB,OAHIqE,GAAkBvX,KACpBA,EAAW3d,GAEN04B,GAASvJ,GAAY0B,EAAQ,EAAGqE,IAAmB,GAAOQ,GAAY/X,EAAU,GACxF,IAuBG4lB,GAAY3M,IAAS,SAAS/F,GAChC,IAAItS,EAAa+S,GAAKT,GAEtB,OADAtS,EAAkC,mBAAdA,EAA2BA,EAAave,EACrD04B,GAASvJ,GAAY0B,EAAQ,EAAGqE,IAAmB,GAAOl1B,EAAWue,EAC7E,IA+FD,SAASilB,GAAMn6B,GACb,IAAMA,IAASA,EAAMpL,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAoL,EAAQ4U,GAAY5U,GAAO,SAASo6B,GAClC,GAAIvO,GAAkBuO,GAEpB,OADAxlC,EAAS6nB,GAAU2d,EAAMxlC,OAAQA,IAC1B,CAEV,IACM8hB,GAAU9hB,GAAQ,SAASuU,GAChC,OAAOgM,GAASnV,EAAO4V,GAAazM,GACrC,GACF,CAuBD,SAASkxB,GAAUr6B,EAAOsU,GACxB,IAAMtU,IAASA,EAAMpL,OACnB,MAAO,GAET,IAAIkgB,EAASqlB,GAAMn6B,GACnB,OAAgB,MAAZsU,EACKQ,EAEFK,GAASL,GAAQ,SAASslB,GAC/B,OAAOz9B,GAAM2X,EAAU3d,EAAWyjC,EACnC,GACF,CAsBD,IAAIE,GAAU/M,IAAS,SAASvtB,EAAOqV,GACrC,OAAOwW,GAAkB7rB,GACrBqkB,GAAerkB,EAAOqV,GACtB,EACL,IAoBGklB,GAAMhN,IAAS,SAAS/F,GAC1B,OAAOsI,GAAQlb,GAAY4S,EAAQqE,IACpC,IAyBG2O,GAAQjN,IAAS,SAAS/F,GAC5B,IAAIlT,EAAW2T,GAAKT,GAIpB,OAHIqE,GAAkBvX,KACpBA,EAAW3d,GAENm5B,GAAQlb,GAAY4S,EAAQqE,IAAoBQ,GAAY/X,EAAU,GAC9E,IAuBGmmB,GAAUlN,IAAS,SAAS/F,GAC9B,IAAItS,EAAa+S,GAAKT,GAEtB,OADAtS,EAAkC,mBAAdA,EAA2BA,EAAave,EACrDm5B,GAAQlb,GAAY4S,EAAQqE,IAAoBl1B,EAAWue,EACnE,IAkBGwlB,GAAMnN,GAAS4M,IA6DnB,IAAIQ,GAAUpN,IAAS,SAAS/F,GAC9B,IAAI5yB,EAAS4yB,EAAO5yB,OAChB0f,EAAW1f,EAAS,EAAI4yB,EAAO5yB,EAAS,GAAK+B,EAGjD,OADA2d,EAA8B,mBAAZA,GAA0BkT,EAAOvC,MAAO3Q,GAAY3d,EAC/D0jC,GAAU7S,EAAQlT,EAC1B,IAiCD,SAASsmB,GAAM1jC,GACb,IAAI4d,EAASmJ,GAAO/mB,GAEpB,OADA4d,EAAO+J,WAAY,EACZ/J,CACR,CAqDD,SAASqe,GAAKj8B,EAAO2jC,GACnB,OAAOA,EAAY3jC,EACpB,CAkBD,IAAI4jC,GAAY9H,IAAS,SAASvR,GAChC,IAAI7sB,EAAS6sB,EAAM7sB,OACf2M,EAAQ3M,EAAS6sB,EAAM,GAAK,EAC5BvqB,EAAQ6B,KAAK4lB,YACbkc,EAAc,SAASj7B,GAAU,OAAO4hB,GAAO5hB,EAAQ6hB,EAAS,EAEpE,QAAI7sB,EAAS,GAAKmE,KAAK6lB,YAAYhqB,SAC7BsC,aAAiBinB,IAAiBgC,GAAQ5e,KAGhDrK,EAAQA,EAAM2f,MAAMtV,GAAQA,GAAS3M,EAAS,EAAI,KAC5CgqB,YAAYniB,KAAK,CACrB0D,KAAQgzB,GACRhf,KAAQ,CAAC0mB,GACT3mB,QAAWvd,IAEFynB,IAAAA,GAAclnB,EAAO6B,KAAK8lB,WAAWsU,MAAK,SAASnzB,GAI5D,OAHIpL,IAAWoL,EAAMpL,QACnBoL,EAAMvD,KAAK9F,GAENqJ,CACR,KAbamzB,KAAAA,KAAK0H,EAcpB,IAiPD,IAAIE,GAAUnJ,IAAiB,SAAS9c,EAAQ5d,EAAOxB,GACjDF,GAAeC,KAAKqf,EAAQpf,KAC5Bof,EAAOpf,GAETmrB,GAAgB/L,EAAQpf,EAAK,EAEhC,IAqID,IAAI6O,GAAOsuB,GAAWyG,IAqBlB0B,GAAWnI,GAAW0G,IA2G1B,SAAS//B,GAAQsc,EAAYxB,GAE3B,OADWtf,GAAQ8gB,GAActB,GAAY0M,IACjCpL,EAAYuW,GAAY/X,EAAU,GAC/C,CAsBD,SAAS2mB,GAAanlB,EAAYxB,GAEhC,OADWtf,GAAQ8gB,GAAcrB,GAAiB+Q,IACtC1P,EAAYuW,GAAY/X,EAAU,GAC/C,CAyBD,IAAI4mB,GAAUtJ,IAAiB,SAAS9c,EAAQ5d,EAAOxB,GACjDF,GAAeC,KAAKqf,EAAQpf,GAC9Bof,EAAOpf,GAAK+G,KAAKvF,GAEjB2pB,GAAgB/L,EAAQpf,EAAK,CAACwB,GAEjC,IAoED,IAAIikC,GAAY5N,IAAS,SAASzX,EAAY0Q,EAAMrS,GAClD,IAAIhL,GAAS,EACTsZ,EAAwB,mBAAR+D,EAChB1R,EAASoW,GAAYpV,GAAc/gB,GAAM+gB,EAAWlhB,QAAU,GAKlE,OAHAssB,GAASpL,GAAY,SAAS5e,GAC5B4d,IAAS3L,GAASsZ,EAAS9lB,GAAM6pB,EAAMtvB,EAAOid,GAAQ4T,GAAW7wB,EAAOsvB,EAAMrS,EAC/E,IACMW,CACR,IA8BGsmB,GAAQxJ,IAAiB,SAAS9c,EAAQ5d,EAAOxB,GACnDmrB,GAAgB/L,EAAQpf,EAAKwB,EAC9B,IA4CD,SAASuI,GAAIqW,EAAYxB,GAEvB,OADWtf,GAAQ8gB,GAAcX,GAAW8V,IAChCnV,EAAYuW,GAAY/X,EAAU,GAC/C,CAiFD,IAAI+mB,GAAYzJ,IAAiB,SAAS9c,EAAQ5d,EAAOxB,GACvDof,EAAOpf,EAAM,EAAI,GAAG+G,KAAKvF,EAC1B,IAAE,WAAa,MAAO,CAAC,GAAI,GAAM,IAmSlC,IAAIokC,GAAS/N,IAAS,SAASzX,EAAYqW,GACzC,GAAkB,MAAdrW,EACF,MAAO,GAET,IAAIlhB,EAASu3B,EAAUv3B,OAMvB,OALIA,EAAS,GAAKs9B,GAAepc,EAAYqW,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHv3B,EAAS,GAAKs9B,GAAe/F,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYpW,EAAYgQ,GAAYqG,EAAW,GAAI,GAC3D,IAoBGxQ,GAAMD,IAAU,WAClB,OAAOhJ,GAAK4G,KAAKqC,KAClB,EAyDD,SAASmY,GAAI3zB,EAAMwW,EAAGsb,GAGpB,OAFAtb,EAAIsb,EAAQt7B,EAAYggB,EACxBA,EAAKxW,GAAa,MAALwW,EAAaxW,EAAKvL,OAAS+hB,EACjC6f,GAAWr2B,EAAMmL,EAAe3U,EAAWA,EAAWA,EAAWA,EAAWggB,EACpF,CAmBD,SAAS4kB,GAAO5kB,EAAGxW,GACjB,IAAI2U,EACJ,GAAmB,mBAAR3U,EACT,MAAM,IAAIsZ,GAAUzO,GAGtB,OADA2L,EAAIwf,GAAUxf,GACI,WAOhB,QANMA,EAAI,IACR7B,EAAS3U,EAAKxD,MAAM5D,KAAMrC,YAExBigB,GAAK,IACPxW,EAAOxJ,GAEFme,CACR,CACF,CAqCD,IAAI0mB,GAAOjO,IAAS,SAASptB,EAAM+T,EAAS2c,GAC1C,IAAI9O,EAv4Ta,EAw4TjB,GAAI8O,EAASj8B,OAAQ,CACnB,IAAIk8B,EAAU5Y,GAAe2Y,EAAUwD,GAAUmH,KACjDzZ,GAAW3W,CACZ,CACD,OAAOorB,GAAWr2B,EAAM4hB,EAAS7N,EAAS2c,EAAUC,EACrD,IA+CG2K,GAAUlO,IAAS,SAAS3tB,EAAQlK,EAAKm7B,GAC3C,IAAI9O,EAAU4U,EACd,GAAI9F,EAASj8B,OAAQ,CACnB,IAAIk8B,EAAU5Y,GAAe2Y,EAAUwD,GAAUoH,KACjD1Z,GAAW3W,CACZ,CACD,OAAOorB,GAAW9gC,EAAKqsB,EAASniB,EAAQixB,EAAUC,EACnD,IAqJD,SAAS4K,GAASv7B,EAAMikB,EAAMxmB,GAC5B,IAAI+9B,EACAC,EACAC,EACA/mB,EACAgnB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT5J,GAAW,EAEf,GAAmB,mBAARnyB,EACT,UAAUsZ,GAAUzO,GAUtB,SAASmxB,EAAWC,GAClB,IAAIjoB,EAAOwnB,EACPznB,EAAU0nB,EAKd,OAHAD,EAAWC,EAAWjlC,EACtBqlC,EAAiBI,EACjBtnB,EAAS3U,EAAKxD,MAAMuX,EAASC,EAE9B,CAqBD,SAASkoB,EAAaD,GACpB,IAAIE,EAAoBF,EAAOL,EAM/B,OAAQA,IAAiBplC,GAAc2lC,GAAqBlY,GACzDkY,EAAoB,GAAOJ,GANJE,EAAOJ,GAM8BH,CAChE,CAED,SAASU,IACP,IAAIH,EAAOzgB,KACX,GAAI0gB,EAAaD,GACf,OAAOI,EAAaJ,GAGtBN,EAAUjgB,GAAW0gB,EA3BvB,SAAuBH,GACrB,IAEIK,EAAcrY,GAFMgY,EAAOL,GAI/B,OAAOG,EACHxf,GAAU+f,EAAaZ,GAJDO,EAAOJ,IAK7BS,CACL,CAmBoCC,CAAcN,GAClD,CAED,SAASI,EAAaJ,GAKpB,OAJAN,EAAUnlC,EAIN27B,GAAYqJ,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWjlC,EACfme,EACR,CAcD,SAAS6nB,IACP,IAAIP,EAAOzgB,KACPihB,EAAaP,EAAaD,GAM9B,GAJAT,EAAWjlC,UACXklC,EAAW7iC,KACXgjC,EAAeK,EAEXQ,EAAY,CACd,GAAId,IAAYnlC,EACd,OAzEN,SAAqBylC,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUjgB,GAAW0gB,EAAcnY,GAE5B6X,EAAUE,EAAWC,GAAQtnB,CACrC,CAkEY+nB,CAAYd,GAErB,GAAIG,EAIF,OAFAzgB,GAAaqgB,GACbA,EAAUjgB,GAAW0gB,EAAcnY,GAC5B+X,EAAWJ,EAErB,CAID,OAHID,IAAYnlC,IACdmlC,EAAUjgB,GAAW0gB,EAAcnY,IAE9BtP,CACR,CAGD,OA3GAsP,EAAOuR,GAASvR,IAAS,EACrB5F,GAAS5gB,KACXq+B,IAAYr+B,EAAQq+B,QAEpBJ,GADAK,EAAS,YAAat+B,GACH6e,GAAUkZ,GAAS/3B,EAAQi+B,UAAY,EAAGzX,GAAQyX,EACrEvJ,EAAW,aAAc10B,IAAYA,EAAQ00B,SAAWA,GAoG1DqK,EAAUG,OApCV,WACMhB,IAAYnlC,GACd8kB,GAAaqgB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUnlC,CAChD,EA+BDgmC,EAAUI,MA7BV,WACE,OAAOjB,IAAYnlC,EAAYme,EAAS0nB,EAAa7gB,KACtD,EA4BMghB,CACR,CAoBD,IAAIK,GAAQzP,IAAS,SAASptB,EAAMgU,GAClC,OAAOgQ,GAAUhkB,EAAM,EAAGgU,EAC3B,IAqBG8oB,GAAQ1P,IAAS,SAASptB,EAAMikB,EAAMjQ,GACxC,OAAOgQ,GAAUhkB,EAAMw1B,GAASvR,IAAS,EAAGjQ,EAC7C,IAoED,SAAS0kB,GAAQ14B,EAAM+8B,GACrB,GAAmB,mBAAR/8B,GAAmC,MAAZ+8B,GAAuC,mBAAZA,EAC3D,MAAM,IAAIzjB,GAAUzO,GAEtB,IAAImyB,EAAW,WACb,IAAIhpB,EAAOzd,UACPhB,EAAMwnC,EAAWA,EAASvgC,MAAM5D,KAAMob,GAAQA,EAAK,GACnDgD,EAAQgmB,EAAShmB,MAErB,GAAIA,EAAMC,IAAI1hB,GACZ,OAAOyhB,EAAMwK,IAAIjsB,GAEnB,IAAIof,EAAS3U,EAAKxD,MAAM5D,KAAMob,GAE9B,OADAgpB,EAAShmB,MAAQA,EAAMkB,IAAI3iB,EAAKof,IAAWqC,EACpCrC,CACR,EAED,OADAqoB,EAAShmB,MAAQ,IAAK0hB,GAAQuE,OAAS5d,IAChC2d,CACR,CAyBD,SAASE,GAAO1oB,GACd,GAAwB,mBAAbA,EACT,MAAU8E,IAAAA,GAAUzO,GAEtB,OAAO,WACL,IAAImJ,EAAOzd,UACX,OAAQyd,EAAKvf,QACX,KAAA,EAAQ,OAAQ+f,EAAUlf,KAAKsD,MAC/B,KAAK,EAAG,OAAQ4b,EAAUlf,KAAKsD,KAAMob,EAAK,IAC1C,KAAK,EAAG,OAAQQ,EAAUlf,KAAKsD,KAAMob,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQQ,EAAUlf,KAAKsD,KAAMob,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQQ,EAAUhY,MAAM5D,KAAMob,EAC/B,CACF,CApCD0kB,GAAQuE,MAAQ5d,GA2FhB,IAAI8d,GAAWjN,IAAS,SAASlwB,EAAMo9B,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAW3oC,QAAeI,GAAQuoC,EAAW,IACvDpoB,GAASooB,EAAW,GAAIvmB,GAAUqV,OAClClX,GAAS2Q,GAAYyX,EAAY,GAAIvmB,GAAUqV,QAEtBz3B,OAC7B,OAAO24B,IAAS,SAASpZ,GAIvB,IAHA,IAAIhL,GAAS,EACTvU,EAAS8nB,GAAUvI,EAAKvf,OAAQ4oC,KAE3Br0B,EAAQvU,GACfuf,EAAKhL,GAASo0B,EAAWp0B,GAAO1T,KAAKsD,KAAMob,EAAKhL,IAElD,OAAOxM,GAAMwD,EAAMpH,KAAMob,EAC1B,GACF,IAmCGspB,GAAUlQ,IAAS,SAASptB,EAAM0wB,GACpC,IAAIC,EAAU5Y,GAAe2Y,EAAUwD,GAAUoJ,KACjD,OAAOjH,GAAWr2B,EAAMiL,EAAmBzU,EAAWk6B,EAAUC,EACjE,IAkCG4M,GAAenQ,IAAS,SAASptB,EAAM0wB,GACzC,IAAIC,EAAU5Y,GAAe2Y,EAAUwD,GAAUqJ,KACjD,OAAOlH,GAAWr2B,EAAMkL,EAAyB1U,EAAWk6B,EAAUC,EACvE,IAwBG6M,GAAQ3K,IAAS,SAAS7yB,EAAMgtB,GAClC,OAAOqJ,GAAWr2B,EAAMoL,EAAiB5U,EAAWA,EAAWA,EAAWw2B,EAC3E,IAgaD,SAASvM,GAAG1pB,EAAOkwB,GACjB,OAAOlwB,IAAUkwB,GAAUlwB,GAAUA,GAASkwB,GAAUA,CACzD,CAyBD,IAAIwW,GAAKlI,GAA0BvO,IAyB/B0W,GAAMnI,IAA0B,SAASx+B,EAAOkwB,GAClD,OAAOlwB,GAASkwB,CACjB,IAoBGrH,GAAcmI,GAAgB,WAAa,OAAOxxB,SAAY,CAAhC,IAAsCwxB,GAAkB,SAAShxB,GACjG,OAAOgnB,GAAahnB,IAAU1B,GAAeC,KAAKyB,EAAO,YACtD6jB,GAAqBtlB,KAAKyB,EAAO,SACrC,EAyBGlC,GAAUD,GAAMC,QAmBhBue,GAAgBD,GAAoB0D,GAAU1D,IA75PlD,SAA2Bpc,GACzB,OAAOgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAU2V,CACpD,EAs7PD,SAASqe,GAAYh0B,GACnB,OAAgB,MAATA,GAAiB0gC,GAAS1gC,EAAMtC,UAAY0xB,GAAWpvB,EAC/D,CA2BD,SAAS20B,GAAkB30B,GACzB,OAAOgnB,GAAahnB,IAAUg0B,GAAYh0B,EAC3C,CAyCD,IAAImlB,GAAWD,IAAkB6b,GAmB7BxkB,GAASD,GAAawD,GAAUxD,IAxgQpC,SAAoBtc,GAClB,OAAOgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAU8U,CACpD,EA8qQD,SAAS8xB,GAAQ5mC,GACf,IAAKgnB,GAAahnB,GAChB,OAAA,EAEF,IAAIqrB,EAAMuE,GAAW5vB,GACrB,OAAOqrB,GAAOtW,GA9yWF,yBA8yWcsW,GACC,iBAAjBrrB,EAAM4H,SAA4C,iBAAd5H,EAAMsG,OAAqBsuB,GAAc50B,EACxF,CAiDD,SAASovB,GAAWpvB,GAClB,IAAKsnB,GAAStnB,GACZ,OAAO,EAIT,IAAIqrB,EAAMuE,GAAW5vB,GACrB,OAAOqrB,GAAOrW,GAAWqW,GAAOpW,GA32WrB,0BA22W+BoW,GA/1W/B,kBA+1WkDA,CAC9D,CA4BD,SAAS1sB,GAAUqB,GACjB,MAAuB,iBAATA,GAAqBA,GAASi/B,GAAUj/B,EACvD,CA4BD,SAAS0gC,GAAS1gC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASuU,CAC5C,CA2BD,SAAS+S,GAAStnB,GAChB,IAAIqG,SAAcrG,EAClB,OAAgB,MAATA,IAA0B,UAARqG,GAA4B,YAARA,EAC9C,CA0BD,SAAS2gB,GAAahnB,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CAChC,CAmBD,IAAIyc,GAAQD,GAAYsD,GAAUtD,IA5xQlC,SAAmBxc,GACjB,OAAOgnB,GAAahnB,IAAUsrB,GAAOtrB,IAAUkV,CAChD,EA4+QD,SAAS2xB,GAAS7mC,GAChB,MAAuB,iBAATA,GACXgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAUmV,CAChD,CA8BD,SAASyf,GAAc50B,GACrB,IAAKgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAUoV,EAC/C,OAAO,EAET,IAAIiS,EAAQ5D,GAAazjB,GACzB,GAAc,OAAVqnB,EACF,SAEF,IAAI2E,EAAO1tB,GAAeC,KAAK8oB,EAAO,gBAAkBA,EAAM5pB,YAC9D,MAAsB,mBAARuuB,GAAsBA,aAAgBA,GAClDpJ,GAAarkB,KAAKytB,IAAS9I,EAC9B,CAmBD,IAAIvG,GAAWD,GAAeoD,GAAUpD,IA59QxC,SAAsB1c,GACpB,OAAOgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAUsV,CACpD,EA4gRD,IAAIuH,GAAQD,GAAYkD,GAAUlD,IAngRlC,SAAmB5c,GACjB,OAAOgnB,GAAahnB,IAAUsrB,GAAOtrB,IAAUuV,CAChD,EAohRD,SAASuxB,GAAS9mC,GAChB,MAAuB,iBAATA,IACVlC,GAAQkC,IAAUgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAUwV,CACnE,CAmBD,SAASkZ,GAAS1uB,GAChB,MAAuB,iBAATA,GACXgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAUyV,CAChD,CAmBD,IAAIsH,GAAeD,GAAmBgD,GAAUhD,IAvjRhD,SAA0B9c,GACxB,OAAOgnB,GAAahnB,IAClB0gC,GAAS1gC,EAAMtC,WAAaqd,GAAe6U,GAAW5vB,GACzD,EA4oRD,IAAI+mC,GAAKvI,GAA0B1K,IAyB/BkT,GAAMxI,IAA0B,SAASx+B,EAAOkwB,GAClD,OAAOlwB,GAASkwB,CACjB,IAyBD,SAAS+W,GAAQjnC,GACf,IAAKA,EACH,MAAO,GAET,GAAIg0B,GAAYh0B,GACd,OAAO8mC,GAAS9mC,GAASwhB,GAAcxhB,GAASspB,GAAUtpB,GAE5D,GAAIgkB,IAAehkB,EAAMgkB,IACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIwE,EACA7K,EAAS,KAEJ6K,EAAOxE,EAASijB,QAAQC,MAC/BvpB,EAAOrY,KAAKkjB,EAAKzoB,OAEnB,OAAO4d,CACR,CA+7VYwpB,CAAgBpnC,EAAMgkB,OAE/B,IAAIqH,EAAMC,GAAOtrB,GAGjB,OAFWqrB,GAAOnW,EAAS2L,GAAcwK,GAAO9V,EAAS2L,GAAa/C,IAE1Dne,EACb,CAyBD,SAASs+B,GAASt+B,GAChB,OAAKA,GAGLA,EAAQy+B,GAASz+B,MACHsU,GAAYtU,KAAU,IAxkYtB,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQhC,CA4BD,SAASi/B,GAAUj/B,GACjB,IAAI4d,EAAS0gB,GAASt+B,GAClBqnC,EAAYzpB,EAAS,EAEzB,OAAOA,GAAWA,EAAUypB,EAAYzpB,EAASypB,EAAYzpB,EAAU,CACxE,CA6BD,SAAS0pB,GAAStnC,GAChB,OAAOA,EAAQupB,GAAU0V,GAAUj/B,GAAQ,EAAGyU,GAAoB,CACnE,CAyBD,SAASgqB,GAASz+B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI0uB,GAAS1uB,GACX,OAAOwU,EAET,GAAI8S,GAAStnB,GAAQ,CACnB,IAAIkwB,EAAgC,mBAAjBlwB,EAAM9B,QAAwB8B,EAAM9B,UAAY8B,EACnEA,EAAQsnB,GAAS4I,GAAUA,EAAQ,GAAMA,CAC1C,CACD,GAAoB,iBAATlwB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ0f,GAAS1f,GACjB,IAAIunC,EAAWvvB,GAAW4I,KAAK5gB,GAC/B,OAAQunC,GAAYrvB,GAAU0I,KAAK5gB,GAC/Bmb,GAAanb,EAAM2f,MAAM,GAAI4nB,EAAW,EAAI,GAC3CxvB,GAAW6I,KAAK5gB,GAASwU,GAAOxU,CACtC,CA0BD,SAAS60B,GAAc70B,GACrB,OAAOkqB,GAAWlqB,EAAO4rB,GAAO5rB,GACjC,CAqDD,SAAS3B,GAAS2B,GAChB,OAAgB,MAATA,EAAgB,GAAKk4B,GAAal4B,EAC1C,CAoCD,IAAIwnC,GAAS5M,IAAe,SAASlyB,EAAQ1K,GAC3C,GAAI01B,GAAY11B,IAAWg2B,GAAYh2B,GACrCksB,GAAWlsB,EAAQJ,GAAKI,GAAS0K,QAGnC,IAAK,IAAIlK,KAAOR,EACVM,GAAeC,KAAKP,EAAQQ,IAC9BorB,GAAYlhB,EAAQlK,EAAKR,EAAOQ,GAGrC,IAiCGipC,GAAW7M,IAAe,SAASlyB,EAAQ1K,GAC7CksB,GAAWlsB,EAAQ4tB,GAAO5tB,GAAS0K,EACpC,IA+BGg/B,GAAe9M,IAAe,SAASlyB,EAAQ1K,EAAQu2B,EAAUzJ,GACnEZ,GAAWlsB,EAAQ4tB,GAAO5tB,GAAS0K,EAAQoiB,EAC5C,IA8BG6c,GAAa/M,IAAe,SAASlyB,EAAQ1K,EAAQu2B,EAAUzJ,GACjEZ,GAAWlsB,EAAQJ,GAAKI,GAAS0K,EAAQoiB,EAC1C,IAmBG8c,GAAK9L,GAASxR,IA8DlB,IAAIpI,GAAWmU,IAAS,SAAS3tB,EAAQoyB,GACvCpyB,EAASvK,GAAOuK,GAEhB,IAAIuJ,GAAS,EACTvU,EAASo9B,EAAQp9B,OACjBq9B,EAAQr9B,EAAS,EAAIo9B,EAAQ,GAAKr7B,EAMtC,IAJIs7B,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDr9B,EAAS,KAGFuU,EAAQvU,GAMf,IALA,IAAIM,EAAS88B,EAAQ7oB,GACjBxK,EAAQmkB,GAAO5tB,GACf6pC,GAAc,EACdC,EAAcrgC,EAAM/J,SAEfmqC,EAAaC,GAAa,CACjC,IAAItpC,EAAMiJ,EAAMogC,GACZ7nC,EAAQ0I,EAAOlK,IAEfwB,IAAUP,GACTiqB,GAAG1pB,EAAO0iB,GAAYlkB,MAAUF,GAAeC,KAAKmK,EAAQlK,MAC/DkK,EAAOlK,GAAOR,EAAOQ,GAExB,CAGH,OAAOkK,CACR,IAqBGq/B,GAAe1R,IAAS,SAASpZ,GAEnC,OADAA,EAAK1X,KAAK9F,EAAWugC,IACdv6B,GAAMuiC,GAAWvoC,EAAWwd,EACpC,IA+RD,SAASwN,GAAI/hB,EAAQ4mB,EAAM7oB,GACzB,IAAImX,EAAmB,MAAVlV,EAAiBjJ,EAAY4vB,GAAQ3mB,EAAQ4mB,GAC1D,OAAO1R,IAAWne,EAAYgH,EAAemX,CAC9C,CA2DD,SAASyW,GAAM3rB,EAAQ4mB,GACrB,OAAiB,MAAV5mB,GAAkB83B,GAAQ93B,EAAQ4mB,EAAMc,GAChD,CAoBD,IAAI6X,GAAStK,IAAe,SAAS/f,EAAQ5d,EAAOxB,GACrC,MAATwB,GACyB,mBAAlBA,EAAM3B,WACf2B,EAAQijB,GAAqB1kB,KAAKyB,IAGpC4d,EAAO5d,GAASxB,CACjB,GAAEq4B,GAASxD,KA4BR6U,GAAWvK,IAAe,SAAS/f,EAAQ5d,EAAOxB,GACvC,MAATwB,GACyB,mBAAlBA,EAAM3B,WACf2B,EAAQijB,GAAqB1kB,KAAKyB,IAGhC1B,GAAeC,KAAKqf,EAAQ5d,GAC9B4d,EAAO5d,GAAOuF,KAAK/G,GAEnBof,EAAO5d,GAAS,CAACxB,EAEpB,GAAE22B,IAoBCgT,GAAS9R,GAASxF,IA8BtB,SAASjzB,GAAK8K,GACZ,OAAOsrB,GAAYtrB,GAAUggB,GAAchgB,GAAU+qB,GAAS/qB,EAC/D,CAyBD,SAASkjB,GAAOljB,GACd,OAAOsrB,GAAYtrB,GAAUggB,GAAchgB,GAAQ,GAAQirB,GAAWjrB,EACvE,CAsGD,IAAI0/B,GAAQxN,IAAe,SAASlyB,EAAQ1K,EAAQu2B,GAClDD,GAAU5rB,EAAQ1K,EAAQu2B,EAC3B,IAiCGyT,GAAYpN,IAAe,SAASlyB,EAAQ1K,EAAQu2B,EAAUzJ,GAChEwJ,GAAU5rB,EAAQ1K,EAAQu2B,EAAUzJ,EACrC,IAsBGud,GAAOvM,IAAS,SAASpzB,EAAQ6hB,GACnC,IAAI3M,EAAS,CAAb,EACA,GAAc,MAAVlV,EACF,OAAOkV,EAET,IAAIoN,GAAS,EACbT,EAAQtM,GAASsM,GAAO,SAAS+E,GAG/B,OAFAA,EAAOC,GAASD,EAAM5mB,GACtBsiB,IAAWA,EAASsE,EAAK5xB,OAAS,GAC3B4xB,CACR,IACDpF,GAAWxhB,EAAQokB,GAAapkB,GAASkV,GACrCoN,IACFpN,EAASgN,GAAUhN,EAAQ0qB,EAAwDrI,KAGrF,IADA,IAAIviC,EAAS6sB,EAAM7sB,OACZA,KACLy4B,GAAUvY,EAAQ2M,EAAM7sB,IAE1B,OAAOkgB,CACR,IA2CD,IAAIuE,GAAO2Z,IAAS,SAASpzB,EAAQ6hB,GACnC,OAAiB,MAAV7hB,EAAiB,CAAA,EAnmT1B,SAAkBA,EAAQ6hB,GACxB,OAAOqL,GAAWltB,EAAQ6hB,GAAO,SAASvqB,EAAOsvB,GAC/C,OAAO+E,GAAM3rB,EAAQ4mB,EACtB,GACF,CA+lT8BiZ,CAAS7/B,EAAQ6hB,EAC/C,IAoBD,SAASie,GAAO9/B,EAAQ+U,GACtB,GAAc,MAAV/U,EACF,MAAO,CAAP,EAEF,IAAIjB,EAAQwW,GAAS6O,GAAapkB,IAAS,SAAS+/B,GAClD,MAAO,CAACA,EACT,IAED,OADAhrB,EAAY0X,GAAY1X,GACjBmY,GAAWltB,EAAQjB,GAAO,SAASzH,EAAOsvB,GAC/C,OAAO7R,EAAUzd,EAAOsvB,EAAK,GAC9B,GACF,CA0ID,IAAIoZ,GAAUtJ,GAAcxhC,IA0BxB+qC,GAAYvJ,GAAcxT,IA4K9B,SAASzN,GAAOzV,GACd,OAAiB,MAAVA,EAAiB,GAAKqX,GAAWrX,EAAQ9K,GAAK8K,GACtD,CAiND,IAAIkgC,GAAYvN,IAAiB,SAASzd,EAAQirB,EAAM52B,GAEtD,OADA42B,EAAOA,EAAKC,cACLlrB,GAAU3L,EAAQ82B,GAAWF,GAAQA,EAC7C,IAiBD,SAASE,GAAW9kC,GAClB,OAAO+kC,GAAW3qC,GAAS4F,GAAQ6kC,cACpC,CAoBD,SAAStN,GAAOv3B,GAEd,OADAA,EAAS5F,GAAS4F,KACDA,EAAO4b,QAAQzH,GAASmI,IAAcV,QAAQrF,GAAa,GAC7E,CAqHD,IAAIyuB,GAAY5N,IAAiB,SAASzd,EAAQirB,EAAM52B,GACtD,OAAO2L,GAAU3L,EAAQ,IAAM,IAAM42B,EAAKC,aAC3C,IAsBGI,GAAY7N,IAAiB,SAASzd,EAAQirB,EAAM52B,GACtD,OAAO2L,GAAU3L,EAAQ,IAAM,IAAM42B,EAAKC,aAC3C,IAmBGK,GAAajO,GAAgB,eA0NjC,IAAIkO,GAAY/N,IAAiB,SAASzd,EAAQirB,EAAM52B,GACtD,OAAO2L,GAAU3L,EAAQ,IAAM,IAAM42B,EAAKC,aAC3C,IA+DD,IAAIO,GAAYhO,IAAiB,SAASzd,EAAQirB,EAAM52B,GACtD,OAAO2L,GAAU3L,EAAQ,IAAM,IAAM+2B,GAAWH,EACjD,IAqiBD,IAAIS,GAAYjO,IAAiB,SAASzd,EAAQirB,EAAM52B,GACtD,OAAO2L,GAAU3L,EAAQ,IAAM,IAAM42B,EAAKU,aAC3C,IAmBGP,GAAa9N,GAAgB,eAqBjC,SAASK,GAAMt3B,EAAQulC,EAASzO,GAI9B,OAHA92B,EAAS5F,GAAS4F,IAClBulC,EAAUzO,EAAQt7B,EAAY+pC,KAEd/pC,EArybpB,SAAwBwE,GACtB,OAAO2W,GAAiBgG,KAAK3c,EAC9B,CAoybYwlC,CAAexlC,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAOwd,MAAM/G,KAAkB,EACvC,CAwjbqCgvB,CAAazlC,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAOwd,MAAM/J,KAAgB,EACrC,CAurc4DiyB,CAAW1lC,GAE7DA,EAAOwd,MAAM+nB,IAAY,EACjC,CA0BD,IAAII,GAAUvT,IAAS,SAASptB,EAAMgU,GACpC,IACE,OAAOxX,GAAMwD,EAAMxJ,EAAWwd,EAC/B,CAAC,MAAOtV,GACP,OAAOi/B,GAAQj/B,GAAKA,EAAI,IAAI5G,GAAM4G,EACnC,CACF,IA4BGkiC,GAAU/N,IAAS,SAASpzB,EAAQohC,GAKtC,OAJAxsB,GAAUwsB,GAAa,SAAStrC,GAC9BA,EAAMgxB,GAAMhxB,GACZmrB,GAAgBjhB,EAAQlK,EAAK8lC,GAAK57B,EAAOlK,GAAMkK,GAChD,IACMA,CACR,IAoGD,SAASmuB,GAAS72B,GAChB,OAAkB,WAChB,OAAOA,CACR,CACF,CAgDD,IAAI+pC,GAAOlO,KAuBPmO,GAAYnO,IAAW,GAkB3B,SAASxI,GAASrzB,GAChB,OAAOA,CACR,CA4CD,SAASod,GAASnU,GAChB,OAAOmqB,GAA4B,mBAARnqB,EAAqBA,EAAO2hB,GAAU3hB,EAjte/C,GAktenB,CAsGD,IAAIghC,GAAS5T,IAAS,SAAS/G,EAAMrS,GACnC,gBAAgBvU,GACd,OAAOmoB,GAAWnoB,EAAQ4mB,EAAMrS,EACjC,CACF,IAyBGitB,GAAW7T,IAAS,SAAS3tB,EAAQuU,GACvC,gBAAgBqS,GACd,OAAOuB,GAAWnoB,EAAQ4mB,EAAMrS,EACjC,CACF,IAsCD,SAASktB,GAAMzhC,EAAQ1K,EAAQ0I,GAC7B,IAAIe,EAAQ7J,GAAKI,GACb8rC,EAAc3a,GAAcnxB,EAAQyJ,GAEzB,MAAXf,GACE4gB,GAAStpB,KAAY8rC,EAAYpsC,SAAW+J,EAAM/J,UACtDgJ,EAAU1I,EACVA,EAAS0K,EACTA,EAAS7G,KACTioC,EAAc3a,GAAcnxB,EAAQJ,GAAKI,KAE3C,IAAI0lC,IAAUpc,GAAS5gB,IAAY,UAAWA,IAAcA,EAAQg9B,OAChEnY,EAAS6D,GAAW1mB,GAqBxB,OAnBA4U,GAAUwsB,GAAa,SAAS3O,GAC9B,IAAIlyB,EAAOjL,EAAOm9B,GAClBzyB,EAAOyyB,GAAclyB,EACjBsiB,IACF7iB,EAAOtK,UAAU+8B,GAAc,WAC7B,IAAI3T,EAAW3lB,KAAK8lB,UACpB,GAAI+b,GAASlc,EAAU,CACrB,IAAI5J,EAASlV,EAAO7G,KAAK4lB,aAKzB,OAJc7J,EAAO8J,YAAc4B,GAAUznB,KAAK6lB,cAE1CniB,KAAK,CAAE0D,KAAQA,EAAMgU,KAAQzd,UAAWwd,QAAWtU,IAC3DkV,EAAO+J,UAAYH,EACZ5J,CACR,CACD,OAAO3U,EAAKxD,MAAMiD,EAAQwV,GAAU,CAACrc,KAAK7B,SAAUR,WACrD,EAEJ,IAEMkJ,CACR,CAkCD,SAASy2B,KAER,CA+CD,IAAIiL,GAAOpM,GAAW/f,IA8BlBosB,GAAYrM,GAAWxgB,IAiCvB8sB,GAAWtM,GAAWxf,IAwB1B,SAASgV,GAASlE,GAChB,OAAO6E,GAAM7E,GAAQ5Q,GAAa8Q,GAAMF,IAh3X1C,SAA0BA,GACxB,OAAO,SAAS5mB,GACd,OAAO2mB,GAAQ3mB,EAAQ4mB,EACxB,CACF,CA42XkDib,CAAiBjb,EACnE,CAsED,IAAIrkB,GAAQozB,KAsCRmM,GAAanM,IAAY,GAoB7B,SAASkC,KACP,MAAO,EACR,CAeD,SAASQ,KACP,OAAO,CACR,CA8JD,IAAIt+B,GAAMq7B,IAAoB,SAAS2M,EAAQC,GAC7C,OAAOD,EAASC,CACjB,GAAE,GAuBC7lB,GAAOka,GAAY,QAiBnB4L,GAAS7M,IAAoB,SAAS8M,EAAUC,GAClD,OAAOD,EAAWC,CACnB,GAAE,GAuBC9lB,GAAQga,GAAY,SAwKxB,IAAI+L,GAAWhN,IAAoB,SAASiN,EAAYC,GACtD,OAAOD,EAAaC,CACrB,GAAE,GAuBCC,GAAQlM,GAAY,SAiBpBmM,GAAWpN,IAAoB,SAASqN,EAASC,GACnD,OAAOD,EAAUC,CAClB,GAAE,GAgmBH,OA1iBArkB,GAAOskB,MAp6MP,SAAe5rB,EAAGxW,GAChB,GAAmB,mBAARA,EACT,MAAUsZ,IAAAA,GAAUzO,GAGtB,OADA2L,EAAIwf,GAAUxf,GACP,WACL,KAAMA,EAAI,EACR,OAAOxW,EAAKxD,MAAM5D,KAAMrC,UAE3B,CACF,EA25MDunB,GAAO6V,IAAMA,GACb7V,GAAOygB,OAASA,GAChBzgB,GAAO0gB,SAAWA,GAClB1gB,GAAO2gB,aAAeA,GACtB3gB,GAAO4gB,WAAaA,GACpB5gB,GAAO6gB,GAAKA,GACZ7gB,GAAOsd,OAASA,GAChBtd,GAAOud,KAAOA,GACdvd,GAAO8iB,QAAUA,GACjB9iB,GAAOwd,QAAUA,GACjBxd,GAAOukB,UAl8KP,WACE,IAAK9rC,UAAU9B,OACb,MAAO,GAET,IAAIsC,EAAQR,UAAU,GACtB,OAAO1B,GAAQkC,GAASA,EAAQ,CAACA,EAClC,EA67KD+mB,GAAO2c,MAAQA,GACf3c,GAAOwkB,MApgTP,SAAeziC,EAAO2F,EAAMssB,GAExBtsB,GADGssB,EAAQC,GAAelyB,EAAO2F,EAAMssB,GAAStsB,IAAShP,GAClD,EAEA8lB,GAAU0Z,GAAUxwB,GAAO,GAEpC,IAAI/Q,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,IAAKA,GAAU+Q,EAAO,EACpB,MAAO,GAMT,IAJA,IAAIwD,EAAQ,EACR0L,EAAW,EACXC,EAAS/f,GAAM+mB,GAAWlnB,EAAS+Q,IAEhCwD,EAAQvU,GACbkgB,EAAOD,KAAcoZ,GAAUjuB,EAAOmJ,EAAQA,GAASxD,GAEzD,OAAOmP,CACR,EAm/SDmJ,GAAOykB,QAl+SP,SAAiB1iC,GAMf,IALA,IAAImJ,GAAS,EACTvU,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACnCigB,EAAW,EACXC,EAAS,KAEJ3L,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdjS,IACF4d,EAAOD,KAAc3d,EAExB,CACD,OAAO4d,CACR,EAs9SDmJ,GAAOza,OA97SP,WACE,IAAI5O,EAAS8B,UAAU9B,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAIuf,EAAOpf,GAAMH,EAAS,GACtBoL,EAAQtJ,UAAU,GAClByS,EAAQvU,EAELuU,KACLgL,EAAKhL,EAAQ,GAAKzS,UAAUyS,GAE9B,OAAOiM,GAAUpgB,GAAQgL,GAASwgB,GAAUxgB,GAAS,CAACA,GAAQ8lB,GAAY3R,EAAM,GACjF,EAk7SD8J,GAAO0kB,KA3tCP,SAAcvd,GACZ,IAAIxwB,EAAkB,MAATwwB,EAAgB,EAAIA,EAAMxwB,OACnCkgC,EAAazI,KASjB,OAPAjH,EAASxwB,EAAcugB,GAASiQ,GAAO,SAASgR,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAU3c,IAAAA,GAAUzO,GAEtB,MAAO,CAAC8pB,EAAWsB,EAAK,IAAKA,EAAK,GACnC,IALiB,GAOX7I,IAAS,SAASpZ,GAEvB,IADA,IAAIhL,GAAS,IACJA,EAAQvU,GAAQ,CACvB,IAAIwhC,EAAOhR,EAAMjc,GACjB,GAAIxM,GAAMy5B,EAAK,GAAIr9B,KAAMob,GACvB,OAAOxX,GAAMy5B,EAAK,GAAIr9B,KAAMob,EAE/B,CACF,GACF,EAwsCD8J,GAAO2kB,SA9qCP,SAAkB1tC,GAChB,OAz5YF,SAAsBA,GACpB,IAAIyJ,EAAQ7J,GAAKI,GACjB,OAAgB0K,SAAAA,GACd,OAAOskB,GAAetkB,EAAQ1K,EAAQyJ,EACvC,CACF,CAo5YQkkC,CAAa/gB,GAAU5sB,EA/ieZ,GAgjenB,EA6qCD+oB,GAAO8P,SAAWA,GAClB9P,GAAO8c,QAAUA,GACjB9c,GAAOnD,OAtuHP,SAAgBxlB,EAAWwtC,GACzB,IAAIhuB,EAASwJ,GAAWhpB,GACxB,OAAqB,MAAdwtC,EAAqBhuB,EAASqM,GAAWrM,EAAQguB,EACzD,EAouHD7kB,GAAO8kB,MAzuMP,SAASA,EAAM5iC,EAAM4zB,EAAO9B,GAE1B,IAAInd,EAAS0hB,GAAWr2B,EA7+TN,EA6+T6BxJ,EAAWA,EAAWA,EAAWA,EAAWA,EAD3Fo9B,EAAQ9B,EAAQt7B,EAAYo9B,GAG5B,OADAjf,EAAOqD,YAAc4qB,EAAM5qB,YACpBrD,CACR,EAquMDmJ,GAAO+kB,WA7rMP,SAASA,EAAW7iC,EAAM4zB,EAAO9B,GAE/B,IAAInd,EAAS0hB,GAAWr2B,EAAMgL,EAAuBxU,EAAWA,EAAWA,EAAWA,EAAWA,EADjGo9B,EAAQ9B,EAAQt7B,EAAYo9B,GAG5B,OADAjf,EAAOqD,YAAc6qB,EAAW7qB,YACzBrD,CACR,EAyrMDmJ,GAAOyd,SAAWA,GAClBzd,GAAO7E,SAAWA,GAClB6E,GAAOghB,aAAeA,GACtBhhB,GAAO+e,MAAQA,GACf/e,GAAOgf,MAAQA,GACfhf,GAAOkb,WAAaA,GACpBlb,GAAOmb,aAAeA,GACtBnb,GAAOob,eAAiBA,GACxBpb,GAAOglB,KAt0SP,SAAcjjC,EAAO2W,EAAGsb,GACtB,IAAIr9B,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAKA,EAIEq5B,GAAUjuB,GADjB2W,EAAKsb,GAAStb,IAAMhgB,EAAa,EAAIw/B,GAAUxf,IACnB,EAAI,EAAIA,EAAG/hB,GAH9B,EAIV,EAg0SDqpB,GAAOilB,UArySP,SAAmBljC,EAAO2W,EAAGsb,GAC3B,IAAIr9B,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAKA,EAKEq5B,GAAUjuB,EAAO,GADxB2W,EAAI/hB,GADJ+hB,EAAKsb,GAAStb,IAAMhgB,EAAa,EAAIw/B,GAAUxf,KAEhB,EAAI,EAAIA,GAJ9B,EAKV,EA8xSDsH,GAAOklB,eAzvSP,SAAwBnjC,EAAO2U,GAC7B,OAAQ3U,GAASA,EAAMpL,OACnB66B,GAAUzvB,EAAOqsB,GAAY1X,EAAW,IAAI,GAAM,GAClD,EACL,EAsvSDsJ,GAAOmlB,UAjtSP,SAAmBpjC,EAAO2U,GACxB,OAAQ3U,GAASA,EAAMpL,OACnB66B,GAAUzvB,EAAOqsB,GAAY1X,EAAW,IAAI,GAC5C,EACL,EA8sSDsJ,GAAOolB,KA/qSP,SAAcrjC,EAAO9I,EAAOqK,EAAOE,GACjC,IAAI7M,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAKA,GAGD2M,GAAyB,iBAATA,GAAqB2wB,GAAelyB,EAAO9I,EAAOqK,KACpEA,EAAQ,EACRE,EAAM7M,GAzvIV,SAAkBoL,EAAO9I,EAAOqK,EAAOE,GACrC,IAAI7M,EAASoL,EAAMpL,OAWnB,KATA2M,EAAQ40B,GAAU50B,IACN,IACVA,GAASA,EAAQ3M,EAAS,EAAKA,EAAS2M,IAE1CE,EAAOA,IAAQ9K,GAAa8K,EAAM7M,EAAUA,EAASuhC,GAAU10B,IACrD,IACRA,GAAO7M,GAET6M,EAAMF,EAAQE,EAAM,EAAI+8B,GAAS/8B,GAC1BF,EAAQE,GACbzB,EAAMuB,KAAWrK,EAEnB,OAAO8I,CACR,CA2uIQsjC,CAAStjC,EAAO9I,EAAOqK,EAAOE,IAN5B,EAOV,EAsqSDwc,GAAOva,OA3vOP,SAAgBoS,EAAYnB,GAE1B,OADW3f,GAAQ8gB,GAAclB,GAAciR,IACnC/P,EAAYuW,GAAY1X,EAAW,GAChD,EAyvODsJ,GAAOslB,QAvqOP,SAAiBztB,EAAYxB,GAC3B,OAAOwR,GAAYrmB,GAAIqW,EAAYxB,GAAW,EAC/C,EAsqOD2J,GAAOulB,YAhpOP,SAAqB1tB,EAAYxB,GAC/B,OAAOwR,GAAYrmB,GAAIqW,EAAYxB,GAAW9I,EAC/C,EA+oODyS,GAAOwlB,aAxnOP,SAAsB3tB,EAAYxB,EAAUyR,GAE1C,OADAA,EAAQA,IAAUpvB,EAAY,EAAIw/B,GAAUpQ,GACrCD,GAAYrmB,GAAIqW,EAAYxB,GAAWyR,EAC/C,EAsnOD9H,GAAOqZ,QAAUA,GACjBrZ,GAAOylB,YAviSP,SAAqB1jC,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAMpL,QACvBkxB,GAAY9lB,EAAOwL,GAAY,EAChD,EAqiSDyS,GAAO0lB,aA/gSP,SAAsB3jC,EAAO+lB,GAE3B,OADsB,MAAT/lB,EAAgB,EAAIA,EAAMpL,QAKhCkxB,GAAY9lB,EADnB+lB,EAAQA,IAAUpvB,EAAY,EAAIw/B,GAAUpQ,IAFnC,EAIV,EAygSD9H,GAAO2lB,KAz9LP,SAAczjC,GACZ,OAAOq2B,GAAWr2B,EA5wUD,IA6wUlB,EAw9LD8d,GAAOgjB,KAAOA,GACdhjB,GAAOijB,UAAYA,GACnBjjB,GAAO4lB,UA3/RP,SAAmBze,GAKjB,IAJA,IAAIjc,GAAS,EACTvU,EAAkB,MAATwwB,EAAgB,EAAIA,EAAMxwB,OACnCkgB,EAAS,CAFb,IAIS3L,EAAQvU,GAAQ,CACvB,IAAIwhC,EAAOhR,EAAMjc,GACjB2L,EAAOshB,EAAK,IAAMA,EAAK,EACxB,CACD,OAAOthB,CACR,EAk/RDmJ,GAAO6lB,UA38GP,SAAmBlkC,GACjB,OAAiB,MAAVA,EAAiB,GAAKymB,GAAczmB,EAAQ9K,GAAK8K,GACzD,EA08GDqe,GAAO8lB,YAj7GP,SAAqBnkC,GACnB,OAAiB,MAAVA,EAAiB,GAAKymB,GAAczmB,EAAQkjB,GAAOljB,GAC3D,EAg7GDqe,GAAOid,QAAUA,GACjBjd,GAAO+lB,QA56RP,SAAiBhkC,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMpL,QACvBq5B,GAAUjuB,EAAO,GAAI,GAAK,EAC3C,EA06RDie,GAAOwb,aAAeA,GACtBxb,GAAO0b,eAAiBA,GACxB1b,GAAO2b,iBAAmBA,GAC1B3b,GAAOkhB,OAASA,GAChBlhB,GAAOmhB,SAAWA,GAClBnhB,GAAOkd,UAAYA,GACnBld,GAAO3J,SAAWA,GAClB2J,GAAOmd,MAAQA,GACfnd,GAAOnpB,KAAOA,GACdmpB,GAAO6E,OAASA,GAChB7E,GAAOxe,IAAMA,GACbwe,GAAOgmB,QA1rGP,SAAiBrkC,EAAQ0U,GACvB,IAAIQ,EAAS,CAAb,EAMA,OALAR,EAAW+X,GAAY/X,EAAU,GAEjCiR,GAAW3lB,GAAQ,SAAS1I,EAAOxB,EAAKkK,GACtCihB,GAAgB/L,EAAQR,EAASpd,EAAOxB,EAAKkK,GAAS1I,EACvD,IACM4d,CACR,EAmrGDmJ,GAAOimB,UArpGP,SAAmBtkC,EAAQ0U,GACzB,IAAIQ,EAAS,CAAb,EAMA,OALAR,EAAW+X,GAAY/X,EAAU,GAEjCiR,GAAW3lB,GAAQ,SAAS1I,EAAOxB,EAAKkK,GACtCihB,GAAgB/L,EAAQpf,EAAK4e,EAASpd,EAAOxB,EAAKkK,GACnD,IACMkV,CACR,EA8oGDmJ,GAAOkmB,QAphCP,SAAiBjvC,GACf,OAAOu1B,GAAY3I,GAAU5sB,EAxveX,GAyvenB,EAmhCD+oB,GAAOmmB,gBAh/BP,SAAyB5d,EAAM2D,GAC7B,OAAOK,GAAoBhE,EAAM1E,GAAUqI,EA7xezB,GA8xenB,EA++BDlM,GAAO4a,QAAUA,GACjB5a,GAAOqhB,MAAQA,GACfrhB,GAAOihB,UAAYA,GACnBjhB,GAAOkjB,OAASA,GAChBljB,GAAOmjB,SAAWA,GAClBnjB,GAAOojB,MAAQA,GACfpjB,GAAOof,OAASA,GAChBpf,GAAOomB,OAzzBP,SAAgB1tB,GAEd,OADAA,EAAIwf,GAAUxf,GACP4W,IAAS,SAASpZ,GACvB,OAAO8X,GAAQ9X,EAAMwC,EACtB,GACF,EAqzBDsH,GAAOshB,KAAOA,GACdthB,GAAOqmB,OAnhGP,SAAgB1kC,EAAQ+U,GACtB,OAAO+qB,GAAO9/B,EAAQy9B,GAAOhR,GAAY1X,IAC1C,EAkhGDsJ,GAAOsmB,KA73LP,SAAcpkC,GACZ,OAAOo7B,GAAO,EAAGp7B,EAClB,EA43LD8d,GAAOumB,QAr4NP,SAAiB1uB,EAAYqW,EAAWC,EAAQ6F,GAC9C,OAAkB,MAAdnc,EACK,IAEJ9gB,GAAQm3B,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCn3B,GADLo3B,EAAS6F,EAAQt7B,EAAYy1B,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYpW,EAAYqW,EAAWC,GAC3C,EA03NDnO,GAAOqjB,KAAOA,GACdrjB,GAAOqf,SAAWA,GAClBrf,GAAOsjB,UAAYA,GACnBtjB,GAAOujB,SAAWA,GAClBvjB,GAAOwf,QAAUA,GACjBxf,GAAOyf,aAAeA,GACtBzf,GAAOod,UAAYA,GACnBpd,GAAO5E,KAAOA,GACd4E,GAAOyhB,OAASA,GAChBzhB,GAAOyM,SAAWA,GAClBzM,GAAOwmB,WA/rBP,SAAoB7kC,GAClB,OAAgB4mB,SAAAA,GACd,OAAiB,MAAV5mB,EAAiBjJ,EAAY4vB,GAAQ3mB,EAAQ4mB,EACrD,CACF,EA4rBDvI,GAAO4b,KAAOA,GACd5b,GAAO6b,QAAUA,GACjB7b,GAAOymB,UApsRP,SAAmB1kC,EAAOqV,EAAQf,GAChC,OAAQtU,GAASA,EAAMpL,QAAUygB,GAAUA,EAAOzgB,OAC9Co4B,GAAYhtB,EAAOqV,EAAQgX,GAAY/X,EAAU,IACjDtU,CACL,EAisRDie,GAAO0mB,YAxqRP,SAAqB3kC,EAAOqV,EAAQH,GAClC,OAAQlV,GAASA,EAAMpL,QAAUygB,GAAUA,EAAOzgB,OAC9Co4B,GAAYhtB,EAAOqV,EAAQ1e,EAAWue,GACtClV,CACL,EAqqRDie,GAAO8b,OAASA,GAChB9b,GAAO9b,MAAQA,GACf8b,GAAOyjB,WAAaA,GACpBzjB,GAAO0f,MAAQA,GACf1f,GAAO2mB,OAxvNP,SAAgB9uB,EAAYnB,GAE1B,OADW3f,GAAQ8gB,GAAclB,GAAciR,IACnC/P,EAAYunB,GAAOhR,GAAY1X,EAAW,IACvD,EAsvNDsJ,GAAO4mB,OAzmRP,SAAgB7kC,EAAO2U,GACrB,IAAIG,EAAS,GACb,IAAM9U,IAASA,EAAMpL,OACnB,OAAOkgB,EAET,IAAI3L,GAAS,EACTgkB,EAAU,GACVv4B,EAASoL,EAAMpL,OAGnB,IADA+f,EAAY0X,GAAY1X,EAAW,KAC1BxL,EAAQvU,GAAQ,CACvB,IAAIsC,EAAQ8I,EAAMmJ,GACdwL,EAAUzd,EAAOiS,EAAOnJ,KAC1B8U,EAAOrY,KAAKvF,GACZi2B,EAAQ1wB,KAAK0M,GAEhB,CAED,OADA+jB,GAAWltB,EAAOmtB,GACXrY,CACR,EAulRDmJ,GAAO6mB,KAluLP,SAAc3kC,EAAMoB,GAClB,GAAmB,mBAARpB,EACT,MAAUsZ,IAAAA,GAAUzO,GAGtB,OAAOuiB,GAASptB,EADhBoB,EAAQA,IAAU5K,EAAY4K,EAAQ40B,GAAU50B,GAEjD,EA6tLD0c,GAAOjB,QAAUA,GACjBiB,GAAO8mB,WAhtNP,SAAoBjvB,EAAYa,EAAGsb,GAOjC,OALEtb,GADGsb,EAAQC,GAAepc,EAAYa,EAAGsb,GAAStb,IAAMhgB,GACpD,EAEAw/B,GAAUxf,IAEL3hB,GAAQ8gB,GAAcwK,GAAkBqN,IACvC7X,EAAYa,EACzB,EAysNDsH,GAAO5F,IAv6FP,SAAazY,EAAQ4mB,EAAMtvB,GACzB,OAAiB,MAAV0I,EAAiBA,EAASmtB,GAAQntB,EAAQ4mB,EAAMtvB,EACxD,EAs6FD+mB,GAAO+mB,QA54FP,SAAiBplC,EAAQ4mB,EAAMtvB,EAAO8qB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAarrB,EAC3C,MAAViJ,EAAiBA,EAASmtB,GAAQntB,EAAQ4mB,EAAMtvB,EAAO8qB,EAC/D,EA04FD/D,GAAOgnB,QA1rNP,SAAiBnvB,GAEf,OADW9gB,GAAQ8gB,GAAc4K,GAAesN,IACpClY,EACb,EAwrNDmI,GAAOpH,MAhjRP,SAAe7W,EAAOuB,EAAOE,GAC3B,IAAI7M,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAKA,GAGD6M,GAAqB,iBAAPA,GAAmBywB,GAAelyB,EAAOuB,EAAOE,IAChEF,EAAQ,EACRE,EAAM7M,IAGN2M,EAAiB,MAATA,EAAgB,EAAI40B,GAAU50B,GACtCE,EAAMA,IAAQ9K,EAAY/B,EAASuhC,GAAU10B,IAExCwsB,GAAUjuB,EAAOuB,EAAOE,IAVtB,EAWV,EAmiRDwc,GAAOqd,OAASA,GAChBrd,GAAOinB,WAx3QP,SAAoBllC,GAClB,OAAQA,GAASA,EAAMpL,OACnBs6B,GAAelvB,GACf,EACL,EAq3QDie,GAAOknB,aAn2QP,SAAsBnlC,EAAOsU,GAC3B,OAAQtU,GAASA,EAAMpL,OACnBs6B,GAAelvB,EAAOqsB,GAAY/X,EAAU,IAC5C,EACL,EAg2QD2J,GAAOpF,MA5hEP,SAAe1d,EAAQiqC,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBnT,GAAe/2B,EAAQiqC,EAAWC,KACzED,EAAYC,EAAQ1uC,IAEtB0uC,EAAQA,IAAU1uC,EAAYgV,EAAmB05B,IAAU,IAI3DlqC,EAAS5F,GAAS4F,MAEQ,iBAAbiqC,GACO,MAAbA,IAAsBvxB,GAASuxB,OAEpCA,EAAYhW,GAAagW,KACPvtB,GAAW1c,GACpBm1B,GAAU5X,GAAcvd,GAAS,EAAGkqC,GAGxClqC,EAAO0d,MAAMusB,EAAWC,GAZtB,EAaV,EA0gEDpnB,GAAOqnB,OAnsLP,SAAgBnlC,EAAMoB,GACpB,GAAmB,mBAARpB,EACT,MAAM,IAAIsZ,GAAUzO,GAGtB,OADAzJ,EAAiB,MAATA,EAAgB,EAAIkb,GAAU0Z,GAAU50B,GAAQ,GACjDgsB,IAAS,SAASpZ,GACvB,IAAInU,EAAQmU,EAAK5S,GACb22B,EAAY5H,GAAUnc,EAAM,EAAG5S,GAKnC,OAHIvB,GACFoV,GAAU8iB,EAAWl4B,GAEhBrD,GAAMwD,EAAMpH,KAAMm/B,EAC1B,GACF,EAsrLDja,GAAOsnB,KAl1QP,SAAcvlC,GACZ,IAAIpL,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAOA,EAASq5B,GAAUjuB,EAAO,EAAGpL,GAAU,EAC/C,EAg1QDqpB,GAAOunB,KArzQP,SAAcxlC,EAAO2W,EAAGsb,GACtB,OAAMjyB,GAASA,EAAMpL,OAIdq5B,GAAUjuB,EAAO,GADxB2W,EAAKsb,GAAStb,IAAMhgB,EAAa,EAAIw/B,GAAUxf,IAChB,EAAI,EAAIA,GAH9B,EAIV,EAgzQDsH,GAAOwnB,UArxQP,SAAmBzlC,EAAO2W,EAAGsb,GAC3B,IAAIr9B,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,OAAKA,EAKEq5B,GAAUjuB,GADjB2W,EAAI/hB,GADJ+hB,EAAKsb,GAAStb,IAAMhgB,EAAa,EAAIw/B,GAAUxf,KAEnB,EAAI,EAAIA,EAAG/hB,GAJ9B,EAKV,EA8wQDqpB,GAAOynB,eAzuQP,SAAwB1lC,EAAO2U,GAC7B,OAAQ3U,GAASA,EAAMpL,OACnB66B,GAAUzvB,EAAOqsB,GAAY1X,EAAW,IAAI,GAAO,GACnD,EACL,EAsuQDsJ,GAAO0nB,UAjsQP,SAAmB3lC,EAAO2U,GACxB,OAAQ3U,GAASA,EAAMpL,OACnB66B,GAAUzvB,EAAOqsB,GAAY1X,EAAW,IACxC,EACL,EA8rQDsJ,GAAO2nB,IApuPP,SAAa1uC,EAAO2jC,GAElB,OADAA,EAAY3jC,GACLA,CACR,EAkuPD+mB,GAAO4nB,SA9oLP,SAAkB1lC,EAAMikB,EAAMxmB,GAC5B,IAAIq+B,GAAU,EACV3J,GAAW,EAEf,GAAmB,mBAARnyB,EACT,MAAM,IAAIsZ,GAAUzO,GAMtB,OAJIwT,GAAS5gB,KACXq+B,EAAU,YAAar+B,IAAYA,EAAQq+B,QAAUA,EACrD3J,EAAW,aAAc10B,IAAYA,EAAQ00B,SAAWA,GAEnDoJ,GAASv7B,EAAMikB,EAAM,CAC1B6X,QAAWA,EACXJ,QAAWzX,EACXkO,SAAYA,GAEf,EA+nLDrU,GAAOkV,KAAOA,GACdlV,GAAOkgB,QAAUA,GACjBlgB,GAAO2hB,QAAUA,GACjB3hB,GAAO4hB,UAAYA,GACnB5hB,GAAO6nB,OArfP,SAAgB5uC,GACd,OAAIlC,GAAQkC,GACHie,GAASje,EAAOwvB,IAElBd,GAAS1uB,GAAS,CAACA,GAASspB,GAAU4P,GAAa76B,GAAS2B,IACpE,EAifD+mB,GAAO8N,cAAgBA,GACvB9N,GAAOhG,UA10FP,SAAmBrY,EAAQ0U,EAAUC,GACnC,IAAIpe,EAAQnB,GAAQ4K,GAChBmmC,EAAY5vC,GAASkmB,GAASzc,IAAWqU,GAAarU,GAG1D,GADA0U,EAAW+X,GAAY/X,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI2O,EAAOtjB,GAAUA,EAAOjL,YAE1B4f,EADEwxB,EACY5vC,EAAQ,IAAI+sB,EAAO,GAE1B1E,GAAS5e,IACF0mB,GAAWpD,GAAQ5E,GAAW3D,GAAa/a,IAG3C,CAAd,CAEH,CAID,OAHCmmC,EAAYvxB,GAAY+Q,IAAY3lB,GAAQ,SAAS1I,EAAOiS,EAAOvJ,GAClE,OAAO0U,EAASC,EAAard,EAAOiS,EAAOvJ,EAC5C,IACM2U,CACR,EAszFD0J,GAAO+nB,MArnLP,SAAe7lC,GACb,OAAO2zB,GAAI3zB,EAAM,EAClB,EAonLD8d,GAAO+b,MAAQA,GACf/b,GAAOgc,QAAUA,GACjBhc,GAAOic,UAAYA,GACnBjc,GAAOgoB,KAzmQP,SAAcjmC,GACZ,OAAQA,GAASA,EAAMpL,OAAUy6B,GAASrvB,GAAS,EACpD,EAwmQDie,GAAOioB,OA/kQP,SAAgBlmC,EAAOsU,GACrB,OAAQtU,GAASA,EAAMpL,OAAUy6B,GAASrvB,EAAOqsB,GAAY/X,EAAU,IAAM,EAC9E,EA8kQD2J,GAAOkoB,SAxjQP,SAAkBnmC,EAAOkV,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAave,EACpDqJ,GAASA,EAAMpL,OAAUy6B,GAASrvB,EAAOrJ,EAAWue,GAAc,EAC3E,EAsjQD+I,GAAOmoB,MAhyFP,SAAexmC,EAAQ4mB,GACrB,OAAiB,MAAV5mB,GAAwBytB,GAAUztB,EAAQ4mB,EAClD,EA+xFDvI,GAAOkc,MAAQA,GACflc,GAAOoc,UAAYA,GACnBpc,GAAOooB,OApwFP,SAAgBzmC,EAAQ4mB,EAAMptB,GAC5B,OAAiB,MAAVwG,EAAiBA,EAAS4vB,GAAW5vB,EAAQ4mB,EAAM2J,GAAa/2B,GACxE,EAmwFD6kB,GAAOqoB,WAzuFP,SAAoB1mC,EAAQ4mB,EAAMptB,EAAS4oB,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAarrB,EAC3C,MAAViJ,EAAiBA,EAAS4vB,GAAW5vB,EAAQ4mB,EAAM2J,GAAa/2B,GAAU4oB,EAClF,EAuuFD/D,GAAO5I,OAASA,GAChB4I,GAAOsoB,SAhrFP,SAAkB3mC,GAChB,OAAiB,MAAVA,EAAiB,GAAKqX,GAAWrX,EAAQkjB,GAAOljB,GACxD,EA+qFDqe,GAAOqc,QAAUA,GACjBrc,GAAOwU,MAAQA,GACfxU,GAAOuoB,KA3mLP,SAActvC,EAAOk8B,GACnB,OAAOqK,GAAQtN,GAAaiD,GAAUl8B,EACvC,EA0mLD+mB,GAAOsc,IAAMA,GACbtc,GAAOuc,MAAQA,GACfvc,GAAOwc,QAAUA,GACjBxc,GAAOyc,IAAMA,GACbzc,GAAOwoB,UAj3PP,SAAmB9nC,EAAO0W,GACxB,OAAO0a,GAAcpxB,GAAS,GAAI0W,GAAU,GAAIyL,GACjD,EAg3PD7C,GAAOyoB,cA/1PP,SAAuB/nC,EAAO0W,GAC5B,OAAO0a,GAAcpxB,GAAS,GAAI0W,GAAU,GAAI0X,GACjD,EA81PD9O,GAAO0c,QAAUA,GAGjB1c,GAAO9V,QAAUy3B,GACjB3hB,GAAO0oB,UAAY9G,GACnB5hB,GAAO2oB,OAASjI,GAChB1gB,GAAO4oB,WAAajI,GAGpByC,GAAMpjB,GAAQA,IAKdA,GAAOtkB,IAAMA,GACbskB,GAAO6iB,QAAUA,GACjB7iB,GAAO6hB,UAAYA,GACnB7hB,GAAOgiB,WAAaA,GACpBhiB,GAAOlC,KAAOA,GACdkC,GAAO6oB,MAprFP,SAAe/mC,EAAQ6hB,EAAOC,GAa5B,OAZIA,IAAUlrB,IACZkrB,EAAQD,EACRA,EAAQjrB,GAENkrB,IAAUlrB,IAEZkrB,GADAA,EAAQ8T,GAAS9T,KACCA,EAAQA,EAAQ,GAEhCD,IAAUjrB,IAEZirB,GADAA,EAAQ+T,GAAS/T,KACCA,EAAQA,EAAQ,GAE7BnB,GAAUkV,GAAS51B,GAAS6hB,EAAOC,EAC3C,EAuqFD5D,GAAOib,MA7jLP,SAAehiC,GACb,OAAO4qB,GAAU5qB,EArzVI,EAszVtB,EA4jLD+mB,GAAO8oB,UApgLP,SAAmB7vC,GACjB,OAAO4qB,GAAU5qB,EAAOsoC,EACzB,EAmgLDvhB,GAAO+oB,cAr+KP,SAAuB9vC,EAAO8qB,GAE5B,OAAOF,GAAU5qB,EAAOsoC,EADxBxd,EAAkC,mBAAdA,EAA2BA,EAAarrB,EAE7D,EAm+KDsnB,GAAOgpB,UA7hLP,SAAmB/vC,EAAO8qB,GAExB,OAAOF,GAAU5qB,EAz1VI,EAw1VrB8qB,EAAkC,mBAAdA,EAA2BA,EAAarrB,EAE7D,EA2hLDsnB,GAAOipB,WA18KP,SAAoBtnC,EAAQ1K,GAC1B,OAAiB,MAAVA,GAAkBgvB,GAAetkB,EAAQ1K,EAAQJ,GAAKI,GAC9D,EAy8KD+oB,GAAOyU,OAASA,GAChBzU,GAAOkpB,UA1xCP,SAAmBjwC,EAAOyG,GACxB,OAAiB,MAATzG,GAAiBA,GAAUA,EAASyG,EAAezG,CAC5D,EAyxCD+mB,GAAO4jB,OAASA,GAChB5jB,GAAOmpB,SAz9EP,SAAkBjsC,EAAQ4F,EAAQvC,GAChCrD,EAAS5F,GAAS4F,GAClB4F,EAASquB,GAAaruB,GAEtB,IAAInM,EAASuG,EAAOvG,OAKhB6M,EAJJjD,EAAWA,IAAa7H,EACpB/B,EACA6rB,GAAU0V,GAAU33B,GAAW,EAAG5J,GAItC,OADA4J,GAAYuC,EAAOnM,SACA,GAAKuG,EAAO0b,MAAMrY,EAAUiD,IAAQV,CACxD,EA88EDkd,GAAO2C,GAAKA,GACZ3C,GAAO2G,OAj7EP,SAAgBzpB,GAEd,OADAA,EAAS5F,GAAS4F,KACA2S,EAAmBgK,KAAK3c,GACtCA,EAAO4b,QAAQnJ,EAAiB8J,IAChCvc,CACL,EA66ED8iB,GAAOopB,aA55EP,SAAsBlsC,GAEpB,OADAA,EAAS5F,GAAS4F,KACAmT,GAAgBwJ,KAAK3c,GACnCA,EAAO4b,QAAQ1I,GAAc,QAC7BlT,CACL,EAw5ED8iB,GAAOqpB,MA57OP,SAAexxB,EAAYnB,EAAWsd,GACpC,IAAI9xB,EAAOnL,GAAQ8gB,GAAcpB,GAAagR,GAI9C,OAHIuM,GAASC,GAAepc,EAAYnB,EAAWsd,KACjDtd,EAAYhe,GAEPwJ,EAAK2V,EAAYuW,GAAY1X,EAAW,GAChD,EAu7ODsJ,GAAO1Z,KAAOA,GACd0Z,GAAOqb,UAAYA,GACnBrb,GAAOspB,QArxHP,SAAiB3nC,EAAQ+U,GACvB,OAAOkB,GAAYjW,EAAQysB,GAAY1X,EAAW,GAAI4Q,GACvD,EAoxHDtH,GAAO+c,SAAWA,GAClB/c,GAAOsb,cAAgBA,GACvBtb,GAAOupB,YAjvHP,SAAqB5nC,EAAQ+U,GAC3B,OAAOkB,GAAYjW,EAAQysB,GAAY1X,EAAW,GAAI8Q,GACvD,EAgvHDxH,GAAOhC,MAAQA,GACfgC,GAAOzkB,QAAUA,GACjBykB,GAAOgd,aAAeA,GACtBhd,GAAOwpB,MArtHP,SAAe7nC,EAAQ0U,GACrB,OAAiB,MAAV1U,EACHA,EACAsmB,GAAQtmB,EAAQysB,GAAY/X,EAAU,GAAIwO,GAC/C,EAktHD7E,GAAOypB,WAtrHP,SAAoB9nC,EAAQ0U,GAC1B,OAAiB,MAAV1U,EACHA,EACAwmB,GAAaxmB,EAAQysB,GAAY/X,EAAU,GAAIwO,GACpD,EAmrHD7E,GAAO0pB,OArpHP,SAAgB/nC,EAAQ0U,GACtB,OAAO1U,GAAU2lB,GAAW3lB,EAAQysB,GAAY/X,EAAU,GAC3D,EAopHD2J,GAAO2pB,YAxnHP,SAAqBhoC,EAAQ0U,GAC3B,OAAO1U,GAAU6lB,GAAgB7lB,EAAQysB,GAAY/X,EAAU,GAChE,EAunHD2J,GAAO0D,IAAMA,GACb1D,GAAO2f,GAAKA,GACZ3f,GAAO4f,IAAMA,GACb5f,GAAO7G,IAzgHP,SAAaxX,EAAQ4mB,GACnB,OAAiB,MAAV5mB,GAAkB83B,GAAQ93B,EAAQ4mB,EAAMa,GAChD,EAwgHDpJ,GAAOsN,MAAQA,GACftN,GAAOub,KAAOA,GACdvb,GAAOsM,SAAWA,GAClBtM,GAAOlT,SA5pOP,SAAkB+K,EAAY5e,EAAO+e,EAAWgc,GAC9Cnc,EAAaoV,GAAYpV,GAAcA,EAAaT,GAAOS,GAC3DG,EAAaA,IAAcgc,EAASkE,GAAUlgB,GAAa,EAE3D,IAAIrhB,EAASkhB,EAAWlhB,OAIxB,OAHIqhB,EAAY,IACdA,EAAYwG,GAAU7nB,EAASqhB,EAAW,IAErC+nB,GAASloB,GACXG,GAAarhB,GAAUkhB,EAAWmX,QAAQ/1B,EAAO+e,IAAc,IAC7DrhB,GAAUogB,GAAYc,EAAY5e,EAAO+e,IAAc,CAC/D,EAkpODgI,GAAOgP,QA9lSP,SAAiBjtB,EAAO9I,EAAO+e,GAC7B,IAAIrhB,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAqB,MAAb8M,EAAoB,EAAIkgB,GAAUlgB,GAI9C,OAHI9M,EAAQ,IACVA,EAAQsT,GAAU7nB,EAASuU,EAAO,IAE7B6L,GAAYhV,EAAO9I,EAAOiS,EAClC,EAqlSD8U,GAAO4pB,QAlqFP,SAAiB9nC,EAAQwB,EAAOE,GAS9B,OARAF,EAAQi0B,GAASj0B,GACbE,IAAQ9K,GACV8K,EAAMF,EACNA,EAAQ,GAERE,EAAM+zB,GAAS/zB,GArsVnB,SAAqB1B,EAAQwB,EAAOE,GAClC,OAAO1B,GAAU2c,GAAUnb,EAAOE,IAAQ1B,EAAS0c,GAAUlb,EAAOE,EACrE,CAssVQqmC,CADP/nC,EAAS41B,GAAS51B,GACSwB,EAAOE,EACnC,EAypFDwc,GAAOohB,OAASA,GAChBphB,GAAO8B,YAAcA,GACrB9B,GAAOjpB,QAAUA,GACjBipB,GAAO1K,cAAgBA,GACvB0K,GAAOiN,YAAcA,GACrBjN,GAAO4N,kBAAoBA,GAC3B5N,GAAOlf,UAtwKP,SAAmB7H,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBgnB,GAAahnB,IAAU4vB,GAAW5vB,IAAU6U,CAChD,EAowKDkS,GAAO5B,SAAWA,GAClB4B,GAAOxK,OAASA,GAChBwK,GAAO8pB,UA7sKP,SAAmB7wC,GACjB,OAAOgnB,GAAahnB,IAA6B,IAAnBA,EAAM2b,WAAmBiZ,GAAc50B,EACtE,EA4sKD+mB,GAAO+pB,QAzqKP,SAAiB9wC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIg0B,GAAYh0B,KACXlC,GAAQkC,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMoT,QAC1D+R,GAASnlB,IAAU+c,GAAa/c,IAAU6oB,GAAY7oB,IAC1D,OAAQA,EAAMtC,OAEhB,IAAI2tB,EAAMC,GAAOtrB,GACjB,GAAIqrB,GAAOnW,GAAUmW,GAAO9V,EAC1B,OAAQvV,EAAMyO,KAEhB,GAAIilB,GAAY1zB,GACd,OAAQyzB,GAASzzB,GAAOtC,OAE1B,IAAK,IAAIc,KAAOwB,EACd,GAAI1B,GAAeC,KAAKyB,EAAOxB,GAC7B,OAAA,EAGJ,OAAO,CACR,EAopKDuoB,GAAOgqB,QAtnKP,SAAiB/wC,EAAOkwB,GACtB,OAAOe,GAAYjxB,EAAOkwB,EAC3B,EAqnKDnJ,GAAOiqB,YAnlKP,SAAqBhxC,EAAOkwB,EAAOpF,GAEjC,IAAIlN,GADJkN,EAAkC,mBAAdA,EAA2BA,EAAarrB,GAClCqrB,EAAW9qB,EAAOkwB,GAASzwB,EACrD,OAAOme,IAAWne,EAAYwxB,GAAYjxB,EAAOkwB,EAAOzwB,EAAWqrB,KAAgBlN,CACpF,EAglKDmJ,GAAO6f,QAAUA,GACjB7f,GAAOroB,SA1hKP,SAAkBsB,GAChB,MAAuB,iBAATA,GAAqBolB,GAAeplB,EACnD,EAyhKD+mB,GAAOqI,WAAaA,GACpBrI,GAAOpoB,UAAYA,GACnBooB,GAAO2Z,SAAWA,GAClB3Z,GAAOtK,MAAQA,GACfsK,GAAOkqB,QA11JP,SAAiBvoC,EAAQ1K,GACvB,OAAO0K,IAAW1K,GAAU80B,GAAYpqB,EAAQ1K,EAAQi2B,GAAaj2B,GACtE,EAy1JD+oB,GAAOmqB,YAvzJP,SAAqBxoC,EAAQ1K,EAAQ8sB,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAarrB,EACrDqzB,GAAYpqB,EAAQ1K,EAAQi2B,GAAaj2B,GAAS8sB,EAC1D,EAqzJD/D,GAAOxb,MAvxJP,SAAevL,GAIb,OAAO6mC,GAAS7mC,IAAUA,IAAUA,CACrC,EAmxJD+mB,GAAOoqB,SAvvJP,SAAkBnxC,GAChB,GAAI8gC,GAAW9gC,GACb,MAAUe,IAAAA,GAtsXM,mEAwsXlB,OAAOoyB,GAAanzB,EACrB,EAmvJD+mB,GAAOqqB,MAxsJP,SAAepxC,GACb,OAAgB,MAATA,CACR,EAusJD+mB,GAAOsqB,OAjuJP,SAAgBrxC,GACd,OAAiB,OAAVA,CACR,EAguJD+mB,GAAO8f,SAAWA,GAClB9f,GAAOO,SAAWA,GAClBP,GAAOC,aAAeA,GACtBD,GAAO6N,cAAgBA,GACvB7N,GAAOpK,SAAWA,GAClBoK,GAAOvb,cArlJP,SAAuBxL,GACrB,OAAOrB,GAAUqB,IAAUA,IAAS,kBAAqBA,GAASuU,CACnE,EAolJDwS,GAAOlK,MAAQA,GACfkK,GAAO+f,SAAWA,GAClB/f,GAAO2H,SAAWA,GAClB3H,GAAOhK,aAAeA,GACtBgK,GAAOuqB,YAn/IP,SAAqBtxC,GACnB,OAAOA,IAAUP,CAClB,EAk/IDsnB,GAAOwqB,UA/9IP,SAAmBvxC,GACjB,OAAOgnB,GAAahnB,IAAUsrB,GAAOtrB,IAAU0V,CAChD,EA89IDqR,GAAOyqB,UA38IP,SAAmBxxC,GACjB,OAAOgnB,GAAahnB,IAn6XP,oBAm6XiB4vB,GAAW5vB,EAC1C,EA08ID+mB,GAAOrhB,KAz/RP,SAAcoD,EAAOolC,GACnB,OAAgB,MAATplC,EAAgB,GAAKuc,GAAW9mB,KAAKuK,EAAOolC,EACpD,EAw/RDnnB,GAAOkiB,UAAYA,GACnBliB,GAAOgK,KAAOA,GACdhK,GAAO0qB,YAh9RP,SAAqB3oC,EAAO9I,EAAO+e,GACjC,IAAIrhB,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAQvU,EAKZ,OAJIqhB,IAActf,IAEhBwS,GADAA,EAAQgtB,GAAUlgB,IACF,EAAIwG,GAAU7nB,EAASuU,EAAO,GAAKuT,GAAUvT,EAAOvU,EAAS,IAExEsC,GAAUA,EArvMrB,SAA2B8I,EAAO9I,EAAO+e,GAEvC,IADA,IAAI9M,EAAQ8M,EAAY,EACjB9M,KACL,GAAInJ,EAAMmJ,KAAWjS,EACnB,OAAOiS,EAGX,OAAOA,CACR,CA8uMOy/B,CAAkB5oC,EAAO9I,EAAOiS,GAChC6M,GAAchW,EAAOoW,GAAWjN,GAAO,EAC5C,EAo8RD8U,GAAOmiB,UAAYA,GACnBniB,GAAOoiB,WAAaA,GACpBpiB,GAAOggB,GAAKA,GACZhgB,GAAOigB,IAAMA,GACbjgB,GAAOzc,IAhfP,SAAaxB,GACX,OAAQA,GAASA,EAAMpL,OACnB+wB,GAAa3lB,EAAOuqB,GAAUpD,IAC9BxwB,CACL,EA6eDsnB,GAAO4qB,MApdP,SAAe7oC,EAAOsU,GACpB,OAAQtU,GAASA,EAAMpL,OACnB+wB,GAAa3lB,EAAOqsB,GAAY/X,EAAU,GAAI6S,IAC9CxwB,CACL,EAidDsnB,GAAO6qB,KAjcP,SAAc9oC,GACZ,OAAOsW,GAAStW,EAAOuqB,GACxB,EAgcDtM,GAAO8qB,OAvaP,SAAgB/oC,EAAOsU,GACrB,OAAOgC,GAAStW,EAAOqsB,GAAY/X,EAAU,GAC9C,EAsaD2J,GAAOlc,IAlZP,SAAa/B,GACX,OAAQA,GAASA,EAAMpL,OACnB+wB,GAAa3lB,EAAOuqB,GAAUS,IAC9Br0B,CACL,EA+YDsnB,GAAO+qB,MAtXP,SAAehpC,EAAOsU,GACpB,OAAQtU,GAASA,EAAMpL,OACnB+wB,GAAa3lB,EAAOqsB,GAAY/X,EAAU,GAAI0W,IAC9Cr0B,CACL,EAmXDsnB,GAAOwZ,UAAYA,GACnBxZ,GAAOga,UAAYA,GACnBha,GAAOgrB,WAztBP,WACE,MAAO,CAAA,CACR,EAwtBDhrB,GAAOirB,WAzsBP,WACE,MAAO,EACR,EAwsBDjrB,GAAOkrB,SAzrBP,WACE,OAAO,CACR,EAwrBDlrB,GAAO+jB,SAAWA,GAClB/jB,GAAOmrB,IA77RP,SAAappC,EAAO2W,GAClB,OAAQ3W,GAASA,EAAMpL,OAAUq3B,GAAQjsB,EAAOm2B,GAAUxf,IAAMhgB,CACjE,EA47RDsnB,GAAOorB,WAliCP,WAIE,OAHI32B,GAAKpO,IAAMvL,OACb2Z,GAAKpO,EAAI+V,IAEXthB,IACD,EA8hCDklB,GAAOoY,KAAOA,GACdpY,GAAOtC,IAAMA,GACbsC,GAAOqrB,IAj5EP,SAAanuC,EAAQvG,EAAQygC,GAC3Bl6B,EAAS5F,GAAS4F,GAGlB,IAAIouC,GAFJ30C,EAASuhC,GAAUvhC,IAEM2jB,GAAWpd,GAAU,EAC9C,IAAKvG,GAAU20C,GAAa30C,EAC1B,OAAOuG,EAET,IAAIozB,GAAO35B,EAAS20C,GAAa,EACjC,OACEnU,GAAcpZ,GAAYuS,GAAM8G,GAChCl6B,EACAi6B,GAActZ,GAAWyS,GAAM8G,EAElC,EAo4EDpX,GAAOurB,OA32EP,SAAgBruC,EAAQvG,EAAQygC,GAC9Bl6B,EAAS5F,GAAS4F,GAGlB,IAAIouC,GAFJ30C,EAASuhC,GAAUvhC,IAEM2jB,GAAWpd,GAAU,EAC9C,OAAQvG,GAAU20C,EAAY30C,EACzBuG,EAASi6B,GAAcxgC,EAAS20C,EAAWlU,GAC5Cl6B,CACL,EAo2ED8iB,GAAOwrB,SA30EP,SAAkBtuC,EAAQvG,EAAQygC,GAChCl6B,EAAS5F,GAAS4F,GAGlB,IAAIouC,GAFJ30C,EAASuhC,GAAUvhC,IAEM2jB,GAAWpd,GAAU,EAC9C,OAAQvG,GAAU20C,EAAY30C,EACzBwgC,GAAcxgC,EAAS20C,EAAWlU,GAASl6B,EAC5CA,CACL,EAo0ED8iB,GAAOrb,SA1yEP,SAAkBzH,EAAQuuC,EAAOzX,GAM/B,OALIA,GAAkB,MAATyX,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ9sB,GAAernB,GAAS4F,GAAQ4b,QAAQxI,GAAa,IAAKm7B,GAAS,EAC3E,EAoyEDzrB,GAAOnB,OA1rFP,SAAgB8E,EAAOC,EAAO8nB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBzX,GAAetQ,EAAOC,EAAO8nB,KAC3E9nB,EAAQ8nB,EAAWhzC,GAEjBgzC,IAAahzC,IACK,kBAATkrB,GACT8nB,EAAW9nB,EACXA,EAAQlrB,GAEe,kBAATirB,IACd+nB,EAAW/nB,EACXA,EAAQjrB,IAGRirB,IAAUjrB,GAAakrB,IAAUlrB,GACnCirB,EAAQ,EACRC,EAAQ,IAGRD,EAAQ4T,GAAS5T,GACbC,IAAUlrB,GACZkrB,EAAQD,EACRA,EAAQ,GAERC,EAAQ2T,GAAS3T,IAGjBD,EAAQC,EAAO,CACjB,IAAI+nB,EAAOhoB,EACXA,EAAQC,EACRA,EAAQ+nB,CACT,CACD,GAAID,GAAY/nB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI+W,EAAO/b,KACX,OAAOH,GAAUkF,EAASgX,GAAQ/W,EAAQD,EAAQxP,GAAe,QAAUwmB,EAAO,IAAIhkC,OAAS,KAAOitB,EACvG,CACD,OAAOxB,GAAWuB,EAAOC,EAC1B,EAspFD5D,GAAO4rB,OA5+NP,SAAgB/zB,EAAYxB,EAAUC,GACpC,IAAIpU,EAAOnL,GAAQ8gB,GAAcP,GAAckB,GAC3CjB,EAAY9e,UAAU9B,OAAS,EAEnC,OAAOuL,EAAK2V,EAAYuW,GAAY/X,EAAU,GAAIC,EAAaiB,EAAW0L,GAC3E,EAw+NDjD,GAAO6rB,YAh9NP,SAAqBh0B,EAAYxB,EAAUC,GACzC,IAAIpU,EAAOnL,GAAQ8gB,GAAcL,GAAmBgB,GAChDjB,EAAY9e,UAAU9B,OAAS,EAEnC,OAAOuL,EAAK2V,EAAYuW,GAAY/X,EAAU,GAAIC,EAAaiB,EAAWgQ,GAC3E,EA48NDvH,GAAO8rB,OA/wEP,SAAgB5uC,EAAQwb,EAAGsb,GAMzB,OAJEtb,GADGsb,EAAQC,GAAe/2B,EAAQwb,EAAGsb,GAAStb,IAAMhgB,GAChD,EAEAw/B,GAAUxf,GAET2W,GAAW/3B,GAAS4F,GAASwb,EACrC,EAywEDsH,GAAOlH,QApvEP,WACE,IAAI5C,EAAOzd,UACPyE,EAAS5F,GAAS4e,EAAK,IAE3B,OAAOA,EAAKvf,OAAS,EAAIuG,EAASA,EAAO4b,QAAQ5C,EAAK,GAAIA,EAAK,GAChE,EAgvED8J,GAAOnJ,OAtoGP,SAAgBlV,EAAQ4mB,EAAM7oB,GAG5B,IAAIwL,GAAS,EACTvU,GAHJ4xB,EAAOC,GAASD,EAAM5mB,IAGJhL,OAOlB,IAJKA,IACHA,EAAS,EACTgL,EAASjJ,KAEFwS,EAAQvU,GAAQ,CACvB,IAAIsC,EAAkB,MAAV0I,EAAiBjJ,EAAYiJ,EAAO8mB,GAAMF,EAAKrd,KACvDjS,IAAUP,IACZwS,EAAQvU,EACRsC,EAAQyG,GAEViC,EAAS0mB,GAAWpvB,GAASA,EAAMzB,KAAKmK,GAAU1I,CACnD,CACD,OAAO0I,CACR,EAmnGDqe,GAAOkkB,MAAQA,GACflkB,GAAOhF,aAAeA,EACtBgF,GAAO+rB,OA15NP,SAAgBl0B,GAEd,OADW9gB,GAAQ8gB,GAAcsK,GAAcsN,IACnC5X,EACb,EAw5NDmI,GAAOtY,KA/0NP,SAAcmQ,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIoV,GAAYpV,GACd,OAAOkoB,GAASloB,GAAcyC,GAAWzC,GAAcA,EAAWlhB,OAEpE,IAAI2tB,EAAMC,GAAO1M,GACjB,OAAIyM,GAAOnW,GAAUmW,GAAO9V,EACnBqJ,EAAWnQ,KAEbglB,GAAS7U,GAAYlhB,MAC7B,EAo0NDqpB,GAAOqiB,UAAYA,GACnBriB,GAAOgsB,KA/xNP,SAAcn0B,EAAYnB,EAAWsd,GACnC,IAAI9xB,EAAOnL,GAAQ8gB,GAAcJ,GAAYwY,GAI7C,OAHI+D,GAASC,GAAepc,EAAYnB,EAAWsd,KACjDtd,EAAYhe,GAEPwJ,EAAK2V,EAAYuW,GAAY1X,EAAW,GAChD,EA0xNDsJ,GAAOisB,YAhsRP,SAAqBlqC,EAAO9I,GAC1B,OAAOi3B,GAAgBnuB,EAAO9I,EAC/B,EA+rRD+mB,GAAOksB,cApqRP,SAAuBnqC,EAAO9I,EAAOod,GACnC,OAAOka,GAAkBxuB,EAAO9I,EAAOm1B,GAAY/X,EAAU,GAC9D,EAmqRD2J,GAAOmsB,cAjpRP,SAAuBpqC,EAAO9I,GAC5B,IAAItC,EAAkB,MAAToL,EAAgB,EAAIA,EAAMpL,OACvC,GAAIA,EAAQ,CACV,IAAIuU,EAAQglB,GAAgBnuB,EAAO9I,GACnC,GAAIiS,EAAQvU,GAAUgsB,GAAG5gB,EAAMmJ,GAAQjS,GACrC,OAAOiS,CAEV,CACD,OAAQ,CACT,EAyoRD8U,GAAOosB,gBArnRP,SAAyBrqC,EAAO9I,GAC9B,OAAOi3B,GAAgBnuB,EAAO9I,GAAO,EACtC,EAonRD+mB,GAAOqsB,kBAzlRP,SAA2BtqC,EAAO9I,EAAOod,GACvC,OAAOka,GAAkBxuB,EAAO9I,EAAOm1B,GAAY/X,EAAU,IAAI,EAClE,EAwlRD2J,GAAOssB,kBAtkRP,SAA2BvqC,EAAO9I,GAEhC,GADsB,MAAT8I,EAAgB,EAAIA,EAAMpL,OAC3B,CACV,IAAIuU,EAAQglB,GAAgBnuB,EAAO9I,GAAO,GAAQ,EAClD,GAAI0pB,GAAG5gB,EAAMmJ,GAAQjS,GACnB,OAAOiS,CAEV,CACD,OAAQ,CACT,EA8jRD8U,GAAOsiB,UAAYA,GACnBtiB,GAAOusB,WA3oEP,SAAoBrvC,EAAQ4F,EAAQvC,GAOlC,OANArD,EAAS5F,GAAS4F,GAClBqD,EAAuB,MAAZA,EACP,EACAiiB,GAAU0V,GAAU33B,GAAW,EAAGrD,EAAOvG,QAE7CmM,EAASquB,GAAaruB,GACf5F,EAAO0b,MAAMrY,EAAUA,EAAWuC,EAAOnM,SAAWmM,CAC5D,EAooEDkd,GAAOmkB,SAAWA,GAClBnkB,GAAOwsB,IAzUP,SAAazqC,GACX,OAAQA,GAASA,EAAMpL,OACnB2hB,GAAQvW,EAAOuqB,IACf,CACL,EAsUDtM,GAAOysB,MA7SP,SAAe1qC,EAAOsU,GACpB,OAAQtU,GAASA,EAAMpL,OACnB2hB,GAAQvW,EAAOqsB,GAAY/X,EAAU,IACrC,CACL,EA0SD2J,GAAO0sB,SA7hEP,SAAkBxvC,EAAQyC,EAASq0B,GAIjC,IAAI2Y,EAAW3sB,GAAO0G,iBAElBsN,GAASC,GAAe/2B,EAAQyC,EAASq0B,KAC3Cr0B,EAAUjH,GAEZwE,EAAS5F,GAAS4F,GAClByC,EAAUghC,GAAa,CAAA,EAAIhhC,EAASgtC,EAAU3T,IAE9C,IAII4T,EACAC,EALA9lB,EAAU4Z,GAAa,GAAIhhC,EAAQonB,QAAS4lB,EAAS5lB,QAASiS,IAC9D8T,EAAcj2C,GAAKkwB,GACnBgmB,EAAgB/zB,GAAW+N,EAAS+lB,GAIpC5hC,EAAQ,EACR2b,EAAclnB,EAAQknB,aAAevV,GACrCra,EAAS,WAGT+1C,EAAeh2C,IAChB2I,EAAQgnB,QAAUrV,IAAWra,OAAS,IACvC4vB,EAAY5vB,OAAS,KACpB4vB,IAAgB7W,EAAgBc,GAAeQ,IAAWra,OAAS,KACnE0I,EAAQinB,UAAYtV,IAAWra,OAAS,KACzC,KAMEg2C,EAAY,kBACb11C,GAAeC,KAAKmI,EAAS,cACzBA,EAAQstC,UAAY,IAAIn0B,QAAQ,MAAO,KACvC,6BAA+B/E,GAAmB,KACnD,KAEN7W,EAAO4b,QAAQk0B,GAAc,SAAStyB,EAAOwyB,EAAaC,EAAkBC,EAAiBC,EAAeh2B,GAsB1G,OArBA81B,IAAqBA,EAAmBC,GAGxCn2C,GAAUiG,EAAO0b,MAAM1N,EAAOmM,GAAQyB,QAAQvH,GAAmBmI,IAG7DwzB,IACFN,GAAa,EACb31C,GAAU,YAAci2C,EAAc,UAEpCG,IACFR,GAAe,EACf51C,GAAU,OAASo2C,EAAgB,eAEjCF,IACFl2C,GAAU,iBAAmBk2C,EAAmB,+BAElDjiC,EAAQmM,EAASqD,EAAM/jB,OAIhB+jB,CACR,IAEDzjB,GAAU,OAIV,IAAI6vB,EAAWvvB,GAAeC,KAAKmI,EAAS,aAAeA,EAAQmnB,SACnE,GAAKA,MAKIlW,GAA2BiJ,KAAKiN,GACvC,UAAU9sB,GA3idmB,2DAsid7B/C,EAAS,iBAAmBA,EAAS,QASvCA,GAAU41C,EAAe51C,EAAO6hB,QAAQvJ,EAAsB,IAAMtY,GACjE6hB,QAAQtJ,EAAqB,MAC7BsJ,QAAQrJ,EAAuB,OAGlCxY,EAAS,aAAe6vB,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACC8lB,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ51C,EACA,gBAEF,IAAI4f,EAASgsB,IAAQ,WACnB,OAAOnuB,GAASo4B,EAAaG,EAAY,UAAYh2C,GAClDyH,MAAMhG,EAAWq0C,EACrB,IAKD,GADAl2B,EAAO5f,OAASA,EACZ4oC,GAAQhpB,GACV,MAAMA,EAER,OAAOA,CACR,EA26DDmJ,GAAOstB,MApsBP,SAAe50B,EAAGrC,GAEhB,IADAqC,EAAIwf,GAAUxf,IACN,GAAKA,EAAIlL,EACf,MAAO,GAET,IAAItC,EAAQwC,EACR/W,EAAS8nB,GAAU/F,EAAGhL,GAE1B2I,EAAW+X,GAAY/X,GACvBqC,GAAKhL,EAGL,IADA,IAAImJ,EAAS4B,GAAU9hB,EAAQ0f,KACtBnL,EAAQwN,GACfrC,EAASnL,GAEX,OAAO2L,CACR,EAqrBDmJ,GAAOuX,SAAWA,GAClBvX,GAAOkY,UAAYA,GACnBlY,GAAOugB,SAAWA,GAClBvgB,GAAOutB,QAx5DP,SAAiBt0C,GACf,OAAO3B,GAAS2B,GAAO8oC,aACxB,EAu5DD/hB,GAAO0X,SAAWA,GAClB1X,GAAOwtB,cApuIP,SAAuBv0C,GACrB,OAAOA,EACHupB,GAAU0V,GAAUj/B,IAAQ,iBAAmBuU,GACpC,IAAVvU,EAAcA,EAAQ,CAC5B,EAiuID+mB,GAAO1oB,SAAWA,GAClB0oB,GAAOytB,QAn4DP,SAAiBx0C,GACf,OAAO3B,GAAS2B,GAAOupC,aACxB,EAk4DDxiB,GAAO0tB,KA12DP,SAAcxwC,EAAQk6B,EAAOpD,GAE3B,IADA92B,EAAS5F,GAAS4F,MACH82B,GAASoD,IAAU1+B,GAChC,OAAOigB,GAASzb,GAElB,IAAKA,KAAYk6B,EAAQjG,GAAaiG,IACpC,OAAOl6B,EAET,IAAImc,EAAaoB,GAAcvd,GAC3Boc,EAAamB,GAAc2c,GAI/B,OAAO/E,GAAUhZ,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAET3a,KAAK,GAC/C,EA61DDqhB,GAAO2tB,QAx0DP,SAAiBzwC,EAAQk6B,EAAOpD,GAE9B,IADA92B,EAAS5F,GAAS4F,MACH82B,GAASoD,IAAU1+B,GAChC,OAAOwE,EAAO0b,MAAM,EAAGC,GAAgB3b,GAAU,GAEnD,IAAKA,KAAYk6B,EAAQjG,GAAaiG,IACpC,OAAOl6B,EAET,IAAImc,EAAaoB,GAAcvd,GAG/B,OAAOm1B,GAAUhZ,EAAY,EAFnBE,GAAcF,EAAYoB,GAAc2c,IAAU,GAEvBz4B,KAAK,GAC3C,EA6zDDqhB,GAAO4tB,UAxyDP,SAAmB1wC,EAAQk6B,EAAOpD,GAEhC,IADA92B,EAAS5F,GAAS4F,MACH82B,GAASoD,IAAU1+B,GAChC,OAAOwE,EAAO4b,QAAQxI,GAAa,IAErC,IAAKpT,KAAYk6B,EAAQjG,GAAaiG,IACpC,OAAOl6B,EAET,IAAImc,EAAaoB,GAAcvd,GAG/B,OAAOm1B,GAAUhZ,EAFLD,GAAgBC,EAAYoB,GAAc2c,KAElBz4B,KAAK,GAC1C,EA6xDDqhB,GAAO6tB,SAtvDP,SAAkB3wC,EAAQyC,GACxB,IAAIhJ,EAnvdmB,GAovdnBm3C,EAnvdqB,MAqvdzB,GAAIvtB,GAAS5gB,GAAU,CACrB,IAAIwnC,EAAY,cAAexnC,EAAUA,EAAQwnC,UAAYA,EAC7DxwC,EAAS,WAAYgJ,EAAUu4B,GAAUv4B,EAAQhJ,QAAUA,EAC3Dm3C,EAAW,aAAcnuC,EAAUwxB,GAAaxxB,EAAQmuC,UAAYA,CACrE,CAGD,IAAIxC,GAFJpuC,EAAS5F,GAAS4F,IAEKvG,OACvB,GAAIijB,GAAW1c,GAAS,CACtB,IAAImc,EAAaoB,GAAcvd,GAC/BouC,EAAYjyB,EAAW1iB,MACxB,CACD,GAAIA,GAAU20C,EACZ,OAAOpuC,EAET,IAAIsG,EAAM7M,EAAS2jB,GAAWwzB,GAC9B,GAAItqC,EAAM,EACR,OAAOsqC,EAET,IAAIj3B,EAASwC,EACTgZ,GAAUhZ,EAAY,EAAG7V,GAAK7E,KAAK,IACnCzB,EAAO0b,MAAM,EAAGpV,GAEpB,GAAI2jC,IAAczuC,EAChB,OAAOme,EAASi3B,EAKlB,GAHIz0B,IACF7V,GAAQqT,EAAOlgB,OAAS6M,GAEtBoS,GAASuxB,IACX,GAAIjqC,EAAO0b,MAAMpV,GAAKuqC,OAAO5G,GAAY,CACvC,IAAIzsB,EACAszB,EAAYn3B,EAMhB,IAJKswB,EAAU7yB,SACb6yB,EAAYnwC,GAAOmwC,EAAUlwC,OAAQK,GAASyZ,GAAQiL,KAAKmrB,IAAc,MAE3EA,EAAU5sB,UAAY,EACdG,EAAQysB,EAAUnrB,KAAKgyB,IAC7B,IAAIC,EAASvzB,EAAMxP,MAErB2L,EAASA,EAAO+B,MAAM,EAAGq1B,IAAWv1C,EAAY8K,EAAMyqC,EACvD,UACQ/wC,EAAO8xB,QAAQmC,GAAagW,GAAY3jC,IAAQA,EAAK,CAC9D,IAAI0H,EAAQ2L,EAAO6zB,YAAYvD,GAC3Bj8B,GAAS,IACX2L,EAASA,EAAO+B,MAAM,EAAG1N,GAE5B,CACD,OAAO2L,EAASi3B,CACjB,EAisDD9tB,GAAOkuB,SA5qDP,SAAkBhxC,GAEhB,OADAA,EAAS5F,GAAS4F,KACA0S,EAAiBiK,KAAK3c,GACpCA,EAAO4b,QAAQpJ,EAAeqL,IAC9B7d,CACL,EAwqDD8iB,GAAOmuB,SAvpBP,SAAkBC,GAChB,IAAIxoC,IAAOkW,GACX,OAAOxkB,GAAS82C,GAAUxoC,CAC3B,EAqpBDoa,GAAOuiB,UAAYA,GACnBviB,GAAOiiB,WAAaA,GAGpBjiB,GAAOquB,KAAO9yC,GACdykB,GAAOsuB,UAAYtR,GACnBhd,GAAOuuB,MAAQhT,GAEf6H,GAAMpjB,GAAS,WACb,IAAI/oB,EAAS,CAAA,EAMb,OALAqwB,GAAWtH,IAAQ,SAAS9d,EAAMkyB,GAC3B78B,GAAeC,KAAKwoB,GAAO3oB,UAAW+8B,KACzCn9B,EAAOm9B,GAAclyB,EAExB,IACMjL,CACR,CARc,GAQT,CAAE0lC,OAAS,IAWjB3c,GAAOwuB,QA/ihBK,UAkjhBZj4B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS6d,GACxFpU,GAAOoU,GAAYla,YAAc8F,EAClC,IAGDzJ,GAAU,CAAC,OAAQ,SAAS,SAAS6d,EAAYlpB,GAC/CgV,GAAY7oB,UAAU+8B,GAAc,SAAS1b,GAC3CA,EAAIA,IAAMhgB,EAAY,EAAI8lB,GAAU0Z,GAAUxf,GAAI,GAElD,IAAI7B,EAAU/b,KAAKkmB,eAAiB9V,EAChC,IAAIgV,GAAYplB,MAChBA,KAAKmgC,QAUT,OARIpkB,EAAOmK,aACTnK,EAAOqK,cAAgBzC,GAAU/F,EAAG7B,EAAOqK,eAE3CrK,EAAOsK,UAAU3iB,KAAK,CACpBkJ,KAAQ+W,GAAU/F,EAAGhL,GACrBpO,KAAQ80B,GAAcvd,EAAOkK,QAAU,EAAI,QAAU,MAGlDlK,CACR,EAEDqJ,GAAY7oB,UAAU+8B,EAAa,SAAW,SAAS1b,GACrD,OAAO5d,KAAKikB,UAAUqV,GAAY1b,GAAGqG,SACtC,CACF,IAGDxI,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS6d,EAAYlpB,GAC7D,IAAI5L,EAAO4L,EAAQ,EACfujC,EAjihBe,GAiihBJnvC,GA/hhBG,GA+hhByBA,EAE3C4gB,GAAY7oB,UAAU+8B,GAAc,SAAS/d,GAC3C,IAAIQ,EAAS/b,KAAKmgC,QAMlB,OALApkB,EAAOoK,cAAcziB,KAAK,CACxB6X,SAAY+X,GAAY/X,EAAU,GAClC/W,KAAQA,IAEVuX,EAAOmK,aAAenK,EAAOmK,cAAgBytB,EACtC53B,CACR,CACF,IAGDN,GAAU,CAAC,OAAQ,SAAS,SAAS6d,EAAYlpB,GAC/C,IAAIwjC,EAAW,QAAUxjC,EAAQ,QAAU,IAE3CgV,GAAY7oB,UAAU+8B,GAAc,WAClC,OAAOt5B,KAAK4zC,GAAU,GAAGz1C,QAAQ,EAClC,CACF,IAGDsd,GAAU,CAAC,UAAW,SAAS,SAAS6d,EAAYlpB,GAClD,IAAIyjC,EAAW,QAAUzjC,EAAQ,GAAK,SAEtCgV,GAAY7oB,UAAU+8B,GAAc,WAClC,YAAYpT,aAAe,IAAId,GAAYplB,MAAQA,KAAK6zC,GAAU,EACnE,CACF,IAEDzuB,GAAY7oB,UAAUotC,QAAU,WAC9B,OAAO3pC,KAAK2K,OAAO6mB,GACpB,EAEDpM,GAAY7oB,UAAUiP,KAAO,SAASoQ,GACpC,OAAYjR,KAAAA,OAAOiR,GAAW6kB,MAC/B,EAEDrb,GAAY7oB,UAAU0lC,SAAW,SAASrmB,GACxC,YAAYqI,UAAUzY,KAAKoQ,EAC5B,EAEDwJ,GAAY7oB,UAAU6lC,UAAY5N,IAAS,SAAS/G,EAAMrS,GACxD,MAAmB,mBAARqS,EACF,IAAIrI,GAAYplB,MAElBA,KAAK0G,KAAI,SAASvI,GACvB,OAAO6wB,GAAW7wB,EAAOsvB,EAAMrS,EAChC,GACF,IAEDgK,GAAY7oB,UAAUsvC,OAAS,SAASjwB,GACtC,YAAYjR,OAAO25B,GAAOhR,GAAY1X,IACvC,EAEDwJ,GAAY7oB,UAAUuhB,MAAQ,SAAStV,EAAOE,GAC5CF,EAAQ40B,GAAU50B,GAElB,IAAIuT,EAAS/b,KACb,OAAI+b,EAAOmK,eAAiB1d,EAAQ,GAAKE,EAAM,GACtC,IAAI0c,GAAYrJ,IAErBvT,EAAQ,EACVuT,EAASA,EAAO2wB,WAAWlkC,GAClBA,IACTuT,EAASA,EAAOmuB,KAAK1hC,IAEnBE,IAAQ9K,IAEVme,GADArT,EAAM00B,GAAU10B,IACD,EAAIqT,EAAOouB,WAAWzhC,GAAOqT,EAAO0wB,KAAK/jC,EAAMF,IAEzDuT,EACR,EAEDqJ,GAAY7oB,UAAUowC,eAAiB,SAAS/wB,GAC9C,OAAO5b,KAAKikB,UAAU2oB,UAAUhxB,GAAWqI,SAC5C,EAEDmB,GAAY7oB,UAAU6oC,QAAU,WAC9B,YAAYqH,KAAK75B,EAClB,EAGD4Z,GAAWpH,GAAY7oB,WAAW,SAAS6K,EAAMkyB,GAC/C,IAAIwa,EAAgB,qCAAqC/0B,KAAKua,GAC1Dya,EAAU,kBAAkBh1B,KAAKua,GACjC0a,EAAa9uB,GAAO6uB,EAAW,QAAwB,QAAdza,EAAuB,QAAU,IAAOA,GACjF2a,EAAeF,GAAW,QAAQh1B,KAAKua,GAEtC0a,IAGL9uB,GAAO3oB,UAAU+8B,GAAc,WAC7B,IAAIn7B,EAAQ6B,KAAK4lB,YACbxK,EAAO24B,EAAU,CAAC,GAAKp2C,UACvBu2C,EAAS/1C,aAAiBinB,GAC1B7J,EAAWH,EAAK,GAChB+4B,EAAUD,GAAUj4C,GAAQkC,GAE5B2jC,EAAc,SAAS3jC,GACzB,IAAI4d,EAASi4B,EAAWpwC,MAAMshB,GAAQ7I,GAAU,CAACle,GAAQid,IACzD,OAAQ24B,GAAWpuB,EAAY5J,EAAO,GAAKA,CAC5C,EAEGo4B,GAAWL,GAAoC,mBAAZv4B,GAA6C,GAAnBA,EAAS1f,SAExEq4C,EAASC,GAAU,GAErB,IAAIxuB,EAAW3lB,KAAK8lB,UAChBsuB,IAAap0C,KAAK6lB,YAAYhqB,OAC9Bw4C,EAAcJ,IAAiBtuB,EAC/B2uB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5Bh2C,EAAQm2C,EAAWn2C,EAAQ,IAAIinB,GAAYplB,MAC3C,IAAI+b,EAAS3U,EAAKxD,MAAMzF,EAAOid,GAE/B,OADAW,EAAO8J,YAAYniB,KAAK,CAAE0D,KAAQgzB,GAAMhf,KAAQ,CAAC0mB,GAAc3mB,QAAWvd,IACnE,IAAIynB,GAActJ,EAAQ4J,EAClC,CACD,OAAI0uB,GAAeC,EACVltC,EAAKxD,MAAM5D,KAAMob,IAE1BW,EAAS/b,KAAKo6B,KAAK0H,GACZuS,EAAeN,EAAUh4B,EAAO5d,QAAQ,GAAK4d,EAAO5d,QAAW4d,EACvE,EACF,IAGDN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS6d,GACxE,IAAIlyB,EAAOuZ,GAAW2Y,GAClBib,EAAY,0BAA0Bx1B,KAAKua,GAAc,MAAQ,OACjE2a,EAAe,kBAAkBl1B,KAAKua,GAE1CpU,GAAO3oB,UAAU+8B,GAAc,WAC7B,IAAIle,EAAOzd,UACX,GAAIs2C,IAAiBj0C,KAAK8lB,UAAW,CACnC,IAAI3nB,EAAQ6B,KAAK7B,QACjB,OAAOiJ,EAAKxD,MAAM3H,GAAQkC,GAASA,EAAQ,GAAIid,EAChD,CACD,OAAYm5B,KAAAA,IAAW,SAASp2C,GAC9B,OAAOiJ,EAAKxD,MAAM3H,GAAQkC,GAASA,EAAQ,GAAIid,EAChD,GACF,CACF,IAGDoR,GAAWpH,GAAY7oB,WAAW,SAAS6K,EAAMkyB,GAC/C,IAAI0a,EAAa9uB,GAAOoU,GACxB,GAAI0a,EAAY,CACd,IAAIr3C,EAAMq3C,EAAWvvC,KAAO,GACvBhI,GAAeC,KAAK8nB,GAAW7nB,KAClC6nB,GAAU7nB,GAAO,IAEnB6nB,GAAU7nB,GAAK+G,KAAK,CAAEe,KAAQ60B,EAAYlyB,KAAQ4sC,GACnD,CACF,IAEDxvB,GAAUmW,GAAa/8B,EAlthBA,GAkthB+B6G,MAAQ,CAAC,CAC7DA,KAAQ,UACR2C,KAAQxJ,IAIVwnB,GAAY7oB,UAAU4jC,MAh9dtB,WACE,IAAIpkB,EAAS,IAAIqJ,GAAYplB,KAAK4lB,aAOlC,OANA7J,EAAO8J,YAAc4B,GAAUznB,KAAK6lB,aACpC9J,EAAOkK,QAAUjmB,KAAKimB,QACtBlK,EAAOmK,aAAelmB,KAAKkmB,aAC3BnK,EAAOoK,cAAgBsB,GAAUznB,KAAKmmB,eACtCpK,EAAOqK,cAAgBpmB,KAAKomB,cAC5BrK,EAAOsK,UAAYoB,GAAUznB,KAAKqmB,WAC3BtK,CACR,EAw8dDqJ,GAAY7oB,UAAU0nB,QA97dtB,WACE,GAAIjkB,KAAKkmB,aAAc,CACrB,IAAInK,EAAS,IAAIqJ,GAAYplB,MAC7B+b,EAAOkK,SAAW,EAClBlK,EAAOmK,cAAe,CACvB,MACCnK,EAAS/b,KAAKmgC,SACPla,UAAY,EAErB,OAAOlK,CACR,EAq7dDqJ,GAAY7oB,UAAU4B,MA36dtB,WACE,IAAI8I,EAAQjH,KAAK4lB,YAAYznB,QACzBq2C,EAAMx0C,KAAKimB,QACX7oB,EAAQnB,GAAQgL,GAChBwtC,EAAUD,EAAM,EAChB7Y,EAAYv+B,EAAQ6J,EAAMpL,OAAS,EACnC64C,EA8pIN,SAAiBlsC,EAAOE,EAAK87B,GAC3B,IAAIp0B,GAAS,EACTvU,EAAS2oC,EAAW3oC,OAExB,OAASuU,EAAQvU,GAAQ,CACvB,IAAI+qB,EAAO4d,EAAWp0B,GAClBxD,EAAOga,EAAKha,KAEhB,OAAQga,EAAKpiB,MACX,IAAK,OAAagE,GAASoE,EAAM,MACjC,IAAK,YAAalE,GAAOkE,EAAM,MAC/B,IAAK,OAAalE,EAAMib,GAAUjb,EAAKF,EAAQoE,GAAO,MACtD,IAAK,YAAapE,EAAQkb,GAAUlb,EAAOE,EAAMkE,GAEpD,CACD,MAAO,CAAEpE,MAASA,EAAOE,IAAOA,EACjC,CA9qIYisC,CAAQ,EAAGhZ,EAAW37B,KAAKqmB,WAClC7d,EAAQksC,EAAKlsC,MACbE,EAAMgsC,EAAKhsC,IACX7M,EAAS6M,EAAMF,EACf4H,EAAQqkC,EAAU/rC,EAAOF,EAAQ,EACjC4qB,EAAYpzB,KAAKmmB,cACjByuB,EAAaxhB,EAAUv3B,OACvBigB,EAAW,EACX+4B,EAAYlxB,GAAU9nB,EAAQmE,KAAKomB,eAEvC,IAAKhpB,IAAWq3C,GAAW9Y,GAAa9/B,GAAUg5C,GAAah5C,EAC7D,OAAO+6B,GAAiB3vB,EAAOjH,KAAK6lB,aAEtC,IAAI9J,EAAS,GAEb0P,EACA,KAAO5vB,KAAYigB,EAAW+4B,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACb32C,EAAQ8I,EAHZmJ,GAASokC,KAKAM,EAAYF,GAAY,CAC/B,IAAIhuB,EAAOwM,EAAU0hB,GACjBv5B,EAAWqL,EAAKrL,SAChB/W,EAAOoiB,EAAKpiB,KACZknB,EAAWnQ,EAASpd,GAExB,GA7zDY,GA6zDRqG,EACFrG,EAAQutB,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTlnB,EACF,SAASinB,EAET,MAAMA,CAET,CACF,CACD1P,EAAOD,KAAc3d,CACtB,CACD,OAAO4d,CACR,EA+3dDmJ,GAAO3oB,UAAUwpC,GAAKhE,GACtB7c,GAAO3oB,UAAUslC,MA1iQjB,WACE,OAAOA,GAAM7hC,KACd,EAyiQDklB,GAAO3oB,UAAUw4C,OA7gQjB,WACE,WAAW1vB,GAAcrlB,KAAK7B,QAAS6B,KAAK8lB,UAC7C,EA4gQDZ,GAAO3oB,UAAU8oC,KAp/PjB,WACMrlC,KAAKgmB,aAAepoB,IACtBoC,KAAKgmB,WAAaof,GAAQplC,KAAK7B,UAEjC,IAAImnC,EAAOtlC,KAAK+lB,WAAa/lB,KAAKgmB,WAAWnqB,OAG7C,MAAO,CAAEypC,KAAQA,EAAMnnC,MAFXmnC,EAAO1nC,EAAYoC,KAAKgmB,WAAWhmB,KAAK+lB,aAGrD,EA6+PDb,GAAO3oB,UAAUm+B,MA77PjB,SAAsBv8B,GAIpB,IAHA,IAAI4d,EACAkT,EAASjvB,KAENivB,aAAkBvJ,IAAY,CACnC,IAAIya,EAAQ7a,GAAa2J,GACzBkR,EAAMpa,UAAY,EAClBoa,EAAMna,WAAapoB,EACfme,EACFsY,EAASzO,YAAcua,EAEvBpkB,EAASokB,EAEX,IAAI9L,EAAW8L,EACflR,EAASA,EAAOrJ,WACjB,CAED,OADAyO,EAASzO,YAAcznB,EAChB4d,CACR,EA46PDmJ,GAAO3oB,UAAU0nB,QAt5PjB,WACE,IAAI9lB,EAAQ6B,KAAK4lB,YACjB,GAAIznB,aAAiBinB,GAAa,CAChC,IAAI4vB,EAAU72C,EAUd,OATI6B,KAAK6lB,YAAYhqB,SACnBm5C,EAAU,IAAI5vB,GAAYplB,QAE5Bg1C,EAAUA,EAAQ/wB,WACV4B,YAAYniB,KAAK,CACvB0D,KAAQgzB,GACRhf,KAAQ,CAAC6I,IACT9I,QAAWvd,IAEFynB,IAAAA,GAAc2vB,EAASh1C,KAAK8lB,UACxC,CACD,OAAYsU,KAAAA,KAAKnW,GAClB,EAu4PDiB,GAAO3oB,UAAU04C,OAAS/vB,GAAO3oB,UAAUF,QAAU6oB,GAAO3oB,UAAU4B,MAv3PtE,WACE,OAAOy4B,GAAiB52B,KAAK4lB,YAAa5lB,KAAK6lB,YAChD,EAw3PDX,GAAO3oB,UAAUk3C,MAAQvuB,GAAO3oB,UAAUkkC,KAEtCte,KACF+C,GAAO3oB,UAAU4lB,IAj+PnB,WACE,OAAOniB,IACR,GAi+PMklB,EACR,CAKOhF,GAiBCnG,KAENA,GAAWjW,QAAUyH,IAAGA,EAAIA,GAE7BsO,GAAYtO,EAAIA,IAIhBoO,GAAKpO,EAAIA,EA9yhBX,GAgzhBA7O,KAAKsD,OC7yhBDk1C,GAAmB,SAKnBp0C,GAJJsO,IAAAA,IAAAA,QACAvK,IAAAA,QACAwK,IAAAA,eACAjK,IAAAA,SAeM+vC,EAAgBh2C,GAAQ,WAAA,OAC5BuqC,GAAAA,MACEptC,OACG8S,QAAQvK,GACR6B,KAAI,SAAAZ,GACH,IAAM3H,EAAQ2H,EAAE,GACVsvC,EAAWhmC,EAAQ4C,SAAS7T,GAC5B8G,EAAWoK,EAAe2C,SAAS7T,KAAWi3C,EAE7C,MAAA,CACLj3C,MAAAA,EACA4C,MAAO+E,EAAE,GACTsvC,SAAAA,EACAnwC,SAAAA,EAEH,IACH,EAhByB,GAkB1B,CAACJ,EAASuK,EAASC,IAEtB,OACE9N,gBAACC,EAAD,CAAKE,MAAM,QAEPyzC,EAAczuC,KAAI,SAAC2uC,EAAKv5C,GACtB,OAAAyF,EAAAM,cAACL,EAAD,CAEE7E,IAAYb,OAAAA,OAAAA,GACZ4F,MAAM,OACNI,GAAI,GAGFuzC,EAAI3uC,KAAI,WAKL4uC,GAJDn3C,IAAAA,IAAAA,MACA4C,IAAAA,MACAq0C,IAAAA,SACAnwC,IAAAA,SAJM,OAMN1D,gBAACqN,EAAD,CACEjS,IAAewB,UAAAA,OAAAA,GACf8G,SAAUA,EACV4J,kBAHF,EAIE7M,QACEozC,EACI,YACA,WAENlxC,MACEkxC,EACI,UACA,UAENjtC,GAAI,CAEFzG,MAAO,OACPgB,EAAG,EACHyN,GAAI,SAAArN,GAAK,OAAIA,EAAMG,QAAQ,EAJzB,EAKFsyC,GAAI,SAAAzyC,GAAK,OAAIA,EAAMG,QAAQ,EALzB,EAMF6L,OAAQ,SAAAhM,GAAK,OAAIA,EAAMG,QAAQ,EAN7B,EAOF8F,GAAW,IAAPusC,EAAW,EAAI,GAErBvmC,QAAS,WAAMymC,OAzEX,SAAA9pC,GAClB,IAAM4F,EAAa3I,gBAAgByG,GAEnC,GAAIkC,EAAWU,SAAStG,GAAQ,CAC9B,IAAM+pC,EAAankC,EAAWivB,WAAU,SAAAz6B,GAAKA,OAAAA,IAAM4F,CAAV,IACzC4F,EAAWC,OAAOkkC,EAAY,EAC/B,MACCnkC,EAAW5N,KAAKgI,GAGlBtG,EAASkM,EACV,CA8D8BkkC,CAAYr3C,EAAlB,GAEToD,gBAACQ,EAAD,CACEC,QAAQ,SACR0zC,QAAM,GAEL30C,GAnCP,IARN,IAqDP,EAEDm0C,GAAiBhzC,UAAY,CAC3BkN,QAASjN,EAAU8E,MAAML,WACzB/B,QAAS1C,EAAU8E,MAAML,WACzByI,eAAgBlN,EAAU8E,MAAML,WAChCxB,SAAUjD,EAAUiF,KAAKR,YCpG3B,IAAM+uC,GAAe,SASf70C,GARJkB,IAAAA,IAAAA,QACAyC,IAAAA,KACA1D,IAAAA,MACA5C,IAAAA,MACA0G,IAAAA,QACA+wC,IAAAA,WACAC,IAAAA,cACAzwC,IAAAA,SAEAtH,EAA8BC,EAASI,GAAS,IAAhDF,EAAAC,EAAAJ,EAAA,GAAOsR,EAAPnR,EAAA,GAAgB63C,EAAhB73C,EAAA,GAEAO,GAAU,WACFG,IAAAA,EAAWyQ,EAAQvT,OAAS,EAAIuT,OAAUxR,EAChDwH,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAOQ,IACnC,GAAE,CAACyQ,IAEAC,IAAAA,EAAiB,GACjBxK,IACFwK,EACE/S,OACG8S,QAAQvK,GACR8F,QAAO,SAAA7E,GAAC,OAAI9J,MAAMC,QAAQkC,IAAUA,EAAM6T,SAASlM,EAAE,GAA7C,IAAkDY,KAAI,SAAAZ,GAAKA,OAAAA,EAAE,EAAN,KAIlE8vC,IAAcz3C,aAAA,EAAAA,EAAOtC,SAAU+5C,IACjCvmC,EACE/S,OACG8S,QAAQvK,GACR6B,KAAI,SAAAZ,GAAKA,OAAAA,EAAE,EAAN,KAIZ,IAAMiwC,EACJF,EACIX,GACA/lC,GAGN,OACE5N,gBAACC,EAAD,KAEIT,GAEIQ,gBAACQ,EAAD,CAAYC,QAAQ,SACjBjB,GAITQ,EAAAM,cAACk0C,EAAD,CACE/zC,QAASA,EACToN,QAASA,EACTvK,QAASA,EACTwK,eAAgBA,EAChBjK,SAAU0wC,IAIjB,EAEDH,GAAazzC,UAAY,CACvBF,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChDoC,KAAMtC,EAAUC,OAChBrB,MAAOoB,EAAUC,OACjBjE,MAAOgE,EAAUwE,IACjB9B,QAAS1C,EAAU0E,OACnB+uC,WAAYzzC,EAAU6E,OACtB6uC,cAAe1zC,EAAU4E,KACzB3B,SAAUjD,EAAUiF,KAAKR,4nBCxE3B,IAAMhE,GAAYC,GAAW,SAAAC,GAAU,MAAA,CACrCkzC,cAAe,CACbt0C,MAAO,OACPC,QAAS,OACTC,cAAe,SACfoB,aAAcF,EAAMG,QAAQ,KACZ,eAAA,CACdD,aAAc,IAPc,IAY5BqB,GAAmB,SAUnBvD,GATJyD,IA6BID,EA7BJC,IAAAA,YACAC,IAAAA,KACAC,IAAAA,KACA1D,IAAAA,MACA2D,IAAAA,UAKIuxC,EAAAn1C,EAJJ6D,eAAAA,aAAiB,CAIb,EAAAsxC,EAHJ93C,IAAAA,MACA0G,IAAAA,QACAG,IAAAA,SAEMK,WACDV,GADW,GAAA,CAEdJ,YAAAA,EACAE,KAAAA,EACA1D,MAAAA,EACA5C,MAAAA,EACA0G,QAAAA,EACAG,SAAAA,EACA+H,UAAU,IAGN5J,EAASP,KAETszC,EAAoB,YAAT1xC,EAEjB,OAAuC,KAAnCG,aAAAA,EAAAA,EAAgBwxC,kBAKK7xC,EAAZ,aAATE,EAA+BjD,EAAMsE,aAAanB,EAAWW,GAClD9D,EAAMM,cAAc6C,EAAWW,GAG5C9D,gBAACC,EAAD,CAAK4B,UAAWD,EAAO6yC,eAElBj1C,IAAUm1C,GAEP30C,gBAACQ,EAAD,CACEC,QAAQ,UACRkC,MAAM,iBAELnD,GAIRuD,GAGN,EAEDD,GAAiBnC,UAAY,CAC3BqC,YAAapC,EAAUE,MAAM,CAAC,QAAS,SACvCqC,UAAWvC,EAAUwE,IAAIC,WACzBjC,eAAgBxC,EAAU0E,OAC1BpC,KAAMtC,EAAUC,OAAOwE,WACvBpC,KAAMrC,EAAUC,OAAOwE,WACvB7F,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU6E,OACV7E,EAAU4E,KACV5E,EAAU8E,QAEZpC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OAEnB3B,SAAU7C,EAAU4E,MAGtB,IAAMqvC,GAAoB,SAKpB9uC,KAJJC,UACAC,OAGI,IAFJ7C,IAAAA,eACG8C,EACCC,EAAAJ,EAAAK,IACEtC,EAAU/E,GAAA,CACdqE,eAAAA,GACG8C,GAGL,MAA6B,YAAzB9C,aAAAA,EAAAA,EAAgBH,MACXjD,EAAAM,cAAA,QAAA,CAAO2C,KAAK,SAASC,KAAMgD,EAAWhD,KAAMtG,MAAOsJ,EAAWtJ,QAKpEoD,EAAAM,cAAAwC,GAAqBgB,EAEzB,EAED+wC,GAAkBl0C,UAAY,CAC5BwC,UAAWvC,EAAUwE,IAAIC,WACzBjC,eAAgBxC,EAAU0E,OAC1BrC,KAAMrC,EAAUC,OAAOwE,WACvBnC,KAAMtC,EAAUC,OAAOwE,WACvB7F,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAUC,OACVD,EAAU6E,OACV7E,EAAU4E,KACV5E,EAAU8E,QAEZpC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OAEnBY,QAASpF,EAAU8E,MACnBO,OAAQrF,EAAU8E,MAClBnC,UAAW3C,EAAU4E,KACrBhC,OAAQ5C,EAAU8E,MAClB/B,WAAY/C,EAAU4E,KACtB/B,SAAU7C,EAAU4E,KACpB5B,MAAOhD,EAAU4E,MAGnB,IAAAsvC,GAAe90C,EAAM+0C,KAAKF,IC3I1B,MAAMG,GAAY,CAAC,OAAQ,QAAS,SAAU;;;;;;;ACO9C/6C,IAAAA,GAAiB,SAAmBg7C,GAC3BA,OAAO,MAAPA,GAAkC,MAAnBA,EAAI56C,aACY,mBAA7B46C,EAAI56C,YAAY0nB,UAA2BkzB,EAAI56C,YAAY0nB,SAASkzB,EAC9E,ECIM,SAASC,GAAkBt4C,GAEhC,OAAKA,GAA0B,iBAAVA,EAKjB,aAAcA,GAAS,SAAUA,EAC5BsH,GAAStH,EAAMsH,UAIpB,UAAWtH,GAAS,QAASA,EACxBsH,GAAStH,GAId,SAAUA,GAAS,WAAYA,EAC1Bu4C,GAAMv4C,GAIR,GAnBE,EAoBV,CAMD,SAASu4C,GAAMA,GACb,OAAOtmC,GAAMsmC,GAASA,EAAMC,MAAQ,IAAMvmC,GAAMsmC,GAASA,EAAME,OAChE,CAMD,SAASnxC,GAASoxC,GAChB,OAAOH,GAAMG,GAAOA,EAAIruC,OAAS,IAAMkuC,GAAMG,GAAOA,EAAInuC,IACzD,CAMD,SAAS0H,GAAMjS,GACNA,OAAAA,GAA0B,iBAAVA,EAAqBA,EAAQ,CACrD,CCpDM,MAAM24C,WAAqB53C,MAShCtD,WAAAA,CAAYm7C,EAAQC,EAAOC,GAEzB,MAAMC,EAAQ,CAAC,KAAM,MAErB,IAAIzxC,EAAW,CAEb+C,MAAO,CAACmuC,KAAM,KAAMC,OAAQ,MAE5BluC,IAAK,CAACiuC,KAAM,KAAMC,OAAQ,OAU5B,GAPAO,QAEqB,iBAAVH,IACTC,EAASD,EACTA,OAAQp5C,GAGY,iBAAXq5C,EAAqB,CAC9B,MAAM7mC,EAAQ6mC,EAAO/iB,QAAQ,MAEd,IAAX9jB,EACF8mC,EAAM,GAAKD,GAEXC,EAAM,GAAKD,EAAOn5B,MAAM,EAAG1N,GAC3B8mC,EAAM,GAAKD,EAAOn5B,MAAM1N,EAAQ,GAEnC,CAEG4mC,IAEE,SAAUA,GAAS,aAAcA,EAC/BA,EAAMvxC,WACRA,EAAWuxC,EAAMvxC,UAIZ,UAAWuxC,GAAS,QAASA,EACpCvxC,EAAWuxC,GAGJ,SAAUA,GAAS,WAAYA,KACtCvxC,EAAS+C,MAAQwuC,IAKrBh3C,KAAKyE,KAAOgyC,GAAkBO,IAAU,MACnCjxC,KAAAA,QAA4B,iBAAXgxC,EAAsBA,EAAOhxC,QAAUgxC,EACxD7tB,KAAAA,MAA0B,iBAAX6tB,EAAsBA,EAAO7tB,MAAQ,GAMpD6tB,KAAAA,OAAS/2C,KAAK+F,QAMnB/F,KAAKo3C,MAKLp3C,KAAK22C,KAAOlxC,EAAS+C,MAAMmuC,KAK3B32C,KAAK42C,OAASnxC,EAAS+C,MAAMouC,OAK7B52C,KAAK7D,OAAS+6C,EAAM,GAKpBl3C,KAAKq3C,OAASH,EAAM,GAMpBl3C,KAAKyF,SAAWA,EAYhBzF,KAAKs3C,OAMLt3C,KAAKu3C,SAKLv3C,KAAKw3C,KAKLx3C,KAAKy3C,IAKLz3C,KAAK03C,IAEN,EAGHZ,GAAav6C,UAAUi7C,KAAO,GAC9BV,GAAav6C,UAAUkI,KAAO,GAC9BqyC,GAAav6C,UAAUw6C,OAAS,GAChCD,GAAav6C,UAAUwJ,QAAU,GACjC+wC,GAAav6C,UAAU2sB,MAAQ,GAC/B4tB,GAAav6C,UAAU66C,MAAQ,KAC/BN,GAAav6C,UAAUq6C,OAAS,KAChCE,GAAav6C,UAAUo6C,KAAO,KAC9BG,GAAav6C,UAAUJ,OAAS,KAChC26C,GAAav6C,UAAU86C,OAAS,KAChCP,GAAav6C,UAAUkJ,SAAW,KCtG3B,MAAMgoB,GAAO,CAACkqB,SASrB,SAAkBlqB,EAAMmqB,GAClBA,QAAQh6C,IAARg6C,GAAoC,iBAARA,EAC9B,MAAM,IAAIl3B,UAAU,mCAGtBm3B,GAAWpqB,GACPjlB,IAIAsvC,EAJAtvC,EAAQ,EACRE,GAAO,EACP0H,EAAQqd,EAAK5xB,OAIjB,QAAY+B,IAARg6C,GAAoC,IAAfA,EAAI/7C,QAAgB+7C,EAAI/7C,OAAS4xB,EAAK5xB,OAAQ,CAC9DuU,KAAAA,KACL,GAA+B,KAA3Bqd,EAAKuS,WAAW5vB,IAGlB,GAAI0nC,EAAc,CAChBtvC,EAAQ4H,EAAQ,EAChB,KACD,OACQ1H,EAAM,IAGfovC,GAAe,EACfpvC,EAAM0H,EAAQ,GAIlB,OAAO1H,EAAM,EAAI,GAAK+kB,EAAK3P,MAAMtV,EAAOE,EACzC,CAEGkvC,GAAAA,IAAQnqB,EACV,MAAO,GAGLsqB,IAAAA,GAAoB,EACpBC,EAAWJ,EAAI/7C,OAAS,EAErBuU,KAAAA,KACL,GAA+B,KAA3Bqd,EAAKuS,WAAW5vB,IAGlB,GAAI0nC,EAAc,CAChBtvC,EAAQ4H,EAAQ,EAChB,KACD,OAEG2nC,EAAmB,IAGrBD,GAAe,EACfC,EAAmB3nC,EAAQ,GAGzB4nC,GAAY,IAEVvqB,EAAKuS,WAAW5vB,KAAWwnC,EAAI5X,WAAWgY,KACxCA,EAAW,IAGbtvC,EAAM0H,IAKR4nC,GAAY,EACZtvC,EAAMqvC,IAMVvvC,IAAUE,EACZA,EAAMqvC,EACGrvC,EAAM,IACfA,EAAM+kB,EAAK5xB,QAGb,OAAO4xB,EAAK3P,MAAMtV,EAAOE,EAC1B,EAzF8BuvC,QA+F/B,SAAiBxqB,GAGf,GAFAoqB,GAAWpqB,GAES,IAAhBA,EAAK5xB,OACP,MAAO,IAGL6M,IAGAwvC,EAHAxvC,GAAO,EACP0H,EAAQqd,EAAK5xB,OAKV,OAAEuU,GACP,GAA+B,KAA3Bqd,EAAKuS,WAAW5vB,IAClB,GAAI8nC,EAAgB,CAClBxvC,EAAM0H,EACN,KACD,OACS8nC,IAEVA,GAAiB,GAIdxvC,OAAAA,EAAM,EACc,KAAvB+kB,EAAKuS,WAAW,GACd,IACA,IACM,IAARt3B,GAAoC,KAAvB+kB,EAAKuS,WAAW,GAC7B,KACAvS,EAAK3P,MAAM,EAAGpV,EACnB,EA/HuCyvC,QAqIxC,SAAiB1qB,GACfoqB,GAAWpqB,GAEX,IASIyqB,EATA9nC,EAAQqd,EAAK5xB,OAEb6M,GAAO,EACP0vC,EAAY,EACZC,GAAY,EAGZC,EAAc,EAIXloC,KAAAA,KAAS,CACd,MAAMmoC,EAAO9qB,EAAKuS,WAAW5vB,GAE7B,GAAa,KAATmoC,EAWA7vC,EAAM,IAGRwvC,GAAiB,EACjBxvC,EAAM0H,EAAQ,GAGH,KAATmoC,EAEEF,EAAW,EACbA,EAAWjoC,EACc,IAAhBkoC,IACTA,EAAc,GAEPD,GAAY,IAGrBC,GAAe,QAzBf,GAAIJ,EAAgB,CAClBE,EAAYhoC,EAAQ,EACpB,KACD,CAwBJ,CAED,GACEioC,EAAW,GACX3vC,EAAM,GAEU,IAAhB4vC,GAEiB,IAAhBA,GAAqBD,IAAa3vC,EAAM,GAAK2vC,IAAaD,EAAY,EAEvE,MAAO,GAGT,OAAO3qB,EAAK3P,MAAMu6B,EAAU3vC,EAC7B,EAlMgD7E,KAwMjD,YAAiB20C,GACXpoC,IAEAqoC,EAFAroC,GAAS,EAIb,OAASA,EAAQooC,EAAS38C,QACxBg8C,GAAWW,EAASpoC,IAEhBooC,EAASpoC,KACXqoC,OACa76C,IAAX66C,EAAuBD,EAASpoC,GAASqoC,EAAS,IAAMD,EAASpoC,IAIhEqoC,YAAW76C,IAAX66C,EAAuB,IAUhC,SAAmBhrB,GACjBoqB,GAAWpqB,GAELirB,MAAAA,EAAkC,KAAvBjrB,EAAKuS,WAAW,GAG7B7hC,IAAAA,EAoBN,SAAyBsvB,EAAMkrB,GACzB58B,IAMAw8B,EAEAK,EARA78B,EAAS,GACT88B,EAAoB,EACpBC,GAAa,EACbC,EAAO,EACP3oC,GAAS,EAMb,OAASA,GAASqd,EAAK5xB,QAAQ,CAC7B,GAAIuU,EAAQqd,EAAK5xB,OACf08C,EAAO9qB,EAAKuS,WAAW5vB,OAClB,IAAa,KAATmoC,EACT,MAEAA,EAAO,EACR,CAED,GAAa,KAATA,EAAuB,CACrBO,GAAAA,IAAc1oC,EAAQ,GAAc,IAAT2oC,QAExB,GAAID,IAAc1oC,EAAQ,GAAc,IAAT2oC,EAAY,CAChD,GACEh9B,EAAOlgB,OAAS,GACM,IAAtBg9C,GACyC,KAAzC98B,EAAOikB,WAAWjkB,EAAOlgB,OAAS,IACO,KAAzCkgB,EAAOikB,WAAWjkB,EAAOlgB,OAAS,GAElC,GAAIkgB,EAAOlgB,OAAS,GAGlB,GAFA+8C,EAAiB78B,EAAO6zB,YAAY,KAEhCgJ,IAAmB78B,EAAOlgB,OAAS,EAAG,CACpC+8C,EAAiB,GACnB78B,EAAS,GACT88B,EAAoB,IAEpB98B,EAASA,EAAO+B,MAAM,EAAG86B,GACzBC,EAAoB98B,EAAOlgB,OAAS,EAAIkgB,EAAO6zB,YAAY,MAG7DkJ,EAAY1oC,EACZ2oC,EAAO,EACP,QACD,OACI,GAAIh9B,EAAOlgB,OAAS,EAAG,CAC5BkgB,EAAS,GACT88B,EAAoB,EACpBC,EAAY1oC,EACZ2oC,EAAO,EACP,QACD,CAGCJ,IACF58B,EAASA,EAAOlgB,OAAS,EAAIkgB,EAAS,MAAQ,KAC9C88B,EAAoB,EAEvB,MACK98B,EAAOlgB,OAAS,EAClBkgB,GAAU,IAAM0R,EAAK3P,MAAMg7B,EAAY,EAAG1oC,GAE1C2L,EAAS0R,EAAK3P,MAAMg7B,EAAY,EAAG1oC,GAGrCyoC,EAAoBzoC,EAAQ0oC,EAAY,EAG1CA,EAAY1oC,EACZ2oC,EAAO,CACR,MAAmB,KAATR,GAAyBQ,GAAQ,EAC1CA,IAEAA,GAAQ,CAEX,CAED,OAAOh9B,CACR,CAnGai9B,CAAgBvrB,GAAOirB,GAEd,IAAjBv6C,EAAMtC,QAAiB68C,IACzBv6C,EAAQ,KAGNA,EAAMtC,OAAS,GAA0C,KAArC4xB,EAAKuS,WAAWvS,EAAK5xB,OAAS,KACpDsC,GAAS,KAGX,OAAOu6C,EAAW,IAAMv6C,EAAQA,CACjC,CA3BqC86C,CAAUR,EAC/C,EAvNsDS,IAAK,KA8U5D,SAASrB,GAAWpqB,GAClB,GAAoB,iBAATA,EACH,MAAA,IAAI/M,UACR,mCAAqCy4B,KAAKC,UAAU3rB,GAGzD,CCpYM,MAAM4rB,GAAO,CAACC,IAErB,WACE,MAAO,GACR,GCgBM,SAASC,GAAMC,GAElBA,OAAkB,OAAlBA,GACyB,iBAAlBA,GAEPA,EAAcC,MAEdD,EAAcvC,MAEjB,CCvBM,SAASyC,GAAUjsB,GACxB,GAAoB,iBAATA,EACTA,EAAO,IAAIksB,IAAIlsB,QACV,IAAK8rB,GAAM9rB,GAAO,CAEjBxpB,MAAAA,EAAQ,IAAIyc,UAChB,+EACE+M,EACA,KAGJ,MADAxpB,EAAMs0C,KAAO,uBACPt0C,CACP,CAED,GAAsB,UAAlBwpB,EAAKmsB,SAAsB,CAE7B,MAAM31C,EAAQ,IAAIyc,UAAU,kCAE5B,MADAzc,EAAMs0C,KAAO,yBACPt0C,CACP,CAEM41C,OAMT,SAA6BpC,GAC3B,GAAqB,KAAjBA,EAAIqC,SAAiB,CAEvB,MAAM71C,EAAQ,IAAIyc,UAChB,wDAGF,MADAzc,EAAMs0C,KAAO,4BACPt0C,CACP,CAED,MAAM81C,EAAWtC,EAAIsC,SACjB3pC,IAAAA,GAAS,EAEb,OAASA,EAAQ2pC,EAASl+C,QACxB,GACiC,KAA/Bk+C,EAAS/Z,WAAW5vB,IACe,KAAnC2pC,EAAS/Z,WAAW5vB,EAAQ,GAC5B,CACM4pC,MAAAA,EAAQD,EAAS/Z,WAAW5vB,EAAQ,GAC1C,GAAc,KAAV4pC,GAAoC,MAAVA,EAAyB,CAErD,MAAM/1C,EAAQ,IAAIyc,UAChB,uDAGF,MADAzc,EAAMs0C,KAAO,4BACPt0C,CACP,CACF,CAGIg2C,OAAAA,mBAAmBF,EAC3B,CArCQF,CAAoBpsB,EAC5B,CC0BD,MAAMysB,GAAQ,CAAC,UAAW,OAAQ,WAAY,OAAQ,UAAW,WAE1D,MAAMC,GAiBXv+C,WAAAA,CAAYuC,GAEV,IAAI0G,EAMFA,EAJG1G,EAEuB,iBAAVA,GAAsBmsB,GAAOnsB,GAEnC,CAACA,SACFo7C,GAAMp7C,GACL,CAACsvB,KAAMtvB,GAGPA,EARA,CAAA,EAiBPyoB,KAAAA,KAAO,GAMPwzB,KAAAA,SAAW,GAMXC,KAAAA,QAAU,GAOfr6C,KAAKs5C,IAAMD,GAAKC,MAOXn7C,KAAAA,MAUL6B,KAAKs6C,OASLt6C,KAAK+b,OAQL/b,KAAK0G,IAID0J,IAcAw2B,EAdAx2B,GAAS,EAEb,OAASA,EAAQ8pC,GAAMr+C,QAAQ,CAC7B,MAAM+qC,EAAOsT,GAAM9pC,GAIfw2B,KAAQ/hC,QAA6BjH,IAAlBiH,EAAQ+hC,KAE7B5mC,KAAK4mC,GAAiB,YAATA,EAAqB,IAAI/hC,EAAQ+hC,IAAS/hC,EAAQ+hC,GAElE,CAMIA,IAAAA,KAAQ/hC,EAENq1C,GAAMloC,SAAS40B,KAAO5mC,KAAK4mC,GAAQ/hC,EAAQ+hC,GAEnD,CAOO,QAAJnZ,GACK,OAAAztB,KAAKq6C,QAAQr6C,KAAKq6C,QAAQx+C,OAAS,EAC3C,CAQG4xB,QAAAA,CAAKA,GACH8rB,GAAM9rB,KACRA,EAAOisB,GAAUjsB,IAGnB8sB,GAAe9sB,EAAM,QAEjBztB,KAAKytB,OAASA,GAChBztB,KAAKq6C,QAAQ32C,KAAK+pB,EAErB,CAKU,WAAPwqB,GACF,MAA4B,iBAAdj4C,KAAKytB,KAAoBA,GAAKwqB,QAAQj4C,KAAKytB,WAAQ7vB,CAClE,CAMGq6C,WAAAA,CAAQA,GACVJ,GAAW73C,KAAK23C,SAAU,WAC1B33C,KAAKytB,KAAOA,GAAK5pB,KAAKo0C,GAAW,GAAIj4C,KAAK23C,SAC3C,CAKW,YAARA,GACF,MAA4B,iBAAd33C,KAAKytB,KAAoBA,GAAKkqB,SAAS33C,KAAKytB,WAAQ7vB,CACnE,CAOG+5C,YAAAA,CAASA,GACX4C,GAAe5C,EAAU,YACzB6C,GAAW7C,EAAU,YACrB33C,KAAKytB,KAAOA,GAAK5pB,KAAK7D,KAAKi4C,SAAW,GAAIN,EAC3C,CAKU,WAAPQ,GACF,MAA4B,iBAAdn4C,KAAKytB,KAAoBA,GAAK0qB,QAAQn4C,KAAKytB,WAAQ7vB,CAClE,CAMGu6C,WAAAA,CAAQA,GAIV,GAHAqC,GAAWrC,EAAS,WACpBN,GAAW73C,KAAKi4C,QAAS,WAErBE,EAAS,CACX,GAA8B,KAA1BA,EAAQnY,WAAW,GACrB,MAAM,IAAI9gC,MAAM,iCAGdi5C,GAAAA,EAAQnmC,SAAS,IAAK,GACxB,MAAM,IAAI9S,MAAM,yCAEnB,CAEDc,KAAKytB,KAAOA,GAAK5pB,KAAK7D,KAAKi4C,QAASj4C,KAAKy6C,MAAQtC,GAAW,IAC7D,CAKO,QAAJsC,GACF,MAA4B,iBAAdz6C,KAAKytB,KACfA,GAAKkqB,SAAS33C,KAAKytB,KAAMztB,KAAKm4C,cAC9Bv6C,CACL,CAMG68C,QAAAA,CAAKA,GACPF,GAAeE,EAAM,QACrBD,GAAWC,EAAM,QACjBz6C,KAAKytB,KAAOA,GAAK5pB,KAAK7D,KAAKi4C,SAAW,GAAIwC,GAAQz6C,KAAKm4C,SAAW,IACnE,CAQD37C,QAAAA,CAASk+C,GACA,OAAC16C,KAAK7B,OAAS,IAAI3B,SAASk+C,EACpC,CAUD30C,OAAAA,CAAQgxC,EAAQC,EAAOC,GACflxC,MAAAA,EAAU,IAAI+wC,GAAaC,EAAQC,EAAOC,GAWhD,OATIj3C,KAAKytB,OACP1nB,EAAQtB,KAAOzE,KAAKytB,KAAO,IAAM1nB,EAAQtB,KACzCsB,EAAQyxC,KAAOx3C,KAAKytB,MAGtB1nB,EAAQqxC,OAAQ,EAEhBp3C,KAAKo6C,SAAS12C,KAAKqC,GAEZA,CACR,CAYD40C,IAAAA,CAAK5D,EAAQC,EAAOC,GACZlxC,MAAAA,EAAU/F,KAAK+F,QAAQgxC,EAAQC,EAAOC,GAI5C,OAFAlxC,EAAQqxC,MAAQ,KAETrxC,CACR,CAaD60C,IAAAA,CAAK7D,EAAQC,EAAOC,GACZlxC,MAAAA,EAAU/F,KAAK+F,QAAQgxC,EAAQC,EAAOC,GAI5C,MAFAlxC,EAAQqxC,OAAQ,EAEVrxC,CACP,EAUH,SAASy0C,GAAWK,EAAMp2C,GACpBo2C,GAAAA,GAAQA,EAAK7oC,SAASyb,GAAKyrB,KAC7B,MAAM,IAAIh6C,MACR,IAAMuF,EAAO,uCAAyCgpB,GAAKyrB,IAAM,IAGtE,CASD,SAASqB,GAAeM,EAAMp2C,GACxB,IAACo2C,EACH,MAAM,IAAI37C,MAAM,IAAMuF,EAAO,oBAEhC,CASD,SAASozC,GAAWpqB,EAAMhpB,GACpB,IAACgpB,EACH,MAAM,IAAIvuB,MAAM,YAAcuF,EAAO,kCAExC,CCrYM,SAASq2C,GAAK72C,GACnB,GAAIA,EACF,MAAMA,CAET,CCTD,IAAIZ,GAAS/G,OAAOC,UAAUE,eAC1Bs+C,GAAQz+C,OAAOC,UAAUC,SACzB+lB,GAAiBjmB,OAAOimB,eACxBy4B,GAAO1+C,OAAO2+C,yBAEdh/C,GAAU,SAAiBi/C,GAC9B,MAA6B,mBAAlBl/C,MAAMC,QACTD,MAAMC,QAAQi/C,GAGK,mBAApBH,GAAMr+C,KAAKw+C,EAClB,EAEGnoB,GAAgB,SAAuByjB,GACtC,IAACA,GAA2B,oBAApBuE,GAAMr+C,KAAK85C,GACtB,OAAO,EAGJ2E,IASAx+C,EATAw+C,EAAoB93C,GAAO3G,KAAK85C,EAAK,eACrC4E,EAAmB5E,EAAI56C,aAAe46C,EAAI56C,YAAYW,WAAa8G,GAAO3G,KAAK85C,EAAI56C,YAAYW,UAAW,iBAE1Gi6C,GAAAA,EAAI56C,cAAgBu/C,IAAsBC,EAC7C,OAAO,EAMHz+C,IAAAA,KAAO65C,GAEZ,YAAsB,IAAR75C,GAAuB0G,GAAO3G,KAAK85C,EAAK75C,EACtD,EAGG0+C,GAAc,SAAqBrzC,EAAQnD,GAC1C0d,IAAmC,cAAjB1d,EAAQJ,KAC7B8d,GAAeva,EAAQnD,EAAQJ,KAAM,CACpC8jB,YAAY,EACZD,cAAc,EACdnqB,MAAO0G,EAAQlG,SACf6pB,UAAU,IAGXxgB,EAAOnD,EAAQJ,MAAQI,EAAQlG,QAEhC,EAGG28C,GAAc,SAAqB9E,EAAK/xC,GACvCA,GAAS,cAATA,EAAsB,CACrB,IAACpB,GAAO3G,KAAK85C,EAAK/xC,GACrB,OACM,GAAIu2C,GAGV,OAAOA,GAAKxE,EAAK/xC,GAAMtG,KAExB,CAEMq4C,OAAAA,EAAI/xC,EACX,EAEDopC,GAAiB,SAASA,IACrBhpC,IAAAA,EAASJ,EAAM82C,EAAK/jB,EAAMgkB,EAAarb,EACvCn4B,EAASrK,UAAU,GACnB7B,EAAI,EACJD,EAAS8B,UAAU9B,OACnB4/C,GAAO,EAaX,IAVsB,kBAAXzzC,IACVyzC,EAAOzzC,EACPA,EAASrK,UAAU,IAAM,GAEzB7B,EAAI,IAES,MAAVkM,GAAqC,iBAAXA,GAAyC,mBAAXA,KAC3DA,EAAS,CAAA,GAGHlM,EAAID,IAAUC,EAGhB+I,GAAW,OAFfA,EAAUlH,UAAU7B,IAId2I,IAAAA,KAAQI,EACZ02C,EAAMD,GAAYtzC,EAAQvD,GAItBuD,KAHJwvB,EAAO8jB,GAAYz2C,EAASJ,MAKvBg3C,GAAQjkB,IAASzE,GAAcyE,KAAUgkB,EAAcv/C,GAAQu7B,MAC9DgkB,GACHA,GAAc,EACdrb,EAAQob,GAAOt/C,GAAQs/C,GAAOA,EAAM,IAEpCpb,EAAQob,GAAOxoB,GAAcwoB,GAAOA,EAAM,CAAA,EAI3CF,GAAYrzC,EAAQ,CAAEvD,KAAMA,EAAM9F,SAAUkvC,EAAO4N,EAAMtb,EAAO3I,WAGtC,IAATA,GACjB6jB,GAAYrzC,EAAQ,CAAEvD,KAAMA,EAAM9F,SAAU64B,KAQjD,OAAOxvB,CACP,ECpHc,SAAS+qB,GAAc50B,GACjC7B,GAA0C,oBAA1CA,OAAOC,UAAUC,SAASE,KAAKyB,GAClC,OAAO,EAGR,MAAM5B,EAAYD,OAAOulB,eAAe1jB,GACjC5B,OAAc,OAAdA,GAAsBA,IAAcD,OAAOC,SAClD,CCUM,SAASm/C,KAERC,MAAAA,EAAM,GAENC,EAAW,CAACC,IAKlB,YAAgBv/B,GACVw/B,IAAAA,GAAmB,EAEvB,MAAMriB,EAAWnd,EAAO4P,MAExB,GAAwB,mBAAbuN,EACT,MAAM,IAAI/Y,UAAU,2CAA6C+Y,IAWnE,SAAS4L,EAAKphC,KAAU83C,GACtB,MAAMv7C,EAAKm7C,IAAMG,GACb1rC,IAAAA,GAAS,EAEb,GAAInM,EACFw1B,EAASx1B,OADX,CAMA,OAASmM,EAAQkM,EAAOzgB,QACA,OAAlBkgD,EAAO3rC,SAAqCxS,IAAlBm+C,EAAO3rC,KACnC2rC,EAAO3rC,GAASkM,EAAOlM,IAK3BkM,EAASy/B,EAGLv7C,EA6BH,SAAcw7C,EAAYviB,GAE/B,IAAIwiB,EAEJ,OAAOjH,EAQP,SAASA,KAAWkH,GACZC,MAAAA,EAAoBH,EAAWngD,OAASqgD,EAAWrgD,OAEzD,IAAIkgB,EAEAogC,GACFD,EAAWx4C,KAAK4hC,GAGd,IACFvpB,EAASigC,EAAWp4C,MAAM5D,KAAMk8C,EADlC,CAEE,MAAOj4C,GAOHk4C,GAAAA,GAAqBF,EACvB,MAPsCh4C,EAUjCqhC,OAAAA,EAViCrhC,EAWzC,CAEIk4C,IACCpgC,aAAkBqI,QACpBrI,EAAOqgC,KAAKA,EAAM9W,GACTvpB,aAAkB7c,MAC3BomC,EAAKvpB,GAELqgC,EAAKrgC,GAGV,CAMD,SAASupB,EAAKrhC,KAAU83C,GACjBE,IACHA,GAAS,EACTxiB,EAASx1B,KAAU83C,GAEtB,CAOQK,SAAAA,EAAKj+C,GACZmnC,EAAK,KAAMnnC,EACZ,CACF,CA/FOsvC,CAAKjtC,EAAI6kC,EAAToI,IAAkBsO,GAElBtiB,EAAS,QAASsiB,EAvBU,CAyB/B,CAjCD1W,CAAK,QAAS/oB,EAkCf,EAhDsB+/B,IAmDdA,SAAIC,GACX,GAA0B,mBAAfA,EACT,MAAM,IAAI57B,UACR,+CAAiD47B,GAKrD,OADAX,EAAIj4C,KAAK44C,GACFV,CACR,GA1DD,OAAOA,CA2DR,CCtDM,MAAMW,GAQb,SAASC,IACDC,MAAAA,EAAef,KAEfgB,EAAY,GAEdC,IAEAC,EAFAD,EAAY,CAAA,EAGZE,GAAe,EA2BZC,OAvBPA,EAAUl2B,KA6CV,SAAcjqB,EAAKwB,GACjB,GAAmB,iBAARxB,EAET,OAAyB,IAArBgB,UAAU9B,QACZkhD,GAAe,OAAQH,GACvBD,EAAUhgD,GAAOwB,EACV2+C,GAIDE,GAAItgD,KAAKigD,EAAWhgD,IAAQggD,EAAUhgD,IAAS,KAIzD,GAAIA,EAGF,OAFAogD,GAAe,OAAQH,GACvBD,EAAYhgD,EACLmgD,EAIT,OAAOH,CACR,EAlEDG,EAAUG,YAASr/C,EACnBk/C,EAAUI,cAAWt/C,EAGrBk/C,EAAUK,OAiEV,WACE,GAAIP,EACF,OAAOE,EAGT,OAASD,EAAcH,EAAU7gD,QAAQ,CACjC,MAACuhD,KAAav4C,GAAW63C,EAAUG,GAEzC,IAAmB,IAAfh4C,EAAQ,GACV,UAGiB,IAAfA,EAAQ,KACVA,EAAQ,QAAKjH,GAITy/C,MAAAA,EAAcD,EAAS1gD,KAAKogD,KAAcj4C,GAErB,mBAAhBw4C,GACTZ,EAAaJ,IAAIgB,EAEpB,CAKD,OAHAT,GAAS,EACTC,EAAcpzC,OAAO6zC,kBAEdR,CACR,EA1FDA,EAAUJ,UAAYA,EAEtBI,EAAUT,IA+FV,SAAal+C,KAAU0G,GAErB,IAAIgtC,EAIA1zC,GAFJ4+C,GAAe,MAAOH,GAElBz+C,cAEG,GAAqB,mBAAVA,EAChBo/C,EAAUp/C,KAAU0G,OACf,IAAqB,iBAAV1G,EAOhB,MAAM,IAAIuiB,UAAU,+BAAiCviB,EAAQ,KANzDnC,MAAMC,QAAQkC,GAChBq/C,EAAQr/C,GAERs/C,EAAUt/C,EAIb,CAEG0zC,IACF8K,EAAU9K,SAAWv1C,OAAOqpC,OAAOgX,EAAU9K,UAAY,CAAA,EAAIA,IAG/D,OAAOiL,EAMEl8C,SAAAA,EAAIzC,GACX,GAAqB,mBAAVA,EACTo/C,EAAUp/C,OACL,IAAqB,iBAAVA,EAQhB,MAAM,IAAIuiB,UAAU,+BAAiCviB,EAAQ,KAP7D,GAAInC,MAAMC,QAAQkC,GAAQ,CACxB,MAAOu/C,KAAW74C,GAAW1G,EAC7Bo/C,EAAUG,KAAW74C,EACtB,MACC44C,EAAUt/C,EAIb,CACF,CAMQs/C,SAAAA,EAAU1hC,GACjByhC,EAAQzhC,EAAO4hC,SAEX5hC,EAAO81B,WACTA,EAAWv1C,OAAOqpC,OAAOkM,GAAY,CAAA,EAAI91B,EAAO81B,UAEnD,CAMQ2L,SAAAA,EAAQG,GACXvtC,IAAAA,GAAS,EAETutC,GAAAA,aAEG,KAAI3hD,MAAMC,QAAQ0hD,GAMvB,MAAM,IAAIj9B,UAAU,oCAAsCi9B,EAAU,KALpE,OAASvtC,EAAQutC,EAAQ9hD,QAAQ,CAE/B+E,EADc+8C,EAAQvtC,GAEvB,CAGF,CACF,CAOD,SAASmtC,EAAUG,EAAQv/C,GACrBiS,IAEA1E,EAFA0E,GAAS,EAIb,OAASA,EAAQssC,EAAU7gD,QACrB6gD,GAAAA,EAAUtsC,GAAO,KAAOstC,EAAQ,CAClChyC,EAAQgxC,EAAUtsC,GAClB,KACD,CAGC1E,GACEkyC,GAAWlyC,EAAM,KAAOkyC,GAAWz/C,KACrCA,EAAQ0vC,IAAO,EAAMniC,EAAM,GAAIvN,IAGjCuN,EAAM,GAAKvN,GAGXu+C,EAAUh5C,KAAK,IAAI/F,WAEtB,CACF,EApMDm/C,EAAUe,MAuMDA,SAAMC,GACbhB,EAAUK,SACV,MAAM3F,EAAOuG,GAAMD,GACbb,EAASH,EAAUG,OAGzB,GAFAe,GAAa,QAASf,GAElBgB,GAAQhB,EAAQ,SAEX,OAAA,IAAIA,EAAOx8B,OAAO+2B,GAAOA,GAAMqG,QAIjCZ,OAAAA,EAAOx8B,OAAO+2B,GAAOA,EAC7B,EAnNDsF,EAAU1D,UAsNV,SAAmBz2C,EAAMm7C,GACvBhB,EAAUK,SACV,MAAM3F,EAAOuG,GAAMD,GACbZ,EAAWJ,EAAUI,SAI3B,GAHAgB,GAAe,YAAahB,GAC5BiB,GAAWx7C,GAEPs7C,GAAQf,EAAU,WAEb,OAAA,IAAIA,EAASv6C,EAAM60C,GAAM4G,UAIlC,OAAOlB,EAASv6C,EAAM60C,EACvB,EAlODsF,EAAUjB,IA0OV,SAAal5C,EAAMm7C,EAAKrkB,GACtB0kB,GAAWx7C,GACXm6C,EAAUK,SAEL1jB,GAA2B,mBAARqkB,IACtBrkB,EAAWqkB,EACXA,OAAMlgD,GAGJ,IAAC67B,EACH,OAAO,IAAIrV,QAAQi6B,GAUrB,SAASA,EAAStf,EAAS8M,GAUzB,SAASvG,EAAKrhC,EAAOq6C,EAAM9G,GACzB8G,EAAOA,GAAQ37C,EACXsB,EACF4nC,EAAO5nC,GACE86B,EACTA,EAAQuf,GAGR7kB,EAAS,KAAM6kB,EAAM9G,EAExB,CAlBDiF,EAAaZ,IAAIl5C,EAAMo7C,GAAMD,GAAMxY,EAmBpC,CA5BD+Y,EAAS,KAAM5kB,EA6BhB,EAnRDqjB,EAAUyB,QAsRV,SAAiB57C,EAAM60C,GAErB,IAAIz7B,EAEAyiC,EAOJ,OALA1B,EAAUjB,IAAIl5C,EAAM60C,EAAMlS,GAE1BmZ,GAAW,UAAW,MAAOD,GAGtBziC,EAOP,SAASupB,EAAKrhC,EAAOq6C,GACnBxD,GAAK72C,GACL8X,EAASuiC,EACTE,GAAW,CACZ,CACF,EA3SD1B,EAAU5iC,QAkTV,SAAiB4jC,EAAKrkB,GAKhB,GAJJqjB,EAAUK,SACVa,GAAa,UAAWlB,EAAUG,QAClCiB,GAAe,UAAWpB,EAAUI,WAE/BzjB,EACH,OAAO,IAAIrV,QAAQi6B,GAUrB,SAASA,EAAStf,EAAS8M,GACzB,MAAM2L,EAAOuG,GAAMD,GA0BnB,SAASxY,EAAKrhC,EAAOuzC,GACfvzC,IAAUuzC,EACZ3L,EAAO5nC,GACE86B,EACTA,EAAQyY,GAGR/d,EAAS,KAAM+d,EAElB,CAjCDsF,EAAUjB,IAAIiB,EAAUe,MAAMrG,GAAOA,GAAM,CAACvzC,EAAOq6C,EAAM9G,KACvD,IAAIvzC,GAAUq6C,GAAS9G,EAEhB,CAECz7B,MAAAA,EAAS+gC,EAAU1D,UAAUkF,EAAM9G,GAErCz7B,UAsMY,iBADI5d,EAnMY4d,IAoMJuH,GAASnlB,GAnMnCq5C,EAAKr5C,MAAQ4d,EAEby7B,EAAKz7B,OAASA,GAGhBupB,EAAKrhC,EAAOuzC,EACb,MAdClS,EAAKrhC,GA0Mf,IAA8B9F,CA5LrB,GAkBJ,CA5CDkgD,EAAS,KAAM5kB,EA6ChB,EAvWDqjB,EAAU4B,YA0WDA,SAAYZ,GAEnB,IAAIU,EAEJ1B,EAAUK,SACVa,GAAa,cAAelB,EAAUG,QACtCiB,GAAe,cAAepB,EAAUI,UAExC,MAAM1F,EAAOuG,GAAMD,GAMnB,OAJAhB,EAAU5iC,QAAQs9B,EAAMlS,GAExBmZ,GAAW,cAAe,UAAWD,GAE9BhH,EAMElS,SAAAA,EAAKrhC,GACZu6C,GAAW,EACX1D,GAAK72C,EACN,CACF,EA/XM64C,EAIP,SAASA,IACD6B,MAAAA,EAAcnC,IAChBpsC,IAAAA,GAAS,EAEb,OAASA,EAAQssC,EAAU7gD,QACzB8iD,EAAYtC,OAAOK,EAAUtsC,IAK/B,OAFAuuC,EAAY/3B,KAAKinB,IAAO,EAAM,CAAP,EAAW8O,IAE3BgC,CACR,CAiXF,CA3asBnC,GAAOW,SAExBH,GAAM,CAAGvgD,EAAAA,eAkbf,SAASwhD,GAAQ9/C,EAAOsG,GACtB,MACmB,mBAAVtG,GAGPA,EAAM5B,YAeV,SAAc4B,GAEZ,IAAIxB,EAECA,IAAAA,KAAOwB,EACN6+C,GAAAA,GAAItgD,KAAKyB,EAAOxB,GAClB,OAAO,EAIX,OAAO,CACR,CArBIZ,CAAKoC,EAAM5B,YAAckI,KAAQtG,EAAM5B,UAE3C,CA4BD,SAASyhD,GAAav5C,EAAMtG,GAC1B,GAAqB,mBAAVA,EACT,MAAM,IAAIuiB,UAAU,WAAajc,EAAO,qBAE3C,CASD,SAASy5C,GAAez5C,EAAMtG,GAC5B,GAAqB,mBAAVA,EACT,MAAM,IAAIuiB,UAAU,WAAajc,EAAO,uBAE3C,CASD,SAASs4C,GAAet4C,EAAMm4C,GAC5B,GAAIA,EACF,MAAM,IAAI19C,MACR,gBACEuF,EACA,mHAGP,CAQD,SAAS05C,GAAWx7C,GAGlB,IAAKi7C,GAAWj7C,IAA8B,iBAAdA,EAAK6B,KAC7B,MAAA,IAAIkc,UAAU,uBAAyB/d,EAAO,IAGvD,CAUD,SAAS87C,GAAWh6C,EAAMm6C,EAAWJ,GAC/B,IAACA,EACG,MAAA,IAAIt/C,MACR,IAAMuF,EAAO,0BAA4Bm6C,EAAY,YAG1D,CAMD,SAASb,GAAM5/C,GACN0gD,OAOT,SAAyB1gD,GACvB,OAAO2gD,QACL3gD,GACmB,iBAAVA,GACP,YAAaA,GACb,aAAcA,EAEnB,CAdQ0gD,CAAgB1gD,GAASA,EAAQ,IAAIg8C,GAAMh8C,EACnD,CCziBD,SAAS4gD,GAAIp8C,EAAMq8C,GACjB,OACGr8C,GACiB,iBAATA,IAENA,EAAKxE,QAEH6gD,EAAkBr8C,EAAKs8C,IAAM,KAEft8C,aAAAA,GAAQu8C,GAAIv8C,EAAKJ,SAAUy8C,IACzChjD,MAAMC,QAAQ0G,IAASu8C,GAAIv8C,EAAMq8C,KACtC,EAEH,CAOD,SAASE,GAAI5iC,EAAQ0iC,GAKnB,IAHIjjC,IAAAA,EAAS,GACT3L,GAAS,IAEJA,EAAQkM,EAAOzgB,QACtBkgB,EAAO3L,GAAS2uC,GAAIziC,EAAOlM,GAAQ4uC,GAGrC,OAAOjjC,EAAOlY,KAAK,GACpB,CCtCM,SAAS0N,GAAO4tC,EAAM32C,EAAOsjC,EAAQsT,GAC1C,MAAM12C,EAAMy2C,EAAKtjD,OACbwjD,IAGAnD,EAHAmD,EAAa,EAajB,GAPE72C,EADEA,EAAQ,GACDA,EAAQE,EAAM,EAAIA,EAAMF,EAEzBA,EAAQE,EAAMA,EAAMF,EAG9BsjC,EAASA,EAAS,EAAIA,EAAS,EAE3BsT,EAAMvjD,OAAS,IACjBqgD,EAAalgD,MAAMsjD,KAAKF,GACxBlD,EAAWxuC,QAAQlF,EAAOsjC,GACzB,GAAGv6B,OAAO3N,MAAMu7C,EAAMjD,QAKvB,IAFIpQ,GAAQ,GAAGv6B,OAAO3N,MAAMu7C,EAAM,CAAC32C,EAAOsjC,IAEnCuT,EAAaD,EAAMvjD,QACxBqgD,EAAakD,EAAMthC,MAAMuhC,EAAYA,EAAa,KAClDnD,EAAWxuC,QAAQlF,EAAO,GACzB,GAAG+I,OAAO3N,MAAMu7C,EAAMjD,GACvBmD,GAAc,IACd72C,GAAS,GAGd,CAcM,SAAS9E,GAAKy7C,EAAMC,GACzB,OAAID,EAAKtjD,OAAS,GAChB0V,GAAO4tC,EAAMA,EAAKtjD,OAAQ,EAAGujD,GACtBD,GAGFC,CACR,CC3DD,MAAM3iD,GAAiB,CAAA,EAAGA,eAQnB,SAAS8iD,GAAkBC,GAE1BN,MAAAA,EAAM,CAAA,EACR9uC,IAAAA,GAAS,EAEb,OAASA,EAAQovC,EAAW3jD,QAC1B4jD,GAAgBP,EAAKM,EAAWpvC,IAGlC,OAAO8uC,CACR,CASD,SAASO,GAAgBP,EAAKQ,GAE5B,IAAIC,EAECA,IAAAA,KAAQD,EAAW,CACtB,MACME,GADQnjD,GAAeC,KAAKwiD,EAAKS,GAAQT,EAAIS,QAAQ/hD,KACpCshD,EAAIS,GAAQ,CAAjB,GACZE,EAAQH,EAAUC,GAExB,IAAIpH,EAECA,IAAAA,KAAQsH,EAAO,CACbpjD,GAAeC,KAAKkjD,EAAMrH,KAAOqH,EAAKrH,GAAQ,IACnD,MAAMp6C,EAAQ0hD,EAAMtH,GACpBuH,GAEEF,EAAKrH,GACLv8C,MAAMC,QAAQkC,GAASA,EAAQA,EAAQ,CAACA,GAAS,GAEpD,CACF,CACF,CAUD,SAAS2hD,GAAWC,EAAUZ,GACxB/uC,IAAAA,GAAS,EAEPoyB,MAAAA,EAAS,GAEf,OAASpyB,EAAQ+uC,EAAKtjD,SAEE,UAApBsjD,EAAK/uC,GAAOxP,IAAkBm/C,EAAWvd,GAAQ9+B,KAAKy7C,EAAK/uC,IAG/DmB,GAAOwuC,EAAU,EAAG,EAAGvd,EACxB,CCxEM,MCWMwd,GAAaC,GAAW,YAQxBC,GAAaD,GAAW,MAexBE,GAAgBF,GAAW,cAS3BG,GAAoBH,GAAW,cAU/BI,GAAmBJ,GAAW,kBAkB9BK,GAAaL,GAAW,uBAW9B,SAASM,GAAahI,GAEzB,OAES,OAATA,IAAkBA,EAAO,IAAe,MAATA,EAElC,CASM,SAASiI,GAA0BjI,GACjCA,OAAS,OAATA,IAAkBA,EAAO,GAAc,KAATA,EACtC,CAeM,SAASkI,GAAmBlI,GACjC,OAAgB,OAATA,GAAiBA,GAAQ,CACjC,CAeM,SAASmI,GAAcnI,GAC5B,OAAiB,IAAVA,IAAyB,IAAVA,GAAwB,KAATA,CACtC,CAiBM,MAAMoI,GAAoBV,GAAW,MAkB/BW,GAAqBX,GDvKhC,+vCC+KF,SAASA,GAAWY,GAClB,OAQSC,SAAMvI,GACb,OAAgB,OAATA,GAAiBsI,EAAM9hC,KAAK0B,OAAOsgC,aAAaxI,GACxD,CACF,CCrLM,SAASyI,GAAaC,EAASC,EAAI18C,EAAMiE,GACxC6jC,MAAAA,EAAQ7jC,EAAMA,EAAM,EAAIgB,OAAO6zC,kBACjC1wC,IAAAA,EAAO,EACX,OAGSpE,SAAM+vC,GACb,GAAImI,GAAcnI,GAETjF,OADP2N,EAAQE,MAAM38C,GACP8uC,EAAOiF,GAGT2I,OAAAA,EAAG3I,EACX,EAGQjF,SAAAA,EAAOiF,GACVmI,OAAAA,GAAcnI,IAAS3rC,IAAS0/B,GAClC2U,EAAQG,QAAQ7I,GACTjF,IAGT2N,EAAQI,KAAK78C,GACN08C,EAAG3I,GACX,CACF,CC5BM,MAAM+I,GAAU,CACrBC,SAIF,SAA2BN,GACzB,MAAMO,EAAeP,EAAQlZ,QAC3B/nC,KAAKyhD,OAAO3B,WAAW4B,gBAUhBC,SAA2BpJ,GAC9BA,GAAS,OAATA,EAEF,YADA0I,EAAQG,QAAQ7I,GAOlB,OAHA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GAAaC,EAASO,EAAc,aAC5C,IAGQI,SAAiBrJ,GAEjBsJ,OADPZ,EAAQE,MAAM,aACPU,EAAUtJ,EAClB,IApBD,IAAIlkB,EACJ,OAAOmtB,EAsBEK,SAAAA,EAAUtJ,GACjB,MAAMuJ,EAAQb,EAAQE,MAAM,YAAa,CACvCY,YAAa,OACb1tB,aAQKzN,OALHyN,IACFA,EAASgR,KAAOyc,GAGlBztB,EAAWytB,EACJl7B,EAAK2xB,EACb,CAGQ3xB,SAAAA,EAAK2xB,GACRA,OAAS,OAATA,GACF0I,EAAQI,KAAK,aACbJ,EAAQI,KAAK,kBACbJ,EAAQG,QAAQ7I,IAIdkI,GAAmBlI,IACrB0I,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,aACNQ,IAGTZ,EAAQG,QAAQ7I,GACT3xB,EACR,CACF,GC1DM,MAAMo7B,GAAW,CACtBT,SASF,SAA4BN,GACpBvnC,MAAAA,EAAO1Z,KAGPkpB,EAAQ,GACV+4B,IAGAC,EAGAC,EAGAC,EATAH,EAAY,EAUhB,OAAOz5C,EAGEA,SAAAA,EAAM+vC,GAWb,GAAI0J,EAAY/4B,EAAMrtB,OAAQ,CAC5B,MAAMwmD,EAAOn5B,EAAM+4B,GAEnB,OADAvoC,EAAK4oC,eAAiBD,EAAK,GACpBpB,EAAQlZ,QACbsa,EAAK,GAAGE,aACRC,EACAC,EAHKxB,CAIL1I,EAlBe,CAqBZkK,OAAAA,EAAmBlK,EAC3B,CAGQiK,SAAAA,EAAiBjK,GAKxB,GAJA0J,IAIIvoC,EAAK4oC,eAAeI,WAAY,CAClChpC,EAAK4oC,eAAeI,gBAAa9kD,EAE7BskD,GACFS,IAIF,MAAMC,EAAmBlpC,EAAKmpC,OAAOhnD,OACjCinD,IAGApM,EAHAoM,EAAkBF,EAKfE,KAAAA,KAEHppC,GAAoC,SAApCA,EAAKmpC,OAAOC,GAAiB,IACY,cAAzCppC,EAAKmpC,OAAOC,GAAiB,GAAGt+C,KAChC,CACAkyC,EAAQh9B,EAAKmpC,OAAOC,GAAiB,GAAGp6C,IACxC,KACD,CAGHq6C,EAAed,GAEX7xC,IAAAA,EAAQwyC,EAEZ,KAAOxyC,EAAQsJ,EAAKmpC,OAAOhnD,QACzB6d,EAAKmpC,OAAOzyC,GAAO,GAAG1H,IAAMpM,OAAOqpC,OAAO,GAAI+Q,GAC9CtmC,IAWKqyC,OARPlxC,GACEmI,EAAKmpC,OACLC,EAAkB,EAClB,EACAppC,EAAKmpC,OAAO/kC,MAAM8kC,IAGpBlpC,EAAKmpC,OAAOhnD,OAASuU,EACdqyC,EAAmBlK,EAC3B,CAEM/vC,OAAAA,EAAM+vC,EACd,CAGQkK,SAAAA,EAAmBlK,GAM1B,GAAI0J,IAAc/4B,EAAMrtB,OAAQ,CAI1B,IAACqmD,EACIc,OAAAA,EAAkBzK,GAKvB2J,GAAAA,EAAUe,kBAAoBf,EAAUe,iBAAiBC,SACpDC,OAAAA,EAAU5K,GAKnB7+B,EAAK0pC,UAAYtE,QACfoD,EAAUe,mBAAqBf,EAAUmB,8BAvBb,CA4BzBpC,OADPvnC,EAAK4oC,eAAiB,GACfrB,EAAQH,MACbwC,GACAC,EACAC,EAHKvC,CAIL1I,EACH,CAGQgL,SAAAA,EAAqBhL,GAGrByK,OAFHd,GAAWS,IACfI,EAAed,GACRe,EAAkBzK,EAC1B,CAGQiL,SAAAA,EAAsBjL,GAGtB4K,OAFPzpC,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,MAAQsL,IAAc/4B,EAAMrtB,OACxDumD,EAAkB1oC,EAAKkJ,MAAMrG,OACtB4mC,EAAU5K,EAClB,CAGQyK,SAAAA,EAAkBzK,GAGlB0I,OADPvnC,EAAK4oC,eAAiB,GACfrB,EAAQlZ,QACbub,GACAI,EACAP,EAHKlC,CAIL1I,EACH,CAGQmL,SAAAA,EAAkBnL,GAIlByK,OAHPf,IACA/4B,EAAMxlB,KAAK,CAACgW,EAAKupC,iBAAkBvpC,EAAK4oC,iBAEjCU,EAAkBzK,EAC1B,CAGQ4K,SAAAA,EAAU5K,GACbA,OAAS,OAATA,GACE2J,GAAWS,IACfI,EAAe,QACf9B,EAAQG,QAAQ7I,KAIlB2J,EAAYA,GAAaxoC,EAAK+nC,OAAOvZ,KAAKxuB,EAAKkJ,OAC/Cq+B,EAAQE,MAAM,YAAa,CACzBY,YAAa,OACb1tB,SAAU8tB,EACVwB,WAAYzB,IAEP0B,EAAarL,GACrB,CAGQqL,SAAAA,EAAarL,GAChBA,OAAS,OAATA,GACFsL,EAAa5C,EAAQI,KAAK,cAAc,GACxC0B,EAAe,QACf9B,EAAQG,QAAQ7I,IAIdkI,GAAmBlI,IACrB0I,EAAQG,QAAQ7I,GAChBsL,EAAa5C,EAAQI,KAAK,cAE1BY,EAAY,EACZvoC,EAAK0pC,eAAYxlD,EACV4K,IAGTy4C,EAAQG,QAAQ7I,GACTqL,EACR,CAOD,SAASC,EAAa/B,EAAOgC,GAC3B,MAAMC,EAASrqC,EAAKsqC,YAAYlC,GAwChC,GAvCIgC,GAAKC,EAAOrgD,KAAK,MACrBo+C,EAAMztB,SAAW8tB,EACbA,IAAYA,EAAW9c,KAAOyc,GAClCK,EAAaL,EACbI,EAAU+B,WAAWnC,EAAMt5C,OAC3B05C,EAAUgC,MAAMH,GAkCZrqC,EAAK+nC,OAAOgC,KAAK3B,EAAMt5C,MAAMmuC,MAAO,CACtC,IAAIvmC,EAAQ8xC,EAAUW,OAAOhnD,OAEtBuU,KAAAA,KAEH,GACA8xC,EAAUW,OAAOzyC,GAAO,GAAG5H,MAAM+T,OAAS6lC,KACxCF,EAAUW,OAAOzyC,GAAO,GAAG1H,KAC3Bw5C,EAAUW,OAAOzyC,GAAO,GAAG1H,IAAI6T,OAAS6lC,GAI1C,OAKJ,MAAMQ,EAAmBlpC,EAAKmpC,OAAOhnD,OACjCinD,IAGA/zB,EAGA2nB,EANAoM,EAAkBF,EAQfE,KAAAA,KAEHppC,GAAoC,SAApCA,EAAKmpC,OAAOC,GAAiB,IACY,cAAzCppC,EAAKmpC,OAAOC,GAAiB,GAAGt+C,KAChC,CACA,GAAIuqB,EAAM,CACR2nB,EAAQh9B,EAAKmpC,OAAOC,GAAiB,GAAGp6C,IACxC,KACD,CAEDqmB,GAAO,CACR,CAOH,IAJAg0B,EAAed,GAEf7xC,EAAQwyC,EAEDxyC,EAAQsJ,EAAKmpC,OAAOhnD,QACzB6d,EAAKmpC,OAAOzyC,GAAO,GAAG1H,IAAMpM,OAAOqpC,OAAO,GAAI+Q,GAC9CtmC,IAGFmB,GACEmI,EAAKmpC,OACLC,EAAkB,EAClB,EACAppC,EAAKmpC,OAAO/kC,MAAM8kC,IAGpBlpC,EAAKmpC,OAAOhnD,OAASuU,CACtB,CACF,CAMQ2yC,SAAAA,EAAen2C,GACtB,IAAIwD,EAAQ8Y,EAAMrtB,OAEXuU,KAAAA,KAAUxD,GAAM,CACrB,MAAMlB,EAAQwd,EAAM9Y,GACpBsJ,EAAK4oC,eAAiB52C,EAAM,GAC5BA,EAAM,GAAG21C,KAAK3kD,KAAKgd,EAAMunC,EAC1B,CAED/3B,EAAMrtB,OAAS+Q,CAChB,CAED,SAAS+1C,IACPT,EAAUgC,MAAM,CAAC,OACjB/B,OAAavkD,EACbskD,OAAYtkD,EACZ8b,EAAK4oC,eAAeI,gBAAa9kD,CAClC,CACF,GAjVK0lD,GAAqB,CACzB/B,SAmVF,SAA2BN,EAASC,EAAIiD,GACtC,OAAOnD,GACLC,EACAA,EAAQlZ,QAAQ/nC,KAAKyhD,OAAO3B,WAAWkC,SAAUd,EAAIiD,GACrD,aACAnkD,KAAKyhD,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBAAkBpU,EAAY,EAE9E,GC/VM,SAAS0mD,GAAkB/L,GAChC,OACW,OAATA,GACAiI,GAA0BjI,IAC1BoI,GAAkBpI,GAEX,EAGLqI,GAAmBrI,GACd,OADT,CAGD,CCnBM,SAASgM,GAAWzE,EAAY+C,EAAQ1iC,GAEvC87B,MAAAA,EAAS,GACX7rC,IAAAA,GAAS,EAEb,OAASA,EAAQ0vC,EAAWjkD,QAAQ,CAClC,MAAMkjC,EAAU+gB,EAAW1vC,GAAOm0C,WAE9BxlB,IAAYkd,EAAOjqC,SAAS+sB,KAC9B8jB,EAAS9jB,EAAQ8jB,EAAQ1iC,GACzB87B,EAAOv4C,KAAKq7B,GAEf,CAED,OAAO8jB,CACR,CCdM,MAAM2B,GAAY,CACvB//C,KAAM,YACN88C,SAwKF,SAA2BN,EAASC,GAC5BuD,MAAAA,EAAmBzkD,KAAKyhD,OAAO3B,WAAW2E,iBAAiBJ,KAC3DhwB,EAAWr0B,KAAKq0B,SAChBmO,EAAS8hB,GAAkBjwB,GAGjC,IAAIqwB,EACJ,OAGSl8C,SAAM+vC,GAGNoM,OAFP1D,EAAQE,MAAM,qBACduD,EAASnM,EACFoM,EAASpM,EACjB,EAGQoM,SAAAA,EAASpM,GACZA,GAAAA,IAASmM,EAEX,OADAzD,EAAQG,QAAQ7I,GACToM,EAGT,MAAM7C,EAAQb,EAAQI,KAAK,qBACrB7X,EAAQ8a,GAAkB/L,GAC1BqM,GACHpb,GAAoB,IAAVA,GAAehH,GAAWiiB,EAAiBzyC,SAASumC,GAC3DsM,GACHriB,GAAsB,IAAXA,GAAgBgH,GAAUib,EAAiBzyC,SAASqiB,GAG3D6sB,OAFPY,EAAMgD,MAAQhG,QAAmB,KAAX4F,EAAgBE,EAAOA,IAASpiB,IAAWqiB,IACjE/C,EAAMiD,OAASjG,QAAmB,KAAX4F,EAAgBG,EAAQA,IAAUrb,IAAUob,IAC5D1D,EAAG3I,EACX,CACF,EAxMCgM,WAQF,SAA6B1B,EAAQ1iC,GAC/B/P,IAGAw0C,EAGAvjB,EAGA3wB,EAGAs0C,EAGAC,EAGA5I,EAGA6I,EAGA3oC,EAxBAnM,GAAS,EA6Bb,OAASA,EAAQyyC,EAAOhnD,QAEtB,GACuB,UAArBgnD,EAAOzyC,GAAO,IACY,sBAA1ByyC,EAAOzyC,GAAO,GAAG5L,MACjBq+C,EAAOzyC,GAAO,GAAG20C,OAIVH,IAFPA,EAAOx0C,EAEAw0C,KAEL,GACsB,SAApB/B,EAAO+B,GAAM,IACY,sBAAzB/B,EAAO+B,GAAM,GAAGpgD,MAChBq+C,EAAO+B,GAAM,GAAGE,OAChB3kC,EAAQglC,eAAetC,EAAO+B,GAAM,IAAI5kB,WAAW,KACjD7f,EAAQglC,eAAetC,EAAOzyC,GAAO,IAAI4vB,WAAW,GACtD,CAME,IAAC6iB,EAAO+B,GAAM,GAAGG,QAAUlC,EAAOzyC,GAAO,GAAG00C,SAC3CjC,EAAOzyC,GAAO,GAAG1H,IAAI6T,OAASsmC,EAAOzyC,GAAO,GAAG5H,MAAM+T,QAAU,MAE7DsmC,EAAO+B,GAAM,GAAGl8C,IAAI6T,OACnBsmC,EAAO+B,GAAM,GAAGp8C,MAAM+T,OACtBsmC,EAAOzyC,GAAO,GAAG1H,IAAI6T,OACrBsmC,EAAOzyC,GAAO,GAAG5H,MAAM+T,QACzB,GAGF,SAGF8/B,EACEwG,EAAO+B,GAAM,GAAGl8C,IAAI6T,OAASsmC,EAAO+B,GAAM,GAAGp8C,MAAM+T,OAAS,GAC5DsmC,EAAOzyC,GAAO,GAAG1H,IAAI6T,OAASsmC,EAAOzyC,GAAO,GAAG5H,MAAM+T,OAAS,EAC1D,EACA,EACN,MAAM/T,EAAQlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGl8C,KAC1CA,EAAMpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOzyC,GAAO,GAAG5H,OAC/C48C,GAAU58C,GAAQ6zC,GAClB+I,GAAU18C,EAAK2zC,GACf2I,EAAkB,CAChBxgD,KAAM63C,EAAM,EAAI,iBAAmB,mBACnC7zC,QACAE,IAAKpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGl8C,MAEzCu8C,EAAkB,CAChBzgD,KAAM63C,EAAM,EAAI,iBAAmB,mBACnC7zC,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOzyC,GAAO,GAAG5H,OAC1CE,OAEFgI,EAAO,CACLlM,KAAM63C,EAAM,EAAI,aAAe,eAC/B7zC,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGl8C,KACzCA,IAAKpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOzyC,GAAO,GAAG5H,QAE1C64B,EAAQ,CACN78B,KAAM63C,EAAM,EAAI,SAAW,WAC3B7zC,MAAOlM,OAAOqpC,OAAO,CAAA,EAAIqf,EAAgBx8C,OACzCE,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIsf,EAAgBv8C,MAEzCm6C,EAAO+B,GAAM,GAAGl8C,IAAMpM,OAAOqpC,OAAO,CAAd,EAAkBqf,EAAgBx8C,OACxDq6C,EAAOzyC,GAAO,GAAG5H,MAAQlM,OAAOqpC,OAAO,CAAd,EAAkBsf,EAAgBv8C,KAC3Dw8C,EAAa,GAETrC,EAAO+B,GAAM,GAAGl8C,IAAI6T,OAASsmC,EAAO+B,GAAM,GAAGp8C,MAAM+T,SACrD2oC,EAAaxhD,GAAKwhD,EAAY,CAC5B,CAAC,QAASrC,EAAO+B,GAAM,GAAIzkC,GAC3B,CAAC,OAAQ0iC,EAAO+B,GAAM,GAAIzkC,MAI9B+kC,EAAaxhD,GAAKwhD,EAAY,CAC5B,CAAC,QAAS7jB,EAAOlhB,GACjB,CAAC,QAAS6kC,EAAiB7kC,GAC3B,CAAC,OAAQ6kC,EAAiB7kC,GAC1B,CAAC,QAASzP,EAAMyP,KAGlB+kC,EAAaxhD,GACXwhD,EACAX,GACEpkC,EAAQshC,OAAO3B,WAAWuF,WAAWhB,KACrCxB,EAAO/kC,MAAM8mC,EAAO,EAAGx0C,GACvB+P,IAIJ+kC,EAAaxhD,GAAKwhD,EAAY,CAC5B,CAAC,OAAQx0C,EAAMyP,GACf,CAAC,QAAS8kC,EAAiB9kC,GAC3B,CAAC,OAAQ8kC,EAAiB9kC,GAC1B,CAAC,OAAQkhB,EAAOlhB,KAGd0iC,EAAOzyC,GAAO,GAAG1H,IAAI6T,OAASsmC,EAAOzyC,GAAO,GAAG5H,MAAM+T,QACvDA,EAAS,EACT2oC,EAAaxhD,GAAKwhD,EAAY,CAC5B,CAAC,QAASrC,EAAOzyC,GAAO,GAAI+P,GAC5B,CAAC,OAAQ0iC,EAAOzyC,GAAO,GAAI+P,MAG7B5D,EAAS,EAGXhL,GAAOsxC,EAAQ+B,EAAO,EAAGx0C,EAAQw0C,EAAO,EAAGM,GAC3C90C,EAAQw0C,EAAOM,EAAWrpD,OAAS0gB,EAAS,EAC5C,KACD,CAKPnM,GAAS,EAET,OAASA,EAAQyyC,EAAOhnD,QACQ,sBAA1BgnD,EAAOzyC,GAAO,GAAG5L,OACnBq+C,EAAOzyC,GAAO,GAAG5L,KAAO,QAI5B,OAAOq+C,CACR,GAgDD,SAASuC,GAAU1O,EAAOn6B,GACxBm6B,EAAME,QAAUr6B,EAChBm6B,EAAMn6B,QAAUA,EAChBm6B,EAAM4O,cAAgB/oC,CACvB,CC7NM,MAAMgpC,GAAW,CACtB9gD,KAAM,WACN88C,SAIF,SAA0BN,EAASC,EAAIiD,GACjCv3C,IAAAA,EAAO,EACX,OAGSpE,SAAM+vC,GAMb,OALA0I,EAAQE,MAAM,YACdF,EAAQE,MAAM,kBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,kBACbJ,EAAQE,MAAM,oBACPyD,CACR,EAGQA,SAAAA,EAAKrM,GACZ,OAAIyH,GAAWzH,IACb0I,EAAQG,QAAQ7I,GACTiN,GAGFlF,GAAW/H,GAAQkN,EAAWlN,GAAQ4L,EAAI5L,EAClD,CAGQiN,SAAAA,EAAmBjN,GACnBA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAAe6H,GAAkB7H,GAClEmN,EAAyBnN,GACzBkN,EAAWlN,EAChB,CAGQmN,SAAAA,EAAyBnN,GAC5BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACToN,IAIG,KAATpN,GAAwB,KAATA,GAAwB,KAATA,GAAe6H,GAAkB7H,KAChE3rC,IAAS,IAETq0C,EAAQG,QAAQ7I,GACTmN,GAGFD,EAAWlN,EACnB,CAGQoN,SAAAA,EAAUpN,GACbA,OAAS,KAATA,GACF0I,EAAQI,KAAK,oBACN34C,EAAI6vC,IAGA,OAATA,GAA0B,KAATA,GAAwB,KAATA,GAAegI,GAAahI,GACvD4L,EAAI5L,IAGb0I,EAAQG,QAAQ7I,GACToN,EACR,CAGQF,SAAAA,EAAWlN,GACdA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChB3rC,EAAO,EACAg5C,GAGLtF,GAAW/H,IACb0I,EAAQG,QAAQ7I,GACTkN,GAGFtB,EAAI5L,EACZ,CAGQqN,SAAAA,EAAiBrN,GACxB,OAAO6H,GAAkB7H,GAAQsN,EAAWtN,GAAQ4L,EAAI5L,EACzD,CAGQsN,SAAAA,EAAWtN,GACdA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChB3rC,EAAO,EACAg5C,GAGI,KAATrN,GAEF0I,EAAQI,KAAK,oBAAoB78C,KAAO,gBACjCkE,EAAI6vC,IAGNuN,EAAWvN,EACnB,CAGQuN,SAAAA,EAAWvN,GAClB,OAAc,KAATA,GAAe6H,GAAkB7H,KAAU3rC,IAAS,IACvDq0C,EAAQG,QAAQ7I,GACA,KAATA,EAAcuN,EAAaD,GAG7B1B,EAAI5L,EACZ,CAGQ7vC,SAAAA,EAAI6vC,GAKX,OAJA0I,EAAQE,MAAM,kBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,kBACbJ,EAAQI,KAAK,YACNH,CACR,CACF,GClIM,MAAM6E,GAAY,CACvBxE,SAKF,SAA2BN,EAASC,EAAIiD,GACtC,OAAOnD,GAAaC,GAGX+E,SAAgBzN,GACvB,OAAgB,OAATA,GAAiBkI,GAAmBlI,GAAQ2I,EAAG3I,GAAQ4L,EAAI5L,EACnE,GAL6C,aAM/C,EAXC7T,SAAS,GCDJ,MAAMuhB,GAAa,CACxBxhD,KAAM,aACN88C,SAQF,SAAiCN,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GACTA,GAAS,KAATA,EAAa,CACf,MAAM2N,EAAQxsC,EAAK4oC,eAanB,OAXK4D,EAAMtB,OACT3D,EAAQE,MAAM,aAAc,CAC1BgF,YAAY,IAEdD,EAAMtB,MAAO,GAGf3D,EAAQE,MAAM,oBACdF,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACN7X,CACR,CAEM2a,OAAAA,EAAI5L,EACZ,EAGQ/O,SAAAA,EAAM+O,GACb,OAAImI,GAAcnI,IAChB0I,EAAQE,MAAM,8BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,8BACbJ,EAAQI,KAAK,oBACNH,IAGTD,EAAQI,KAAK,oBACNH,EAAG3I,GACX,CACF,EA9CCgK,aAAc,CACZhB,SAgDJ,SAAwCN,EAASC,EAAIiD,GACnD,OAAOnD,GACLC,EACAA,EAAQlZ,QAAQke,GAAY/E,EAAIiD,GAChC,aACAnkD,KAAKyhD,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBAAkBpU,EAAY,EAE9E,GArDCyjD,KAwDF,SAAcJ,GACZA,EAAQI,KAAK,aACd,GClEM,MAAM+E,GAAkB,CAC7B3hD,KAAM,kBACN88C,SAIF,SAAiCN,EAASC,EAAIiD,GAC5C,OAGS37C,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,mBACdF,EAAQE,MAAM,gBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,gBACNuD,CACR,EAGQA,SAAAA,EAAKrM,GACZ,OAAI8H,GAAiB9H,IACnB0I,EAAQE,MAAM,wBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,wBACbJ,EAAQI,KAAK,mBACNH,GAGFiD,EAAI5L,EACZ,CACF,GClCD,MAAM8N,GAAUrE,SAASngD,cAAc,KAMhC,SAASykD,GAA8BnoD,GAC5C,MAAMooD,EAAqB,IAAMpoD,EAAQ,IACzCkoD,GAAQG,UAAYD,EACpB,MAAME,EAAOJ,GAAQK,YAUjBD,OAAqC,KAArCA,EAAKzmB,WAAWymB,EAAK5qD,OAAS,IAAiC,SAAVsC,KAQlDsoD,IAASF,GAA6BE,EAC9C,CCjBM,MAAMF,GAAqB,CAChC9hD,KAAM,qBACN88C,SAIF,SAAoCN,EAASC,EAAIiD,GACzCzqC,MAAAA,EAAO1Z,KACT4M,IAGAnE,EAGAsW,EANAnS,EAAO,EAOX,OAGSpE,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,sBACdF,EAAQE,MAAM,4BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,4BACNuD,CACR,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,GACF0I,EAAQE,MAAM,mCACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,mCACNsF,IAGT1F,EAAQE,MAAM,2BACd14C,EAAM,GACNsW,EAAOqhC,GACAjiD,EAAMo6C,GACd,CAGQoO,SAAAA,EAAQpO,GACf,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQE,MAAM,uCACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,uCACbJ,EAAQE,MAAM,2BACd14C,EAAM,EACNsW,EAAOohC,GACAhiD,IAGT8iD,EAAQE,MAAM,2BACd14C,EAAM,EACNsW,EAAOmhC,GACA/hD,EAAMo6C,GACd,CAGQp6C,SAAAA,EAAMo6C,GAEb,IAAIuJ,EAEJ,OAAa,KAATvJ,GAAe3rC,GACjBk1C,EAAQb,EAAQI,KAAK,2BAGnBtiC,IAASqhC,IACRkG,GAA8B5sC,EAAKyrC,eAAerD,KAKrDb,EAAQE,MAAM,4BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,4BACbJ,EAAQI,KAAK,sBACNH,GAPEiD,EAAI5L,IAUXx5B,EAAKw5B,IAAS3rC,IAASnE,GACzBw4C,EAAQG,QAAQ7I,GACTp6C,GAGFgmD,EAAI5L,EACZ,CACF,GC1FM,MAAMqO,GAAa,CACxBniD,KAAM,aACN88C,SAKF,SAA4BN,EAASC,EAAIiD,GACjCzqC,MAAAA,EAAO1Z,KAGP6mD,EAAwB,CAC5BtF,SAuKF,SAA8BN,EAASC,EAAIiD,GACrCv3C,IAAAA,EAAO,EACJo0C,OAAAA,GACLC,EACA6F,EACA,aACA9mD,KAAKyhD,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBACzCpU,EACA,GAIGkpD,SAAAA,EAAqBvO,GAGrB0M,OAFPhE,EAAQE,MAAM,mBACdF,EAAQE,MAAM,2BACP8D,EAAgB1M,EACxB,CAGQ0M,SAAAA,EAAgB1M,GACnBA,OAAAA,IAASmM,GACXzD,EAAQG,QAAQ7I,GAChB3rC,IACOq4C,GAGLr4C,EAAOm6C,EAAiB5C,EAAI5L,IAChC0I,EAAQI,KAAK,2BACNL,GAAaC,EAAS+F,EAAoB,aAA1ChG,CAAwDzI,GAChE,CAGQyO,SAAAA,EAAmBzO,GACtBA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,mBACNH,EAAG3I,IAGL4L,EAAI5L,EACZ,CACF,EA9MC7T,SAAS,GAILuiB,EAAc,CAClB1F,SA8IF,SAA6BN,EAASC,EAAIiD,GAClCzqC,MAAAA,EAAO1Z,KACb,OAAOwI,EAGEA,SAAAA,EAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNQ,CACR,CAGQA,SAAAA,EAAUtJ,GACV7+B,OAAAA,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,MAAQwN,EAAI5L,GAAQ2I,EAAG3I,EAC3D,CACF,EA7JC7T,SAAS,GAEL8H,EAAOxsC,KAAK6iD,OAAO7iD,KAAK6iD,OAAOhnD,OAAS,GACxCqrD,EACJ1a,GAAyB,eAAjBA,EAAK,GAAGhoC,KACZgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,OACtC,EACFkrD,IAGArC,EAHAqC,EAAW,EAIf,OAGSv+C,SAAM+vC,GAKN4O,OAJPlG,EAAQE,MAAM,cACdF,EAAQE,MAAM,mBACdF,EAAQE,MAAM,2BACduD,EAASnM,EACF4O,EAAa5O,EACrB,EAGQ4O,SAAAA,EAAa5O,GAChBA,OAAAA,IAASmM,GACXzD,EAAQG,QAAQ7I,GAChBwO,IACOI,IAGTlG,EAAQI,KAAK,2BACN0F,EAAW,EACd5C,EAAI5L,GACJyI,GAAaC,EAASmG,EAAU,aAAhCpG,CAA8CzI,GACnD,CAGQ6O,SAAAA,EAAS7O,GACZA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAC/B8O,EAAU9O,IAGnB0I,EAAQE,MAAM,uBACdF,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAERpH,EAAKpC,GACb,CAGQoC,SAAAA,EAAKpC,GACRA,OAAS,OAATA,GAAiBiI,GAA0BjI,IAC7C0I,EAAQI,KAAK,eACbJ,EAAQI,KAAK,uBACNL,GAAaC,EAASqG,EAAW,aAAjCtG,CAA+CzI,IAG3C,KAATA,GAAeA,IAASmM,EAAeP,EAAI5L,IAC/C0I,EAAQG,QAAQ7I,GACToC,EACR,CAGQ2M,SAAAA,EAAU/O,GACbA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAC/B8O,EAAU9O,IAGnB0I,EAAQE,MAAM,uBACdF,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAERwF,EAAKhP,GACb,CAGQgP,SAAAA,EAAKhP,GACRA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,eACbJ,EAAQI,KAAK,uBACNgG,EAAU9O,IAGN,KAATA,GAAeA,IAASmM,EAAeP,EAAI5L,IAC/C0I,EAAQG,QAAQ7I,GACTgP,EACR,CAGQF,SAAAA,EAAU9O,GAEjB,OADA0I,EAAQI,KAAK,mBACN3nC,EAAK0pC,UAAYlC,EAAG3I,GAAQiJ,EAAajJ,EACjD,CAGQiJ,SAAAA,EAAajJ,GAChBA,OAAS,OAATA,EACK/O,EAAM+O,GAGXkI,GAAmBlI,GACd0I,EAAQlZ,QACbkf,EACAhG,EAAQlZ,QACN8e,EACArd,EACA0d,EACIlG,GACEC,EACAO,EACA,aACA0F,EAAgB,GAElB1F,GAENhY,EAdKyX,CAeL1I,IAGJ0I,EAAQE,MAAM,iBACPqG,EAAgBjP,GACxB,CAGQiP,SAAAA,EAAgBjP,GACnBA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,iBACNG,EAAajJ,KAGtB0I,EAAQG,QAAQ7I,GACTiP,EACR,CAGQhe,SAAAA,EAAM+O,GAEN2I,OADPD,EAAQI,KAAK,cACNH,EAAG3I,EACX,CA+DF,EAzNC2K,UAAU,GCLL,MAAMuE,GAAe,CAC1BhjD,KAAM,eACN88C,SAUF,SAA8BN,EAASC,EAAIiD,GACnCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GAEb,OADA0I,EAAQE,MAAM,gBACPH,GAAaC,EAASyG,EAAkB,aAAc,EAAtD1G,CAA6DzI,EACrE,EAGQmP,SAAAA,EAAiBnP,GACxB,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAC9C,OAAO2wC,GACY,eAAjBA,EAAK,GAAGhoC,MACRgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,QAAU,EAC9C8rD,EAAYpP,GACZ4L,EAAI5L,EACT,CAGQoP,SAAAA,EAAYpP,GACfA,OAAS,OAATA,EACK/O,EAAM+O,GAGXkI,GAAmBlI,GACd0I,EAAQlZ,QAAQ6f,GAAiBD,EAAane,EAA9CyX,CAAqD1I,IAG9D0I,EAAQE,MAAM,iBACPG,EAAQ/I,GAChB,CAGQ+I,SAAAA,EAAQ/I,GACXA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,iBACNsG,EAAYpP,KAGrB0I,EAAQG,QAAQ7I,GACT+I,EACR,CAGQ9X,SAAAA,EAAM+O,GAEN2I,OADPD,EAAQI,KAAK,gBACNH,EAAG3I,EACX,CACF,GAxDKqP,GAAkB,CACtBrG,SA0DF,SAAiCN,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KACb,OAAOwI,EAGEA,SAAAA,EAAM+vC,GAEb,OAAI7+B,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,MACvBwN,EAAI5L,GAGTkI,GAAmBlI,IACrB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACN74C,GAGFw4C,GAAaC,EAAS0G,EAAa,aAAc,EAAjD3G,CAAwDzI,EAChE,CAGQoP,SAAAA,EAAYpP,GACnB,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GACvC2wC,OAAAA,GACY,eAAjBA,EAAK,GAAGhoC,MACRgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,QAAU,EAC9CqlD,EAAG3I,GACHkI,GAAmBlI,GACnB/vC,EAAM+vC,GACN4L,EAAI5L,EACT,CACF,EAzFC7T,SAAS,GCRJ,MAAMmjB,GAAW,CACtBpjD,KAAM,WACN88C,SA0EF,SAA0BN,EAASC,EAAIiD,GAEjC4C,IAGAn6C,EAGAk1C,EANAiF,EAAW,EAOf,OAGSv+C,SAAM+vC,GAGNyM,OAFP/D,EAAQE,MAAM,YACdF,EAAQE,MAAM,oBACP6D,EAAgBzM,EACxB,EAGQyM,SAAAA,EAAgBzM,GACnBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChBwO,IACO/B,IAGT/D,EAAQI,KAAK,oBACN5vC,EAAI8mC,GACZ,CAGQ9mC,SAAAA,EAAI8mC,GAEPA,OAAS,OAATA,EACK4L,EAAI5L,GAIA,KAATA,GACFuJ,EAAQb,EAAQE,MAAM,oBACtBv0C,EAAO,EACAq4C,EAAgB1M,IAGZ,KAATA,GACF0I,EAAQE,MAAM,SACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,SACN5vC,GAGLgvC,GAAmBlI,IACrB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACN5vC,IAGTwvC,EAAQE,MAAM,gBACPv6B,EAAK2xB,GA3D4B,CAgEjC3xB,SAAAA,EAAK2xB,GACZ,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAkI,GAAmBlI,IAEnB0I,EAAQI,KAAK,gBACN5vC,EAAI8mC,KAGb0I,EAAQG,QAAQ7I,GACT3xB,EA5EiC,CAiFjCq+B,SAAAA,EAAgB1M,GAEnBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChB3rC,IACOq4C,GAGLr4C,IAASm6C,GACX9F,EAAQI,KAAK,oBACbJ,EAAQI,KAAK,YACNH,EAAG3I,KAGZuJ,EAAMt9C,KAAO,eACNoiB,EAAK2xB,GACb,CACF,EA3KCxZ,QAKF,SAAyB8jB,GACvB,IAIIzyC,EAGA+wC,EAPA2G,EAAgBjF,EAAOhnD,OAAS,EAChCksD,EAAiB,EASnB,KAAoC,eAAnClF,EAAOkF,GAAgB,GAAGvjD,MACU,UAAnCq+C,EAAOkF,GAAgB,GAAGvjD,MACO,eAAlCq+C,EAAOiF,GAAe,GAAGtjD,MACU,UAAlCq+C,EAAOiF,GAAe,GAAGtjD,MAI3B,IAFA4L,EAAQ23C,IAEC33C,EAAQ03C,GACXjF,GAA0B,iBAA1BA,EAAOzyC,GAAO,GAAG5L,KAAyB,CAE5Cq+C,EAAOkF,GAAgB,GAAGvjD,KAAO,kBACjCq+C,EAAOiF,GAAe,GAAGtjD,KAAO,kBAChCujD,GAAkB,EAClBD,GAAiB,EACjB,KACD,CAIL13C,EAAQ23C,EAAiB,EACzBD,IAEA,OAAS13C,GAAS03C,QACFlqD,IAAVujD,EACE/wC,IAAU03C,GAA2C,eAA1BjF,EAAOzyC,GAAO,GAAG5L,OAC9C28C,EAAQ/wC,GAGVA,IAAU03C,GACgB,eAA1BjF,EAAOzyC,GAAO,GAAG5L,OAEjBq+C,EAAO1B,GAAO,GAAG38C,KAAO,eAEpB4L,IAAU+wC,EAAQ,IACpB0B,EAAO1B,GAAO,GAAGz4C,IAAMm6C,EAAOzyC,EAAQ,GAAG,GAAG1H,IAC5Cm6C,EAAOtxC,OAAO4vC,EAAQ,EAAG/wC,EAAQ+wC,EAAQ,GACzC2G,GAAiB13C,EAAQ+wC,EAAQ,EACjC/wC,EAAQ+wC,EAAQ,GAGlBA,OAAQvjD,GAIZ,OAAOilD,CACR,EA5DCxuB,SA+DF,SAAkBkkB,GAEhB,OACW,KAATA,GACgD,oBAAhDv4C,KAAK6iD,OAAO7iD,KAAK6iD,OAAOhnD,OAAS,GAAG,GAAG2I,IAE1C,GCvEM,SAASwjD,GAAYnF,GAEpBoF,MAAAA,EAAQ,CAAA,EACV73C,IAGA83C,EAGAC,EAGAC,EAGAC,EAGAnM,EAGAoM,EAGAC,EArBAn4C,GAAS,EAuBb,OAASA,EAAQyyC,EAAOhnD,QAAQ,CACvBuU,KAAAA,KAAS63C,GACd73C,EAAQ63C,EAAM73C,GAOdA,GAJF83C,EAAQrF,EAAOzyC,GAIbA,GACkB,cAAlB83C,EAAM,GAAG1jD,MACqB,mBAA9Bq+C,EAAOzyC,EAAQ,GAAG,GAAG5L,OAErB8jD,EAAYJ,EAAM,GAAGvE,WAAWd,OAChCuF,EAAa,EAGXA,EAAaE,EAAUzsD,QACW,oBAAlCysD,EAAUF,GAAY,GAAG5jD,OAEzB4jD,GAAc,GAIdA,EAAaE,EAAUzsD,QACW,YAAlCysD,EAAUF,GAAY,GAAG5jD,MAEzB,OAAS4jD,EAAaE,EAAUzsD,QACQ,YAAlCysD,EAAUF,GAAY,GAAG5jD,MAIS,cAAlC8jD,EAAUF,GAAY,GAAG5jD,OAC3B8jD,EAAUF,GAAY,GAAGI,6BAA8B,EACvDJ,KAMR,GAAiB,UAAbF,EAAM,GACJA,EAAM,GAAGnG,cACXzlD,OAAOqpC,OAAOsiB,EAAOQ,GAAW5F,EAAQzyC,IACxCA,EAAQ63C,EAAM73C,GACdm4C,GAAO,QAGN,GAAIL,EAAM,GAAG/B,WAAY,CAIrBiC,IAHPA,EAAah4C,EACb+3C,OAAYvqD,EAELwqD,MACLC,EAAaxF,EAAOuF,GAGK,eAAvBC,EAAW,GAAG7jD,MACS,oBAAvB6jD,EAAW,GAAG7jD,OAEQ,UAAlB6jD,EAAW,KACTF,IACFtF,EAAOsF,GAAW,GAAG3jD,KAAO,mBAG9B6jD,EAAW,GAAG7jD,KAAO,aACrB2jD,EAAYC,GAOdD,IAEFD,EAAM,GAAGx/C,IAAMpM,OAAOqpC,OAAO,GAAIkd,EAAOsF,GAAW,GAAG3/C,OAEtD0zC,EAAa2G,EAAO/kC,MAAMqqC,EAAW/3C,GACrC8rC,EAAWxuC,QAAQw6C,GACnB32C,GAAOsxC,EAAQsF,EAAW/3C,EAAQ+3C,EAAY,EAAGjM,GAEpD,CACF,CAED,OAAQqM,CACT,CASD,SAASE,GAAW5F,EAAQ6F,GACpB5G,MAAAA,EAAQe,EAAO6F,GAAY,GAC3BvoC,EAAU0iC,EAAO6F,GAAY,GACnC,IAAIC,EAAgBD,EAAa,EAG3BE,MAAAA,EAAiB,GACjBC,EACJ/G,EAAM6B,YAAcxjC,EAAQshC,OAAOK,EAAMC,aAAaD,EAAMt5C,OACxDsgD,EAAcD,EAAUhG,OAGxBoF,EAAQ,GAGRc,EAAO,CAAA,EAGb,IAAIhF,EAGA1vB,EACAjkB,GAAS,EAGT7R,EAAUujD,EACVkH,EAAS,EACTxgD,EAAQ,EACZ,MAAMygD,EAAS,CAACzgD,GAGhB,KAAOjK,GAAS,CAEPskD,KAAAA,IAAS8F,GAAe,KAAOpqD,IAItCqqD,EAAellD,KAAKilD,GAEfpqD,EAAQolD,aACXI,EAAS5jC,EAAQ6jC,YAAYzlD,GAExBA,EAAQ8mC,MACX0e,EAAOrgD,KAAK,MAGV2wB,GACFw0B,EAAU5E,WAAW1lD,EAAQiK,OAG3BjK,EAAQiqD,8BACVK,EAAUK,oCAAqC,GAGjDL,EAAU3E,MAAMH,GAEZxlD,EAAQiqD,8BACVK,EAAUK,wCAAqCtrD,IAInDy2B,EAAW91B,EACXA,EAAUA,EAAQ8mC,IA9DkB,CAoEtC,IAFA9mC,EAAUujD,IAED1xC,EAAQ04C,EAAYjtD,QAGC,SAA1BitD,EAAY14C,GAAO,IACW,UAA9B04C,EAAY14C,EAAQ,GAAG,IACvB04C,EAAY14C,GAAO,GAAG5L,OAASskD,EAAY14C,EAAQ,GAAG,GAAG5L,MACzDskD,EAAY14C,GAAO,GAAG5H,MAAMmuC,OAASmS,EAAY14C,GAAO,GAAG1H,IAAIiuC,OAE/DnuC,EAAQ4H,EAAQ,EAChB64C,EAAOvlD,KAAK8E,GAEZjK,EAAQolD,gBAAa/lD,EACrBW,EAAQ81B,cAAWz2B,EACnBW,EAAUA,EAAQ8mC,MAmBfj1B,IAfPy4C,EAAUhG,OAAS,GAIftkD,GAEFA,EAAQolD,gBAAa/lD,EACrBW,EAAQ81B,cAAWz2B,GAEnBqrD,EAAO/8B,MAIT9b,EAAQ64C,EAAOptD,OAERuU,KAAS,CACd,MAAM0N,EAAQgrC,EAAYhrC,MAAMmrC,EAAO74C,GAAQ64C,EAAO74C,EAAQ,IACxD5H,EAAQogD,EAAe18B,MAC7B+7B,EAAMv6C,QAAQ,CAAClF,EAAOA,EAAQsV,EAAMjiB,OAAS,IAC7C0V,GAAOsxC,EAAQr6C,EAAO,EAAGsV,EAC1B,CAID,IAFA1N,GAAS,IAEAA,EAAQ63C,EAAMpsD,QACrBktD,EAAKC,EAASf,EAAM73C,GAAO,IAAM44C,EAASf,EAAM73C,GAAO,GACvD44C,GAAUf,EAAM73C,GAAO,GAAK63C,EAAM73C,GAAO,GAAK,EAGhD,OAAO24C,CACR,CCvOM,MAAMzH,GAAU,CACrBC,SAsBF,SAAyBN,EAASC,GAEhC,IAAI7sB,EACJ,OAGS7rB,SAAM+vC,GAKN3xB,OAJPq6B,EAAQE,MAAM,WACd9sB,EAAW4sB,EAAQE,MAAM,eAAgB,CACvCY,YAAa,YAERn7B,EAAK2xB,EACb,EAGQ3xB,SAAAA,EAAK2xB,GACRA,OAAS,OAATA,EACK4Q,EAAW5Q,GAGhBkI,GAAmBlI,GACd0I,EAAQH,MACbsI,GACA5B,EACA2B,EAHKlI,CAIL1I,IAGJ0I,EAAQG,QAAQ7I,GACT3xB,EACR,CAGQuiC,SAAAA,EAAW5Q,GAGX2I,OAFPD,EAAQI,KAAK,gBACbJ,EAAQI,KAAK,WACNH,EAAG3I,EACX,CAGQiP,SAAAA,EAAgBjP,GAQvB,OAPA0I,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,gBACbhtB,EAASgR,KAAO4b,EAAQE,MAAM,eAAgB,CAC5CY,YAAa,UACb1tB,aAEFA,EAAWA,EAASgR,KACbze,CACR,CACF,EAvECmY,QAeF,SAAwB8jB,GAEtB,OADAmF,GAAYnF,GACLA,CACR,GAdKuG,GAAwB,CAC5B7H,SAqEF,SAA8BN,EAASC,EAAIiD,GACnCzqC,MAAAA,EAAO1Z,KACb,OAGSqpD,SAAe9Q,GAKtB,OAJA0I,EAAQI,KAAK,gBACbJ,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GAAaC,EAASqI,EAAU,aACxC,EAGQA,SAAAA,EAAS/Q,GACZA,GAAS,OAATA,GAAiBkI,GAAmBlI,GAC/B4L,OAAAA,EAAI5L,GAGb,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAG5C,OAAC6d,EAAK+nC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,iBAC9Cw6B,GACiB,eAAjBA,EAAK,GAAGhoC,MACRgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,QAAU,EAEzCqlD,EAAG3I,GAGL0I,EAAQmC,UAAU1pC,EAAK+nC,OAAO3B,WAAW5X,KAAMic,EAAKjD,EAApDD,CAAwD1I,EAChE,CACF,EApGC7T,SAAS,GCAJ,SAAS6kB,GACdtI,EACAC,EACAiD,EACA3/C,EACAglD,EACAC,EACAC,EACAC,EACAlhD,GAEA,MAAM6jC,EAAQ7jC,GAAOgB,OAAO6zC,kBACxBsM,IAAAA,EAAU,EACd,OAGSphD,SAAM+vC,GACTA,GAAS,KAATA,EAMF,OALA0I,EAAQE,MAAM38C,GACdy8C,EAAQE,MAAMqI,GACdvI,EAAQE,MAAMsI,GACdxI,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAKoI,GACNI,EAGT,GAAa,OAATtR,GAA0B,KAATA,GAAegI,GAAahI,GACxC4L,OAAAA,EAAI5L,GASNuR,OANP7I,EAAQE,MAAM38C,GACdy8C,EAAQE,MAAMuI,GACdzI,EAAQE,MAAMwI,GACd1I,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAER+H,EAAevR,EACvB,EAGQsR,SAAAA,EAA0BtR,GAC7BA,OAAS,KAATA,GACF0I,EAAQE,MAAMsI,GACdxI,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAKoI,GACbxI,EAAQI,KAAKmI,GACbvI,EAAQI,KAAK78C,GACN08C,IAGTD,EAAQE,MAAMwI,GACd1I,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAERgI,EAAoBxR,GAC5B,CAGQwR,SAAAA,EAAoBxR,GACvBA,OAAS,KAATA,GACF0I,EAAQI,KAAK,eACbJ,EAAQI,KAAKsI,GACNE,EAA0BtR,IAGtB,OAATA,GAA0B,KAATA,GAAekI,GAAmBlI,GAC9C4L,EAAI5L,IAGb0I,EAAQG,QAAQ7I,GACA,KAATA,EAAcyR,EAA4BD,EAClD,CAGQC,SAAAA,EAA0BzR,GAC7BA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChC0I,EAAQG,QAAQ7I,GACTwR,GAGFA,EAAoBxR,EAC5B,CAGQuR,SAAAA,EAAevR,GAClBA,OAAS,KAATA,IACIqR,EAAUtd,EAAc6X,EAAI5L,IAClC0I,EAAQG,QAAQ7I,GACTuR,GAGI,KAATvR,EACGqR,KAQL3I,EAAQG,QAAQ7I,GACTuR,IARL7I,EAAQI,KAAK,eACbJ,EAAQI,KAAKsI,GACb1I,EAAQI,KAAKqI,GACbzI,EAAQI,KAAK78C,GACN08C,EAAG3I,IAOD,OAATA,GAAiBiI,GAA0BjI,GACzCqR,EAAgBzF,EAAI5L,IACxB0I,EAAQI,KAAK,eACbJ,EAAQI,KAAKsI,GACb1I,EAAQI,KAAKqI,GACbzI,EAAQI,KAAK78C,GACN08C,EAAG3I,IAGRgI,GAAahI,GAAc4L,EAAI5L,IACnC0I,EAAQG,QAAQ7I,GACA,KAATA,EAAc0R,EAAuBH,EAC7C,CAGQG,SAAAA,EAAqB1R,GACxBA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChC0I,EAAQG,QAAQ7I,GACTuR,GAGFA,EAAevR,EACvB,CACF,CCpIM,SAAS2R,GAAajJ,EAASC,EAAIiD,EAAK3/C,EAAM2lD,EAAYR,GACzDjwC,MAAAA,EAAO1Z,KACT4M,IAGAga,EAHAha,EAAO,EAIX,OAGSpE,SAAM+vC,GAMb,OALA0I,EAAQE,MAAM38C,GACdy8C,EAAQE,MAAMgJ,GACdlJ,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK8I,GACblJ,EAAQE,MAAMwI,GACPS,CACR,EAGQA,SAAAA,EAAQ7R,GACf,OACW,OAATA,GACS,KAATA,GACU,KAATA,IAAgB3xB,GAQP,KAAT2xB,IACE3rC,GACD,2BAA4B8M,EAAK+nC,OAAO3B,YAC1ClzC,EAAO,IAEAu3C,EAAI5L,GAGA,KAATA,GACF0I,EAAQI,KAAKsI,GACb1I,EAAQE,MAAMgJ,GACdlJ,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK8I,GACblJ,EAAQI,KAAK78C,GACN08C,GAGLT,GAAmBlI,IACrB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACN+I,IAGTnJ,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAERhhD,EAAMw3C,GACd,CAGQx3C,SAAAA,EAAMw3C,GAEXA,OAAS,OAATA,GACS,KAATA,GACS,KAATA,GACAkI,GAAmBlI,IACnB3rC,IAAS,KAETq0C,EAAQI,KAAK,eACN+I,EAAQ7R,KAGjB0I,EAAQG,QAAQ7I,GAChB3xB,EAAOA,IAAS85B,GAAcnI,GACd,KAATA,EAAc8R,EAActpD,EACpC,CAGQspD,SAAAA,EAAY9R,GACfA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChC0I,EAAQG,QAAQ7I,GAChB3rC,IACO7L,GAGFA,EAAMw3C,EACd,CACF,CCzFM,SAAS+R,GAAarJ,EAASC,EAAIiD,EAAK3/C,EAAM2lD,EAAYR,GAE/D,IAAIjF,EACJ,OAGSl8C,SAAM+vC,GAMb,OALA0I,EAAQE,MAAM38C,GACdy8C,EAAQE,MAAMgJ,GACdlJ,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK8I,GACbzF,EAAkB,KAATnM,EAAc,GAAKA,EACrBgS,CACR,EAGQA,SAAAA,EAAkBhS,GACrBA,OAAAA,IAASmM,GACXzD,EAAQE,MAAMgJ,GACdlJ,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK8I,GACblJ,EAAQI,KAAK78C,GACN08C,IAGTD,EAAQE,MAAMwI,GACPa,EAAajS,GACrB,CAGQiS,SAAAA,EAAajS,GAChBA,OAAAA,IAASmM,GACXzD,EAAQI,KAAKsI,GACNY,EAAkB7F,IAGd,OAATnM,EACK4L,EAAI5L,GAGTkI,GAAmBlI,IACrB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GAAaC,EAASuJ,EAAc,gBAG7CvJ,EAAQE,MAAM,cAAe,CAC3BY,YAAa,WAER0I,EAAMlS,GACd,CAGQkS,SAAAA,EAAMlS,GACb,OAAIA,IAASmM,GAAmB,OAATnM,GAAiBkI,GAAmBlI,IACzD0I,EAAQI,KAAK,eACNmJ,EAAajS,KAGtB0I,EAAQG,QAAQ7I,GACA,KAATA,EAAcmS,EAAcD,EACpC,CAGQC,SAAAA,EAAYnS,GACnB,OAAIA,IAASmM,GAAmB,KAATnM,GACrB0I,EAAQG,QAAQ7I,GACTkS,GAGFA,EAAMlS,EACd,CACF,CChFM,SAASoS,GAAkB1J,EAASC,GAEzC,IAAInyB,EACJ,OAGSvmB,SAAAA,EAAM+vC,GACb,GAAIkI,GAAmBlI,GAKrB,OAJA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACbtyB,GAAO,EACAvmB,EAGT,GAAIk4C,GAAcnI,GAChB,OAAOyI,GACLC,EACAz4C,EACAumB,EAAO,aAAe,aAHjBiyB,CAILzI,GAGG2I,OAAAA,EAAG3I,EACX,CACF,CC9BM,SAASqS,GAAoBzsD,GAClC,OACEA,EACG6f,QAAQ,cAAe,KACvBA,QAAQ,SAAU,IAMlBipB,cACAS,aAEN,CCFM,MAAMmjB,GAAa,CACxBpmD,KAAM,aACN88C,SAUF,SAA4BN,EAASC,EAAIiD,GACjCzqC,MAAAA,EAAO1Z,KAGb,IAAI8qD,EACJ,OAGStiD,SAAM+vC,GAEb,OADA0I,EAAQE,MAAM,cACP+I,GAAaxtD,KAClBgd,EACAunC,EACA8J,EACA5G,EACA,kBACA,wBACA,wBAPK+F,CAQL3R,EACH,EAGQwS,SAAAA,EAAWxS,GAKdA,OAJJuS,EAAaF,GACXlxC,EAAKyrC,eAAezrC,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAAG,IAAIiiB,MAAM,GAAI,IAG3D,KAATy6B,GACF0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBAENsJ,GACL1J,EACAsI,GACEtI,EACAA,EAAQlZ,QACNijB,GACAhK,GAAaC,EAASzX,EAAO,cAC7BwX,GAAaC,EAASzX,EAAO,eAE/B2a,EACA,wBACA,+BACA,qCACA,2BACA,iCAKCA,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GACTA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,cAER3nC,EAAK+nC,OAAOwJ,QAAQj5C,SAAS84C,IAChCpxC,EAAK+nC,OAAOwJ,QAAQvnD,KAAKonD,GAGpB5J,EAAG3I,IAGL4L,EAAI5L,EACZ,CACF,GA1EKyS,GAAiB,CACrBzJ,SA4EF,SAAuBN,EAASC,EAAIiD,GAClC,OAGS37C,SAAM+vC,GACb,OAAOiI,GAA0BjI,GAC7BoS,GAAkB1J,EAASze,EAA3BmoB,CAAmCpS,GACnC4L,EAAI5L,EACT,EAGQ/V,SAAAA,EAAO+V,GACVA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,EACzB+R,GACLrJ,EACAD,GAAaC,EAASzX,EAAO,cAC7B2a,EACA,kBACA,wBACA,wBANKmG,CAOL/R,GAGG4L,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GACb,OAAgB,OAATA,GAAiBkI,GAAmBlI,GAAQ2I,EAAG3I,GAAQ4L,EAAI5L,EACnE,CACF,EAzGC7T,SAAS,GCjBJ,MAAMwmB,GAAkB,CAC7BzmD,KAAM,kBACN88C,SAIF,SAAiCN,EAASC,EAAIiD,GAC5C,OAGS37C,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,mBACdF,EAAQE,MAAM,gBACdF,EAAQG,QAAQ7I,GACTqM,CACR,EAGQA,SAAAA,EAAKrM,GACZ,OAAIkI,GAAmBlI,IACrB0I,EAAQI,KAAK,gBACbJ,EAAQI,KAAK,mBACNH,EAAG3I,IAGL4L,EAAI5L,EACZ,CACF,GCnBM,MAAM4S,GAAa,CACxB1mD,KAAM,aACN88C,SA4DF,SAA4BN,EAASC,EAAIiD,GACjCzqC,MAAAA,EAAO1Z,KACT4M,IAAAA,EAAO,EACX,OAGSpE,SAAM+vC,GAGN6S,OAFPnK,EAAQE,MAAM,cACdF,EAAQE,MAAM,sBACPiK,EAAgB7S,EACxB,EAGQ6S,SAAAA,EAAgB7S,GACvB,OAAa,KAATA,GAAe3rC,IAAS,GAC1Bq0C,EAAQG,QAAQ7I,GACT6S,GAGI,OAAT7S,GAAiBiI,GAA0BjI,IAC7C0I,EAAQI,KAAK,sBACN3nC,EAAK0pC,UAAYlC,EAAG3I,GAAQ8S,EAAa9S,IAG3C4L,EAAI5L,EACZ,CAGQ8S,SAAAA,EAAa9S,GAChBA,OAAS,KAATA,GACF0I,EAAQE,MAAM,sBACPwD,EAASpM,IAGL,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,cACNH,EAAG3I,IAGRmI,GAAcnI,GACTyI,GAAaC,EAASoK,EAAc,aAApCrK,CAAkDzI,IAG3D0I,EAAQE,MAAM,kBACPv6B,EAAK2xB,GACb,CAGQoM,SAAAA,EAASpM,GACZA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACToM,IAGT1D,EAAQI,KAAK,sBACNgK,EAAa9S,GACrB,CAGQ3xB,SAAAA,EAAK2xB,GACZ,OAAa,OAATA,GAA0B,KAATA,GAAeiI,GAA0BjI,IAC5D0I,EAAQI,KAAK,kBACNgK,EAAa9S,KAGtB0I,EAAQG,QAAQ7I,GACT3xB,EACR,CACF,EA/HCmY,QAIF,SAA2B8jB,EAAQ1iC,GACjC,IAIImhC,EAGA5wC,EAPAy4C,EAAatG,EAAOhnD,OAAS,EAC7B2lD,EAAe,EAQkB,eAAjCqB,EAAOrB,GAAc,GAAGh9C,OAC1Bg9C,GAAgB,GAIhB2H,EAAa,EAAI3H,GACc,eAA/BqB,EAAOsG,GAAY,GAAG3kD,OAEtB2kD,GAAc,GAIiB,uBAA/BtG,EAAOsG,GAAY,GAAG3kD,OACrBg9C,IAAiB2H,EAAa,GAC5BA,EAAa,EAAI3H,GACmB,eAAnCqB,EAAOsG,EAAa,GAAG,GAAG3kD,QAE9B2kD,GAAc3H,EAAe,IAAM2H,EAAa,EAAI,GAGlDA,EAAa3H,IACfF,EAAU,CACR98C,KAAM,iBACNgE,MAAOq6C,EAAOrB,GAAc,GAAGh5C,MAC/BE,IAAKm6C,EAAOsG,GAAY,GAAGzgD,KAE7BgI,EAAO,CACLlM,KAAM,YACNgE,MAAOq6C,EAAOrB,GAAc,GAAGh5C,MAC/BE,IAAKm6C,EAAOsG,GAAY,GAAGzgD,IAE3Bq5C,YAAa,QAEfxwC,GAAOsxC,EAAQrB,EAAc2H,EAAa3H,EAAe,EAAG,CAC1D,CAAC,QAASF,EAASnhC,GACnB,CAAC,QAASzP,EAAMyP,GAChB,CAAC,OAAQzP,EAAMyP,GACf,CAAC,OAAQmhC,EAASnhC,MAItB,OAAO0iC,CACR,GCjEM,MAAMyI,GAAiB,CAC5B,UACA,UACA,QACA,OACA,WACA,aACA,OACA,UACA,SACA,MACA,WACA,KACA,UACA,SACA,MACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,QACA,WACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,KACA,OACA,SACA,SACA,KACA,OACA,OACA,OACA,WACA,MACA,WACA,KACA,WACA,SACA,IACA,QACA,UACA,SACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,MAeWC,GAAe,CAAC,MAAO,SAAU,QAAS,YCrE1CC,GAAW,CACtB/mD,KAAM,WACN88C,SAkCF,SAA0BN,EAASC,EAAIiD,GAC/BzqC,MAAAA,EAAO1Z,KAGb,IAAIyrD,EAGAC,EAGAphC,EAGAla,EAGAs0C,EACJ,OAGSl8C,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,YACdF,EAAQE,MAAM,gBACdF,EAAQG,QAAQ7I,GACTqM,CACR,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACToT,GAGI,KAATpT,GACF0I,EAAQG,QAAQ7I,GACTqT,GAGI,KAATrT,GACF0I,EAAQG,QAAQ7I,GAChBkT,EAAO,EAGA/xC,EAAK0pC,UAAYlC,EAAK2K,GAG3B7L,GAAWzH,IACb0I,EAAQG,QAAQ7I,GAChBjuB,EAAS7J,OAAOsgC,aAAaxI,GAC7BmT,GAAW,EACJI,GAGF3H,EAAI5L,EACZ,CAGQoT,SAAAA,EAAiBpT,GACpBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChBkT,EAAO,EACAM,GAGI,KAATxT,GACF0I,EAAQG,QAAQ7I,GAChBkT,EAAO,EACPnhC,EAAS,SACTla,EAAQ,EACD47C,GAGLhM,GAAWzH,IACb0I,EAAQG,QAAQ7I,GAChBkT,EAAO,EACA/xC,EAAK0pC,UAAYlC,EAAK2K,GAGxB1H,EAAI5L,EACZ,CAGQwT,SAAAA,EAAkBxT,GACrBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT7+B,EAAK0pC,UAAYlC,EAAK2K,GAGxB1H,EAAI5L,EACZ,CAGQyT,SAAAA,EAAgBzT,GACnBA,OAAAA,IAASjuB,EAAO0V,WAAW5vB,MAC7B6wC,EAAQG,QAAQ7I,GACTnoC,IAAUka,EAAOzuB,OACpB6d,EAAK0pC,UACHlC,EACAqB,EACFyJ,GAGC7H,EAAI5L,EACZ,CAGQqT,SAAAA,EAAcrT,GACrB,OAAIyH,GAAWzH,IACb0I,EAAQG,QAAQ7I,GAChBjuB,EAAS7J,OAAOsgC,aAAaxI,GACtBuT,GAGF3H,EAAI5L,EACZ,CAGQuT,SAAAA,EAAQvT,GACf,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAiI,GAA0BjI,GAGf,KAATA,GACAmT,GACAH,GAAav5C,SAASsY,EAAO2c,gBAE7BwkB,EAAO,EACA/xC,EAAK0pC,UAAYlC,EAAG3I,GAAQgK,EAAahK,IAG9C+S,GAAet5C,SAASsY,EAAO2c,gBACjCwkB,EAAO,EAEM,KAATlT,GACF0I,EAAQG,QAAQ7I,GACT0T,GAGFvyC,EAAK0pC,UAAYlC,EAAG3I,GAAQgK,EAAahK,KAGlDkT,EAAO,EAEA/xC,EAAK0pC,YAAc1pC,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,MAClDwN,EAAI5L,GACJmT,EACAQ,EAA4B3T,GAC5B4T,EAAwB5T,IAGjB,KAATA,GAAe6H,GAAkB7H,IACnC0I,EAAQG,QAAQ7I,GAChBjuB,GAAU7J,OAAOsgC,aAAaxI,GACvBuT,GAGF3H,EAAI5L,EACZ,CAGQ0T,SAAAA,EAAiB1T,GACpBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT7+B,EAAK0pC,UAAYlC,EAAKqB,GAGxB4B,EAAI5L,EACZ,CAGQ4T,SAAAA,EAAwB5T,GAC/B,OAAImI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACT4T,GAGFC,EAAY7T,EACpB,CAGQ2T,SAAAA,EAA4B3T,GAC/BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT6T,GAGI,KAAT7T,GAAwB,KAATA,GAAeyH,GAAWzH,IAC3C0I,EAAQG,QAAQ7I,GACT8T,GAGL3L,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACT2T,GAGFE,EAAY7T,EACpB,CAGQ8T,SAAAA,EAAsB9T,GAE3BA,OAAS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACA6H,GAAkB7H,IAElB0I,EAAQG,QAAQ7I,GACT8T,GAGFC,EAA2B/T,EACnC,CAGQ+T,SAAAA,EAA2B/T,GAC9BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTgU,GAGL7L,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACT+T,GAGFJ,EAA4B3T,EACpC,CAGQgU,SAAAA,EAA6BhU,GACpC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO4L,EAAI5L,GAGA,KAATA,GAAwB,KAATA,GACjB0I,EAAQG,QAAQ7I,GAChBmM,EAASnM,EACFiU,GAGL9L,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACTgU,IAGT7H,EAAS,KACF+H,EAA+BlU,GACvC,CAGQiU,SAAAA,EAA6BjU,GAChCA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAC/B4L,EAAI5L,GAGTA,IAASmM,GACXzD,EAAQG,QAAQ7I,GACTmU,IAGTzL,EAAQG,QAAQ7I,GACTiU,EACR,CAGQC,SAAAA,EAA+BlU,GACtC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAiI,GAA0BjI,GAEnB+T,EAA2B/T,IAGpC0I,EAAQG,QAAQ7I,GACTkU,EACR,CAGQC,SAAAA,EAAkCnU,GACzC,OAAa,KAATA,GAAwB,KAATA,GAAemI,GAAcnI,GACvC2T,EAA4B3T,GAG9B4L,EAAI5L,EACZ,CAGQ6T,SAAAA,EAAY7T,GACfA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACToU,GAGFxI,EAAI5L,EACZ,CAGQoU,SAAAA,EAAcpU,GACrB,OAAImI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACToU,GAGO,OAATpU,GAAiBkI,GAAmBlI,GACvCgK,EAAahK,GACb4L,EAAI5L,EACT,CAGQgK,SAAAA,EAAahK,GACpB,OAAa,KAATA,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTqU,GAGI,KAATrU,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTsU,GAGI,KAATtU,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTuU,GAGI,KAATvU,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTsT,GAGI,KAATtT,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTwU,IAGLtM,GAAmBlI,IAAmB,IAATkT,GAAuB,IAATA,EAQlC,OAATlT,GAAiBkI,GAAmBlI,GAC/ByU,EAAyBzU,IAGlC0I,EAAQG,QAAQ7I,GACTgK,GAZEtB,EAAQH,MACbmM,GACAH,EACAE,EAHK/L,CAIL1I,EASL,CAGQyU,SAAAA,EAAyBzU,GAEzB2U,OADPjM,EAAQI,KAAK,gBACN6L,EAAkB3U,EAC1B,CAGQ2U,SAAAA,EAAkB3U,GACrBA,OAAS,OAATA,EACKjT,EAAKiT,GAGVkI,GAAmBlI,GACd0I,EAAQlZ,QACb,CACEwZ,SAAU4L,EACVzoB,SAAS,GAEXwoB,EACA5nB,EANK2b,CAOL1I,IAGJ0I,EAAQE,MAAM,gBACPoB,EAAahK,GACrB,CAGD,SAAS4U,EAAYlM,EAASC,EAAIiD,GAChC,OAGS37C,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNQ,CACR,EAGQA,SAAAA,EAAUtJ,GACV7+B,OAAAA,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,MAAQwN,EAAI5L,GAAQ2I,EAAG3I,EAC3D,CACF,CAGQqU,SAAAA,EAA0BrU,GAC7BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTsT,GAGFtJ,EAAahK,EACrB,CAGQsU,SAAAA,EAAuBtU,GAC1BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChBjuB,EAAS,GACF8iC,GAGF7K,EAAahK,EACrB,CAGQ6U,SAAAA,EAAsB7U,GAC7B,OAAa,KAATA,GAAegT,GAAav5C,SAASsY,EAAO2c,gBAC9Cga,EAAQG,QAAQ7I,GACTuU,GAGL9M,GAAWzH,IAASjuB,EAAOzuB,OAAS,GACtColD,EAAQG,QAAQ7I,GAChBjuB,GAAU7J,OAAOsgC,aAAaxI,GACvB6U,GAGF7K,EAAahK,EACrB,CAGQwU,SAAAA,EAAgCxU,GACnCA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTsT,GAGFtJ,EAAahK,EACrB,CAGQsT,SAAAA,EAA8BtT,GACjCA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTuU,GAGI,KAATvU,GAAwB,IAATkT,GACjBxK,EAAQG,QAAQ7I,GACTsT,GAGFtJ,EAAahK,EACrB,CAGQuU,SAAAA,EAAkBvU,GACrBA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,gBACN/b,EAAKiT,KAGd0I,EAAQG,QAAQ7I,GACTuU,EACR,CAGQxnB,SAAAA,EAAKiT,GAEL2I,OADPD,EAAQI,KAAK,YACNH,EAAG3I,EACX,CACF,EA7gBC8U,UAWF,SAA2BxK,GACzB,IAAIzyC,EAAQyyC,EAAOhnD,OAEZuU,KAAAA,MACoB,UAArByyC,EAAOzyC,GAAO,IAA4C,aAA1ByyC,EAAOzyC,GAAO,GAAG5L,QAKnD4L,EAAQ,GAAmC,eAA9ByyC,EAAOzyC,EAAQ,GAAG,GAAG5L,OAEpCq+C,EAAOzyC,GAAO,GAAG5H,MAAQq6C,EAAOzyC,EAAQ,GAAG,GAAG5H,MAE9Cq6C,EAAOzyC,EAAQ,GAAG,GAAG5H,MAAQq6C,EAAOzyC,EAAQ,GAAG,GAAG5H,MAElDq6C,EAAOtxC,OAAOnB,EAAQ,EAAG,IAG3B,OAAOyyC,CACR,EA7BCK,UAAU,GAIN+J,GAAqB,CACzB1L,SA0gBF,SAA2BN,EAASC,EAAIiD,GACtC,OAGS37C,SAAM+vC,GAKN0I,OAJPA,EAAQI,KAAK,gBACbJ,EAAQE,MAAM,mBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,mBACNJ,EAAQlZ,QAAQge,GAAW7E,EAAIiD,EACvC,CACF,EAphBCzf,SAAS,GCZJ,MAAM4oB,GAAW,CACtB7oD,KAAM,WACN88C,SAIF,SAA0BN,EAASC,EAAIiD,GAC/BzqC,MAAAA,EAAO1Z,KAGb,IAAI0kD,EAGAp6B,EAGAla,EAGAm9C,EACJ,OAGS/kD,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,YACdF,EAAQE,MAAM,gBACdF,EAAQG,QAAQ7I,GACTqM,CACR,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTiV,GAGI,KAATjV,GACF0I,EAAQG,QAAQ7I,GACTqT,GAGI,KAATrT,GACF0I,EAAQG,QAAQ7I,GACTkV,GAGLzN,GAAWzH,IACb0I,EAAQG,QAAQ7I,GACTmV,GAGFvJ,EAAI5L,EACZ,CAGQiV,SAAAA,EAAgBjV,GACnBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACToV,GAGI,KAATpV,GACF0I,EAAQG,QAAQ7I,GAChBjuB,EAAS,SACTla,EAAQ,EACDw9C,GAGL5N,GAAWzH,IACb0I,EAAQG,QAAQ7I,GACTsV,GAGF1J,EAAI5L,EACZ,CAGQoV,SAAAA,EAAYpV,GACfA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTuV,GAGF3J,EAAI5L,EACZ,CAGQuV,SAAAA,EAAavV,GACpB,OAAa,OAATA,GAA0B,KAATA,EACZ4L,EAAI5L,GAGA,KAATA,GACF0I,EAAQG,QAAQ7I,GACTwV,GAGFC,EAAQzV,EAChB,CAGQwV,SAAAA,EAAiBxV,GACxB,OAAa,OAATA,GAA0B,KAATA,EACZ4L,EAAI5L,GAGNyV,EAAQzV,EAChB,CAGQyV,SAAAA,EAAQzV,GACXA,OAAS,OAATA,EACK4L,EAAI5L,GAGA,KAATA,GACF0I,EAAQG,QAAQ7I,GACT0V,GAGLxN,GAAmBlI,IACrBgV,EAAcS,EACPE,EAAa3V,KAGtB0I,EAAQG,QAAQ7I,GACTyV,EACR,CAGQC,SAAAA,EAAa1V,GAChBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT7vC,GAGFslD,EAAQzV,EAChB,CAGQqV,SAAAA,EAAUrV,GACbA,OAAAA,IAASjuB,EAAO0V,WAAW5vB,MAC7B6wC,EAAQG,QAAQ7I,GACTnoC,IAAUka,EAAOzuB,OAASsyD,EAAQP,GAGpCzJ,EAAI5L,EACZ,CAGQ4V,SAAAA,EAAM5V,GACTA,OAAS,OAATA,EACK4L,EAAI5L,GAGA,KAATA,GACF0I,EAAQG,QAAQ7I,GACT6V,GAGL3N,GAAmBlI,IACrBgV,EAAcY,EACPD,EAAa3V,KAGtB0I,EAAQG,QAAQ7I,GACT4V,EACR,CAGQC,SAAAA,EAAW7V,GACdA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT8V,GAGFF,EAAM5V,EACd,CAGQ8V,SAAAA,EAAS9V,GACZA,OAAS,KAATA,EACK7vC,EAAI6vC,GAGA,KAATA,GACF0I,EAAQG,QAAQ7I,GACT8V,GAGFF,EAAM5V,EACd,CAGQsV,SAAAA,EAAYtV,GACnB,OAAa,OAATA,GAA0B,KAATA,EACZ7vC,EAAI6vC,GAGTkI,GAAmBlI,IACrBgV,EAAcM,EACPK,EAAa3V,KAGtB0I,EAAQG,QAAQ7I,GACTsV,EACR,CAGQJ,SAAAA,EAAYlV,GACfA,OAAS,OAATA,EACK4L,EAAI5L,GAGA,KAATA,GACF0I,EAAQG,QAAQ7I,GACT+V,GAGL7N,GAAmBlI,IACrBgV,EAAcE,EACPS,EAAa3V,KAGtB0I,EAAQG,QAAQ7I,GACTkV,EACR,CAGQa,SAAAA,EAAiB/V,GACxB,OAAgB,KAATA,EAAc7vC,EAAI6vC,GAAQkV,EAAYlV,EAC9C,CAGQqT,SAAAA,EAAcrT,GACrB,OAAIyH,GAAWzH,IACb0I,EAAQG,QAAQ7I,GACTgW,GAGFpK,EAAI5L,EACZ,CAGQgW,SAAAA,EAAShW,GACZA,OAAS,KAATA,GAAe6H,GAAkB7H,IACnC0I,EAAQG,QAAQ7I,GACTgW,GAGFC,EAAgBjW,EACxB,CAGQiW,SAAAA,EAAgBjW,GACvB,OAAIkI,GAAmBlI,IACrBgV,EAAciB,EACPN,EAAa3V,IAGlBmI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACTiW,GAGF9lD,EAAI6vC,EACZ,CAGQmV,SAAAA,EAAQnV,GACXA,OAAS,KAATA,GAAe6H,GAAkB7H,IACnC0I,EAAQG,QAAQ7I,GACTmV,GAGI,KAATnV,GAAwB,KAATA,GAAeiI,GAA0BjI,GACnDkW,EAAelW,GAGjB4L,EAAI5L,EACZ,CAGQkW,SAAAA,EAAelW,GAClBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT7vC,GAGI,KAAT6vC,GAAwB,KAATA,GAAeyH,GAAWzH,IAC3C0I,EAAQG,QAAQ7I,GACTmW,GAGLjO,GAAmBlI,IACrBgV,EAAckB,EACPP,EAAa3V,IAGlBmI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACTkW,GAGF/lD,EAAI6vC,EACZ,CAGQmW,SAAAA,EAAqBnW,GAE1BA,OAAS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACA6H,GAAkB7H,IAElB0I,EAAQG,QAAQ7I,GACTmW,GAGFC,EAA0BpW,EAClC,CAGQoW,SAAAA,EAA0BpW,GAC7BA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTqW,GAGLnO,GAAmBlI,IACrBgV,EAAcoB,EACPT,EAAa3V,IAGlBmI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACToW,GAGFF,EAAelW,EACvB,CAGQqW,SAAAA,EAA4BrW,GACnC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO4L,EAAI5L,GAGA,KAATA,GAAwB,KAATA,GACjB0I,EAAQG,QAAQ7I,GAChBmM,EAASnM,EACFsW,GAGLpO,GAAmBlI,IACrBgV,EAAcqB,EACPV,EAAa3V,IAGlBmI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACTqW,IAGT3N,EAAQG,QAAQ7I,GAChBmM,OAAS9mD,EACFkxD,EACR,CAGQD,SAAAA,EAA4BtW,GAC/BA,OAAAA,IAASmM,GACXzD,EAAQG,QAAQ7I,GACTwW,GAGI,OAATxW,EACK4L,EAAI5L,GAGTkI,GAAmBlI,IACrBgV,EAAcsB,EACPX,EAAa3V,KAGtB0I,EAAQG,QAAQ7I,GACTsW,EACR,CAGQE,SAAAA,EAAiCxW,GACxC,OAAa,KAATA,GAAwB,KAATA,GAAeiI,GAA0BjI,GACnDkW,EAAelW,GAGjB4L,EAAI5L,EACZ,CAGQuW,SAAAA,EAA8BvW,GAEnCA,OAAS,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO4L,EAAI5L,GAGA,KAATA,GAAeiI,GAA0BjI,GACpCkW,EAAelW,IAGxB0I,EAAQG,QAAQ7I,GACTuW,EAlaiC,CAwajCZ,SAAAA,EAAa3V,GAKbyI,OAJPC,EAAQI,KAAK,gBACbJ,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GACLC,EACA0G,EACA,aACAjuC,EAAK+nC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBACzCpU,EACA,EAEP,CAGQ+pD,SAAAA,EAAYpP,GAEZgV,OADPtM,EAAQE,MAAM,gBACPoM,EAAYhV,EACpB,CAGQ7vC,SAAAA,EAAI6vC,GACPA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,gBACbJ,EAAQI,KAAK,YACNH,GAGFiD,EAAI5L,EACZ,CACF,GC3cM,MAAMyW,GAAW,CACtBvqD,KAAM,WACN88C,SAgJF,SAA0BN,EAASC,EAAIiD,GAC/BzqC,MAAAA,EAAO1Z,KACb,IAGIivD,EAGAhE,EANA76C,EAAQsJ,EAAKmpC,OAAOhnD,OAQjBuU,KAAAA,KACL,IACkC,eAA/BsJ,EAAKmpC,OAAOzyC,GAAO,GAAG5L,MACU,cAA/BkV,EAAKmpC,OAAOzyC,GAAO,GAAG5L,QACvBkV,EAAKmpC,OAAOzyC,GAAO,GAAG8+C,UACvB,CACAD,EAAav1C,EAAKmpC,OAAOzyC,GAAO,GAChC,KACD,CAGH,OAGS5H,SAAM+vC,GACT,IAAC0W,EACI9K,OAAAA,EAAI5L,GAGT0W,OAAAA,EAAWE,UAAkBC,EAAS7W,IAC1C0S,EAAUvxC,EAAK+nC,OAAOwJ,QAAQj5C,SAC5B44C,GACElxC,EAAKyrC,eAAe,CAClB38C,MAAOymD,EAAWvmD,IAClBA,IAAKgR,EAAKkJ,UAIhBq+B,EAAQE,MAAM,YACdF,EAAQE,MAAM,eACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,eACbJ,EAAQI,KAAK,YACNgO,EACR,EAGQA,SAAAA,EAAc9W,GAEjBA,OAAS,KAATA,EACK0I,EAAQlZ,QACbunB,GACApO,EACA+J,EAAU/J,EAAKkO,EAHVnO,CAIL1I,GAGS,KAATA,EACK0I,EAAQlZ,QACbwnB,GACArO,EACA+J,EACIhK,EAAQlZ,QAAQynB,GAA6BtO,EAAIkO,GACjDA,EALCnO,CAML1I,GAGG0S,EAAU/J,EAAG3I,GAAQ6W,EAAS7W,EACtC,CAGQ6W,SAAAA,EAAS7W,GAET4L,OADP8K,EAAWC,WAAY,EAChB/K,EAAI5L,EACZ,CACF,EA1NC8U,UA6CF,SAA2BxK,EAAQ1iC,GACjC,IAII2hC,EAGA8C,EAGAC,EAGA4K,EAbAr/C,EAAQyyC,EAAOhnD,OACf0gB,EAAS,EAcNnM,KAAAA,KAGL,GAFA0xC,EAAQe,EAAOzyC,GAAO,GAElBw0C,EAAM,CAER,GACiB,SAAf9C,EAAMt9C,MACU,cAAfs9C,EAAMt9C,MAAwBs9C,EAAMqN,UAErC,MAIuB,UAArBtM,EAAOzyC,GAAO,IAAiC,cAAf0xC,EAAMt9C,OACxCs9C,EAAMqN,WAAY,EAXtB,MAaO,GAAItK,GAEPhC,GAAqB,UAArBA,EAAOzyC,GAAO,KACE,eAAf0xC,EAAMt9C,MAAwC,cAAfs9C,EAAMt9C,QACrCs9C,EAAMoN,YAEPtK,EAAOx0C,EAEY,cAAf0xC,EAAMt9C,MAAsB,CAC9B+X,EAAS,EACT,KACD,MAEqB,aAAfulC,EAAMt9C,OACfqgD,EAAQz0C,GAIZ,MAAMixB,EAAQ,CACZ78B,KAA+B,cAAzBq+C,EAAO+B,GAAM,GAAGpgD,KAAuB,OAAS,QACtDgE,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGp8C,OACzCE,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIkd,EAAOA,EAAOhnD,OAAS,GAAG,GAAG6M,MAEhD3H,EAAQ,CACZyD,KAAM,QACNgE,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGp8C,OACzCE,IAAKpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOgC,GAAO,GAAGn8C,MAEpCgI,EAAO,CACXlM,KAAM,YACNgE,MAAOlM,OAAOqpC,OAAO,CAAA,EAAIkd,EAAO+B,EAAOroC,EAAS,GAAG,GAAG7T,KACtDA,IAAKpM,OAAOqpC,OAAO,GAAIkd,EAAOgC,EAAQ,GAAG,GAAGr8C,QA+B9C,OA7BAinD,EAAQ,CACN,CAAC,QAASpuB,EAAOlhB,GACjB,CAAC,QAASpf,EAAOof,IAGnBsvC,EAAQ/rD,GAAK+rD,EAAO5M,EAAO/kC,MAAM8mC,EAAO,EAAGA,EAAOroC,EAAS,IAE3DkzC,EAAQ/rD,GAAK+rD,EAAO,CAAC,CAAC,QAAS/+C,EAAMyP,KAErCsvC,EAAQ/rD,GACN+rD,EACAlL,GACEpkC,EAAQshC,OAAO3B,WAAWuF,WAAWhB,KACrCxB,EAAO/kC,MAAM8mC,EAAOroC,EAAS,EAAGsoC,EAAQ,GACxC1kC,IAIJsvC,EAAQ/rD,GAAK+rD,EAAO,CAClB,CAAC,OAAQ/+C,EAAMyP,GACf0iC,EAAOgC,EAAQ,GACfhC,EAAOgC,EAAQ,GACf,CAAC,OAAQ9jD,EAAOof,KAGlBsvC,EAAQ/rD,GAAK+rD,EAAO5M,EAAO/kC,MAAM+mC,EAAQ,IAEzC4K,EAAQ/rD,GAAK+rD,EAAO,CAAC,CAAC,OAAQpuB,EAAOlhB,KACrC5O,GAAOsxC,EAAQ+B,EAAM/B,EAAOhnD,OAAQ4zD,GAC7B5M,CACR,EA3IC0B,WAmBF,SAA4B1B,GACtBzyC,IAGA0xC,EAHA1xC,GAAS,EAKb,OAASA,EAAQyyC,EAAOhnD,QACtBimD,EAAQe,EAAOzyC,GAAO,GAGL,eAAf0xC,EAAMt9C,MACS,cAAfs9C,EAAMt9C,MACS,aAAfs9C,EAAMt9C,OAGNq+C,EAAOtxC,OAAOnB,EAAQ,EAAkB,eAAf0xC,EAAMt9C,KAAwB,EAAI,GAC3Ds9C,EAAMt9C,KAAO,OACb4L,KAIJ,OAAOyyC,CACR,GArCKyM,GAAoB,CACxB/N,SAuNF,SAA0BN,EAASC,EAAIiD,GACrC,OAGS37C,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,YACdF,EAAQE,MAAM,kBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,kBACNsJ,GAAkB1J,EAAS2D,EACnC,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,EACK7vC,EAAI6vC,GAGNgR,GACLtI,EACAyO,EACAvL,EACA,sBACA,6BACA,mCACA,yBACA,4BACA,GATKoF,CAULhR,EACH,CAGQmX,SAAAA,EAAiBnX,GACxB,OAAOiI,GAA0BjI,GAC7BoS,GAAkB1J,EAAS0O,EAA3BhF,CAAoCpS,GACpC7vC,EAAI6vC,EACT,CAGQoX,SAAAA,EAAQpX,GACXA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,EACzB+R,GACLrJ,EACA0J,GAAkB1J,EAASv4C,GAC3By7C,EACA,gBACA,sBACA,sBANKmG,CAOL/R,GAGG7vC,EAAI6vC,EACZ,CAGQ7vC,SAAAA,EAAI6vC,GACPA,OAAS,KAATA,GACF0I,EAAQE,MAAM,kBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,kBACbJ,EAAQI,KAAK,YACNH,GAGFiD,EAAI5L,EACZ,CACF,GArRKgX,GAAyB,CAC7BhO,SAuRF,SAA+BN,EAASC,EAAIiD,GACpCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GACb,OAAO2R,GAAaxtD,KAClBgd,EACAunC,EACA2O,EACAzL,EACA,YACA,kBACA,kBAPK+F,CAQL3R,EACH,EAGQqX,SAAAA,EAAWrX,GACX7+B,OAAAA,EAAK+nC,OAAOwJ,QAAQj5C,SACzB44C,GACElxC,EAAKyrC,eAAezrC,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAAG,IAAIiiB,MAAM,GAAI,KAGtEojC,EAAG3I,GACH4L,EAAI5L,EACT,CACF,GA9SKiX,GAA8B,CAClCjO,SAgTF,SAAoCN,EAASC,EAAIiD,GAC/C,OAGS37C,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,aACdF,EAAQE,MAAM,mBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,mBACNuD,CACR,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,GACF0I,EAAQE,MAAM,mBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,mBACbJ,EAAQI,KAAK,aACNH,GAGFiD,EAAI5L,EACZ,CACF,GCtWM,MAAMsX,GAAkB,CAC7BprD,KAAM,kBACN88C,SAKF,SAAiCN,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,cACdF,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACNuD,CACR,EAGQA,SAAAA,EAAKrM,GACRA,OAAS,KAATA,GACF0I,EAAQE,MAAM,eACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,eACbJ,EAAQI,KAAK,cACN7X,GAGF2a,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GAQb,OAAgB,KAATA,GAAe,2BAA4B7+B,EAAK+nC,OAAO3B,WAC1DqE,EAAI5L,GACJ2I,EAAG3I,EACR,CACF,EA3CCgM,WAAYyK,GAASzK,YCHhB,MAAMuL,GAAiB,CAC5BrrD,KAAM,iBACN88C,SAKF,SAAgCN,EAASC,EAAIiD,GACrCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GAMb,OALA0I,EAAQE,MAAM,aACdF,EAAQE,MAAM,eACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,eACbJ,EAAQI,KAAK,aACN7X,CACR,EAGQA,SAAAA,EAAM+O,GAQb,OAAgB,KAATA,GAAe,2BAA4B7+B,EAAK+nC,OAAO3B,WAC1DqE,EAAI5L,GACJ2I,EAAG3I,EACR,CACF,EA/BCgM,WAAYyK,GAASzK,YCFhB,MAAMwL,GAAa,CACxBtrD,KAAM,aACN88C,SAIF,SAA4BN,EAASC,GACnC,OAGS14C,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GAAaC,EAASC,EAAI,aAClC,CACF,GCfM,MAAM8O,GAAgB,CAC3BvrD,KAAM,gBACN88C,SAIF,SAA+BN,EAASC,EAAIiD,GACtCv3C,IAGA83C,EAHA93C,EAAO,EAIX,OAGSpE,SAAM+vC,GAGN6R,OAFPnJ,EAAQE,MAAM,iBACduD,EAASnM,EACF6R,EAAQ7R,EAChB,EAGQ6R,SAAAA,EAAQ7R,GACXA,OAAAA,IAASmM,GACXzD,EAAQE,MAAM,yBACPwD,EAASpM,IAGdmI,GAAcnI,GACTyI,GAAaC,EAASmJ,EAAS,aAA/BpJ,CAA6CzI,GAGlD3rC,EAAO,GAAe,OAAT2rC,IAAkBkI,GAAmBlI,GAC7C4L,EAAI5L,IAGb0I,EAAQI,KAAK,iBACNH,EAAG3I,GACX,CAGQoM,SAAAA,EAASpM,GACZA,OAAAA,IAASmM,GACXzD,EAAQG,QAAQ7I,GAChB3rC,IACO+3C,IAGT1D,EAAQI,KAAK,yBACN+I,EAAQ7R,GAChB,CACF,GCzCM,MAAM4G,GAAO,CAClB16C,KAAM,OACN88C,SAuBF,SAA2BN,EAASC,EAAIiD,GAChCzqC,MAAAA,EAAO1Z,KACPwsC,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAC9C,IAAIo0D,EACFzjB,GAAyB,eAAjBA,EAAK,GAAGhoC,KACZgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,OACtC,EACF+Q,EAAO,EACX,OAGSpE,SAAM+vC,GACPkT,MAAAA,EACJ/xC,EAAK4oC,eAAe99C,OACV,KAAT+zC,GAAwB,KAATA,GAAwB,KAATA,EAC3B,gBACA,eAGJkT,GAAS,kBAATA,GACK/xC,EAAK4oC,eAAeoC,QAAUnM,IAAS7+B,EAAK4oC,eAAeoC,OAC5DxE,GAAW3H,GACf,CAQIkT,GAPC/xC,EAAK4oC,eAAe99C,OACvBkV,EAAK4oC,eAAe99C,KAAOinD,EAC3BxK,EAAQE,MAAMsK,EAAM,CAClBtF,YAAY,KAIH,kBAATsF,EAEKlT,OADP0I,EAAQE,MAAM,kBACE,KAAT5I,GAAwB,KAATA,EAClB0I,EAAQH,MAAMkP,GAAe7L,EAAK+L,EAAlCjP,CAA4C1I,GAC5C2X,EAAS3X,GAGX,IAAC7+B,EAAK0pC,WAAsB,KAAT7K,EAGd4X,OAFPlP,EAAQE,MAAM,kBACdF,EAAQE,MAAM,iBACPgP,EAAO5X,EAEjB,CAEM4L,OAAAA,EAAI5L,EACZ,EAGQ4X,SAAAA,EAAO5X,GACV2H,OAAAA,GAAW3H,MAAW3rC,EAAO,IAC/Bq0C,EAAQG,QAAQ7I,GACT4X,KAILz2C,EAAK0pC,WAAax2C,EAAO,KAC1B8M,EAAK4oC,eAAeoC,OACjBnM,IAAS7+B,EAAK4oC,eAAeoC,OACpB,KAATnM,GAAwB,KAATA,IAEnB0I,EAAQI,KAAK,iBACN6O,EAAS3X,IAGX4L,EAAI5L,EACZ,CAKQ2X,SAAAA,EAAS3X,GAKhB,OAJA0I,EAAQE,MAAM,kBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,kBACb3nC,EAAK4oC,eAAeoC,OAAShrC,EAAK4oC,eAAeoC,QAAUnM,EACpD0I,EAAQH,MACbiF,GACArsC,EAAK0pC,UAAYe,EAAMiM,EACvBnP,EAAQlZ,QACNsoB,GACAC,EACAC,GAGL,CAGQH,SAAAA,EAAQ7X,GAGR+X,OAFP52C,EAAK4oC,eAAekO,kBAAmB,EACvCP,IACOK,EAAY/X,EACpB,CAGQgY,SAAAA,EAAYhY,GACnB,OAAImI,GAAcnI,IAChB0I,EAAQE,MAAM,4BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,4BACNiP,GAGFnM,EAAI5L,EACZ,CAGQ+X,SAAAA,EAAY/X,GAIZ2I,OAHPxnC,EAAK4oC,eAAe11C,KAClBqjD,EACAv2C,EAAKyrC,eAAelE,EAAQI,KAAK,mBAAmB,GAAMxlD,OACrDqlD,EAAG3I,EACX,CACF,EAtICgK,aAAc,CACZhB,SA2IJ,SAAkCN,EAASC,EAAIiD,GACvCzqC,MAAAA,EAAO1Z,KAENihD,OADPvnC,EAAK4oC,eAAeI,gBAAa9kD,EAC1BqjD,EAAQH,MAAMiF,GAAWqK,EAASK,GAGhCL,SAAAA,EAAQ7X,GAMf,OALA7+B,EAAK4oC,eAAeoO,kBAClBh3C,EAAK4oC,eAAeoO,mBACpBh3C,EAAK4oC,eAAekO,iBAGfxP,GACLC,EACAC,EACA,iBACAxnC,EAAK4oC,eAAe11C,KAAO,EAJtBo0C,CAKLzI,EACH,CAGQkY,SAAAA,EAASlY,GACZ7+B,OAAAA,EAAK4oC,eAAeoO,oBAAsBhQ,GAAcnI,IAC1D7+B,EAAK4oC,eAAeoO,uBAAoB9yD,EACxC8b,EAAK4oC,eAAekO,sBAAmB5yD,EAChC+yD,EAAiBpY,KAG1B7+B,EAAK4oC,eAAeoO,uBAAoB9yD,EACxC8b,EAAK4oC,eAAekO,sBAAmB5yD,EAChCqjD,EAAQlZ,QAAQ6oB,GAAiB1P,EAAIyP,EAArC1P,CAAuD1I,GAC/D,CAGQoY,SAAAA,EAAiBpY,GAKxB,OAHA7+B,EAAK4oC,eAAeI,YAAa,EAEjChpC,EAAK0pC,eAAYxlD,EACVojD,GACLC,EACAA,EAAQlZ,QAAQoX,GAAM+B,EAAIiD,GAC1B,aACAzqC,EAAK+nC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBACzCpU,EACA,EANCojD,CAOLzI,EACH,CACF,GAzLC8I,KAuNF,SAAyBJ,GACvBA,EAAQI,KAAKrhD,KAAKsiD,eAAe99C,KAClC,GArNK6rD,GAAoC,CACxC9O,SA0NF,SAA0CN,EAASC,EAAIiD,GAC/CzqC,MAAAA,EAAO1Z,KACNghD,OAAAA,GACLC,GASO0G,SAAYpP,GACnB,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GACvC,OAAC6kD,GAAcnI,IACpB/L,GACiB,6BAAjBA,EAAK,GAAGhoC,KACN08C,EAAG3I,GACH4L,EAAI5L,EACT,GAdC,2BACA7+B,EAAK+nC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,qBACzCpU,EACA,EAYP,EA7OC8mC,SAAS,GAILksB,GAAkB,CACtBrP,SAoLF,SAAwBN,EAASC,EAAIiD,GAC7BzqC,MAAAA,EAAO1Z,KACb,OAAOghD,GACLC,GAOO0G,SAAYpP,GACnB,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAC9C,OAAO2wC,GACY,mBAAjBA,EAAK,GAAGhoC,MACRgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,SAAW6d,EAAK4oC,eAAe11C,KACnEs0C,EAAG3I,GACH4L,EAAI5L,EACT,GAZC,iBACA7+B,EAAK4oC,eAAe11C,KAAO,EAY9B,EArMC83B,SAAS,GC1BJ,MAAMmsB,GAAkB,CAC7BpsD,KAAM,kBACN88C,SA+DF,SAAiCN,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KACb,IAGI0kD,EAGAoM,EANA1gD,EAAQsJ,EAAKmpC,OAAOhnD,OAQjBuU,KAAAA,KAGL,GACiC,eAA/BsJ,EAAKmpC,OAAOzyC,GAAO,GAAG5L,MACS,eAA/BkV,EAAKmpC,OAAOzyC,GAAO,GAAG5L,MACS,YAA/BkV,EAAKmpC,OAAOzyC,GAAO,GAAG5L,KACtB,CACAssD,EAA2C,cAA/Bp3C,EAAKmpC,OAAOzyC,GAAO,GAAG5L,KAClC,KACD,CAGH,OAGSgE,SAAM+vC,GACT,IAAC7+B,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,QAAUj9B,EAAK0pC,WAAa0N,GAIpD7L,OAHPhE,EAAQE,MAAM,qBACdF,EAAQE,MAAM,6BACduD,EAASnM,EACF0M,EAAgB1M,GAGlB4L,OAAAA,EAAI5L,EACZ,EAGQ0M,SAAAA,EAAgB1M,GACnBA,OAAAA,IAASmM,GACXzD,EAAQG,QAAQ7I,GACT0M,IAGThE,EAAQI,KAAK,6BACNL,GAAaC,EAAS+F,EAAoB,aAA1ChG,CAAwDzI,GAChE,CAGQyO,SAAAA,EAAmBzO,GACtBA,OAAS,OAATA,GAAiBkI,GAAmBlI,IACtC0I,EAAQI,KAAK,qBACNH,EAAG3I,IAGL4L,EAAI5L,EACZ,CACF,EAvHC8U,UAIF,SAAkCxK,EAAQ1iC,GACxC,IAGImhC,EAGA5wC,EAGAm6C,EATAz6C,EAAQyyC,EAAOhnD,OAYZuU,KAAAA,KACDyyC,GAAqB,UAArBA,EAAOzyC,GAAO,GAAgB,CAC5ByyC,GAA0B,YAA1BA,EAAOzyC,GAAO,GAAG5L,KAAoB,CACvC88C,EAAUlxC,EACV,KACD,CAE6B,cAA1ByyC,EAAOzyC,GAAO,GAAG5L,OACnBkM,EAAON,EAPX,KAWgC,YAA1ByyC,EAAOzyC,GAAO,GAAG5L,MAEnBq+C,EAAOtxC,OAAOnB,EAAO,GAGlBy6C,GAAwC,eAA1BhI,EAAOzyC,GAAO,GAAG5L,OAClCqmD,EAAaz6C,GAKnB,MAAM2gD,EAAU,CACdvsD,KAAM,gBACNgE,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOnyC,GAAM,GAAGlI,OACzCE,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIkd,EAAOA,EAAOhnD,OAAS,GAAG,GAAG6M,MAGtDm6C,EAAOnyC,GAAM,GAAGlM,KAAO,oBAGnBqmD,GACFhI,EAAOtxC,OAAOb,EAAM,EAAG,CAAC,QAASqgD,EAAS5wC,IAC1C0iC,EAAOtxC,OAAOs5C,EAAa,EAAG,EAAG,CAAC,OAAQhI,EAAOvB,GAAS,GAAInhC,IAC9D0iC,EAAOvB,GAAS,GAAG54C,IAAMpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOgI,GAAY,GAAGniD,MAEjEm6C,EAAOvB,GAAS,GAAKyP,EAIvB,OADAlO,EAAOn/C,KAAK,CAAC,OAAQqtD,EAAS5wC,IACvB0iC,CACR,GC/DM,MAAM3a,GAAO,CAClBqZ,SAIF,SAAwBN,GAChBvnC,MAAAA,EAAO1Z,KACPirC,EAAUgW,EAAQlZ,QAEtBge,IAmBOiL,SAAczY,GACjBA,GAAS,OAATA,EAEF,YADA0I,EAAQG,QAAQ7I,GAQlB,OAJA0I,EAAQE,MAAM,mBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,mBACb3nC,EAAKupC,sBAAmBrlD,EACjBqtC,CACR,GA5BCgW,EAAQlZ,QACN/nC,KAAKyhD,OAAO3B,WAAWmR,YACvBC,EACAlQ,GACEC,EACAA,EAAQlZ,QACN/nC,KAAKyhD,OAAO3B,WAAW5X,KACvBgpB,EACAjQ,EAAQlZ,QAAQuZ,GAAS4P,IAE3B,gBAIN,OAAOjmB,EAiBEimB,SAAAA,EAAe3Y,GAClBA,GAAS,OAATA,EASJ,OAJA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACb3nC,EAAKupC,sBAAmBrlD,EACjBqtC,EARLgW,EAAQG,QAAQ7I,EASnB,CACF,GCxDM,MAAMpU,GAAW,CACtBogB,WAAY4M,MAED/uD,GAASgvD,GAAkB,UAC3B1gD,GAAO0gD,GAAkB,QAMtC,SAASA,GAAkBC,GAClB,MAAA,CACL9P,SAOO+P,SAAerQ,GAChBvnC,MAAAA,EAAO1Z,KACP8/C,EAAa9/C,KAAKyhD,OAAO3B,WAAWuR,GACpC3gD,EAAOuwC,EAAQlZ,QAAQ+X,EAAYt3C,EAAO+oD,GAChD,OAAO/oD,EAGEA,SAAAA,EAAM+vC,GACb,OAAO6R,EAAQ7R,GAAQ7nC,EAAK6nC,GAAQgZ,EAAQhZ,EAC7C,CAGQgZ,SAAAA,EAAQhZ,GACXA,GAAS,OAATA,EAOJ,OAFA0I,EAAQE,MAAM,QACdF,EAAQG,QAAQ7I,GACT3xB,EANLq6B,EAAQG,QAAQ7I,EAOnB,CAGQ3xB,SAAAA,EAAK2xB,GACZ,OAAI6R,EAAQ7R,IACV0I,EAAQI,KAAK,QACN3wC,EAAK6nC,KAGd0I,EAAQG,QAAQ7I,GACT3xB,EACR,CAMQwjC,SAAAA,EAAQ7R,GACXA,GAAS,OAATA,EACF,OAAO,EAGT,MAAM4G,EAAOW,EAAWvH,GACpBnoC,IAAAA,GAAS,EAEb,GAAI+uC,EACF,OAAS/uC,EAAQ+uC,EAAKtjD,QAAQ,CAC5B,MAAMwmD,EAAOlD,EAAK/uC,GAElB,IAAKiyC,EAAKhuB,UAAYguB,EAAKhuB,SAAS33B,KAAKgd,EAAMA,EAAK2a,UAClD,OAAO,CAEV,CAGH,OAAO,CACR,CACF,EAhECkwB,WAAY4M,GACA,SAAVE,EAAmBG,QAAyB5zD,GAgEjD,CAMD,SAASuzD,GAAeM,GACtB,OAGA,SAAwB5O,EAAQ1iC,GAC1B/P,IAGA+wC,EAHA/wC,GAAS,EAMb,OAASA,GAASyyC,EAAOhnD,aACT+B,IAAVujD,EACE0B,EAAOzyC,IAAoC,SAA1ByyC,EAAOzyC,GAAO,GAAG5L,OACpC28C,EAAQ/wC,EACRA,KAEQyyC,EAAOzyC,IAAoC,SAA1ByyC,EAAOzyC,GAAO,GAAG5L,OAExC4L,IAAU+wC,EAAQ,IACpB0B,EAAO1B,GAAO,GAAGz4C,IAAMm6C,EAAOzyC,EAAQ,GAAG,GAAG1H,IAC5Cm6C,EAAOtxC,OAAO4vC,EAAQ,EAAG/wC,EAAQ+wC,EAAQ,GACzC/wC,EAAQ+wC,EAAQ,GAGlBA,OAAQvjD,GAIL6zD,OAAAA,EAAgBA,EAAc5O,EAAQ1iC,GAAW0iC,CACzD,CACF,CAaD,SAAS2O,GAAuB3O,EAAQ1iC,GACtC,IAAIuoC,EAAa,EAEjB,OAASA,GAAc7F,EAAOhnD,QAC5B,IACG6sD,IAAe7F,EAAOhnD,QACU,eAA/BgnD,EAAO6F,GAAY,GAAGlkD,OACW,SAAnCq+C,EAAO6F,EAAa,GAAG,GAAGlkD,KAC1B,CACMoiB,MAAAA,EAAOi8B,EAAO6F,EAAa,GAAG,GAC9BgJ,EAASvxC,EAAQ6jC,YAAYp9B,GACnC,IAKI+qC,EALAvhD,EAAQshD,EAAO71D,OACf+1D,GAAe,EACfhlD,EAAO,EAKJwD,KAAAA,KAAS,CACd,MAAMs5B,EAAQgoB,EAAOthD,GAErB,GAAqB,iBAAVs5B,EAAoB,CAGtBA,IAFPkoB,EAAcloB,EAAM7tC,OAEyB,KAAtC6tC,EAAM1J,WAAW4xB,EAAc,IACpChlD,IACAglD,IAGF,GAAIA,EAAa,MACjBA,GAAe,CATjB,MAWK,IAAe,IAAXloB,EACPioB,GAAO,EACP/kD,SACK,IAAe,IAAX88B,EAEJ,CAELt5B,IACA,KACD,CACF,CAED,GAAIxD,EAAM,CACR,MAAMk1C,EAAQ,CACZt9C,KACEkkD,IAAe7F,EAAOhnD,QAAU81D,GAAQ/kD,EAAO,EAC3C,aACA,oBACNpE,MAAO,CACLmuC,KAAM/vB,EAAKle,IAAIiuC,KACfC,OAAQhwB,EAAKle,IAAIkuC,OAAShqC,EAC1B2P,OAAQqK,EAAKle,IAAI6T,OAAS3P,EAC1BilD,OAAQjrC,EAAKpe,MAAMqpD,OAASzhD,EAC5Bk1C,aAAcl1C,EACVwhD,EACAhrC,EAAKpe,MAAM88C,aAAesM,GAEhClpD,IAAKpM,OAAOqpC,OAAO,CAAA,EAAI/e,EAAKle,MAE9Bke,EAAKle,IAAMpM,OAAOqpC,OAAO,CAAA,EAAImc,EAAMt5C,OAE/Boe,EAAKpe,MAAM+T,SAAWqK,EAAKle,IAAI6T,OACjCjgB,OAAOqpC,OAAO/e,EAAMk7B,IAEpBe,EAAOtxC,OACLm3C,EACA,EACA,CAAC,QAAS5G,EAAO3hC,GACjB,CAAC,OAAQ2hC,EAAO3hC,IAElBuoC,GAAc,EAEjB,CAEDA,GACD,CAGH,OAAO7F,CACR,CC9KM,SAASiP,GAAgBrQ,EAAQsQ,EAAYzS,GAElD,IAAI5I,EAAQp6C,OAAOqpC,OACjB2Z,EACIhjD,OAAOqpC,OAAO,GAAI2Z,GAClB,CACE3I,KAAM,EACNC,OAAQ,EACRr6B,OAAQ,GAEd,CACEs1C,OAAQ,EACRvM,cAAe,IAKb0M,MAAAA,EAAc,CAAA,EAGdC,EAAuB,GAGzBP,IAAAA,EAAS,GAGTxoC,EAAQ,GAUZ,MAAM+3B,EAAU,CACdG,QA2IOA,SAAQ7I,GACXkI,GAAmBlI,IACrB7B,EAAMC,OACND,EAAME,OAAS,EACfF,EAAMn6B,SAAoB,IAAVg8B,EAAc,EAAI,EAClC2Z,MACmB,IAAV3Z,IACT7B,EAAME,SACNF,EAAMn6B,UAGJm6B,EAAM4O,aAAe,EACvB5O,EAAMmb,UAENnb,EAAM4O,eAIF5O,EAAM4O,eAAiBoM,EAAOhb,EAAMmb,QAAQh2D,SAC9C66C,EAAM4O,cAAgB,EACtB5O,EAAMmb,WAIV1xC,EAAQkU,SAAWkkB,CAGpB,EArKC4I,MAwKF,SAAe38C,EAAM2tD,GAGnB,MAAMrQ,EAAQqQ,GAAU,GAKxB,OAJArQ,EAAMt9C,KAAOA,EACbs9C,EAAMt5C,MAAQoa,IACdzC,EAAQ0iC,OAAOn/C,KAAK,CAAC,QAASo+C,EAAO3hC,IACrC+I,EAAMxlB,KAAKo+C,GACJA,CACR,EAhLCT,KAmLOA,SAAK78C,GACZ,MAAMs9C,EAAQ54B,EAAMgD,MAGpB,OAFA41B,EAAMp5C,IAAMka,IACZzC,EAAQ0iC,OAAOn/C,KAAK,CAAC,OAAQo+C,EAAO3hC,IAC7B2hC,CACR,EAvLC/Z,QAASqqB,GA8LX,SAA+BC,EAAW1X,GACxC2X,EAAUD,EAAW1X,EAAK2E,KAC3B,IA/LCwB,MAAOsR,EAAiBG,GACxBnP,UAAWgP,EAAiBG,EAAmB,CAC7CnP,WAAW,KASTjjC,EAAU,CACdkU,SAAU,KACVkkB,KAAM,KACN+J,eAAgB,CAHF,EAIdO,OAAQ,GACRpB,SACAuC,cACAmB,eA6CF,SAAwBrD,EAAO0Q,GACtBC,OAsYX,SAAyBf,EAAQc,GAC3BpiD,IAAAA,GAAS,EAGP2L,MAAAA,EAAS,GAGf,IAAI22C,EAEJ,OAAStiD,EAAQshD,EAAO71D,QAAQ,CAC9B,MAAM6tC,EAAQgoB,EAAOthD,GAGrB,IAAIjS,EAEJ,GAAqB,iBAAVurC,EACTvrC,EAAQurC,OAER,OAAQA,GACN,KAAM,EACJvrC,EAAQ,KACR,MAGF,KAAM,EACJA,EAAQ,KACR,MAGF,KAAM,EACJA,EAAQ,OACR,MAGF,KAAM,EACJA,EAAQq0D,EAAa,IAAM,KAC3B,MAGF,KAAM,EACJ,IAAKA,GAAcE,EAAO,SAC1Bv0D,EAAQ,IACR,MAGF,QAEEA,EAAQsiB,OAAOsgC,aAAarX,GAIlCgpB,GAAmB,IAAXhpB,EACR3tB,EAAOrY,KAAKvF,EACb,CAED,OAAO4d,EAAOlY,KAAK,GACpB,CA9bU4uD,CAAgBzO,EAAYlC,GAAQ0Q,EAC5C,EA9CC5vC,MACAqhC,WA0DOA,SAAW9lD,GAClB6zD,EAAY7zD,EAAMw4C,MAAQx4C,EAAMy4C,OAChCsb,GAzHsD,EA8DtDhO,MAwBOA,SAAMpmC,GAIT4zC,GAHJA,EAAShuD,GAAKguD,EAAQ5zC,GACtB1Z,IAEkC,OAA9BstD,EAAOA,EAAO71D,OAAS,GACzB,MAAO,GAMFskB,OAHPmyC,EAAUP,EAAY,GAEtB5xC,EAAQ0iC,OAAS0B,GAAW0N,EAAsB9xC,EAAQ0iC,OAAQ1iC,GAC3DA,EAAQ0iC,MAjGuC,GAsEpDqD,IAAAA,EAAQ6L,EAAWxQ,SAAS7kD,KAAKyjB,EAAS8gC,GAa9C,OAJI8Q,EAAWxN,YACb0N,EAAqBvuD,KAAKquD,GAGrB5xC,EA0BE6jC,SAAAA,EAAYlC,GACnB,OA6VJ,SAAqB4P,EAAQ5P,GAC3B,MAAM6Q,EAAa7Q,EAAMt5C,MAAMqpD,OACzBe,EAAmB9Q,EAAMt5C,MAAM88C,aAC/BuN,EAAW/Q,EAAMp5C,IAAImpD,OACrBiB,EAAiBhR,EAAMp5C,IAAI48C,aAGjC,IAAI5Q,EAEAie,IAAeE,EAEjBne,EAAO,CAACgd,EAAOiB,GAAY70C,MAAM80C,EAAkBE,KAEnDpe,EAAOgd,EAAO5zC,MAAM60C,EAAYE,GAE5BD,GAAoB,IAEtBle,EAAK,GAAKA,EAAK,GAAG52B,MAAM80C,IAGtBE,EAAiB,GAEnBpe,EAAKhxC,KAAKguD,EAAOmB,GAAU/0C,MAAM,EAAGg1C,KAIxC,OAAOpe,CACR,CAxXUqe,CAAYrB,EAAQ5P,EAC5B,CAGD,SAASl/B,IACP,OAAOtmB,OAAOqpC,OAAO,CAAd,EAAkB+Q,EAC1B,CAqBD,SAAStyC,IAEP,IAAI4uD,EAEJ,KAAOtc,EAAMmb,OAASH,EAAO71D,QAAQ,CAC7B6tC,MAAAA,EAAQgoB,EAAOhb,EAAMmb,QAE3B,GAAqB,iBAAVnoB,EAOT,IANAspB,EAAatc,EAAMmb,OAEfnb,EAAM4O,aAAe,IACvB5O,EAAM4O,aAAe,GAIrB5O,EAAMmb,SAAWmB,GACjBtc,EAAM4O,aAAe5b,EAAM7tC,QAE3Bo3D,EAAGvpB,EAAM1J,WAAW0W,EAAM4O,oBAG5B2N,EAAGvpB,EAEN,CACF,CAQQupB,SAAAA,EAAG1a,GAGV2N,EAAQA,EAAM3N,EACf,CAkED,SAASga,EAAkBhnD,EAAGovC,GAC5BA,EAAKuY,SACN,CAQD,SAASd,EAAiBe,EAAUhB,GAClC,OAWA,SAAcrS,EAAYyN,EAAa6F,GAErC,IAAIC,EAGAC,EAGArQ,EAGAtI,EACJ,OAAO3+C,MAAMC,QAAQ6jD,GAEjByT,EAAuBzT,GACvB,aAAcA,EACdyT,EAAuB,CAACzT,IASnB0T,SAAsB9sD,GAC7B,OAAO8B,EAGEA,SAAAA,EAAM+vC,GACPkb,MAAAA,EAAe,OAATlb,GAAiB7xC,EAAI6xC,GAC3B2G,EAAe,OAAT3G,GAAiB7xC,EAAI29C,KAQjC,OAAOkP,EAPM,IAIPv3D,MAAMC,QAAQw3D,GAAOA,EAAMA,EAAM,CAACA,GAAO,MACzCz3D,MAAMC,QAAQijD,GAAOA,EAAMA,EAAM,CAACA,GAAO,IAExCqU,CAA6Bhb,EACrC,CACF,CAxBGib,CAAsB1T,GAgCjByT,SAAAA,EAAuBpU,GAI9B,OAHAkU,EAAmBlU,EACnBmU,EAAiB,EAEG,IAAhBnU,EAAKtjD,OACAu3D,EAGFM,EAAgBvU,EAAKmU,GAC7B,CAQQI,SAAAA,EAAgBrB,GACvB,OAGS7pD,SAAM+vC,GAKboC,EA4ER,WACQgZ,MAAAA,EAAa/wC,IACbgxC,EAAgBzzC,EAAQkU,SACxBw/B,EAAwB1zC,EAAQ8iC,iBAChC6Q,EAAmB3zC,EAAQ0iC,OAAOhnD,OAClCk4D,EAAa/3D,MAAMsjD,KAAKp2B,GACvB,MAAA,CACLgqC,UACA5T,KAAMwU,GAQR,SAASZ,IACPxc,EAAQid,EACRxzC,EAAQkU,SAAWu/B,EACnBzzC,EAAQ8iC,iBAAmB4Q,EAC3B1zC,EAAQ0iC,OAAOhnD,OAASi4D,EACxB5qC,EAAQ6qC,EACR7B,GACD,CACF,CApGc10D,GACPylD,EAAmBoP,EAEdA,EAAU3tB,UACbvkB,EAAQ8iC,iBAAmBoP,GAI3BA,GAAAA,EAAU5tD,MACV0b,EAAQshC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAASqgD,EAAU5tD,MAEnD0/C,OAAAA,IAGT,OAAOkO,EAAU9Q,SAAS7kD,KAIxBy1D,EAAS71D,OAAOqpC,OAAOrpC,OAAOylB,OAAO5B,GAAUgyC,GAAUhyC,EACzD8gC,EACAC,EACAiD,EAPKkO,CAQL9Z,EACH,CACF,CAGQ2I,SAAAA,EAAG3I,GAGV,OADA4a,EAASlQ,EAAkBtI,GACpB4S,CACR,CAGQpJ,SAAAA,EAAI5L,GAIX,OAFAoC,EAAKuY,YAECI,EAAiBD,EAAiBx3D,OAC/B63D,EAAgBL,EAAiBC,IAGnCF,CACR,CACF,CACF,CAOD,SAASd,EAAUD,EAAW/S,GACxB+S,EAAU9N,aAAe0N,EAAqBjgD,SAASqgD,IACzDJ,EAAqBvuD,KAAK2uD,GAGxBA,EAAUtzB,SACZxtB,GACE4O,EAAQ0iC,OACRvD,EACAn/B,EAAQ0iC,OAAOhnD,OAASyjD,EACxB+S,EAAUtzB,QAAQ5e,EAAQ0iC,OAAO/kC,MAAMwhC,GAAOn/B,IAI9CkyC,EAAUhF,YACZltC,EAAQ0iC,OAASwP,EAAUhF,UAAUltC,EAAQ0iC,OAAQ1iC,GAExD,CAuCD,SAAS+xC,IACHxb,EAAMC,QAAQqb,GAAetb,EAAME,OAAS,IAC9CF,EAAME,OAASob,EAAYtb,EAAMC,MACjCD,EAAMn6B,QAAUy1C,EAAYtb,EAAMC,MAAQ,EAE7C,CACF,CCjdM,MAAMqL,GAAW,CACrB,GAAK7C,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACL,GAAKA,GACN,GAAM8G,IAIKvE,GAAiB,CAC5B,GAAMmJ,IAIKoG,GAAc,CACxB,EAAC,GAAIxJ,GACL,EAAC,GAAIA,GACN,GAAMA,IAIKvf,GAAO,CACjB,GAAKijB,GACL,GAAK6E,GACN,GAAM,CAACa,GAAiBb,IACvB,GAAKxE,GACL,GAAKqF,GACL,GAAKb,GACL,GAAKpJ,GACN,IAAOA,IAIIxkD,GAAS,CACnB,GAAKmkD,GACN,GAAMH,IAIK11C,GAAO,CACjB,EAAC,GAAIq/C,GACL,EAAC,GAAIA,GACL,EAAC,GAAIA,GACL,GAAKF,GACL,GAAKtJ,GACL,GAAK/B,GACN,GAAM,CAACe,GAAU+H,IAChB,GAAKwC,GACN,GAAM,CAAC5E,GAAiB9E,IACvB,GAAK4I,GACL,GAAKxK,GACN,GAAMqD,IAIKxC,GAAa,CACxBhB,KAAM,CAACG,GAAWwP,gJAIY,CAC9B3P,KAAM,CAAC,GAAI,aAIU,CACrBA,KAAM,MCzFR,MAAMpR,GAAS,cCJR,SAASghB,GAAgC91D,EAAOq+C,GAC/CjE,MAAAA,EAAO9uC,OAAOI,SAAS1L,EAAOq+C,GAGlC,OACAjE,EAAO,GACE,KAATA,GACCA,EAAO,IAAMA,EAAO,IACpBA,EAAO,KAAOA,EAAO,KACrBA,EAAO,OAASA,EAAO,OACvBA,EAAO,OAASA,EAAO,OACL,QAAX,MAAPA,IACkB,QAAX,MAAPA,IACDA,EAAO,QAEA,IAGF93B,OAAOsgC,aAAaxI,EAC5B,CC3BD,MAAM2b,GACJ,oEAWK,SAASC,GAAah2D,GAC3B,OAAOA,EAAM6f,QAAQk2C,GAA4BE,GAClD,CAQD,SAASA,GAAOC,EAAIC,EAAIC,GACtB,GAAID,EAEF,OAAOA,EAKL7zB,GAAS,KAFA8zB,EAAGv0B,WAAW,GAEV,CACf,MAAMS,EAAO8zB,EAAGv0B,WAAW,GACrBw0B,EAAe,MAAT/zB,GAAyB,KAATA,EAC5B,OAAOwzB,GAAgCM,EAAGz2C,MAAM02C,EAAM,EAAI,GAAIA,EAAM,GAAK,GAC1E,CAED,OAAOlO,GAA8BiO,IAAOF,CAC7C,CCqDD,MAAMrX,GAAM,CAAA,EAAGvgD,eAOFg4D,GAcX,SAAUt2D,EAAOu8C,EAAU71C,GAMlB6vD,MALiB,iBAAbha,IACT71C,EAAU61C,EACVA,OAAW98C,GAejB,SAAkBiH,EAAU,IAGpB8vD,MAAAA,EAASC,GACb,CACEpwB,WAAY,GACZqwB,eAAgB,CACd,WACA,WACA,UACA,YACA,UAEF1T,MAAO,CACLoE,SAAUuP,EAAOC,IACjBC,iBAAkBC,EAClBC,cAAeD,EACfE,WAAYL,EAAO/D,GACnB9K,WAAY6O,EAAO7O,GACnBG,gBAAiB6O,EACjB1O,mBAAoB0O,EACpBrO,WAAYkO,EAAOM,GACnBC,oBAAqB/qC,EACrBgrC,oBAAqBhrC,EACrBm9B,aAAcqN,EAAOM,EAAU9qC,GAC/Bu9B,SAAUiN,EAAOjN,EAAUv9B,GAC3BirC,aAAcN,EACdruC,KAAMquC,EACNO,cAAeP,EACfpK,WAAYiK,EAAOjK,GACnB4K,4BAA6BnrC,EAC7BorC,sBAAuBprC,EACvBqrC,sBAAuBrrC,EACvBsrC,SAAUd,EAAOc,GACjB1K,gBAAiB4J,EAAOe,IACxBC,kBAAmBhB,EAAOe,IAC1BrK,SAAUsJ,EAAOiB,GAAMzrC,GACvB0rC,aAAcf,EACd3H,SAAUwH,EAAOiB,GAAMzrC,GACvB2rC,aAAchB,EACdiB,MAAOpB,EAAOoB,IACdn1D,MAAOupB,EACPyqC,KAAMD,EAAOC,IACboB,SAAUrB,EAAOqB,IACjBC,cAAeC,EACfC,YAAaxB,EAAO3V,GAAMoX,GAC1BC,cAAe1B,EAAO3V,IACtB2R,UAAWgE,EAAOhE,IAClBzxB,UAAWo3B,EACXC,gBAAiBpsC,EACjBqsC,0BAA2BrsC,EAC3BssC,oBAAqBtsC,EACrBusC,cAAe/B,EAAO/D,GACtB+F,OAAQhC,EAAOgC,IACf9G,cAAe8E,EAAO9E,KAExB3O,KAAM,CACJ8T,WAAY4B,IACZC,mBAAoBC,EACpB1R,SAAUwR,IACV7B,cAAegC,EACflC,iBAAkBmC,EAClBlR,WAAY8Q,IACZK,qBAAsBC,EACtBC,oCAAqCC,EACrCC,gCAAiCD,EACjCE,wBAAyBC,EACzB9Q,WAAYmQ,EAAOY,GACnBC,gBAAiBC,EACjBxC,oBAAqByC,EACrBxC,oBAAqByC,EACrBvC,cAAe6B,EACf5P,aAAcsP,EAAOiB,GACrBnQ,SAAUkP,EAAOkB,GACjB1C,aAAc8B,EACdzwC,KAAMywC,EACNxM,WAAYkM,IACZtB,4BAA6ByC,EAC7BxC,sBAAuByC,EACvBxC,sBAAuByC,EACvBxC,SAAUmB,IACV7L,gBAAiB6L,EAAOsB,GACxBvC,kBAAmBiB,EAAOsB,GAC1B7M,SAAUuL,EAAOuB,GACjBtC,aAAcqB,EACd/J,SAAUyJ,EAAOwB,GACjBtC,aAAcoB,EACdnB,MAAOa,EAAOyB,GACdz3D,MAAO03D,EACPC,UAAWC,EACX5I,WAAY6I,EACZ7D,KAAMgC,EAAO8B,GACb1C,SAAUY,IACVT,YAAaS,IACbP,cAAeO,IACfjG,UAAWiG,IACXL,gBAAiBoC,EACjBnC,0BAA2BoC,EAC3BnC,oBAAqBoC,EACrBC,SAAUC,EACVrC,cAAeE,EAAOoC,GACtBC,0BAA2BC,EAC3BC,kBAAmBC,EACnBzC,OAAQC,IACR/G,cAAe+G,MAGnBlyD,EAAQ20D,iBAAmB,IAIvB5yC,EAAO,CAAA,EACb,OAAOw3B,EAMEA,SAAAA,EAAQyE,GAEf,IAAIvE,EAAO,CACT95C,KAAM,OACNjC,SAAU,IAIZ,MAGMk3D,EAAa,GAGbC,EAAY,GAGZv5C,EAAU,CACd+I,MAVY,CAACo1B,GAWbmb,aACA9E,SACAxT,QACAE,OACA/2B,SACAqvC,SACA38B,UACAxC,WAEEpqB,IAAAA,GAAS,EAEb,OAASA,EAAQyyC,EAAOhnD,QAIpBgnD,GAA0B,gBAA1BA,EAAOzyC,GAAO,GAAG5L,MACS,kBAA1Bq+C,EAAOzyC,GAAO,GAAG5L,KAEbq+C,GAAqB,UAArBA,EAAOzyC,GAAO,GAChBspD,EAAUh2D,KAAK0M,OACV,CAELA,EAAQwpD,EAAY/W,EADP6W,EAAUxtC,MACW9b,EACnC,CAML,IAFAA,GAAS,IAEAA,EAAQyyC,EAAOhnD,QAAQ,CACxBg+D,MAAAA,EAAUlF,EAAO9R,EAAOzyC,GAAO,IAEjC4sC,GAAItgD,KAAKm9D,EAAShX,EAAOzyC,GAAO,GAAG5L,OACrCq1D,EAAQhX,EAAOzyC,GAAO,GAAG5L,MAAM9H,KAC7BJ,OAAOqpC,OACL,CACEwf,eAAgBtC,EAAOzyC,GAAO,GAAG+0C,gBAEnChlC,GAEF0iC,EAAOzyC,GAAO,GAGnB,CAED,GAAIqpD,EAAW59D,OAAS,EAAG,CACnB2wC,MAAAA,EAAOitB,EAAWA,EAAW59D,OAAS,IAC5B2wC,EAAK,IAAMstB,IACnBp9D,KAAKyjB,OAASviB,EAAW4uC,EAAK,GAnEjB,CA4FhB,IAtBP8R,EAAK74C,SAAW,CACd+C,MAAOkuC,EACLmM,EAAOhnD,OAAS,EACZgnD,EAAO,GAAG,GAAGr6C,MACb,CACEmuC,KAAM,EACNC,OAAQ,EACRr6B,OAAQ,IAGhB7T,IAAKguC,EACHmM,EAAOhnD,OAAS,EACZgnD,EAAOA,EAAOhnD,OAAS,GAAG,GAAG6M,IAC7B,CACEiuC,KAAM,EACNC,OAAQ,EACRr6B,OAAQ,KAIlBnM,GAAS,IAEAA,EAAQukD,EAAOnwB,WAAW3oC,QACjCyiD,EAAOqW,EAAOnwB,WAAWp0B,GAAOkuC,IAASA,EAG3C,OAAOA,CACR,CAQD,SAASsb,EAAY/W,EAAQr6C,EAAO3M,GAClC,IAKIs6D,EAGAhO,EAGA4R,EAGA7J,EAdA9/C,EAAQ5H,EAAQ,EAChBwxD,GAAoB,EACpBC,GAAa,EAcjB,OAAS7pD,GAASvU,GAAQ,CACxB,MAAMqsD,EAAQrF,EAAOzyC,GAwClB,GArCiB,kBAAlB83C,EAAM,GAAG1jD,MACS,gBAAlB0jD,EAAM,GAAG1jD,MACS,eAAlB0jD,EAAM,GAAG1jD,MAEQ,UAAb0jD,EAAM,GACR8R,IAEAA,IAGF9J,OAAWtyD,GACgB,oBAAlBsqD,EAAM,GAAG1jD,KACD,UAAb0jD,EAAM,MAENiO,GACCjG,GACA8J,GACAD,IAEDA,EAAsB3pD,GAGxB8/C,OAAWtyD,GAGK,eAAlBsqD,EAAM,GAAG1jD,MACS,kBAAlB0jD,EAAM,GAAG1jD,MACS,mBAAlB0jD,EAAM,GAAG1jD,MACS,mBAAlB0jD,EAAM,GAAG1jD,MACS,6BAAlB0jD,EAAM,GAAG1jD,OAIT0rD,OAAWtyD,IAITo8D,GACa,UAAb9R,EAAM,IACY,mBAAlBA,EAAM,GAAG1jD,OACY,IAAtBw1D,GACc,SAAb9R,EAAM,KACa,kBAAlBA,EAAM,GAAG1jD,MACU,gBAAlB0jD,EAAM,GAAG1jD,MACb,CACA,GAAI2xD,EAAU,CACR+D,IAAAA,EAAY9pD,EAGT8pD,IAFP/R,OAAYvqD,EAELs8D,KAAa,CAClB,MAAMC,EAAYtX,EAAOqX,GAEzB,GACwB,eAAtBC,EAAU,GAAG31D,MACS,oBAAtB21D,EAAU,GAAG31D,KACb,CACA,GAAqB,SAAjB21D,EAAU,GAAe,SAEzBhS,IACFtF,EAAOsF,GAAW,GAAG3jD,KAAO,kBAC5By1D,GAAa,GAGfE,EAAU,GAAG31D,KAAO,aACpB2jD,EAAY+R,CAZd,MAaO,GACiB,eAAtBC,EAAU,GAAG31D,MACS,qBAAtB21D,EAAU,GAAG31D,MACS,+BAAtB21D,EAAU,GAAG31D,MACS,qBAAtB21D,EAAU,GAAG31D,MACS,mBAAtB21D,EAAU,GAAG31D,KAIb,KAEH,CAGCu1D,KACE5R,GAAa4R,EAAsB5R,KAGrCgO,EAASiE,SAAU,GAGrBjE,EAASztD,IAAMpM,OAAOqpC,OACpB,CADa,EAEbwiB,EAAYtF,EAAOsF,GAAW,GAAG3/C,MAAQ0/C,EAAM,GAAGx/C,KAEpDm6C,EAAOtxC,OAAO42C,GAAa/3C,EAAO,EAAG,CAAC,OAAQ+lD,EAAUjO,EAAM,KAC9D93C,IACAvU,GAhDF,CAmDsB,mBAAlBqsD,EAAM,GAAG1jD,OACX2xD,EAAW,CACT3xD,KAAM,WAEN41D,SAAS,EACT5xD,MAAOlM,OAAOqpC,OAAO,CAAA,EAAIuiB,EAAM,GAAG1/C,QAGpCq6C,EAAOtxC,OAAOnB,EAAO,EAAG,CAAC,QAAS+lD,EAAUjO,EAAM,KAClD93C,IACAvU,IACAk+D,OAAsBn8D,EACtBsyD,GAAW,EAEd,CAlIuC,CAsI1C,OADArN,EAAOr6C,GAAO,GAAG4xD,QAAUH,EACpBp+D,CACR,CAMD,SAASmhC,EAAQrgC,EAAKwB,GACpByoB,EAAKjqB,GAAOwB,CACb,CAQQq8B,SAAAA,EAAQ79B,GACRiqB,OAAAA,EAAKjqB,EACb,CAMQ+5C,SAAAA,EAAM2jB,GACN,MAAA,CACL1jB,KAAM0jB,EAAE1jB,KACRC,OAAQyjB,EAAEzjB,OACVr6B,OAAQ89C,EAAE99C,OAEb,CAOD,SAASu4C,EAAO/yC,EAAQu4C,GACtB,OAAO1V,EAOEA,SAAAA,EAAK9C,GACZX,EAAMzkD,KAAKsD,KAAM+hB,EAAO+/B,GAAQA,GAC5BwY,GAAKA,EAAI59D,KAAKsD,KAAM8hD,EACzB,CACF,CAGD,SAASx3B,IACFpB,KAAAA,MAAMxlB,KAAK,CACdc,KAAM,WACNjC,SAAU,IAEb,CAWD,SAAS4+C,EAAMx+C,EAAMm/C,EAAOyY,GAU1B,OATev6D,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEvC0G,SAASmB,KAAKf,GACrB3C,KAAKkpB,MAAMxlB,KAAKf,GACX82D,KAAAA,WAAW/1D,KAAK,CAACo+C,EAAOyY,IAE7B53D,EAAK8C,SAAW,CACd+C,MAAOkuC,EAAMoL,EAAMt5C,QAEd7F,CACR,CAMQo0D,SAAAA,EAAOuD,GACd,OAAOzV,EAOEA,SAAAA,EAAM/C,GACTwY,GAAKA,EAAI59D,KAAKsD,KAAM8hD,GACxBT,EAAK3kD,KAAKsD,KAAM8hD,EACjB,CACF,CASD,SAAST,EAAKS,EAAO0Y,GACnB,MAAM73D,EAAO3C,KAAKkpB,MAAMgD,MAClB04B,EAAO5kD,KAAKy5D,WAAWvtC,MAEzB,IAAC04B,EACG,MAAA,IAAI1lD,MACR,iBACE4iD,EAAMt9C,KACN,MACAiyC,GAAkB,CAChBjuC,MAAOs5C,EAAMt5C,MACbE,IAAKo5C,EAAMp5C,MAEb,oBAEC,GAAIk8C,EAAK,GAAGpgD,OAASs9C,EAAMt9C,KAChC,GAAIg2D,EACFA,EAAY99D,KAAKsD,KAAM8hD,EAAO8C,EAAK,QAC9B,EACWA,EAAK,IAAMkV,IACnBp9D,KAAKsD,KAAM8hD,EAAO8C,EAAK,GAChC,CAIH,OADAjiD,EAAK8C,SAASiD,IAAMguC,EAAMoL,EAAMp5C,KACzB/F,CACR,CAMD,SAASg3D,IACP,O/CtmBG,SAAkBh3D,EAAMkC,GACzB,IAAAm6C,gBAACA,GAAkB,GAAQn6C,GAAW,CAAA,EAC1C,OAAOk6C,GAAIp8C,EAAMq8C,EAClB,C+CmmBUxiD,CAASwD,KAAKkpB,MAAMgD,MAjfC,CAwf9B,SAASqqC,IACPv5B,EAAQ,+BAA+B,EACxC,CAGQq5B,SAAAA,EAAqBvU,GAC5B,GAAItnB,EAAQ,+BAAgC,CAGnCtR,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GACxB2M,MAAQiB,OAAOI,SAAS7J,KAAKmlD,eAAerD,GAAQ,IAC7D9kB,EAAQ,8BACT,CACF,CAGD,SAAS86B,IACP,MAAMlxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B4+D,KAAO7zC,CACb,CAGD,SAASmxC,IACP,MAAMnxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B0rD,KAAO3gC,CACb,CAGD,SAASixC,IAEHr9B,EAAQ,oBACZx6B,KAAKsqB,SACL0S,EAAQ,kBAAkB,GAC3B,CAGD,SAAS26B,IACP,MAAM/wC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BsC,MAAQyoB,EAAK5I,QAAQ,2BAA4B,IACtDgf,EAAQ,iBACT,CAGD,SAASg7B,IACP,MAAMpxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BsC,MAAQyoB,EAAK5I,QAAQ,eAAgB,GAC3C,CAGQm6C,SAAAA,EAA4BrW,GAEnC,MAAM/gD,EAAQf,KAAK25D,SACbh3D,EAECumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GACjC8G,EAAK5B,MAAQA,EACb4B,EAAKmoD,WAAaF,GAChB5qD,KAAKmlD,eAAerD,IACpB7a,aACH,CAGD,SAASmxB,IACP,MAAMxxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B4uD,MAAQ7jC,CACd,CAGD,SAASsxC,IACP,MAAMtxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B47C,IAAM7wB,CACZ,CAGQqwC,SAAAA,EAAyBnV,GAChC,MAAMn/C,EAECumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEjC,IAAK8G,EAAKqqB,MAAO,CACf,MAAMA,EAAQhtB,KAAKmlD,eAAerD,GAAOjmD,OACzC8G,EAAKqqB,MAAQA,CACd,CACF,CAGD,SAASusC,IACPv8B,EAAQ,gCAAgC,EACzC,CAGQq8B,SAAAA,EAAgCvX,GAGhC54B,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BmxB,MAAqD,KAA7ChtB,KAAKmlD,eAAerD,GAAO9hB,WAAW,GAAY,EAAI,CACpE,CAGD,SAASm5B,IACPn8B,EAAQ,+BACT,CAGQi4B,SAAAA,EAAYnT,GACnB,MAAM7yB,EAEC/F,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAGjC,IAAI2wC,EAAOvd,EAAO1sB,SAAS0sB,EAAO1sB,SAAS1G,OAAS,GAE/C2wC,GAAsB,SAAdA,EAAKhoC,OAEhBgoC,EAAO97B,KAEP87B,EAAK/mC,SAAW,CACd+C,MAAOkuC,EAAMoL,EAAMt5C,QAGrBymB,EAAO1sB,SAASmB,KAAK8oC,IAGvBxsC,KAAKkpB,MAAMxlB,KAAK8oC,EACjB,CAGQ6qB,SAAAA,EAAWvV,GAClB,MAAMtV,EAAOxsC,KAAKkpB,MAAMgD,MACxBsgB,EAAKruC,OAAS6B,KAAKmlD,eAAerD,GAClCtV,EAAK/mC,SAASiD,IAAMguC,EAAMoL,EAAMp5C,IACjC,CAGQkwD,SAAAA,EAAiB9W,GACxB,MAAM3hC,EAAUngB,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAG/C,GAAI2+B,EAAQ,eAAgB,CAI1B,OAHara,EAAQ5d,SAAS4d,EAAQ5d,SAAS1G,OAAS,GACnD4J,SAASiD,IAAMguC,EAAMoL,EAAMp5C,UAChCs0B,EAAQ,cAET,EAGExC,EAAQ,iCACTm6B,EAAOE,eAAe7iD,SAASmO,EAAQ3b,QAEvCywD,EAAYv4D,KAAKsD,KAAM8hD,GACvBuV,EAAW36D,KAAKsD,KAAM8hD,GAEzB,CAGD,SAASuW,IACPr7B,EAAQ,eAAe,EACxB,CAGD,SAASs7B,IACP,MAAM1xC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BsC,MAAQyoB,CACd,CAGD,SAAS2xC,IACP,MAAM3xC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BsC,MAAQyoB,CACd,CAGD,SAASqxC,IACP,MAAMrxC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5BsC,MAAQyoB,CACd,CAGD,SAASiyC,IACP,MAAM14C,EAEC+I,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAE7B2+B,EAAQ,gBACVra,EAAQ3b,MAAQ,YAEhB2b,EAAQu6C,cAAgBlgC,EAAQ,kBAAoB,kBAE7Cra,EAAQs3B,WACRt3B,EAAQsqC,eAGRtqC,EAAQ2qC,kBAER3qC,EAAQpf,OAGjBi8B,EAAQ,gBACT,CAGD,SAASw7B,IACP,MAAMr4C,EAEC+I,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAE7B2+B,EAAQ,gBACVra,EAAQ3b,MAAQ,YAEhB2b,EAAQu6C,cAAgBlgC,EAAQ,kBAAoB,kBAE7Cra,EAAQs3B,WACRt3B,EAAQsqC,eAGRtqC,EAAQ2qC,kBAER3qC,EAAQpf,OAGjBi8B,EAAQ,gBACT,CAGQ27B,SAAAA,EAAgB7W,GACvB,MAAM6Y,EAECzxC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC3BuG,EAASpC,KAAKmlD,eAAerD,GACnC6Y,EAAS55D,MAAQozD,GAAa/xD,GAC9Bu4D,EAAS7P,WAAaF,GAAoBxoD,GAAQ6kC,aACnD,CAGD,SAASwxB,IACP,MAAMmC,EAEC1xC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC3BsC,EAAQ6B,KAAK25D,SACbh3D,EAECumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEjCmhC,EAAQ,eAAe,GAEL,SAAdr6B,EAAK6B,KAEP7B,EAAKJ,SAAWq4D,EAASr4D,SAEzBI,EAAKs8C,IAAM9gD,CAEd,CAGD,SAAS46D,IACP,MAAMnyC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B47C,IAAM7wB,CACZ,CAGD,SAASoyC,IACP,MAAMpyC,EAAO5mB,KAAK25D,SAGXzwC,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B4uD,MAAQ7jC,CACd,CAGD,SAASsyC,IACPl8B,EAAQ,cACT,CAGD,SAASy5B,IACPz5B,EAAQ,gBAAiB,YAC1B,CAGQ87B,SAAAA,EAAsBhX,GAC7B,MAAM/gD,EAAQf,KAAK25D,SACbh3D,EAECumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GACjC8G,EAAK5B,MAAQA,EACb4B,EAAKmoD,WAAaF,GAChB5qD,KAAKmlD,eAAerD,IACpB7a,cACFjK,EAAQ,gBAAiB,OAC1B,CAGQu6B,SAAAA,EAA+BzV,GACtC9kB,EAAQ,yBAA0B8kB,EAAMt9C,KACzC,CAGQkzD,SAAAA,EAA8B5V,GACrC,MAAMl7B,EAAO5mB,KAAKmlD,eAAerD,GAC3Bt9C,EAAOg2B,EAAQ,0BAGrB,IAAIr8B,EAEAqG,GACFrG,EAAQ81D,GACNrtC,EACS,oCAATpiB,EAA6C,GAAK,IAEpDw4B,EAAQ,2BAKR7+B,EAAQmoD,GAA8B1/B,GAGxC,MAAM4lB,EAAOxsC,KAAKkpB,MAAMgD,MACxBsgB,EAAKruC,OAASA,EACdquC,EAAK/mC,SAASiD,IAAMguC,EAAMoL,EAAMp5C,IACjC,CAGQyuD,SAAAA,EAAuBrV,GAC9BuV,EAAW36D,KAAKsD,KAAM8hD,GAGf54B,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B47C,IAAMz3C,KAAKmlD,eAAerD,EAChC,CAGQoV,SAAAA,EAAoBpV,GAC3BuV,EAAW36D,KAAKsD,KAAM8hD,GAGf54B,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5B47C,IAAM,UAAYz3C,KAAKmlD,eAAerD,EAv2Bf,CA82B9B,SAASmE,IACA,MAAA,CACLzhD,KAAM,aACNjC,SAAU,GAEb,CAGD,SAAS6yD,IACA,MAAA,CACL5wD,KAAM,OACNi2D,KAAM,KACNlT,KAAM,KACNppD,MAAO,GAEV,CAGD,SAAS0pD,IACA,MAAA,CACLrjD,KAAM,aACNrG,MAAO,GAEV,CAGD,SAAS0sD,IACA,MAAA,CACLrmD,KAAM,aACNsmD,WAAY,GACZ/pD,MAAO,KACP0pD,MAAO,KACPhT,IAAK,GAER,CAGD,SAASme,IACA,MAAA,CACLpxD,KAAM,WACNjC,SAAU,GAEb,CAGD,SAASwuD,IAEA,MAAA,CACLvsD,KAAM,UACNwoB,WAAOpvB,EACP2E,SAAU,GAEb,CAGD,SAASszD,KACA,MAAA,CACLrxD,KAAM,QAET,CAGD,SAASuxD,KACA,MAAA,CACLvxD,KAAM,OACNrG,MAAO,GAEV,CAGD,SAAS+3D,KACA,MAAA,CACL1xD,KAAM,QACNimD,MAAO,KACPhT,IAAK,GACLwH,IAAK,KAER,CAGD,SAAS8V,KACA,MAAA,CACLvwD,KAAM,OACNimD,MAAO,KACPhT,IAAK,GACLl1C,SAAU,GAEb,CAMQ48C,SAAAA,GAAK2C,GACL,MAAA,CACLt9C,KAAM,OACNq2D,QAAwB,gBAAf/Y,EAAMt9C,KACfgE,MAAO,KAEP+jC,OAAQuV,EAAMsY,QACd73D,SAAU,GAEb,CAMQ4zD,SAAAA,GAASrU,GACT,MAAA,CACLt9C,KAAM,WAEN+nC,OAAQuV,EAAMsY,QACd3rD,QAAS,KACTlM,SAAU,GAEb,CAGD,SAASuuD,KACA,MAAA,CACLtsD,KAAM,YACNjC,SAAU,GAEb,CAGD,SAASu0D,KACA,MAAA,CACLtyD,KAAM,SACNjC,SAAU,GAEb,CAGD,SAASmO,KACA,MAAA,CACLlM,KAAM,OACNrG,MAAO,GAEV,CAGD,SAAS6xD,KACA,MAAA,CACLxrD,KAAM,gBAET,CACF,CA9gCUkwD,CAAS7vD,EAAT6vD,CC9GJ,SAAqB7R,GAC1B,MAAQmF,GAAYnF,KAIpB,OAAOA,CACR,CDyGKiY,CErGC,SAAej2D,EAAU,IAGxBi7C,MAMA2B,EAAS,CACbwJ,QAAS,GACTxH,KAAM,CAFO,EAGb3D,WATiBP,GAEhBwb,CAAAA,IAAmBtwD,OAAO5F,EAAQ26C,YAAc,KAQjD8B,QAASv/B,EAAOu/B,IAChBU,SAAUjgC,EAAOigC,IACjB9Z,KAAMnmB,EAAOmmB,IACb9lC,OAAQ2f,EAAO3f,IACfsO,KAAMqR,EAAOrR,KAEf,OAAO+wC,EAKE1/B,SAAAA,EAAOkpB,GACd,OAGS+vB,SAAQ1b,GACf,OAAOwS,GAAgBrQ,EAAQxW,EAASqU,EACzC,CACF,CACF,CFsEOzB,CAAMh5C,GAASm9C,WAAWkC,MHtG3B,WACDtN,IAOAqkB,EAPArkB,EAAS,EACTtsB,EAAS,GAGT9hB,GAAQ,EAIZ,OAGA,SAAsBrK,EAAOu8C,EAAUhyC,GAE/BgpD,MAAAA,EAAS,GAGf,IAAI9xC,EAGAylB,EAGAsjB,EAGAuS,EAGA3iB,EAcJ,IAZAp6C,EAAQmsB,EAASnsB,EAAM3B,SAASk+C,GAChCiO,EAAgB,EAChBr+B,EAAS,GAEL9hB,IAC0B,QAAxBrK,EAAM6hC,WAAW,IACnB2oB,IAGFngD,OAAQ5K,GAGH+qD,EAAgBxqD,EAAMtC,QAAQ,CAO/B,GANJo3C,GAAOxzB,UAAYkpC,EACnB/oC,EAAQqzB,GAAO/xB,KAAK/iB,GACpB+8D,EACEt7C,QAAyBhiB,IAAhBgiB,EAAMxP,MAAsBwP,EAAMxP,MAAQjS,EAAMtC,OAC3D08C,EAAOp6C,EAAM6hC,WAAWk7B,IAEnBt7C,EAAO,CACV0K,EAASnsB,EAAM2f,MAAM6qC,GACrB,KACD,CAEGpQ,GAAS,KAATA,GAAeoQ,IAAkBuS,GAAeD,EAClDvJ,EAAOhuD,MAAM,GACbu3D,OAAmBr9D,OAYnB,OAVIq9D,IACFvJ,EAAOhuD,MAAM,GACbu3D,OAAmBr9D,GAGjB+qD,EAAgBuS,IAClBxJ,EAAOhuD,KAAKvF,EAAM2f,MAAM6qC,EAAeuS,IACvCtkB,GAAUskB,EAAcvS,GAGlBpQ,GACN,KAAK,EACHmZ,EAAOhuD,KAAK,OACZkzC,IACA,MAGF,KAAK,EAIIA,IAHPvR,EAA+B,EAAxB7kB,KAAKwC,KAAK4zB,EAAS,GAC1B8a,EAAOhuD,MAAM,GAENkzC,IAAWvR,GAAMqsB,EAAOhuD,MAAM,GAErC,MAGF,KAAK,GACHguD,EAAOhuD,MAAM,GACbkzC,EAAS,EACT,MAGF,QACEqkB,GAAmB,EACnBrkB,EAAS,EAKf+R,EAAgBuS,EAAc,CAC/B,CAQD,OANIxyD,IACEuyD,GAAkBvJ,EAAOhuD,MAAM,GAC/B4mB,GAAQonC,EAAOhuD,KAAK4mB,GACxBonC,EAAOhuD,KAAK,OAGPguD,CACR,CACF,CGPuCyJ,GAAah9D,EAAOu8C,GAAU,KAGnE,EAghCH,SAASka,GAAUwG,EAAU5b,GACvBpvC,IAAAA,GAAS,EAEb,OAASA,EAAQovC,EAAW3jD,QAAQ,CAClC,MAAMsC,EAAQqhD,EAAWpvC,GAErBpU,MAAMC,QAAQkC,GAChBy2D,GAAUwG,EAAUj9D,GAEpBuhD,GAAU0b,EAAUj9D,EAEvB,CAED,OAAOi9D,CACR,CAOD,SAAS1b,GAAU0b,EAAU1b,GAE3B,IAAI/iD,EAECA,IAAAA,KAAO+iD,EACN1C,GAAAA,GAAItgD,KAAKgjD,EAAW/iD,GAAM,CACtBwiD,MAAAA,EAAe,mBAARxiD,GAAoC,eAARA,EAInCijD,GAHQ5C,GAAItgD,KAAK0+D,EAAUz+D,GAAOy+D,EAASz+D,QAAOiB,KAGjCw9D,EAASz+D,GAAOwiD,EAAO,GAAK,CAAA,GAC7CU,EAAQH,EAAU/iD,GAEpBkjD,IACEV,EAEFic,EAASz+D,GAAO,IAAIijD,KAASC,GAE7BvjD,OAAOqpC,OAAOia,EAAMC,GAGzB,CAEJ,CAGD,SAASia,GAAela,EAAMC,GAC5B,MAAID,EACI,IAAI1gD,MACR,iBACE0gD,EAAKp7C,KACL,MACAiyC,GAAkB,CAChBjuC,MAAOo3C,EAAKp3C,MACZE,IAAKk3C,EAAKl3C,MAEZ,0BACAm3C,EAAMr7C,KACN,MACAiyC,GAAkB,CAChBjuC,MAAOq3C,EAAMr3C,MACbE,IAAKm3C,EAAMn3C,MAEb,aAGE,IAAIxJ,MACR,oCACE2gD,EAAMr7C,KACN,MACAiyC,GAAkB,CAChBjuC,MAAOq3C,EAAMr3C,MACbE,IAAKm3C,EAAMn3C,MAEb,kBAGP,CGltCc,SAAS2yD,GAAYx2D,GAkBlCvI,OAAOqpC,OAAO3lC,KAAM,CAACi9C,OAhBLa,IAEd,MAAMjM,EAAwCjrB,KAAAA,KAAK,YAEnD,OAAO6tC,GACL3W,EACAxhD,OAAOqpC,OAAO,CAAd,EAAkBkM,EAAUhtC,EAAS,CAInC26C,WAAYx/C,KAAK4mB,KAAK,wBAA0B,GAChD4yC,gBAAiBx5D,KAAK4mB,KAAK,2BAA6B,KAP5D,GAaH,CCZM,IAAI00C,GAST,SAAU92D,EAAMoB,EAAOzH,GAErB,IAAIwE,EAAO,CAAC6B,KAAMic,OAAOjc,IAiBzB,OAdE,MAACrG,GACiB,iBAAVyH,IAAsB5J,MAAMC,QAAQ2J,GAI5CtJ,OAAOqpC,OAAOhjC,EAAMiD,GAFpBzH,EAAQyH,EAKN5J,MAAMC,QAAQkC,GAChBwE,EAAKJ,SAAWpE,EACPA,UACTwE,EAAKxE,MAAQsiB,OAAOtiB,IAGfwE,CACR,ECnCH,MAAMq6C,GAAM,CAAA,EAAGvgD,eAOf,SAAS8+D,GAAQC,EAAG74D,GAClB,MAAMikB,EAAOjkB,EAAKikB,MAAQ,GAE1B,MACE,UAAWjkB,KAETq6C,GAAItgD,KAAKkqB,EAAM,UACfo2B,GAAItgD,KAAKkqB,EAAM,gBACfo2B,GAAItgD,KAAKkqB,EAAM,cAGV40C,EAAEC,QAAQ94D,EAAM24D,GAAE,OAAQ34D,EAAKxE,QAGjCq9D,EAAE74D,EAAM,MAAOu8C,GAAIsc,EAAG74D,GAC9B,CAMM,SAASo8C,GAAIyc,EAAG74D,EAAMssB,GAC3B,MAAMzqB,EAAO7B,GAAQA,EAAK6B,KAEtBhE,IAAAA,EAGA,IAACgE,EACH,MAAM,IAAItF,MAAM,uBAAyByD,EAAO,KAWlD,OAPEnC,EADEw8C,GAAItgD,KAAK8+D,EAAEE,SAAUl3D,GAClBg3D,EAAEE,SAASl3D,GACPg3D,EAAEG,aAAeH,EAAEG,YAAY3pD,SAASxN,GAC5Co3D,GAEAJ,EAAEK,gBAGa,mBAAPr7D,EAAoBA,EAAK+6D,IAASC,EAAG74D,EAAMssB,EAC3D,CAMD,SAAS2sC,GAAWJ,EAAG74D,GAErB,MAAO,aAAcA,EAAO,IAAIA,EAAMJ,SAAU28C,GAAIsc,EAAG74D,IAASA,CACjE,CAMM,SAASu8C,GAAIsc,EAAGvsC,GAEf3S,MAAAA,EAAS,GAEX,GAAA,aAAc2S,EAAQ,CACxB,MAAM6sC,EAAQ7sC,EAAO1sB,SACjB6N,IAAAA,GAAS,EAEb,OAASA,EAAQ0rD,EAAMjgE,QAAQ,CAC7B,MAAMkgB,EAASgjC,GAAIyc,EAAGM,EAAM1rD,GAAQ6e,GAEpC,GAAIlT,EAAQ,CACV,GAAI3L,GAAmC,UAA1B0rD,EAAM1rD,EAAQ,GAAG5L,OACvBxI,MAAMC,QAAQ8f,IAA2B,SAAhBA,EAAOvX,OACnCuX,EAAO5d,MAAQ4d,EAAO5d,MAAM6f,QAAQ,OAAQ,MAGzChiB,MAAMC,QAAQ8f,IAA2B,YAAhBA,EAAOvX,MAAoB,CACvD,MAAMi8B,EAAO1kB,EAAOxZ,SAAS,GAEzBk+B,GAAsB,SAAdA,EAAKj8B,OACfi8B,EAAKtiC,MAAQsiC,EAAKtiC,MAAM6f,QAAQ,OAAQ,IAE3C,CAGChiB,MAAMC,QAAQ8f,GAChBO,EAAO5Y,QAAQqY,GAEfO,EAAO5Y,KAAKqY,EAEf,CACF,CACF,CAED,OAAOO,CACR,CCMM,MAAMwT,GAkBT,SAAU/Q,GACR,GAAIA,QACF,OAAOmiC,GAGT,GAAoB,iBAATniC,EACFg9C,OA+Ef,SAAqBjb,GACZkb,OAAAA,GAAYx3D,GAKVA,SAAAA,EAAK7B,GACZ,OAAOA,GAAQA,EAAK6B,OAASs8C,CAC9B,CACF,CAxFcib,CAAYh9C,GAGrB,GAAoB,iBAATA,EACT,OAAO/iB,MAAMC,QAAQ8iB,GAc7B,SAAoBk9C,GAEZC,MAAAA,EAAS,GACX9rD,IAAAA,GAAS,EAEb,OAASA,EAAQ6rD,EAAMpgE,QACrBqgE,EAAO9rD,GAAS0f,GAAQmsC,EAAM7rD,IAGzB4rD,OAAAA,GAAYr1D,GAOnB,SAASA,KAAOu1C,GACV9rC,IAAAA,GAAS,EAEb,OAASA,EAAQ8rD,EAAOrgE,QACtB,GAAIqgE,EAAO9rD,GAAO1T,KAAKsD,QAASk8C,GAAa,OAAO,EAGtD,OAAO,CACR,CACF,CAvCoCigB,CAAWp9C,GAgDhD,SAAsB+hC,GACbkb,OAAAA,GAAY9c,GAMVA,SAAAA,EAAIv8C,GAEX,IAAIhG,EAECA,IAAAA,KAAOmkD,EAENn+C,GAAAA,EAAKhG,KAASmkD,EAAMnkD,GAAM,OAAO,EAGvC,OAAO,CACR,CACF,CAlEuDy/D,CAAar9C,GAG/D,GAAoB,mBAATA,EACFi9C,OAAAA,GAAYj9C,GAGrB,MAAM,IAAI7f,MAAM,+CACjB,EAoFL,SAAS88D,GAAYlb,GACnB,OAOA,YAAsB5E,GAEb4C,OAAAA,QAAQgC,EAAMpkD,KAAKsD,QAASk8C,GACpC,CACF,CAGD,SAASgF,KACP,OAAO,CACR,CCzOM,MAkBMmb,GAcT,SAAU/d,EAAMv/B,EAAMu9C,EAASr4C,GACT,mBAATlF,GAA0C,mBAAZu9C,IACvCr4C,EAAUq4C,EAEVA,EAAUv9C,EACVA,EAAO,MAGT,MAAMlhB,EAAKiyB,GAAQ/Q,GACbvV,EAAOya,GAAW,EAAI,GAS5B,SAASs4C,EAAQ55D,EAAMyN,EAAOosD,GAG5B,MAAMr+D,EAAwB,iBAATwE,GAA8B,OAATA,EAAgBA,EAAO,GAEjE,IAAI8B,EAEsB,iBAAftG,EAAMqG,OACfC,EAC2B,iBAAlBtG,EAAM2tD,QACT3tD,EAAM2tD,QACgB,iBAAf3tD,EAAMsG,KACbtG,EAAMsG,UACN7G,EAENtB,OAAOimB,eAAek6C,EAAO,OAAQ,CACnCt+D,MACE,SACMA,EAAMqG,MAAQC,EAAO,IAAMA,EAAO,IAAM,IAC9C,OAIN,OAAOg4D,EAEP,SAASA,IAEH1gD,IAEA2gD,EAEAngD,EAEAogD,EANA5gD,EAAS,GAQT,KAACgD,GAAQlhB,EAAG8E,EAAMyN,EAAOosD,EAAQA,EAAQ3gE,OAAS,IAAM,SAC1DkgB,EAsCZ,SAAkB5d,GAChB,GAAInC,MAAMC,QAAQkC,GAChB,OAAOA,EAGT,GAAqB,iBAAVA,EACT,MAAO,CAlIa,KAkIFA,GAGb,MAAA,CAACA,EACT,CAhDoBy+D,CAASN,EAAQ35D,EAAM65D,IA9ExB,QAgFJzgD,EAAO,IACT,OAAOA,EAKPpZ,GAAAA,EAAKJ,UA1FC,SA0FWwZ,EAAO,GAO1B,IALAQ,GAAU0H,EAAUthB,EAAKJ,SAAS1G,QAAU,GAAK2N,EAEjDmzD,EAAeH,EAAQ/xD,OAAO9H,GAGvB4Z,GAAU,GAAKA,EAAS5Z,EAAKJ,SAAS1G,QAAQ,CAInD,GAFA6gE,EAAYH,EAAQ55D,EAAKJ,SAASga,GAASA,EAAQogD,EAAvCJ,GA/FN,QAiGFG,EAAU,GACZ,OAAOA,EAGTngD,EAC0B,iBAAjBmgD,EAAU,GAAkBA,EAAU,GAAKngD,EAAS/S,CAC9D,CAGH,OAAOuS,CACR,CACF,CAzEDwgD,CAAQje,EAAM,KAAM,GAApBie,EA0ED,EClHE,MAAME,GAcT,SAAUne,EAAMv/B,EAAMu9C,EAASr4C,GACT,mBAATlF,GAA0C,mBAAZu9C,IACvCr4C,EAAUq4C,EACVA,EAAUv9C,EACVA,EAAO,MAGTs9C,GAAa/d,EAAMv/B,GAMnB,SAAkBpc,EAAM65D,GAChBvtC,MAAAA,EAASutC,EAAQA,EAAQ3gE,OAAS,GACxC,OAAOygE,EACL35D,EACAssB,EAASA,EAAO1sB,SAAS2xB,QAAQvxB,GAAQ,KACzCssB,EAEH,GAbkChL,EAcpC,EC1CQ44C,GAAanmB,GAAM,SACnBomB,GAAWpmB,GAAM,OAiB9B,SAASA,GAAMlyC,GACb,OAQSkyC,SAAM/zC,GACb,MAAM+zC,EAAS/zC,GAAQA,EAAK8C,UAAY9C,EAAK8C,SAASjB,IAAU,GAEzD,MAAA,CACLmyC,KAAMD,EAAMC,MAAQ,KACpBC,OAAQF,EAAME,QAAU,KACxBr6B,OAAQm6B,EAAMn6B,QAAU,EAAIm6B,EAAMn6B,OAAS,KAE9C,CACF,CCZM,MAUM8/C,GAiBT,SAAU/d,EAAMv/B,EAAMu9C,EAASr4C,GACT,mBAATlF,GAA0C,mBAAZu9C,IACvCr4C,EAAUq4C,EAEVA,EAAUv9C,EACVA,EAAO,MAGT,IAAIlhB,EAAKiyB,GAAQ/Q,GACbvV,EAAOya,GAAW,EAAI,GAS1B,SAASs4C,EAAQ55D,EAAMyN,EAAOosD,GAE5B,IAEI/3D,EAFAtG,EAAwB,iBAATwE,GAA8B,OAATA,EAAgBA,EAAO,GAIrC,iBAAfxE,EAAMqG,OACfC,EAC2B,iBAAlBtG,EAAM2tD,QACT3tD,EAAM2tD,QACgB,iBAAf3tD,EAAMsG,KACbtG,EAAMsG,UACN7G,EAENtB,OAAOimB,eAAek6C,EAAO,OAAQ,CACnCt+D,MACE,SACMA,EAAMqG,MAAQC,EAAO,IAAMA,EAAO,IAAM,IAC9C,OAIN,OAAOg4D,EAEP,SAASA,IAEH1gD,IAEA2gD,EAEAngD,EAEAogD,EANA5gD,EAAS,GAQT,KAACgD,GAAQlhB,EAAG8E,EAAMyN,EAAOosD,EAAQA,EAAQ3gE,OAAS,IAAM,SAC1DkgB,EAoCZ,SAAkB5d,GAChB,GAAInC,MAAMC,QAAQkC,GAChB,OAAOA,EAGT,GAAqB,iBAAVA,EACT,MAAO,CA1Ha,KA0HFA,GAGb,MAAA,CAACA,EACT,CA9CoBy+D,CAASN,EAAQ35D,EAAM65D,IAxExB,QA0EJzgD,EAAO,IACT,OAAOA,EAIPpZ,GAAAA,EAAKJ,UAnFC,SAmFWwZ,EAAO,GAO1B,IALAQ,GAAU0H,EAAUthB,EAAKJ,SAAS1G,QAAU,GAAK2N,EAEjDmzD,EAAeH,EAAQ/xD,OAAO9H,GAGvB4Z,GAAU,GAAKA,EAAS5Z,EAAKJ,SAAS1G,QAAQ,CAGnD,GAzFM,SAuFN6gE,EAAYH,EAAQ55D,EAAKJ,SAASga,GAASA,EAAQogD,EAAvCJ,IAEE,GACZ,OAAOG,EAGTngD,EAC0B,iBAAjBmgD,EAAU,GAAkBA,EAAU,GAAKngD,EAAS/S,CAC9D,CAGH,OAAOuS,CACR,CACF,CAtEDwgD,CAAQje,EAAM,KAAM,GAApBie,EAuED,ECpHE,MAAME,GAiBT,SAAUne,EAAMv/B,EAAMu9C,EAASr4C,GACT,mBAATlF,GAA0C,mBAAZu9C,IACvCr4C,EAAUq4C,EACVA,EAAUv9C,EACVA,EAAO,MAGTs9C,GAAa/d,EAAMv/B,GAMnB,SAAkBpc,EAAM65D,GAClBvtC,IAAAA,EAASutC,EAAQA,EAAQ3gE,OAAS,GACtC,OAAOygE,EACL35D,EACAssB,EAASA,EAAO1sB,SAAS2xB,QAAQvxB,GAAQ,KACzCssB,EAEH,GAbkChL,EAcpC,EC5DC+4B,GAAM,CAAA,EAAGvgD,eA0Cf,SAASsgE,GAAM5+D,GACNsiB,OAAAA,OAAOtiB,GAAS,IAAIupC,aAC5B,CCpDD,MAAMs1B,GAAsB,CAAC,IAAK,OAAQ,IAAK,MAAO,IAAK,KAAW,IAAA,MCsB/D,SAASC,GAAYxlB,EAAKmC,GACzBz7C,MAAAA,EDXD,SAAgBA,GACrB,OAAOA,EAAM6f,QAAQ,WAMZA,SAAQ7f,GAEf,MAAO,IAAM6+D,GAAoB7+D,GAAS,GAC3C,GACF,CCAe++D,CAkChB,SAAsB/+D,GAEd4d,MAAAA,EAAS,GACX3L,IAAAA,GAAS,EACT5H,EAAQ,EACRmgB,EAAO,EAEX,OAASvY,EAAQjS,EAAMtC,QAAQ,CAC7B,MAAM08C,EAAOp6C,EAAM6hC,WAAW5vB,GAG9B,IAAI4N,EAAU,GAGZu6B,GAAS,KAATA,GACA6H,GAAkBjiD,EAAM6hC,WAAW5vB,EAAQ,KAC3CgwC,GAAkBjiD,EAAM6hC,WAAW5vB,EAAQ,IAE3CuY,EAAO,OAEJ,GAAI4vB,EAAO,IACT,oBAAoBx5B,KAAK0B,OAAOsgC,aAAaxI,MAChDv6B,EAAUyC,OAAOsgC,aAAaxI,SAG7B,GAAIA,EAAO,OAASA,EAAO,MAAO,CAC/BlT,MAAAA,EAAOlnC,EAAM6hC,WAAW5vB,EAAQ,GAElCmoC,EAAO,OAASlT,EAAO,OAASA,EAAO,OACzCrnB,EAAUyC,OAAOsgC,aAAaxI,EAAMlT,GACpC1c,EAAO,GAGP3K,EAAU,GART,MAYHA,EAAUyC,OAAOsgC,aAAaxI,GAG5Bv6B,IACFjC,EAAOrY,KAAKvF,EAAM2f,MAAMtV,EAAO4H,GAAQ+sD,mBAAmBn/C,IAC1DxV,EAAQ4H,EAAQuY,EAAO,EACvB3K,EAAU,IAGR2K,IACFvY,GAASuY,EACTA,EAAO,EAEV,CAEM5M,OAAAA,EAAOlY,KAAK,IAAM1F,EAAM2f,MAAMtV,EACtC,CAvFsB40D,CAAa3lB,GAAO,KAErC,IAACmC,EACH,OAAOz7C,EAGT,MAAMk/D,EAAQl/D,EAAM+1B,QAAQ,KACtBopC,EAAen/D,EAAM+1B,QAAQ,KAC7BqpC,EAAap/D,EAAM+1B,QAAQ,KAC3BspC,EAAQr/D,EAAM+1B,QAAQ,KAG1B,OACAmpC,EAAQ,GACPG,GAAS,GAAKH,EAAQG,GACtBF,GAAgB,GAAKD,EAAQC,GAC7BC,GAAc,GAAKF,EAAQE,GAC5B3jB,EAAS76B,KAAK5gB,EAAM2f,MAAM,EAAGu/C,IAEtBl/D,EAGF,EACR,CChCM,SAASsvC,GAAKquB,EAAO2B,GAEpB1hD,MAAAA,EAAS,GACX3L,IAAAA,GAAS,EAMb,IAJIqtD,GACF1hD,EAAOrY,KAAK43D,GAAE,OAAQ,SAGflrD,EAAQ0rD,EAAMjgE,QACjBuU,GAAO2L,EAAOrY,KAAK43D,GAAE,OAAQ,OACjCv/C,EAAOrY,KAAKo4D,EAAM1rD,IAOpB,OAJIqtD,GAAS3B,EAAMjgE,OAAS,GAC1BkgB,EAAOrY,KAAK43D,GAAE,OAAQ,OAGjBv/C,CACR,CCrBM,SAAS2hD,GAAkBlC,EAAG74D,GACnC,MAAMmI,EAAK2V,OAAO9d,EAAKmoD,YACjB6S,EAASV,GAAYnyD,EAAGm8B,eACxB72B,EAAQorD,EAAEoC,cAAc1pC,QAAQppB,GAEtC,IAAI+yD,GAEW,IAAXztD,GACForD,EAAEoC,cAAcl6D,KAAKoH,GACrB0wD,EAAEsC,eAAehzD,GAAM,EACvB+yD,EAAUrC,EAAEoC,cAAc/hE,SAE1B2/D,EAAEsC,eAAehzD,KACjB+yD,EAAUztD,EAAQ,GAGpB,MAAM2tD,EAAevC,EAAEsC,eAAehzD,GAEtC,OAAO0wD,EAAE74D,EAAM,MAAO,CACpB64D,EACE74D,EAAK8C,SACL,IACA,CACEg0C,KAAM,IAAM+hB,EAAEwC,cAAgB,MAAQL,EACtC7yD,GACE0wD,EAAEwC,cACF,SACAL,GACCI,EAAe,EAAI,IAAMA,EAAe,IAC3CE,iBAAiB,EACjBC,gBAAiB,kBAEnB,CAAC5C,GAAE,OAAQ76C,OAAOo9C,OAGvB,CC3CD,IAAIM,GAAc,CAAA,EAsClB,SAASjB,GAAO96D,EAAQg8D,EAASC,GAC/B,IAAIviE,EAAG4E,EAAG63C,EAAM+lB,EAAUlgD,EACtBrC,EAAS,GAcb,IAZuB,iBAAZqiD,IAETC,EAAeD,EACfA,EAAUlB,GAAOqB,mBAGQ,IAAhBF,IACTA,GAAc,GAGhBjgD,EA9CF,SAAwBggD,GACtB,IAAItiE,EAAG0iE,EAAIpgD,EAAQ+/C,GAAYC,GAC/B,GAAIhgD,EAAS,OAAOA,EAIftiB,IAFLsiB,EAAQ+/C,GAAYC,GAAW,GAE1BtiE,EAAI,EAAGA,EAAI,IAAKA,IACnB0iE,EAAK/9C,OAAOsgC,aAAajlD,GAErB,cAAcijB,KAAKy/C,GAErBpgD,EAAM1a,KAAK86D,GAEXpgD,EAAM1a,KAAK,KAAO,IAAM5H,EAAEU,SAAS,IAAIkrC,eAAe5pB,OAAO,IAIjE,IAAKhiB,EAAI,EAAGA,EAAIsiE,EAAQviE,OAAQC,IAC9BsiB,EAAMggD,EAAQp+B,WAAWlkC,IAAMsiE,EAAQtiE,GAGzC,OAAOsiB,CACR,CAwBSqgD,CAAeL,GAElBtiE,EAAI,EAAG4E,EAAI0B,EAAOvG,OAAQC,EAAI4E,EAAG5E,IAGhCuiE,GAFJ9lB,EAAOn2C,EAAO49B,WAAWlkC,GAErBuiE,GAAwB,KAAT9lB,GAAyBz8C,EAAI,EAAI4E,GAC9C,iBAAiBqe,KAAK3c,EAAO0b,MAAMhiB,EAAI,EAAGA,EAAI,IAChDigB,GAAU3Z,EAAO0b,MAAMhiB,EAAGA,EAAI,GAC9BA,GAAK,OAKLy8C,GAAAA,EAAO,IACTx8B,GAAUqC,EAAMm6B,QAIlB,GAAIA,GAAQ,OAAUA,GAAQ,MAA9B,CACE,GAAIA,GAAQ,OAAUA,GAAQ,OAAUz8C,EAAI,EAAI4E,IAC9C49D,EAAWl8D,EAAO49B,WAAWlkC,EAAI,KACjB,OAAUwiE,GAAY,MAAQ,CAC5CviD,GAAUohD,mBAAmB/6D,EAAOtG,GAAKsG,EAAOtG,EAAI,IACpDA,IACA,QACD,CAEHigB,GAAU,WAEX,MAEDA,GAAUohD,mBAAmB/6D,EAAOtG,IAGtC,OAAOigB,CACR,CAEDmhD,GAAOqB,aAAiB,uBACxBrB,GAAOwB,eAAiB,YAGxBljE,IAAAA,GAAiB0hE,GChFV,SAASyB,GAAOnD,EAAG74D,GACxB,MAAMi8D,EAAUj8D,EAAK+3D,cACjBmE,IAAAA,EAAS,IAQb,GANgB,cAAZD,EACFC,GAAU,KACW,SAAZD,IACTC,GAAU,KAAOl8D,EAAK5B,OAAS4B,EAAKmoD,YAAc,KAGlC,mBAAdnoD,EAAK6B,KACA82D,OAAAA,GAAE,OAAQ,KAAO34D,EAAKs8C,IAAM4f,GAGrC,MAAMC,EAAW5f,GAAIsc,EAAG74D,GAClB89B,EAAOq+B,EAAS,GAElBr+B,GAAsB,SAAdA,EAAKj8B,KACfi8B,EAAKtiC,MAAQ,IAAMsiC,EAAKtiC,MAExB2gE,EAASpxD,QAAQ4tD,GAAE,OAAQ,MAGvB9uB,MAAAA,EAAOsyB,EAASA,EAASjjE,OAAS,GAQxC,OANI2wC,GAAsB,SAAdA,EAAKhoC,KACfgoC,EAAKruC,OAAS0gE,EAEdC,EAASp7D,KAAK43D,GAAE,OAAQuD,IAGnBC,CACR,CC4DD,SAASC,GAAcp8D,GACrB,MAAM4pC,EAAS5pC,EAAK4pC,OAEpB,OAAOA,QACH5pC,EAAKJ,SAAS1G,OAAS,EACvB0wC,CACL,CC5FM,MAAMmvB,GAAW,CACtBsD,WCZK,SAAoBxD,EAAG74D,GAC5B,OAAO64D,EAAE74D,EAAM,aAAc8qC,GAAKyR,GAAIsc,EAAG74D,IAAO,GACjD,EDWCs8D,MEXK,SAAmBzD,EAAG74D,GAC3B,MAAO,CAAC64D,EAAE74D,EAAM,MAAO24D,GAAE,OAAQ,MAClC,EFUC/iB,KGbK,SAAcijB,EAAG74D,GACtB,MAAMxE,EAAQwE,EAAKxE,MAAQwE,EAAKxE,MAAQ,KAAO,GAGzCs8D,EAAO93D,EAAK83D,MAAQ93D,EAAK83D,KAAK76C,MAAM,uBAEpCha,EAAQ,CAAA,EAEV60D,IACF70D,EAAMxC,UAAY,CAAC,YAAcq3D,IAGnC,MAAMliB,EAAOijB,EAAE74D,EAAM,OAAQiD,EAAO,CAAC01D,GAAE,OAAQn9D,KAMxCq9D,OAJH74D,EAAK4kD,OACPhP,EAAK3xB,KAAO,CAAC2gC,KAAM5kD,EAAK4kD,OAGnBiU,EAAE74D,EAAK8C,SAAU,MAAO,CAAC8yC,GACjC,EHLC2mB,OIhBK,SAAuB1D,EAAG74D,GAC/B,OAAO64D,EAAE74D,EAAM,MAAOu8C,GAAIsc,EAAG74D,GAC9B,EJeCizD,SKjBK,SAAkB4F,EAAG74D,GAC1B,OAAO64D,EAAE74D,EAAM,KAAMu8C,GAAIsc,EAAG74D,GAC7B,ELgBC+6D,qBACAyB,SMZK,SAAkB3D,EAAG74D,GAC1B,MAAMy8D,EAAe5D,EAAE4D,aACnBC,IAAAA,EAAK,EAET,KAAOA,KAAMD,GAAcC,IAE3B,MAAMvU,EAAarqC,OAAO4+C,GASnB3B,OAPP0B,EAAatU,GAAc,CACzBtmD,KAAM,qBACNsmD,aACAvoD,SAAU,CAAC,CAACiC,KAAM,YAAajC,SAAUI,EAAKJ,WAC9CkD,SAAU9C,EAAK8C,UAGVi4D,GAAkBlC,EAAG,CAC1Bh3D,KAAM,oBACNsmD,aACArlD,SAAU9C,EAAK8C,UAElB,ENPCsrD,QOpBK,SAAiByK,EAAG74D,GACzB,OAAO64D,EAAE74D,EAAM,IAAMA,EAAKqqB,MAAOkyB,GAAIsc,EAAG74D,GACzC,EPmBCozD,KQnBK,SAAcyF,EAAG74D,GACf64D,OAAAA,EAAE8D,UAAY9D,EAAEC,QAAQ94D,EAAM24D,GAAE,MAAO34D,EAAKxE,QAAU,IAC9D,ERkBCohE,eSpBK,SAAwB/D,EAAG74D,GAC1B8wD,MAAAA,EAAM+H,EAAE3Q,WAAWloD,EAAKmoD,YAE1B,IAAC2I,EACH,OAAOkL,GAAOnD,EAAG74D,GAInB,MAAMiD,EAAQ,CAAC21C,IAAKtC,GAAUwa,EAAIhc,KAAO,IAAKwH,IAAKt8C,EAAKs8C,KAMxD,OAJkB,OAAdwU,EAAIhJ,YAAgC7sD,IAAd61D,EAAIhJ,QAC5B7kD,EAAM6kD,MAAQgJ,EAAIhJ,OAGb+Q,EAAE74D,EAAM,MAAOiD,EACvB,ETMCswD,MUtBK,SAAesF,EAAG74D,GAEvB,MAAMiD,EAAQ,CAAC21C,IAAKtC,GAAUt2C,EAAK80C,KAAMwH,IAAKt8C,EAAKs8C,KAMnD,OAJmB,OAAft8C,EAAK8nD,YAAiC7sD,IAAf+E,EAAK8nD,QAC9B7kD,EAAM6kD,MAAQ9nD,EAAK8nD,OAGd+Q,EAAE74D,EAAM,MAAOiD,EACvB,EVcC45D,WWxBK,SAAoBhE,EAAG74D,GACrB64D,OAAAA,EAAE74D,EAAM,OAAQ,CAAC24D,GAAE,OAAQ34D,EAAKxE,MAAM6f,QAAQ,YAAa,OACnE,EXuBCyhD,cYtBK,SAAuBjE,EAAG74D,GACzB8wD,MAAAA,EAAM+H,EAAE3Q,WAAWloD,EAAKmoD,YAE1B,IAAC2I,EACH,OAAOkL,GAAOnD,EAAG74D,GAInB,MAAMiD,EAAQ,CAAC6zC,KAAMR,GAAUwa,EAAIhc,KAAO,KAM1C,OAJkB,OAAdgc,EAAIhJ,YAAgC7sD,IAAd61D,EAAIhJ,QAC5B7kD,EAAM6kD,MAAQgJ,EAAIhJ,OAGb+Q,EAAE74D,EAAM,IAAKiD,EAAOs5C,GAAIsc,EAAG74D,GACnC,EZQCoyD,KaxBK,SAAcyG,EAAG74D,GAEtB,MAAMiD,EAAQ,CAAC6zC,KAAMR,GAAUt2C,EAAK80C,MAMpC,OAJmB,OAAf90C,EAAK8nD,YAAiC7sD,IAAf+E,EAAK8nD,QAC9B7kD,EAAM6kD,MAAQ9nD,EAAK8nD,OAGd+Q,EAAE74D,EAAM,IAAKiD,EAAOs5C,GAAIsc,EAAG74D,GACnC,EbgBCwzD,SDrBK,SAAkBqF,EAAG74D,EAAMssB,GAChC,MAAMlT,EAASmjC,GAAIsc,EAAG74D,GAChB86D,EAAQxuC,EA0EhB,SAAmBtsB,GACjB,IAAI86D,EAAQ96D,EAAK4pC,OACjB,MAAMhqC,EAAWI,EAAKJ,SAClB6N,IAAAA,GAAS,EAEN,MAACqtD,KAAWrtD,EAAQ7N,EAAS1G,QAClC4hE,EAAQsB,GAAcx8D,EAAS6N,IAG1B0uC,OAAAA,QAAQ2e,EAChB,CApFwBiC,CAAUzwC,GAAU8vC,GAAcp8D,GAEnDiD,EAAQ,CAAA,EAERovC,EAAU,GAEhB,GAA4B,kBAAjBryC,EAAK8L,QAAuB,CAErC,IAAIqiD,EAGF/0C,EAAO,IACY,YAAnBA,EAAO,GAAGvX,MACY,MAAtBuX,EAAO,GAAG+vC,QAEVgF,EAAY/0C,EAAO,IAEnB+0C,EAAY0K,EAAE,KAAM,IAAK,IACzBz/C,EAAOrO,QAAQojD,IAGbA,EAAUvuD,SAAS1G,OAAS,GAC9Bi1D,EAAUvuD,SAASmL,QAAQ4tD,GAAE,OAAQ,MAGvCxK,EAAUvuD,SAASmL,QACjB8tD,EAAE,KAAM,QAAS,CACfh3D,KAAM,WACNiK,QAAS9L,EAAK8L,QACdxJ,UAAU,KAMdW,EAAMxC,UAAY,CAAC,iBACpB,CAEGgN,IAAAA,GAAS,EAEb,OAASA,EAAQ2L,EAAOlgB,QAAQ,CAC9B,MAAM8jE,EAAQ5jD,EAAO3L,IAInBqtD,GACU,IAAVrtD,GACe,YAAfuvD,EAAMn7D,MACY,MAAlBm7D,EAAM7T,UAEN9W,EAAQtxC,KAAK43D,GAAE,OAAQ,OAGN,YAAfqE,EAAMn7D,MAAwC,MAAlBm7D,EAAM7T,SAAoB2R,EAGxDzoB,EAAQtxC,KAAKi8D,GAFb3qB,EAAQtxC,QAAQi8D,EAAMp9D,SAIzB,CAEKiqC,MAAAA,EAAOzwB,EAAOA,EAAOlgB,OAAS,GAO7B2/D,OAJHhvB,IAASixB,GAAW,YAAajxB,GAA0B,MAAjBA,EAAKsf,SACjD9W,EAAQtxC,KAAK43D,GAAE,OAAQ,OAGlBE,EAAE74D,EAAM,KAAMiD,EAAOovC,EAC7B,EChDCmK,KcxBK,SAAcqc,EAAG74D,GAEhBiD,MAAAA,EAAQ,CAAA,EACRnB,EAAO9B,EAAKk4D,QAAU,KAAO,KAC7Bzb,EAAQF,GAAIsc,EAAG74D,GACjByN,IAAAA,GAAS,EAOb,IAL0B,iBAAfzN,EAAK6F,OAAqC,IAAf7F,EAAK6F,QACzC5C,EAAM4C,MAAQ7F,EAAK6F,SAIZ4H,EAAQgvC,EAAMvjD,QAAQ,CAC7B,MAAMwmD,EAAOjD,EAAMhvC,GAEnB,GACgB,YAAdiyC,EAAK79C,MACY,OAAjB69C,EAAKyJ,SACLzJ,EAAKtY,YACL/tC,MAAMC,QAAQomD,EAAKtY,WAAW3mC,YAC9Bi/C,EAAKtY,WAAW3mC,UAAU4O,SAAS,kBACnC,CACApM,EAAMxC,UAAY,CAAC,sBACnB,KACD,CACF,CAED,OAAOo4D,EAAE74D,EAAM8B,EAAMmB,EAAO6nC,GAAK2R,GAAO,GACzC,EdHC0R,Ue7BK,SAAmB0K,EAAG74D,GAC3B,OAAO64D,EAAE74D,EAAM,IAAKu8C,GAAIsc,EAAG74D,GAC5B,Ef4BCgX,KgB5BK,SAAc6hD,EAAG74D,GAEf64D,OAAAA,EAAEC,QAAQ94D,EAAM24D,GAAE,OAAQ7tB,GAAKyR,GAAIsc,EAAG74D,KAC9C,EhB0BCm0D,OiB/BK,SAAgB0E,EAAG74D,GACxB,OAAO64D,EAAE74D,EAAM,SAAUu8C,GAAIsc,EAAG74D,GACjC,EjB8BCi9D,MkB3BK,SAAepE,EAAG74D,GACvB,MAAMk9D,EAAOl9D,EAAKJ,SACd6N,IAAAA,GAAS,EACb,MAAMnO,EAAQU,EAAKV,OAAS,GAEtB8Z,EAAS,GAEf,OAAS3L,EAAQyvD,EAAKhkE,QAAQ,CAC5B,MAAMw5C,EAAMwqB,EAAKzvD,GAAO7N,SAClBkC,EAAiB,IAAV2L,EAAc,KAAO,KAE5B0vD,EAAM,GACRC,IAAAA,GAAa,EACjB,MAAMlkE,EAAS8G,EAAKV,MAAQA,EAAMpG,OAASw5C,EAAIx5C,OAE/C,OAASkkE,EAAYlkE,GAAQ,CAC3B,MAAMmkE,EAAO3qB,EAAI0qB,GACjBD,EAAIp8D,KACF83D,EAAEwE,EAAMv7D,EAAM,CAACxC,MAAOA,EAAM89D,IAAaC,EAAO9gB,GAAIsc,EAAGwE,GAAQ,IAElE,CAEDjkD,EAAO3L,GAASorD,EAAEqE,EAAKzvD,GAAQ,KAAMq9B,GAAKqyB,GAAK,GAChD,CAED,OAAOtE,EACL74D,EACA,QACA8qC,GACE,CAAC+tB,EAAEz/C,EAAO,GAAGtW,SAAU,QAASgoC,GAAK,CAAC1xB,EAAO,KAAK,KAAQtR,OACxDsR,EAAO,GACHy/C,EACE,CACEhzD,MAAOq0D,GAAW9gD,EAAO,IACzBrT,IAAKo0D,GAAS/gD,EAAOA,EAAOlgB,OAAS,KAEvC,QACA4xC,GAAK1xB,EAAO+B,MAAM,IAAI,IAExB,KAEN,GAGL,ElBhBCpN,KmBjCK,SAAc8qD,EAAG74D,GACf64D,OAAAA,EAAEC,QACP94D,EACA24D,GAAE,OAAQ76C,OAAO9d,EAAKxE,OAAO6f,QAAQ,0BAA2B,OAEnE,EnB6BCgyC,coBlCK,SAAuBwL,EAAG74D,GAC/B,OAAO64D,EAAE74D,EAAM,KAChB,EpBiCCs9D,KAAMC,GACNC,KAAMD,GACNrV,WAAYqV,GACZE,mBAAoBF,IAItB,SAASA,KACP,OAAO,IACR,CqB8CD,MAAMljB,GAAM,CAAA,EAAGvgD,eAQf,SAAS8/D,GAAQje,EAAMz5C,GACrB,MAAMgtC,EAAWhtC,GAAW,GACtBy6D,EAAYztB,EAASwuB,qBAAsB,EAE3CjB,EAAe,CAAA,EA+BrB,OA7BA5D,EAAE8D,UAAYA,EACd9D,EAAEwC,mBAC2BpgE,IAA3Bi0C,EAASmsB,eAA0D,OAA3BnsB,EAASmsB,cAC7C,gBACAnsB,EAASmsB,cACfxC,EAAE8E,cAAgBzuB,EAASyuB,eAAiB,YAC5C9E,EAAE+E,kBAAoB1uB,EAAS0uB,mBAAqB,kBACpD/E,EAAE3Q,W7B5GG,SAAqBloD,GAE1B,MAAMyb,EAAQ9hB,OAAOylB,OAAO,MAE5B,IAAKpf,IAASA,EAAK6B,KACjB,MAAM,IAAItF,MAAM,wCAKlB,OAFAu9D,GAAM95D,EAAM,cAKH69D,SAAa3V,GACpB,MAAM//C,EAAKiyD,GAAMlS,EAAWC,YACxBhgD,IAAOkyC,GAAItgD,KAAK0hB,EAAOtT,KACzBsT,EAAMtT,GAAM+/C,EAEf,IAQQ4V,SAAc3V,GACrB,MAAMhgD,EAAKiyD,GAAMjS,GACjB,OAAOhgD,GAAMkyC,GAAItgD,KAAK0hB,EAAOtT,GAAMsT,EAAMtT,GAAM,IAChD,CACF,C6B8EgB41D,CAAYpiB,GAC3Bkd,EAAE4D,aAAeA,EAEjB5D,EAAEoC,cAAgB,GAElBpC,EAAEsC,eAAiB,GACnBtC,EAAEC,QAAUA,EACZD,EAAEE,SAAW,IAAIA,MAAa7pB,EAAS6pB,UACvCF,EAAEK,eAAiBhqB,EAASgqB,eAC5BL,EAAEG,YAAc9pB,EAAS8pB,YAEzBc,GAAMne,EAAM,sBAAuBuM,IACjC,MAAM//C,EAAK2V,OAAOoqC,EAAWC,YAAYpjB,cAIpCsV,GAAItgD,KAAK0iE,EAAct0D,KAC1Bs0D,EAAat0D,GAAM+/C,EACpB,IAII2Q,EAQP,SAASC,EAAQ7b,EAAMC,GAEjBD,GAAAA,GAAQ,SAAUA,GAAQA,EAAKh5B,KAAM,CAEvC,MAAMA,EAAOg5B,EAAKh5B,KAEdA,EAAK+5C,QACY,YAAf9gB,EAAMr7C,OACRq7C,EAAQ,CACNr7C,KAAM,UACNsnD,QAAS,GACT/hB,WAAY,CAHN,EAINxnC,SAAU,KAIds9C,EAAMiM,QAAUllC,EAAK+5C,OAGJ,YAAf9gB,EAAMr7C,MAAsBoiB,EAAKg6C,cACnC/gB,EAAM9V,WAAa,IAAI8V,EAAM9V,cAAenjB,EAAKg6C,cAG/C,aAAc/gB,GAASA,EAAMt9C,UAAYqkB,EAAKi6C,YAChDhhB,EAAMt9C,SAAWqkB,EAAKi6C,UAEzB,CAED,GAAIjhB,EAAM,CACR,MAAM3gD,EAAM,SAAU2gD,EAAOA,EAAO,CAACn6C,SAAUm6C,ICjK3Bj9C,EDmKL1D,IChKhB0D,EAAK8C,UACL9C,EAAK8C,SAAS+C,OACd7F,EAAK8C,SAAS+C,MAAMmuC,MACpBh0C,EAAK8C,SAAS+C,MAAMouC,QACpBj0C,EAAK8C,SAASiD,KACd/F,EAAK8C,SAASiD,IAAIiuC,MAClBh0C,EAAK8C,SAASiD,IAAIkuC,SD2JfiJ,EAAMp6C,SAAW,CAAC+C,MAAOq0D,GAAW59D,GAAMyJ,IAAKo0D,GAAS79D,IAE3D,CCtKE,IAAmB0D,EDwKtB,OAAOk9C,CACR,CAOQ2b,SAAAA,EAAE74D,EAAMmpD,EAASlmD,EAAOrD,GAOxBk5D,OANHz/D,MAAMC,QAAQ2J,KAChBrD,EAAWqD,EACXA,EAAQ,CAAA,GAIH61D,EAAQ94D,EAAM,CACnB6B,KAAM,UACNsnD,UACA/hB,WAAYnkC,GAAS,CAHF,EAInBrD,SAAUA,GAAY,IAEzB,CACF,CASM,SAASu+D,GAAOxiB,EAAMz5C,GAC3B,MAAM22D,EAAIe,GAAQje,EAAMz5C,GAClBlC,EAAOo8C,GAAIyc,EAAGld,EAAM,MACpByiB,EE9MD,SAAgBvF,GACjBprD,IAAAA,GAAS,EAEP4wD,MAAAA,EAAY,GAEX,OAAE5wD,EAAQorD,EAAEoC,cAAc/hE,QAAQ,CACvC,MAAM43D,EAAM+H,EAAE4D,aAAa5D,EAAEoC,cAAcxtD,GAAOs3B,eAE9C,IAAC+rB,EACH,SAGF,MAAMnS,EAAUpC,GAAIsc,EAAG/H,GACjB3oD,EAAK2V,OAAOgzC,EAAI3I,YAChB6S,EAASV,GAAYnyD,EAAGm8B,eAC1Bg6B,IAAAA,EAAiB,EAEfC,MAAAA,EAAiB,GAEhB,OAAED,GAAkBzF,EAAEsC,eAAehzD,IAAK,CAE/C,MAAMq2D,EAAgB,CACpB38D,KAAM,UACNsnD,QAAS,IACT/hB,WAAY,CACV0P,KACE,IACA+hB,EAAEwC,cACF,SACAL,GACCsD,EAAiB,EAAI,IAAMA,EAAiB,IAC/CG,qBAAqB,EACrBh+D,UAAW,CAAC,yBACZi+D,UAAW7F,EAAE+E,mBAEfh+D,SAAU,CAAC,CAACiC,KAAM,OAAQrG,MAAO,OAG/B8iE,EAAiB,GACnBE,EAAc5+D,SAASmB,KAAK,CAC1Bc,KAAM,UACNsnD,QAAS,MACTvpD,SAAU,CAAC,CAACiC,KAAM,OAAQrG,MAAOsiB,OAAOwgD,OAIxCC,EAAerlE,OAAS,GAC1BqlE,EAAex9D,KAAK,CAACc,KAAM,OAAQrG,MAAO,MAG5C+iE,EAAex9D,KAAKy9D,EACrB,CAEK30B,MAAAA,EAAO8U,EAAQA,EAAQzlD,OAAS,GAEtC,GAAI2wC,GAAsB,YAAdA,EAAKhoC,MAAuC,MAAjBgoC,EAAKsf,QAAiB,CAC3D,MAAMwV,EAAW90B,EAAKjqC,SAASiqC,EAAKjqC,SAAS1G,OAAS,GAClDylE,GAA8B,SAAlBA,EAAS98D,KACvB88D,EAASnjE,OAAS,IAElBquC,EAAKjqC,SAASmB,KAAK,CAACc,KAAM,OAAQrG,MAAO,MAG3CquC,EAAKjqC,SAASmB,QAAQw9D,EACvB,MACC5f,EAAQ59C,QAAQw9D,GAIlB,MAAM/K,EAAW,CACf3xD,KAAM,UACNsnD,QAAS,KACT/hB,WAAY,CAACj/B,GAAI0wD,EAAEwC,cAAgB,MAAQL,GAC3Cp7D,SAAUkrC,GAAK6T,GAAS,IAGtBmS,EAAIhuD,WACN0wD,EAAS1wD,SAAWguD,EAAIhuD,UAG1Bu7D,EAAUt9D,KAAKyyD,EAChB,CAED,OAAyB,IAArB6K,EAAUnlE,OACL,KAGF,CACL2I,KAAM,UACNsnD,QAAS,UACT/hB,WAAY,CAACw3B,eAAe,EAAMn+D,UAAW,CAAC,cAC9Cb,SAAU,CACR,CACEiC,KAAM,UACNsnD,QAAS,KACT/hB,WAAY,CAACj/B,GAAI,iBAAkB1H,UAAW,CAAC,YAC/Cb,SAAU,CAAC+4D,GAAE,OAAQE,EAAE8E,iBAEzB,CAAC97D,KAAM,OAAQrG,MAAO,MACtB,CACEqG,KAAM,UACNsnD,QAAS,KACT/hB,WAAY,CAHd,EAIExnC,SAAUkrC,GAAKuzB,GAAW,IAE5B,CAACx8D,KAAM,OAAQrG,MAAO,OAG3B,CFkGcqjE,CAAOhG,GASpB,OAPIuF,GAIFp+D,EAAKJ,SAASmB,KAAK43D,GAAE,OAAQ,MAAOyF,GAG/B/kE,MAAMC,QAAQ0G,GAAQ,CAAC6B,KAAM,OAAQjC,SAAUI,GAAQA,CAC/D,CG3LD,IAAA8+D,GAPI,SAAU9iB,EAAa95C,GACrB,OAAO85C,GAAe,QAASA,EAcrC,SAAgBA,EAAa95C,GAC3B,MAAO,CAAClC,EAAM60C,EAAMnS,KAClBsZ,EAAY9C,IAAIilB,GAAOn+D,EAAMkC,GAAU2yC,GAAOvzC,IAC5CohC,EAAKphC,EAAL,GADF,CAIH,CAnBSy9D,CAAO/iB,EAAa95C,GA2B9B,SAAgBA,GAEd,OAAQlC,GAASm+D,GAAOn+D,EAAMkC,EAC/B,CA7BS88D,CAAOhjB,GAAe95C,EAC3B,ECpCE,MAAM+8D,GAOXhmE,WAAAA,CAAY+1B,EAAUkwC,EAAQC,GACvBnwC,KAAAA,SAAWA,EACXkwC,KAAAA,OAASA,EACVC,IACGA,KAAAA,MAAQA,EAEhB,ECPI,SAASv7B,GAAMm6B,EAAaoB,GAE3BnwC,MAAAA,EAAW,CAAA,EAEXkwC,EAAS,CAAA,EACXzxD,IAAAA,GAAS,EAEb,OAASA,EAAQswD,EAAY7kE,QAC3BS,OAAOqpC,OAAOhU,EAAU+uC,EAAYtwD,GAAOuhB,UAC3Cr1B,OAAOqpC,OAAOk8B,EAAQnB,EAAYtwD,GAAOyxD,QAGpC,OAAA,IAAID,GAAOjwC,EAAUkwC,EAAQC,EACrC,CCrBM,SAAS7oB,GAAU96C,GACjBA,OAAAA,EAAM8oC,aACd,CFiBD26B,GAAOrlE,UAAUo1B,SAAW,GAE5BiwC,GAAOrlE,UAAUslE,OAAS,GAE1BD,GAAOrlE,UAAUulE,MAAQ,KG3BlB,MAAMC,GAMXnmE,WAAAA,CAAY+1B,EAAUqwC,GAEfrwC,KAAAA,SAAWA,EAEXqwC,KAAAA,UAAYA,CAClB,EAIHD,GAAKxlE,UAAUulE,MAAQ,KACvBC,GAAKxlE,UAAU0lE,SAAU,EACzBF,GAAKxlE,UAAU2lE,YAAa,EAC5BH,GAAKxlE,UAAU4lE,mBAAoB,EACnCJ,GAAKxlE,UAAUyK,QAAS,EACxB+6D,GAAKxlE,UAAU6lE,gBAAiB,EAChCL,GAAKxlE,UAAU8lE,gBAAiB,EAChCN,GAAKxlE,UAAU+lE,uBAAwB,EACvCP,GAAKxlE,UAAUgmE,iBAAkB,EACjCR,GAAKxlE,UAAU0uD,SAAU,ECxBzB,IAAIuX,GAAS,EAEN,MAAMP,GAAUQ,KACVP,GAAaO,KACbN,GAAoBM,KACpBz7D,GAASy7D,KACTJ,GAAiBI,KACjBL,GAAiBK,KACjBH,GAAwBG,KAErC,SAASA,KACA,OAAA,KAAOD,EACf,6JCPD,MAAMtG,GAAS5/D,OAAOP,KAAKqe,IAEpB,MAAMsoD,WAAoBX,GAQ/BnmE,WAAAA,CAAY+1B,EAAUqwC,EAAWW,EAAMb,GACjC1xD,IAAAA,GAAS,EAMb,GAJMuhB,MAAAA,EAAUqwC,GAEhBY,GAAK5iE,KAAM,QAAS8hE,GAEA,iBAATa,EACT,OAASvyD,EAAQ8rD,GAAOrgE,QAAQ,CAC9B,MAAMilD,EAAQob,GAAO9rD,GACrBwyD,GAAK5iE,KAAMk8D,GAAO9rD,IAASuyD,EAAOvoD,GAAM0mC,MAAY1mC,GAAM0mC,GAC3D,CAEJ,EAUH,SAAS8hB,GAAKtmD,EAAQ3f,EAAKwB,GACrBA,IAEFme,EAAO3f,GAAOwB,EAEjB,CAZDukE,GAAYnmE,UAAU0uD,SAAU,ECbhC,MAAMjO,GAAM,CAAA,EAAGvgD,eAMR,SAASslB,GAAO8oC,GAEfl5B,MAAAA,EAAW,CAAA,EAEXkwC,EAAS,CAAA,EAEf,IAAIj7B,EAEJ,IAAKA,KAAQikB,EAAW9gB,WAClBiT,GAAAA,GAAItgD,KAAKmuD,EAAW9gB,WAAYnD,GAAO,CACzC,MAAMzoC,EAAQ0sD,EAAW9gB,WAAWnD,GAC9B+T,EAAO,IAAI+nB,GACf97B,EACAikB,EAAW3rC,UAAU2rC,EAAWgY,YAAc,CAAA,EAAIj8B,GAClDzoC,EACA0sD,EAAWiX,OAIXjX,EAAW0X,iBACX1X,EAAW0X,gBAAgBvwD,SAAS40B,KAEpC+T,EAAK4nB,iBAAkB,GAGzB5wC,EAASiV,GAAQ+T,EAEjBknB,EAAO5oB,GAAUrS,IAASA,EAC1Bi7B,EAAO5oB,GAAU0B,EAAKqnB,YAAcp7B,CACrC,CAGI,OAAA,IAAIg7B,GAAOjwC,EAAUkwC,EAAQhX,EAAWiX,MAChD,CCvDM,MAAMgB,GAAQ/gD,GAAO,CAC1B+/C,MAAO,QACP5iD,UAAS,CAAC3T,EAAGq7B,IACJ,SAAWA,EAAK9oB,MAAM,GAAGmpB,cAElC8C,WAAY,CACVg5B,aAAc,KACdC,aAAc,KACdC,UAAW,KACXC,UAAW,KACXC,UAAW,KACXC,WAAY,KACZC,UAAW,QCZFC,GAAMvhD,GAAO,CACxB+/C,MAAO,MACP5iD,UAAS,CAAC3T,EAAGq7B,IACJ,OAASA,EAAK9oB,MAAM,GAAGmpB,cAEhC8C,WAAY,CAACw5B,QAAS,KAAMC,QAAS,KAAMC,SAAU,QCFhD,SAASC,GAAuBb,EAAYb,GAC1CA,OAAAA,KAAaa,EAAaA,EAAWb,GAAaA,CAC1D,CCAM,SAAS2B,GAAyBd,EAAYlxC,GAC5C+xC,OAAAA,GAAuBb,EAAYlxC,EAASsV,cACpD,CCNM,MAAM28B,GAAQ7hD,GAAO,CAC1B+/C,MAAO,QACPe,WAAY,CAACgB,WAAY,eACzB3kD,UAAWykD,GACX55B,WAAY,CAAC65B,MAAO,KAAME,WAAY,QCJ3BC,GAAOhiD,GAAO,CACzB7C,UAAS,CAAC3T,EAAGq7B,IACK,SAATA,EAAkBA,EAAO,QAAUA,EAAK9oB,MAAM,GAAGmpB,cAE1D8C,WAAY,CACVi6B,qBAAsB,KACtBC,WAAY/B,GACZgC,iBAAkB,KAClBC,SAAUjC,GACVkC,YAAalC,GACbmC,aAAcr9D,GACds9D,aAAct9D,GACdu9D,YAAav9D,GACbw9D,aAAcnC,GACdoC,YAAa,KACbvG,gBAAiBmE,GACjBqC,YAAa,KACbC,aAAczC,GACd0C,eAAgBvC,GAChBwC,iBAAkB,KAClBC,aAAc5C,GACd6C,WAAY1C,GACZ2C,YAAa9C,GACb+C,aAAc,KACdC,WAAYhD,GACZiD,YAAa,KACbC,iBAAkB,KAClB/D,UAAW,KACXgE,eAAgBhD,GAChBiD,UAAWt+D,GACXu+D,SAAU,KACVC,UAAWtD,GACXuD,cAAevD,GACfwD,oBAAqBxD,GACrByD,gBAAiB,KACjBC,SAAUvD,GACVwD,gBAAiB,KACjBC,aAAc9+D,GACd++D,YAAa7D,GACb8D,aAAc9D,GACd+D,aAAc,KACdC,aAAchE,GACdiE,oBAAqB9D,GACrB+D,aAAcp/D,GACdq/D,aAAcr/D,GACds/D,YAAat/D,GACbu/D,aAAcrE,GACdsE,YAAax/D,GACby/D,SAAU,KACVC,aAAc1/D,GACd2/D,aAAc3/D,GACd4/D,aAAc5/D,GACd6/D,cAAe,KACfC,KAAM,QC7CG/Q,GAAOh0C,GAAO,CACzB+/C,MAAO,OACPe,WAAY,CACVkE,cAAe,iBACfC,UAAW,QACXC,QAAS,MACTC,UAAW,cAEbhoD,UAAWykD,GACXpB,gBAAiB,CAAC,UAAW,WAAY,QAAS,YAClDx4B,WAAY,CAEVo9B,KAAM,KACNC,OAAQhF,GACRiF,cAAehF,GACfiF,UAAWjF,GACXvrC,OAAQ,KACRywC,MAAO,KACPC,gBAAiBvF,GACjBwF,oBAAqBxF,GACrByF,eAAgBzF,GAChBhjB,IAAK,KACL0oB,GAAI,KACJC,MAAO3F,GACP4F,eAAgB,KAChBC,aAAczF,GACd0F,UAAW9F,GACX+F,SAAU/F,GACVgG,QAAShG,GACTiG,QAAS,KACTz5D,QAASwzD,GACTkG,KAAM,KACN/kE,UAAWi/D,GACX+F,KAAMphE,GACNqhE,QAAS,KACT/mB,QAAS,KACTgnB,gBAAiBpG,GACjBqG,SAAUtG,GACVuG,aAAcnG,GACdoG,OAAQzhE,GAASo7D,GACjBsG,YAAa,KACb9hD,KAAM,KACN+hD,SAAU,KACVC,SAAU,KACV7kE,QAASk+D,GACTh+B,MAAOg+B,GACPztB,IAAK,KACLq0B,QAAS,KACT5jE,SAAUg9D,GACV6G,SAAU3G,GACV4G,UAAW7G,GACX8G,QAAS,KACTC,aAAc,KACdC,KAAM,KACNC,WAAY,KACZC,YAAa,KACbC,WAAY,KACZC,eAAgBrH,GAChBsH,WAAY,KACZC,QAASnH,GACTvzD,OAAQ9H,GACRyiE,OAAQxH,GACR1sC,KAAMvuB,GACNyyC,KAAM,KACNiwB,SAAU,KACVC,QAAStH,GACTuH,UAAWvH,GACXv3D,GAAI,KACJ++D,WAAY,KACZC,YAAa,KACbC,UAAW,KACXC,UAAW,KACXnsE,GAAI,KACJ+c,MAAOqnD,GACPgI,OAAQ,KACRC,SAAU7H,GACV8H,QAAS9H,GACT+H,UAAWnI,GACXoI,SAAUhI,GACV5W,KAAM,KACN1qD,MAAO,KACP05D,KAAM,KACN6P,SAAU,KACVnrB,KAAM,KACNr3C,QAAS,KACTyiE,KAAMtI,GACN3sC,IAAKtuB,GACLwjE,SAAU,KACV/hE,IAAK,KACLomB,UAAW7nB,GACXyoD,MAAO,KACPrnB,OAAQ,KACRp/B,IAAK,KACL9L,UAAW8J,GACXyjE,SAAUxI,GACVyI,MAAOzI,GACPx9D,KAAM,KACNkmE,MAAO,KACPC,SAAU3I,GACV4I,WAAY5I,GACZ6I,QAAS,KACTC,aAAc,KACdC,WAAY,KACZC,cAAe,KACfC,eAAgB,KAChBn5D,OAAQ,KACRo5D,SAAU,KACVC,UAAW,KACXC,iBAAkB,KAClBjmE,SAAU,KACV2J,QAAS,KACT3D,QAAS,KACTkgE,cAAe,KACfC,cAAe,KACfC,kBAAmB,KACnBC,OAAQ,KACRC,YAAa,KACbC,MAAO,KACPC,WAAY,KACZC,OAAQ,KACRC,UAAW,KACXC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,OAAQ,KACRC,iBAAkB,KAClBC,UAAW,KACXC,QAAS,KACTC,QAAS,KACTC,QAAS,KACTC,WAAY,KACZC,aAAc,KACdC,QAAS,KACTC,UAAW,KACXj7D,UAAW,KACXk7D,WAAY,KACZC,QAAS,KACTC,iBAAkB,KAClBC,OAAQ,KACRC,aAAc,KACdC,iBAAkB,KAClBC,UAAW,KACXC,YAAa,KACbC,UAAW,KACXC,eAAgB,KAChBC,YAAa,KACbC,aAAc,KACdC,aAAc,KACdC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,UAAW,KACXC,UAAW,KACXC,SAAU,KACVC,WAAY,KACZC,WAAY,KACZC,QAAS,KACTC,QAAS,KACTC,OAAQ,KACRC,UAAW,KACXC,WAAY,KACZC,WAAY,KACZC,aAAc,KACdC,mBAAoB,KACpBC,QAAS,KACTC,SAAU,KACVC,SAAU,KACVC,0BAA2B,KAC3BC,SAAU,KACVC,UAAW,KACXC,SAAU,KACVC,aAAc,KACdC,UAAW,KACXC,UAAW,KACXC,SAAU,KACVC,UAAW,KACXC,aAAc,KACdC,SAAU,KACVC,qBAAsB,KACtBC,SAAU,KACVC,eAAgB,KAChBC,UAAW,KACXC,QAAS,KACTjrB,KAAMqd,GACN6N,QAAS9oE,GACT2gC,QAAS,KACTooC,KAAM1N,GACNjjD,YAAa,KACb4wD,YAAa/N,GACbgO,OAAQ,KACRC,QAAS,KACTnjE,SAAUk1D,GACVkO,eAAgB,KAChBC,IAAK/N,GACLr9D,SAAUi9D,GACVoO,SAAUpO,GACVpC,KAAM74D,GACNspE,QAAStpE,GACTupE,QAASlO,GACTmO,MAAO,KACPC,OAAQxO,GACRyO,SAAUzO,GACV7sB,SAAU6sB,GACV96D,MAAO,KACPyF,KAAM5F,GACN2pE,MAAO,KACPC,KAAM,KACNC,KAAM7pE,GACN8pE,WAAY5O,GACZ3mB,IAAK,KACLw1B,OAAQ,KACRC,QAAS,KACTC,OAAQ,KACRzoE,MAAOxB,GACPwC,KAAM,KACN/H,MAAO,KACPyvE,SAAUlqE,GACVgB,OAAQ,KACRyiD,MAAO,KACP0mB,UAAW,KACX3sE,KAAM,KACN4sE,cAAenP,GACfoP,OAAQ,KACRlzE,MAAO+jE,GACPxgE,MAAOsF,GACPymC,KAAM,KAINxrC,MAAO,KACPqvE,MAAO,KACPC,QAASlP,GACTmP,KAAM,KACNC,WAAY,KACZC,QAAS,KACTnhE,OAAQvJ,GACR2qE,YAAa,KACbC,aAAc5qE,GACd6qE,YAAa,KACbC,YAAa,KACbrrB,KAAM,KACNsrB,QAAS,KACTC,QAAS,KACTzrD,MAAO,KACPgyB,KAAM,KACN05B,SAAU,KACVC,SAAU,KACVhuE,MAAO,KACPylC,QAASs4B,GACTkQ,QAASlQ,GACT/Z,MAAO,KACPkqB,KAAM,KACNC,MAAO,KACPC,YAAa,KACbC,OAAQvrE,GACRwrE,WAAYxrE,GACZ+tD,KAAM,KACN0d,SAAU,KACVC,OAAQ,KACRC,aAAc3rE,GACd4rE,YAAa5rE,GACb6rE,SAAU5Q,GACV6Q,OAAQ7Q,GACR8Q,QAAS9Q,GACTvsB,OAAQusB,GACRp7D,OAAQ,KACRmsE,QAAS,KACTC,OAAQ,KACRC,IAAK,KACLC,YAAansE,GACbosE,MAAO,KACPC,OAAQ,KACRC,UAAWpR,GACXqR,QAAS,KACTC,QAAS,KACT9iE,KAAM,KACN+iE,UAAWzsE,GACX0sE,UAAW,KACXC,QAAS,KACTC,OAAQ,KACRC,MAAO,KACPC,OAAQ9sE,GAGR+sE,kBAAmB,KACnBC,YAAa,KACbC,SAAU,KACVC,wBAAyBjS,GACzBkS,sBAAuBlS,GACvB3uB,OAAQ,KACR3hB,SAAU,KACVyiD,QAASptE,GACTqtE,SAAU,KACVC,aAAc,QCxSLC,GAAMxyD,GAAO,CACxB+/C,MAAO,MACPe,WAAY,CACV2R,aAAc,gBACdC,kBAAmB,qBACnBC,WAAY,cACZC,cAAe,iBACfC,UAAW,aACXxxE,UAAW,QACXyxE,SAAU,YACVC,SAAU,YACVC,mBAAoB,sBACpBC,0BAA2B,8BAC3BC,aAAc,gBACdC,eAAgB,kBAChBxM,YAAa,cACbyM,SAAU,WACVC,iBAAkB,oBAClBC,iBAAkB,oBAClBC,YAAa,eACbC,SAAU,YACVC,WAAY,cACZC,aAAc,gBACdC,WAAY,cACZ9kE,SAAU,YACV+kE,eAAgB,mBAChBC,YAAa,eACbC,UAAW,aACXC,YAAa,eACb/kE,WAAY,cACZglE,UAAW,aACXC,2BAA4B,+BAC5BC,yBAA0B,6BAC1BvM,SAAU,WACVwM,UAAW,cACXC,aAAc,iBACdC,aAAc,iBACdC,eAAgB,kBAChBC,cAAe,iBACfC,cAAe,iBACfC,UAAW,aACXC,UAAW,aACXC,YAAa,eACbC,QAAS,WACTC,YAAa,gBACbC,aAAc,iBACdC,QAAS,WACTC,QAAS,WACTC,QAAS,WACTC,SAAU,YACVC,MAAO,SACPC,UAAW,cACXC,WAAY,eACZtM,QAAS,UACTuM,WAAY,aACZtM,aAAc,eACdE,cAAe,gBACfqM,QAAS,UACTnM,SAAU,WACVC,UAAW,YACXC,iBAAkB,mBAClBjmE,SAAU,WACV2J,QAAS,UACT3D,QAAS,UACTqgE,OAAQ,SACRC,YAAa,cACbC,MAAO,QACPC,WAAY,aACZC,OAAQ,SACRC,UAAW,YACXC,YAAa,cACbC,WAAY,aACZC,YAAa,cACbC,WAAY,aACZC,YAAa,cACbC,OAAQ,SACRC,iBAAkB,mBAClBC,UAAW,YACXiL,MAAO,QACPhL,QAAS,UACTC,QAAS,UACTC,QAAS,UACT+K,UAAW,YACXC,WAAY,aACZ9K,aAAc,eACdC,QAAS,UACTC,UAAW,YACXj7D,UAAW,YACXk7D,WAAY,aACZC,QAAS,UACTE,OAAQ,SACRC,aAAc,eACdC,iBAAkB,mBAClBE,YAAa,cACbC,UAAW,YACXE,YAAa,cACbC,aAAc,eACdC,aAAc,eACdC,YAAa,cACbC,WAAY,aACZC,YAAa,cACbC,UAAW,YACX4J,aAAc,eACd3J,UAAW,YACXC,SAAU,WACVC,WAAY,aACZC,WAAY,aACZC,QAAS,UACTC,QAAS,UACTC,OAAQ,SACRC,UAAW,YACXC,WAAY,aACZC,WAAY,aACZC,aAAc,eACdkJ,SAAU,WACVhJ,QAAS,UACTC,SAAU,WACVC,SAAU,WACVE,SAAU,WACVC,UAAW,YACXC,SAAU,WACV2I,OAAQ,SACRzI,UAAW,YACXC,UAAW,YACXC,SAAU,WACVC,UAAW,YACXC,aAAc,eACdC,SAAU,WACVE,SAAU,WACVC,eAAgB,iBAChBC,UAAW,YACXiI,OAAQ,SACRC,iBAAkB,oBAClBC,kBAAmB,qBACnBC,WAAY,cACZC,QAAS,WACTC,cAAe,iBACf/H,eAAgB,iBAChBgI,gBAAiB,mBACjBC,eAAgB,kBAChBC,UAAW,aACXC,YAAa,eACbC,sBAAuB,yBACvBC,uBAAwB,0BACxBC,gBAAiB,mBACjBC,iBAAkB,oBAClBC,cAAe,iBACfC,eAAgB,kBAChBC,iBAAkB,oBAClBC,cAAe,iBACfC,YAAa,eACb7H,SAAU,WACV8H,WAAY,cACZC,eAAgB,kBAChBC,cAAe,iBACfC,OAAQ,SACRC,kBAAmB,qBACnBC,mBAAoB,sBACpBC,YAAa,eACbC,aAAc,gBACdC,WAAY,eACZC,YAAa,eACbC,SAAU,YACVC,aAAc,gBACdC,cAAe,iBACfC,aAAc,gBACdC,SAAU,aACVC,YAAa,gBACbC,YAAa,gBACbC,YAAa,eACbC,YAAa,eACbC,QAAS,WAETC,cAAe,gBACfC,cAAe,iBAEjBn7D,UAAWwkD,GACX35B,WAAY,CACVuwC,MAAOhY,GACPkS,aAAcxtE,GACduzE,WAAY,KACZC,SAAU,KACV/F,kBAAmB,KACnBgG,WAAYzzE,GACZ0zE,UAAW1zE,GACX0tE,WAAY,KACZiG,OAAQ3zE,GACR4zE,cAAe,KACfC,cAAe,KACfC,QAAS9zE,GACT+zE,UAAW,KACXpG,cAAe,KACfqG,cAAe,KACfC,YAAa,KACbC,KAAM,KACNC,MAAO,KACPC,KAAMp0E,GACNq0E,GAAI,KACJC,SAAU,KACV1G,UAAW5tE,GACX5D,UAAWi/D,GACXkZ,KAAM,KACN1G,SAAU,KACV2G,cAAe,KACf1G,SAAU,KACV5wE,MAAO,KACP6wE,mBAAoB,KACpBC,0BAA2B,KAC3BC,aAAc,KACdC,eAAgB,KAChB5zB,QAAS,KACTm6B,kBAAmB,KACnBC,iBAAkB,KAClBhT,YAAa,KACbiT,OAAQ,KACRp1E,GAAI,KACJq1E,GAAI,KACJvhB,EAAG,KACH8a,SAAU,KACV0G,cAAe,KACfC,QAAS90E,GACT+0E,gBAAiB/0E,GACjBkB,UAAW,KACXvG,QAAS,KACTq6E,IAAK,KACLhzC,QAAShiC,GACTouE,iBAAkB,KAClBtM,SAAU7G,GACVga,GAAI,KACJC,GAAI,KACJC,SAAU,KACVC,SAAU,KACV35E,UAAWuE,GACXquE,iBAAkB,KAClB3sE,IAAK,KACLw/C,MAAO,KACPm0B,SAAUr1E,GACVs1E,0BAA2B,KAC3BhyC,KAAM,KACNgrC,YAAatuE,GACbuuE,SAAU,KACV5qE,OAAQ,KACR4xE,UAAW,KACXC,YAAa,KACbhH,WAAY,KACZC,aAAc,KACdgH,UAAW,KACXC,eAAgB,KAChBhH,WAAY,KACZ9kE,SAAU,KACV+kE,eAAgB,KAChBC,YAAa,KACbC,UAAW,KACXC,YAAa,KACb/kE,WAAY,KACZ4rE,OAAQ,KACRC,GAAI,KACJt9B,KAAM,KACNu9B,GAAI,KACJC,GAAI,KACJC,GAAI3a,GACJ4a,GAAI5a,GACJ2T,UAAW3T,GACX4T,2BAA4B,KAC5BC,yBAA0B,KAC1BgH,SAAU,KACVC,kBAAmB,KACnBC,cAAe,KACftjB,QAAS,KACTujB,QAASp2E,GACTq2E,kBAAmB,KACnBC,WAAY,KACZxuE,OAAQ,KACR2qC,KAAM,KACNiwB,SAAU,KACVwM,UAAWlvE,GACXmvE,aAAcnvE,GACdovE,aAAcpvE,GACd8D,GAAI,KACJyyE,YAAav2E,GACbqvE,eAAgB,KAChBmH,kBAAmB,KACnBC,GAAI,KACJC,IAAK,KACLC,UAAW32E,GACX42E,EAAG52E,GACH62E,GAAI72E,GACJ82E,GAAI92E,GACJ+2E,GAAI/2E,GACJg3E,GAAIh3E,GACJi3E,aAAc3b,GACd4b,iBAAkB,KAClBC,UAAW,KACXC,WAAY,KACZC,SAAU,KACVC,QAAS,KACT7jB,KAAM,KACN8jB,aAAc,KACdjI,cAAe,KACfC,cAAe,KACfiI,kBAAmBx3E,GACnBy3E,MAAO,KACPjI,UAAW,KACXC,UAAW,KACXC,YAAa,KACbgI,aAAc,KACdC,YAAa,KACbC,YAAa,KACbjc,KAAM,KACNkc,iBAAkB,KAClBC,UAAW,KACXC,aAAc,KACdt2E,IAAK,KACLgnD,MAAO,KACPuvB,uBAAwB,KACxBC,sBAAuB,KACvBC,UAAWl4E,GACXm4E,UAAW,KACX/2C,OAAQ,KACRp/B,IAAK,KACLo2E,KAAM,KACN36E,KAAM,KACNkyE,QAAS,KACTC,YAAa,KACbC,aAAc,KACdC,QAAS,KACTC,QAAS,KACTC,QAAS,KACTC,SAAU,KACVC,MAAO,KACPC,UAAW,KACXC,WAAY,KACZiI,WAAY,KACZC,SAAU,KACV/iE,OAAQ,KACRuuD,QAAS,KACTuM,WAAY,KACZtM,aAAc,KACdE,cAAe,KACfqM,QAAS,KACTnM,SAAU,KACVC,UAAW,KACXC,iBAAkB,KAClBjmE,SAAU,KACV2J,QAAS,KACT3D,QAAS,KACTqgE,OAAQ,KACRC,YAAa,KACbC,MAAO,KACPC,WAAY,KACZC,OAAQ,KACRC,UAAW,KACXC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,OAAQ,KACRC,iBAAkB,KAClBC,UAAW,KACXiL,MAAO,KACPhL,QAAS,KACTC,QAAS,KACTC,QAAS,KACT+K,UAAW,KACXC,WAAY,KACZ9K,aAAc,KACdC,QAAS,KACTC,UAAW,KACXj7D,UAAW,KACXk7D,WAAY,KACZC,QAAS,KACTE,OAAQ,KACRC,aAAc,KACdC,iBAAkB,KAClBE,YAAa,KACbC,UAAW,KACXE,YAAa,KACbC,aAAc,KACdC,aAAc,KACdC,YAAa,KACbC,WAAY,KACZC,YAAa,KACbC,UAAW,KACX4J,aAAc,KACd3J,UAAW,KACXC,SAAU,KACVC,WAAY,KACZC,WAAY,KACZC,QAAS,KACTC,QAAS,KACTC,OAAQ,KACRC,UAAW,KACXC,WAAY,KACZC,WAAY,KACZC,aAAc,KACdkJ,SAAU,KACVhJ,QAAS,KACTC,SAAU,KACVC,SAAU,KACVE,SAAU,KACVC,UAAW,KACXC,SAAU,KACV2I,OAAQ,KACRzI,UAAW,KACXC,UAAW,KACXC,SAAU,KACVC,UAAW,KACXC,aAAc,KACdC,SAAU,KACVE,SAAU,KACVC,eAAgB,KAChBC,UAAW,KACXiI,OAAQ,KACR0H,QAAS,KACTrjD,SAAU,KACVge,MAAO,KACPslC,OAAQ,KACRC,YAAa,KACbxoC,OAAQ,KACRyoC,SAAU,KACVC,QAAS,KACT7H,iBAAkB9wE,GAClB+wE,kBAAmB/wE,GACnBgxE,WAAY,KACZC,QAAS,KACTxqD,KAAM,KACNmyD,WAAY54E,GACZ64E,oBAAqB,KACrBC,iBAAkB,KAClBC,aAAc,KACdC,MAAO,KACPjQ,KAAM1N,GACN4d,MAAO,KACP7F,cAAe,KACflC,cAAe,KACfgI,OAAQ,KACRC,UAAWn5E,GACXo5E,UAAWp5E,GACXq5E,UAAWr5E,GACXs5E,cAAe,KACfC,oBAAqB,KACrBC,eAAgB,KAChBC,UAAW,KACX9uD,SAAU2wC,GACV90D,EAAG,KACHkzE,OAAQ,KACRvQ,eAAgB,KAChBwQ,KAAM,KACNC,KAAM,KACNxQ,IAAK9N,GACL4Q,IAAK5Q,GACL6V,gBAAiB,KACjB0I,YAAa,KACbC,UAAW,KACXC,mBAAoBze,GACpB0e,iBAAkB1e,GAClB2e,cAAe3e,GACf4e,gBAAiB5e,GACjBrJ,SAAU,KACVkoB,QAAS,KACTplE,OAAQ,KACRqlE,OAAQ,KACRC,GAAI,KACJC,GAAI,KACJC,MAAO,KACPC,KAAM,KACNpJ,eAAgB,KAChBqJ,KAAM,KACNC,MAAO,KACPC,aAAc,KACdC,iBAAkB56E,GAClB66E,iBAAkB76E,GAClB86E,aAAc,KACd7+E,QAAS,KACT8+E,YAAa,KACbC,aAAc,KACdC,MAAO,KACPC,MAAO,KACPC,YAAa,KACb9J,UAAW,KACXC,YAAa,KACbC,sBAAuBvxE,GACvBwxE,uBAAwBxxE,GACxB5E,OAAQ,KACRggF,OAAQ,KACR3J,gBAAiBnW,GACjBoW,iBAAkB,KAClBC,cAAe,KACfC,eAAgB,KAChBC,iBAAkB7xE,GAClB8xE,cAAe9xE,GACf+xE,YAAa,KACbt3E,MAAO,KACP4gF,aAAcr7E,GACds7E,aAAc,KACdC,oBAAqB,KACrBC,WAAY,KACZC,cAAe,KACfC,qBAAsB,KACtBC,eAAgBrgB,GAChB4O,SAAUlqE,GACV47E,YAAa,KACb56E,OAAQ,KACR66E,QAAS77E,GACT87E,QAAS97E,GACTgyE,WAAY,KACZC,eAAgB,KAChBC,cAAe,KACf6J,WAAY,KACZ1I,cAAe,KACf5vB,MAAO,KACPu4B,kBAAmB,KACnBx+E,KAAM,KACN20E,OAAQ7W,GACR2gB,GAAI,KACJ/jE,UAAW,KACXgkE,GAAI,KACJC,GAAI,KACJ/J,kBAAmBpyE,GACnBqyE,mBAAoBryE,GACpBo8E,QAAS,KACT9J,YAAa,KACbC,aAAc,KACdC,WAAYxyE,GACZsV,OAAQ,KACRm9D,YAAazyE,GACb4yE,cAAe5yE,GACf6yE,aAAc,KACdH,SAAU1yE,GACV2yE,aAAc3yE,GACd2sE,QAAS,KACTmG,SAAU9yE,GACV+yE,YAAa/yE,GACbgzE,YAAahzE,GACbq8E,QAAS,KACTC,WAAY,KACZC,WAAY,KACZ7hF,MAAO,KACP8hF,OAAQ,KACRvJ,YAAa,KACbC,YAAa,KACbl9E,EAAG,KACHymF,GAAI,KACJC,GAAI,KACJC,iBAAkB,KAClBxJ,QAASnzE,GACT48E,EAAG,KACHC,GAAI,KACJC,GAAI,KACJC,iBAAkB,KAClBC,EAAG,KACHC,WAAY,QC1iBVC,GAAQ,kBACRC,GAAO,UACPC,GAAM,SA+CZ,SAASC,GAAMhwB,GACb,MAAO,IAAMA,EAAGptB,aACjB,CAMD,SAASq9C,GAAUjwB,GACjB,OAAOA,EAAGr0C,OAAO,GAAG0nB,aACrB,CCnEM,MAAM68C,GAAc,CACzBvS,QAAS,UACTmD,SAAU,WACVlL,OAAQ,SACRwO,gBAAiB,kBACjBC,iBAAkB,mBAClBC,cAAe,gBACfC,eAAgB,iBAChBC,iBAAkB,mBAClBM,OAAQ,SACRpW,aAAc,eACdC,aAAc,eACdC,UAAW,YACXC,UAAW,YACXC,UAAW,YACXC,WAAY,aACZC,UAAW,YACXS,WAAY,cCDD/N,GAAOxvB,GAAM,CAAC+8B,GAAKR,GAAOc,GAAOG,GAAMygB,IAAW,QAClDjQ,GAAMhuC,GAAM,CAAC+8B,GAAKR,GAAOc,GAAOG,GAAM0gB,IAAU,OCM9C,SAASC,GAAa7/E,GACnC,GAAIA,EAAQ8/E,iBAAmB9/E,EAAQ+/E,mBACrC,MAAM,IAAIlkE,UACR,4EAKF7b,GAAAA,EAAQ8/E,iBACR9/E,EAAQ+/E,oBACR//E,EAAQggF,aAER,OAAQvmC,IACNme,GAAMne,EAAM,WAAW,CAAC37C,EAAMyN,EAAO00E,KACnC,MAAM71D,EAAsC61D,EAE5C,IAAIh5C,EAYJ,GAVIjnC,EAAQ8/E,gBACV74C,GAAUjnC,EAAQ8/E,gBAAgB3yE,SAASrP,EAAKmpD,SACvCjnD,EAAQ+/E,qBACjB94C,EAASjnC,EAAQ+/E,mBAAmB5yE,SAASrP,EAAKmpD,WAG/ChgB,GAAUjnC,EAAQggF,cAAiC,iBAAVz0E,IAC5C07B,GAAUjnC,EAAQggF,aAAaliF,EAAMyN,EAAO6e,IAG1C6c,GAA2B,iBAAV17B,EAOnB,OANIvL,EAAQkgF,kBAAoBpiF,EAAKJ,SACnC0sB,EAAO1sB,SAASgP,OAAOnB,EAAO,KAAMzN,EAAKJ,UAEzC0sB,EAAO1sB,SAASgP,OAAOnB,EAAO,GAGzBA,CAGT,GAzBF,CA6BL;;;;;;;;;GCxDY,IAAIzU,GAAE8lB,OAAOujE,IAAI,iBAAiBC,GAAExjE,OAAOujE,IAAI,gBAAgB3qB,GAAE54C,OAAOujE,IAAI,kBAAkBl/E,GAAE2b,OAAOujE,IAAI,qBAAqBE,GAAEzjE,OAAOujE,IAAI,kBAAkBG,GAAE1jE,OAAOujE,IAAI,kBAAkBxpB,GAAE/5C,OAAOujE,IAAI,iBAAiBpH,GAAEn8D,OAAOujE,IAAI,wBAAwBtkF,GAAE+gB,OAAOujE,IAAI,qBAAqBI,GAAE3jE,OAAOujE,IAAI,kBAAkBpnE,GAAE6D,OAAOujE,IAAI,uBAAuBtiF,GAAE+e,OAAOujE,IAAI,cAAcK,GAAE5jE,OAAOujE,IAAI,cAAcM,GAAE7jE,OAAOujE,IAAI,mBAAmB1pB,GAAE75C,OAAOujE,IAAI,0BACtd,SAASO,GAAE7pF,GAAG,GAAG,iBAAkBA,GAAG,OAAOA,EAAE,CAAC,IAAI8R,EAAE9R,EAAE8pF,SAAS,OAAOh4E,GAAG,KAAK7R,GAAE,OAAOD,EAAEA,EAAE8I,MAAQ,KAAK61D,GAAE,KAAK6qB,GAAE,KAAKp/E,GAAE,KAAKs/E,GAAE,KAAKxnE,GAAE,OAAOliB,EAAE,QAAeA,OAAAA,EAAEA,GAAGA,EAAE8pF,UAAY,KAAK5H,GAAE,KAAKpiB,GAAE,KAAK96D,GAAE,KAAK2kF,GAAE,KAAK3iF,GAAE,KAAKyiF,GAAE,OAAOzpF,EAAE,QAAQ,OAAO8R,GAAG,KAAKy3E,GAAE,OAAOz3E,EAAG,CAAC,CAAA1J,wBAAwB03D,mBAA0B2pB,WAAkBxpF,cAAqB+E,YAAmB25D,QAAegrB,QAAe3iF,UAAiBuiF,YAAmBC,cAAqBp/E,YAAmBs/E,gBAC3cxnE,eAAsB,WAAW,OAAM,CAAG,mBAA0B,WAAW,OAAM,CAAG,oBAA2B,SAASliB,GAAG,OAAO6pF,GAAE7pF,KAAK8/D,EAAE,oBAA2B,SAAS9/D,GAAG,OAAO6pF,GAAE7pF,KAAKypF,EAAE,YAAmB,SAASzpF,GAAS,MAAA,iBAAkBA,GAAG,OAAOA,GAAGA,EAAE8pF,WAAW7pF,EAAE,eAAsB,SAASD,GAAG,OAAO6pF,GAAE7pF,KAAKgF,EAAE,aAAoB,SAAShF,GAAG,OAAO6pF,GAAE7pF,KAAK2+D,EAAE,SAAgB,SAAS3+D,GAAG,OAAO6pF,GAAE7pF,KAAK2pF,EAAE,SAAgB,SAAS3pF,GAAG,OAAO6pF,GAAE7pF,KAAKgH,EAAE,WACvd,SAAShH,GAAG,OAAO6pF,GAAE7pF,KAAKupF,EAAE,aAAoB,SAASvpF,GAAG,OAAO6pF,GAAE7pF,KAAKwpF,EAAE,eAAsB,SAASxpF,GAAG,OAAO6pF,GAAE7pF,KAAKoK,EAAE,aAAoB,SAASpK,GAAG,OAAO6pF,GAAE7pF,KAAK0pF,EAAE,iBAAwB,SAAS1pF,GAAG,OAAO6pF,GAAE7pF,KAAKkiB,EAAE,qBACxN,SAASliB,GAAG,MAAM,iBAAkBA,GAAG,mBAAoBA,GAAGA,IAAI2+D,IAAG3+D,IAAIwpF,IAAGxpF,IAAIoK,IAAGpK,IAAI0pF,IAAG1pF,IAAIkiB,IAAGliB,IAAI4pF,IAAG,iBAAkB5pF,GAAG,OAAOA,IAAIA,EAAE8pF,WAAWH,IAAG3pF,EAAE8pF,WAAW9iF,IAAGhH,EAAE8pF,WAAWL,IAAGzpF,EAAE8pF,WAAWhqB,IAAG9/D,EAAE8pF,WAAW9kF,IAAGhF,EAAE8pF,WAAWlqB,SAAG,IAAS5/D,EAAE+pF,YAAmB,SAAgBF,yBCDpR,eAAzBrrE,QAAQwrE,IAAIC,UACd,WAOF,IAAIC,EAAqBnkE,OAAOujE,IAAI,iBAChCa,EAAoBpkE,OAAOujE,IAAI,gBAC/Bc,EAAsBrkE,OAAOujE,IAAI,kBACjCe,EAAyBtkE,OAAOujE,IAAI,qBACpCgB,EAAsBvkE,OAAOujE,IAAI,kBACjCiB,EAAsBxkE,OAAOujE,IAAI,kBACjCkB,EAAqBzkE,OAAOujE,IAAI,iBAChCmB,EAA4B1kE,OAAOujE,IAAI,wBACvCoB,EAAyB3kE,OAAOujE,IAAI,qBACpCqB,EAAsB5kE,OAAOujE,IAAI,kBACjCsB,EAA2B7kE,OAAOujE,IAAI,uBACtCuB,EAAkB9kE,OAAOujE,IAAI,cAC7BwB,EAAkB/kE,OAAOujE,IAAI,cAC7ByB,EAAuBhlE,OAAOujE,IAAI,mBAclC0B,EAAyBjlE,OAAOujE,IAAI,0BAwB/B7L,SAAAA,EAAOtyE,GACV,GAAkB,iBAAXA,GAAkC,OAAXA,EAAiB,CACjD,IAAI2+E,EAAW3+E,EAAO2+E,SAEtB,OAAQA,GACN,KAAKI,EACH,IAAIphF,EAAOqC,EAAOrC,KAElB,OAAQA,GACN,KAAKshF,EACL,KAAKE,EACL,KAAKD,EACL,KAAKM,EACL,KAAKC,EACH,OAAO9hF,EAET,QACE,IAAImiF,EAAeniF,GAAQA,EAAKghF,SAEhC,OAAQmB,GACN,KAAKR,EACL,KAAKD,EACL,KAAKE,EACL,KAAKI,EACL,KAAKD,EACL,KAAKN,EACH,OAAOU,EAET,QACE,OAAOnB,GAKjB,KAAKK,EACH,OAAOL,EAEZ,CAGF,CACGoB,IAAAA,EAAkBV,EAClBW,EAAkBZ,EAClBa,EAAUlB,EACVmB,EAAaX,EACbn3E,EAAW62E,EACXkB,EAAOR,EACPS,EAAOV,EACPW,EAASrB,EACTsB,EAAWnB,EACXoB,EAAarB,EACbsB,EAAWhB,EACXiB,EAAehB,EACfiB,GAAsC,EACtCC,GAA2C,EA6D/C1jF,EAAAA,gBAA0B8iF,EAC1B9iF,EAAAA,gBAA0B+iF,EAC1B/iF,EAAAA,QAAkBgjF,EAClBhjF,EAAAA,WAAqBijF,EACrBjjF,EAAAA,SAAmBmL,EACnBnL,EAAAA,KAAekjF,EACfljF,EAAAA,KAAemjF,EACfnjF,EAAAA,OAAiBojF,EACjBpjF,EAAAA,SAAmBqjF,EACnBrjF,EAAAA,WAAqBsjF,EACrBtjF,EAAAA,SAAmBujF,EACnBvjF,EAAAA,aAAuBwjF,EACvBxjF,EAAAA,YAvES2jF,SAAY5gF,GASnB,OAPO0gF,IACHA,GAAsC,EAEtCG,QAAO,KAAS,4FAIb,CACR,EA8DD5jF,EAAAA,iBA7DS6jF,SAAiB9gF,GASxB,OAPO2gF,IACHA,GAA2C,EAE3CE,QAAO,KAAS,iGAIb,CACR,EAoDD5jF,EAAAA,kBAnDS8jF,SAAkB/gF,GACzB,OAAOsyE,EAAOtyE,KAAYq/E,CAC3B,EAkDDpiF,EAAAA,kBAjDS+jF,SAAkBhhF,GACzB,OAAOsyE,EAAOtyE,KAAYo/E,CAC3B,EAgDDniF,EAAAA,UA/CSkrC,SAAUnoC,GACjB,MAAyB,iBAAXA,GAAkC,OAAXA,GAAmBA,EAAO2+E,WAAaI,CAC7E,EA8CD9hF,EAAAA,aA7CSgkF,SAAajhF,GACpB,OAAOsyE,EAAOtyE,KAAYu/E,CAC3B,EA4CDtiF,EAAAA,WA3CSikF,SAAWlhF,GAClB,OAAOsyE,EAAOtyE,KAAYi/E,CAC3B,EA0CDhiF,EAAAA,OAzCSowC,SAAOrtC,GACd,OAAOsyE,EAAOtyE,KAAY2/E,CAC3B,EAwCD1iF,EAAAA,OAvCSkkF,SAAOnhF,GACd,OAAOsyE,EAAOtyE,KAAY0/E,CAC3B,EAsCDziF,EAAAA,SArCSmkF,SAASphF,GAChB,OAAOsyE,EAAOtyE,KAAYg/E,CAC3B,EAoCD/hF,EAAAA,WAnCSokF,SAAWrhF,GAClB,OAAOsyE,EAAOtyE,KAAYm/E,CAC3B,EAkCDliF,EAAAA,aAjCSqkF,SAAathF,GACpB,OAAOsyE,EAAOtyE,KAAYk/E,CAC3B,EAgCDjiF,EAAAA,WA/BSskF,SAAWvhF,GAClB,OAAOsyE,EAAOtyE,KAAYw/E,CAC3B,EA8BDviF,EAAAA,eA7BSukF,SAAexhF,GACtB,OAAOsyE,EAAOtyE,KAAYy/E,CAC3B,EA4BDxiF,EAAAA,mBApKSwkF,SAAmB9jF,GACtB,MAAgB,iBAATA,GAAqC,mBAATA,IAKnCA,IAASshF,GAAuBthF,IAASwhF,GAA8CxhF,IAASuhF,GAA0BvhF,IAAS6hF,GAAuB7hF,IAAS8hF,GAAmD9hF,IAASiiF,GAI/M,iBAATjiF,GAA8B,OAATA,IAC1BA,EAAKghF,WAAagB,GAAmBhiF,EAAKghF,WAAae,GAAmB/hF,EAAKghF,WAAaS,GAAuBzhF,EAAKghF,WAAaU,GAAsB1hF,EAAKghF,WAAaY,GAIjL5hF,EAAKghF,WAAakB,QAA+C9oF,IAArB4G,EAAKihF,aAMpD,EAgJD3hF,EAAAA,OAAiBq1E,CAxMf,CAAA,yBCX2B,eAAzBj/D,QAAQwrE,IAAIC,SACdnqF,EAAAA,QAAiB6e,GAEjB7e,EAAAA,QAAiB6e,MCHnB,IAAIkuE,GAAgB,kCAEhBC,GAAgB,MAChBC,GAAmB,OAGnBC,GAAiB,yCACjBC,GAAc,QACdC,GAAc,uDACdC,GAAkB,UAGlBC,GAAa,aAMbC,GAAe,GA8OnB,SAASn2C,GAAKo2C,GACLA,OAAAA,EAAMA,EAAIhrE,QAAQ8qE,GAAYC,IAAgBA,EACtD,CC3NDvtF,IAAAA,GA5BA,SAAuBiG,EAAO2gB,GACxB25B,IAKA8R,EALA9R,EAAS,KACb,IAAKt6C,GAA0B,iBAAVA,EACnB,OAAOs6C,EAST,IALA,IAEIpqB,EACAxzB,EAHA8qF,EDaW,SAASxnF,EAAOoD,GAC/B,GAAqB,iBAAVpD,EACT,MAAM,IAAIif,UAAU,mCAGtB,IAAKjf,EAAO,MAAO,GAEnBoD,EAAUA,GAAW,GAKjBqkF,IAAAA,EAAS,EACTtyC,EAAS,EAOJuyC,SAAAA,EAAeH,GACtB,IAAII,EAAQJ,EAAIppE,MAAM4oE,IAClBY,IAAOF,GAAUE,EAAMvtF,QAC3B,IAAIC,EAAIktF,EAAIp5C,YAvCF,MAwCVgH,GAAU96C,EAAIktF,EAAIntF,OAASC,EAAI86C,EAASoyC,EAAIntF,MAC7C,CAOD,SAAS4J,IACP,IAAI+C,EAAQ,CAAEmuC,KAAMuyC,EAAQtyC,OAAQA,GAC7B,OAAA,SAASj0C,GAGd,OAFAA,EAAK8C,SAAW,IAAI4jF,EAAS7gF,GAC7B8gF,IACO3mF,CACR,CACF,CAUQ0mF,SAAAA,EAAS7gF,GACXA,KAAAA,MAAQA,EACbxI,KAAK0I,IAAM,CAAEiuC,KAAMuyC,EAAQtyC,OAAQA,GACnC52C,KAAK7D,OAAS0I,EAAQ1I,MACvB,CAeQ8H,SAAAA,EAAMslF,GACTC,IAAAA,EAAM,IAAItqF,MACZ2F,EAAQ1I,OAAS,IAAM+sF,EAAS,IAAMtyC,EAAS,KAAO2yC,GAQpD1kF,GANJ2kF,EAAIzyC,OAASwyC,EACbC,EAAIC,SAAW5kF,EAAQ1I,OACvBqtF,EAAI7yC,KAAOuyC,EACXM,EAAI5yC,OAASA,EACb4yC,EAAIrtF,OAASsF,GAEToD,EAAQ6kF,OAGV,MAAMF,CAET,CAQQ5pE,SAAAA,EAAM+pE,GACb,IAAIvE,EAAIuE,EAAGzoE,KAAKzf,GACZ,GAAC2jF,EAAD,CACJ,IAAI4D,EAAM5D,EAAE,GAGZ,OAFA+D,EAAeH,GACfvnF,EAAQA,EAAMqc,MAAMkrE,EAAIntF,QACjBupF,CAJC,CAKT,CAKD,SAASkE,IACP1pE,EAAM6oE,GACP,CAQQmB,SAAAA,EAASxW,GAChB,IAAI6R,EAEJ,IADA7R,EAAQA,GAAS,GACT6R,EAAIj3B,MACA,IAANi3B,GACF7R,EAAM1vE,KAAKuhF,GAGf,OAAO7R,CACR,CAQD,SAASplB,IACHnX,IAAAA,EAAMpxC,IACV,GAnJgB,KAmJKhE,EAAMue,OAAO,IAlJvB,KAkJyCve,EAAMue,OAAO,GAAjE,CAGA,IADIlkB,IAAAA,EAAI,EAENitF,IAAgBtnF,EAAMue,OAAOlkB,KAtJpB,KAuJI2F,EAAMue,OAAOlkB,IAxJZ,KAwJmC2F,EAAMue,OAAOlkB,EAAI,OAEhEA,EAIAitF,GAFJjtF,GAAK,EAEDitF,KAAiBtnF,EAAMue,OAAOlkB,EAAI,GAC7BmI,OAAAA,EAAM,0BAGX+kF,IAAAA,EAAMvnF,EAAMqc,MAAM,EAAGhiB,EAAI,GAM7B,OALA86C,GAAU,EACVuyC,EAAeH,GACfvnF,EAAQA,EAAMqc,MAAMhiB,GACpB86C,GAAU,EAEHC,EAAI,CACTryC,KApKa,UAqKbwpD,QAASg7B,GAvB0D,CAyBtE,CAQD,SAASn7B,IACP,IAAIhX,EAAMpxC,IAGNmhC,EAAOhnB,EAAM8oE,IACb,GAAC9hD,EAAD,CAIJ,GAHAonB,KAGKpuC,EAAM+oE,IAAc,OAAO1kF,EAAM,wBAGtC,IAAIiK,EAAM0R,EAAMgpE,IAEZiB,EAAMhzC,EAAI,CACZryC,KA7LiB,cA8LjBmtB,SAAUihB,GAAKhM,EAAK,GAAG5oB,QAAQuqE,GAAeQ,KAC9C5qF,MAAO+P,EACH0kC,GAAK1kC,EAAI,GAAG8P,QAAQuqE,GAAeQ,KACnCA,KAMN,OAFAnpE,EAAMipE,IAECgB,CApBI,CAqBZ,CAyBD,OA9JAR,EAAS9sF,UAAU+kD,QAAU7/C,EA6J7B6nF,IAjBA,WACMQ,IAKAC,EALAD,EAAQ,GAMZ,IAJAF,EAASE,GAIDC,EAAOl8B,MACA,IAATk8B,IACFD,EAAMpmF,KAAKqmF,GACXH,EAASE,IAIb,OAAOA,CACR,CAGMb,EACR,CCtOoBprC,CAAMp8C,GACrBuoF,EAAkC,mBAAb5nE,EAIhBtmB,EAAI,EAAGmuF,EAAMhB,EAAaptF,OAAQC,EAAImuF,EAAKnuF,IAElD61B,GADAk8B,EAAco7B,EAAantF,IACJ61B,SACvBxzB,EAAQ0vD,EAAY1vD,MAEhB6rF,EACF5nE,EAASuP,EAAUxzB,EAAO0vD,GACjB1vD,IACT49C,IAAWA,EAAS,CAAA,GACpBA,EAAOpqB,GAAYxzB,GAIvB,OAAO49C,CACR,ECqED,MAAMiB,GAAM,CAAGvgD,EAAAA,eAITytF,GAAgB,IAAI/pF,IAAI,CAAC,QAAS,QAAS,QAAS,QAAS,OAM5D,SAASgqF,GAAgBhqE,EAASxd,GAEjCJ,MAAAA,EAAW,GACb6nF,IAEAzqB,EAFAyqB,GAAc,EAIX,OAAEA,EAAaznF,EAAKJ,SAAS1G,QAClC8jE,EAAQh9D,EAAKJ,SAAS6nF,GAEH,YAAfzqB,EAAMn7D,KACRjC,EAASmB,KAAK2mF,GAAQlqE,EAASw/C,EAAOyqB,EAAYznF,IAC1B,SAAfg9D,EAAMn7D,KASC,YAAd7B,EAAK6B,MACJ0lF,GAAc7rE,IAAI1b,EAAKmpD,WCtI1B3tD,SASoB,iBATpBA,GAFqBmsF,EDyIP3qB,ICrIU,iBAAV2qB,GAAqC,SAAfA,EAAM9lF,KAExC8lF,EAAMnsF,OAAS,GACfmsF,IAIoE,KAAtCnsF,EAAM6f,QAAQ,eAAgB,MDgI5Dzb,EAASmB,KAAKi8D,EAAMxhE,OAEE,QAAfwhE,EAAMn7D,MAAmB2b,EAAQtb,QAAQ0lF,UAElDhoF,EAASmB,KAAKi8D,EAAMxhE,OC/InB,IAAoBmsF,EAErBnsF,EDiJJ,OAAOoE,CACR,CAQD,SAAS8nF,GAAQlqE,EAASxd,EAAMyN,EAAO6e,GACrC,MAAMpqB,EAAUsb,EAAQtb,QAClB2lF,EAAerqE,EAAQsqE,OAGvBhmF,EAAO9B,EAAKmpD,QAEZ/hB,EAAa,CAAA,EACf0gD,IAEA94D,EAFA84D,EAASD,EAST7nF,GALuB,SAAvB6nF,EAAa1oB,OAA6B,QAATr9D,IACnCgmF,EAASlW,GACTp0D,EAAQsqE,OAASA,GAGf9nF,EAAKonC,WACP,IAAKpY,KAAYhvB,EAAKonC,WAChBiT,GAAItgD,KAAKiG,EAAKonC,WAAYpY,IAC5B+4D,GAAY3gD,EAAYpY,EAAUhvB,EAAKonC,WAAWpY,GAAWxR,GAKtD,OAAT1b,GAA0B,OAATA,GACnB0b,EAAQwqE,YAGV,MAAMpoF,EAAW4nF,GAAgBhqE,EAASxd,GAE7B,OAAT8B,GAA0B,OAATA,GACnB0b,EAAQwqE,YAIVxqE,EAAQsqE,OAASD,EAIjB,MAAM/kF,EAAW9C,EAAK8C,UAAY,CAChC+C,MAAO,CAACmuC,KAAM,KAAMC,OAAQ,KAAMr6B,OAAQ,MAC1C7T,IAAK,CAACiuC,KAAM,KAAMC,OAAQ,KAAMr6B,OAAQ,OAEpC7X,EACJG,EAAQ+lF,YAAc5tC,GAAItgD,KAAKmI,EAAQ+lF,WAAYnmF,GAC/CI,EAAQ+lF,WAAWnmF,GACnBA,EACAomF,EAA6B,iBAAdnmF,GAA0BA,IAAcnD,EAAM0N,SAEnE,IAAK67E,GAAQxC,mBAAmB5jF,GAC9B,MAAM,IAAIgc,UACP,wBAAuBjc,wCA2D5B,GAvDAslC,EAAWptC,IAAM,CACf8H,EACAgB,EAAS+C,MAAMmuC,KACflxC,EAAS+C,MAAMouC,OACfxmC,GACAvM,KAAK,KAEM,MAATY,GAAgBI,EAAQkmF,aAC1BhhD,EAAW/hC,OACqB,mBAAvBnD,EAAQkmF,WACXlmF,EAAQkmF,WACNtqE,OAAOspB,EAAW0P,MAAQ,IAC1B92C,EAAKJ,SACuB,iBAArBwnC,EAAW0gB,MAAqB1gB,EAAW0gB,MAAQ,MAE5D5lD,EAAQkmF,YAGH,MAATtmF,GAAgBI,EAAQmmF,mBAC1BjhD,EAAW0P,KAAO50C,EAAQmmF,iBACxBvqE,OAAOspB,EAAW0P,MAAQ,IAC1B92C,EAAKJ,SACuB,iBAArBwnC,EAAW0gB,MAAqB1gB,EAAW0gB,MAAQ,OAK3DogC,GACQ,SAATpmF,GACgB,YAAhBwqB,EAAOzqB,MACY,QAAnByqB,EAAO68B,UAEP/hB,EAAWkhD,QAAS,GAInBJ,GACS,OAATpmF,GACU,OAATA,GACS,OAATA,GACS,OAATA,GACS,OAATA,GACS,OAATA,IAEFslC,EAAWmhD,MAAQzhF,OAAOI,SAASpF,EAAKub,OAAO,GAAI,KAGxC,QAATvb,GAAkBI,EAAQsmF,oBAC5BphD,EAAWwR,IAAM12C,EAAQsmF,kBACvB1qE,OAAOspB,EAAWwR,KAAO,IACzB96B,OAAOspB,EAAWkV,KAAO,IACG,iBAArBlV,EAAW0gB,MAAqB1gB,EAAW0gB,MAAQ,QAIzDogC,GAAkB,OAATpmF,GAAiC,YAAhBwqB,EAAOzqB,KAAoB,CACxD,MAAM8kB,EA0DV,SAAyB3mB,GACnByN,IAAAA,GAAS,EAEN,OAAEA,EAAQzN,EAAKJ,SAAS1G,QAAQ,CACrC,MAAM8jE,EAAQh9D,EAAKJ,SAAS6N,GAExBuvD,GAAe,YAAfA,EAAMn7D,MAAwC,UAAlBm7D,EAAM7T,QACpC,OAAO6T,CAEV,CAED,OAAO,IACR,CAtEiByrB,CAAgBzoF,GAC9BonC,EAAWt7B,QACT6a,GAASA,EAAMygB,WAAa+U,QAAQx1B,EAAMygB,WAAWt7B,SAAW,KAClEs7B,EAAW35B,MAAQi7E,GAAuBp8D,EAAQtsB,GAClDonC,EAAW8wB,QAA6B,OAAnB5rC,EAAO68B,OAC7B,CA+JH,IAAyBjV,EAnHhBt0C,OA1CFsoF,GAAmB,OAATpmF,GAA0B,OAATA,IAC9BslC,EAAW8wB,QAAmB,OAATp2D,EACrBslC,EAAW/c,MAAQ7M,EAAQwqE,WAGhB,OAATlmF,GAA0B,OAATA,IACfslC,EAAW9nC,QACR8nC,EAAWtoC,QAAOsoC,EAAWtoC,MAAQ,CAAA,GAE1CsoC,EAAWtoC,MAAMH,UAAYyoC,EAAW9nC,aACjC8nC,EAAW9nC,OAGf4oF,IACH9gD,EAAWuhD,SAAoB,OAAT7mF,IAIrBomF,GAAkB,OAATpmF,GAAiC,YAAhBwqB,EAAOzqB,OACpCulC,EAAWuhD,SAAWxsC,QAA2B,UAAnB7vB,EAAO68B,UAInCjnD,EAAQ0mF,YACVxhD,EAAW,kBAsIN,EADgB8M,EArI0BpxC,GAuI3C+C,MAAMmuC,KACV,IACAE,EAAIruC,MAAMouC,OACV,IACAC,EAAInuC,IAAIiuC,KACR,IACAE,EAAInuC,IAAIkuC,QAEPlwC,KAAK2zD,GAAM55C,OAAO45C,KAClBx2D,KAAK,MA7IHgnF,GAAShmF,EAAQ2mF,eACpBzhD,EAAW0hD,eAAiB9oF,EAAK8C,WAI9BolF,GAAShmF,EAAQ6mF,sBACpB3hD,EAAW35B,MAAQi7E,GAAuBp8D,EAAQtsB,GAClDonC,EAAW4hD,aAAeN,GAAuBp8D,IAG9C47D,IACH9gD,EAAWpnC,KAAOA,GAIbJ,EAAS1G,OAAS,EACrB0F,EAAMM,cAAc6C,EAAWqlC,EAAYxnC,GAC3ChB,EAAMM,cAAc6C,EAAWqlC,EACpC,CAyBD,SAASshD,GAAuBp8D,EAAQtsB,GAClCyN,IAAAA,GAAS,EACThD,EAAQ,EAEL,OAAEgD,EAAQ6e,EAAO1sB,SAAS1G,QAC3BozB,EAAO1sB,SAAS6N,KAAWzN,GACK,YAAhCssB,EAAO1sB,SAAS6N,GAAO5L,MAAoB4I,IAGjD,OAAOA,CACR,CAQD,SAASs9E,GAAY9kF,EAAOghC,EAAMzoC,EAAOc,GACjC07C,MAAAA,ET/VD,SAAc8vC,EAAQtsF,GAC3B,MAAM0jE,EAAS5oB,GAAU96C,GACrByoC,IAAAA,EAAOzoC,EACPytF,EAAO7pB,GAEX,GAAIF,KAAU4oB,EAAO5oB,OACZ4oB,OAAAA,EAAO94D,SAAS84D,EAAO5oB,OAAOA,IAGnCA,GAAAA,EAAOhmE,OAAS,GAA4B,SAAvBgmE,EAAO/jD,MAAM,EAAG,IAAiBomE,GAAMnlE,KAAK5gB,GAAQ,CAE3E,GAAwB,MAApBA,EAAM6hB,OAAO,GAAY,CAE3B,MAAM+rB,EAAO5tC,EAAM2f,MAAM,GAAGE,QAAQmmE,GAAMG,IAC1C19C,EAAO,OAASmF,EAAK/rB,OAAO,GAAG0nB,cAAgBqE,EAAKjuB,MAAM,EAC3D,KAAM,CAEL,MAAMiuB,EAAO5tC,EAAM2f,MAAM,GAEzB,IAAKqmE,GAAKplE,KAAKgtB,GAAO,CAChB8/C,IAAAA,EAAS9/C,EAAK/tB,QAAQomE,GAAKC,IAEN,MAArBwH,EAAO7rE,OAAO,KAChB6rE,EAAS,IAAMA,GAGjB1tF,EAAQ,OAAS0tF,CAClB,CACF,CAEDD,EAAOlpB,EACR,CAED,OAAO,IAAIkpB,EAAKhlD,EAAMzoC,EACvB,CS6TcqN,CAAKvM,EAAIwrF,OAAQ7jD,GAC9B,IAAI7qB,EAAS5d,EEhUR,IAAmBme,EAAQzX,EAC5BgtC,EFmUA91B,SAA2CA,GAAWA,IAMtD/f,MAAMC,QAAQ8f,KAChBA,EAAS4+B,EAAKynB,gBE1UZvwB,EAAWhtC,GAAW,GAGQ,MAJVyX,EF2UgBP,GEvU7BO,EAAOzgB,OAAS,KACzBygB,EAASA,EAAO7R,OAAO,KAGlB6R,EACJzY,MACEguC,EAASi6C,SAAW,IAAM,IACzB,MACsB,IAArBj6C,EAASk6C,QAAoB,GAAK,MAEtCn5C,QC9CE,SAAmBt2B,GACxB,OAAOA,EAAOzY,KAAK,KAAK+uC,MACzB,CHyWmDo5C,CAAOjwE,IAGnC,UAAlB4+B,EAAKhpB,UAA0C,iBAAX5V,IACtCA,EAkBJ,SAAoB5d,GAEZ4d,MAAAA,EAAS,CAAA,EAEX,IACFta,GAAMtD,EAAOikB,EACd,CAAC,MAED,CAED,OAAOrG,EAMP,SAASqG,EAAS3d,EAAM8gF,GAChB3H,MAAAA,EAAyB,SAArBn5E,EAAKqZ,MAAM,EAAG,GAAiB,MAAKrZ,EAAKqZ,MAAM,KAAOrZ,EAChEsX,EAAO6hE,EAAE5/D,QAAQ,YAAaiuE,KAAkB1G,CACjD,CACF,CAtCY2G,CAAWnwE,IAGlB4+B,EAAKmnB,OAASnnB,EAAKhpB,SACrB/rB,EACEo3C,GAAItgD,KAAK6nF,GAAa5pC,EAAKhpB,UACvB4yD,GAAY5pC,EAAKhpB,UACjBgpB,EAAKhpB,UACP5V,EACK4+B,EAAKqnB,YACdp8D,EAAM+0C,EAAKqnB,WAAajmD,GAE3B,CAgCD,SAASkwE,GAAc1gF,EAAG+oD,GACjBA,OAAAA,EAAG5sB,aACX,CIzYD,MAAMsV,GAAM,CAAA,EAAGvgD,eAKT0vF,GAAa,CACjBxuC,QAAS,CAACslC,GAAI,UAAWn4E,GAAI,mCAC7BshF,UAAW,CAACnJ,GAAI,aAAcn4E,GAAI,kCAClCuhF,WAAY,CAACvhF,GAAI,wCACjBu1D,mBAAoB,CAACv1D,GAAI,wCACzBwhF,WAAY,CAACxhF,GAAI,wCACjB3O,OAAQ,CAAC8mF,GAAI,WAAYn4E,GAAI,6BAC7ByhF,UAAW,CACTtJ,GAAI,eACJn4E,GAAI,sDAEN0hF,aAAc,CACZvJ,GAAI,kBACJn4E,GAAI,sDAEN2hF,gBAAiB,CACfxJ,GAAI,qBACJn4E,GAAI,sDAEN4hF,iBAAkB,CAChBzJ,GAAI,sBACJn4E,GAAI,mDAUD,SAAS6hF,GAAc9nF,GAC5B,IAAK,MAAMlI,KAAOwvF,GAChB,GAAInvC,GAAItgD,KAAKyvF,GAAYxvF,IAAQqgD,GAAItgD,KAAKmI,EAASlI,GAAM,CACvD,MAAMiwF,EAAcT,GAAWxvF,GAC/B+qF,QAAQmF,KACL,oCACCD,EAAY3J,GAAM,SAAQ2J,EAAY3J,kBAAoB,cACtDtmF,+EAA4BiwF,EAAY9hF,6BAEzCqhF,GAAWxvF,EACnB,CAGGmgD,MAAAA,EAAYP,KACfF,IAAIgf,IACJhf,IAAIx3C,EAAQioF,eAAiB,IAC7BzwC,IAAI0wC,GAAc,IACdloF,EAAQmoF,oBACX3sB,oBAAoB,IAErBhkB,IAAIx3C,EAAQooF,eAAiB,IAC7B5wC,IAAIqoC,GAAc7/E,GAEf2yC,EAAO,IAAI2C,GAEe,iBAArBt1C,EAAQtC,SACjBi1C,EAAKr5C,MAAQ0G,EAAQtC,cACS3E,IAArBiH,EAAQtC,UAA+C,OAArBsC,EAAQtC,UACnDmlF,QAAQmF,KACL,0EAAyEhoF,EAAQtC,eAItF,MAAM2qF,EAAWpwC,EAAUyB,QAAQzB,EAAUe,MAAMrG,GAAOA,GAE1D,GAAsB,SAAlB01C,EAAS1oF,KACX,MAAM,IAAIkc,UAAU,0BAItB,IAAI3E,EAASxa,EAAMM,cACjBN,EAAM0N,SACN,CAFW,EAGXk7E,GAAgB,CAACtlF,UAAS4lF,OAAQ10B,GAAM40B,UAAW,GAAIuC,IAOzD,OAJIroF,EAAQzB,YACV2Y,EAASxa,EAAMM,cAAc,MAAO,CAACuB,UAAWyB,EAAQzB,WAAY2Y,IAG/DA,CACR,CAED4wE,GAAcQ,aAAe,CAACnC,iBtIxHvB,SAAwBoC,GACvB31C,MAAAA,GAAO21C,GAAO,IAAIx6C,OAClBa,EAAQgE,EAAIz3B,OAAO,GAEzB,GAAc,MAAVyzB,GAA2B,MAAVA,EACnB,OAAOgE,EAGT,MAAM4lB,EAAQ5lB,EAAIvjB,QAAQ,KAC1B,IAAe,IAAXmpC,EACF,OAAO5lB,EAGLrnC,IAAAA,GAAS,EAEb,OAASA,EAAQmmC,GAAU16C,QAAQ,CACjC,MAAM+9C,EAAWrD,GAAUnmC,GAE3B,GACEitD,IAAUzjB,EAAS/9C,QACnB47C,EAAI35B,MAAM,EAAG87B,EAAS/9C,QAAQorC,gBAAkB2S,EAEhD,OAAOnC,CAEV,CAGGrnC,OADJA,EAAQqnC,EAAIvjB,QAAQ,MACL,IAAX9jB,GAAgBitD,EAAQjtD,EACnBqnC,GAGTrnC,EAAQqnC,EAAIvjB,QAAQ,MACL,IAAX9jB,GAAgBitD,EAAQjtD,EACnBqnC,EAIF,qBACR,GsIoFDk1C,GAAczqF,UAAY,CAExBK,SAAUJ,EAAUC,OAEpBgB,UAAWjB,EAAUC,OAErByiF,aAAc1iF,EAAUiF,KACxBu9E,gBAAiBxiF,EAAU+E,QAAQ/E,EAAUC,QAC7CwiF,mBAAoBziF,EAAU+E,QAAQ/E,EAAUC,QAChD2iF,iBAAkB5iF,EAAU4E,KAE5B+lF,cAAe3qF,EAAU+E,QACvB/E,EAAU2E,UAAU,CAClB3E,EAAU0E,OACV1E,EAAUiF,KACVjF,EAAU+E,QACR/E,EAAU2E,UAAU,CAClB3E,EAAU4E,KACV5E,EAAUC,OACVD,EAAU0E,OACV1E,EAAUiF,KACVjF,EAAU+E,QAGR/E,EAAUwE,WAMpBsmF,cAAe9qF,EAAU+E,QACvB/E,EAAU2E,UAAU,CAClB3E,EAAU0E,OACV1E,EAAUiF,KACVjF,EAAU+E,QACR/E,EAAU2E,UAAU,CAClB3E,EAAU4E,KACV5E,EAAUC,OACVD,EAAU0E,OACV1E,EAAUiF,KACVjF,EAAU+E,QAGR/E,EAAUwE,WAOpB4kF,UAAWppF,EAAU4E,KACrBykF,aAAcrpF,EAAU4E,KACxBwjF,SAAUpoF,EAAU4E,KACpB2kF,oBAAqBvpF,EAAU4E,KAC/BikF,iBAAkB7oF,EAAU2E,UAAU,CAAC3E,EAAUiF,KAAMjF,EAAU4E,OACjEgkF,WAAY5oF,EAAU2E,UAAU,CAAC3E,EAAUiF,KAAMjF,EAAUC,SAC3D+oF,kBAAmBhpF,EAAUiF,KAC7BwjF,WAAYzoF,EAAU0E,QCtKxB,MAAMwmF,GAAM,CACV9rC,SA4SF,SAAqBN,EAASC,EAAIiD,GAChC,OAGS37C,SAAM+vC,GAEb,OADA0I,EAAQG,QAAQ7I,GACT+0C,CACR,EAGQA,SAAAA,EAAG/0C,GACV,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACTg1C,GAGFppC,EAAI5L,EACZ,CAGQg1C,SAAAA,EAAGh1C,GACV,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACTi1C,GAGFrpC,EAAI5L,EACZ,CAGQi1C,SAAAA,EAAIj1C,GACPA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT/O,GAGF2a,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GACb,OAAgB,OAATA,GAAiBkI,GAAmBlI,GAAQ4L,EAAI5L,GAAQ2I,EAAG3I,EACnE,CACF,EAtVC7T,SAAS,GAEL+oD,GAAS,CACblsC,SAsVF,SAAwBN,EAASC,EAAIiD,GAEnC,IAAIupC,EAGAC,EACJ,OAAOF,EAGEA,SAAAA,EAAOl1C,GACVA,OAAS,KAATA,EACK0I,EAAQH,MACb8sC,GACAtoD,EACAuoD,EAHK5sC,CAIL1I,GAGS,KAATA,GAAwB,KAATA,EACV0I,EAAQH,MAAMgtC,GAAaxoD,EAAMuoD,EAAjC5sC,CAA0D1I,GAQxD,OAATA,GACAgI,GAAahI,IACboI,GAAkBpI,IACR,KAATA,GAAeqI,GAAmBrI,GAE5BjT,EAAKiT,IAGd0I,EAAQG,QAAQ7I,GACTk1C,EACR,CAGQI,SAAAA,EAAwBt1C,GAC3BA,OAAS,KAATA,GACFo1C,EAAiCD,EACjCA,OAA6B9vF,EAC7BqjD,EAAQG,QAAQ7I,GACTk1C,IAGI,KAATl1C,IAAam1C,GAA6B,GAC9CzsC,EAAQG,QAAQ7I,GACTk1C,EACR,CAGQnoD,SAAAA,EAAKiT,GACZ,OAAKo1C,GAAmCD,EAIjCvpC,EAAI5L,GAHF2I,EAAG3I,EAIb,CACF,EAlZC7T,SAAS,GAELjX,GAAO,CACX8zB,SAkZF,SAAsBN,EAASC,GACzB0I,IAAAA,EAAU,EACd,OAAOmkC,EAGEA,SAAAA,EAAOx1C,GACVA,OAAS,KAATA,EACK0I,EAAQH,MACb8sC,GACA1sC,EACA8sC,EAHK/sC,CAIL1I,IAGS,KAATA,GACFqR,IAGW,KAATrR,EACK0I,EAAQH,MACbgtC,GACAG,EACAD,EAHK/sC,CAIL1I,GAGA21C,GAAQ31C,GACH2I,EAAG3I,GAGR41C,GAAoB51C,GACf0I,EAAQH,MAAMgtC,GAAa5sC,EAAI8sC,EAA/B/sC,CAAqD1I,IAG9D0I,EAAQG,QAAQ7I,GACTw1C,GACR,CAGQC,SAAAA,EAAqBz1C,GAE5B,OADA0I,EAAQG,QAAQ7I,GACTw1C,CACR,CAGQE,SAAAA,EAAe11C,GAEtB,OADAqR,IACOA,EAAU,EAAI1I,EAAG3I,GAAQy1C,EAAqBz1C,EACtD,CACF,EAlcC7T,SAAS,GAELopD,GAAc,CAClBvsC,SAmeF,SAA6BN,EAASC,EAAIiD,GACxC,OAGS37C,SAAM+vC,GAEb,OADA0I,EAAQG,QAAQ7I,GACT/O,CACR,EAGQA,SAAAA,EAAM+O,GAEb,OAAI41C,GAAoB51C,IACtB0I,EAAQG,QAAQ7I,GACT/O,GAIF0kD,GAAQ31C,GAAQ2I,EAAG3I,GAAQ4L,EAAI5L,EACvC,CACF,EAtfC7T,SAAS,GAELkpD,GAA0B,CAC9BrsC,SA8bF,SAAyCN,EAASC,EAAIiD,GACpD,OAGS37C,SAAM+vC,GAEb,OADA0I,EAAQG,QAAQ7I,GACT4X,CACR,EAGQA,SAAAA,EAAO5X,GACd,OAAIyH,GAAWzH,IACb0I,EAAQG,QAAQ7I,GACT4X,GAGI,KAAT5X,GACF0I,EAAQG,QAAQ7I,GACT/O,GAGF2a,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GAGb,OAAO21C,GAAQ31C,GAAQ2I,EAAG3I,GAAQ4L,EAAI5L,EACvC,CACF,EA3dC7T,SAAS,GAEL0pD,GAAc,CAClB7sC,SAwIF,SAA6BN,EAASC,EAAIiD,GAClCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GAEVA,GAAS,KAATA,GAAwB,MAATA,IACf81C,GAAY30E,EAAK2a,WAClBi6D,GAAmB50E,EAAKmpC,QAEjBsB,OAAAA,EAAI5L,GAQN0I,OALPA,EAAQE,MAAM,mBACdF,EAAQE,MAAM,sBAIPF,EAAQH,MACbusC,GACApsC,EAAQlZ,QAAQ0lD,GAAQxsC,EAAQlZ,QAAQta,GAAM6X,GAAO6e,GACrDA,EAHKlD,CAIL1I,EACH,EAGQjT,SAAAA,EAAKiT,GAGL2I,OAFPD,EAAQI,KAAK,sBACbJ,EAAQI,KAAK,mBACNH,EAAG3I,EACX,CACF,EAvKClkB,SAAUg6D,IAENE,GAAe,CACnBhtC,SAuKF,SAA8BN,EAASC,EAAIiD,GACnCzqC,MAAAA,EAAO1Z,KACb,OAGSwI,SAAM+vC,GAEVA,GAAS,KAATA,GAAwB,MAATA,IACfi2C,GAAa90E,EAAK2a,WACnBi6D,GAAmB50E,EAAKmpC,QAEjBsB,OAAAA,EAAI5L,GAMb,OAHA0I,EAAQE,MAAM,mBACdF,EAAQE,MAAM,uBACdF,EAAQG,QAAQ7I,GACTk2C,CACR,EAGQA,SAAAA,EAAGl2C,GACV,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACTm2C,GAGFvqC,EAAI5L,EACZ,CAGQm2C,SAAAA,EAAGn2C,GACV,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACT71C,GAGFyhD,EAAI5L,EACZ,CAGQ71C,SAAAA,EAAE61C,GACT,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACTo2C,GAGFxqC,EAAI5L,EACZ,CAGQo2C,SAAAA,EAAEp2C,GACT,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACT8kB,GAGFA,EAAM9kB,EACd,CAGQ8kB,SAAAA,EAAM9kB,GACTA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTq2C,GAGFzqC,EAAI5L,EACZ,CAGQq2C,SAAAA,EAAOr2C,GACVA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTs2C,GAGF1qC,EAAI5L,EACZ,CAGQs2C,SAAAA,EAAOt2C,GACVA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACT/O,GAGF2a,EAAI5L,EACZ,CAGQ/O,SAAAA,EAAM+O,GACb,OAAgB,OAATA,GACLgI,GAAahI,IACboI,GAAkBpI,IAClBqI,GAAmBrI,GACjB4L,EAAI5L,GACJ0I,EAAQlZ,QAAQ0lD,GAAQxsC,EAAQlZ,QAAQta,GAAM6X,GAAO6e,EAArDlD,CAA0D1I,EAC/D,CAGQjT,SAAAA,EAAKiT,GAGL2I,OAFPD,EAAQI,KAAK,uBACbJ,EAAQI,KAAK,mBACNH,EAAG3I,EACX,CACF,EAhRClkB,SAAUm6D,IAENM,GAAgB,CACpBvtC,SA8BF,SAA+BN,EAASC,EAAIiD,GACpCzqC,MAAAA,EAAO1Z,KAGb,IAAI+uF,EAGAC,EACJ,OAGSxmF,SAAM+vC,GAEX,IAAC02C,GAAS12C,KACT22C,GAAcx1E,EAAK2a,WACpBi6D,GAAmB50E,EAAKmpC,QAEjBsB,OAAAA,EAAI5L,GAKN42C,OAFPluC,EAAQE,MAAM,mBACdF,EAAQE,MAAM,wBACPguC,EAAM52C,EACd,EAGQ42C,SAAAA,EAAM52C,GACb,OAAI02C,GAAS12C,IACX0I,EAAQG,QAAQ7I,GACT42C,GAGI,KAAT52C,GACF0I,EAAQG,QAAQ7I,GACTx3C,GAGFojD,EAAI5L,EACZ,CAGQx3C,SAAAA,EAAMw3C,GACTA,OAAS,KAATA,EACK0I,EAAQH,MAAMgtC,GAAaxoD,EAAM8pD,EAAjCnuC,CAAkD1I,GAG9C,KAATA,GAAwB,KAATA,EACV0I,EAAQH,MAAMgtC,GAAa3pC,EAAKkrC,EAAhCpuC,CAA8D1I,GAGnE6H,GAAkB7H,KACfy2C,GAAyB9uC,GAAW3H,KACvCy2C,GAAwB,GAG1B/tC,EAAQG,QAAQ7I,GACTx3C,GAGFukC,EAAKiT,EACb,CAGQ62C,SAAAA,EAAgB72C,GAIvB,OAHA0I,EAAQG,QAAQ7I,GAChBw2C,GAAS,EACTC,OAAwBpxF,EACjBmD,CACR,CAGQsuF,SAAAA,EAA6B92C,GAEpC,OADA0I,EAAQG,QAAQ7I,GACT+2C,CACR,CAGQA,SAAAA,EAAsB/2C,GACzBA,OAAS,KAATA,EACK0I,EAAQH,MAAMgtC,GAAa3pC,EAAKirC,EAAhCnuC,CAAiD1I,GAGnDx3C,EAAMw3C,EACd,CAGQjT,SAAAA,EAAKiT,GACZ,OAAIw2C,IAAWC,GACb/tC,EAAQI,KAAK,wBACbJ,EAAQI,KAAK,mBACNH,EAAG3I,IAGL4L,EAAI5L,EACZ,CACF,EA5HClkB,SAAU66D,IAINx+E,GAAO,CAAA,EAGA6+E,GAAqB,CAChC7+E,SAEF,IAAI6nC,GAAO,GAEX,KAAOA,GAAO,KACZ7nC,GAAK6nC,IAAQu2C,GACbv2C,KACa,KAATA,GAAaA,GAAO,GACN,KAATA,KAAaA,GAAO,IA4d/B,SAAS41C,GAAoB51C,GAEzBA,OAAS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,MAATA,CAEH,CAMD,SAAS21C,GAAQ31C,GACRA,OAAS,OAATA,GAA0B,KAATA,GAAeiI,GAA0BjI,EAClE,CAMD,SAAS02C,GAAS12C,GAChB,OACW,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACA6H,GAAkB7H,EAErB,CAGD,SAAS81C,GAAY91C,GAEjBA,OAAS,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,MAATA,GACAiI,GAA0BjI,EAE7B,CAGD,SAASi2C,GAAaj2C,GACbA,OAAS,OAATA,IAAkByH,GAAWzH,EACrC,CAGD,SAAS22C,GAAc32C,GACrB,OAAgB,KAATA,GAAei2C,GAAaj2C,EACpC,CAMD,SAAS+1C,GAAmBzrC,GAC1B,IAAIzyC,EAAQyyC,EAAOhnD,OACfkgB,GAAS,EAEN3L,KAAAA,KAAS,CACR0xC,MAAAA,EAAQe,EAAOzyC,GAAO,GAE5B,IACkB,cAAf0xC,EAAMt9C,MAAuC,eAAfs9C,EAAMt9C,QACpCs9C,EAAMoN,UACP,CACAnzC,GAAS,EACT,KARY,CAYV+lC,GAAAA,EAAM0tC,8BAA+B,CACvCzzE,GAAS,EACT,KACD,CACF,CAQD,OANI8mC,EAAOhnD,OAAS,IAAMkgB,IAGxB8mC,EAAOA,EAAOhnD,OAAS,GAAG,GAAG2zF,+BAAgC,GAGxDzzE,CACR,CAxjBDrL,GAAK,IAAMo+E,GACXp+E,GAAK,IAAMo+E,GACXp+E,GAAK,IAAMo+E,GACXp+E,GAAK,IAAMo+E,GACXp+E,GAAK,IAAM,CAACo+E,GAAeP,IAC3B79E,GAAK,KAAO,CAACo+E,GAAeP,IAC5B79E,GAAK,IAAM,CAACo+E,GAAeV,IAC3B19E,GAAK,KAAO,CAACo+E,GAAeV,IC3D5B,MAAMqB,GAAS,CACbluC,SAmYF,SAAwBN,EAASC,EAAIiD,GAC7BzqC,MAAAA,EAAO1Z,KACNghD,OAAAA,GACLC,GAOO0G,SAAYpP,GACnB,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAC9C,OAAO2wC,GACY,gCAAjBA,EAAK,GAAGhoC,MACyC,IAAjDgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,OACpCqlD,EAAG3I,GACH4L,EAAI5L,EACT,GAZC,8BACA,EAYH,EApZC7T,SAAS,GAgCX,SAASgrD,GAAiCzuC,EAASC,EAAIiD,GAC/CzqC,MAAAA,EAAO1Z,KACb,IAAIoQ,EAAQsJ,EAAKmpC,OAAOhnD,OAIxB,MAAMovD,EAAUvxC,EAAK+nC,OAAOkuC,eAAiBj2E,EAAK+nC,OAAOkuC,aAAe,IAGpE1gC,IAAAA,EAEG7+C,KAAAA,KAAS,CACR0xC,MAAAA,EAAQpoC,EAAKmpC,OAAOzyC,GAAO,GAEjC,GAAmB,eAAf0xC,EAAMt9C,KAAuB,CAC/ByqD,EAAanN,EACb,KALY,CAQd,GACiB,oBAAfA,EAAMt9C,MACS,cAAfs9C,EAAMt9C,MACS,UAAfs9C,EAAMt9C,MACS,UAAfs9C,EAAMt9C,MACS,SAAfs9C,EAAMt9C,KAEN,KAEH,CAED,OAGSgE,SAAM+vC,GACb,IAAK0W,IAAeA,EAAWC,UACtB/K,OAAAA,EAAI5L,GAGb,MAAMztC,EAAK8/C,GACTlxC,EAAKyrC,eAAe,CAClB38C,MAAOymD,EAAWvmD,IAClBA,IAAKgR,EAAKkJ,SAIV9X,GAAqB,KAArBA,EAAGk1B,WAAW,KAAcirB,EAAQj5C,SAASlH,EAAGgT,MAAM,IACjDqmC,OAAAA,EAAI5L,GAMN2I,OAHPD,EAAQE,MAAM,8BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,8BACNH,EAAG3I,EACX,CACF,CAGD,SAASq3C,GAAkC/sC,EAAQ1iC,GACjD,IAAI/P,EAAQyyC,EAAOhnD,OAKZuU,KAAAA,KACL,GAC4B,eAA1ByyC,EAAOzyC,GAAO,GAAG5L,MACI,UAArBq+C,EAAOzyC,GAAO,GACd,CACayyC,EAAOzyC,GAAO,GAC3B,KACD,CAIHyyC,EAAOzyC,EAAQ,GAAG,GAAG5L,KAAO,OAC5Bq+C,EAAOzyC,EAAQ,GAAG,GAAG5L,KAAO,6BAE5B,MAAM9H,EAAO,CACX8H,KAAM,kBACNgE,MAAOlM,OAAOqpC,OAAO,GAAIkd,EAAOzyC,EAAQ,GAAG,GAAG5H,OAC9CE,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIkd,EAAOA,EAAOhnD,OAAS,GAAG,GAAG6M,MAGhDg8C,EAAS,CACblgD,KAAM,wBACNgE,MAAOlM,OAAOqpC,OAAO,GAAIkd,EAAOzyC,EAAQ,GAAG,GAAG1H,KAC9CA,IAAKpM,OAAOqpC,OAAO,GAAIkd,EAAOzyC,EAAQ,GAAG,GAAG1H,MAG9Cg8C,EAAOh8C,IAAIkuC,SACX8N,EAAOh8C,IAAI6T,SACXmoC,EAAOh8C,IAAI48C,eACX,MAAMljD,EAAS,CACboC,KAAM,wBACNgE,MAAOlM,OAAOqpC,OAAO,CAAA,EAAI+e,EAAOh8C,KAChCA,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIkd,EAAOA,EAAOhnD,OAAS,GAAG,GAAG2M,QAEhDkhC,EAAQ,CACZllC,KAAM,cACNu9C,YAAa,SACbv5C,MAAOlM,OAAOqpC,OAAO,CAAA,EAAIvjC,EAAOoG,OAChCE,IAAKpM,OAAOqpC,OAAO,CAAA,EAAIvjC,EAAOsG,MAI1BmnF,EAAc,CAElBhtC,EAAOzyC,EAAQ,GACfyyC,EAAOzyC,EAAQ,GACf,CAAC,QAAS1T,EAAMyjB,GAChB0iC,EAAOzyC,EAAQ,GACfyyC,EAAOzyC,EAAQ,GACf,CAAC,QAASs0C,EAAQvkC,GAClB,CAAC,OAAQukC,EAAQvkC,GACjB,CAAC,QAAS/d,EAAQ+d,GAClB,CAAC,QAASupB,EAAOvpB,GACjB,CAAC,OAAQupB,EAAOvpB,GAChB,CAAC,OAAQ/d,EAAQ+d,GACjB0iC,EAAOA,EAAOhnD,OAAS,GACvBgnD,EAAOA,EAAOhnD,OAAS,GACvB,CAAC,OAAQa,EAAMyjB,IAGjB,OADA0iC,EAAOtxC,OAAOnB,EAAOyyC,EAAOhnD,OAASuU,EAAQ,KAAMy/E,GAC5ChtC,CACR,CAGD,SAASitC,GAAwB7uC,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KAIPirD,EAAUvxC,EAAK+nC,OAAOkuC,eAAiBj2E,EAAK+nC,OAAOkuC,aAAe,IACpE/iF,IAGAga,EAHAha,EAAO,EAIX,OAGSpE,SAAM+vC,GAKb,OAJA0I,EAAQE,MAAM,mBACdF,EAAQE,MAAM,8BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,8BACN0uC,CACR,EAGQA,SAAAA,EAAUx3C,GACbA,OAAS,KAATA,EAAoB4L,EAAI5L,IAC5B0I,EAAQE,MAAM,yBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,yBACbJ,EAAQE,MAAM,yBACdF,EAAQE,MAAM,eAAeY,YAAc,SACpCiuC,EACR,CAGQA,SAAAA,EAASz3C,GAEhB,IAAIuJ,EAEAvJ,OAAS,OAATA,GAA0B,KAATA,GAAe3rC,IAAS,IACpCu3C,EAAI5L,GAGA,KAATA,EACG3xB,GAILq6B,EAAQI,KAAK,eACbS,EAAQb,EAAQI,KAAK,yBACd4J,EAAQj5C,SAAS44C,GAAoBlxC,EAAKyrC,eAAerD,KA0B3Dp5C,SAAI6vC,GAKX,OAJA0I,EAAQE,MAAM,8BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,8BACbJ,EAAQI,KAAK,mBACNH,CACR,CA/BOx4C,CAAI6vC,GACJ4L,EAAI5L,IAPC4L,EAAI5L,IAUf0I,EAAQG,QAAQ7I,GAEXiI,GAA0BjI,KAC7B3xB,GAAO,GAGO,KAAT2xB,EAAc03C,EAAaD,EACnC,CAGQC,SAAAA,EAAW13C,GACdA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChC0I,EAAQG,QAAQ7I,GAChB3rC,IACOojF,GAGFA,EAASz3C,EACjB,CAUF,CAGD,SAAS23C,GAAwBjvC,EAASC,EAAIiD,GACtCzqC,MAAAA,EAAO1Z,KAIPirD,EAAUvxC,EAAK+nC,OAAOkuC,eAAiBj2E,EAAK+nC,OAAOkuC,aAAe,IAGxE,IAAI7kC,EAIAlkC,EAHAha,EAAO,EAIX,OAGSpE,SAAM+vC,GAMb,OALA0I,EAAQE,MAAM,yBAAyBgF,YAAa,EACpDlF,EAAQE,MAAM,8BACdF,EAAQE,MAAM,oCACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oCACN4N,CACR,EAGQA,SAAAA,EAAW1W,GACdA,OAAS,KAATA,GACF0I,EAAQE,MAAM,+BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,+BACbJ,EAAQE,MAAM,oCACPiJ,GAGFjG,EAAI5L,EACZ,CAGQ6R,SAAAA,EAAQ7R,GAEf,IAAIuJ,EAEAvJ,OAAS,OAATA,GAA0B,KAATA,GAAe3rC,EAAO,IAClCu3C,EAAI5L,GAGA,KAATA,EACG3xB,GAILk7B,EAAQb,EAAQI,KAAK,oCACrByJ,EAAaF,GAAoBlxC,EAAKyrC,eAAerD,IACrDb,EAAQE,MAAM,oCACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oCACbJ,EAAQI,KAAK,8BACN0J,GATE5G,EAAI5L,GAYXkI,GAAmBlI,IACrB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACbz0C,IACOw9C,IAGTnJ,EAAQE,MAAM,eAAeY,YAAc,SACpChhD,EAAMw3C,GACd,CAGQx3C,SAAAA,EAAMw3C,GAEXA,OAAS,OAATA,GACAkI,GAAmBlI,IACV,KAATA,GACS,KAATA,GACA3rC,EAAO,KAEPq0C,EAAQI,KAAK,eACN+I,EAAQ7R,KAGZiI,GAA0BjI,KAC7B3xB,GAAO,GAGTha,IACAq0C,EAAQG,QAAQ7I,GACA,KAATA,EAAc8R,EAActpD,EACpC,CAGQspD,SAAAA,EAAY9R,GACfA,OAAS,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChC0I,EAAQG,QAAQ7I,GAChB3rC,IACO7L,GAGFA,EAAMw3C,EACd,CAGQwS,SAAAA,EAAWxS,GACdA,OAAS,KAATA,GACF0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBAINL,GAAaC,EAAS3b,EAAM,oCAG9B6e,EAAI5L,EACZ,CAGQjT,SAAAA,EAAKiT,GAKL2I,OAJF+J,EAAQj5C,SAAS84C,IACpBG,EAAQvnD,KAAKonD,GAGR5J,EAAG3I,EACX,CACF,CAGD,SAAS43C,GAA+BlvC,EAASC,EAAIiD,GAEnD,OAAOlD,EAAQH,MAAMiF,GAAW7E,EAAID,EAAQlZ,QAAQ0nD,GAAQvuC,EAAIiD,GACjE,CAGD,SAASisC,GAAyBnvC,GAChCA,EAAQI,KAAK,wBACd,CC5XM,SAASiD,GAAkB/L,GAChC,OACW,OAATA,GACAiI,GAA0BjI,IAC1BoI,GAAkBpI,GAEX,EAGLqI,GAAmBrI,GACd,OADT,CAGD,CCPM,SAAS83C,GAAiBxrF,EAAU,IACzC,IAAIyrF,EAASzrF,EAAQ0rF,YACrB,MAAM1nC,EAAY,CAChBtH,SAuGF,SAA+BN,EAASC,EAAIiD,GACpC9vB,MAAAA,EAAWr0B,KAAKq0B,SAChBwuB,EAAS7iD,KAAK6iD,OAChBj2C,IAAAA,EAAO,EACX,OAGSpE,SAAM+vC,GACb,GACe,MAAblkB,GACsC,oBAAtCwuB,EAAOA,EAAOhnD,OAAS,GAAG,GAAG2I,KAEtB2/C,OAAAA,EAAI5L,GAINgQ,OADPtH,EAAQE,MAAM,kCACPoH,EAAKhQ,EACb,EAGQgQ,SAAAA,EAAKhQ,GACZ,MAAM/V,EAAS8hB,GAAkBjwB,GAE7BkkB,GAAS,MAATA,EAEE3rC,OAAAA,EAAO,EAAUu3C,EAAI5L,IACzB0I,EAAQG,QAAQ7I,GAChB3rC,IACO27C,GAGL37C,GAAAA,EAAO,IAAM0jF,EAAQ,OAAOnsC,EAAI5L,GACpC,MAAMuJ,EAAQb,EAAQI,KAAK,kCACrB7X,EAAQ8a,GAAkB/L,GAGzB2I,OAFPY,EAAMgD,OAAStb,GAAoB,IAAVA,GAAesV,QAAQtc,GAChDsf,EAAMiD,QAAUviB,GAAsB,IAAXA,GAAgBsc,QAAQtV,GAC5C0X,EAAG3I,EACX,CACF,EA5ICgM,WAwBF,SAAiC1B,EAAQ1iC,GACvC,IAAI/P,GAAS,EAEb,OAASA,EAAQyyC,EAAOhnD,QAEtB,GACuB,UAArBgnD,EAAOzyC,GAAO,IACY,mCAA1ByyC,EAAOzyC,GAAO,GAAG5L,MACjBq+C,EAAOzyC,GAAO,GAAG20C,OACjB,CACA,IAAIH,EAAOx0C,EAEJw0C,KAAAA,KAEL,GACsB,SAApB/B,EAAO+B,GAAM,IACY,mCAAzB/B,EAAO+B,GAAM,GAAGpgD,MAChBq+C,EAAO+B,GAAM,GAAGE,OAChBjC,EAAOzyC,GAAO,GAAG1H,IAAI6T,OAASsmC,EAAOzyC,GAAO,GAAG5H,MAAM+T,QACnDsmC,EAAO+B,GAAM,GAAGl8C,IAAI6T,OAASsmC,EAAO+B,GAAM,GAAGp8C,MAAM+T,OACrD,CACAsmC,EAAOzyC,GAAO,GAAG5L,KAAO,wBACxBq+C,EAAO+B,GAAM,GAAGpgD,KAAO,wBACvB,MAAMgsF,EAAgB,CACpBhsF,KAAM,gBACNgE,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGp8C,OACzCE,IAAKpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOzyC,GAAO,GAAG1H,MAEpCgI,EAAO,CACXlM,KAAM,oBACNgE,MAAOlM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAO+B,GAAM,GAAGl8C,KACzCA,IAAKpM,OAAOqpC,OAAO,CAAd,EAAkBkd,EAAOzyC,GAAO,GAAG5H,QAGpC08C,EAAa,CACjB,CAAC,QAASsrC,EAAerwE,GACzB,CAAC,QAAS0iC,EAAO+B,GAAM,GAAIzkC,GAC3B,CAAC,OAAQ0iC,EAAO+B,GAAM,GAAIzkC,GAC1B,CAAC,QAASzP,EAAMyP,IAGlB5O,GACE2zC,EACAA,EAAWrpD,OACX,EACA0oD,GACEpkC,EAAQshC,OAAO3B,WAAWuF,WAAWhB,KACrCxB,EAAO/kC,MAAM8mC,EAAO,EAAGx0C,GACvB+P,IAIJ5O,GAAO2zC,EAAYA,EAAWrpD,OAAQ,EAAG,CACvC,CAAC,OAAQ6U,EAAMyP,GACf,CAAC,QAAS0iC,EAAOzyC,GAAO,GAAI+P,GAC5B,CAAC,OAAQ0iC,EAAOzyC,GAAO,GAAI+P,GAC3B,CAAC,OAAQqwE,EAAerwE,KAE1B5O,GAAOsxC,EAAQ+B,EAAO,EAAGx0C,EAAQw0C,EAAO,EAAGM,GAC3C90C,EAAQw0C,EAAOM,EAAWrpD,OAAS,EACnC,KACD,CAEJ,CAGHuU,GAAS,EAET,OAASA,EAAQyyC,EAAOhnD,QACQ,mCAA1BgnD,EAAOzyC,GAAO,GAAG5L,OACnBq+C,EAAOzyC,GAAO,GAAG5L,KAAO,QAI5B,OAAOq+C,CACR,GA5FM,OAJHytC,UACFA,GAAS,GAGJ,CACL5/E,KAAM,CACJ,IAAOm4C,GAETxD,WAAY,CACVhB,KAAM,CAACwE,IAETpE,iBAAkB,CAChBJ,KAAM,CAAC,MA8HZ,CCxJM,MAAMosC,GAAW,CACtBvoD,KAAM,CACJmc,KAAM,CACJ9C,SAqIN,SAAuBN,EAASC,EAAIiD,GAC5BzqC,MAAAA,EAAO1Z,KAGPiC,EAAQ,GACVyuF,IAGAC,EAGAC,EANAF,EAAmB,EAOvB,OAGSloF,SAAM+vC,GAMTA,GAJJ0I,EAAQE,MAAM,SAAS0vC,OAAS5uF,EAChCg/C,EAAQE,MAAM,aACdF,EAAQE,MAAM,YAED,MAAT5I,EACKu4C,OAAAA,EAAgBv4C,GAMlBw4C,OAHPL,IACAzvC,EAAQE,MAAM,6BAEP4vC,EAAkBx4C,EAC1B,EAGQu4C,SAAAA,EAAgBv4C,GAKvB,OAJA0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACbsvC,GAAgB,EACTK,CACR,CAGQA,SAAAA,EAAcz4C,GACjBA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAyDjC04C,SAAa14C,GAChBA,GAAS,OAATA,EACK4L,OAAAA,EAAI5L,GAGb0I,EAAQI,KAAK,YACbJ,EAAQI,KAAK,aACb,MAAM6vC,EAAoBx3E,EAAK0pC,UAExBnC,OADPvnC,EAAK0pC,WAAY,EACVnC,EAAQlZ,QACb,CACEwZ,SAAU4vC,EACVzsD,SAAS,IAEX,SAAU6T,GAGD64C,OAFP13E,EAAK0pC,UAAY8tC,EACjBjwC,EAAQE,MAAM,qBACPiwC,EAAoB74C,EARxB,IAUL,SAAUA,GAED4L,OADPzqC,EAAK0pC,UAAY8tC,EACV/sC,EAAI5L,EACZ,GAbI0I,CAcL1I,EACH,CAhFU04C,CAAa14C,GAGlBmI,GAAcnI,IAChB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GACT84C,IAGLV,IACFA,OAAgB/yF,EAChB8yF,KAGW,MAATn4C,EACKu4C,EAAgBv4C,IAGzB0I,EAAQE,MAAM,6BACP4vC,EAAkBx4C,IAC1B,CAGQ84C,SAAAA,EAAiB94C,GACxB,OAAImI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACT84C,IAGTpwC,EAAQI,KAAK,cACN2vC,EAAcz4C,GACtB,CAGQw4C,SAAAA,EAAkBx4C,GAEzB,OAAa,OAATA,GAA0B,MAATA,GAAgBiI,GAA0BjI,IAC7D0I,EAAQI,KAAK,6BACN2vC,EAAcz4C,KAGvB0I,EAAQG,QAAQ7I,GACA,KAATA,EAAc+4C,EAA0BP,EAChD,CAGQO,SAAAA,EAAwB/4C,GAC/B,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACTw4C,GAGFA,EAAkBx4C,EAC1B,CA8BQ64C,SAAAA,EAAoB74C,GACvBA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAC/Bg5C,EAAgBh5C,GAGrBmI,GAAcnI,IAChB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GACTi5C,GAGI,KAATj5C,GACF0I,EAAQE,MAAM,wBACdF,EAAQG,QAAQ7I,GAChBq4C,GAAU,EACV3uF,EAAMyB,KAAK,QACJ+tF,GAGI,KAATl5C,GACF0I,EAAQE,MAAM,2BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,2BACbp/C,EAAMyB,KAAK,QACJguF,GAGI,MAATn5C,GACF0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACN+vC,GAGFjtC,EAAI5L,EACZ,CAGQi5C,SAAAA,EAAsBj5C,GAC7B,OAAImI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACTi5C,IAGTvwC,EAAQI,KAAK,cACN+vC,EAAoB74C,GAC5B,CAGQk5C,SAAAA,EAAkBl5C,GACrBA,OAAS,KAATA,GACF0I,EAAQG,QAAQ7I,GACTk5C,IAGTxwC,EAAQI,KAAK,wBAEA,KAAT9I,GACF0I,EAAQE,MAAM,2BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,2BACbp/C,EAAMA,EAAMpG,OAAS,GACS,SAA5BoG,EAAMA,EAAMpG,OAAS,GAAgB,SAAW,QAC3C81F,GAGFP,EAAoB74C,GAC5B,CAGQm5C,SAAAA,EAAmBn5C,GACtBA,OAAS,KAATA,GACF0I,EAAQE,MAAM,wBACdF,EAAQG,QAAQ7I,GAChBq4C,GAAU,EACHa,GAGFttC,EAAI5L,EACZ,CAGQo5C,SAAAA,EAAoBp5C,GACvBA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAC/Bg5C,EAAgBh5C,GAGrBmI,GAAcnI,IAChB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GACTi5C,GAGI,MAATj5C,GACF0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACN+vC,GAGFjtC,EAAI5L,EACZ,CAGQg5C,SAAAA,EAAgBh5C,GAInB,OAHJ0I,EAAQI,KAAK,qBAGRuvC,GAAWF,IAAqBzuF,EAAMpG,OAI9B,OAAT08C,EACKq5C,EAAWr5C,GAGb0I,EAAQH,MACb+wC,GACAD,EACA3wC,EAAQlZ,QACN,CACEwZ,SAAU4vC,EACVzsD,SAAS,GAEXsc,GAAaC,EAAS6wC,EAAW,aAAc,GAC/CF,GATG3wC,CAWL1I,GAlBO4L,EAAI5L,EAmBd,CAGQq5C,SAAAA,EAAWr5C,GAEX2I,OADPD,EAAQI,KAAK,SACNH,EAAG3I,EACX,CAGQu5C,SAAAA,EAAUv5C,GAEVw5C,OADP9wC,EAAQE,MAAM,aACP4wC,EAAax5C,EACrB,CAGQw5C,SAAAA,EAAax5C,GAGhBA,OAFJ0I,EAAQE,MAAM,YAED,MAAT5I,EACKy5C,EAAgBz5C,IAGzB0I,EAAQE,MAAM,6BAEP8wC,EAAkB15C,GAC1B,CAGQy5C,SAAAA,EAAgBz5C,GAIvB,OAHA0I,EAAQE,MAAM,oBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,oBACN6wC,CACR,CAGQA,SAAAA,EAAc35C,GACjBA,OAAS,OAATA,GAAiBkI,GAAmBlI,GAoDjC45C,SAAa55C,GAGhBA,GAFJ0I,EAAQI,KAAK,YAEA,OAAT9I,EACK65C,OAAAA,EAAe75C,GAGjB0I,OAAAA,EAAQH,MACb+wC,GACAO,EACAnxC,EAAQlZ,QACN,CACEwZ,SAAU4vC,EACVzsD,SAAS,GAEXsc,GAAaC,EAAS8wC,EAAc,aAAc,GAClDK,GATGnxC,CAWL1I,EACH,CAtEU45C,CAAa55C,GAGlBmI,GAAcnI,IAChB0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GACT85C,GAGI,MAAT95C,EACKy5C,EAAgBz5C,IAGzB0I,EAAQE,MAAM,6BACP8wC,EAAkB15C,GAC1B,CAGQ85C,SAAAA,EAAiB95C,GACxB,OAAImI,GAAcnI,IAChB0I,EAAQG,QAAQ7I,GACT85C,IAGTpxC,EAAQI,KAAK,cACN6wC,EAAc35C,GACtB,CAGQ05C,SAAAA,EAAkB15C,GAEzB,OAAa,OAATA,GAA0B,MAATA,GAAgBiI,GAA0BjI,IAC7D0I,EAAQI,KAAK,6BACN6wC,EAAc35C,KAGvB0I,EAAQG,QAAQ7I,GACA,KAATA,EAAc+5C,EAA0BL,EAChD,CAGQK,SAAAA,EAAwB/5C,GAC/B,OAAa,KAATA,GAAwB,MAATA,GACjB0I,EAAQG,QAAQ7I,GACT05C,GAGFA,EAAkB15C,EAC1B,CAyBQ65C,SAAAA,EAAe75C,GAEfq5C,OADP3wC,EAAQI,KAAK,aACNuwC,EAAWr5C,EACnB,CAGD,SAAS44C,EAAelwC,EAASC,EAAIiD,GACnC,OAGS37C,SAAM+vC,GAIb,OAHA0I,EAAQE,MAAM,cACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,cACNL,GAAaC,EAASqI,EAAU,aACxC,EAGQA,SAAAA,EAAS/Q,GAGd7+B,GAAAA,EAAK+nC,OAAOgC,KAAK/pC,EAAKkJ,MAAM+zB,OACnB,OAAT4B,GACAkI,GAAmBlI,GAEZ4L,OAAAA,EAAI5L,GAGb,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAG5C,OAAC6d,EAAK+nC,OAAO3B,WAAWsE,QAAQC,KAAKryC,SAAS,iBAC9Cw6B,GACiB,eAAjBA,EAAK,GAAGhoC,MACRgoC,EAAK,GAAG2Y,eAAe3Y,EAAK,IAAI,GAAM3wC,QAAU,EAEzCsoD,EAAI5L,IAGb7+B,EAAK2pC,+BAAgC,EAC9BpC,EAAQH,MACbpnC,EAAK+nC,OAAO3B,WAAW5X,MACvB,SAAUqQ,GAED4L,OADPzqC,EAAK2pC,+BAAgC,EAC9Bc,EAAI5L,EAJR,IAML,SAAUA,GAED2I,OADPxnC,EAAK2pC,+BAAgC,EAC9BnC,EAAG3I,EACX,GATI0I,CAUL1I,GACH,CACF,CACF,EAtiBKxZ,QAUN,SAAsB8jB,EAAQ1iC,GACxB/P,IAGAmiF,EAGAC,EAGAC,EAGAjxC,EAGA2H,EAGAupC,EAGAC,EArBAviF,GAAS,EAuBb,OAASA,EAAQyyC,EAAOhnD,QAAQ,CACxBimD,MAAAA,EAAQe,EAAOzyC,GAAO,GAE5B,GAAIqiF,IACiB,8BAAf3wC,EAAMt9C,OACRg9C,EAAeA,GAAgBpxC,EAC/B+4C,EAAa/4C,IAKG,qBAAf0xC,EAAMt9C,MAA8C,aAAfs9C,EAAMt9C,OAC5C2kD,GACA,CACA,MAAM7H,EAAU,CACd98C,KAAM,eACNgE,MAAOq6C,EAAOrB,GAAc,GAAGh5C,MAC/BE,IAAKm6C,EAAOsG,GAAY,GAAGzgD,KAIvBgI,EAAO,CACXlM,KAAM,YACNgE,MAAO84C,EAAQ94C,MACfE,IAAK44C,EAAQ54C,IAEbq5C,YAAa,QAEfc,EAAOtxC,OACLiwC,EACA2H,EAAa3H,EAAe,EAC5B,CAAC,QAASF,EAASnhC,GACnB,CAAC,QAASzP,EAAMyP,GAChB,CAAC,OAAQzP,EAAMyP,GACf,CAAC,OAAQmhC,EAASnhC,IAEpB/P,GAAS+4C,EAAa3H,EAAe,EACrCA,OAAe5jD,EACfurD,OAAavrD,CACd,CAIDilD,GAAqB,SAArBA,EAAOzyC,GAAO,SACAxS,IAAd80F,GACAA,GAAaC,EAAgB,EAAI,GAAKviF,IACtB,qBAAf0xC,EAAMt9C,MACW,aAAfs9C,EAAMt9C,OACJkuF,EAAY,EAAItiF,GACe,eAA9ByyC,EAAO6vC,GAAW,GAAGluF,OAC3B,CACA,MAAMw7D,EAAO,CACXx7D,KAAMguF,EACF,iBACAD,EACA,cACA,YACJ/pF,MAAOq6C,EAAO6vC,GAAW,GAAGlqF,MAC5BE,IAAKm6C,EAAOzyC,GAAO,GAAG1H,KAExBm6C,EAAOtxC,OAAOnB,GAAwB,qBAAf0xC,EAAMt9C,KAA8B,EAAI,GAAI,EAAG,CACpE,OACAw7D,EACA7/C,IAEF0iC,EAAOtxC,OAAOmhF,EAAW,EAAG,CAAC,QAAS1yB,EAAM7/C,IAC5C/P,GAAS,EACTsiF,EAAYtiF,EAAQ,EACpBuiF,GAAgB,CACjB,CAEkB,aAAf7wC,EAAMt9C,OACRiuF,EAA6B,UAArB5vC,EAAOzyC,GAAO,GAElBqiF,IACFC,EAAYtiF,EAAQ,EACpBuiF,GAAgB,IAID,sBAAf7wC,EAAMt9C,OACRguF,EAAsC,UAArB3vC,EAAOzyC,GAAO,GAE3BoiF,IACFE,EAAYtiF,EAAQ,EACpBuiF,GAAgB,IAID,cAAf7wC,EAAMt9C,OACR+tF,EAA8B,UAArB1vC,EAAOzyC,GAAO,GAE1B,CAED,OAAOyyC,CACR,KA7HKgvC,GAAsB,CAC1BtwC,SAoiBF,SAAqCN,EAASC,EAAIiD,GAC5Cv3C,IAAAA,EAAO,EACX,OAGSpE,SAAM+vC,GAMb,OAHA0I,EAAQE,MAAM,SAEdF,EAAQG,QAAQ7I,GACT+wC,CACR,EAGQA,SAAAA,EAAW/wC,GACdA,OAAU,IAAVA,GAAwB,KAATA,GACjB0I,EAAQG,QAAQ7I,GAChB3rC,IACgB,IAATA,EAAas0C,EAAKooC,GAGd,OAAT/wC,GAAiBiI,GAA0BjI,GACtC2I,EAAG3I,GAGL4L,EAAI5L,EACZ,CACF,EA/jBC7T,SAAS,GCfX,MAAMkuD,GAAgB,CACpBrxC,SASF,SAA+BN,EAASC,EAAIiD,GACpCzqC,MAAAA,EAAO1Z,KACb,OAGS4kD,SAAKrM,GAEV,GACkB,OAAlB7+B,EAAK2a,WAEJ3a,EAAKwvC,mCAEC/E,OAAAA,EAAI5L,GAOb,OAJA0I,EAAQE,MAAM,iBACdF,EAAQE,MAAM,uBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,uBACN8O,CACR,EAGQA,SAAAA,EAAO5X,GAGd,OAAIiI,GAA0BjI,IAC5B0I,EAAQE,MAAM,+BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,+BACNwD,GAGI,KAATtM,GAAwB,MAATA,GACjB0I,EAAQE,MAAM,6BACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,6BACNwD,GAGFV,EAAI5L,EACZ,CAGQsM,SAAAA,EAAMtM,GACTA,OAAS,KAATA,GACF0I,EAAQE,MAAM,uBACdF,EAAQG,QAAQ7I,GAChB0I,EAAQI,KAAK,uBACbJ,EAAQI,KAAK,iBACNJ,EAAQH,MACb,CACES,SAAUsxC,IAEZ3xC,EACAiD,IAIGA,EAAI5L,EACZ,CACF,GApEYu6C,GAAkB,CAC7BpiF,KAAM,CACJ,GAAMkiF,KAqEV,SAASC,GAAkB5xC,EAASC,EAAIiD,GAChCzqC,MAAAA,EAAO1Z,KACb,OAAOghD,GAAaC,GAGXzX,SAAM+O,GACb,MAAM/L,EAAO9yB,EAAKmpC,OAAOnpC,EAAKmpC,OAAOhnD,OAAS,GAE5C,OACE2wC,GAAyB,eAAjBA,EAAK,GAAGhoC,MAGhBi8C,GAAmBlI,KACV,OAATA,EACE2I,EAAG3I,GACH4L,EAAI5L,EAEX,GAfmC,aAgBrC,CChGM,SAASw6C,GAAO50F,EAAO60F,GAC5B,MAAM72F,EAASskB,OAAOtiB,GAEtB,GAAyB,iBAAd60F,EACT,MAAM,IAAItyE,UAAU,sBAGlBtT,IAAAA,EAAQ,EACRgD,EAAQjU,EAAO+3B,QAAQ8+D,GAE3B,MAAkB,IAAX5iF,GACLhD,IACAgD,EAAQjU,EAAO+3B,QAAQ8+D,EAAW5iF,EAAQ4iF,EAAUn3F,QAGtD,OAAOuR,CACR,CCaD,MAAM4vC,GAAM,CAAA,EAAGvgD,eAYFw2F,GAcT,SAAU30C,EAAM9yC,EAAMwS,EAASnZ,GAE7B,IAAIgtC,EAEA44C,EAEgB,iBAATj/E,GAAqBA,aAAgBtP,QAE9CuuF,EAAS,CAAC,CAACj/E,EAAMwS,IACjB6zB,EAAWhtC,IAEX4lF,EAASj/E,EAETqmC,EAAW7zB,GAGR6zB,IACHA,EAAW,CAAA,GAGPqhD,MAAAA,EAAUpjE,GAAQ+hB,EAASquB,QAAU,IACrC7zC,EAiHZ,SAAiBo+D,GAET1uE,MAAAA,EAAS,GAEf,GAAsB,iBAAX0uE,EACT,MAAM,IAAI/pE,UAAU,sCAGtB,GAAI1kB,MAAMC,QAAQwuF,GAAS,CACrBr6E,IAAAA,GAAS,EAEb,OAASA,EAAQq6E,EAAO5uF,QACtBkgB,EAAOrY,KAAK,CACVyvF,GAAa1I,EAAOr6E,GAAO,IAC3BgjF,GAAW3I,EAAOr6E,GAAO,KAG9B,KAAM,CAEL,IAAIzT,EAECA,IAAAA,KAAO8tF,EACNztC,GAAItgD,KAAK+tF,EAAQ9tF,IACnBof,EAAOrY,KAAK,CAACyvF,GAAax2F,GAAMy2F,GAAW3I,EAAO9tF,KAGvD,CAED,OAAOof,CACR,CA9ImB8qB,CAAQ4jD,GAClB4I,IAAAA,GAAa,EAEjB,OAASA,EAAYhnE,EAAMxwB,QACzBwgE,GAAa/d,EAAM,OAAQge,GAG7B,OAAOhe,EAGP,SAASge,EAAQ35D,EAAM65D,GACjBpsD,IAEAkjF,EAFAljF,GAAS,EAIb,OAASA,EAAQosD,EAAQ3gE,QAAQ,CAC/B,MAAMozB,EAAgCutC,EAAQpsD,GAG5C8iF,GAAAA,EACEjkE,EAEAqkE,EAAcA,EAAY/wF,SAAS2xB,QAAQjF,QAAUrxB,EACrD01F,GAGF,OAGFA,EAAcrkE,CACf,CAED,GAAIqkE,EACF,OASJ,SAAiB3wF,EAAMssB,GACfzjB,MAAAA,EAAO6gB,EAAMgnE,GAAW,GACxBr1E,EAAUqO,EAAMgnE,GAAW,GACjC,IAMI5tF,EANA+C,EAAQ,EAER4H,EAAQ6e,EAAO1sB,SAAS2xB,QAAQvxB,GAEhCm5D,EAAQ,GAIZtwD,EAAKiU,UAAY,EAEbG,IAAAA,EAAQpU,EAAK0V,KAAKve,EAAKxE,OAE3B,KAAOyhB,GAAO,CACZna,EAAWma,EAAMxP,MAEjB,IAAIjS,EAAQ6f,KAAW4B,EAAO,CAC5BxP,MAAOwP,EAAMxP,MACbkZ,MAAO1J,EAAM0J,QAwBf,GArBqB,iBAAVnrB,IACTA,EAAQA,EAAMtC,OAAS,EAAI,CAAC2I,KAAM,OAAQrG,cAASP,IAGvC,IAAVO,IACEqK,IAAU/C,GACZq2D,EAAMp4D,KAAK,CACTc,KAAM,OACNrG,MAAOwE,EAAKxE,MAAM2f,MAAMtV,EAAO/C,KAI/BzJ,MAAMC,QAAQkC,GAChB29D,EAAMp4D,QAAQvF,GACLA,GACT29D,EAAMp4D,KAAKvF,GAGbqK,EAAQ/C,EAAWma,EAAM,GAAG/jB,SAGzB2P,EAAKgO,OACR,MAGFoG,EAAQpU,EAAK0V,KAAKve,EAAKxE,MACxB,MAEgBP,IAAb6H,GACFq2D,EAAQ,CAACn5D,GACTyN,MAEI5H,EAAQ7F,EAAKxE,MAAMtC,QACrBigE,EAAMp4D,KAAK,CAACc,KAAM,OAAQrG,MAAOwE,EAAKxE,MAAM2f,MAAMtV,KAGpDymB,EAAO1sB,SAASgP,OAAOnB,EAAO,KAAM0rD,IAGtC,OAAO1rD,EAAQ0rD,EAAMjgE,OAAS,CAC/B,CAxEUg+D,CAAQl3D,EAAM2wF,EAExB,CAuEF,EA0CL,SAASH,GAAa3nF,GACpB,MAAuB,iBAATA,EAAoB,IAAItP,OC3OzB,SAA4BkG,GAC1C,GAAsB,iBAAXA,EACV,MAAM,IAAIse,UAAU,qBAKrB,OAAOte,EACL4b,QAAQ,sBAAuB,QAC/BA,QAAQ,KAAM,QAChB,CDiO8C6N,CAAOrgB,GAAO,KAAOA,CACnE,CAMD,SAAS4nF,GAAWp1E,GACX,MAAmB,mBAAZA,EAAyBA,EAAU,IAAMA,CACxD,CErOD,MAAMu1E,GAAc,WACdC,GAAiB,CAAC,WAAY,OAAQ,QAAS,SAGxCC,GAAiC,CAC5CjvD,WAAY,CAqEd,SAAsC8Z,GACpC20C,GACE30C,EACA,CACE,CAAC,kDAAmDo1C,IACpD,CAAC,oCAAqCC,KAExC,CAACzzB,OAAQ,CAAC,OAAQ,kBAErB,GA7EC/e,MAAO,CACLyyC,gBAmCJ,SAA8B9xC,GAC5B9hD,KAAKmhD,MAAM,CAAC38C,KAAM,OAAQimD,MAAO,KAAMhT,IAAK,GAAIl1C,SAAU,IAAKu/C,EAChE,EApCG+xC,qBAAsBC,GACtBC,oBAAqBD,GACrBE,mBAAoBF,IAEtBzyC,KAAM,CACJuyC,gBAwDJ,SAA6B9xC,GACtBT,KAAAA,KAAKS,EACX,EAzDG+xC,qBAkDJ,SAAkC/xC,GAC3B6S,KAAAA,OAAOtT,KAAK6T,cAAcx4D,KAAKsD,KAAM8hD,EAC3C,EAnDGiyC,oBAqCJ,SAAiCjyC,GAC1B6S,KAAAA,OAAOtT,KAAK2T,iBAAiBt4D,KAAKsD,KAAM8hD,EAC9C,EAtCGkyC,mBAyCJ,SAAgClyC,GACzB6S,KAAAA,OAAOtT,KAAKz6B,KAAKlqB,KAAKsD,KAAM8hD,GACM54B,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC5D47C,IAAM,UAAYz3C,KAAKmlD,eAAerD,EAC5C,IAxCYmyC,GAA+B,CAC1CC,OAAQ,CACN,CACElB,UAAW,IACXxwD,OAAQ,aACRgH,MAAO,YACP+pD,eACAC,mBAEF,CACER,UAAW,IACXxwD,OAAQ,OACRgH,MAAO,YACP+pD,eACAC,mBAEF,CAACR,UAAW,IAAKxwD,OAAQ,OAAQgH,MAAO,MAAO+pD,eAAaC,qBAUhE,SAASM,GAA0BhyC,GAC5B6S,KAAAA,OAAOxT,MAAM6T,iBAAiBt4D,KAAKsD,KAAM8hD,EAC/C,CA6CD,SAAS4xC,GAAQnoF,EAAGquC,EAAU6zC,EAAQhgE,EAAM7N,GAC1C,IAAI0zB,EAAS,GAGb,IAAKjf,GAASzU,GACZ,OAAO,EAUT,GANI,MAAMb,KAAK66B,KACb6zC,EAAS7zC,EAAW6zC,EACpB7zC,EAAW,GACXtG,EAAS,YAuDb,SAAyBm6C,GACvB,MAAMv2C,EAAQu2C,EAAO3tE,MAAM,KAE3B,GACEo3B,EAAMr7C,OAAS,GACdq7C,EAAMA,EAAMr7C,OAAS,KACnB,IAAIkjB,KAAKm4B,EAAMA,EAAMr7C,OAAS,MAC5B,aAAakjB,KAAKm4B,EAAMA,EAAMr7C,OAAS,MAC3Cq7C,EAAMA,EAAMr7C,OAAS,KACnB,IAAIkjB,KAAKm4B,EAAMA,EAAMr7C,OAAS,MAC5B,aAAakjB,KAAKm4B,EAAMA,EAAMr7C,OAAS,KAE5C,OAAO,EAGT,OAAO,CACR,CApEMs4F,CAAgB1G,GACnB,OAAO,EAGT,MAAMv2C,EAsER,SAAkBO,GAChB,MAAM28C,EAAY,sBAAsBlzE,KAAKu2B,GAE7C,IAAI48C,EAEAC,EAEAC,EAEAC,EAEJ,GAAIJ,EAOKC,IANP58C,EAAMA,EAAI35B,MAAM,EAAGs2E,EAAUhkF,OAC7BokF,EAAQJ,EAAU,GAClBC,EAAoBG,EAAMtgE,QAAQ,KAClCogE,EAAgBvB,GAAOt7C,EAAK,KAC5B88C,EAAgBxB,GAAOt7C,EAAK,MAEE,IAAvB48C,GAA4BC,EAAgBC,GACjD98C,GAAO+8C,EAAM12E,MAAM,EAAGu2E,EAAoB,GAC1CG,EAAQA,EAAM12E,MAAMu2E,EAAoB,GACxCA,EAAoBG,EAAMtgE,QAAQ,KAClCqgE,IAIJ,MAAO,CAAC98C,EAAK+8C,EACd,CAjGeC,CAAShH,EAAShgE,GAEhC,IAAKypB,EAAM,GAAI,OAAO,EAGtB,MAAMn7B,EAAS,CACbvX,KAAM,OACNimD,MAAO,KACPhT,IAAKnE,EAASsG,EAAW1C,EAAM,GAC/B30C,SAAU,CAAC,CAACiC,KAAM,OAAQrG,MAAOy7C,EAAW1C,EAAM,MAGpD,OAAIA,EAAM,GACD,CAACn7B,EAAQ,CAACvX,KAAM,OAAQrG,MAAO+4C,EAAM,KAGvCn7B,CACR,CASD,SAAS43E,GAAUpoF,EAAG4jF,EAAOpuF,EAAO6e,GAEhC,SACCyU,GAASzU,GAAO,IAEjB,UAAUb,KAAKhe,KAKV,CACLyD,KAAM,OACNimD,MAAO,KACPhT,IAAK,UAAY03C,EAAQ,IAAMpuF,EAC/BwB,SAAU,CAAC,CAACiC,KAAM,OAAQrG,MAAOgxF,EAAQ,IAAMpuF,IAElD,CA8DD,SAASszB,GAASzU,EAAO80E,GACvB,MAAMn8C,EAAO34B,EAAM0J,MAAM0W,WAAWpgB,EAAMxP,MAAQ,GAGhD,OAAiB,IAAhBwP,EAAMxP,OACLuwC,GAAkBpI,IAClBqI,GAAmBrI,OACnBm8C,GAAkB,KAATn8C,EAEd,CC5NM,SAASo8C,GAAYhyF,GACtBA,OAAAA,EAAK5B,QAAU4B,EAAKmoD,WACfnoD,EAAK5B,OAAS,GAGhBozD,GAAaxxD,EAAKmoD,WAC1B,CCfM,SAAS8pC,GAAMC,GAIpB,MAAMhwF,EAAUgwF,GAAY,GACtBjyE,EAAM/d,EAAQ+d,KAAO,GAC3B,IAAIkyE,EAAYjwF,EAAQiwF,WAAa,EACjCn+C,EAAO/zB,EAAI+zB,MAAQ,EACnBC,EAASh0B,EAAIg0B,QAAU,EAEpB,MAAA,CAACm+C,KA0BR,SAAc52F,EAAQ,IACpB,MAAMuzD,EAASvzD,EAAM2hB,MAAM,aACrB0sB,EAAOklB,EAAOA,EAAO71D,OAAS,GAIpC,OAHA86C,GAAQ+a,EAAO71D,OAAS,EACxB+6C,EACoB,IAAlB8a,EAAO71D,OAAe+6C,EAASpK,EAAK3wC,OAAS,EAAI2wC,EAAK3wC,OAASi5F,EAC1D32F,CACR,EAjCaI,QAOd,WACS,MAAA,CAACqkB,IAAK,CAAC+zB,OAAMC,UAASk+C,YAC9B,EATsBE,MAgBdA,SAAM72F,GACb22F,GAAa32F,CACd,EAgBF,CCxCM,SAAS82F,GAAchmE,EAAQ9O,EAAS+0E,GAC7C,MAAMC,EAAah1E,EAAQg1E,WACrB5yF,EAAW0sB,EAAO1sB,UAAY,GAC9B6yF,EAAUR,GAAMM,GAEhB9gB,EAAU,GACZhkE,IAAAA,GAAS,EAIb,IAFA+kF,EAAWzxF,MAAM,KAER0M,EAAQ7N,EAAS1G,QAAQ,CAChC,MAAM8jE,EAAQp9D,EAAS6N,GAEvB+kF,EAAWA,EAAWt5F,OAAS,GAAKuU,EAEpCgkE,EAAQ1wE,KACN0xF,EAAQL,KACN50E,EAAQk1E,OAAO11B,EAAO1wC,EAAQ9O,EAAS,CACrCqiB,OAAQ,KACRgH,MAAO,QACJ4rD,EAAQ72F,cAKE,SAAfohE,EAAMn7D,OACR2b,EAAQm1E,oBAAiB13F,GAGvBwS,EAAQ7N,EAAS1G,OAAS,GAC5Bu4E,EAAQ1wE,KAAK0xF,EAAQL,KAAKplC,EAAQgQ,EAAOp9D,EAAS6N,EAAQ,KAE7D,CAID,OAFA+kF,EAAWjpE,MAEJkoD,EAAQvwE,KAAK,IAOpB,SAAS8rD,EAAQ/P,EAAMC,GACrB,IAAIzvC,EAAQ+P,EAAQtc,KAAKhI,OAElBuU,KAAAA,KAAS,CACd,MAAM2L,EAASoE,EAAQtc,KAAKuM,GAAOwvC,EAAMC,EAAO5wB,EAAQ9O,GAExD,IAAe,IAAXpE,GAA8B,IAAXA,EACrB,MAGF,GAAsB,iBAAXA,EACT,MAAO,KAAKi1B,OAAO,EAAIj1B,GAGrBA,IAAW,IAAXA,EACF,MAAO,uBAEV,CAED,MAAO,MACR,CACF,CCxED,MAAMw5E,GAAM,YAOL,SAASC,GAAYr3F,EAAOuI,GAE3BqV,MAAAA,EAAS,GACXvT,IAGAoX,EAHApX,EAAQ,EACRmuC,EAAO,EAIH/2B,KAAAA,EAAQ21E,GAAIr0E,KAAK/iB,IACvB4gD,EAAI5gD,EAAM2f,MAAMtV,EAAOoX,EAAMxP,QAC7B2L,EAAOrY,KAAKkc,EAAM,IAClBpX,EAAQoX,EAAMxP,MAAQwP,EAAM,GAAG/jB,OAC/B86C,IAKF,OAFAoI,EAAI5gD,EAAM2f,MAAMtV,IAETuT,EAAOlY,KAAK,IAKVk7C,SAAAA,EAAI5gD,GACX4d,EAAOrY,KAAKgD,EAAIvI,EAAOw4C,GAAOx4C,GAC/B,CACF,CChCM,SAASs3F,GAAe9tD,GAC7B,IAAKA,EAAQ+tD,UAAW,CAChBlzD,MAAAA,GACHmF,EAAQyiB,QAAU,kBAAoB,KACtCziB,EAAQnF,OAAS,MAAQmF,EAAQnF,OAAS,IAAM,IAEnDmF,EAAQ+tD,UAAY,IAAIx5F,QACrBsmC,EAAS,IAAMA,EAAS,IAAM,KAC5B,sBAAsBzjB,KAAK4oB,EAAQqrD,WAAa,KAAO,IACxDrrD,EAAQqrD,WACPrrD,EAAQ6B,MAAQ,MAAQ7B,EAAQ6B,MAAQ,IAAM,IACjD,IAEH,CAEM7B,OAAAA,EAAQ+tD,SAChB,CCfM,SAASC,GAAezsE,EAAOye,GAElCiuD,OAAAA,GAAY1sE,EAAOye,EAAQ4rD,aAAa,KACvCqC,GAAY1sE,EAAOye,EAAQ6rD,gBAAgB,EAE/C,CAQD,SAASoC,GAAY1sE,EAAOi2B,EAAM02C,GAC5B,IAAC12C,EACH,OAAO02C,EAGW,iBAAT12C,IACTA,EAAO,CAACA,IAGN/uC,IAAAA,GAAS,EAEb,OAASA,EAAQ+uC,EAAKtjD,QAChBqtB,GAAAA,EAAMlX,SAASmtC,EAAK/uC,IACtB,OAAO,EAIX,OAAO,CACR,CC1BM,SAAS0lF,GAAK31E,EAASmJ,EAAOqrC,GACnC,MAAMx2D,GAASw2D,EAAOnyB,QAAU,KAAOlZ,GAAS,KAAOqrC,EAAOnrB,OAAS,IAEjEusD,EAAY,GAEZh6E,EAAS,GAETi6E,EAAQ,CAAA,EACV5lF,IAAAA,GAAS,EAEN,OAAEA,EAAQ+P,EAAQ+zE,OAAOr4F,QAAQ,CACtC,MAAM8rC,EAAUxnB,EAAQ+zE,OAAO9jF,GAE3B,IAACulF,GAAex1E,EAAQ+I,MAAOye,GACjC,SAGF,MAAMsuD,EAAaR,GAAe9tD,GAElC,IAAI/nB,EAEIA,KAAAA,EAAQq2E,EAAW/0E,KAAK/iB,IAAS,CACjCqkC,MAAAA,EAAS,WAAYmF,GAAWmX,QAAQnX,EAAQyiB,SAChD5gB,EAAQ,UAAW7B,EACnBliC,EAAWma,EAAMxP,OAASoyB,EAAS5iB,EAAM,GAAG/jB,OAAS,GAEvDk6F,EAAU/jF,SAASvM,IACjBuwF,EAAMvwF,GAAU+8B,SAAWA,IAC7BwzD,EAAMvwF,GAAU+8B,QAAS,GAGvBwzD,EAAMvwF,GAAU+jC,QAAUA,IAC5BwsD,EAAMvwF,GAAU+jC,OAAQ,KAG1BusD,EAAUryF,KAAK+B,GACfuwF,EAAMvwF,GAAY,CAAC+8B,SAAQgH,SAE9B,CACF,CAEDusD,EAAUxoF,KAAK2oF,IAEf,IAAI1tF,EAAQmsD,EAAOnyB,OAASmyB,EAAOnyB,OAAO3mC,OAAS,EACnD,MAAM6M,EAAMvK,EAAMtC,QAAU84D,EAAOnrB,MAAQmrB,EAAOnrB,MAAM3tC,OAAS,GAGjE,IAFAuU,GAAS,IAEAA,EAAQ2lF,EAAUl6F,QAAQ,CACjC,MAAM4J,EAAWswF,EAAU3lF,GAGvB3K,EAAW+C,GAAS/C,GAAYiD,IAQjCjD,EAAW,EAAIiD,GACdqtF,EAAU3lF,EAAQ,KAAO3K,EAAW,GACpCuwF,EAAMvwF,GAAU+jC,QACfwsD,EAAMvwF,EAAW,GAAG+8B,SACpBwzD,EAAMvwF,EAAW,GAAG+jC,OACtBusD,EAAU3lF,EAAQ,KAAO3K,EAAW,GACnCuwF,EAAMvwF,GAAU+8B,SACfwzD,EAAMvwF,EAAW,GAAG+8B,SACpBwzD,EAAMvwF,EAAW,GAAG+jC,QAKrBhhC,IAAU/C,GAIZsW,EAAOrY,KAAKyyF,GAAkBh4F,EAAM2f,MAAMtV,EAAO/C,GAAW,OAG9D+C,EAAQ/C,GAGN,iBAAiBsZ,KAAK5gB,EAAM6hB,OAAOva,KACjCkvD,EAAOuI,QAAWvI,EAAOuI,OAAOlrD,SAAS7T,EAAM6hB,OAAOva,KAMxDsW,EAAOrY,KACL,MAAQvF,EAAM6hC,WAAWv6B,GAAUjJ,SAAS,IAAIkrC,cAAgB,KAElEl/B,KANAuT,EAAOrY,KAAK,OAQf,CAID,OAFAqY,EAAOrY,KAAKyyF,GAAkBh4F,EAAM2f,MAAMtV,EAAOE,GAAMisD,EAAOnrB,QAEvDztB,EAAOlY,KAAK,GACpB,CAOD,SAASqyF,GAAUx6F,EAAGC,GACbD,OAAAA,EAAIC,CACZ,CAOD,SAASw6F,GAAkBh4F,EAAOqrC,GAC1BysD,MAAAA,EAAa,wBAEbF,EAAY,GAEZ3hB,EAAU,GACVgiB,EAAQj4F,EAAQqrC,EAClBp5B,IAGAwP,EAHAxP,GAAS,EACT5H,EAAQ,EAIJoX,KAAAA,EAAQq2E,EAAW/0E,KAAKk1E,IAC9BL,EAAUryF,KAAKkc,EAAMxP,OAGvB,OAASA,EAAQ2lF,EAAUl6F,QACrB2M,IAAUutF,EAAU3lF,IACtBgkE,EAAQ1wE,KAAKvF,EAAM2f,MAAMtV,EAAOutF,EAAU3lF,KAG5CgkE,EAAQ1wE,KAAK,MACb8E,EAAQutF,EAAU3lF,GAKpB,OAFAgkE,EAAQ1wE,KAAKvF,EAAM2f,MAAMtV,IAElB4rE,EAAQvwE,KAAK,GACrB,CC5DM,SAASwyF,KAGP,OAFP34B,EAAkB44B,KA+BlB,WACE,MAAO,GACR,EA/BM,CAELpC,OAAQ,CAAC,CAAClB,UAAW,IAAKO,YAAa,CAAC,WAAY,QAAS,eAC7D73B,SAAU,CAAC0E,mBAkCJA,SAAmBz9D,EAAM4I,EAAG4U,EAAS+0E,GAC5C,MAAME,EAAUR,GAAMM,GACtB,IAAI/2F,EAAQi3F,EAAQL,KAAK,MACzB,MAAM1zC,EAAOlhC,EAAQghC,MAAM,sBACrBo1C,EAAUp2E,EAAQghC,MAAM,SAkB9B,OAjBAhjD,GAASi3F,EAAQL,KACfe,GAAK31E,EAASw0E,GAAYhyF,GAAO,IAC5ByyF,EAAQ72F,UACXikC,OAAQrkC,EACRqrC,MAAO,OAGX+sD,IACAp4F,GAASi3F,EAAQL,KACf,MAAQpyF,EAAKJ,UAAYI,EAAKJ,SAAS1G,OAAS,EAAI,IAAM,KAE5Du5F,EAAQJ,MAAM,GACd72F,GAASi3F,EAAQL,KACfS,GAAYP,GAActyF,EAAMwd,EAASi1E,EAAQ72F,YAOnD,SAAao4C,EAAMvmC,EAAOomF,GACxB,GAAIpmF,EACF,OAAQomF,EAAQ,GAAK,QAAU7/C,EAGjC,OAAOA,CACR,KAXD0K,IAEOljD,CAUR,EAlEgCu/D,sBAOxBA,SAAAA,EAAkB/6D,EAAM4I,EAAG4U,EAAS+0E,GAC3C,MAAME,EAAUR,GAAMM,GACtB,IAAI/2F,EAAQi3F,EAAQL,KAAK,MACzB,MAAM1zC,EAAOlhC,EAAQghC,MAAM,qBACrBo1C,EAAUp2E,EAAQghC,MAAM,aAW9B,OAVAhjD,GAASi3F,EAAQL,KACfe,GAAK31E,EAASw0E,GAAYhyF,GAAO,IAC5ByyF,EAAQ72F,UACXikC,OAAQrkC,EACRqrC,MAAO,OAGX+sD,IACAl1C,IACAljD,GAASi3F,EAAQL,KAAK,KACf52F,CACR,CA4CF,CC9JM,SAASy2F,GAAMC,GAIpB,MAAMhwF,EAAUgwF,GAAY,GACtBjyE,EAAM/d,EAAQ+d,KAAO,GAC3B,IAAIkyE,EAAYjwF,EAAQiwF,WAAa,EACjCn+C,EAAO/zB,EAAI+zB,MAAQ,EACnBC,EAASh0B,EAAIg0B,QAAU,EAEpB,MAAA,CAACm+C,KA0BR,SAAc52F,EAAQ,IACpB,MAAMuzD,EAASvzD,EAAM2hB,MAAM,aACrB0sB,EAAOklB,EAAOA,EAAO71D,OAAS,GAIpC,OAHA86C,GAAQ+a,EAAO71D,OAAS,EACxB+6C,EACoB,IAAlB8a,EAAO71D,OAAe+6C,EAASpK,EAAK3wC,OAAS,EAAI2wC,EAAK3wC,OAASi5F,EAC1D32F,CACR,EAjCaI,QAOd,WACS,MAAA,CAACqkB,IAAK,CAAC+zB,OAAMC,UAASk+C,YAC9B,EATsBE,MAgBdA,SAAM72F,GACb22F,GAAa32F,CACd,EAgBF,CC5CM,MAAMs4F,GAA+B,CAC1C5hC,eAAgB,CAAC,UACjB1T,MAAO,CAACqvC,cAaV,SAA4B1uC,GAC1B9hD,KAAKmhD,MAAM,CAAC38C,KAAM,SAAUjC,SAAU,IAAKu/C,EAC5C,GAdCT,KAAM,CAACmvC,cAiBT,SAA2B1uC,GACpBT,KAAAA,KAAKS,EACX,IAfY40C,GAA6B,CACxCxC,OAAQ,CAAC,CAAClB,UAAW,IAAKO,YAAa,aACvC73B,SAAU,CAACwD,OAAQy3B,KAmBrB,SAASA,GAAah0F,EAAM4I,EAAG4U,EAAS+0E,GACtC,MAAME,EAAUR,GAAMM,GAChB7zC,EAAOlhC,EAAQghC,MAAM,YAC3B,IAAIhjD,EAAQi3F,EAAQL,KAAK,MAQzB,OAPA52F,GC7BK,SAA2B8wB,EAAQ9O,EAAS+0E,GACjD,MAAMC,EAAah1E,EAAQg1E,WACrB5yF,EAAW0sB,EAAO1sB,UAAY,GAE9B6xE,EAAU,GACZhkE,IAAAA,GAAS,EACToyB,EAAS0yD,EAAY1yD,OAEzB2yD,EAAWzxF,MAAM,GACjB,IAAI0xF,EAAUR,GAAMM,GAEpB,OAAS9kF,EAAQ7N,EAAS1G,QAAQ,CAChC,MAAM8jE,EAAQp9D,EAAS6N,GAEvB,IAAIo5B,EAIJ,GAFA2rD,EAAWA,EAAWt5F,OAAS,GAAKuU,EAEhCA,EAAQ,EAAI7N,EAAS1G,OAAQ,CAE/B,IAAIw5F,EAASl1E,EAAQk1E,OAAO35B,SAASn5D,EAAS6N,EAAQ,GAAG5L,MACrD6wF,GAAUA,EAAOiB,OAAMjB,EAASA,EAAOiB,MAC3C9sD,EAAQ6rD,EACJA,EAAO9yF,EAAS6N,EAAQ,GAAI6e,EAAQ9O,EAAS,CAC3CqiB,OAAQ,GACRgH,MAAO,MACJ4rD,EAAQ72F,YACVyhB,OAAO,GACV,EACL,MACCwpB,EAAQ0rD,EAAY1rD,MAUpB4qC,EAAQv4E,OAAS,IACL,OAAX2mC,GAA8B,OAAXA,IACL,SAAfm9B,EAAMn7D,OAEN4vE,EAAQA,EAAQv4E,OAAS,GAAKu4E,EAAQA,EAAQv4E,OAAS,GAAGmiB,QACxD,cACA,KAEFwkB,EAAS,IAGT4yD,EAAUR,GAAMM,GAChBE,EAAQL,KAAK3gB,EAAQvwE,KAAK,MAG5BuwE,EAAQ1wE,KACN0xF,EAAQL,KACN50E,EAAQk1E,OAAO11B,EAAO1wC,EAAQ9O,EAAS,IAClCi1E,EAAQ72F,UACXikC,SACAgH,YAKNhH,EAAS4xC,EAAQA,EAAQv4E,OAAS,GAAGiiB,OAAO,EAC7C,CAID,OAFAq3E,EAAWjpE,MAEJkoD,EAAQvwE,KAAK,GACrB,CD1CU+yF,CAAkBj0F,EAAMwd,EAAS,IACrCi1E,EAAQ72F,UACXikC,OAAQrkC,EACRqrC,MAAO,MAETrrC,GAASi3F,EAAQL,KAAK,MACtB1zC,IACOljD,CACR,CExCM,SAASy2F,GAAMC,GAIpB,MAAMhwF,EAAUgwF,GAAY,GACtBjyE,EAAM/d,EAAQ+d,KAAO,GAC3B,IAAIkyE,EAAYjwF,EAAQiwF,WAAa,EACjCn+C,EAAO/zB,EAAI+zB,MAAQ,EACnBC,EAASh0B,EAAIg0B,QAAU,EAEpB,MAAA,CAACm+C,KA0BR,SAAc52F,EAAQ,IACpB,MAAMuzD,EAASvzD,EAAM2hB,MAAM,aACrB0sB,EAAOklB,EAAOA,EAAO71D,OAAS,GAIpC,OAHA86C,GAAQ+a,EAAO71D,OAAS,EACxB+6C,EACoB,IAAlB8a,EAAO71D,OAAe+6C,EAASpK,EAAK3wC,OAAS,EAAI2wC,EAAK3wC,OAASi5F,EAC1D32F,CACR,EAjCaI,QAOd,WACS,MAAA,CAACqkB,IAAK,CAAC+zB,OAAMC,UAASk+C,YAC9B,EATsBE,MAgBdA,SAAM72F,GACb22F,GAAa32F,CACd,EAgBF,CChDM,SAASs3F,GAAe9tD,GAC7B,IAAKA,EAAQ+tD,UAAW,CAChBlzD,MAAAA,GACHmF,EAAQyiB,QAAU,kBAAoB,KACtCziB,EAAQnF,OAAS,MAAQmF,EAAQnF,OAAS,IAAM,IAEnDmF,EAAQ+tD,UAAY,IAAIx5F,QACrBsmC,EAAS,IAAMA,EAAS,IAAM,KAC5B,sBAAsBzjB,KAAK4oB,EAAQqrD,WAAa,KAAO,IACxDrrD,EAAQqrD,WACPrrD,EAAQ6B,MAAQ,MAAQ7B,EAAQ6B,MAAQ,IAAM,IACjD,IAEH,CAEM7B,OAAAA,EAAQ+tD,SAChB,CCXM,SAASl2B,GAAW78D,EAAM4I,EAAG4U,GAClC,IAAIhiB,EAAQwE,EAAKxE,OAAS,GACtBwmD,EAAW,IACXv0C,GAAS,EAKb,KAAO,IAAIlU,OAAO,WAAayoD,EAAW,YAAY5lC,KAAK5gB,IACzDwmD,GAAY,IAmBP,IAbL,WAAW5lC,KAAK5gB,KACd,WAAW4gB,KAAK5gB,IAAU,WAAW4gB,KAAK5gB,IAAW,QAAQ4gB,KAAK5gB,MAEpEA,EAAQ,IAAMA,EAAQ,OAUfiS,EAAQ+P,EAAQ+zE,OAAOr4F,QAAQ,CACtC,MAAM8rC,EAAUxnB,EAAQ+zE,OAAO9jF,GACzB6lF,EAAaR,GAAe9tD,GAE9B/nB,IAAAA,EAKJ,GAAK+nB,EAAQyiB,QAELxqC,KAAAA,EAAQq2E,EAAW/0E,KAAK/iB,IAAS,CACvC,IAAIsH,EAAWma,EAAMxP,MAIY,KAA/BjS,EAAM6hC,WAAWv6B,IACkB,KAAnCtH,EAAM6hC,WAAWv6B,EAAW,IAE5BA,IAGFtH,EAAQA,EAAM2f,MAAM,EAAGrY,GAAY,IAAMtH,EAAM2f,MAAM8B,EAAMxP,MAAQ,EACpE,CACF,CAED,OAAOu0C,EAAWxmD,EAAQwmD,CAC3B,CCqSD,SAASkyC,GAAoB14F,GACpBA,OAAAA,EAAMtC,MACd,CAMD,SAASi7F,GAAY34F,GACnB,MAAMo6C,EAAwB,iBAAVp6C,EAAqBA,EAAM44F,YAAY,GAAK,EAEhE,OAAgB,KAATx+C,GAAkC,KAATA,EAC5B,GACS,KAATA,GAAkC,MAATA,EACzB,IACS,KAATA,GAAkC,MAATA,EACzB,IACA,CACL,CLnWDo+C,GAAaL,KA+Bb,WACE,MAAO,GACR,EIlDD92B,GAAW82B,KAkEX,WACE,MAAO,GACR,EElDM,MAAMU,GAAuB,CAClC71C,MAAO,CACLye,MAeJ,SAAoB9d,GAGlB,MAAM7/C,EAAQ6/C,EAAM+uC,OACpB7wF,KAAKmhD,MACH,CACE38C,KAAM,QACNvC,MAAOA,EAAMyE,KAAK2zD,GAAa,SAANA,EAAe,KAAOA,IAC/C93D,SAAU,IAEZu/C,GAEF9hD,KAAKg9B,QAAQ,WAAW,EACzB,EA3BGi6D,UAAWC,GACXC,YAAaD,GACbE,SAkCJ,SAAkBt1C,GAChB9hD,KAAKmhD,MAAM,CAAC38C,KAAM,WAAYjC,SAAU,IAAKu/C,EAC9C,GAlCCT,KAAM,CACJwG,SAgDJ,SAAsB/F,GACpB,IAAI3jD,EAAQ6B,KAAK25D,SAEb35D,KAAKw6B,QAAQ,aACfr8B,EAAQA,EAAM6f,QAAQ,aAAcA,KAGOkL,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAClEsC,MAAQA,EACRkjD,KAAAA,KAAKS,EACX,EAzDG8d,MAwBJ,SAAmB9d,GACZT,KAAAA,KAAKS,GACL9kB,KAAAA,QAAQ,UACd,EA1BGi6D,UAAW51C,GACX81C,YAAa91C,GACb+1C,SAAU/1C,KAgCd,SAASA,GAAKS,GACPT,KAAAA,KAAKS,EACX,CAGD,SAASo1C,GAAUp1C,GACjB9hD,KAAKmhD,MAAM,CAAC38C,KAAM,YAAajC,SAAU,IAAKu/C,EAC/C,CAsBD,SAAS9jC,GAAQq2C,EAAIC,GAEnB,MAAc,MAAPA,EAAaA,EAAKD,CAC1B,CAMM,SAASgjC,GAAmBxyF,GACjC,MAAMgtC,EAAWhtC,GAAW,GACtByyF,EAAUzlD,EAAS0lD,iBACnBC,EAAkB3lD,EAAS4lD,eAC3BC,EAAe7lD,EAAS6lD,aACxBC,EAASL,EAAU,IAAM,IAExB,MAAA,CACLpD,OAAQ,CACN,CAAClB,UAAW,KAAMO,YAAa,aAC/B,CAACP,UAAW,KAAMO,YAAa,aAG/B,CAACnpC,SAAS,EAAM4oC,UAAW,IAAKxpD,MAAO,WAEvC,CAACwpD,UAAW,IAAKO,YAAa,aAG9B,CAACnpC,SAAS,EAAM4oC,UAAW,IAAKxpD,MAAO,KAMvC,CAAC4gB,SAAS,EAAM4oC,UAAW,IAAKxpD,MAAO,UAEzCkyB,SAAU,CACRkE,MAWKg4B,SAAYj1F,EAAM4I,EAAG4U,EAAS+0E,GAC9B2C,OAAAA,EAyDT,SAA2Bl1F,EAAMwd,EAAS+0E,GACxC,MAAM3yF,EAAWI,EAAKJ,SAClB6N,IAAAA,GAAS,EAEP2L,MAAAA,EAAS,GACTw6E,EAAUp2E,EAAQghC,MAAM,SAE9B,OAAS/wC,EAAQ7N,EAAS1G,QACxBkgB,EAAO3L,GAAS0nF,EACdv1F,EAAS6N,GACT+P,EACA+0E,GAMJ,OAFAqB,IAEOx6E,CACR,CA1EGg8E,CAAkBp1F,EAAMwd,EAAS+0E,GAEjCvyF,EAAKV,MAER,EAhBGm1F,SA0BKY,SAAer1F,EAAM4I,EAAG4U,EAAS+0E,GAClC7/C,MAAAA,EAAMyiD,EAAqBn1F,EAAMwd,EAAS+0E,GAE1C/2F,EAAQ05F,EAAc,CAACxiD,IAC7B,OAAOl3C,EAAM2f,MAAM,EAAG3f,EAAM+1B,QAAQ,MACrC,EA9BG+jE,UAAWC,EACX14B,WAuHJ,SAA6B78D,EAAMssB,EAAQ9O,GACrChiB,IAAAA,EAAQqhE,GAAW78D,EAAMssB,EAAQ9O,GAEjCA,EAAQ+I,MAAMlX,SAAS,eACzB7T,EAAQA,EAAM6f,QAAQ,MAAO,SAG/B,OAAO7f,CACR,IA5FQ+5F,SAAAA,EAAgBv1F,EAAM4I,EAAG4U,EAAS+0E,GACzC,MAAM7zC,EAAOlhC,EAAQghC,MAAM,aACrBo1C,EAAUp2E,EAAQghC,MAAM,YACxBhjD,EChKH,SAA2B8wB,EAAQ9O,EAAS+0E,GACjD,MAAMC,EAAah1E,EAAQg1E,WACrB5yF,EAAW0sB,EAAO1sB,UAAY,GAE9B6xE,EAAU,GACZhkE,IAAAA,GAAS,EACToyB,EAAS0yD,EAAY1yD,OAEzB2yD,EAAWzxF,MAAM,GACjB,IAAI0xF,EAAUR,GAAMM,GAEpB,OAAS9kF,EAAQ7N,EAAS1G,QAAQ,CAChC,MAAM8jE,EAAQp9D,EAAS6N,GAEvB,IAAIo5B,EAIJ,GAFA2rD,EAAWA,EAAWt5F,OAAS,GAAKuU,EAEhCA,EAAQ,EAAI7N,EAAS1G,OAAQ,CAE/B,IAAIw5F,EAASl1E,EAAQk1E,OAAO35B,SAASn5D,EAAS6N,EAAQ,GAAG5L,MACrD6wF,GAAUA,EAAOiB,OAAMjB,EAASA,EAAOiB,MAC3C9sD,EAAQ6rD,EACJA,EAAO9yF,EAAS6N,EAAQ,GAAI6e,EAAQ9O,EAAS,CAC3CqiB,OAAQ,GACRgH,MAAO,MACJ4rD,EAAQ72F,YACVyhB,OAAO,GACV,EACL,MACCwpB,EAAQ0rD,EAAY1rD,MAUpB4qC,EAAQv4E,OAAS,IACL,OAAX2mC,GAA8B,OAAXA,IACL,SAAfm9B,EAAMn7D,OAEN4vE,EAAQA,EAAQv4E,OAAS,GAAKu4E,EAAQA,EAAQv4E,OAAS,GAAGmiB,QACxD,cACA,KAEFwkB,EAAS,IAGT4yD,EAAUR,GAAMM,GAChBE,EAAQL,KAAK3gB,EAAQvwE,KAAK,MAG5BuwE,EAAQ1wE,KACN0xF,EAAQL,KACN50E,EAAQk1E,OAAO11B,EAAO1wC,EAAQ9O,EAAS,IAClCi1E,EAAQ72F,UACXikC,SACAgH,YAKNhH,EAAS4xC,EAAQA,EAAQv4E,OAAS,GAAGiiB,OAAO,EAC7C,CAID,OAFAq3E,EAAWjpE,MAEJkoD,EAAQvwE,KAAK,GACrB,CDyFiB+yF,CAAkBj0F,EAAMwd,EAAS,IAC1C+0E,EACH1yD,OAAQm1D,EACRnuD,MAAOmuD,IAIT,OAFApB,IACAl1C,IACOljD,CACR,CAMD,SAAS05F,EAAcM,EAAQl2F,GACtBm2F,ODpCJ,SAAuBx4B,EAAO/6D,EAAU,IACvC5C,MAAAA,GAAS4C,EAAQ5C,OAAS,IAAIwI,SAC9BitF,EAAe7yF,EAAQ6yF,cAAgBb,GAEvCwB,EAAa,GAEbC,EAAa,GAEbC,EAAa,GAEbC,EAAsB,GACxBC,IAAAA,EAAkB,EAClBC,GAAY,EAIhB,OAASA,EAAW94B,EAAM/jE,QAAQ,CAE1Bw5C,MAAAA,EAAM,GAENs7B,EAAQ,GACVgoB,IAAAA,GAAe,EAMZ,IAJH/4B,EAAM84B,GAAU78F,OAAS48F,IAC3BA,EAAkB74B,EAAM84B,GAAU78F,UAG3B88F,EAAc/4B,EAAM84B,GAAU78F,QAAQ,CACvCmkE,MAAAA,EA4KH7hE,OADUA,EA3KUyhE,EAAM84B,GAAUC,IA4KI,GAAKl4E,OAAOtiB,GA1KvD,IAAgC,IAA5B0G,EAAQ2yF,gBAA2B,CACrC,MAAM5qF,EAAO8qF,EAAa13B,GAC1B2Q,EAAMgoB,GAAe/rF,QAGkBhP,IAArC46F,EAAoBG,IACpB/rF,EAAO4rF,EAAoBG,MAE3BH,EAAoBG,GAAe/rF,EAEtC,CAEDyoC,EAAI3xC,KAAKs8D,EACV,CAEDs4B,EAAWI,GAAYrjD,EACvBkjD,EAAWG,GAAY/nB,CA9CwB,CAuMnD,IAAmBxyE,EArJbw6F,IAAAA,GAAe,EAEnB,GAAqB,iBAAV12F,GAAsB,WAAYA,EAC3C,OAAS02F,EAAcF,GACrBJ,EAAWM,GAAe7B,GAAY70F,EAAM02F,QAEzC,CACL,MAAMpgD,EAAOu+C,GAAY70F,GAEzB,OAAS02F,EAAcF,GACrBJ,EAAWM,GAAepgD,CA5DmB,CAiEjDogD,GAAe,EAETtjD,MAAAA,EAAM,GAENs7B,EAAQ,GAEd,OAASgoB,EAAcF,GAAiB,CACtC,MAAMlgD,EAAO8/C,EAAWM,GACpBn2D,IAAAA,EAAS,GACTgH,EAAQ,GAEC,KAAT+O,GACF/V,EAAS,IACTgH,EAAQ,KACU,MAAT+O,EACT/V,EAAS,IACS,MAAT+V,IACT/O,EAAQ,KAIV,IAAI58B,GAC0B,IAA5B/H,EAAQ2yF,gBACJ,EACAh3E,KAAK/X,IACH,EACA+vF,EAAoBG,GAAen2D,EAAO3mC,OAAS2tC,EAAM3tC,QAG3DmkE,MAAAA,EAAOx9B,EAAS,IAAIwO,OAAOpkC,GAAQ48B,GAET,IAA5B3kC,EAAQ2yF,kBACV5qF,EAAO41B,EAAO3mC,OAAS+Q,EAAO48B,EAAM3tC,OAEhC+Q,EAAO4rF,EAAoBG,KAC7BH,EAAoBG,GAAe/rF,GAGrC+jE,EAAMgoB,GAAe/rF,GAGvByoC,EAAIsjD,GAAe34B,CA1G4B,CA8GjDs4B,EAAW/mF,OAAO,EAAG,EAAG8jC,GACxBkjD,EAAWhnF,OAAO,EAAG,EAAGo/D,GAExB+nB,GAAY,EAENtP,MAAAA,EAAQ,GAEd,OAASsP,EAAWJ,EAAWz8F,QAAQ,CACrC,MAAMw5C,EAAMijD,EAAWI,GACjB/nB,EAAQ4nB,EAAWG,GACzBC,GAAe,EAEThiD,MAAAA,EAAO,GAEb,OAASgiD,EAAcF,GAAiB,CACtC,MAAMz4B,EAAO3qB,EAAIsjD,IAAgB,GAC7Bn2D,IAAAA,EAAS,GACTgH,EAAQ,GAEZ,IAAgC,IAA5B3kC,EAAQ2yF,gBAA2B,CACrC,MAAM5qF,EACJ4rF,EAAoBG,IAAgBhoB,EAAMgoB,IAAgB,GACtDpgD,EAAO8/C,EAAWM,GAEX,MAATpgD,EACF/V,EAAS,IAAIwO,OAAOpkC,GACF,KAAT2rC,EACL3rC,EAAO,GACT41B,EAAS,IAAIwO,OAAOpkC,EAAO,EAAI,IAC/B48B,EAAQ,IAAIwH,OAAOpkC,EAAO,EAAI,MAE9B41B,EAAS,IAAIwO,OAAOpkC,EAAO,GAC3B48B,EAAQhH,GAGVgH,EAAQ,IAAIwH,OAAOpkC,EAEtB,EAE8B,IAA3B/H,EAAQ+zF,gBAA6BD,GACvChiD,EAAKjzC,KAAK,MAIU,IAApBmB,EAAQyyF,UAGsB,IAA5BzyF,EAAQ2yF,iBAAsC,KAATx3B,IACX,IAA3Bn7D,EAAQ+zF,iBAA4BD,GAErChiD,EAAKjzC,KAAK,MAGoB,IAA5BmB,EAAQ2yF,iBACV7gD,EAAKjzC,KAAK8+B,GAGZmU,EAAKjzC,KAAKs8D,IAEsB,IAA5Bn7D,EAAQ2yF,iBACV7gD,EAAKjzC,KAAK8lC,IAGY,IAApB3kC,EAAQyyF,SACV3gD,EAAKjzC,KAAK,MAIe,IAAzBmB,EAAQg0F,cACRF,IAAgBF,EAAkB,GAElC9hD,EAAKjzC,KAAK,IAEb,CAED0lF,EAAM1lF,MACqB,IAAzBmB,EAAQg0F,aACJliD,EAAK9yC,KAAK,IAAIma,QAAQ,MAAO,IAC7B24B,EAAK9yC,KAAK,IAEjB,CAED,OAAOulF,EAAMvlF,KAAK,KACnB,CC7JUu0F,CAAcD,EAAQ,CAC3Bl2F,QACAu1F,kBACAF,UACAI,gBAEH,CAgCD,SAASI,EAAqBn1F,EAAMwd,EAAS+0E,GAC3C,MAAM3yF,EAAWI,EAAKJ,SAClB6N,IAAAA,GAAS,EAEP2L,MAAAA,EAAS,GACTw6E,EAAUp2E,EAAQghC,MAAM,YAE9B,OAAS/wC,EAAQ7N,EAAS1G,QAIxBkgB,EAAO3L,GAAS8nF,EACd31F,EAAS6N,GACTzN,EACAwd,EACA+0E,GAMJ,OAFAqB,IAEOx6E,CACR,CAeF,CE7PM,SAAS64E,GAAMC,GAIpB,MAAMhwF,EAAUgwF,GAAY,GACtBjyE,EAAM/d,EAAQ+d,KAAO,GAC3B,IAAIkyE,EAAYjwF,EAAQiwF,WAAa,EACjCn+C,EAAO/zB,EAAI+zB,MAAQ,EACnBC,EAASh0B,EAAIg0B,QAAU,EAEpB,MAAA,CAACm+C,KA0BR,SAAc52F,EAAQ,IACpB,MAAMuzD,EAASvzD,EAAM2hB,MAAM,aACrB0sB,EAAOklB,EAAOA,EAAO71D,OAAS,GAIpC,OAHA86C,GAAQ+a,EAAO71D,OAAS,EACxB+6C,EACoB,IAAlB8a,EAAO71D,OAAe+6C,EAASpK,EAAK3wC,OAAS,EAAI2wC,EAAK3wC,OAASi5F,EAC1D32F,CACR,EAjCaI,QAOd,WACS,MAAA,CAACqkB,IAAK,CAAC+zB,OAAMC,UAASk+C,YAC9B,EATsBE,MAgBdA,SAAM72F,GACb22F,GAAa32F,CACd,EAgBF,CChDD,MAAMo3F,GAAM,YCUL,SAASp/B,GAASxzD,EAAMssB,EAAQ9O,EAAS+0E,GAC9C,MAAM4D,ECVD,SAA6B34E,GAC5B1e,MAAAA,EAAQ0e,EAAQtb,QAAQi0F,gBAAkB,MAIhD,GAAc,IAAVr3F,GAAyB,MAAVA,EACjB,MAAO,MAGLA,GAAU,QAAVA,GAA6B,QAAVA,GAA6B,UAAVA,EACxC,MAAM,IAAIvC,MACR,gCACEuC,EACA,qEAIN,OAAOA,CACR,CDRwBs3F,CAAoB54E,GACvC64E,IAAAA,EAAS74E,EAAQ84E,eEXhB,SAAqB94E,GACpBukC,MAAAA,EAASvkC,EAAQtb,QAAQm0F,QAAU,IAErCt0C,GAAW,MAAXA,GAA6B,MAAXA,GAA6B,MAAXA,EACtC,MAAM,IAAIxlD,MACR,gCACEwlD,EACA,qDAIN,OAAOA,CACR,CFDuCw0C,CAAY/4E,GAG9C8O,GAA0B,SAAhBA,EAAOzqB,MAAmByqB,EAAO4rC,UAC7Cm+B,GAC2B,iBAAjB/pE,EAAOzmB,OAAsBymB,EAAOzmB,OAAS,EACjDymB,EAAOzmB,MACP,KACqC,IAAxC2X,EAAQtb,QAAQs0F,oBACb,EACAlqE,EAAO1sB,SAAS2xB,QAAQvxB,IAC5Bq2F,GAGJ,IAAIpsF,EAAOosF,EAAOn9F,OAAS,GAGN,QAAnBi9F,GACoB,UAAnBA,IACG7pE,GAA0B,SAAhBA,EAAOzqB,MAAmByqB,EAAOsd,QAAW5pC,EAAK4pC,WAE/D3/B,EAA6B,EAAtB4T,KAAKwC,KAAKpW,EAAO,IAG1B,MAAMwoF,EAAUR,GAAMM,GACtBE,EAAQL,KAAKiE,EAAS,IAAIhoD,OAAOpkC,EAAOosF,EAAOn9F,SAC/Cu5F,EAAQJ,MAAMpoF,GACd,MAAMy0C,EAAOlhC,EAAQghC,MAAM,YACrBhjD,EDjCD,SAAqBA,EAAOuI,GAE3BqV,MAAAA,EAAS,GACXvT,IAGAoX,EAHApX,EAAQ,EACRmuC,EAAO,EAIH/2B,KAAAA,EAAQ21E,GAAIr0E,KAAK/iB,IACvB4gD,EAAI5gD,EAAM2f,MAAMtV,EAAOoX,EAAMxP,QAC7B2L,EAAOrY,KAAKkc,EAAM,IAClBpX,EAAQoX,EAAMxP,MAAQwP,EAAM,GAAG/jB,OAC/B86C,IAKF,OAFAoI,EAAI5gD,EAAM2f,MAAMtV,IAETuT,EAAOlY,KAAK,IAKVk7C,SAAAA,EAAI5gD,GACX4d,EAAOrY,KAAKgD,EAAIvI,EAAOw4C,GAAOx4C,GAC/B,CACF,CCQeq3F,CGhCT,SAAuBvmE,EAAQ9O,EAAS+0E,GAC7C,MAAMC,EAAah1E,EAAQg1E,WACrB5yF,EAAW0sB,EAAO1sB,UAAY,GAC9B6yF,EAAUR,GAAMM,GAEhB9gB,EAAU,GACZhkE,IAAAA,GAAS,EAIb,IAFA+kF,EAAWzxF,MAAM,KAER0M,EAAQ7N,EAAS1G,QAAQ,CAChC,MAAM8jE,EAAQp9D,EAAS6N,GAEvB+kF,EAAWA,EAAWt5F,OAAS,GAAKuU,EAEpCgkE,EAAQ1wE,KACN0xF,EAAQL,KACN50E,EAAQk1E,OAAO11B,EAAO1wC,EAAQ9O,EAAS,CACrCqiB,OAAQ,KACRgH,MAAO,QACJ4rD,EAAQ72F,cAKE,SAAfohE,EAAMn7D,OACR2b,EAAQm1E,oBAAiB13F,GAGvBwS,EAAQ7N,EAAS1G,OAAS,GAC5Bu4E,EAAQ1wE,KAAK0xF,EAAQL,KAAKplC,EAAQgQ,EAAOp9D,EAAS6N,EAAQ,KAE7D,CAID,OAFA+kF,EAAWjpE,MAEJkoD,EAAQvwE,KAAK,IAOpB,SAAS8rD,EAAQ/P,EAAMC,GACrB,IAAIzvC,EAAQ+P,EAAQtc,KAAKhI,OAElBuU,KAAAA,KAAS,CACd,MAAM2L,EAASoE,EAAQtc,KAAKuM,GAAOwvC,EAAMC,EAAO5wB,EAAQ9O,GAExD,IAAe,IAAXpE,GAA8B,IAAXA,EACrB,MAGF,GAAsB,iBAAXA,EACT,MAAO,KAAKi1B,OAAO,EAAIj1B,GAGrBA,IAAW,IAAXA,EACF,MAAO,uBAEV,CAED,MAAO,MACR,CACF,CH/BGk5E,CAActyF,EAAMwd,EAASi1E,EAAQ72F,YAQvC,SAAao4C,EAAMvmC,EAAOomF,GACxB,GAAIpmF,EACK,OAAComF,EAAQ,GAAK,IAAIxlD,OAAOpkC,IAAS+pC,EAG3C,OAAQ6/C,EAAQwC,EAASA,EAAS,IAAIhoD,OAAOpkC,EAAOosF,EAAOn9F,SAAW86C,CACvE,IATD,OAFA0K,IAEOljD,CAUR,CIjDM,MAAMi7F,GAA8B,CACzC/3C,KAAM,CACJg4C,0BAA2BC,GAC3BC,4BAA6BD,GAC7BxoC,UAkBJ,SAAuChP,GACrC,MAAM7yB,EAAqC/F,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAC/D8G,EAAsCumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAChE29F,EAAWvqE,EAAO1sB,SAClBk+B,EAAO99B,EAAKJ,SAAS,GACvB6N,IAEAqpF,EAFArpF,GAAS,EAKX6e,GAAAA,GACgB,aAAhBA,EAAOzqB,MACmB,kBAAnByqB,EAAOxgB,SACdgyB,GACc,SAAdA,EAAKj8B,KACL,CACA,OAAS4L,EAAQopF,EAAS39F,QAAQ,CAChC,MAAM69F,EAAUF,EAASppF,GACzB,GAAqB,cAAjBspF,EAAQl1F,KAAsB,CAChCi1F,EAAkBC,EAClB,KACD,CACF,CAEGD,IAAoB92F,IAEtB89B,EAAKtiC,MAAQsiC,EAAKtiC,MAAM2f,MAAM,GAEJ,IAAtB2iB,EAAKtiC,MAAMtC,OACb8G,EAAKJ,SAASyyF,QAEdryF,EAAK8C,UACLg7B,EAAKh7B,UACiC,iBAA/Bg7B,EAAKh7B,SAAS+C,MAAM+T,SAE3BkkB,EAAKh7B,SAAS+C,MAAMouC,SACpBnW,EAAKh7B,SAAS+C,MAAM+T,SACpB5Z,EAAK8C,SAAS+C,MAAQlM,OAAOqpC,OAAO,CAAA,EAAIlF,EAAKh7B,SAAS+C,QAG3D,CAEI64C,KAAAA,KAAKS,EACX,IAxDY63C,GAA4B,CACvCzF,OAAQ,CAAC,CAAC9pC,SAAS,EAAM4oC,UAAW,IAAKxpD,MAAO,UAChDkyB,SAAU,CAACvF,SA4Db,SAAkCxzD,EAAMssB,EAAQ9O,EAAS+0E,GACvD,MAAMz0D,EAAO99B,EAAKJ,SAAS,GACrBq3F,EACoB,kBAAjBj3F,EAAK8L,SAAyBgyB,GAAsB,cAAdA,EAAKj8B,KAC9Cq1F,EAAW,KAAOl3F,EAAK8L,QAAU,IAAM,KAAO,KAC9C2mF,EAAUR,GAAMM,GAElB0E,GACFxE,EAAQL,KAAK8E,GAGf,IAAI17F,EAAQg4D,GAASxzD,EAAMssB,EAAQ9O,EAAS,IACvC+0E,KACAE,EAAQ72F,YAGTq7F,IACFz7F,EAAQA,EAAM6f,QAAQ,mCASf8iC,SAAMuT,GACNA,OAAAA,EAAKwlC,CACb,KARD,OAAO17F,CASR,IArFD,SAASm7F,GAAUx3C,GAC0B54B,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEhE4S,QAAyB,8BAAfqzC,EAAMt9C,IACtB,CCrBc,SAASs1F,GAAUj1F,EAAU,IAC1C,MAAM+hB,EAAO5mB,KAAK4mB,OAUlB,SAAShmB,EAAIywD,EAAOlzD,IAIhByoB,EAAKyqC,GAASzqC,EAAKyqC,GAAUzqC,EAAKyqC,GAAS,IAGxC3tD,KAAKvF,EACX,CAhBDyC,EAAI,sBCiBC,SAAaiE,GAClB,OAAO06C,GAAkB,CACvBgwC,GlCTK,CACLvtC,SAAU,CACR,GAAM,CACJT,SAAU2uC,GACV3tC,aAAc,CACZhB,SAAU4uC,IAEZ9uC,KAAM+uC,KAGV1/E,KAAM,CACJ,GAAM,CACJ6wC,SAAUuuC,IAEZ,GAAM,CACJlvF,IAAK,QACL2gD,SAAUmuC,GACVriC,UAAWuiC,MkCNfS,GAAiBxrF,GACjB4rF,GACAqC,IAEH,CDzB4BiH,CAAIl1F,IAC/BjE,EAAI,yBEYG,CACL6yF,GnBTK,CACLtyC,MAAO,CACL64C,sBAcKC,SAAwBn4C,GAC/B9hD,KAAKmhD,MACH,CAAC38C,KAAM,qBAAsBsmD,WAAY,GAAI/pD,MAAO,GAAIwB,SAAU,IAClEu/C,EAEH,EAlBGo4C,iCAqBJ,WACEl6F,KAAKsqB,QACN,EAtBG6vE,gBA0CKC,SAAkBt4C,GACzB9hD,KAAKmhD,MAAM,CAAC38C,KAAM,oBAAqBsmD,WAAY,GAAI/pD,MAAO,IAAK+gD,EACpE,EA3CGu4C,sBA8CJ,WACEr6F,KAAKsqB,QACN,GA9CC+2B,KAAM,CACJ24C,sBAiCKM,SAAuBx4C,GACzBT,KAAAA,KAAKS,EACX,EAlCGo4C,iCAoBKK,SAAkCz4C,GACzC,MAAM/gD,EAAQf,KAAK25D,SACbh3D,EACCumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEjC8G,EAAK5B,MAAQA,EACb4B,EAAKmoD,WAAaF,GAChB5qD,KAAKmlD,eAAerD,IACpB7a,aACH,EA5BGkzD,gBA0DKK,SAAiB14C,GACnBT,KAAAA,KAAKS,EACX,EA3DGu4C,sBA6CKI,SAAuB34C,GAC9B,MAAM/gD,EAAQf,KAAK25D,SACbh3D,EACCumB,KAAAA,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GAEjC8G,EAAK5B,MAAQA,EACb4B,EAAKmoD,WAAaF,GAChB5qD,KAAKmlD,eAAerD,IACpB7a,aACH,ImBtDCwvD,GACAO,GACAoC,KFhBFx4F,EAAI,uBEwBC,SAAuBiE,GACrB,MAAA,CACL26C,WAAY,CACVy0C,GACAoC,KACAK,GACAW,GAAmBxyF,GACnB80F,IAGL,CFlC6Be,CAAc71F,GAe3C,CGjCD,IAAI81F,GAAgB,CAAC72F,QAAS,CAAA,GAE9B,SAAS82F,GAAWpkD,GAuBhB,OAtBIA,aAAeryB,IACfqyB,EAAIjwB,MAAQiwB,EAAI0oB,OAAS1oB,EAAIl3B,IAAM,WAC/B,MAAM,IAAIpgB,MAAM,mBACnB,EACMs3C,aAAer2C,MACtBq2C,EAAI51C,IAAM41C,EAAIjwB,MAAQiwB,EAAI0oB,OAAS,WAC/B,MAAM,IAAIhgE,MAAM,mBACnB,GAIL5C,OAAO6gD,OAAO3G,GAEdl6C,OAAOu+F,oBAAoBrkD,GAAK/1C,SAAQ,SAAUgE,GAC9C,IAAImiC,EAAO4P,EAAI/xC,GAGI,iBAARmiC,GAAqBtqC,OAAOw+F,SAASl0D,IAC5Cg0D,GAAWh0D,EAElB,IAEM4P,CACV,CAEDmkD,GAAc72F,QAAU82F,GACxBD,GAAc72F,QAAQC,QAAU62F,GAEhC,IAAIG,GAAeJ,GAAc72F,QAMjC,MAAMk3F,GAIJp/F,WAAAA,CAAYwjF,QAEQxhF,IAAdwhF,EAAKx4D,OAAoBw4D,EAAKx4D,KAAO,CAAA,GAEzC5mB,KAAK4mB,KAAOw4D,EAAKx4D,KACZq0E,KAAAA,gBAAiB,CACvB,CAEDC,WAAAA,GACOD,KAAAA,gBAAiB,CACvB,EAOH,SAASE,GAAWh9F,GAClB,OAAOA,EACJ6f,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,UACdA,QAAQ,KAAM,SAClB,CAUD,SAASo9E,GAAUC,KAAaC,GAE9B,MAAMv/E,EAASzf,OAAOylB,OAAO,MAE7B,IAAK,MAAMplB,KAAO0+F,EAChBt/E,EAAOpf,GAAO0+F,EAAS1+F,GAOzB,OALA2+F,EAAQ76F,SAAQ,SAAS+1C,GACvB,IAAK,MAAM75C,KAAO65C,EAChBz6B,EAAOpf,GAAO65C,EAAI75C,EAErB,IACD,CACD,CAcD,MAMM4+F,GAAqB54F,KAChBA,EAAK8oD,KAoBhB,MAAM+vC,GAOJ5/F,WAAAA,CAAY6/F,EAAW52F,GAChBylB,KAAAA,OAAS,GACdtqB,KAAK07F,YAAc72F,EAAQ62F,YAC3BD,EAAUE,KAAK37F,KAChB,CAMD47F,OAAAA,CAAQlrF,GACN1Q,KAAKsqB,QAAU6wE,GAAWzqF,EAC3B,CAMDmrF,QAAAA,CAASl5F,GACP,IAAK44F,GAAkB54F,GAAO,OAE9B,IAAI6tE,EAAQ7tE,EAAK8oD,KAEf+kB,EADE7tE,EAAKm5F,YACE,YAAWtrB,IA1CF,EAAC/rE,GAAQ6uC,aAC/B,GAAI7uC,EAAKuN,SAAS,KAAM,CACtB,MAAM+pF,EAASt3F,EAAKqb,MAAM,KAC1B,MAAO,CACJ,GAAEwzB,IAASyoD,EAAO/G,aACf+G,EAAOr1F,KAAI,CAAC1J,EAAGlB,IAAO,GAAEkB,IAAI,IAAIg0C,OAAOl1C,EAAI,QAC/C+H,KAAK,IACR,CACD,MAAQ,GAAEyvC,IAAS7uC,GAAnB,EAoCYu3F,CAAgBxrB,EAAO,CAAEl9B,OAAQtzC,KAAK07F,cAE3C7qB,KAAAA,KAAKL,EACX,CAMDyrB,SAAAA,CAAUt5F,GACH44F,GAAkB54F,KAElB2nB,KAAAA,QAvEU,UAwEhB,CAKDnsB,KAAAA,GACE,OAAO6B,KAAKsqB,MAnDG,CA4DjBumD,IAAAA,CAAKztE,GACHpD,KAAKsqB,QAAW,gBAAelnB,KAChC,EAQH,MAAM84F,GACJtgG,WAAAA,GAEEoE,KAAKm8F,SAAW,CAAE55F,SAAU,IAC5BvC,KAAKkpB,MAAQ,CAAClpB,KAAKm8F,SACpB,CAEM,OAAHC,GACK,OAAAp8F,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,EACvC,CAEO,QAAJ8d,GAAS,OAAO3Z,KAAKm8F,QAAW,CAGpCv7F,GAAAA,CAAI+B,GACF3C,KAAKo8F,IAAI75F,SAASmB,KAAKf,EACxB,CAGDk5F,QAAAA,CAASpwC,GAEP,MAAM9oD,EAAO,CAAE8oD,OAAMlpD,SAAU,IAC1B3B,KAAAA,IAAI+B,GACT3C,KAAKkpB,MAAMxlB,KAAKf,EACjB,CAEDs5F,SAAAA,GACE,GAAIj8F,KAAKkpB,MAAMrtB,OAAS,EACtB,OAAOmE,KAAKkpB,MAAMgD,KAIrB,CAEDmwE,aAAAA,GACS,KAAAr8F,KAAKi8F,cACb,CAEDhnD,MAAAA,GACSkE,OAAAA,KAAKC,UAAUp5C,KAAKm8F,SAAU,KAAM,EAC5C,CAMDR,IAAAA,CAAKW,GAEI,OAAAt8F,KAAKpE,YAAY2gG,MAAMD,EAASt8F,KAAKm8F,SAG7C,CAMW,YAALI,CAAMD,EAAS35F,GAQpB,MAPoB,iBAATA,EACT25F,EAAQV,QAAQj5F,GACPA,EAAKJ,WACd+5F,EAAQT,SAASl5F,GACjBA,EAAKJ,SAAS9B,SAASk/D,GAAU3/D,KAAKu8F,MAAMD,EAAS38B,KACrD28B,EAAQL,UAAUt5F,IAEb25F,CACR,CAKME,gBAAAA,CAAU75F,GACK,iBAATA,GACNA,EAAKJ,WAENI,EAAKJ,SAASgsC,OAAMkuD,GAAoB,iBAAPA,IAGnC95F,EAAKJ,SAAW,CAACI,EAAKJ,SAASsB,KAAK,KAEpClB,EAAKJ,SAAS9B,SAASk/D,IACrBu8B,GAAUM,UAAU78B,EAApB,IAGL,EAuBH,MAAM+8B,WAAyBR,GAI7BtgG,WAAAA,CAAYiJ,GACVsyC,QACKtyC,KAAAA,QAAUA,CAChB,CAMD83F,UAAAA,CAAWjsF,EAAM+6C,GACF,KAAT/6C,IAECmrF,KAAAA,SAASpwC,GACTmwC,KAAAA,QAAQlrF,GACb1Q,KAAKi8F,YACN,CAKDL,OAAAA,CAAQlrF,GACO,KAATA,GAEC9P,KAAAA,IAAI8P,EACV,CAMDksF,cAAAA,CAAeC,EAASp4F,GAEtB,MAAM9B,EAAOk6F,EAAQljF,KACrBhX,EAAK8oD,KAAOhnD,EACZ9B,EAAKm5F,aAAc,EACdl7F,KAAAA,IAAI+B,EACV,CAEDm6F,MAAAA,GAESC,OADU,IAAIvB,GAAax7F,KAAMA,KAAK6E,SAC7B1G,OACjB,CAED6+F,QAAAA,GACE,OAAO,CACR,EAYH,SAAS7gG,GAAOwtF,GACd,OAAKA,EACa,iBAAPA,EAAwBA,EAE5BA,EAAGxtF,OAHM,IAIjB,CAMD,SAAS8gG,GAAUtT,GACjB,OAAOl/E,GAAO,MAAOk/E,EAAI,IAC1B,CAMD,SAASuT,GAAiBvT,GACxB,OAAOl/E,GAAO,MAAOk/E,EAAI,KAC1B,CAMD,SAASwT,GAASxT,GAChB,OAAOl/E,GAAO,MAAOk/E,EAAI,KAC1B,CAMD,SAASl/E,MAAU2Q,GAEjB,OADeA,EAAK1U,KAAK1J,GAAMb,GAAOa,KAAI6G,KAAK,GAEhD,CA0BD,SAASu5F,MAAUhiF,GAEjB,MAAMiiF,EAtBR,SAA8BjiF,GACtBiiF,MAAAA,EAAOjiF,EAAKA,EAAKvf,OAAS,GAE5B,MAAgB,iBAATwhG,GAAqBA,EAAKzhG,cAAgBU,QACnD8e,EAAK7J,OAAO6J,EAAKvf,OAAS,EAAG,GACtBwhG,GAEA,EAEV,CAacC,CAAqBliF,GAIlC,MAHe,KACViiF,EAAKp1B,QAAU,GAAK,MACrB7sD,EAAK1U,KAAK1J,GAAMb,GAAOa,KAAI6G,KAAK,KAAO,GAE5C,CAMD,SAAS05F,GAAiB5T,GACxB,OAAQ,IAAIztF,OAAOytF,EAAGntF,WAAa,KAAM0kB,KAAK,IAAIrlB,OAAS,CAC5D,CAmBD,MAAM2hG,GAAa,iDAanB,SAASC,GAAuBC,GAASC,SAAEA,IACrCC,IAAAA,EAAc,EAElB,OAAOF,EAAQh3F,KAAKm6C,IAClB+8C,GAAe,EACTrhF,MAAAA,EAASqhF,EACf,IAAIjU,EAAKxtF,GAAO0kD,GACZif,EAAM,GAEV,KAAO6pB,EAAG9tF,OAAS,GAAG,CACpB,MAAM+jB,EAAQ49E,GAAWt8E,KAAKyoE,GAC1B,IAAC/pE,EAAO,CACVkgD,GAAO6pB,EACP,KACD,CACD7pB,GAAO6pB,EAAGz2C,UAAU,EAAGtzB,EAAMxP,OAC7Bu5E,EAAKA,EAAGz2C,UAAUtzB,EAAMxP,MAAQwP,EAAM,GAAG/jB,QACrB,OAAhB+jB,EAAM,GAAG,IAAeA,EAAM,GAEhCkgD,GAAO,KAAOr/C,OAAOhX,OAAOmW,EAAM,IAAMrD,IAExCujD,GAAOlgD,EAAM,GACI,MAAbA,EAAM,IACRg+E,IAGL,CACD,OAAO99B,CAAP,IACCp5D,KAAIijF,GAAO,IAAGA,OAAO9lF,KAAK85F,EAC9B,CAMD,MACME,GAAW,eACXC,GAAsB,gBACtBC,GAAY,oBACZC,GAAc,yEACdC,GAAmB,eA4BnBC,GAAmB,CACvB/iB,MAAO,eAAgBgjB,UAAW,GAE9BC,GAAmB,CACvB5tB,MAAO,SACP2K,MAAO,IACPzyE,IAAK,IACL21F,QAAS,MACTC,SAAU,CAACJ,KAEPK,GAAoB,CACxB/tB,MAAO,SACP2K,MAAO,IACPzyE,IAAK,IACL21F,QAAS,MACTC,SAAU,CAACJ,KAaPM,GAAU,SAASrjB,EAAOzyE,EAAK+1F,EAAc,CAAA,GAC3Crf,MAAAA,EAAOgc,GACX,CACE5qB,MAAO,UACP2K,QACAzyE,MACA41F,SAAU,IAEZG,GAEFrf,EAAKkf,SAAS56F,KAAK,CACjB8sE,MAAO,SAGP2K,MAAO,mDACPzyE,IAAK,2CACLg2F,cAAc,EACdP,UAAW,IAEPQ,MAAAA,EAAevB,GAAM,IAGzB,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KAEA,iCACA,qBACA,qBA4BF,OAzBAhe,EAAKkf,SAAS56F,KACZ,CAgBEy3E,MAAO1wE,GACL,OACA,IACAk0F,EACA,uBACA,UAGCvf,CACR,EACKwf,GAAsBJ,GAAQ,KAAM,KACpCK,GAAuBL,GAAQ,OAAQ,QACvCM,GAAoBN,GAAQ,IAAK,KACjCO,GAAc,CAClBvuB,MAAO,SACP2K,MAAO4iB,GACPI,UAAW,GAEPa,GAAgB,CACpBxuB,MAAO,SACP2K,MAAO6iB,GACPG,UAAW,GAEPc,GAAqB,CACzBzuB,MAAO,SACP2K,MAAO8iB,GACPE,UAAW,GAEPe,GAAc,CAOlB/jB,MAAO,kBACPmjB,SAAU,CAAC,CACT9tB,MAAO,SACP2K,MAAO,KACPzyE,IAAK,aACL21F,QAAS,KACTC,SAAU,CACRJ,GACA,CACE/iB,MAAO,KACPzyE,IAAK,KACLy1F,UAAW,EACXG,SAAU,CAACJ,SAKbiB,GAAa,CACjB3uB,MAAO,QACP2K,MAAO0iB,GACPM,UAAW,GAEPiB,GAAwB,CAC5B5uB,MAAO,QACP2K,MAAO2iB,GACPK,UAAW,GAEPkB,GAAe,CAEnBlkB,MAAO,UAAY2iB,GACnBK,UAAW,GAoBb,IAAImB,GAAqBhjG,OAAO6gD,OAAO,CACnCoiD,UAAW,KACXC,iBA3MqB,OA4MrB3B,SAAUA,GACVC,oBAAqBA,GACrBC,UAAWA,GACXC,YAAaA,GACbC,iBAAkBA,GAClBwB,eA3MmB,+IA4MnBC,QAvMY,CAACrC,EAAO,MAChBsC,MAAAA,EAAe,YAQrB,OAPItC,EAAKuC,SACPvC,EAAKliB,MAAQ1wE,GACXk1F,EACA,OACAtC,EAAKuC,OACL,SAEGxE,GAAU,CACf5qB,MAAO,OACP2K,MAAOwkB,EACPj3F,IAAK,IACLy1F,UAAW,EAEX,WAAY,CAAC/Y,EAAGya,KACE,IAAZza,EAAEh1E,OAAayvF,EAAK3E,aAAL,GAEpBmC,EATH,EA+LEa,iBAAkBA,GAClBE,iBAAkBA,GAClBG,kBAAmBA,GACnBuB,mBApKuB,CACzB3kB,MAAO,8IAoKLqjB,QAASA,GACTI,oBAAqBA,GACrBC,qBAAsBA,GACtBC,kBAAmBA,GACnBC,YAAaA,GACbC,cAAeA,GACfC,mBAAoBA,GACpBC,YAAaA,GACbC,WAAYA,GACZC,sBAAuBA,GACvBC,aAAcA,GACdU,kBAnCsB,SAAS3gB,GACjC,OAAO9iF,OAAOqpC,OAAOy5C,EACnB,CAEE,WAAY,CAACgG,EAAGya,KAAWA,EAAKj5E,KAAKo5E,YAAc5a,EAAE,EAA1B,EAE3B,SAAU,CAACA,EAAGya,KAAeA,EAAKj5E,KAAKo5E,cAAgB5a,EAAE,IAAIya,EAAK3E,aAAL,GAElE,IA2DD,SAAS+E,GAAsBrgF,EAAOsgF,GAErB,MADAtgF,EAAM0J,MAAM1J,EAAMxP,MAAQ,IAEvC8vF,EAAShF,aAEZ,CAMD,SAASiF,GAAe/gB,EAAMghB,QAELxiG,IAAnBwhF,EAAKh8E,YACPg8E,EAAK5O,MAAQ4O,EAAKh8E,iBACXg8E,EAAKh8E,UAEf,CAMD,SAASi9F,GAAcjhB,EAAMnwD,GACtBA,GACAmwD,EAAKihB,gBAOVjhB,EAAKjE,MAAQ,OAASiE,EAAKihB,cAAcvgF,MAAM,KAAKjc,KAAK,KAAO,sBAChEu7E,EAAKkhB,cAAgBL,GACrB7gB,EAAKmhB,SAAWnhB,EAAKmhB,UAAYnhB,EAAKihB,qBAC/BjhB,EAAKihB,mBAKWziG,IAAnBwhF,EAAK+e,YAAyB/e,EAAK+e,UAAY,GACpD,CAMD,SAASqC,GAAephB,EAAMghB,GACvBpkG,MAAMC,QAAQmjF,EAAKif,WAExBjf,EAAKif,QAAUjB,MAAUhe,EAAKif,SAC/B,CAMD,SAASoC,GAAarhB,EAAMghB,GAC1B,GAAKhhB,EAAKx/D,MAAV,CACA,GAAIw/D,EAAKjE,OAASiE,EAAK12E,IAAK,MAAM,IAAIxJ,MAAM,4CAE5CkgF,EAAKjE,MAAQiE,EAAKx/D,aACXw/D,EAAKx/D,KAJK,CAKlB,CAMD,SAAS8gF,GAAiBthB,EAAMghB,QAEPxiG,IAAnBwhF,EAAK+e,YAAyB/e,EAAK+e,UAAY,EACpD,CAID,MAAMwC,GAAiB,CAACvhB,EAAMnwD,KAC5B,IAAKmwD,EAAKwhB,YAAa,OAGnBxhB,GAAAA,EAAKyhB,OAAQ,MAAM,IAAI3hG,MAAM,0CAE3B4hG,MAAAA,EAAexkG,OAAOqpC,OAAO,CAAd,EAAkBy5C,GACvC9iF,OAAOP,KAAKqjF,GAAM3+E,SAAS9D,WAAiByiF,EAAKziF,EAAZ,IAErCyiF,EAAKmhB,SAAWO,EAAaP,SAC7BnhB,EAAKjE,MAAQ1wE,GAAOq2F,EAAaF,YAAa3D,GAAU6D,EAAa3lB,QACrEiE,EAAKyhB,OAAS,CACZ1C,UAAW,EACXG,SAAU,CACRhiG,OAAOqpC,OAAOm7D,EAAc,CAAEC,YAAY,MAG9C3hB,EAAK+e,UAAY,SAEV2C,EAAaF,WAApB,EAIII,GAAkB,CACtB,KACA,MACA,MACA,KACA,MACA,KACA,KACA,OACA,SACA,OACA,SAGIC,GAAwB,UAQ9B,SAASC,GAAgBC,EAAaC,EAAiBC,EAAYJ,IAE3DK,MAAAA,EAAmBhlG,OAAOylB,OAAO,MAiBhCu/E,MAboB,iBAAhBH,EACTI,EAAYF,EAAWF,EAAYrhF,MAAM,MAChC9jB,MAAMC,QAAQklG,GACvBI,EAAYF,EAAWF,GAEvB7kG,OAAOP,KAAKolG,GAAa1gG,SAAQ,SAAS4gG,GAExC/kG,OAAOqpC,OACL27D,EACAJ,GAAgBC,EAAYE,GAAYD,EAAiBC,GAE5D,IAEIC,EAYP,SAASC,EAAYF,EAAWG,GAC1BJ,IACFI,EAAcA,EAAY96F,KAAI1J,GAAKA,EAAEiqC,iBAEvCu6D,EAAY/gG,SAAQ,SAASghG,GAC3B,MAAMpkE,EAAOokE,EAAQ3hF,MAAM,KAC3BwhF,EAAiBjkE,EAAK,IAAM,CAACgkE,EAAWK,GAAgBrkE,EAAK,GAAIA,EAAK,IACvE,GACF,CACF,CAUD,SAASqkE,GAAgBD,EAASE,GAGhC,OAAIA,EACKl4F,OAAOk4F,GAUlB,SAAuBF,GACdT,OAAAA,GAAgBhvF,SAASyvF,EAAQx6D,cACzC,CATQ26D,CAAcH,GAAW,EAAI,CACrC,CAoBD,MAAMI,GAAmB,CAAA,EAKnB59F,GAAS8B,IACb2hF,QAAQzjF,MAAM8B,EAAd,EAOI8mF,GAAO,CAAC9mF,KAAYqV,KACxBssE,QAAQoa,IAAK,SAAQ/7F,OAAcqV,EAAnC,EAOI+wE,GAAa,CAACxY,EAAS5tE,KACvB87F,GAAkB,GAAEluB,KAAW5tE,OAEnC2hF,QAAQoa,IAAK,oBAAmBnuB,MAAY5tE,KAC5C87F,GAAkB,GAAEluB,KAAW5tE,MAAa,EAA5C,EASIg8F,GAAkB,IAAI7iG,MA8B5B,SAAS8iG,GAAgB5iB,EAAM6iB,GAAStlG,IAAEA,IACpC4f,IAAAA,EAAS,EACb,MAAM2lF,EAAa9iB,EAAKziF,GAElBwlG,EAAO,CAAA,EAEPpM,EAAY,CAAA,EAElB,IAAK,IAAIj6F,EAAI,EAAGA,GAAKmmG,EAAQpmG,OAAQC,IACnCi6F,EAAUj6F,EAAIygB,GAAU2lF,EAAWpmG,GACnCqmG,EAAKrmG,EAAIygB,IAAU,EACnBA,GAAUghF,GAAiB0E,EAAQnmG,EAAI,IAIzCsjF,EAAKziF,GAAOo5F,EACZ3W,EAAKziF,GAAKylG,MAAQD,EAClB/iB,EAAKziF,GAAK0lG,QAAS,CACpB,CA+DD,SAASC,GAAWljB,IAVpB,SAAoBA,GACdA,EAAK5O,OAA+B,iBAAf4O,EAAK5O,OAAqC,OAAf4O,EAAK5O,QACvD4O,EAAKmjB,WAAanjB,EAAK5O,aAChB4O,EAAK5O,MAEf,CAMCgyB,CAAWpjB,GAEoB,iBAApBA,EAAKmjB,aACdnjB,EAAKmjB,WAAa,CAAEE,MAAOrjB,EAAKmjB,aAEL,iBAAlBnjB,EAAKsjB,WACdtjB,EAAKsjB,SAAW,CAAED,MAAOrjB,EAAKsjB,WAjElC,SAAyBtjB,GACnB,GAACpjF,MAAMC,QAAQmjF,EAAKjE,OAApB,CAEAiE,GAAAA,EAAKz2D,MAAQy2D,EAAKsf,cAAgBtf,EAAKujB,YAEzC,MADA1+F,GAAM,sEACA89F,GAGR,GAA+B,iBAApB3iB,EAAKmjB,YAA+C,OAApBnjB,EAAKmjB,WAE9C,MADAt+F,GAAM,6BACA89F,GAGRC,GAAgB5iB,EAAMA,EAAKjE,MAAO,CAAEx+E,IAAK,eACzCyiF,EAAKjE,MAAQsiB,GAAuBre,EAAKjE,MAAO,CAAEwiB,SAAU,IAb5B,CAcjC,CAqDCiF,CAAgBxjB,GAhDlB,SAAuBA,GACjB,GAACpjF,MAAMC,QAAQmjF,EAAK12E,KAApB,CAEA02E,GAAAA,EAAKz2D,MAAQy2D,EAAKyjB,YAAczjB,EAAK0jB,UAEvC,MADA7+F,GAAM,gEACA89F,GAGR,GAA6B,iBAAlB3iB,EAAKsjB,UAA2C,OAAlBtjB,EAAKsjB,SAE5C,MADAz+F,GAAM,2BACA89F,GAGRC,GAAgB5iB,EAAMA,EAAK12E,IAAK,CAAE/L,IAAK,aACvCyiF,EAAK12E,IAAM+0F,GAAuBre,EAAK12E,IAAK,CAAEi1F,SAAU,IAb1B,CAc/B,CAkCCoF,CAAc3jB,EACf,CAoBD,SAAS4jB,GAAgB14B,GAOvB,SAAS24B,EAAO9kG,EAAOqb,GACrB,OAAO,IAAItd,OACTC,GAAOgC,GACP,KACGmsE,EAAS44B,iBAAmB,IAAM,KAClC54B,EAAS64B,aAAe,IAAM,KAC9B3pF,EAAS,IAAM,IAErB,CAeD,MAAM4pF,EACJxnG,WAAAA,GACEoE,KAAKqjG,aAAe,GAEfpB,KAAAA,QAAU,GACVqB,KAAAA,QAAU,EACV79F,KAAAA,SAAW,CANH,CAUf89F,OAAAA,CAAQ5Z,EAAI0T,GACVA,EAAK53F,SAAWzF,KAAKyF,WAErBzF,KAAKqjG,aAAarjG,KAAKsjG,SAAWjG,EAC7B4E,KAAAA,QAAQv+F,KAAK,CAAC25F,EAAM1T,IACzB3pF,KAAKsjG,SAAW/F,GAAiB5T,GAAM,CACxC,CAEDvrC,OAAAA,GAC8B,IAAxBp+C,KAAKiiG,QAAQpmG,SAGVqlB,KAAAA,KAAO,IAAM,MAEpB,MAAMsiF,EAAcxjG,KAAKiiG,QAAQv7F,KAAI+1F,GAAMA,EAAG,KAC9Cz8F,KAAKyjG,UAAYR,EAAOxF,GAAuB+F,EAAa,CAAE7F,SAAU,OAAQ,GAC3El+E,KAAAA,UAAY,CAClB,CAGDyB,IAAAA,CAAKytE,GACH3uF,KAAKyjG,UAAUhkF,UAAYzf,KAAKyf,UAC1BG,MAAAA,EAAQ5f,KAAKyjG,UAAUviF,KAAKytE,GAC9B,IAAC/uE,EAAS,OAAO,KAGf9jB,MAAAA,EAAI8jB,EAAM2gB,WAAU,CAACk8D,EAAI3gG,IAAMA,EAAI,QAAY8B,IAAP6+F,IAExCvrE,EAAYlxB,KAAKqjG,aAAavnG,GAKpC,OAFA8jB,EAAMrO,OAAO,EAAGzV,GAETQ,OAAOqpC,OAAO/lB,EAAOsR,EAC7B,EAkCH,MAAMwyE,EACJ9nG,WAAAA,GAEEoE,KAAKozE,MAAQ,GAERuwB,KAAAA,aAAe,GACfv2F,KAAAA,MAAQ,EAERqS,KAAAA,UAAY,EACZmkF,KAAAA,WAAa,CATI,CAaxBC,UAAAA,CAAWzzF,GACL,GAAApQ,KAAK2jG,aAAavzF,GAAQ,OAAOpQ,KAAK2jG,aAAavzF,GAEvD,MAAM0zF,EAAU,IAAIV,EAIpB,OAHKhwB,KAAAA,MAAMt1D,MAAM1N,GAAO3P,SAAQ,EAAEkpF,EAAI0T,KAAUyG,EAAQP,QAAQ5Z,EAAI0T,KACpEyG,EAAQ1lD,UACRp+C,KAAK2jG,aAAavzF,GAAS0zF,EACpBA,CACR,CAEDC,0BAAAA,GACS,OAAoB,IAApB/jG,KAAK4jG,UACb,CAEDI,WAAAA,GACOJ,KAAAA,WAAa,CA5BI,CAgCxBL,OAAAA,CAAQ5Z,EAAI0T,GACLjqB,KAAAA,MAAM1vE,KAAK,CAACimF,EAAI0T,IACH,UAAdA,EAAK74F,MAAkBxE,KAAKoN,OACjC,CAGD8T,IAAAA,CAAKytE,GACH,MAAMvJ,EAAIplF,KAAK6jG,WAAW7jG,KAAK4jG,YAC/Bxe,EAAE3lE,UAAYzf,KAAKyf,UACf1D,IAAAA,EAASqpE,EAAElkE,KAAKytE,GAiChB,GAAA3uF,KAAK+jG,6BACHhoF,GAAAA,GAAUA,EAAO3L,QAAUpQ,KAAKyf,eAAkB,CACpD,MAAMwkF,EAAKjkG,KAAK6jG,WAAW,GAC3BI,EAAGxkF,UAAYzf,KAAKyf,UAAY,EAChC1D,EAASkoF,EAAG/iF,KAAKytE,EAClB,CAWH,OARI5yE,IACF/b,KAAK4jG,YAAc7nF,EAAOtW,SAAW,EACjCzF,KAAK4jG,aAAe5jG,KAAKoN,OAE3BpN,KAAKgkG,eAIFjoF,CACR,EA2IH,GAHKuuD,EAAS45B,qBAAoB55B,EAAS45B,mBAAqB,IAG5D55B,EAASg0B,UAAYh0B,EAASg0B,SAAStsF,SAAS,QAClD,MAAM,IAAI9S,MAAM,6FAMlB,OAFAorE,EAAS65B,iBAAmB/I,GAAU9wB,EAAS65B,kBAAoB,CAA9B,GAhFrC,SAASC,EAAYhlB,EAAMnwD,GACzB,MAAMo1E,EAAmCjlB,EACzC,GAAIA,EAAKklB,WAAY,OAAOD,EAE5B,CACElE,GAGAM,GACA6B,GACA3B,IACAlgG,SAAQm3C,GAAOA,EAAIwnC,EAAMnwD,KAE3Bq7C,EAAS45B,mBAAmBzjG,SAAQm3C,GAAOA,EAAIwnC,EAAMnwD,KAGrDmwD,EAAKkhB,cAAgB,KAErB,CACED,GAGAG,GAEAE,IACAjgG,SAAQm3C,GAAOA,EAAIwnC,EAAMnwD,KAE3BmwD,EAAKklB,YAAa,EAEdC,IAAAA,EAAiB,KAwCrB,MAvC6B,iBAAlBnlB,EAAKmhB,UAAyBnhB,EAAKmhB,SAASiE,WAIrDplB,EAAKmhB,SAAWjkG,OAAOqpC,OAAO,CAAA,EAAIy5C,EAAKmhB,UACvCgE,EAAiBnlB,EAAKmhB,SAASiE,gBACxBplB,EAAKmhB,SAASiE,UAEvBD,EAAiBA,GAAkB,MAE/BnlB,EAAKmhB,WACPnhB,EAAKmhB,SAAWW,GAAgB9hB,EAAKmhB,SAAUj2B,EAAS44B,mBAG1DmB,EAAMI,iBAAmBxB,EAAOsB,GAAgB,GAE5Ct1E,IACGmwD,EAAKjE,QAAOiE,EAAKjE,MAAQ,SAC9BkpB,EAAMK,QAAUzB,EAAOoB,EAAMlpB,OACxBiE,EAAK12E,KAAQ02E,EAAKulB,iBAAgBvlB,EAAK12E,IAAM,SAC9C02E,EAAK12E,MAAK27F,EAAMO,MAAQ3B,EAAOoB,EAAM37F,MACzC27F,EAAMQ,cAAgB1oG,GAAOkoG,EAAM37F,MAAQ,GACvC02E,EAAKulB,gBAAkB11E,EAAO41E,gBAChCR,EAAMQ,gBAAkBzlB,EAAK12E,IAAM,IAAM,IAAMumB,EAAO41E,gBAGtDzlB,EAAKif,UAASgG,EAAMS,UAAY7B,EAAuC7jB,EAAKif,UAC3Ejf,EAAKkf,WAAUlf,EAAKkf,SAAW,IAEpClf,EAAKkf,SAAW,GAAG7zF,UAAU20E,EAAKkf,SAAS53F,KAAI,SAASu+E,GAC/C8f,OAoDb,SAA2B3lB,GACrBA,EAAK4lB,WAAa5lB,EAAK6lB,iBACzB7lB,EAAK6lB,eAAiB7lB,EAAK4lB,SAASt+F,KAAI,SAAS1E,GACxCo5F,OAAAA,GAAUhc,EAAM,CAAE4lB,SAAU,MAAQhjG,EAC5C,KAMCo9E,GAAAA,EAAK6lB,eACA7lB,OAAAA,EAAK6lB,eAOd,GAAIC,GAAmB9lB,GACdgc,OAAAA,GAAUhc,EAAM,CAAEyhB,OAAQzhB,EAAKyhB,OAASzF,GAAUhc,EAAKyhB,QAAU,OAG1E,GAAIvkG,OAAOw+F,SAAS1b,GACXgc,OAAAA,GAAUhc,GAInB,OAAOA,CACR,CAhFY2lB,CAAwB,SAAN9f,EAAe7F,EAAO6F,EADpB,KAG7B7F,EAAKkf,SAAS79F,SAAQ,SAASwkF,GAAKmf,EAA+Bnf,EAAIof,EAAS,IAE5EjlB,EAAKyhB,QACPuD,EAAYhlB,EAAKyhB,OAAQ5xE,GAG3Bo1E,EAAMP,QA1HCqB,SAAe/lB,GACtB,MAAMgmB,EAAK,IAAI1B,EAWf,OATAtkB,EAAKkf,SAAS79F,SAAQ4kG,GAAQD,EAAG7B,QAAQ8B,EAAKlqB,MAAO,CAAEmqB,KAAMD,EAAM7gG,KAAM,YAErE46E,EAAKylB,eACPO,EAAG7B,QAAQnkB,EAAKylB,cAAe,CAAErgG,KAAM,QAErC46E,EAAKif,SACP+G,EAAG7B,QAAQnkB,EAAKif,QAAS,CAAE75F,KAAM,YAG5B4gG,CACR,CA6GiBD,CAAed,GACxBA,CACR,CAYMD,CAA+B95B,EACvC,CAaD,SAAS46B,GAAmB9lB,GAC1B,QAAKA,IAEEA,EAAKulB,gBAAkBO,GAAmB9lB,EAAKyhB,QACvD,CA4CD,MAAM0E,WAA2BrmG,MAC/BtD,WAAAA,CAAYm7C,EAAQgf,GAClB5e,MAAMJ,GACDtyC,KAAAA,KAAO,qBACPsxD,KAAAA,KAAOA,CACb,EA8BH,MAAMlqC,GAASsvE,GACTqK,GAAUpK,GACVqK,GAAWhkF,OAAO,WAk8BxB,IAAIikF,GA37BS,SAASC,GAGpB,MAAMC,EAAYtpG,OAAOylB,OAAO,MAE1B8jF,EAAUvpG,OAAOylB,OAAO,MAExB47B,EAAU,GAIZmoD,IAAAA,GAAY,EACVC,MAAAA,EAAqB,sFAErBC,EAAqB,CAAEC,mBAAmB,EAAMxhG,KAAM,aAAc65F,SAAU,IAKpF,IAAIz5F,EAAU,CACZqhG,qBAAqB,EACrBC,oBAAoB,EACpBC,cAAe,qBACfC,iBAAkB,8BAClB3K,YAAa,QACb4K,YAAa,WACbV,UAAW,KAGXW,UAAW7J,IASJ8J,SAAAA,EAAmBC,GAC1B,OAAO5hG,EAAQuhG,cAAcrnF,KAAK0nF,EACnC,CA+CD,SAASf,EAAUgB,EAAoBC,EAAeC,GAChDruD,IAAAA,EAAO,GACPkuD,EAAe,GACU,iBAAlBE,GACTpuD,EAAOmuD,EACPE,EAAiBD,EAAcC,eAC/BH,EAAeE,EAAcr8B,WAG7B6hB,GAAW,SAAU,uDACrBA,GAAW,SAAU,yGACrBsa,EAAeC,EACfnuD,EAAOouD,QAKc/oG,IAAnBgpG,IAAgCA,GAAiB,GAGrD,MAAMzmF,EAAU,CACdo4B,OACA+xB,SAAUm8B,GAIZI,EAAK,mBAAoB1mF,GAInBpE,MAAAA,EAASoE,EAAQpE,OACnBoE,EAAQpE,OACR+qF,EAAW3mF,EAAQmqD,SAAUnqD,EAAQo4B,KAAMquD,GAM/C,OAJA7qF,EAAOw8B,KAAOp4B,EAAQo4B,KAEtBsuD,EAAK,kBAAmB9qF,GAEjBA,CACR,CAWQ+qF,SAAAA,EAAWL,EAAcM,EAAiBH,EAAgBrkD,GACjE,MAAMykD,EAAc1qG,OAAOylB,OAAO,MAYlC,SAASklF,IACP,IAAK7K,EAAImE,SAEP,YADA1D,EAAQjB,QAAQsL,GAIdznF,IAAAA,EAAY,EAChB28E,EAAIqI,iBAAiBhlF,UAAY,EAC7BG,IAAAA,EAAQw8E,EAAIqI,iBAAiBvjF,KAAKgmF,GAClCC,EAAM,GAEV,KAAOvnF,GAAO,CACZunF,GAAOD,EAAWh0D,UAAUzzB,EAAWG,EAAMxP,OAC7C,MAAM42B,EAAOsjC,EAAS44B,iBAAmBtjF,EAAM,GAAGqnB,cAAgBrnB,EAAM,GAClEgH,GAlBiBwgF,EAkBOpgE,EAALo1D,EAjBfmE,SAAS6G,IAkBnB,GAAIxgF,EAAM,CACR,MAAO6kC,EAAM47C,GAAoBzgF,EAMjC,GALAi2E,EAAQjB,QAAQuL,GAChBA,EAAM,GAENH,EAAYhgE,IAASggE,EAAYhgE,IAAS,GAAK,EAC3CggE,EAAYhgE,IAjLD,IAiL4Bm3D,GAAakJ,GACpD57C,EAAKha,WAAW,KAGlB01D,GAAOvnF,EAAM,OACR,CACC0nF,MAAAA,EAAWh9B,EAAS65B,iBAAiB14C,IAASA,EACpDoxC,EAAQF,WAAW/8E,EAAM,GAAI0nF,EAC9B,CACF,MACCH,GAAOvnF,EAAM,GAEfH,EAAY28E,EAAIqI,iBAAiBhlF,UACjCG,EAAQw8E,EAAIqI,iBAAiBvjF,KAAKgmF,EACnC,CAvCH,IAA2BE,EAwCzBD,GAAOD,EAAWK,OAAO9nF,GACzBo9E,EAAQjB,QAAQuL,EACjB,CA4BD,SAASK,IACgB,MAAnBpL,EAAIqL,YA3BV,WACMP,GAAe,KAAfA,EAAmB,OAEnBnrF,IAAAA,EAAS,KAEb,GAA+B,iBAApBqgF,EAAIqL,YAA0B,CACvC,IAAK7B,EAAUxJ,EAAIqL,aAEjB,YADA5K,EAAQjB,QAAQsL,GAGlBnrF,EAAS+qF,EAAW1K,EAAIqL,YAAaP,GAAY,EAAMQ,EAActL,EAAIqL,cACzEC,EAActL,EAAIqL,aAA4C1rF,EAAO4rF,IACtE,MACC5rF,EAAS6rF,EAAcV,EAAY9K,EAAIqL,YAAY5rG,OAASugG,EAAIqL,YAAc,MAO5ErL,EAAI+B,UAAY,IAClBA,GAAapiF,EAAOoiF,WAEtBtB,EAAQD,eAAe7gF,EAAO8rF,SAAU9rF,EAAOuuD,SAChD,CAIGw9B,GAEAb,IAEFC,EAAa,EACd,CAMD,SAASa,EAAev3B,EAAO5wD,GACzB9jB,IAAAA,EAAI,EACR,MAAM2M,EAAMmX,EAAM/jB,OAAS,EACpBC,KAAAA,GAAK2M,GAAK,CACf,IAAK+nE,EAAM4xB,MAAMtmG,GAAI,CAAEA,IAAK,QAAW,CACvC,MAAMksG,EAAQ19B,EAAS65B,iBAAiB3zB,EAAM10E,KAAO00E,EAAM10E,GACrD4U,EAAOkP,EAAM9jB,GACfksG,EACFnL,EAAQF,WAAWjsF,EAAMs3F,IAEzBd,EAAax2F,EACbu2F,IACAC,EAAa,IAEfprG,GACD,CACF,CAMD,SAASmsG,EAAa7oB,EAAMx/D,GAiB1B,OAhBIw/D,EAAK5O,OAA+B,iBAAf4O,EAAK5O,OAC5BqsB,EAAQhB,SAASvxB,EAAS65B,iBAAiB/kB,EAAK5O,QAAU4O,EAAK5O,OAE7D4O,EAAKmjB,aAEHnjB,EAAKmjB,WAAWE,OAClB5F,EAAQF,WAAWuK,EAAY58B,EAAS65B,iBAAiB/kB,EAAKmjB,WAAWE,QAAUrjB,EAAKmjB,WAAWE,OACnGyE,EAAa,IACJ9nB,EAAKmjB,WAAWF,SAEzB0F,EAAe3oB,EAAKmjB,WAAY3iF,GAChCsnF,EAAa,KAIjB9K,EAAM9/F,OAAOylB,OAAOq9D,EAAM,CAAEnwD,OAAQ,CAAE9wB,MAAOi+F,KACtCA,CACR,CAQD,SAAS8L,EAAU9oB,EAAMx/D,EAAOuoF,GAC1BC,IAAAA,EA/4CV,SAAoBze,EAAI0e,GAChBzoF,MAAAA,EAAQ+pE,GAAMA,EAAGzoE,KAAKmnF,GAC5B,OAAOzoF,GAAyB,IAAhBA,EAAMxP,KACvB,CA44CmBqhC,CAAW2tC,EAAKwlB,MAAOuD,GAErC,GAAIC,EAAS,CACX,GAAIhpB,EAAK,UAAW,CAClB,MAAMygB,EAAO,IAAI7E,GAAS5b,GAC1BA,EAAK,UAAUx/D,EAAOigF,GAClBA,EAAK5E,iBAAgBmN,GAAU,EACpC,CAED,GAAIA,EAAS,CACX,KAAOhpB,EAAK2hB,YAAc3hB,EAAKnwD,QAC7BmwD,EAAOA,EAAKnwD,OAEd,OAAOmwD,CACR,CAf+C,CAmB9CA,GAAAA,EAAKulB,eACAuD,OAAAA,EAAU9oB,EAAKnwD,OAAQrP,EAAOuoF,EAExC,CAOQG,SAAAA,EAASD,GAChB,OAA+B,IAA3BjM,EAAI0H,QAAQF,YAGdsD,GAAcmB,EAAO,GACd,IAIPE,GAA2B,EACpB,EAEV,CAyCQC,SAAAA,EAAW5oF,GAClB,MAAMyoF,EAASzoF,EAAM,GACfuoF,EAAqBpB,EAAgBQ,OAAO3nF,EAAMxP,OAElDq4F,EAAUP,EAAU9L,EAAKx8E,EAAOuoF,GAClC,IAACM,EAAW,OAAOhD,GAEjBxuD,MAAAA,EAASmlD,EACXA,EAAIsG,UAAYtG,EAAIsG,SAASD,OAC/B+E,IACA3K,EAAQF,WAAW0L,EAAQjM,EAAIsG,SAASD,QAC/BrG,EAAIsG,UAAYtG,EAAIsG,SAASL,QACtCmF,IACAO,EAAe3L,EAAIsG,SAAU9iF,IACpBq3B,EAAOtuB,KAChBu+E,GAAcmB,GAERpxD,EAAO6rD,WAAa7rD,EAAO4rD,aAC/BqE,GAAcmB,GAEhBb,IACIvwD,EAAO4rD,aACTqE,EAAamB,IAGd,GACGjM,EAAI5rB,OACNqsB,EAAQZ,YAELG,EAAIzzE,MAASyzE,EAAIqL,cACpBtJ,GAAa/B,EAAI+B,WAEnB/B,EAAMA,EAAIntE,aACHmtE,IAAQqM,EAAQx5E,QAIlBgoB,OAHHwxD,EAAQ5H,QACVoH,EAAaQ,EAAQ5H,OAAQjhF,GAExBq3B,EAAO6rD,UAAY,EAAIuF,EAAOxsG,MACtC,CAaG6sG,IAAAA,EAAY,CAAA,EAQhB,SAASC,EAAcC,EAAiBhpF,GAChCyoF,MAAAA,EAASzoF,GAASA,EAAM,GAK1ByoF,GAFJnB,GAAc0B,EAEA,MAAVP,EAEF,OADAb,IACO,EAOLkB,GAAmB,UAAnBA,EAAUlkG,MAAmC,QAAfob,EAAMpb,MAAkBkkG,EAAUt4F,QAAUwP,EAAMxP,OAAoB,KAAXi4F,EAAe,CAGtG,GADJnB,GAAcH,EAAgBjpF,MAAM8B,EAAMxP,MAAOwP,EAAMxP,MAAQ,IAC1D01F,EAAW,CAERtc,MAAAA,EAAM,IAAItqF,MAAO,wBAAuBunG,MAG9C,MAFAjd,EAAIid,aAAeA,EACnBjd,EAAIqf,QAAUH,EAAUpD,KAClB9b,CACP,CACD,OAAO,CACR,CAGD,GAFAkf,EAAY9oF,EAEO,UAAfA,EAAMpb,KACDskG,OA1HFA,SAAalpF,GACpB,MAAMyoF,EAASzoF,EAAM,GACfmpF,EAAUnpF,EAAM0lF,KAEhBzF,EAAO,IAAI7E,GAAS+N,GAEpBC,EAAkB,CAACD,EAAQzI,cAAeyI,EAAQ,aACxD,IAAK,MAAME,KAAMD,EACX,GAACC,IACLA,EAAGrpF,EAAOigF,GACNA,EAAK5E,gBAAgB,OAAOqN,EAASD,GAepCU,OAZHA,EAAQpgF,KACVu+E,GAAcmB,GAEVU,EAAQrK,eACVwI,GAAcmB,GAEhBb,IACKuB,EAAQpG,aAAgBoG,EAAQrK,eACnCwI,EAAamB,IAGjBJ,EAAac,EAASnpF,GACfmpF,EAAQpG,YAAc,EAAI0F,EAAOxsG,MACzC,CAgGUitG,CAAalpF,GACf,GAAmB,YAAfA,EAAMpb,OAAuBoiG,EAAgB,CAGtD,MAAMpd,EAAM,IAAItqF,MAAM,mBAAqBmpG,EAAS,gBAAkBjM,EAAI5rB,OAAS,aAAe,KAElG,MADAgZ,EAAIpK,KAAOgd,EACL5S,CACP,CAAM,GAAmB,QAAf5pE,EAAMpb,KAAgB,CAC/B,MAAM0kG,EAAYV,EAAW5oF,GACzBspF,GAAAA,IAAczD,GAChB,OAAOyD,CAxCkC,CA+CzCtpF,GAAe,YAAfA,EAAMpb,MAAiC,KAAX6jG,EAE9B,OAAO,EAOLc,GAAAA,EAAa,KAAUA,EAA2B,EAAdvpF,EAAMxP,MAAW,CAEvD,MADY,IAAIlR,MAAM,4DAEvB,CAWMmpG,OADPnB,GAAcmB,EACPA,EAAOxsG,MACf,CAED,MAAMyuE,EAAW8+B,EAAY3C,GACzB,IAACn8B,EAEH,MADArmE,GAAM8hG,EAAmB/nF,QAAQ,KAAMyoF,IACjC,IAAIvnG,MAAM,sBAAwBunG,EAAe,KAGzD,MAAM4C,EAAKrG,GAAgB14B,GACvBvuD,IAAAA,EAAS,GAETqgF,EAAM75C,GAAgB8mD,EAE1B,MAAM3B,EAAgB,CAAA,EAChB7K,EAAU,IAAIh4F,EAAQ0hG,UAAU1hG,IAxGtC,WACQs6C,MAAAA,EAAO,GACb,IAAK,IAAI5gD,EAAU69F,EAAK79F,IAAY+rE,EAAU/rE,EAAUA,EAAQ0wB,OAC1D1wB,EAAQiyE,OACVrxB,EAAKzxC,QAAQnP,EAAQiyE,OAGzBrxB,EAAK1+C,SAAQ4hD,GAAQw6C,EAAQhB,SAASx5C,IACvC,CAiGDinD,GACIpC,IAAAA,EAAa,GACb/I,EAAY,EACZ/tF,EAAQ,EACR+4F,EAAa,EACbZ,GAA2B,EAE3B,IAGO,IAFTnM,EAAI0H,QAAQE,gBAEH,CACPmF,IACIZ,EAGFA,GAA2B,EAE3BnM,EAAI0H,QAAQE,cAEd5H,EAAI0H,QAAQrkF,UAAYrP,EAElBwP,MAAAA,EAAQw8E,EAAI0H,QAAQ5iF,KAAK6lF,GAG3B,IAACnnF,EAAO,MAENghF,MACA2I,EAAiBZ,EADH5B,EAAgB7zD,UAAU9iC,EAAOwP,EAAMxP,OACTwP,GAClDxP,EAAQwP,EAAMxP,MAAQm5F,CACvB,CAMM,OALPZ,EAAc5B,EAAgBQ,OAAOn3F,IACrCysF,EAAQR,gBACRQ,EAAQG,WACRjhF,EAAS8gF,EAAQC,SAEV,CACLxyB,SAAUm8B,EACVtoG,MAAO4d,EACPoiF,UAAWA,EACXE,SAAS,EACTwJ,SAAUhL,EACV8K,KAAMvL,EAlCV,CAoCE,MAAO5S,GACP,GAAIA,EAAIzjF,SAAWyjF,EAAIzjF,QAAQiM,SAAS,WAC/B,MAAA,CACLs4D,SAAUm8B,EACVtoG,MAAO0tB,GAAOk7E,GACd1I,SAAS,EACTF,UAAW,EACXqL,WAAY,CACVzjG,QAASyjF,EAAIzjF,QACbqK,MAAOA,EACP+P,QAAS4mF,EAAgBjpF,MAAM1N,EAAQ,IAAKA,EAAQ,KACpDgvE,KAAMoK,EAAIpK,KACVqqB,YAAa1tF,GAEf8rF,SAAUhL,GAEP,GAAIiJ,EACF,MAAA,CACLx7B,SAAUm8B,EACVtoG,MAAO0tB,GAAOk7E,GACd1I,SAAS,EACTF,UAAW,EACXuL,YAAalgB,EACbqe,SAAUhL,EACV8K,KAAMvL,GAGR,MAAM5S,CAET,CACF,CAmCD,SAASoe,EAAcrvD,EAAMoxD,GAC3BA,EAAiBA,GAAkB9kG,EAAQ+gG,WAAatpG,OAAOP,KAAK6pG,GACpE,MAAMgE,EA5BCC,SAAwBtxD,GAC/B,MAAMx8B,EAAS,CACb5d,MAAO0tB,GAAO0sB,GACd8lD,SAAS,EACTF,UAAW,EACXwJ,KAAM3B,EACN6B,SAAU,IAAIhjG,EAAQ0hG,UAAU1hG,IAGlC,OADAkX,EAAO8rF,SAASjM,QAAQrjD,GACjBx8B,CACR,CAkBmB8tF,CAAwBtxD,GAEpC67B,EAAUu1B,EAAeh/F,OAAOy+F,GAAaz+F,OAAOm/F,GAAepjG,KAAIjC,GAC3EqiG,EAAWriG,EAAM8zC,GAAM,KAEzB67B,EAAQ1mE,QAAQk8F,GAEVG,MAAAA,EAAS31B,EAAQ7mE,MAAK,CAAC7R,EAAGC,KAE9B,GAAID,EAAEyiG,YAAcxiG,EAAEwiG,UAAW,OAAOxiG,EAAEwiG,UAAYziG,EAAEyiG,UAIxD,GAAIziG,EAAE4uE,UAAY3uE,EAAE2uE,SAAU,CAC5B,GAAI8+B,EAAY1tG,EAAE4uE,UAAU0/B,aAAeruG,EAAE2uE,SAC3C,OAAO,EACF,GAAI8+B,EAAYztG,EAAE2uE,UAAU0/B,aAAetuG,EAAE4uE,SAClD,OAAQ,CAVwB,CAkBpC,OAAO,CAAP,KAGK2/B,EAAMC,GAAcH,EAGrBhuF,EAASkuF,EAGf,OAFAluF,EAAOmuF,WAAaA,EAEbnuF,CACR,CAqBQouF,SAAAA,EAAiB9jD,GAEpB1jD,IAAAA,EAAO,KACX,MAAM2nE,EApnBC8/B,SAAcC,GACrB,IAAI9mG,EAAU8mG,EAAMjnG,UAAY,IAEhCG,GAAW8mG,EAAMC,WAAaD,EAAMC,WAAWlnG,UAAY,GAGrDwc,MAAAA,EAAQ/a,EAAQwhG,iBAAiBnlF,KAAK3d,GAC5C,GAAIqc,EAAO,CACH0qD,MAAAA,EAAW8+B,EAAYxpF,EAAM,IAKnC,OAJK0qD,IACHuiB,GAAKkZ,EAAmB/nF,QAAQ,KAAM4B,EAAM,KAC5CitE,GAAK,oDAAqDwd,IAErD//B,EAAW1qD,EAAM,GAAK,cAC9B,CAED,OAAOrc,EACJuc,MAAM,OACNtU,MAAM++F,GAAW/D,EAAmB+D,IAAWnB,EAAYmB,IAC/D,CAimBkBH,CAAc/jD,GAE/B,GAAImgD,EAAmBl8B,GAAW,OAUlC,GARAu8B,EAAK,0BACH,CAAEpK,GAAIp2C,EAASikB,SAAUA,IAOvBjkB,EAAQ9jD,SAAS1G,OAAS,IACvBgJ,EAAQqhG,sBACXxe,QAAQmF,KAAK,iGACbnF,QAAQmF,KAAK,6DACbnF,QAAQmF,KAAK,oCACbnF,QAAQmF,KAAKxmC,IAEXxhD,EAAQshG,oBAAoB,CAK9B,MAJY,IAAIZ,GACd,mDACAl/C,EAAQG,UAGX,CAGH7jD,EAAO0jD,EACP,MAAM31C,EAAO/N,EAAK+jD,YACZ3qC,EAASuuD,EAAWo7B,EAAUh1F,EAAM,CAAE45D,WAAUs8B,gBAAgB,IAAUgB,EAAcl3F,GAE9F21C,EAAQG,UAAYzqC,EAAO5d,MA/C7B,SAAyBkoD,EAASmkD,EAAaC,GACvCngC,MAAAA,EAAYkgC,GAAe3E,EAAQ2E,IAAiBC,EAE1DpkD,EAAQqkD,UAAU9pG,IAAI,QACtBylD,EAAQqkD,UAAU9pG,IAAK,YAAW0pE,IACnC,CA2CCqgC,CAAgBtkD,EAASikB,EAAUvuD,EAAOuuD,UAC1CjkB,EAAQtqC,OAAS,CACfuuD,SAAUvuD,EAAOuuD,SAEjBqf,GAAI5tE,EAAOoiF,UACXA,UAAWpiF,EAAOoiF,WAEhBpiF,EAAOmuF,aACT7jD,EAAQ6jD,WAAa,CACnB5/B,SAAUvuD,EAAOmuF,WAAW5/B,SAC5B6zB,UAAWpiF,EAAOmuF,WAAW/L,YAIjC0I,EAAK,yBAA0B,CAAEpK,GAAIp2C,EAAStqC,SAAQrL,QACvD,CAuBGk6F,IAAAA,GAAiB,EAKrB,SAASC,IAEP,GAA4B,YAAxB7oD,SAAS8oD,WAEX,YADAF,GAAiB,GAIJ5oD,SAAS+oD,iBAAiBlmG,EAAQyhG,aAC1C7lG,QAAQ0pG,EAChB,CAmEQf,SAAAA,EAAY3kG,GAEZmhG,OADPnhG,GAAQA,GAAQ,IAAIwiC,cACb2+D,EAAUnhG,IAASmhG,EAAUC,EAAQphG,GAC7C,CAOQumG,SAAAA,EAAgBC,GAAWxE,aAAEA,IACX,iBAAdwE,IACTA,EAAY,CAACA,IAEfA,EAAUxqG,SAAQyqG,IAAWrF,EAAQqF,EAAMjkE,eAAiBw/D,CAA/B,GAC9B,CAMQqD,SAAAA,EAAcrlG,GACrB,MAAMg2D,EAAO2uC,EAAY3kG,GACzB,OAAOg2D,IAASA,EAAKwrC,iBACtB,CAsCD,SAASY,EAAK3+C,EAAO9sC,GACb6tF,MAAAA,EAAK/gD,EACXvK,EAAQl9C,SAAQ,SAASi9C,GACnBA,EAAOurD,IACTvrD,EAAOurD,GAAI7tF,EAEd,GACF,CAhIqB,oBAAXpX,QAA0BA,OAAOmnG,kBAC1CnnG,OAAOmnG,iBAAiB,oBAP1B,WAEMP,GAAgBC,GA1vBI,IA+vB0B,GA6IpDvuG,OAAOqpC,OAAOggE,EAAM,CAClBD,YACAkC,gBACAiD,eACAV,mBAEAiB,eAdOC,SAAwB5O,GAIxB0N,OAHPhe,GAAW,SAAU,oDACrBA,GAAW,SAAU,oCAEdge,EAAiB1N,EACzB,EAUC7nC,UA3LOA,SAAU02C,GACjBzmG,EAAU2gG,GAAQ3gG,EAASymG,EAztBH,EAo5BxBC,iBAvLuB,KACvBV,IACA1e,GAAW,SAAU,0DAArB,EAsLAqf,uBAlLF,WACEX,IACA1e,GAAW,SAAU,gEACtB,EAgLCsf,iBA9IF,SAA0BhF,EAAciF,GAClCjxC,IAAAA,EAAO,KACP,IACFA,EAAOixC,EAAmB/F,EAD5B,CAEE,MAAOgG,GAGH,GAFJ1nG,GAAM,wDAAwD+Z,QAAQ,KAAMyoF,KAEvEX,EAAa,MAAM6F,EAAkB1nG,GAAM0nG,GAKhDlxC,EAAOurC,CAZiD,CAerDvrC,EAAKh2D,OAAMg2D,EAAKh2D,KAAOgiG,GAC5Bb,EAAUa,GAAgBhsC,EAC1BA,EAAKmxC,cAAgBF,EAAmBjpE,KAAK,KAAMkjE,GAE/ClrC,EAAKorC,SACPmF,EAAgBvwC,EAAKorC,QAAS,CAAEY,gBAEnC,EAyHCoF,mBAlHOA,SAAmBpF,UACnBb,EAAUa,GACZ,IAAA,MAAMyE,KAAS5uG,OAAOP,KAAK8pG,GAC1BA,EAAQqF,KAAWzE,UACdZ,EAAQqF,EAGpB,EA4GCY,cAvGF,WACE,OAAOxvG,OAAOP,KAAK6pG,EACpB,EAsGCwD,cACA4B,kBACAlB,gBACAtE,WACAjoD,UAhDOA,SAAUG,IArBVquD,SAAiBruD,GAEpBA,EAAO,2BAA6BA,EAAO,6BAC7CA,EAAO,2BAA8B92B,IACnC82B,EAAO,yBACLphD,OAAOqpC,OAAO,CAAE0kE,MAAOzjF,EAAK61E,IAAM71E,GADpC,GAKA82B,EAAO,0BAA4BA,EAAO,4BAC5CA,EAAO,0BAA6B92B,IAClC82B,EAAO,wBACLphD,OAAOqpC,OAAO,CAAE0kE,MAAOzjF,EAAK61E,IAAM71E,GADpC,EAKL,CAMCmlF,CAAiBruD,GACjBC,EAAQj6C,KAAKg6C,EACd,IAgDDioD,EAAKqG,UAAY,WAAalG,GAAY,CAAQ,EAClDH,EAAKsG,SAAW,WAAanG,GAAY,CAAO,EAChDH,EAAKuG,cAh9BO,SAk9BZvG,EAAK9kD,MAAQ,CACXp2C,OAAQA,GACRwyF,UAAWA,GACXG,OAAQA,GACRD,SAAUA,GACVD,iBAAkBA,IAGpB,IAAK,MAAMvgG,KAAO2iG,GAEU,iBAAfA,GAAM3iG,IAEfo+F,GAAauE,GAAM3iG,IAOvB,OAFAL,OAAOqpC,OAAOggE,EAAMrG,IAEbqG,CACR,CAGewG,CAAK,CAAA,GAErBC,GAAiB1G,GACjBA,GAAU2G,YAAc3G,GACxBA,GAAU3hG,QAAU2hG,iCCl/ElB,WAGI/oD,IAAAA,EA4BKggC,SAAAA,EAAO2vB,GAsBd,IArBIC,IAKAtnB,EAEAzhF,EACAgpG,EAEArvE,EAVAovE,EAAW,EACXnxF,EAAO,GAAG0C,MAAMphB,KAAKiB,WACrB7B,EAAI,EACJ8hB,EAAI0uF,EAAIzwG,OACRkgB,EAAS,GAET0wF,GAAU,EAGVC,GAAc,EAEdC,EAAU,WAAa,OAAOvxF,EAAKmxF,IAXvC,EAYIK,EAAc,WAEL,IADHC,IAAAA,EAAS,GACN,KAAK9tF,KAAKutF,EAAIxwG,KACnB+wG,GAAUP,EAAIxwG,KACdmpF,EAAIqnB,EAAIxwG,GAEH+wG,OAAAA,EAAOhxG,OAAS,EAAIgO,SAASgjG,GAAU,IAC/C,EAEE/wG,EAAI8hB,IAAK9hB,EAEd,GADAmpF,EAAIqnB,EAAIxwG,GACJ2wG,EAeF,OAdAA,GAAU,EACD,KAALxnB,GACFynB,GAAc,EACdznB,EAAIqnB,IAAMxwG,IAEE,KAALmpF,GAA0B,KAAdqnB,EAAIxwG,EAAI,IAC3B4wG,GAAc,EAEdznB,EAAIqnB,EADJxwG,GAAK,IAIL4wG,GAAc,EAEhBvvE,EAAYyvE,IACJ3nB,GACR,IAAK,IACHlpE,GAAUlS,SAAS8iG,IAAW,IAAInwG,SAAS,GAC3C,MACF,IAAK,IAGDuf,GADiB,iBADnBvY,EAAMmpG,MACyBnpG,aAAeid,OAClCjd,EAEAid,OAAOsgC,aAAal3C,SAASrG,EAAK,KAC9C,MACF,IAAK,IACHuY,GAAUlS,SAAS8iG,IAAW,IAC9B,MACF,IAAK,IACHH,EAAM/rF,OAAO7W,WAAW+iG,KAAWG,QAAQ3vE,GAAa,IACxDphB,GAAU2wF,EAAcF,EAAMA,EAAIxuF,QAAQ,KAAM,IAChD,MACF,IAAK,IACHjC,GAAUo9B,KAAKC,UAAUuzD,KACzB,MACF,IAAK,IACH5wF,GAAU,IAAMlS,SAAS8iG,IAAW,IAAInwG,SAAS,GACjD,MACF,IAAK,IACHuf,GAAU4wF,IACV,MACF,IAAK,IACH5wF,GAAU,KAAOlS,SAAS8iG,IAAW,IAAInwG,SAAS,IAClD,MACF,IAAK,IACHuf,GAAU,KAAOlS,SAAS8iG,IAAW,IAAInwG,SAAS,IAAIkrC,cACtD,MACF,QACE3rB,GAAUkpE,MAGG,MAANA,EACTwnB,GAAU,EAEV1wF,GAAUkpE,EAGd,OAAOlpE,CACR,EA3GC4gC,EAAYnhD,EAAiBmhF,QAAAA,GASrBA,OAASA,EACnBhgC,EAAUowD,SAUV,SAAkBT,EAAKU,GACrB,OAAOrwB,EAAO/4E,MAAM,KAAM,CAAC0oG,GAAK7hG,OAAOuiG,GACxC,EAVsB,oBAAZtlB,SAAkD,mBAAhBA,QAAQoa,MACnDnlD,EAAUswD,OAGZ,WACEvlB,QAAQoa,IAAInlB,EAAO/4E,MAAM,KAAMjG,WAChC,EAzBD,CAAA,MCRK,MAAMuvG,GAAQ5wG,OAAOqpC,OAAO5jB,GAAO7iB,OAAQ,CAChDiuG,KAAMprF,GAAOqrF,WACbhkG,MAAO2Y,GAAOsrF,YACdhuE,UAAWtd,GAAOurF,gBAClBC,OAAQxrF,GAAOyrF,aACfhpG,KAAMud,GAAOrB,WACb0sE,IAAKrrE,GAAO0rF,YAUP,SAAS1rF,GAAO2rF,GAKrB,OAFAC,EAAeC,YAAcF,EAAYE,aAAeF,EAAYjpG,KAE7DkpG,EAWP,SAASA,EAAehxB,KAAWrgE,GAEjC,MAAMy6B,EAAS4lC,EAASzyE,GAAUyyE,KAAWrgE,GAAUqgE,EACvD,OAAO,IAAI+wB,EAAY32D,EACxB,CACF,CCfD,MAAMiG,GAAM,CAAA,EAAGvgD,eAEToxG,GAAgB,QActB,SAASnI,GAAUp7B,EAAUnsE,EAAO0G,EAAU,CAAA,GAC5C,IAAIyuC,EAASzuC,EAAQyuC,OAErB,GAAwB,iBAAbg3B,EACT,MAAM4iC,GAAM,uCAAwC5iC,GAGtD,IAAK/0C,GAAK6zE,YAAY9+B,GACpB,MAAM4iC,GAAM,2CAA4C5iC,GAG1D,GAAqB,iBAAVnsE,EACT,MAAM+uG,GAAM,wCAAyC/uG,GAGnDm1C,UACFA,EAASu6D,IAGXt4E,GAAKq/B,UAAU,CAAC2xC,UAAWuH,GAAapS,YAAapoD,IAErD,MAAMv3B,EACJwZ,GAAKmwE,UAAUvnG,EAAO,CAACmsE,WAAUs8B,gBAAgB,IAQ/C7qF,GALJwZ,GAAKq/B,UAAU,CAAA,GAKX74C,EAAO2tF,YACH3tF,MAAAA,EAAO2tF,YAOf,OAHA3tF,EAAO8rF,SAASluF,KAAKiN,KAAK0jD,SAAWvuD,EAAOuuD,SAC5CvuD,EAAO8rF,SAASluF,KAAKiN,KAAKu3E,UAAYpiF,EAAOoiF,UAEtCpiF,EAAO8rF,SAASluF,IACxB,CAuHD,MAAMm0F,GAIJlyG,WAAAA,CAAYiJ,GAELA,KAAAA,QAAUA,EAEf7E,KAAK2Z,KAAO,CACVnV,KAAM,OACNoiB,KAAM,CAAC0jD,SAAU,KAAM6zB,UAAW,GAClC57F,SAAU,IAGZvC,KAAKkpB,MAAQ,CAAClpB,KAAK2Z,KACpB,CAKDiiF,OAAAA,CAAQz9F,GACFA,GAAU,KAAVA,EAAc,OAEZI,MAAAA,EAAUyB,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GACzC2wC,EAAOjuC,EAAQgE,SAAShE,EAAQgE,SAAS1G,OAAS,GAEpD2wC,GAAsB,SAAdA,EAAKhoC,KACfgoC,EAAKruC,OAASA,EAEdI,EAAQgE,SAASmB,KAAK,CAACc,KAAM,OAAQrG,SAExC,CAMDw+F,UAAAA,CAAWx+F,EAAOsG,GACXo3F,KAAAA,SAASp3F,GACTm3F,KAAAA,QAAQz9F,GACb6B,KAAKi8F,WACN,CAMDW,cAAAA,CAAevuE,EAAO5pB,GACdlG,MAAAA,EAAUyB,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GACzCu4E,EAAU/lD,EAAM1U,KAAKpX,SAEvBkC,EACFlG,EAAQgE,SAASmB,KAAK,CACpBc,KAAM,UACNsnD,QAAS,OACT/hB,WAAY,CAAC3mC,UAAW,CAACqB,IACzBlC,SAAU6xE,IAGZ71E,EAAQgE,SAASmB,QAAQ0wE,EAE5B,CAKDynB,QAAAA,CAASp3F,GAIP,MAAMrB,EAAYqB,EACfqb,MAAM,KACNpZ,KAAI,CAAC2zD,EAAGv+D,IAAOA,EAAIu+D,EAAI,IAAIrpB,OAAOl1C,GAAKkE,KAAK6E,QAAQ62F,YAAcrhC,IAG/DsF,EAAQ,CACZn7D,KAAM,UACNsnD,QAAS,OACT/hB,WAAY,CAAC3mC,aACbb,SAAU,IANIvC,KAAKkpB,MAAMlpB,KAAKkpB,MAAMrtB,OAAS,GASvC0G,SAASmB,KAAKi8D,GACtB3/D,KAAKkpB,MAAMxlB,KAAKi8D,EACjB,CAIDs8B,SAAAA,GACO/yE,KAAAA,MAAMgD,KACZ,CAIDmwE,aAAAA,GAAkB,CAIlBW,QAAAA,GAAa,CAIbF,MAAAA,GACE,MAAO,EACR,EAGI,MAAMiR,GAAW,CACtBrI,aACAkC,cAxNF,SAAuBzpG,EAAO0G,EAAU,IAChCmpG,MAAAA,EAASnpG,EAAQmpG,QAAUz4E,GAAKu2E,gBACzBjnG,EAAQyuC,OACjBljC,IAAAA,GAAS,EAET2L,EAAS,CACXvX,KAAM,OACNoiB,KAAM,CAAC0jD,SAAU,KAAM6zB,UAAW,GAClC57F,SAAU,IAOZ,GAAqB,iBAAVpE,EACT,MAAM+uG,GAAM,wCAAyC/uG,GAGvD,OAASiS,EAAQ49F,EAAOnyG,QAAQ,CAC9B,MAAM4I,EAAOupG,EAAO59F,GAEpB,IAAKmlB,GAAK6zE,YAAY3kG,GAAO,SAEvBlG,MAAAA,EAAUmnG,GAAUjhG,EAAMtG,EAAO0G,GAEnCtG,EAAQqoB,KAAKu3E,UAAYpiF,EAAO6K,KAAKu3E,YAAWpiF,EAASxd,EAC9D,CAED,OAAOwd,CACR,EA2LC0vF,iBAhLF,SAA0BnhC,EAAUijC,GAClCh4E,GAAKk2E,iBAAiBnhC,EAAUijC,EACjC,EA+KCU,WA9HF,SAAoBC,GACXpvD,OAAAA,QAAQvpB,GAAK6zE,YAAY8E,GACjC,EA6HCpC,cArHF,WACSv2E,OAAAA,GAAKu2E,eACb,EAoHCqC,cAzJE,SAAU7jC,EAAU4gC,GAClB,GAAwB,iBAAb5gC,EAET/0C,GAAKy1E,gBAAgBE,EAAO,CAACzE,aAAcn8B,QACtC,CAEL,IAAI3tE,EAECA,IAAAA,KAAO2tE,EACNttB,GAAItgD,KAAK4tE,EAAU3tE,IACrB44B,GAAKy1E,gBAAgB1gC,EAAS3tE,GAAM,CAAC8pG,aAAc9pG,GAGxD,CACF,GCpDQyxG,GAkBT,SAAUrvF,GACR,GAAIA,QACF,OAAOsnC,GAGT,GAAoB,iBAATtnC,EACFsvF,OAuDf,SAAwBvtD,GACtB,OAAOgL,EAMEA,SAAAA,EAAQnpD,GACR0jD,OAAAA,GAAQ1jD,IAASA,EAAKmpD,UAAYhL,CAC1C,CACF,CAjEcutD,CAAetvF,GAGxB,GAAoB,iBAATA,EACFo9C,OAef,SAAoBF,GAEZC,MAAAA,EAAS,GACX9rD,IAAAA,GAAS,EAEb,OAASA,EAAQ6rD,EAAMpgE,QACrBqgE,EAAO9rD,GAASg+F,GAAenyC,EAAM7rD,IAGhC4rD,OAAAA,GAAYr1D,GAOnB,SAASA,KAAOu1C,GACV9rC,IAAAA,GAAS,EAEb,OAASA,EAAQ8rD,EAAOrgE,QACtB,GAAIqgE,EAAO9rD,GAAO1T,KAAKsD,QAASk8C,GAC9B,OAAO,EAIX,OAAO,CACR,CACF,CA1CcigB,CAAWp9C,GAGpB,GAAoB,mBAATA,EACFi9C,OAAAA,GAAYj9C,GAGrB,MAAM,IAAI7f,MAAM,8CACjB,EA2DL,SAAS88D,GAAYlb,GACnB,OAQA,SAAmBn+C,KAASu5C,GAE1B,OAAOmK,GAAQ1jD,IAASm8C,QAAQgC,EAAMpkD,KAAKsD,KAAM2C,KAASu5C,GAC3D,CACF,CAOD,SAASmK,GAAQ1jD,GACRm8C,OAAAA,QACLn8C,GACkB,iBAATA,GAEO,YAAdA,EAAK6B,MAEmB,iBAAjB7B,EAAKmpD,QAEjB,CC1OM,IAAIwiD,GAcP,SAAUr/E,EAAQ7e,EAAO2O,GACvB,IAAIlhB,EAAKiyB,GAAQ/Q,GAEjB,IAAKkQ,IAAWA,EAAOzqB,OAASyqB,EAAO1sB,SACrC,MAAM,IAAIrD,MAAM,wBAGlB,GAAqB,iBAAVkR,GACLA,GAAAA,EAAQ,GAAKA,IAAU3G,OAAO6zC,kBAChC,MAAM,IAAIp+C,MAAM,iDAKdkR,IAFJA,EAAQ6e,EAAO1sB,SAAS2xB,QAAQ9jB,IAEpB,EACV,MAAM,IAAIlR,MAAM,gCAIb,OAAEkR,EAAQ6e,EAAO1sB,SAAS1G,QAC/B,GAAIgC,EAAGoxB,EAAO1sB,SAAS6N,GAAQA,EAAO6e,GACpC,OAAOA,EAAO1sB,SAAS6N,GAI3B,OAAO,IACR,ECnBL,MAAMm+F,GAAkB,MAClBC,GAAoB,UAEpBC,GAAKL,GAAe,MACpB1rG,GAAI0rG,GAAe,KACnBpuC,GAAOouC,GAAe,CAAC,KAAM,OAC7B/4D,GAAM+4D,GAAe,MAIrBM,GAAcN,GAAe,CAEjC,WACA,OACA,UACA,WACA,WACA,KACA,SACA,QACA,WACA,QA0dF,SAAgBzrG,GACPm8C,OAAAA,SAASn8C,EAAKonC,YAAc,CAApB,GAAwB0/B,OACxC,EAGD,SAAsB9mE,GACpB,MAAwB,WAAjBA,EAAKmpD,WAA0BnpD,EAAKonC,YAAc,CAApB,GAAwB6a,IAC9D,IAzdK+pD,GAAiBP,GAAe,CACpC,UACA,UACA,QACA,aACA,OACA,UACA,SACA,KACA,SACA,MACA,KACA,KACA,MACA,SACA,aACA,SACA,QACA,KACA,KACA,KACA,KACA,KACA,KACA,SACA,SACA,KACA,OACA,SACA,UACA,OACA,OACA,MACA,KACA,IACA,YACA,MACA,UACA,KACA,QAaK,SAASQ,GAAOjsG,EAAMkC,EAAU,IAGrC,MAAMtC,EAAWI,EAAKJ,UAAY,GAC5B8nG,EAAQsE,GAAehsG,GACvB2mF,EAAaulB,GAAgBlsG,EAAM,CACvC2mF,WAAYzkF,EAAQykF,YAAc,SAClCwlB,aAAa,EACbC,YAAY,IAEV3+F,IAEAgkE,EAEAj2E,EAEAiP,EANAgD,GAAS,EAgBTzN,GAAc,SAAdA,EAAK6B,MAAiC,YAAd7B,EAAK6B,KACxBwqG,OAAAA,GAAYrsG,EAAM,CAAC2mF,aAAYwlB,aAAa,EAAMC,YAAY,IAiBvE,IAHA36B,EAAU,KAGDhkE,EAAQ7N,EAAS1G,QAMxBu4E,EAAUA,EAAQ3pE,OAEhBwkG,GAAoB1sG,EAAS6N,GAAQzN,EAAM,CACzC2mF,aACAwlB,YAAa1+F,EAAQ,KAAOi6F,EAC5B0E,WACE3+F,EAAQ7N,EAAS1G,OAAS,EAAI4yG,GAAGlsG,EAAS6N,EAAQ,IAAMi6F,KAYhEj6F,GAAS,EAEH2L,MAAAA,EAAS,GAEf,OAAS3L,EAAQgkE,EAAQv4E,QACvBsC,EAAQi2E,EAAQhkE,GAEK,iBAAVjS,OACKP,IAAVwP,GAAuBjP,EAAQiP,IAAOA,EAAQjP,GACzCA,IACLiP,GAAO2O,EAAOrY,KAAK,KAAKstC,OAAO5jC,IACnCA,EAAQ,EACR2O,EAAOrY,KAAKvF,IAKhB,OAAO4d,EAAOlY,KAAK,GACpB,CAUD,SAASorG,GAAoBtsG,EAAMssB,EAAQpqB,GACzC,MAAkB,YAAdlC,EAAK6B,KAsBX,SAAwB7B,EAAMssB,EAAQpqB,GAEpC,MAAMykF,EAAaulB,GAAgBlsG,EAAMkC,GACnCtC,EAAWI,EAAKJ,UAAY,GAC9B6N,IAIAkjC,EAEAurB,EANAzuD,GAAS,EAETgvC,EAAQ,GAQZ,GAAIsvD,GAAY/rG,GACd,OAAOy8C,EAmBLqvD,GAAG9rG,IAYE0yC,GAAI1yC,IAAS2rG,GAAUr/E,EAAQtsB,EAAM0yC,IAX5CwpB,EAAS,KAiBFn8D,GAAEC,IACT2wC,EAAS,EACTurB,EAAS,GAMF8vC,GAAehsG,KACtB2wC,EAAS,EACTurB,EAAS,GAMX,OAASzuD,EAAQ7N,EAAS1G,QACxBujD,EAAQA,EAAM30C,OACZwkG,GAAoB1sG,EAAS6N,GAAQzN,EAAM,CACzC2mF,aACAwlB,YAAa1+F,OAAQxS,EAAY01C,EACjCy7D,WACE3+F,EAAQ7N,EAAS1G,OAAS,EAAI4yG,GAAGlsG,EAAS6N,EAAQ,IAAMyuD,KAW5DmB,GAAKr9D,IAAS2rG,GAAUr/E,EAAQtsB,EAAMq9D,KACxC5gB,EAAM17C,KAAK,MAIT4vC,GAAQ8L,EAAM1xC,QAAQ4lC,GACtBurB,GAAQzf,EAAM17C,KAAKm7D,GAEvB,OAAOzf,CACR,CAnHU8vD,CAAevsG,EAAMssB,EAAQpqB,GAGpB,SAAdlC,EAAK6B,KACA,CACkB,WAAvBK,EAAQykF,WACJ0lB,GAAYrsG,EAAMkC,GAClBsqG,GAAexsG,IAIhB,EACR,CA8HD,SAASqsG,GAAYrsG,EAAMkC,GACzB,MAAM1G,EAAQsiB,OAAO9d,EAAKxE,OAEpBirF,EAAQ,GAERrtE,EAAS,GACXvT,IAGAoX,EAEAlX,EAEA7E,EAPA2E,EAAQ,EACR4H,GAAS,EAQb,KAAO5H,EAAQrK,EAAMtC,QACnB0yG,GAAgB9uF,UAAYjX,EAC5BoX,EAAQ2uF,GAAgBrtF,KAAK/iB,GAE7BuK,EAAMkX,EAAQA,EAAMxP,MAAQjS,EAAMtC,OAElCutF,EAAM1lF,KAGJ0rG,GAIEjxG,EACG2f,MAAMtV,EAAOE,GACbsV,QAAQ,kDAAmD,IAC9DnZ,EAAQiqG,YACRjqG,EAAQkqG,aAIZvmG,EAAQE,EAAM,EAQhB,OAAS0H,EAAQg5E,EAAMvtF,QAKkC,OAArDutF,EAAMh5E,GAAO4vB,WAAWopD,EAAMh5E,GAAOvU,OAAS,IAC7CuU,EAAQg5E,EAAMvtF,OAAS,GACa,OAAnCutF,EAAMh5E,EAAQ,GAAG4vB,WAAW,IAE9BjkB,EAAOrY,KAAK0lF,EAAMh5E,IAClBvM,EAAO,IAmBAulF,EAAMh5E,KACTvM,GAAMkY,EAAOrY,KAAKG,GACtBkY,EAAOrY,KAAK0lF,EAAMh5E,IAClBvM,EAAO,KAIX,OAAOkY,EAAOlY,KAAK,GACpB,CAMD,SAASsrG,GAAexsG,GACtB,OAAO8d,OAAO9d,EAAKxE,MACpB,CAeD,SAASixG,GAA6BjxG,EAAO2wG,EAAaC,GAElDhzF,MAAAA,EAAS,GACXvT,IAEAoX,EAEAlX,EAJAF,EAAQ,EAMZ,KAAOA,EAAQrK,EAAMtC,QACnB2yG,GAAkB/uF,UAAYjX,EAC9BoX,EAAQ4uF,GAAkBttF,KAAK/iB,GAE/BuK,EAAMkX,EAAQA,EAAMxP,MAAQjS,EAAMtC,OAI7B2M,GAAUE,IAAOkX,GAAUkvF,GAC9B/yF,EAAOrY,KAAK,IAGV8E,IAAUE,GACZqT,EAAOrY,KAAKvF,EAAM2f,MAAMtV,EAAOE,IAGjCF,EAAQoX,EAAQlX,EAAMkX,EAAM,GAAG/jB,OAAS6M,EAW1C,OAJIF,IAAUE,GAAQqmG,GACpBhzF,EAAOrY,KAAK,IAGPqY,EAAOlY,KAAK,IACpB,CASD,SAASgrG,GAAgBlsG,EAAMkC,GAE7B,IAAIe,EAEJ,GAAkB,YAAdjD,EAAK6B,KAEC7B,OADRiD,EAAQjD,EAAKonC,YAAc,GACnBpnC,EAAKmpD,SACX,IAAK,UACL,IAAK,YACL,IAAK,MACH,MAAO,MACT,IAAK,OACH,MAAO,SACT,IAAK,MACH,OAAOlmD,EAAM6nC,KAAO,WAAa,MACnC,IAAK,KACL,IAAK,KACI7nC,OAAAA,EAAM8vC,OAAS,SAAW7wC,EAAQykF,WAC3C,IAAK,WACH,MAAO,WAKNzkF,OAAAA,EAAQykF,UAChB,CCzeD,MAAMtsC,GAAM,CAAA,EAAGvgD,eAOA,SAAS4yG,GAAgBxqG,EAAU,IAC1C,MAAAghG,QAACA,EAADD,UAAUA,EAAVtyD,OAAqBA,EAArBg8D,UAA6BA,EAA7BC,cAAwCA,EAAxCvB,OAAuDA,GAAUnpG,EACnEJ,IAAAA,EAAO,OAMX,GAJIohG,GACFkI,GAASI,cAActI,GAGrBD,EAAW,CAEb,IAAIjpG,EAECA,IAAAA,KAAOipG,EACN5oD,GAAItgD,KAAKkpG,EAAWjpG,IACtBoxG,GAAStC,iBAAiB9uG,EAAKipG,EAAUjpG,GAG9C,CAED,GAAI22C,EAAQ,CACV,MAAMuD,EAAMvD,EAAOpf,QAAQ,KAC3BzvB,EAAOoyC,GAAO,EAAIvD,EAAOx1B,MAAM,EAAG+4B,GAAOvD,CAC1C,CAED,OAAQgL,IAENme,GAAMne,EAAM,WAAW,CAAC37C,EAAM4I,EAAGikG,KAC/B,MAAMvgF,EAA+BugF,EAGnC,IAACvgF,KACC,YAAaA,IACI,QAAnBA,EAAO68B,SACU,SAAjBnpD,EAAKmpD,UACJnpD,EAAKonC,WAEN,OAGF,MAAM0wB,EAoDZ,SAAkB93D,GACVS,MAAAA,EAAYT,EAAKonC,YAAcpnC,EAAKonC,WAAW3mC,UACjDgN,IAAAA,GAAS,EAEb,IAAKpU,MAAMC,QAAQmH,GACjB,OAGF,OAASgN,EAAQhN,EAAUvH,QAAQ,CAC3BsC,MAAAA,EAAQsiB,OAAOrd,EAAUgN,IAE/B,GAAc,iBAAVjS,GAAsC,gBAAVA,EAC9B,OAAO,EAGLA,GAAsB,UAAtBA,EAAM2f,MAAM,EAAG,GACjB,OAAO3f,EAAM2f,MAAM,GAGjB3f,GAAsB,cAAtBA,EAAM2f,MAAM,EAAG,GACjB,OAAO3f,EAAM2f,MAAM,EAEtB,CACF,CA3EkBwsD,CAAS3nE,GAGpB83D,IAAS,IAATA,IACEA,IAAmB,IAAXuzC,GACTvzC,GAAQ60C,GAAaA,EAAUt9F,SAASyoD,GAEzC,OAYF,IAAI1+C,EATC/f,MAAMC,QAAQ0G,EAAKonC,WAAW3mC,aACjCT,EAAKonC,WAAW3mC,UAAY,IAGzBT,EAAKonC,WAAW3mC,UAAU4O,SAASvN,IACtC9B,EAAKonC,WAAW3mC,UAAUsK,QAAQjJ,GAMhC,IACFsX,EAAS0+C,EACLszC,GAASrI,UAAUjrC,EAAMm0C,GAAO3/E,GAAS,CAACqkB,WAE1Cy6D,GAASnG,cAAcgH,GAAO3/E,GAAS,CAACqkB,SAAQ06D,UAJtD,CAKE,MAAO/pG,GAEH,IAACsrG,IAAkB,mBAAmBxwF,KADF9a,EACiB8B,SACvD,MAAM9B,EAGR,MACD,EAEIw2D,GAAQ1+C,EAAO6K,KAAK0jD,UACvB3nE,EAAKonC,WAAW3mC,UAAUM,KAAK,YAAcqY,EAAO6K,KAAK0jD,UAGvDtuE,MAAMC,QAAQ8f,EAAOxZ,WAAawZ,EAAOxZ,SAAS1G,OAAS,IAC7D8G,EAAKJ,SAAWwZ,EAAOxZ,SACxB,GAtDH,CAyDH,CCtHKktG,IAAAA,GAAuB,SAAA3uG,GAAGwgD,IAAAA,IAAAA,QAAH,OAC3B//C,gBAACorF,GAAD,CACEG,cAAe,CAACgN,IAChB7M,cAAe,CAACoiB,KAEf/tD,EALwB,EAS7BmuD,GAAqBvtG,UAAY,CAC/Bo/C,QAASn/C,EAAUC,QCXfstG,IAAAA,GAAqB,SAAA5uG,GAAG3C,IAAAA,IAAAA,MAAH,OAAeoD,gBAACgJ,GAAD,CAAkBpM,MAAOoL,GAAapL,IAArD,EAE3BuxG,GAAmBxtG,UAAY,CAC7B/D,MAAOgE,EAAU2E,UAAU,CACzB3E,EAAU6E,OACV7E,EAAUC,UCNRutG,IAAAA,GAAqB,SAAA7uG,GAAA,IAAA8uG,EAAGzxG,IAAAA,MAAO0G,IAAAA,QAAV,OACzBtD,gBAACgJ,GAAD,CAAkBpM,cAAO0G,EAAAA,EAAQ2G,MAAK,SAAAC,GAAC,OAAIA,EAAEtN,QAAUA,CAAhB,wBAAdyxG,EAAsC7uG,OADtC,EAI3B4uG,GAAmBztG,UAAY,CAC7B/D,MAAOgE,EAAUC,OACjByC,QAAS1C,EAAU+E,QAAQ/E,EAAUgF,MAAM,CACzCpG,MAAOoB,EAAUC,OAAOwE,WACxBzI,MAAOgE,EAAUwE,OACfC,YCPN,IACMqH,GAAY,SAAC9P,EAAOyG,GAAkBoB,OADX,KAAfkI,EACoC/P,KADJ,IAAR+P,EACqB/P,EAASyG,IAAgB,EADtE,IAAAsJ,CACA,EAEZ2hG,GAAsB,SAAmE/uG,GAAhEkB,IAAAA,IAAAA,QAASyC,IAAAA,KAAMtG,IAAAA,MAAOyG,IAAAA,aAAc7D,IAAAA,MAAOyF,IAAAA,eACpExE,MAAY,aAAZA,EAEAT,gBAAC+E,EAAD,CACEvF,MAAOA,EACPyF,eAAgBA,GAAkB,MAClCvB,UAHF,EAIEX,QACE/C,EAAAM,cAAC6M,EAAD,CACEjK,KAAMA,EACNgK,QAASR,GAAU9P,EAAOyG,OAQlCrD,gBAAC+E,EAAD,CACEvF,MAAOA,EACPyF,eAAgBA,GAAkB,MAClCvB,UAHF,EAIEX,QACE/C,EAAAM,cAACqN,EAAD,CACEzK,KAAMA,EACNgK,QAASR,GAAU9P,EAAOyG,MAKnC,EAEDirG,GAAoB3tG,UAAY,CAC9BF,QAASG,EAAUC,OACnBqC,KAAMtC,EAAUC,OAAOwE,WACvBzI,MAAOgE,EAAU4E,KACjBnC,aAAczC,EAAU4E,KACxBhG,MAAOoB,EAAUC,OACjBoE,eAAgBrE,EAAUC,QCrC5B,IAAMQ,GAAYC,GAAW,WAAO,MAAA,CAClCitG,aAAc,CACZxY,QAAS,EACTlxF,OAAQ,GAHiB,IAOvBq4B,GAAW,SAACtgC,EAAO+S,GACvB,OAAIA,QAA8BtT,IAAnBsT,EAAQ/S,GAA6B+S,EAAQ/S,GACrDA,CACR,EAEK4xG,GAAuB,SAAwBjvG,GAArB3C,IAAAA,IAAAA,MAAO0G,IAAAA,QAC/B1B,EAASP,KAEf,OACErB,gBAACyuG,EAAD,CACE5sG,UAAWD,EAAO2sG,aAClBG,OAAK,GAGH9xG,GAASA,EAAMuI,KAAI,SAACgF,EAAO0E,GAAR,OAEjB7O,EAAAM,cAACquG,EAAD,CAAUvzG,oBAAcyT,IACtB7O,gBAAC4uG,EAAD,CACEC,QAAS3xE,GAAS/yB,EAAO7G,GACzBpD,MAAO,CAAE2E,OAAQ,KALd,IAYhB,EAED2pG,GAAqB7tG,UAAY,CAC/B/D,MAAOgE,EAAU8E,MACjBpC,QAAS1C,EAAU0E,QCzCfwpG,IAAAA,GAAa,SAAAvvG,GAAGwvG,IAAAA,IAAAA,QAASvvG,IAAAA,MAAZ,OACjBQ,gBAACC,EAAD,CAAKM,GAAI,GACPP,gBAACgvG,EAAD,CAAOC,SAAS,WACdjvG,gBAACQ,EAAD,CAAYC,QAAQ,SACjBsuG,EAAO,GAAA7lG,OAAM6lG,EAAN,KAAmB,GAC3B/uG,EAAAM,cAAA,OAAA,CAAMJ,MAAO,CAAEsP,WAAY,SAAWhQ,GAH1C,uBAFe,EAYnBsvG,GAAWnuG,UAAY,CACrBouG,QAASnuG,EAAUC,OACnBrB,MAAOoB,EAAUC,OAAOwE,YCb1B,IAAM6pG,GAA6B,WAC3BC,IAAAA,EAAmB9wG,KACzB9B,EAAwCC,IAAxCE,EAAAC,EAAAJ,EAAA,GAAO6yG,EAAP1yG,EAAA,GAAqB2yG,EAArB3yG,EAAA,GAiBA,OAfAO,GAAU,WACR,GAAKkyG,EAWL,OAToBA,EAAiBhyG,WAAU,WACbgyG,IAAxBG,EAAwBH,EAAiB1yG,WAAzC6yG,oBACJA,IACFD,EAAgBC,GAEhBH,EAAiBI,SAAS,CAAED,yBAAqBjzG,IAEpD,GAGF,GAAE,CAAC8yG,MAECA,GAGHnvG,gBAACwvG,EAAD,CACEnsD,OAAQ+rD,EACRK,iBAAkB,IAClBC,aAAc,CAAEC,SAAU,SAAUC,WAAY,SAChDprG,QAAS4qG,EAAY,qBAAAlmG,OAAwBkmG,EAAa5vG,2BAA2B,GACrFqK,QAAS,WAAMwlG,OAAAA,OAAgBhzG,EAAtB,GAGd,ECRYwzG,GAAe,CAE1BrtG,QAASkF,GACT7G,OAAQ6G,GACRyH,KAAMzH,GACNjC,OAAQ8C,GACR6D,OAAQI,GACRk0D,QAAS9zD,GACTlH,MAAO0uC,GAGP07D,gBAAiB9mG,GACjB+mG,eAAgB/mG,GAChBgnG,aAAchnG,GACdinG,iBAAkB/B,GAClBgC,eAAgB/B,GAChBgC,eAAgB/B,GAChBgC,gBAAiB9B,GACjB+B,cAAe7B,GAGf8B,UAAWC,EACXC,SAAUD,EACVE,SAAUloG,GACVmoG,SAAUlkG,GACVmkG,UAAW/jG,GAGXkjD,MAAOhqD,GACP2uC,cAAeI,GACf+7D,YAAa7vG,GACb8vG,aAAclvG,GACdmvG,WAAYhC,GACZiC,+BAAgC7B,IC3D5B8B,GAAuB1zG,GAAc,GCJrC2zG,GAAmB,WAAA,IAAA1xG,EAAA2xG,EAAAC,EAAA9vC,MAAG,WAAOnrB,GAAP,IAAAnwC,EAAAw6C,EAAA6wD,EAAAC,EAAAxqE,EAAAyqE,EAAA3S,EAAAxvF,EAAA7L,EAAAkX,EAAA+2F,EAAAn1G,UAAA,OAAA+0G,EAAAjlE,MAAA,SAAAslE,GAAA,OAAA,OAAAA,EAAAC,KAAAD,EAAA1tE,MAAA,KAAA,EAAA,OAAcyc,GAAdx6C,EAAAwrG,EAAAj3G,OAAA,QAAA+B,IAAAk1G,EAAA,GAAAA,EAAA,GAAsD,CAAtD,GAAchxD,MAAO6wD,EAAAA,EAAAA,OAAQvqE,EAAAA,EAAAA,OAAAA,OAA7B,IAAAwqE,EAAsC,MAAOC,EAAAA,IAAAA,KAA7CE,EAAAC,KAAA,EAKlBnuG,EAAU,CAAEujC,OAAAA,GAEd0Z,IACFj9C,EAAQ2kE,QAAU,CAChB,eAAgB,mBAChBypC,+BAAyBnxD,KAIzB6wD,IACF9tG,EAAQ8tG,OAASA,QAGN/0G,IAATi1G,IACFhuG,EAAQguG,KAAO15D,KAAKC,UAAUy5D,IAnBRE,EAAA1tE,KAAA,EAsBPr4B,MAAMyqC,EAAK5yC,GAtBJ,KAAA,EAwBXq7F,OAFbA,EAtBwB6S,EAAAG,KAAAH,EAAA1tE,KAAA,GAwBX66D,EAASxvF,OAxBE,KAAA,GAwBxBA,EAxBwBqiG,EAAAG,KAAAH,EAAA1tE,KAAA,GAAA,MAAA,KAAA,GAAA,MAAA0tE,EAAAC,KAAA,GAAAD,EAAAI,GAAAJ,EAAA,MAAA,GA0BlB,IAAI7zG,MAAMwR,GA1BQ,KAAA,GA+BrBwvF,GAFCnkF,EAASo9B,KAAK0E,MAAMntC,GAErBwvF,EAASh/C,GA/BY,CAAA6xD,EAAA1tE,KAAA,GAAA,KAAA,CAAA,MA+BF,IAAInmC,MAAM6c,EAAO9X,OA/Bf,KAAA,GAAA,OAAA8uG,EAAAK,OAAA,SAiCnBr3F,GAjCmB,KAAA,GAAA,IAAA,MAAA,OAAAg3F,EAAAM,OAAA,GAAAC,EAAA,KAAA,CAAA,CAAA,EAAA,KAAH,KAAA,OAAA,SAAAC,GAAA,OAAAzyG,EAAA8C,MAAA5D,KAAArC,UAAA,CAAA,CAAA,+4BCuBzB,IAAM61G,GAAiB,SAAsE1yG,GAAnE2yG,IAAAA,IAAAA,cAAeh8D,IAAAA,IAAKqK,IAAAA,MAAO/gD,IAAAA,MAAO2yG,IAAAA,WAAYj0G,IAAAA,eAChEixG,EAAmB9wG,KACK7B,EAAAA,GAAS,GAAvCE,EAAAC,EAAAJ,EAAA,GAAOgK,EAAP7J,EAAA,GAAgB01G,EAAhB11G,EAAA,GAEM21G,EAAgBt1G,IAChBu1G,EAAcv1G,IACdw1G,EAAYx1G,EAAO,CAAEm1G,cAAAA,EAAeh8D,IAAAA,EAAKqK,MAAAA,EAAO/gD,MAAAA,EAAO2yG,WAAAA,EAAYj0G,eAAAA,IAGzEq0G,EAAUv1G,QAAU,CAAEk1G,cAAAA,EAAeh8D,IAAAA,EAAKqK,MAAAA,EAAO/gD,MAAAA,EAAO2yG,WAAAA,EAAYj0G,eAAAA,GAKpE,IAAMs0G,EAAgB5mG,GAAY,WAC5B0mG,EAAYt1G,UACdy1G,cAAcH,EAAYt1G,SAC1Bs1G,EAAYt1G,aAAUX,EAHO,GAK9B,IAKGq2G,EAAmB,WACjB33F,IAAAA,EAAS,CAAA,EAEf,OADAw3F,EAAUv1G,QAAQm1G,WAAWjzG,SAAQ,SAAAgE,GAAU6X,EAAO7X,QAAQ7G,CAAW,IAClE0e,CACR,EAMK43F,EAAU/mG,EAAYslG,EAAAC,EAAA9vC,MAAA,SAAA0wC,IAAA,IAAAa,EAAAC,EAAAluD,EAAAmuD,EAAAC,EAAAvoE,EAAA+mE,EAAAn1G,UAAA,OAAA+0G,EAAAjlE,MAAA,SAAAslE,GAAA,OAAA,OAAAA,EAAAC,KAAAD,EAAA1tE,MAAA,KAAA,EAAA,GAAA8uE,kCAAiB,CAAA,GACnCC,eAAAA,cADkBD,EAE1BJ,IAEM7tD,EAAQwqD,EAAiB1yG,WACzBq2G,EAAcnuD,EAAMquD,aAAad,GALb,CAAAV,EAAA1tE,KAAA,EAAA,KAAA,CAAA,OAAA0tE,EAAAK,OAAA,UAAA,KAAA,EAAA,GAScltD,EAAAA,EAAMquD,aAAfxoE,EATLrkC,EAAA4sG,EAAA,CASjBb,GATiB/sG,IAAA8tG,KAU1B9D,EAAiBI,SAAS,CAAEyD,aAAcxoE,IAG1C+nE,EAAUv1G,QAAQkB,eAAew0G,KAG5BG,IAAkBC,EAAYI,WAhBT,CAAA1B,EAAA1tE,KAAA,GAAA,KAAA,CAAA,OAAA0tE,EAAAC,KAAA,GAAAD,EAAA1tE,KAAA,GAkBhBmtE,GAAoB6B,EAAYI,WAAY,CAChDrsE,OAAQ,SACR0Z,MAAOgyD,EAAUv1G,QAAQujD,QApBL,KAAA,GAAAixD,EAAA1tE,KAAA,GAAA,MAAA,KAAA,GAAA0tE,EAAAC,KAAA,GAAAD,EAAAI,GAAAJ,EAAA,MAAA,IAAA,KAAA,GAAA,IAAA,MAAA,OAAAA,EAAAM,OAAA,GAAAC,EAAA,KAAA,CAAA,CAAA,GAAA,KAAD,KA0BxB,CAAC5C,EAAkB+C,EAAeM,IAK/BW,EAAiBvnG,GAAY,WACjC4mG,IAEAF,EAAYt1G,QAAUo2G,aAAY,WAChC,IAAMzuD,EAAQwqD,EAAiB1yG,WACzBq2G,EAAcnuD,EAAMquD,aAAad,GACnC,GAACY,GAAsC,WAAvBA,EAAYO,OAA5B,CAKJ,IAAMC,EAAgBR,EAAYz0E,UAAY,EAE1Ci1E,GAAAA,GAAiB,EAAG,CAEtBd,IAEwC7tD,IAAAA,EAAAA,EAAMquD,eAArCd,GAAT,IAA+B1nE,OAAtB0nE,GAAT/sG,IAAA8tG,KA+BA,OA9BA9D,EAAiBI,SAAS,CACxByD,aACKxoE,GAAAA,GAAAA,CAAAA,EAAAA,GACF0nE,CAAAA,EAAAA,EAAAA,CAAAA,EAAAA,WAAqBY,GAFZ,GAAA,CAEyBz0E,UAAW,EAAGg1E,OAAQ,cAE3D/D,oBAAqB,CACnB4C,cAAAA,EACA1yG,MAAO+yG,EAAUv1G,QAAQwC,OAAS0yG,KAKtCK,EAAUv1G,QAAQkB,eAAew0G,KAE7BI,EAAYI,YACdjC,GAAoB6B,EAAYI,WAAY,CAC1CrsE,OAAQ,SACR0Z,MAAOgyD,EAAUv1G,QAAQujD,QAF3B,OAGS,WAAM,SAIjBh/B,YAAW,WACT,IACmDgyF,EAD9BpE,EAAiB1yG,WAC0Bu2G,aAAvCQ,IAAhBtB,GAA4B7zE,OAA5B6zE,GAAT/sG,IAAA8tG,KACIO,GAA8B,YAAnBA,EAAQH,QACrBlE,EAAiBI,SAAS,CAAEyD,aAAc30E,GAJpC,GAMP,IA3CiC,CAiDtC8wE,EAAiBI,SAAS,CACxByD,sBACKruD,EAAMquD,cACRd,CAAAA,EAAAA,EAAAA,CAAAA,EAAAA,WAAqBY,GAFZ,GAAA,CAEyBz0E,UAAWi1E,OA9CjD,MAFCd,GAJ6B,GAuD9B,IA1D6B,GA2D/B,CAACrD,EAAkB+C,EAAeM,IAM/BiB,EAAW7nG,EAAYslG,EAAAC,EAAA9vC,MAAA,SAAAqyC,IAAA,IAAAl1D,EAAAm1D,EAAAC,EAAAC,EAAAC,EAAAt5F,EAAAs4F,EAAA,OAAA3B,EAAAjlE,MAAA,SAAA6nE,GAAA,OAAA,OAAAA,EAAAtC,KAAAsC,EAAAjwE,MAAA,KAAA,EAAA,KAErB0a,EAAW2wD,EAAiB1yG,WAAWu2G,aAAad,KACtB,WAApB1zD,EAAS60D,OAHE,CAAAU,EAAAjwE,KAAA,EAAA,KAAA,CAAA,OAAAiwE,EAAAjwE,KAAA,EAInB6uE,IAJmB,KAAA,EAmBrB,GAXFN,EAAcr1G,SAChBq1G,EAAcr1G,QAAQ0O,QAExB2mG,EAAcr1G,QAAU,IAAIg3G,gBAE5B5B,GAAW,GAbgB2B,EAAAtC,KAAA,EAgBsBc,EAAAA,EAAUv1G,QAA5C62G,IAAL39D,IAAuB49D,EAhBNF,EAgBDrzD,MAGC,mBAAdszD,EAnBc,CAAAE,EAAAjwE,KAAA,GAAA,KAAA,CAAA,OAAAiwE,EAAAjwE,KAAA,GAoBR+vE,EAAUxB,EAAcr1G,QAAQo0G,QApBxB,KAAA,GAoBvB52F,EApBuBu5F,EAAApC,KAAAoC,EAAAjwE,KAAA,GAAA,MAAA,KAAA,GAsBRmtE,OAtBQ8C,EAAAjwE,KAAA,GAsBRmtE,GAAoB4C,EAAW,CAC5CtzD,MAAOuzD,EACP1C,OAAQiB,EAAcr1G,QAAQo0G,SAxBT,KAAA,GAsBvB52F,EAtBuBu5F,EAAApC,KAAA,KAAA,GA4BzBU,EAAcr1G,aAAUX,EAElBy2G,EAAc,CAClBmB,QAASz5F,EAAOy5F,QAChBrjD,OAAQp2C,EAAOo2C,OACfsiD,WAAU,QAAE14F,EAAAA,EAAO05F,aAAT,IAAAP,OAAA,EAAEA,EAAchB,QAC1BwB,SAAU35F,EAAO25F,SACjB91E,UAAW7jB,EAAO25F,SAClBd,OAAQ,UAMVd,EAAUv1G,QAAQkB,eAAesc,EAAOo2C,QAGxCu+C,EAAiBI,SAAS,CACxByD,aACK7D,GAAAA,GAAAA,CAAAA,EAAAA,EAAiB1yG,WAAWu2G,cADrB,CAAA,EAAA5oG,EAAA,CAAA,EAET8nG,EAAgBY,MAKrBK,IArDyBY,EAAAjwE,KAAA,GAAA,MAAA,KAAA,GAAAiwE,EAAAtC,KAAA,GAAAsC,EAAAnC,GAAAmC,EAAA,MAAA,GAwDV,eAAXA,EAAE7wG,GAAAA,MAEJijF,QAAQzjF,MAAM,+BAAdqxG,EAAAnC,IA1DuB,KAAA,GA8D3BQ,GAAW,GA9DgB,KAAA,GAAA,IAAA,MAAA,OAAA2B,EAAAjC,OAAA,GAAA4B,EAAA,KAAA,CAAA,CAAA,EAAA,KAAA,KA+D1B,CAACvE,EAAkB+C,EAAeS,EAASQ,IAuBvC,OApBPl2G,GAAU,WAAA,OAAM,WACdu1G,IACIH,EAAcr1G,SAChBq1G,EAAcr1G,QAAQ0O,QAGxB,IAAMi5C,EAAQwqD,EAAiB1yG,WACzBq2G,EAAcnuD,EAAMquD,aAAad,GACnCY,GAAAA,GAAsC,WAAvBA,EAAYO,QAAuBP,EAAYI,WAAY,CAE5EjC,GAAoB6B,EAAYI,WAAY,CAC1CrsE,OAAQ,SACR0Z,MAAOgyD,EAAUv1G,QAAQujD,QAF3B,OAGS,WAAM,IAEyBoE,IAAAA,EAAAA,EAAMquD,eAArCd,GAAT,IAA+B1nE,OAAtB0nE,GAAT/sG,IAAA8tG,KACA9D,EAAiBI,SAAS,CAAEyD,aAAcxoE,GAC3C,CACF,CAlBQ,GAkBN,CAAC2kE,EAAkB+C,EAAeM,IAE9B,CACLjsG,QAAAA,EACAktG,SAAAA,EACAd,QAAAA,EAEH,EC9LKyB,GAAmB,SAOnB70G,GANJ80G,IAAAA,IAAAA,UACAjhD,IAAAA,OACA5zD,IAAAA,MACAkE,IAAAA,SACA1C,IAAAA,SACA6C,IAAAA,SAGEqyC,EAOEkd,EAPFld,IACAqK,EAME6S,EANF7S,MAME6S,EAAAA,EALFkhD,YAAAA,aAAc,aAHhBC,EAIEC,EAIEphD,EAJFohD,aAIEphD,EAAAA,EAHFqhD,YAAAA,aAAc,aALhBC,EAQIthD,EAAAA,EAFFuhD,cAAAA,aAAgB,mBANlBC,EAQIxhD,EAAAA,EADFyhD,oBAAAA,cAPFC,EAUMC,EAAuBP,aAAmBh1G,GAAS60G,EAAzD,iBACQn2G,EAAmBT,KAAnBS,eACFixG,EAAmB9wG,KAEzB22G,EAAuC/C,GAAe,CACpDC,cAAemC,EACfn+D,IAAAA,EACAqK,MAAAA,EACA/gD,MAAOA,GAAS60G,EAChBlC,WAAY,CAACkC,GACbn2G,eAAAA,IANMu1G,IAAAA,SAAUd,IAAAA,QAASpsG,EAA3ByuG,EAA2BzuG,QAUrBusG,EAAc92G,GAClBmzG,GACA,SAAA/hB,GAAC,OAAIA,EAAE4lB,aAAaqB,EAAnB,IAGGY,EAAWnC,GAAsC,WAAvBA,EAAYO,OAGtC6B,EAAen4G,IAErBE,GAAU,WACHg4G,GAAaJ,IAElBK,EAAal4G,QAAU81G,EAAYliD,OAAOyjD,GAHnC,GAIN,CAACY,EAAUJ,EAAqB/B,EAAauB,IAGhD,IAWMc,EAAa,CAAA,EAQnB,OAPIF,IAAaJ,IACfM,EAAWzxG,UAAW,GAEpBuxG,GAAYJ,IACdM,EAAWtxG,SAhBQ,SAAAU,GACf0wG,GAAYJ,GACGtwG,EAAEkC,OAAO7J,QACTs4G,EAAal4G,SAC5B21G,IAGA9uG,GAAUA,EAASU,EACxB,GAYCvE,gBAACC,EAAD,CAAK2G,GAAI,CAAEzG,MAAO,SAEdH,EAAMo1G,SAASjwG,IAAInE,GAAU,SAAAo9D,GACvB,OAACp+D,EAAMq1G,eAAej3C,GACnBp+D,EAAMsE,aAAa85D,EAAO+2C,GADQ/2C,CAE1C,IAEHp+D,EAAAM,cAACL,EAAD,CACE2G,GAAI,SAAArF,GAAU,MAAA,CACZnB,QAAS,OACTkH,WAAY,SACZD,eAAgB,gBAChBlH,MAAO,OACPwO,GAAI,GACJG,GAAI,IACJC,GAAI,IACJC,2BAAqBzN,EAAMqB,QAAQisG,QAAQhsG,MAC3CqM,aAAc,EATP,GAaP+lG,GAEIj1G,EAAAM,cAACE,EAAD,CACEC,QAAQ,UACRmG,GAAI,SAAArF,GAAU,MAAA,CACZoB,MAAOmwG,EAAYz0E,WAAa,GAC5B98B,EAAMqB,QAAQ0yG,QAAQzyG,KACtBtB,EAAMqB,QAAQuM,KAAKC,UAHhB,GAMRqlG,EARH,MAtHU,SAAAc,GAClBA,GAAAA,GAAW,IAAK,CACZt7C,IAAAA,EAAIh7C,KAAK0C,MAAM4zF,EAAU,MACzB1xB,EAAI5kE,KAAKwC,KAAM8zF,EAAU,KAAQ,IACvC,OAAIt7C,EAAI,EAAaA,GAAAA,OAAAA,eAAM4pB,EAAhB,OACX,GAAA36E,OAAU26E,EAAV,OACD,CACG0xB,GAAAA,GAAW,GAAI,CACX1xB,IAAAA,EAAI5kE,KAAK0C,MAAM4zF,EAAU,IACzBnoB,EAAImoB,EAAU,GACV1xB,MAAAA,GAAAA,OAAAA,EAAKuJ,KAAAA,OAAAA,EAAEnyF,WAAWk0C,SAAS,EAAG,KACzC,CACD,MAAA,GAAAjmC,OAAUqsG,EAAV,IACD,CAiHgCC,CAAgB1C,EAAYz0E,aAKlD42E,GAEGj1G,gBAACQ,EAAD,CACEC,QAAQ,UACRmG,GAAI,CAAEjE,MAAO,mBAEZgyG,IAKLM,IAAa1uG,GAEXvG,EAAAM,cAAC+M,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRg1G,UAAWz1G,EAACM,cAAAo1G,EAHd,MAIEhyG,SAAUA,EACV8J,QAASimG,GAERa,GAKP/tG,GAEIvG,gBAACqN,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRg1G,UAAWz1G,EAAAM,cAAC8K,EAAD,CAAkBC,KAAM,GAAIC,UAAW,IAClD5H,UAAQ,GAEP4wG,GAKNW,IAAa1uG,GAEVvG,EAAAM,cAAC+M,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRkC,MAAM,UACN8yG,UAAWz1G,EAACM,cAAAq1G,EAJd,MAKEjyG,SAAUA,EACV8J,QAASmlG,GAERoC,IAOhB,EAEDX,GAAiBzzG,UAAY,CAC3B0zG,UAAWzzG,EAAUC,OAAOwE,WAC5B+tD,OAAQxyD,EAAUgF,MAAM,CACtBswC,IAAKt1C,EAAU2E,UAAU,CAAC3E,EAAUC,OAAQD,EAAUiF,OAAOR,WAC7Dk7C,MAAO3/C,EAAUC,OACjByzG,YAAa1zG,EAAUC,OACvB2zG,aAAc5zG,EAAUC,OACxB4zG,YAAa7zG,EAAUC,OACvB8zG,cAAe/zG,EAAUC,OACzBg0G,oBAAqBj0G,EAAU4E,OAC9BH,WACHrE,SAAUJ,EAAUQ,KAAKiE,oRC5N3B,IAAMuwG,GAAgB,SAACC,EAAaC,GAC9B,OAACD,GAAgBA,EAAYryG,OAC1BqyG,EAAYryG,OAAO2B,KAAI,SAAyD5F,GAAtDiF,IAAAA,IAAAA,QAASlB,IAAAA,QAAoByyG,IAAXC,UAAoBC,EAAgB9vG,EAAA5G,EAAA6G,IACjF8vG,EAAe1xG,EAGnB,OAFIlB,GAAWA,EAAQ6yG,MAAOD,EAAe5yG,EAAQ6yG,MAC5CL,EAAcC,KAAOG,EAAerS,GAAGiS,EAAcC,GAAOzyG,qWACrEvE,CAAA,CAASyF,QAAS0xG,EAAc5yG,QAAAA,EAAS0yG,UAAWD,GAASE,EAC9D,IAN+C,EAOjD,EAEKG,GAAiBp2G,EAAM+0C,MAAK,SAA+DhvC,GAAA,IAAAswG,EAA5DC,IAAAA,eAAgBC,IAAAA,cAAeryG,IAAAA,SAAUsyG,IAAAA,aAC5EC,EAQIl5G,KAPFtB,IAAAA,MACAitF,IAAAA,OACAwtB,IAAAA,aACAZ,IAAAA,cACAa,IAAAA,cACAC,IAAAA,kBACAC,IAAAA,aAGIC,EAASR,EAAe,GACxBS,EAAY/6G,GAAiBC,GAAO,SAAAmxF,GAAKA,OAAAA,EAAE4pB,mBAAN,IACrCp6G,EAAQZ,GAAiBC,GAAO,SAAAmxF,GAAC,OAAIA,EAAE/nE,KAAKyxF,EAAX,IACjCjB,EAAc75G,GAAiBC,GAAO,SAAAmxF,GAAC,IAAA6pB,EAAA,OAAI,QAAJA,EAAI7pB,EAAEva,eAAF,IAAAokC,OAAA,EAAAA,EAAYH,EAAhB,IAEvCpzG,EAAWqzG,GAAaF,EACxBK,EAAchuB,EAAO1gD,WAAWsuE,GACtC,IAAKI,EAAa,OAAO,EAEzB,IAAMC,EAASD,EAAYj0G,KAErBm0G,EAAcT,EADGQ,KAAAA,OAAAA,EAAO14F,OAAO,GAAG0nB,cAAgBgxE,EAAO56F,MAAM,MACrBo6F,EAAcrG,UAEvDhwG,OAAAA,EAAc82G,EAAa,CAChCh8G,IAAmBm7G,cAAAA,OAAAA,cAAiBryG,EAAjC,KAAAgF,OAA6C4tG,GAChDr2G,QAAS+1G,EACT9yG,SAAAA,EACAG,SAAU+yG,EACV1zG,KAAM4zG,EACNl6G,MAAAA,EACA6G,SAAUoyG,aAAAA,EAAAA,EAAapyG,SACvBF,UAAWsyG,aAAAA,EAAAA,EAAatyG,UACxBC,OAAQoyG,GAAcC,EAAaC,GACnCt2G,OAAOk3G,SAAA,QAAAL,EAAAK,EAAcW,cAAd,IAAAhB,OAAA,EAAAA,EAAuBS,KAAWA,GAE5C,qpBCpCD,IAwIMQ,GAAgB,SAA+BC,GAAA,IAAAC,EAAAC,EAAAC,EAA5BC,IAAAA,WAAYC,IAAAA,UACnCnB,EAkBIl5G,KAjBFtB,IAAAA,MACAitF,IAAAA,OACAwtB,IAAAA,aACAZ,IAAAA,cACAtqG,IAAAA,SACAgrG,IAAAA,aACA/1G,IAAAA,QACAk2G,IAAAA,cACAkB,IAAAA,UACAC,IAAAA,WACAC,IAAAA,eACAC,IAAAA,mBACApB,IAAAA,kBACAqB,IAAAA,YACAC,IAAAA,WACAC,IAAAA,eACAtB,IAAAA,aAGIxC,EA7JiB,SAAAsD,GACvB,MAA0B,iBAAfA,EAAgCA,EACtCl9G,MAAMC,QAAQi9G,GACG,aAAlBA,EAAW,IACO,eAAlBA,EAAW,GAD0BA,EAAW,GAE7CA,EAAW,GAHqB,IAIxC,CAuJmBS,CAAiBT,GAC7BU,EAAa59G,MAAMC,QAAQi9G,IAAiC,eAAlBA,EAAW,GACrD5zG,EAAWtJ,MAAMC,QAAQi9G,IAAiC,aAAlBA,EAAW,GACnDW,GAAav0G,GAAYtJ,MAAMC,QAAQi9G,MAAgB,QAAAA,EAAAA,EAAW,UAAX,IAAAH,OAAA,EAAAA,EAAee,WAAW,QAA1Bd,EAA0BE,EAAW,UAAX,IAAAF,OAAA,EAAAA,EAAee,WAEhGC,EL3K8Bj7G,EAAWwzG,IK8KzCp0G,EAAQZ,GAAiBC,GAAO,SAAAmxF,GAAC,OAAIA,EAAE/nE,KAAKgvF,EAAX,IACjCwB,EAAc75G,GAAiBC,GAAO,SAAAmxF,GAAC,IAAA6pB,EAAA,OAAI,QAAJA,EAAI7pB,EAAEva,eAAF,IAAAokC,OAAA,EAAAA,EAAY5C,EAAhB,IACvCqE,EAAa18G,GAAiBC,GAAO,SAAAmxF,GAAC,IAAAurB,EAAA,OAAI,QAAJA,EAAIvrB,EAAEwrB,mBAAF,IAAAD,OAAA,EAAAA,EAAgBtE,EAApB,IACtC2C,EAAsBh7G,GAAiBC,GAAO,SAAAmxF,GAAKA,OAAAA,EAAE4pB,mBAAN,IAGrD,GAAIqB,EAAY,CACd,IAAMQ,EAAoBlC,EAAc1G,iBACxC,OAAOjwG,gBAAC64G,EAAD,CAAmB94D,QAAS43D,EAAW,IArCG,CAyC/CW,GAAAA,EAAW,OAAO,EAEtB,IAAMQ,EAxKoB,SAAAnB,GAC1B,MAA0B,iBAAfA,EAAgC,GACtCl9G,MAAMC,QAAQi9G,GACG,aAAlBA,EAAW,GAA0BA,EAAW,IAAM,GACpC,eAAlBA,EAAW,GAA4B,CAAA,EACpCA,EAAW,IAAM,GAHe,CAAA,CAIxC,CAkKsBoB,CAAoBpB,GACjCzvC,EAAmD4wC,EAAnD5wC,OAAQ8wC,EAA2CF,EAA3CE,UAAWC,EAAgCH,EAAhCG,aAAiBnxG,IAAegxG,EAA3DI,IAEA,IAAe,IAAXhxC,EAAiB,OAAO,EAE5B,IAAMxkE,EAAWszG,GAAuBH,GAAgB4B,EAExD,IAAK5C,EAAa,OAAO,EAEzB,IAAQsD,EAAuEtD,EAAvEsD,WAAY11G,EAA2DoyG,EAA3DpyG,SAAUm4F,EAAiDia,EAAjDja,SAAUr4F,EAAuCsyG,EAAvCtyG,UAAuCsyG,EAA5BryG,OAAnD,IAAiE41G,EAAcvD,EAApBxwF,KAG3D,IAAmB,IAAf8zF,IAAyB11G,IAAam4F,QAA0Bv/F,IAAd+8G,EAA0B,OAAO,EAGvF,GAAI5tG,IAAuB,KAAV5O,QAA0BP,IAAVO,GAAsB,OAAO,EAG9D,GAAI4O,GAAY/Q,MAAMC,QAAQy9G,IAAmBA,EAAe1nG,SAAS4jG,GAAY,CAAA,IAAAgC,EAC7EgD,EAAsB1C,EAAc7F,WACpCtxG,GAAsB,IAAdw5G,KAAuBtC,iBAAAL,EAAAK,EAAcW,yBAAd,IAAuBhD,KAAcA,GAC1E,OAAOr0G,gBAACq5G,EAAD,CAAqBtK,QAAQ,WAAWvvG,MAAOA,GACvD,CAED,IAAM03G,EAAchuB,EAAO1gD,WAAW6rE,GACtC,IAAK6C,EAAa,OAAO,EAEzB,IAGI/zG,GACFm2G,GAJYC,GAAsCrC,EAA5Cj0G,KAA2BI,GAAiB6zG,EAApD,QAKI,IACIsC,IAAAA,GA9Ke,SAEnBzzG,GADJsuG,IAYIoF,EAZJpF,IAAAA,UAAWtwG,IAAAA,SAAUw1G,IAAAA,WAAY5C,IAAAA,cAAemB,IAAAA,WAAYE,IAAAA,mBAE5D,GAAIj0G,EAAU,CACZ,IAAMZ,EAAY60G,EAAmB3D,GACjC,IAAClxG,EAAW,MAAM,IAAIxF,MAAJ,8CAAAuL,OAAwDmrG,EAA9D,MACT,MAAA,CAAElxG,UAAAA,EAAWkB,MAAO,CAAA,EAC5B,CAED,QAA8BhI,IAA1By7G,EAAWzD,GACN,MAAA,CAAElxG,UAAW20G,EAAWzD,GAAYhwG,MAAO,CAAA,GAIhD,GAAsB,iBAAfk1G,QAAyDl9G,IAA9Bs6G,EAAc4C,GAClDE,EAAUF,OACL,GAAI9+G,MAAMC,QAAQ6+G,GACvBE,EAAU,aACL,SAA8Bp9G,IAA1Bs6G,EAAA,QAGH,MAAA,IAAIh5G,MAAJ,mDAAAuL,OAA6DmrG,EAA7D,aAAAnrG,OAAkF0uC,KAAKC,UAAU0hE,GAAvG,MAFAE,EAAU,SAGX,CAED,IAAMtvG,EAAQwsG,EAAc8C,GACxB,IAACtvG,EAAO,MAAM,IAAIxM,MAAyD02G,mDAAAA,OAAAA,EAAnE,MAGZ,OAAI55G,MAAMC,QAAQyP,GAAe,CAAEhH,UAAWgH,EAAM,GAAI9F,MAAO8F,EAAM,IAE9D,CAAEhH,UAAWgH,EAAO9F,MAAO,CAAA,EACnC,CA+IoBq1G,CAAiB,CAAErF,UAAAA,EAAWtwG,SAAAA,EAAUw1G,WAAAA,GAAY5C,cAAAA,EAAemB,WAAAA,EAAYE,mBAAAA,IAChG70G,GAAYq2G,GAASr2G,UACrBm2G,GAAwBE,GAASn1G,KAHnC,CAIE,MAAOE,GAEP,OADA4hF,QAAQzjF,MAAM6B,IACP,CACR,CAEK/E,IAAAA,IAAsB,IAAdw5G,KAAuBtC,SAAA,QAAAA,EAAAA,EAAcW,cAAd,IAAAK,OAAAhB,EAAAgB,EAAuBrD,KAAcA,GAGpE/wG,GArJa,SAA0Dq2G,GAAvDJ,IAAAA,IAAAA,WAAYlF,IAAAA,UAAW6C,IAAAA,YAAaR,IAAAA,aAC1D,OAAIj8G,MAAMC,QAAQ6+G,GACTA,EAAWp0G,KAAI,SAAAvI,GAAK,IAAAg9G,EAAK,MAAA,CAC9Bp6G,OAAOk3G,SAA4B95G,QAA5B85G,EAAAA,EAAerC,UAAaz3G,IAAAA,OAA5B85G,EAA4B95G,EAAAA,KAAUA,EAC7CA,MAAAA,EAFyB,IAKV,UAAf28G,GAA0BrC,EAAY5zG,QACjC4zG,EAAY5zG,QAAQisC,QAAO,SAACsqE,EAAK5tG,GAAN,IAAA6tG,EAAA,OAAA/6G,GAAAA,GAAA,CAAA,EAC7B86G,GACF5tG,CAAAA,EAAAA,EAAAA,CAAAA,EAAAA,GAAIyqG,SAA4BzqG,QAA5B6tG,EAAApD,EAAerC,UAAapoG,IAAAA,OAA5B,EAA4BA,EAAAA,KAAMA,GAFlC,GAGH,CAHG,QADT,CAOD,CAuIiB8tG,CAAa,CAAER,WAAAA,GAAYlF,UAAAA,EAAW6C,YAAAA,EAAaR,aAAAA,IAG7DsD,GAAkBj2G,EAAW,WAActJ,MAAMC,QAAQ6+G,IAAc,SAAYA,IAAc,UACjGU,IAAgBpC,aAAA,EAAAA,EAAYmC,MAAoB,CAAA,EAChDE,IAAiBnC,aAAA,EAAAA,EAAiB1D,KAAc,CAAA,EAChD8F,kBAA2Bb,IAA0BW,IAAkBC,IAAmBpyG,GAE1FsyG,GApNc,SAACvE,EAAaC,GAC9B,OAACD,GAAgBA,EAAYryG,OAC1BqyG,EAAYryG,OAAO2B,KAAI,SAAyD5F,GAAtDiF,IAAAA,IAAAA,QAASlB,IAAAA,QAAoByyG,IAAXC,UAAoBC,EAAgB9vG,EAAA5G,EAAA6G,IACjF8vG,EAAe1xG,EAGnB,OAFIlB,GAAWA,EAAQ6yG,MAAOD,EAAe5yG,EAAQ6yG,MAC5CL,EAAcC,KAAOG,EAAerS,GAAGiS,EAAcC,GAAOzyG,IACrEvE,GAAA,CAASyF,QAAS0xG,EAAc5yG,QAAAA,EAAS0yG,UAAWD,GAASE,EAC9D,IAN+C,EAOjD,CA4MwBL,CAAcC,EAAaC,GAElD,GAAItqG,EAAU,CACZ,IAAM6uG,GAAuB1D,EAAcliE,cAGrC6lE,GAAwB7/G,MAAMC,QAAQ6+G,IACxC,SACCA,IAAc,SACbgB,GAA6BD,WAAAA,OAAAA,GAAsB77F,OAAO,GAAG0nB,cAAgBm0E,GAAsB/9F,MAAM,IACzGi+F,GAAoB1C,EAAWzD,IAAcsC,EAAc4D,KAAoB5D,EAAc7G,gBAEnG,OACE9vG,gBAACq6G,GAADtyG,EAAA,CACE9E,KAAMq3G,GACNp3G,KAAMmxG,EACN70G,MAAOA,GACP5C,MAAOA,EACP0G,QAASA,GACTG,SAAUA,EACVF,UAAWA,EACXC,OAAQ42G,GACRj3G,UAAWq3G,GACXp3G,eAAgB+2G,IACZzB,GAvHyC,CA6H7C+B,IAAAA,GAvKuB,SAA4CC,GAAzC9C,IAAAA,IAAAA,UAAWvD,IAAAA,UAAWmC,IAAAA,aAChDvwG,EAAS,GACTD,EAAU,GAuBT,OArBP4xG,EAAU14G,SAAQ,SAAAy7G,GAChB,GAAKlgH,MAAMC,QAAQigH,IAAaA,EAAQ,GAAxC,CAEMC,IAAAA,EAAWD,EAAQ,GAAGpC,UAAYlE,EAClCwG,EAAYF,EAAQ,GAAGnC,WAAanE,EAC1C,GAAKuG,GAAaC,EAAlB,CAEM3f,IAAAA,EACJl7F,EAAAM,cAAC81G,GAAD,CACEh7G,IAAkBu/G,aAAAA,OAAAA,EAAQ,IAC1BrE,eAAgBqE,EAChBpE,cAAelC,EACfnwG,SAAU02G,EAAW,SAAW,UAChCpE,aAAcA,IAIdoE,GAAU30G,EAAO9D,KAAK+4F,GACtB2f,GAAW70G,EAAQ7D,KAAK+4F,EAbC,CAJe,CAkB7C,IAEM,CACLj1F,OAAQA,EAAO3L,OAAS,EAAI2L,OAAS5J,EACrC2J,QAASA,EAAQ1L,OAAS,EAAI0L,OAAU3J,EAE3C,CA0IoBy+G,CAAuB,CAAElD,UAAAA,EAAWvD,UAAAA,EAAWmC,aAAAA,IAE5DuE,GAAmBpE,EAAc7mD,MAEjCkrD,GACJh7G,EAAAM,cAACy6G,GAAD,CACEt6G,QAAS+1G,EACTxzG,YAAavC,EACbwC,KAAM+2G,GACN92G,KAAMmxG,EACN70G,MAAOA,GACP6D,aAAcA,GACdzG,MAAOA,EACP0G,QAASA,GACTG,SAAUA,EACVF,UAAWA,EACXC,OAAQ42G,GACRz2G,WAAY+0G,aAAAA,EAAAA,EAAY/0G,WACxBC,MAAO80G,aAAAA,EAAAA,EAAY90G,MACnBT,UAAWA,GACXC,eAAgB+2G,GAChBn0G,QAASy0G,GAAWz0G,QACpBC,OAAQw0G,GAAWx0G,OACnBvC,SAAUA,EACVG,SAAU+yG,EACV1rC,QAAS+sC,EACTznG,OAAQ0nG,IAIZ,OAAIe,EAEAj5G,gBAACo0G,GAAD,CACEC,UAAWA,EACXjhD,OAAQ6lD,EACRz5G,MAAOA,GACPkE,SAAUA,EACVG,SAAU+yG,GAEToE,IAKAA,EACR,EAEDC,GAAej7G,EAAM+0C,KAAKuiE,ICjRpB4D,GAAwB,SAOxB37G,GANJ47G,IAAAA,IAAAA,QACA/nD,IAAAA,OACA5zD,IAAAA,MACA2yG,IAAAA,WACAzuG,IAAAA,SACA1C,IAAAA,SAGEk1C,EAOEkd,EAPFld,IACAqK,EAME6S,EANF7S,MAME6S,EAAAA,EALFkhD,YAAAA,aAAc,aAHhBC,EAIEC,EAIEphD,EAJFohD,aAIEphD,EAAAA,EAHFqhD,YAAAA,aAAc,aALhBC,EAQIthD,EAAAA,EAFFuhD,cAAAA,aAAgB,mBANlBC,EAQIxhD,EAAAA,EADFyhD,oBAAAA,cAPFC,EAUMC,EAAuBP,aAAmBh1G,GAAS27G,EAAzD,iBAEQj9G,EAAmBT,KAAnBS,eACFixG,EAAmB9wG,KAEzB22G,EAAuC/C,GAAe,CACpDC,cAAeiJ,EACfjlE,IAAAA,EACAqK,MAAAA,EACA/gD,MAAOA,GAAS27G,EAChBhJ,WAAAA,EACAj0G,eAAAA,IANMu1G,IAAAA,SAAUd,IAAAA,QAASpsG,IAAAA,QASrBusG,EAAc92G,GAClBmzG,GACA,SAAA/hB,GAAC,OAAIA,EAAE4lB,aAAamI,EAAnB,IAGGlG,EAAWnC,GAAsC,WAAvBA,EAAYO,OAGtC+H,EAAqBr+G,IAE3BE,GAAU,WAENm+G,EAAmBp+G,QADjBi4G,EAC2BnC,EAAYliD,YAEZv0D,CAEhC,GAAE,CAAC44G,EAAUnC,IAGRuI,IAAAA,EAAoBr7G,EAAM4L,aAC9B,SAAAwhF,GACQryE,IAAAA,EAAS,CAAA,EAEf,OADAo3F,EAAWjzG,SAAQ,SAAAgE,GAAU6X,EAAO7X,GAAQkqF,EAAE/nE,KAAKniB,EAAO,IACnD6X,CACR,GACD,CAACo3F,IAGGmJ,EAAgBn9G,GAAgBk9G,GAAmB,SAAClhH,EAAGC,GAC3D,IAAK,IAAIG,EAAI,EAAGA,EAAI43G,EAAW73G,OAAQC,IACrC,GAAIJ,EAAEg4G,EAAW53G,MAAQH,EAAE+3G,EAAW53G,IAAK,OAAO,EAEpD,OAAO,CACR,IAaD,OAXA0C,GAAU,WACJ,GAACg4G,GAAaJ,GAAwBuG,EAAmBp+G,QAAzD,CAEJ,IAAMu+G,EAAYH,EAAmBp+G,QACfm1G,EAAWxiE,MAAK,SAAAzsC,GAAQo4G,OAAAA,EAAcp4G,KAAUq4G,EAAUr4G,EAAtC,KAGxCyvG,GANoE,CAQvE,GAAE,CAACsC,EAAUJ,EAAqB1C,EAAYmJ,EAAe3I,IAG5D3yG,gBAACC,EAAD,CAAK2G,GAAI,CAAEzG,MAAO,SAChBH,gBAACC,EAAD,CACE2G,GAAI,SAAArF,GAAU,MAAA,CACZnB,QAAS,OACTkH,WAAY,SACZD,eAAgB,gBAChBlH,MAAO,OACPI,GAAI,IACJuO,GAAI,IACJC,GAAI,IACJC,2BAAqBzN,EAAMqB,QAAQisG,QAAQhsG,MAC3CqM,aAAc,EATP,GAaP+lG,GAEIj1G,EAAAM,cAACE,EAAD,CACEC,QAAQ,UACRmG,GAAI,SAAArF,GAAU,MAAA,CACZoB,MAAOmwG,EAAYz0E,WAAa,GAC5B98B,EAAMqB,QAAQ0yG,QAAQzyG,KACtBtB,EAAMqB,QAAQuM,KAAKC,UAHhB,GAMRqlG,EARH,MArHU,SAAAc,GAClBA,GAAAA,GAAW,IAAK,CACZt7C,IAAAA,EAAIh7C,KAAK0C,MAAM4zF,EAAU,MACzB1xB,EAAI5kE,KAAKwC,KAAM8zF,EAAU,KAAQ,IACvC,OAAIt7C,EAAI,EAAaA,GAAAA,OAAAA,eAAM4pB,EAAhB,OACX,GAAA36E,OAAU26E,EAAV,OACD,CACG0xB,GAAAA,GAAW,GAAI,CACX1xB,IAAAA,EAAI5kE,KAAK0C,MAAM4zF,EAAU,IACzBnoB,EAAImoB,EAAU,GACV1xB,MAAAA,GAAAA,OAAAA,EAAKuJ,KAAAA,OAAAA,EAAEnyF,WAAWk0C,SAAS,EAAG,KACzC,CACD,MAAA,GAAAjmC,OAAUqsG,EAAV,IACD,CAgHgCC,CAAgB1C,EAAYz0E,aAKlD42E,GAEGj1G,gBAACQ,EAAD,CACEC,QAAQ,UACRmG,GAAI,CAAEjE,MAAO,mBAEZgyG,IAKLM,IAAa1uG,GAEXvG,EAAAM,cAAC+M,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRg1G,UAAWz1G,EAACM,cAAAo1G,EAHd,MAIEhyG,SAAUA,EACV8J,QAASimG,GAERa,GAKP/tG,GAEIvG,gBAACqN,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRg1G,UAAWz1G,EAAAM,cAAC8K,EAAD,CAAkBC,KAAM,GAAIC,UAAW,IAClD5H,UAAQ,GAEP4wG,GAKNW,IAAa1uG,GAEVvG,EAAAM,cAAC+M,EAAD,CACEhC,KAAK,QACL5K,QAAQ,WACRkC,MAAM,UACN8yG,UAAWz1G,EAACM,cAAAq1G,EAJd,MAKEjyG,SAAUA,EACV8J,QAASmlG,GAERoC,IAKX/0G,EAACM,cAAA0wG,GAAqBwK,SAAtB,CAA+B5+G,MAAOq4G,IAAaJ,GAChD7zG,GAIR,EAEDk6G,GAAsBv6G,UAAY,CAChCw6G,QAASv6G,EAAUC,OAAOwE,WAC1B+tD,OAAQxyD,EAAUgF,MAAM,CACtBswC,IAAKt1C,EAAU2E,UAAU,CAAC3E,EAAUC,OAAQD,EAAUiF,OAAOR,WAC7Dk7C,MAAO3/C,EAAUC,OACjByzG,YAAa1zG,EAAUC,OACvB2zG,aAAc5zG,EAAUC,OACxB4zG,YAAa7zG,EAAUC,OACvB8zG,cAAe/zG,EAAUC,OACzBg0G,oBAAqBj0G,EAAU4E,OAC9BH,WACH8sG,WAAYvxG,EAAU+E,QAAQ/E,EAAUC,QAAQwE,WAChDrE,SAAUJ,EAAUQ,KAAKiE,YC9N3B,IAAMo2G,GAAc,SAAC9D,EAAY9oG,GAC/B,MAA0B,iBAAf8oG,EAAgCA,EACvCl9G,MAAMC,QAAQi9G,GAAuBA,GAAAA,OAAAA,EAAW,GAAMA,KAAAA,OAAAA,EAAW,IAAM9oG,GACvE8oG,GAAcA,EAAWpuG,GAAWouG,EAAWpuG,GAC5C2V,OAAOrQ,EACf,EAMK6sG,GAAoB,SAAA9qD,GAGxB,IAFM+qD,IAAAA,EAAQ,GAELphH,EAAI,EAAGA,EAAIq2D,EAAOt2D,OAAQC,IAAK,CACtC,IAAM4P,EAAQymD,EAAOr2D,GACA,iBAAV4P,EACTwxG,EAAMx5G,KAAKgI,GACF1P,MAAMC,QAAQyP,IACN,aAAbA,EAAM,IAAkC,eAAbA,EAAM,IACnCwxG,EAAMx5G,KAAKgI,EAAM,GAGtB,CAED,OAAOwxG,CACR,EAQKC,GAAwB,SAAxBA,EAUAr8G,GATJs8G,IAAAA,IAAAA,UACAr8G,IAAAA,MACAG,IAAAA,KACAixD,IAAAA,OACAqoD,IAAAA,aACAv5G,IAAAA,aACAG,IAAAA,YACAE,IAAAA,UAEI+7G,EAAAv8G,EADJ+zB,OAAAA,aAAS,EACLwoF,EACJrF,EAAmCl5G,KAA3BkD,IAAAA,QAASk2G,IAAAA,cAEXoF,EAA6B,IAAXzoF,GAA4B,SAAZ7yB,EACpCk2G,EAAc/F,YACdjvG,GAEEq6G,EAAgBprD,EAAOzrD,KAAI,SAACwyG,EAAYp9G,GAC5C,OAAmB,IAAfo9G,IAGAA,GAAoC,WAAtBsE,GAAOtE,KAA4Bl9G,MAAMC,QAAQi9G,IAAeA,EAAW/mD,OAEzF5wD,gBAAC47G,EAAD,CACExgH,IAAG,gBAAA8N,OAAkByuG,EAAWpuG,IAChCsyG,UAAWlE,EAAWpuG,GACtB/J,MAAOm4G,EAAWn4G,MAClBG,KAAMg4G,EAAWuE,YACjBtrD,OAAQ+mD,EAAW/mD,OACnBqoD,aAActB,EAAWsB,aACzBv5G,aAAcA,EACdG,YAAaA,EACbE,UAAWA,EACXuzB,QAASA,GAAU,GAAK,IAM5BtzB,gBAACs3G,GAAD,CACEl8G,IAAKqgH,GAAY9D,EAAYp9G,GAC7Bo9G,WAAYA,EACZC,UAAWhnD,IAGhB,IAED,OACE5wD,gBAAC+7G,EAAD,CACEZ,QAASU,EACTr8G,MAAOA,EACPE,aAAcA,EACdC,KAAMA,EACNE,YAAaA,EACbE,UAAWA,GAGTk5G,GAEIj5G,EAAAM,cAAC46G,GAAD,CACEC,QAASU,EACTzoD,OAAQ6lD,EACRz5G,MAAOA,EACP2yG,WAAYuJ,GAAkB9qD,IAE7BorD,IAKN/C,GACI+C,EAIZ,EAEDJ,GAAsBj7G,UAAY,CAChCk7G,UAAWj7G,EAAUC,OAAOwE,WAC5B7F,MAAOoB,EAAUC,OACjBlB,KAAMiB,EAAUC,OAChBnB,aAAckB,EAAUC,OACxBhB,YAAae,EAAUC,OACvBd,UAAWa,EAAUE,MAAM,CAAC,OAAQ,SAAU,UAC9C8vD,OAAQhwD,EAAU8E,MAAML,WACxB4zG,aAAcr4G,EAAUgF,MAAM,CAC5BswC,IAAKt1C,EAAUC,OAAOwE,WACtBk7C,MAAO3/C,EAAUC,OACjBg0G,oBAAqBj0G,EAAU4E,KAC/B22G,gBAAiBv7G,EAAU4E,OAE7B8tB,OAAQ1yB,EAAU6E,QAGpB,IAAA22G,GAAep8G,EAAM+0C,KAAK6mE,ukBC/G1B,IAAMS,GAAsB,WAAG,IAAA98G,EAAA2xG,EAAAC,EAAA9vC,MAAA,SAAA0wC,EAAO7lF,EAAMrmB,GAAb,IAAAoG,EAAA,OAAAklG,EAAAjlE,MAAA,SAAAslE,GAAA,OAAA,OAAAA,EAAAC,KAAAD,EAAA1tE,MAAA,KAAA,EAAA,OAAA0tE,EAAA1tE,KAAA,EACbj+B,IADa,KAAA,EAEzBoG,IAAM,KADJA,EADuBulG,EAAAG,MAAA,CAAAH,EAAA1tE,KAAA,EAAA,KAAA,CAEN,OAAA0tE,EAAAK,OAAA,SAAA,CAAE3lF,KAAAA,EAAM8pF,UAAW,QAASxxG,QAASyH,IAF/B,KAAA,EAAA,OAAAulG,EAAAK,OAAA,UAGtB,GAHsB,KAAA,EAAA,IAAA,MAAA,OAAAL,EAAAM,OAAA,GAAAC,EAAH,KAAA,OAAA,SAAAC,EAAAsK,GAAA,OAAA/8G,EAAA8C,MAAA5D,KAAArC,UAAA,CAAA,CAAA,GAiBtBmgH,GAAqB,SAACC,EAAaC,GACvC,IAAKD,EAAa,OAAOC,EAKzB,IAHMC,IAAAA,EAAS,CAAA,EACTliH,EAAOO,OAAOP,KAAKiiH,GAEhBliH,EAAI,EAAGA,EAAIC,EAAKF,OAAQC,IAAK,CACpC,IAAM8hF,EAAI7hF,EAAKD,GACXiiH,EAAYngC,IAAM1uC,GAAQ6uE,EAAYngC,GAAIogC,EAAYpgC,IACxDqgC,EAAOrgC,GAAKmgC,EAAYngC,GAExBqgC,EAAOrgC,GAAKogC,EAAYpgC,EAE3B,CAED,OAAOqgC,CACR,EAKKC,GAAiB,SAAA/D,GAErB,IADA,IAAM79F,EAAShgB,OAAOggB,OAAO69F,GACpBr+G,EAAI,EAAGA,EAAIwgB,EAAOzgB,OAAQC,IAC7BwgB,GAAAA,EAAOxgB,GAAGqJ,MAAO,OAAO,EAE9B,OAAO,CACR,EAEKg5G,GAAiB,SAAC1zB,EAAQ2zB,EAASC,EAAeC,GACtD,IAAAC,EAzCmB,SAAC9zB,EAAQ7jE,GAAT,OAAkB2wF,EAAU9sB,EAAQ7jE,EAApC,CAyCyC43F,CAAa/zB,WAAa2zB,GAAYC,IAA1Fv5G,IAAAA,UAAWC,IAAAA,OAAQqvE,IAAAA,QAASxtD,IAAAA,KAAM63F,IAAAA,cAEpCtE,EAAcmE,GAClBhiH,OACGP,KAAKq4E,GACL1tE,KAAI,SAAA+mB,GAAI,OAAA9hB,EAAA,CAAA,EACN8hB,EAAO,CACNvoB,YAAY,EACZw5G,QAAQ,EACRC,SAAS,EACTx5G,OAAO,EACPy5G,UAAU,EACVC,UAAU,EACV9hD,OAAO,GAVb,IAaGjsB,QAAO,SAACpwC,EAAG8M,GAAY9M,OAAAA,GAAAA,GAAAA,CAAAA,EAAAA,GAAM8M,EAbhC,GAasC,CAbtC,GAgBIsxG,EACJxiH,OACG8S,QAAQwX,GACRlgB,KAAI,SAAAZ,GACH,IAAI3H,EAAQ2H,EAAE,GAEd,YADclI,IAAVO,QAA+CP,IAAxB6gH,EAAc34G,EAAE,MAAmB3H,EAAQsgH,EAAc34G,EAAE,KACtF6F,EAAA,CAAA,EAAU7F,EAAE,GAAK3H,EALrB,IAOG2yC,QAAO,SAACpwC,EAAG8M,GAAY9M,OAAAA,GAAAA,GAAAA,CAAAA,EAAAA,GAAM8M,EAPhC,GAOsC,CAPtC,GAUK,MAAA,CACL+qG,qBAAqB,EACrBzzG,UAAAA,EACAi6G,QAASb,GAAe/D,GACxBp1G,OAAAA,EACAqvE,QAAAA,EACAxtD,KAAMk4F,EACNE,YAAa,GACb7E,YAAAA,EAEH,EAMK8E,GAAgB,SAA4ChD,GAAzCz+G,IAAAA,IAAAA,MAAO65G,IAAAA,cAAeY,IAAAA,aACnB12G,EAAAA,EAAMxD,UAAS,WAAO,MAAA,CAC9C+G,UAAWtH,EAAMQ,WAAW8G,UAC5BC,OAAQvH,EAAMQ,WAAW+G,OAFc,IAAzCm6G,EAAAhhH,EAAAihH,EAAA,GAAOj5D,EAAPg5D,EAAA,GAAcpO,EAAdoO,EAAA,GAgBA,OAXA1gH,GAAU,WAQR,OAPoBhB,EAAMkB,WAAU,WACJlB,IAAAA,EAAAA,EAAMQ,WAA5B8G,IAAAA,UAAWC,IAAAA,OACnB+rG,GAAS,SAAAkC,GACP,OAAIA,EAAKluG,YAAcA,GAAaoqC,GAAQ8jE,EAAKjuG,OAAQA,GAAgBiuG,EAClE,CAAEluG,UAAAA,EAAWC,OAAAA,EACrB,GACF,GAEF,GAAE,CAACvH,MAEC0oD,EAAMphD,WAGTvD,EAAAM,cAAA,MAAA,CAAKuB,UAAU,UACZ8iD,EAAMnhD,OAAO2B,KAAI,SAAiDoyG,GAAA,IAAAlB,EAA9CnqF,IAAAA,KAAM1nB,IAAAA,QAASlB,IAAAA,QAAoByyG,IAAXC,UACvCE,EAAe1xG,EAKjB,OAJElB,GAAWA,EAAQ6yG,MAAOD,EAAe5yG,EAAQ6yG,MAC5CL,EAAcC,KAAOG,EAAerS,GAAGiS,EAAcC,GAAOzyG,IAGnEtD,EAAAM,cAAA,MAAA,CAAKlF,IAAG,cAAA8N,OAAgBgjB,EAAhB,KAAAhjB,OAAwB6sG,GAAQl0G,UAAU,SAChD7B,EAAAM,cAAA,MAAA,CAAKuB,UAAU,UAAS60G,SAAuBxqF,QAAvBmqF,EAAAK,EAAcW,cAASnrF,IAAAA,OAAvB,EAAuBA,EAAAA,KAASA,GACxDlsB,EAAAM,cAAA,MAAA,CAAKuB,UAAU,WAAWq0G,GAR/B,IAcN,EAMK2H,GAAiB,SAAAx5G,GACrB,IACEkF,EA8BElF,EA9BFkF,GA8BElF,EAAAA,EA7BF5D,QAAAA,aAAU,OAFZq9G,EAGEtH,EA4BEnyG,EA5BFmyG,aACAuH,EA2BE15G,EA3BF05G,kBACAC,EA0BE35G,EA1BF25G,iBACAj+G,EAyBEsE,EAzBFtE,UACAyL,EAwBEnH,EAxBFmH,SACAyyG,EAuBE55G,EAvBF45G,cACAC,EAsBE75G,EAtBF65G,WACAh1B,EAqBE7kF,EArBF6kF,OACAi1B,EAoBE95G,EApBF85G,aACA94F,EAmBEhhB,EAnBFghB,KACAy3F,EAkBEz4G,EAlBFy4G,cACasB,EAiBX/5G,EAjBFu0G,YACU/B,EAgBRxyG,EAhBFX,SACAgzG,EAeEryG,EAfFqyG,aACA2H,EAcEh6G,EAdFg6G,MACAxG,EAaExzG,EAbFwzG,UACAC,EAYEzzG,EAZFyzG,WACAC,EAWE1zG,EAXF0zG,eACAC,EAUE3zG,EAVF2zG,mBACAG,EASE9zG,EATF8zG,eACAmG,EAQEj6G,EARFi6G,eAQEj6G,EAAAA,EAPFyxG,cAAAA,aAAgB,CAxBlB,EAAAyI,EAyBEC,EAMEn6G,EANFm6G,gBACA1wC,EAKEzpE,EALFypE,SACAV,EAIE/oE,EAJF+oE,QACAqxC,EAGEp6G,EAHFo6G,eACAC,EAEEr6G,EAFFq6G,cACAC,EACEt6G,EADFs6G,UAMIC,EAAW7hH,EAAO,MACC,OAArB6hH,EAAS5hH,UACX4hH,EAAS5hH,QAAU,IAAIsB,GAAUs+G,GAAe1zB,EAAQ7jE,EAAMy3F,EAAesB,KAE/E,IAAMniH,EAAQ2iH,EAAS5hH,QAKjB6hH,EAAsB9hH,EAAO,MACC,OAAhC8hH,EAAoB7hH,UACtB6hH,EAAoB7hH,QC1La,IAAIsB,GAAU,CACjD00G,aAAc,CADmC,EAEjD1D,yBAAqBjzG,KD0LrB,IAAM8yG,EAAmB0P,EAAoB7hH,QAGvC8hH,EAAiB/hH,EAAOsoB,GAKxB05F,EAAehiH,EAAO,CAAE+wE,SAAAA,EAAUV,QAAAA,EAASqxC,eAAAA,EAAgBC,cAAAA,EAAeC,UAAAA,IAChFK,GAAgB,WACdD,EAAa/hH,QAAU,CAAE8wE,SAAAA,EAAUV,QAAAA,EAASqxC,eAAAA,EAAgBC,cAAAA,EAAeC,UAAAA,EAC5E,IAGD,IAAMM,EAAkBliH,EAAO85G,GAC/BmI,GAAgB,WAAQC,EAAgBjiH,QAAU65G,CAAc,IAK1DqI,IAAAA,EAAgBtzG,GAAY,SAAC4O,EAAQ2kG,GACwCJ,IAAAA,EAAAA,EAAa/hH,QAAvEoiH,IAAfV,cAAwCW,IAAhBZ,eAAoCa,IAAVxxC,SACpDyxC,EAAatjH,EAAMQ,WAErB2iH,GAASA,EAAQ5kG,GAEjB6kG,GACFA,EAAS,CACPrI,oBAAqBuI,EAAWvI,oBAChCzzG,UAAWiX,EAAOjX,UAClBC,OAAQgX,EAAOhX,OACfg6G,QAAS+B,EAAW/B,UAIpB2B,IAAiB3kG,EAAOjX,WAAa+7G,GACvCA,EAAS9kG,EAAO0iG,cAEnB,GAAE,CAACjhH,IAKEujH,EAAqBziH,EAAO,MAC5B0iH,GAAqB1iH,EAAO,MAO5B2iH,GAAoB9zG,EAAW,WAAA,IAAA+zG,EAAAzO,EAAAC,EAAA9vC,MAAC,SAAO7lC,EAAAA,EAASokF,EAAgBC,GAAhC,IAAAzO,EAAA0O,EAAAtD,EAAAuD,EAAAC,EAAAC,EAAAC,EAAAC,EAAA1C,EAAA2C,EAAAC,EAAAC,EAAAnB,EAAA,OAAAhO,EAAAjlE,MAAA,SAAA6nE,GAAA,OAAA,OAAAA,EAAAtC,KAAAsC,EAAAjwE,MAAA,KAAA,EAAA,GAEhC07E,EAAmBxiH,SACrBwiH,EAAmBxiH,QAAQ0O,QAE7B8zG,EAAmBxiH,QAAU,IAAIg3G,gBACzB5C,EAAWoO,EAAmBxiH,QAA9Bo0G,OAEF0O,EAAa9J,EAAU9sB,EAAQ1tD,GAC/BghF,EAAcvgH,EAAMQ,WAAWo2E,QACrCitC,EAAWjtC,QAAU0pC,GAAmBC,EAAasD,EAAWjtC,SAE3D2rC,EAZ+B,CAAAzK,EAAAjwE,KAAA,GAAA,KAAA,CAAA,OAa5Bq7E,EAAeljH,EAAMQ,WAAWu6G,oBACtC/6G,EAAMszG,SAANxwG,GAAAA,GAAA,CAAA,EACK+gH,GADL,GAAA,CAEEz6F,KAAMmW,EACNo9E,YAAagH,EACbnC,YAAa,GACbzG,qBAAqB,EACrBwG,QAASb,GAAeiD,MAE1BV,EAAcY,EAAYX,GAC1BK,EAAmBxiH,aAAUX,EAvBK03G,EAAAlC,OAAA,UAAA,KAAA,GAAA,GA2B9BmO,EACJjlH,OACG8S,QAAQ2wG,GACRr5G,KAAI,SAAAZ,GAAM,MAAA,CAAE2nB,KAAM3nB,EAAE,GAAIsB,KAAMtB,EAAE,GAA3B,IACL6E,QAAO,SAAAm3G,GAAA,IAAAC,EAAGt0F,IAAAA,KAAW,YAA4C7vB,KAA5C,QAAAmkH,EAAAV,EAAWjtC,QAAQ3mD,UAAnB,IAAAs0F,OAAA,EAAAA,EAA0BtD,cAAxC,IAGoB,IAA5B8C,EAAiB1lH,OAlCe,CAAAy5G,EAAAjwE,KAAA,GAAA,KAAA,CAAA,OAmC5Bq7E,EAAeljH,EAAMQ,WAAWu6G,oBACtC/6G,EAAMszG,SAANxwG,GAAAA,GAAA,CAAA,EACK+gH,GADL,GAAA,CAEEz6F,KAAMmW,EACNo9E,YAAagH,EACbnC,YAAaoC,GAAkB,GAC/B7I,qBAAqB,EACrBwG,QAASb,GAAeiD,MAE1BV,WAAmBY,GAAN,CAAA,EAAA,CAAkBrC,YAAaoC,GAAkB,KAAMV,GACpEK,EAAmBxiH,aAAUX,EA7CK03G,EAAAlC,OAAA,UAAA,KAAA,GA0DbhvF,OARjBq9F,QAA6BN,GACnCI,EAAiB9gH,SAAQ,SAAcuhH,GAAXv0F,IAAAA,IAAAA,KAC1Bg0F,EAAsBh0F,YAAag0F,EAAsBh0F,IAAzD,GAAA,CAAgEvoB,YAAY,GAC7E,IACD1H,EAAMszG,SAAS,CAAElqF,KAAMmW,EAASo9E,YAAasH,IAtDTnM,EAAAtC,KAAA,GAAAsC,EAAAjwE,KAAA,GA0DbjhB,QAAQ86B,IAC3BqiE,EAAiB76G,KAAI,SAAoBu7G,GAAjBx0F,IAAAA,IAAAA,KAAMrmB,IAAAA,KACxBurG,OAAAA,EAAOuP,QAAgB99F,QAAQ2a,SAAQ,GACvChC,EAAQtP,GACHmwF,GAAuBnwF,GAAM,WAAMrmB,OAAAA,EAAKqmB,EAAMsP,EAAQtP,GAAzB,IAE/BrJ,QAAQ2a,SAAQ,EALzB,KA3DgC,KAAA,GA0DlC2iF,EA1DkCpM,EAAApC,KAAAoC,EAAAjwE,KAAA,GAAA,MAAA,KAAA,GAoE9B,GApE8BiwE,EAAAtC,KAAA,GAAAsC,EAAAnC,GAAAmC,EAAA,MAAA,IAoEnB,eAAXA,EAAAnC,GAAE1uG,KApE4B,CAAA6wG,EAAAjwE,KAAA,GAAA,KAAA,CAAA,OAAAiwE,EAAAlC,OAAA,UAAA,KAAA,GAAA,MAAAkC,EAAAnC,GAAA,KAAA,GAwEhCR,IAAAA,EAAOuP,QAxEyB,CAAA5M,EAAAjwE,KAAA,GAAA,KAAA,CAAA,OAAAiwE,EAAAlC,OAAA,UAAA,KAAA,GA0E9B4L,EAAc0C,EAAa/2G,QAAO,SAAAy6E,GAAKA,OAAM,IAANA,CAAJ,IAGnCu8B,EA7E8BrhH,GAAA,CAAA,EA6ET+gH,EAAWjtC,SACtC4qC,EAAYv+G,SAAQ,SAAAqF,GAClB,IAAM82E,EAAK+kC,EAAc77G,EAAE2nB,MACvBmvD,IACFA,EAAG73E,OAAc63E,GAAAA,OAAAA,EAAAA,EAAG73E,QAAU,IAA9B,CAAmCe,IACnC82E,EAAG93E,WAAY,EACf83E,EAAG6hC,mBAAgB7gH,EAEtB,IAEKgkH,EAAmBP,GAAAA,OAAAA,EAAAA,EAAWt8G,UAAWi6G,IACzC6C,WACDR,GAzF+B,CAAA,EAAA,CA0FlCv8G,UAAW88G,EAAa/lH,OAAS,EACjCkJ,OAAQ68G,EACR5C,YAAAA,EACA5qC,QAASutC,IAGLjB,EAAeljH,EAAMQ,WAAWu6G,oBACtC/6G,EAAMszG,SAANxwG,GAAAA,GAAA,CAAA,EACKuhH,GADL,GAAA,CAEEj7F,KAAMmW,EACNo9E,YAAagH,EACb5I,qBAAqB,EACrBwG,QAASb,GAAeiD,MAE1BV,EAAcoB,EAAcnB,GAC5BK,EAAmBxiH,aAAUX,EAzGO,KAAA,GAAA,IAAA,MAAA,OAAA03G,EAAAjC,OAAA,GAAA4B,EAAA,KAAA,CAAA,CAAA,GAAA,KAAD,KAAA,OAAA,SAAAkN,EAAAC,EAAAC,GAAA,OAAAnB,EAAAt9G,MAAA5D,KAAArC,UAAA,CAAA,CAAA,GA0GlC,CAAC8sF,EAAQs1B,EAAiBviH,EAAOijH,IAO9B6B,GAAgBn1G,GAAY,SAAC4vB,EAASokF,EAAgBC,GAE1D5jH,EAAMszG,SAAS,CACblqF,KAAMmW,EACNo9E,YAAagH,EACbpC,QAASb,GAAeiD,KAItBH,GAAmBziH,SACrBgkH,qBAAqBvB,GAAmBziH,SAG1CyiH,GAAmBziH,QAAUikH,uBAAsB,WACjDxB,GAAmBziH,aAAUX,EAC7BqjH,GAAkBlkF,EAASokF,EAAgBC,EAC5C,GACF,GAAE,CAAC5jH,EAAOyjH,KAMLwB,GAAyBt1G,GAAY,SAAC4vB,EAASokF,EAAgBC,GAKnE,OAJIJ,GAAmBziH,UACrBgkH,qBAAqBvB,GAAmBziH,SACxCyiH,GAAmBziH,aAAUX,GAExBqjH,GAAkBlkF,EAASokF,EAAgBC,EACnD,GAAE,CAACH,KAKE9I,GAAoBhrG,GAAY,SAAArH,GACZA,IAAAA,EAAAA,EAAEkC,OAAlBvD,IAAAA,KAAMtG,IAAAA,MAC2DX,EAAAA,EAAMQ,WAAvEu6G,IAAAA,oBAA2BmK,IAAN97F,KAAeo4F,IAAAA,YAAa7E,IAAAA,YAEzD,IAAI5B,IAAuBiI,EAAgBjiH,QAA3C,CAEMwgH,IAAAA,EAAUsB,EAAe9hH,QAAQkG,KAAUtG,EAC3C4+B,EAAe2lF,GAAAA,GAAAA,CAAAA,EAAAA,WAAUj+G,EAAOtG,IAChCgjH,WACDhH,GADe,CAAA,EAAAxuG,EAAA,CAAA,EAEjBlH,EAAY01G,GAAAA,GAAAA,CAAAA,EAAAA,EAAY11G,IAFP,GAAA,CAEcU,MAAO45G,EAAShiD,OAAQgiD,MAEpDqC,EAAiBpC,EAAYr0G,QAAO,SAAAg4G,GAAcl1F,SAAXA,OAAoBhpB,CAAvB,IAE1C69G,GAAcvlF,EAASokF,EAAgBC,EAVa,CAWrD,GAAE,CAAC5jH,EAAO8kH,KAMLM,GAAoBz1G,GAAY,SAAA01G,GACqCrlH,IAAAA,EAAAA,EAAMQ,WAAvEu6G,IAAAA,oBAA2BmK,IAAN97F,KAAeo4F,IAAAA,YAAa7E,IAAAA,YAEzD,IAAI5B,IAAuBiI,EAAgBjiH,QAA3C,CAEA,IAAM6Q,EAAU9S,OAAO8S,QAAQyzG,GACzB9lF,EAAe2lF,GAAAA,CAAAA,EAAAA,GACfvB,EAAsBhH,GAAAA,CAAAA,EAAAA,GACtBzxF,EAAQ,GAEdtZ,EAAQ3O,SAAQ,SAAmBqiH,GAAA,IAAAC,EAAA7kH,EAAA4kH,EAAA,GAAjBr+G,EAAiBs+G,EAAA,GAAX5kH,EAAW4kH,EAAA,GAC3BhE,EAAUsB,EAAe9hH,QAAQkG,KAAUtG,EACjD4+B,EAAQt4B,GAAQtG,EAChBgjH,EAAe18G,YAAa08G,EAAe18G,IAA3C,GAAA,CAAkDU,MAAO45G,EAAShiD,OAAQgiD,IAC1Er2F,EAAMhlB,KAAKe,EACZ,IAED,IAAM28G,EAAiBpC,EAAYr0G,QAAO,SAAAq4G,GAAGv1F,IAAAA,IAAAA,KAAH,OAAe/E,EAAM1W,SAASyb,EAA9B,IAE1C60F,GAAcvlF,EAASokF,EAAgBC,EAhBa,CAiBrD,GAAE,CAAC5jH,EAAO8kH,KAKL9I,GAAcrsG,GAAY,SAAArH,GAC9B,IAAM2nB,EAAO3nB,EAAEkC,OAAOvD,KACtBjH,EAAMszG,UAAS,SAAAniB,GAAM,MAAA,CACnBwrB,YAAW75G,GAAAA,GAAA,CAAA,EACNquF,EAAEwrB,aADI,CAAA,EAAAxuG,EAAA,CAAA,EAER8hB,EAFQntB,GAAAA,GAAA,GAEIquF,EAAEwrB,YAAY1sF,IAFlB,GAAA,CAEyBixF,QAAQ,EAAME,UAAU,MAH9C,GAMjB,GAAE,CAACphH,IAEEi8G,GAAatsG,GAAY,SAAArH,GAC7B,IAAM2nB,EAAO3nB,EAAEkC,OAAOvD,KACtBjH,EAAMszG,UAAS,SAAAniB,GAAM,MAAA,CACnBwrB,YAAW75G,GAAAA,GAAA,CAAA,EACNquF,EAAEwrB,aADI,CAAA,EAAAxuG,EAAA,CAAA,EAER8hB,EAFQntB,GAAAA,GAAA,GAEIquF,EAAEwrB,YAAY1sF,IAFlB,GAAA,CAEyBixF,QAAQ,EAAOE,UAAU,EAAMD,SAAS,EAAME,UAAU,MAH9E,GAMjB,GAAE,CAACrhH,IAKEylH,GAAe91G,GAAY,WACI3P,IAAAA,EAAAA,EAAMQ,WAAjC8G,IAAAA,UAAWq1G,IAAAA,YACKyG,EAAaN,EAAa/hH,QAA1CyhH,eACJY,GACFA,EAAS,CACPrI,qBAAqB,EACrBzzG,UAAAA,EACAi6G,QAASb,GAAe/D,IAG7B,GAAE,CAAC38G,IAKE0lH,GAAe/1G,GAAY,WAC/BkzG,EAAe9hH,QAAUqoB,EACzBppB,EAAMszG,SAASqN,GAAe1zB,EAAQ7jE,EAAMy3F,IAC5C4E,IACD,GAAE,CAACr8F,EAAM6jE,EAAQ4zB,EAAe7gH,EAAOylH,KAKlCE,GAAoBh2G,GAAY,SAAAi2G,GACqC5lH,IAAAA,EAAAA,EAAMQ,WAAvEu6G,IAAAA,oBAA2BmK,IAAN97F,KAAeo4F,IAAAA,YAAa7E,IAAAA,YACzD,IAAI5B,IAAuBiI,EAAgBjiH,QAA3C,CAEMw+B,IAAAA,EAAe2lF,GAAAA,CAAAA,EAAAA,GACjBtB,EAAiB,GACfD,EAAsBhH,GAAAA,CAAAA,EAAAA,GAE5BiJ,EAAe3iH,SAAQ,SAAqB4iH,GAAlB5+G,IAAAA,IAAAA,KAAMtG,IAAAA,MAC1BqM,EAAarM,EAEbssF,EAAO1gD,WAAWtlC,IAA0C,YAAjCgmF,EAAO1gD,WAAWtlC,GAAMD,OACrDgG,GAA+B,IAAlBk4G,EAAQj+G,IAGjBs6G,IAAAA,EAAUsB,EAAe9hH,QAAQkG,KAAUtG,EACjDijH,EAAiBpC,EAAYr0G,QAAO,SAAA24G,GAAc71F,SAAXA,OAAoBhpB,CAAvB,IAA6BgG,OAAO22G,GACxED,EAAe18G,YAAa01G,EAAY11G,IAAxC,GAAA,CAA+CU,MAAO45G,EAAShiD,OAAQgiD,IACvEhiF,EAAQt4B,GAAQ+F,CACjB,IAEDi4G,GAAuB1lF,EAASokF,EAAgBC,EAnBI,CAFjB,GAsBlC,CAAC5jH,EAAOitF,EAAQg4B,KAKbc,GAAep2G,GAAY,WAC4C3P,IAAAA,EAAAA,EAAMQ,WAAzE+G,IAAAA,OAAQD,IAAAA,UAAiB0+G,IAAN58F,KAAmBo4F,IAAAA,YAAa7E,IAAAA,YACnCyG,EAAaN,EAAa/hH,QAA1CyhH,eAERxiH,EAAMszG,SAAS,CAAEyH,qBAAqB,IAEtC,IAAMwG,EAAUb,GAAe/D,GAC3ByG,GACFA,EAAS,CAAErI,qBAAqB,EAAMzzG,UAAAA,EAAWC,OAAAA,EAAQg6G,QAAAA,IAG3D0D,GAAuBe,EAAarJ,EAAa6E,EAClD,GAAE,CAACxhH,EAAOilH,KAKXjkH,GAAU,WAER,OADAykH,KACO,WACDjC,GAAmBziH,SAASgkH,qBAAqBvB,GAAmBziH,SAG/CmyG,IAAjB6D,EAAiB7D,EAAiB1yG,WAAlCu2G,aACRj4G,OAAOggB,OAAOi4F,GAAc9zG,SAAQ,SAAA+M,GACjB,WAAbA,EAAEonG,QAAuBpnG,EAAEinG,YAC7BjC,GAAoBhlG,EAAEinG,WAAY,CAAErsE,OAAQ,WAA5C,OAA8D,WAAM,GAEvE,IAE4D5qC,IAAAA,EAAAA,EAAMQ,WAA3D8G,IAAAA,UAAWi6G,IAAAA,QAAe0E,IAAN78F,KAAiBuzF,IAAAA,YAC1BuJ,EAAcpD,EAAa/hH,QAAtC2hH,UACJwD,GAAWA,EAAU,CAAE5+G,UAAAA,EAAWi6G,QAAAA,EAASn4F,KAAM68F,EAAWtJ,YAAAA,GACjE,CAhBM,GAiBN,IAKH,IAAMwJ,GAAcrlH,EAAOsoB,GAC3BpoB,GAAU,WACH0wC,GAAQy0E,GAAYplH,QAASqoB,KAChC+8F,GAAYplH,QAAUqoB,EACtBy5F,EAAe9hH,QAAUqoB,EACzBppB,EAAMszG,SAASqN,GAAe1zB,EAAQ7jE,EAAMy3F,IAC5C4E,KAEH,GAAE,CAACr8F,IAKJ,IAAMg9F,GAAmBtlH,EAAO+/G,GAChC7/G,GAAU,WACJ6/G,GAAAA,IAAkBnvE,GAAQmvE,EAAeuF,GAAiBrlH,SAAU,CACtEqlH,GAAiBrlH,QAAU8/G,EAErB+E,IAAAA,EAAiB9mH,OACpB8S,QAAQivG,GACR1zG,QAAO,SAAAk5G,GAAA,IAAAC,EAAA5lH,EAAA2lH,EAAA,GAAEjmC,EAAFkmC,EAAA,GAAA,OAAAA,EAAA,KAAkBH,GAAYplH,QAAQq/E,EAAtC,IACPl3E,KAAI,SAAAq9G,GAAA,IAAAC,EAAA9lH,EAAA6lH,EAAA,GAAoB,MAAA,CAAEt/G,KAAtBu/G,EAAA,GAA4B7lH,MAA5B6lH,EAAA,GAAA,IAEHZ,EAAevnH,OAAS,GAAGsnH,GAAkBC,EAClD,CACF,GAAE,CAAC/E,IAKE/+G,IAAAA,GAAMH,GAAQ,WAAO,MAAA,CACzBE,WAAYkkH,GACZhkH,UAAW,WAAQ2jH,KAAoB5C,EAAa/hH,QAAQowE,SAAS2xC,EAAa/hH,QAAQowE,SAFjE,EAGzBnvE,cAAe,SAACiF,EAAMtG,GAAP,OAAiBg6G,GAAkB,CAAEnwG,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAAA,IAH3C,EAIzBsB,eAAgBmjH,GAJC,GAKf,CAACW,GAAcL,GAAc/K,GAAmByK,KAK9C1K,GAAgB/4G,GAAQ,WACzBiyG,OAAAA,GAAAA,GAAAA,CAAAA,EAAAA,IACAwO,EAFyB,GAG1B,CAACA,IAKCqE,GAAe9kH,GAAQ,WAAO,MAAA,CAClC3B,MAAAA,EACA8B,IAAAA,GACAwL,GAAAA,EACA2/E,OAAAA,EACAwtB,aAAcA,GAAgB,CALI,EAMlCZ,cAAeA,GAAiB,CANE,EAOlCtqG,SAAUA,IAAY,EACtBgrG,aAAcA,GAAgB,WAC9B/1G,QAASA,GAAW,OACpBo2G,aAAcA,IAAgB,EAC9BF,cAAAA,GACAkB,UAAWA,GAAa,CAZU,EAalCC,WAAYA,GAAc,CAbQ,EAclCC,eAAgBA,GAAkB,CAdA,EAelCC,mBAAoBA,GAAsB,CAfR,EAgBlCC,YAAAA,GACAC,WAAAA,GACAtB,kBAAAA,GACAuB,eAAgBA,GAAkB,GAClCmG,eAAgBA,GAAkB,GApBP,GAqBzB,CACFriH,EAAO8B,GAAKwL,EAAI2/E,EAAQwtB,EAAcZ,EAAetqG,EACrDgrG,EAAc/1G,EAASo2G,EAAcF,GAAekB,EACpDC,EAAYC,EAAgBC,EAC5BC,GAAaC,GAAYtB,GACzBuB,EAAgBmG,IAMZ56G,GAAWzH,EAAMQ,WAAWu6G,qBAAuBH,EAEnD8L,GAAsBhM,GAAc5F,+BAGxC,OAAA/wG,EAAAM,cAACjD,GAAYm+G,SAAb,CAAsB5+G,MAAO8lH,IAC3B1iH,EAAAM,cAAClC,GAAmBo9G,SAApB,CAA6B5+G,MAAOuyG,GAClCnvG,EAAAM,cAAA,OAAA,CACEiJ,GAAIA,EACJ1H,UAAU,kBACV6B,SAAUA,GACVoqE,SAAU,SAAAvpE,GAAKA,OAAAA,EAAEq+G,gBAJnB,EAKEvyG,UAAW4tG,EAAgB,SAAA15G,GACX,UAAVA,EAAEnJ,KAAwC,aAArBmJ,EAAEkC,OAAO8jD,SAA2B7mD,KAC3Da,EAAEq+G,iBACFZ,KAEH,OAAG3lH,EACJ+wE,QAAS,SAAA7oE,GACPA,EAAEq+G,iBACFjB,KACI5C,EAAa/hH,QAAQowE,SAAS2xC,EAAa/hH,QAAQowE,SACxD,GAEA+wC,EAAaj1D,OAASlpD,EAAAM,cAAA,KAAA,KAAK69G,EAAaj1D,OACxCi1D,EAAajC,aAAel8G,EAAKm+G,cAAAA,KAAAA,KAAAA,EAAajC,aAE9CiC,EAAa0E,OAAO19G,KAAI,SAAiE29G,GAA1DjH,IAAAA,IAAJtyG,GAAe/J,IAAAA,MAAO08G,IAAAA,YAAatrD,IAAAA,OAAQqoD,IAAAA,aACrE,OAAIztG,GAAY/Q,MAAMC,QAAQ4jH,IAAmBA,EAAe7tG,SAASorG,GAChE77G,gBAAC8uG,GAAD,CAAY1zG,IAAqBygH,gBAAAA,OAAAA,GAAa9M,QAAQ,cAAcvvG,MAAOA,IAIlFQ,gBAAC47G,GAAD,CACExgH,IAAqBygH,gBAAAA,OAAAA,GACrBA,UAAWA,EACXr8G,MAAOA,EACPG,KAAMu8G,EACNtrD,OAAQA,EACRqoD,aAAcA,EACdv5G,aAAcq+G,EACdl+G,YAAam+G,EACbj+G,UAAWA,EACXuzB,OAAQ,GAhBb,IAqBA4qF,GACCl+G,gBAAC09G,GAAD,CACEzhH,MAAOA,EACP65G,cAAeA,GAAiB,CAFlC,EAGEY,aAAcA,GAAgB,CAAA,KAIpC12G,EAAAM,cAACqiH,GAAD,OAIP,EAED9E,GAAel9G,UAAY,CACzB4I,GAAI3I,EAAUC,OAAOwE,WACrB5E,QAASG,EAAUE,MAAM,CAAC,OAAQ,UAClC01G,aAAc51G,EAAUE,MAAM,CAAC,WAAY,SAAU,aACrDf,UAAWa,EAAUE,MAAM,CAAC,OAAQ,SAAU,UAC9Ci9G,kBAAmBn9G,EAAUE,MAAM,CACjC,KAAM,KAAM,KAAM,KAAM,KAAM,KAC9B,YAAa,YAAa,QAAS,QACnC,SAAU,UAAW,aAEvBk9G,iBAAkBp9G,EAAUE,MAAM,CAChC,KAAM,KAAM,KAAM,KAAM,KAAM,KAC9B,YAAa,YAAa,QAAS,QACnC,SAAU,UAAW,aAEvB4C,SAAU9C,EAAU4E,KACpBgG,SAAU5K,EAAU4E,KACpBy4G,cAAer9G,EAAU4E,KACzB04G,WAAYt9G,EAAU4E,KACtB0jF,OAAQtoF,EAAU0E,OAAOD,WACzBggB,KAAMzkB,EAAU0E,OAAOD,WACvBy3G,cAAel8G,EAAU0E,OACzBszG,YAAah4G,EAAU0E,OACvB64G,aAAcv9G,EAAU0E,OAAOD,WAC/BqxG,aAAc91G,EAAU0E,OAAOD,WAC/Bm5G,gBAAiB59G,EAAU0E,OAC3BwwG,cAAel1G,EAAU0E,OAEzB+4G,MAAOz9G,EAAU0E,OACjBuyG,UAAWj3G,EAAU0E,OACrBwyG,WAAYl3G,EAAU0E,OACtByyG,eAAgBn3G,EAAU0E,OAE1B0yG,mBAAoBp3G,EAAU0E,OAC9B6yG,eAAgBv3G,EAAU8E,MAC1B44G,eAAgB19G,EAAU8E,MAE1BooE,SAAUltE,EAAUiF,KACpBunE,QAASxsE,EAAUiF,KACnB44G,eAAgB79G,EAAUiF,KAC1B64G,cAAe99G,EAAUiF,KACzB84G,UAAW/9G,EAAUiF,ME1uBvB,uUCQA,IAAMk9G,GAAoB,SAWpBxjH,GAVJqE,IAAAA,IAAAA,MACAL,IAAAA,UACAE,IAAAA,SACAjE,IAAAA,MACA5C,IAAAA,MACA6D,IAAAA,QACSuiH,IAAT1/G,QACA2/G,IAAAA,YACAC,IAAAA,YACG16G,EACCrC,EAAA5G,EAAA6G,IACuC+8G,EDpBrB,SAAClhH,GAAKmhH,IAAAA,yDAAe,CAAA,EACrC/Q,EAAgBt1G,IAEQP,EAAAA,GAAS,GAAvCE,EAAAC,EAAAJ,EAAA,GAAOgK,EAAP7J,EAAA,GAAgB01G,EAAhB11G,EAAA,GACAwR,EAA8B1R,IAA9ByR,EAAAtR,EAAAuR,EAAA,GAAO5K,EAAP2K,EAAA,GAAgBo1G,EAAhBp1G,EAAA,GAEMxC,EAAQG,EAAYslG,EAAAC,EAAA9vC,MAAA,SAAA0wC,IAAA,IAAAuR,EAAAr3G,EAAA,OAAAklG,EAAAjlE,MAAA,SAAAslE,GAAA,OAAA,OAAAA,EAAAC,KAAAD,EAAA1tE,MAAA,KAAA,EAAA,IACpBrpC,MAAMC,QAAQuH,GADM,CAAAuvG,EAAA1tE,KAAA,EAAA,KAAA,CACOu/E,OAAAA,EAAAA,OAAAA,SAAAA,EAAWphH,IADlB,KAAA,EAEpB,GAAe,iBAARA,GAAmC,mBAARA,EAFd,CAAAuvG,EAAA1tE,KAAA,EAAA,KAAA,CAEyCu/E,OAAAA,EAAAA,OAAAA,SAAAA,EAAW,KAFpD,KAAA,EAAA,OAIpBC,EAAUrhH,EACK,iBAARA,IACTqhH,EAAU,SAAAlS,GAAUH,OAAAA,GAAoBhvG,EAAK,CAAEs+C,MAAO6iE,EAAa7iE,MAAO6wD,OAAAA,GAA1D,GAGlBiB,EAAcr1G,QAAU,IAAIg3G,gBAC5BqP,OAAWhnH,GACX+1G,GAAW,GAXaZ,EAAAC,KAAA,EAAAD,EAAA1tE,KAAA,GAcNw/E,EAAQjR,EAAcr1G,QAAQo0G,QAdxB,KAAA,GAAA,GAchBnlG,EAdgBulG,EAAAG,KAetBU,EAAcr1G,aAAUX,EAEnB5B,MAAMC,QAAQuR,GAjBG,CAAAulG,EAAA1tE,KAAA,GAAA,KAAA,CAAA,MAiBO,IAAInmC,MAAM,mDAjBjB,KAAA,GAmBtB0lH,EAAWp3G,GAnBWulG,EAAA1tE,KAAA,GAAA,MAAA,KAAA,GAAA0tE,EAAAC,KAAA,GAAAD,EAAAI,GAAAJ,EAAA,MAAA,GAqBtBY,GAAW,GArBW,KAAA,GAwBxBA,GAAW,GAxBa,KAAA,GAAA,IAAA,MAAA,OAAAZ,EAAAM,OAAA,GAAAC,EAAA,KAAA,CAAA,CAAA,EAAA,KAAD,KAyBtB,CAAC9vG,EAAKmhH,EAAa7iE,QAEhB70C,EAAQE,GAAY,WACpBrF,GAAS6rG,GAAW,GAEpBC,EAAcr1G,UAChBq1G,EAAcr1G,QAAQ0O,QACtB2mG,EAAcr1G,aAAUX,EAE3B,GAAE,CAACkK,IAEG,MAAA,CACLA,QAAAA,EACAkF,MAAAA,EACAC,MAAAA,EACApI,QAAAA,EAEH,CC5B4C6/G,CAAgBH,EAAY,CAAEziE,MAAO0iE,IAAxE18G,IAAAA,QAASkF,IAAAA,MAAOC,IAAAA,MAAOpI,IAAAA,QAI3B,OAFJrG,GAAU,WAAQwO,GAAT,GAAoB,IAExBnI,EA6BHtD,gBAAC4E,EAAD,CACElC,MAAOkB,GAASL,EAChBsB,OAAO,QACPC,WAHF,EAIErB,SAAUA,GAGRa,EACE4+G,mWADUnkH,CAAA,CAGRS,MAAAA,EACAoE,MAAAA,EACAhH,MAAAA,EACA6D,QAAAA,EACA8C,UAAAA,EACAE,SAAAA,EACA8C,QAAAA,EACAjD,QAASA,EAAQ6B,KAAI,SAAA+E,GAAM,MAAA,CACzBC,MAAOD,EAAEC,MACT3K,MAAO0K,EAAEC,MACTvN,MAAOsN,EAAEC,MACT0B,MAAO3B,EAAE2B,MAJW,IAMtBJ,MAAAA,EACAC,MAAAA,GACGlD,KApDTxI,gBAAC4E,EAAD,CACElC,MAAOkB,GAASL,EAChBsB,OAAO,QACPC,WAHF,EAIErB,SAAUA,GAEVzD,gBAAC8G,EAAD,CACEtH,MAAOA,EACPiB,QAASA,EACT7D,MAAOA,EACP8G,UAJF,EAKEyH,WAAY,CACVnH,aACEhE,EAAAM,cAAC2D,EAAD,CAAgBC,SAAS,OACvBlE,gBAACoL,EAAD,CACEC,KAAM,GACNC,UAAW,QA0C5B,EAEDy3G,GAAkBpiH,UAAY,CAC5BuC,KAAMtC,EAAUC,OAChBrB,MAAOoB,EAAUC,OACjBjE,MAAOgE,EAAUwE,IACjB9B,QAAS1C,EAAU2E,UAAU,CAC3B3E,EAAU8E,MACV9E,EAAUC,OACVD,EAAUiF,OACTR,WACH49G,YAAariH,EAAUC,OACvB2I,YAAa5I,EAAU4E,KACvB/E,QAASG,EAAUE,MAAM,CAAC,WAAY,SAAU,aAChD2C,SAAU7C,EAAU4E,KACpB9B,SAAU9C,EAAU4E,KACpBgG,SAAU5K,EAAU4E,KACpB5B,MAAOhD,EAAU4E,KACjBjC,UAAW3C,EAAU4E,KACrBhC,OAAQ5C,EAAU8E,MAClB7B,SAAUjD,EAAUiF,KACpBq9G,YAAatiH,EAAU2iH,aC1FzB,IAAMliH,GAAYC,GAAW,SAAAC,GAAU,MAAA,CAC5BiB,QAAA,CACPqC,OAAQ,EACR2+G,WAAY,OACG,cAAA,CACbppC,OAAQ,YAGZqpC,WAAY,CAAEv0G,aAAc,GAC5Bw0G,mBAAoB,CAClB7+G,QAA6B,EAApBtD,EAAMG,QAAQ,GACvBq0F,QAASx0F,EAAMG,QAAQ,IAEzBiiH,iBAAkB,CAChBC,aAAkC,EAApBriH,EAAMG,QAAQ,GAC5BmiH,YAAiC,EAApBtiH,EAAMG,QAAQ,GAC3Bq0F,QAASx0F,EAAMG,QAAQ,GACR,cAAA,CACboiH,UAAWviH,EAAMG,QAAQ,GACzBD,aAAcF,EAAMG,QAAQ,IAC5BqiH,WAAYxiH,EAAMG,QAAQ,KAC1BsiH,aAAcziH,EAAMG,QAAQ,GAC5BuiH,cAAe1iH,EAAMG,QAAQ,KAC7BwiH,YAAa3iH,EAAMG,QAAQ,KAG/BwL,QAAS,CAAEi3G,gBAAiBC,GAAM7iH,EAAMqB,QAAQisG,QAAQhsG,KAAM,MAC9DwhH,UAAW,CAAEF,gBAAiB5iH,EAAMqB,QAAQqM,KAAK,MA3BjB,IAiC5Bq1G,GAAoB,SAUpB/kH,GAAA,IAAAglH,EATJvhH,IAAAA,YACAwhH,IAAAA,SACAthH,IAAAA,KACAtG,IAAAA,MACAyG,IAAAA,aACAQ,IAAAA,SACA2H,IAAAA,SACAi5G,IAAAA,aACAC,IAAAA,eAEM9iH,EAASP,KACTE,EAAQojH,IAcRz3G,EA5BU,SAACtQ,EAAOyG,GAAkBoB,OADX,KAAfkI,EACoC/P,KADJ,IAAR+P,EACqB/P,EAASyG,IAAgB,EADtE,IAAAsJ,CACA,CA4BAD,CAAU9P,EAAOyG,GAEjC,OACErD,gBAACiB,EAAD,CACEC,UAAW,EACXW,UACEmD,GACEpD,EADA,SAAA2iH,EAAA,CAGEK,WAAYp5G,GAHdpB,EAAAm6G,EAIG3iH,EAAO8hH,mBAAqBc,GAA4B,SAAhBxhH,GACxCpB,EAAAA,EAAAA,EAAO+hH,kBAAoBa,GAA4B,SAAhBxhH,GACvCpB,EAAAA,EAAAA,EAAO6hH,YAAce,GANxBp6G,EAAAm6G,EAOG3iH,EAAOsL,QAAUA,OACjBtL,EAAOyiH,WAAan3G,GAX7Bq3G,IAeE/2G,QAzBuB,WACpBhC,GAEH3H,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,OADTA,IAGrB,GAsBGoD,gBAACC,EAAD,CACEG,QAAQ,OACRC,cAAc,MACdgH,eAAgBmE,EAAW,aAAe,gBAC1ClE,WAAW,UAGRkE,GAAY0B,GAETlN,gBAACC,EAAD,CACEuH,GAAI,EACJjH,IAAK,IAELP,gBAAC6kH,EAAD,CACEx1G,SAAUm1G,EAAW,QAAU,SAC/BM,UAAWvjH,EAAMqB,QAAQuM,KAAKC,aAMrC5D,IAAa0B,GAEVlN,gBAACC,EAAD,CACEuH,GAAI,EACJjH,IAAK,IAELP,gBAAC+kH,EAAD,CACE11G,SAAUm1G,EAAW,QAAU,SAC/BM,UAAWvjH,EAAMqB,QAAQuM,KAAKC,aAMtClC,GAEIlN,gBAACQ,EAAD,CACEC,QAAS+jH,EAAW,KAAO,QAC3B7hH,MAAQ6I,EAAuB,gBAAZ,WAElBi5G,IAKNv3G,GAEGlN,gBAACQ,EAAD,CACEC,QAAS+jH,EAAW,KAAO,QAC3B7hH,MAAM,iBAEL+hH,IAKNl5G,GAEGxL,gBAAC2N,EAAD,CACEhL,MAAM,UACNO,KAAMA,EACNgK,QAASA,EACTrJ,SA/FO,SAAAU,GACnB,IAAMnH,EAAWmH,EAAEkC,OAAOyG,QAC1BrJ,EAAS,CAAE4C,OAAQ,CAAEvD,KAAAA,EAAMtG,MAAOQ,IACnC,KAmGF,EAEDknH,GAAkB3jH,UAAY,CAC5BqC,YAAapC,EAAUE,MAAM,CAAC,QAAS,SAASuE,WAChDm/G,SAAU5jH,EAAU4E,KACpBtC,KAAMtC,EAAUC,OAAOwE,WACvBzI,MAAOgE,EAAU4E,KACjBnC,aAAczC,EAAU4E,KACxB3B,SAAUjD,EAAUiF,KAAKR,WACzBmG,SAAU5K,EAAU4E,KACpBi/G,aAAc7jH,EAAUC,OAAOwE,WAC/Bq/G,eAAgB9jH,EAAUC,OAAOwE"}