diff --git a/packages/app/package.json b/packages/app/package.json index be53bf714..2457e517c 100644 --- a/packages/app/package.json +++ b/packages/app/package.json @@ -38,11 +38,11 @@ "dependencies": { "@babel/plugin-transform-typescript": "^7.14.6", "@babel/runtime": "^7.7.7", - "@tarojs/cli": "3.3.1", - "@tarojs/components": "3.3.1", - "@tarojs/react": "3.3.1", - "@tarojs/runtime": "3.3.1", - "@tarojs/taro": "3.3.1", + "@tarojs/cli": "3.3.6", + "@tarojs/components": "3.3.6", + "@tarojs/react": "3.3.6", + "@tarojs/runtime": "3.3.6", + "@tarojs/taro": "3.3.6", "ahooks": "^2.10.8", "axios": "^0.21.1", "axios-miniprogram-adapter": "^0.3.2", @@ -55,16 +55,16 @@ }, "devDependencies": { "@babel/core": "^7.8.0", - "@tarojs/mini-runner": "3.3.1", - "@tarojs/webpack-runner": "3.3.1", + "@tarojs/mini-runner": "3.3.6", + "@tarojs/webpack-runner": "3.3.6", "@types/react": "^17.0.2", "@types/webpack-env": "^1.13.6", "@typescript-eslint/eslint-plugin": "^4.15.1", "@typescript-eslint/parser": "^4.15.1", - "babel-preset-taro": "3.3.1", + "babel-preset-taro": "3.3.6", "cross-env": "^7.0.3", "eslint": "^6.8.0", - "eslint-config-taro": "3.3.1", + "eslint-config-taro": "3.3.6", "eslint-plugin-import": "^2.12.0", "eslint-plugin-react": "^7.8.2", "eslint-plugin-react-hooks": "^4.2.0", diff --git a/packages/app/src/pages/panel/index.config.ts b/packages/app/src/pages/panel/index.config.ts index 4f2880fa9..7afcd1160 100644 --- a/packages/app/src/pages/panel/index.config.ts +++ b/packages/app/src/pages/panel/index.config.ts @@ -1,3 +1,3 @@ export default { - navigationBarTitleText: 'taro-hooks', + navigationBarTitleText: 'Taro-hooks', }; diff --git a/packages/app/src/pages/panel/index.tsx b/packages/app/src/pages/panel/index.tsx index c7125c520..2431cd551 100644 --- a/packages/app/src/pages/panel/index.tsx +++ b/packages/app/src/pages/panel/index.tsx @@ -3,7 +3,7 @@ import { View, Text } from '@tarojs/components'; import { AtIcon } from 'taro-ui'; import { Current, navigateTo } from '@tarojs/taro'; -import { useModal } from 'taro-hooks'; +import { useModal, useNavigationBar } from 'taro-hooks'; import { List, @@ -20,6 +20,7 @@ const Panel = ({}: IPanelProps) => { const [panelInfo, setPanelInfo] = useState(); const [panelItemInfo, setPanelItemInfo] = useState(); const [show] = useModal({ mask: true, title: '温馨提示', showCancel: false }); + const [_, { setTitle }] = useNavigationBar({ title: 'Taro-hooks' }); useEffect(() => { const { id } = Current.router?.params || {}; @@ -31,6 +32,12 @@ const Panel = ({}: IPanelProps) => { } }, []); + useEffect(() => { + if (panelInfo && panelInfo.title) { + setTitle(panelInfo.title); + } + }, [panelInfo, setTitle]); + const handleItemAction = useCallback( (id: string) => { if (BUILD_MODE && id === 'useVideo') { diff --git a/packages/app/src/pages/useBrightness/index.less b/packages/app/src/pages/useBrightness/index.less new file mode 100644 index 000000000..d49ec70ca --- /dev/null +++ b/packages/app/src/pages/useBrightness/index.less @@ -0,0 +1,3 @@ +.taro-hooks-bri-padding { + padding: 10px 30px; +} diff --git a/packages/app/src/pages/useBrightness/index.tsx b/packages/app/src/pages/useBrightness/index.tsx index 392c445d0..306e1ac88 100644 --- a/packages/app/src/pages/useBrightness/index.tsx +++ b/packages/app/src/pages/useBrightness/index.tsx @@ -2,21 +2,30 @@ import React from 'react'; import { AtProgress, AtSlider } from 'taro-ui'; import DocPage from '@components/DocPage'; import { View } from '@tarojs/components'; +import { ENV_TYPE } from '@tarojs/taro'; -import { useBrightness } from 'taro-hooks'; +import { useBrightness, useEnv } from 'taro-hooks'; + +import './index.less'; export default () => { const [brightness, setBrightness] = useBrightness(true); + const env = useEnv(); + return ( 当前亮度 - + 设置亮度 setBrightness(value.toFixed(1))} > diff --git a/packages/app/src/pages/useLaunchOptions/index.tsx b/packages/app/src/pages/useLaunchOptions/index.tsx index 137da24f2..68ebeff8c 100644 --- a/packages/app/src/pages/useLaunchOptions/index.tsx +++ b/packages/app/src/pages/useLaunchOptions/index.tsx @@ -37,7 +37,7 @@ export default () => { <> 请尝试从不同场景打开小程序观察参数变化 - {env !== ENV_TYPE.WEAPP && '改hook仅可在小程序中使用'} + {env !== ENV_TYPE.WEAPP && '该hook仅可在小程序中使用'} ; +export declare function getTemplateContent(ctx: Ctx): string | undefined; diff --git a/packages/taro-runtime/dist/dom-external/node-impl.d.ts b/packages/taro-runtime/dist/dom-external/node-impl.d.ts index 22bfbed23..07fb83753 100644 --- a/packages/taro-runtime/dist/dom-external/node-impl.d.ts +++ b/packages/taro-runtime/dist/dom-external/node-impl.d.ts @@ -1,21 +1,7 @@ import { InstanceNamedFactory } from '../interface'; import type { Ctx, GetDoc } from '../interface'; -import type { setInnerHTML } from '../dom-external/inner-html/html'; -import type { insertAdjacentHTMLImpl } from './node'; -declare type SetInnerHTML = typeof setInnerHTML; -declare type InsertAdjacentHTMLImpl = typeof insertAdjacentHTMLImpl; export declare class TaroNodeImpl { - ctx: Ctx; getDoc: GetDoc; - innerHTMLImpl: SetInnerHTML; - adjacentImpl: InsertAdjacentHTMLImpl; - constructor( // eslint-disable-next-line @typescript-eslint/indent - getElement: InstanceNamedFactory, - innerHTMLImpl: SetInnerHTML, - adjacentImpl: InsertAdjacentHTMLImpl, - ); + constructor(getElement: InstanceNamedFactory); // eslint-disable-next-line @typescript-eslint/indent bind(ctx: Ctx): void; - private bindInnerHTML; - private bindAdjacentHTML; } -export {}; diff --git a/packages/taro-runtime/dist/dom-external/node.d.ts b/packages/taro-runtime/dist/dom-external/node.d.ts index 27d7b5a5b..663e86072 100644 --- a/packages/taro-runtime/dist/dom-external/node.d.ts +++ b/packages/taro-runtime/dist/dom-external/node.d.ts @@ -1,4 +1,5 @@ import { GetDoc } from '../interface'; +import type { Ctx } from '../interface'; export declare type IPosition = | 'beforebegin' | 'afterbegin' @@ -13,3 +14,4 @@ export declare function insertAdjacentHTMLImpl( html: string, getDoc: GetDoc, ): void; +export declare function cloneNode(ctx: Ctx, getDoc: any, isDeep?: boolean): any; diff --git a/packages/taro-runtime/dist/dom/document.d.ts b/packages/taro-runtime/dist/dom/document.d.ts index 6389cc379..c2cccc08a 100644 --- a/packages/taro-runtime/dist/dom/document.d.ts +++ b/packages/taro-runtime/dist/dom/document.d.ts @@ -25,5 +25,6 @@ export declare class TaroDocument extends TaroElement { id: string | undefined | null, ): T | null; querySelector(query: string): T | null; + querySelectorAll(): never[]; createComment(): TaroText; } diff --git a/packages/taro-runtime/dist/dom/node.d.ts b/packages/taro-runtime/dist/dom/node.d.ts index 971ad016d..d0d3c828a 100644 --- a/packages/taro-runtime/dist/dom/node.d.ts +++ b/packages/taro-runtime/dist/dom/node.d.ts @@ -1,6 +1,7 @@ import { NodeType } from './node_types'; import { TaroEventTarget } from './event-target'; import type { UpdatePayload, InstanceNamedFactory } from '../interface'; +import type { TaroDocument } from './document'; import type { TaroRootElement } from './root'; import type { TaroElement } from './element'; import type { TaroNodeImpl } from '../dom-external/node-impl'; @@ -46,10 +47,10 @@ export declare class TaroNode extends TaroEventTarget { remove(isReplace?: boolean): void; hasChildNodes(): boolean; enqueueUpdate(payload: UpdatePayload): void; - cloneNode(isDeep?: boolean): any; contains( node: TaroNode & { id?: string; }, ): boolean; + get ownerDocument(): TaroDocument; } diff --git a/packages/taro-runtime/dist/dom/root.d.ts b/packages/taro-runtime/dist/dom/root.d.ts index b8d8e17e1..08a522258 100644 --- a/packages/taro-runtime/dist/dom/root.d.ts +++ b/packages/taro-runtime/dist/dom/root.d.ts @@ -10,11 +10,11 @@ import type { TaroElementImpl } from '../dom-external/element-impl'; import type { Hooks } from '../hooks'; import type { Events } from '../emitter/emitter'; export declare class TaroRootElement extends TaroElement { - private pendingUpdate; private pendingFlush; private updatePayloads; private updateCallbacks; private eventCenter; + pendingUpdate: boolean; ctx: null | MpInstance; constructor( // eslint-disable-next-line @typescript-eslint/indent nodeImpl: TaroNodeImpl, diff --git a/packages/taro-runtime/dist/dsl/instance.d.ts b/packages/taro-runtime/dist/dsl/instance.d.ts index a8d312ec5..8674f92ed 100644 --- a/packages/taro-runtime/dist/dsl/instance.d.ts +++ b/packages/taro-runtime/dist/dsl/instance.d.ts @@ -2,7 +2,7 @@ import type { Component, ComponentClass } from 'react'; import VueCtor, { ComponentOptions, VNode } from 'vue'; import type { Component as Vue3Component } from '@vue/runtime-core'; import type { CombinedVueInstance } from 'vue/types/vue'; -import type { MpEvent } from '../interface'; +import type { Func, MpEvent } from '../interface'; import type { TaroElement } from '../dom/element'; export interface Instance> extends Component, @@ -68,7 +68,7 @@ export interface PageLifeCycle extends Show { onShareTimeline?(): void; onAddToFavorites?(): void; eh?(event: MpEvent): void; - onLoad(options: Record): void; + onLoad(options: Record, cb?: Func): void; onUnload(): void; } export interface PageInstance extends PageLifeCycle { diff --git a/packages/taro-runtime/dist/hooks.d.ts b/packages/taro-runtime/dist/hooks.d.ts index 9fe72d383..6284e6103 100644 --- a/packages/taro-runtime/dist/hooks.d.ts +++ b/packages/taro-runtime/dist/hooks.d.ts @@ -16,6 +16,7 @@ import type { ModifyRmAttrPayload, MpEvent, OnAddEvent, + patchElement, } from './interface'; import type { TaroElement } from './dom/element'; import type { TaroEvent } from './dom/event'; @@ -40,4 +41,6 @@ export declare class Hooks implements IHooks { modifyTaroEvent(e: TaroEvent, element: TaroElement): void; initNativeApiImpls?: InitNativeApi[]; initNativeApi(taro: Record): void; + patchElementImpls?: patchElement[]; + patchElement(element: TaroElement): void; } diff --git a/packages/taro-runtime/dist/index.d.ts b/packages/taro-runtime/dist/index.d.ts index adb1630d2..98a404067 100644 --- a/packages/taro-runtime/dist/index.d.ts +++ b/packages/taro-runtime/dist/index.d.ts @@ -4,11 +4,13 @@ export { TaroText } from './dom/text'; export { TaroElement } from './dom/element'; export { TaroRootElement } from './dom/root'; export { FormElement } from './dom/form'; +export { SVGElement } from './dom/svg'; export { TaroEvent, createEvent } from './dom/event'; export { createDocument, document } from './bom/document'; export { window } from './bom/window'; export { navigator } from './bom/navigator'; export { default as container } from './container'; +export { default as processPluginHooks } from './container/plugin-hooks'; export { default as SERVICE_IDENTIFIER } from './constants/identifiers'; export { connectReactPage, diff --git a/packages/taro-runtime/dist/interface/hooks.d.ts b/packages/taro-runtime/dist/interface/hooks.d.ts index 335226ecc..392fa9877 100644 --- a/packages/taro-runtime/dist/interface/hooks.d.ts +++ b/packages/taro-runtime/dist/interface/hooks.d.ts @@ -59,6 +59,9 @@ export interface ModifyRmAttrPayload { export interface OnAddEvent { (type: string, handler: EventHandler, options: any, node: T): void; } +export interface patchElement { + (node: TaroElement): void; +} export interface IHooks { /** 解决 React 生命周期名称的兼容问题 */ getLifecycle: GetLifecycle; @@ -88,7 +91,10 @@ export interface IHooks { createPullDownComponent?: CreatePullDownComponent; /** H5 获取原生 DOM 对象 */ getDOMNode?: GetDOMNode; - /** 挂载属性或 API 到 Taro 对象上 */ + /** + * @multi-inject + * 挂载属性或 API 到 Taro 对象上 + **/ initNativeApi?: InitNativeApi; /** * @todo: mutiInject @@ -110,5 +116,10 @@ export interface IHooks { * 调用 addEventListener 时触发 **/ onAddEvent?: OnAddEvent; + /** + * @todo: mutiInject + * 给 TaroElement 实例注入属性或方法 + **/ + patchElement?: patchElement; } export {}; diff --git a/packages/taro-runtime/dist/runtime.esm.js b/packages/taro-runtime/dist/runtime.esm.js index cc7f0ec20..73835a1bd 100644 --- a/packages/taro-runtime/dist/runtime.esm.js +++ b/packages/taro-runtime/dist/runtime.esm.js @@ -2,8 +2,8 @@ import { injectable, inject, optional, - ContainerModule, multiInject, + ContainerModule, Container, } from 'inversify'; import { @@ -17,13 +17,12 @@ import { isString, EMPTY_OBJ, isFunction as isFunction$1, - controlledComponent, internalComponents, + controlledComponent, defaultReconciler, noop, isBoolean, } from '@tarojs/shared'; -import React from 'react'; /*! ***************************************************************************** Copyright (C) Microsoft. All rights reserved. @@ -1224,18 +1223,18 @@ if (process.env.TARO_ENV === 'h5') { } /*! ***************************************************************************** -Copyright (c) Microsoft Corporation. - -Permission to use, copy, modify, and/or distribute this software for any -purpose with or without fee is hereby granted. - -THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH -REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY -AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, -INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM -LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR -OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR -PERFORMANCE OF THIS SOFTWARE. +Copyright (c) Microsoft Corporation. All rights reserved. +Licensed under the Apache License, Version 2.0 (the "License"); you may not use +this file except in compliance with the License. You may obtain a copy of the +License at http://www.apache.org/licenses/LICENSE-2.0 + +THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY +KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED +WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE, +MERCHANTABLITY OR NON-INFRINGEMENT. + +See the Apache Version 2.0 License for specific language governing permissions +and limitations under the License. ***************************************************************************** */ function __decorate(decorators, target, key, desc) { @@ -1274,9 +1273,6 @@ const SERVICE_IDENTIFIER = { TaroTextFactory: 'Factory', TaroNodeImpl: 'TaroNodeImpl', TaroElementImpl: 'TaroElementImpl', - InnerHTMLImpl: 'InnerHTMLImpl', - insertAdjacentHTMLImpl: 'insertAdjacentHTMLImpl', - getBoundingClientRectImpl: 'getBoundingClientRectImpl', Hooks: 'hooks', onRemoveAttribute: 'onRemoveAttribute', getLifecycle: 'getLifecycle', @@ -1296,6 +1292,7 @@ const SERVICE_IDENTIFIER = { modifySetAttrPayload: 'modifySetAttrPayload', modifyRmAttrPayload: 'modifyRmAttrPayload', onAddEvent: 'onAddEvent', + patchElement: 'patchElement', }; const PROPERTY_THRESHOLD = 2046; @@ -1309,6 +1306,7 @@ const BODY = 'body'; const APP = 'app'; const CONTAINER = 'container'; const DOCUMENT_ELEMENT_NAME = '#document'; +const DOCUMENT_FRAGMENT = 'document-fragment'; const ID = 'id'; const UID = 'uid'; const CLASS = 'class'; @@ -1509,7 +1507,7 @@ function hydrate(node) { if ( nodeName === VIEW && propInCamelCase === CATCHMOVE && - props[prop] !== 'false' + props[prop] !== false ) { data['nn' /* NodeName */] = CATCH_VIEW; } @@ -1644,6 +1642,13 @@ let TaroNode = class TaroNode extends TaroEventTarget { } } insertBefore(newChild, refChild, isReplace) { + if (newChild.nodeName === DOCUMENT_FRAGMENT) { + newChild.childNodes.reduceRight((previousValue, currentValue) => { + this.insertBefore(currentValue, previousValue); + return currentValue; + }, refChild); + return newChild; + } newChild.remove(); newChild.parentNode = this; let payload; @@ -1658,7 +1663,12 @@ let TaroNode = class TaroNode extends TaroEventTarget { } else { payload = { path: `${this._path}.${'cn' /* Childnodes */}`, - value: () => this.childNodes.map(hydrate), + value: () => { + const childNodes = this.childNodes.filter( + (node) => !isComment(node), + ); + return childNodes.map(hydrate); + }, }; } } else { @@ -1690,7 +1700,10 @@ let TaroNode = class TaroNode extends TaroEventTarget { if (!isReplace) { this.enqueueUpdate({ path: `${this._path}.${'cn' /* Childnodes */}`, - value: () => this.childNodes.map(hydrate), + value: () => { + const childNodes = this.childNodes.filter((node) => !isComment(node)); + return childNodes.map(hydrate); + }, }); } child.parentNode = null; @@ -1714,32 +1727,6 @@ let TaroNode = class TaroNode extends TaroEventTarget { ? void 0 : _a.enqueueUpdate(payload); } - cloneNode(isDeep = false) { - const document = this._getElement(ElementNames.Document)(); - let newNode; - if (this.nodeType === 1 /* ELEMENT_NODE */) { - newNode = document.createElement(this.nodeName); - } else if (this.nodeType === 3 /* TEXT_NODE */) { - newNode = document.createTextNode(''); - } - for (const key in this) { - const value = this[key]; - if ([PROPS, DATASET].includes(key) && typeof value === OBJECT) { - newNode[key] = Object.assign({}, value); - } else if (key === '_value') { - newNode[key] = value; - } else if (key === STYLE) { - newNode.style._value = Object.assign({}, value._value); - newNode.style._usedStyleProp = new Set( - Array.from(value._usedStyleProp), - ); - } - } - if (isDeep) { - newNode.childNodes = this.childNodes.map((node) => node.cloneNode(true)); - } - return newNode; - } contains(node) { let isContains = false; this.childNodes.some((childNode) => { @@ -1751,6 +1738,10 @@ let TaroNode = class TaroNode extends TaroEventTarget { }); return isContains; } + get ownerDocument() { + const document = this._getElement(ElementNames.Document)(); + return document; + } }; TaroNode = __decorate( [ @@ -2311,6 +2302,7 @@ let TaroElement = class TaroElement extends TaroNode { elementImpl.bind(this); this.nodeType = 1 /* ELEMENT_NODE */; this.style = new Style(this); + hooks.patchElement(this); } _stopPropagation(event) { // eslint-disable-next-line @typescript-eslint/no-this-alias @@ -2419,12 +2411,25 @@ let TaroElement = class TaroElement extends TaroNode { ? void 0 : _b.call(_a, this, qualifiedName, payload); this.enqueueUpdate(payload); - // pure-view => static-view - if (isPureView && isHasExtractProp(this)) { - this.enqueueUpdate({ - path: `${this._path}.${'nn' /* NodeName */}`, - value: STATIC_VIEW, - }); + if (this.nodeName === VIEW) { + if (toCamelCase(qualifiedName) === CATCHMOVE) { + // catchMove = true: catch-view + // catchMove = false: view or static-view + this.enqueueUpdate({ + path: `${this._path}.${'nn' /* NodeName */}`, + value: value + ? CATCH_VIEW + : this.isAnyEventBinded() + ? VIEW + : STATIC_VIEW, + }); + } else if (isPureView && isHasExtractProp(this)) { + // pure-view => static-view + this.enqueueUpdate({ + path: `${this._path}.${'nn' /* NodeName */}`, + value: STATIC_VIEW, + }); + } } } removeAttribute(qualifiedName) { @@ -2457,12 +2462,24 @@ let TaroElement = class TaroElement extends TaroNode { ? void 0 : _d.call(_c, this, qualifiedName, payload); this.enqueueUpdate(payload); - // static-view => pure-view - if (isStaticView && !isHasExtractProp(this)) { - this.enqueueUpdate({ - path: `${this._path}.${'nn' /* NodeName */}`, - value: PURE_VIEW, - }); + if (this.nodeName === VIEW) { + if (toCamelCase(qualifiedName) === CATCHMOVE) { + // catch-view => view or static-view or pure-view + this.enqueueUpdate({ + path: `${this._path}.${'nn' /* NodeName */}`, + value: this.isAnyEventBinded() + ? VIEW + : isHasExtractProp(this) + ? STATIC_VIEW + : PURE_VIEW, + }); + } else if (isStaticView && !isHasExtractProp(this)) { + // static-view => pure-view + this.enqueueUpdate({ + path: `${this._path}.${'nn' /* NodeName */}`, + value: PURE_VIEW, + }); + } } } getAttribute(qualifiedName) { @@ -2585,20 +2602,20 @@ var root = freeGlobal || freeSelf || Function('return this')(); var Symbol$1 = root.Symbol; /** Used for built-in method references. */ -var objectProto$4 = Object.prototype; +var objectProto = Object.prototype; /** Used to check objects for own properties. */ -var hasOwnProperty$3 = objectProto$4.hasOwnProperty; +var hasOwnProperty = objectProto.hasOwnProperty; /** * Used to resolve the * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) * of values. */ -var nativeObjectToString$1 = objectProto$4.toString; +var nativeObjectToString = objectProto.toString; /** Built-in value references. */ -var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined; +var symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined; /** * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values. @@ -2608,34 +2625,34 @@ var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined; * @returns {string} Returns the raw `toStringTag`. */ function getRawTag(value) { - var isOwn = hasOwnProperty$3.call(value, symToStringTag$1), - tag = value[symToStringTag$1]; + var isOwn = hasOwnProperty.call(value, symToStringTag), + tag = value[symToStringTag]; try { - value[symToStringTag$1] = undefined; + value[symToStringTag] = undefined; var unmasked = true; } catch (e) {} - var result = nativeObjectToString$1.call(value); + var result = nativeObjectToString.call(value); if (unmasked) { if (isOwn) { - value[symToStringTag$1] = tag; + value[symToStringTag] = tag; } else { - delete value[symToStringTag$1]; + delete value[symToStringTag]; } } return result; } /** Used for built-in method references. */ -var objectProto$3 = Object.prototype; +var objectProto$1 = Object.prototype; /** * Used to resolve the * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) * of values. */ -var nativeObjectToString = objectProto$3.toString; +var nativeObjectToString$1 = objectProto$1.toString; /** * Converts `value` to a string using `Object.prototype.toString`. @@ -2645,7 +2662,7 @@ var nativeObjectToString = objectProto$3.toString; * @returns {string} Returns the converted string. */ function objectToString(value) { - return nativeObjectToString.call(value); + return nativeObjectToString$1.call(value); } /** `Object#toString` result references. */ @@ -2653,7 +2670,7 @@ var nullTag = '[object Null]', undefinedTag = '[object Undefined]'; /** Built-in value references. */ -var symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined; +var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined; /** * The base implementation of `getTag` without fallbacks for buggy environments. @@ -2666,7 +2683,7 @@ function baseGetTag(value) { if (value == null) { return value === undefined ? undefinedTag : nullTag; } - return symToStringTag && symToStringTag in Object(value) + return symToStringTag$1 && symToStringTag$1 in Object(value) ? getRawTag(value) : objectToString(value); } @@ -2845,10 +2862,10 @@ function isMasked(func) { } /** Used for built-in method references. */ -var funcProto$1 = Function.prototype; +var funcProto = Function.prototype; /** Used to resolve the decompiled source of functions. */ -var funcToString$1 = funcProto$1.toString; +var funcToString = funcProto.toString; /** * Converts `func` to its source code. @@ -2860,7 +2877,7 @@ var funcToString$1 = funcProto$1.toString; function toSource(func) { if (func != null) { try { - return funcToString$1.call(func); + return funcToString.call(func); } catch (e) {} try { return func + ''; @@ -2879,20 +2896,20 @@ var reRegExpChar = /[\\^$.*+?()[\]{}|]/g; var reIsHostCtor = /^\[object .+?Constructor\]$/; /** Used for built-in method references. */ -var funcProto = Function.prototype, +var funcProto$1 = Function.prototype, objectProto$2 = Object.prototype; /** Used to resolve the decompiled source of functions. */ -var funcToString = funcProto.toString; +var funcToString$1 = funcProto$1.toString; /** Used to check objects for own properties. */ -var hasOwnProperty$2 = objectProto$2.hasOwnProperty; +var hasOwnProperty$1 = objectProto$2.hasOwnProperty; /** Used to detect if a method is native. */ var reIsNative = RegExp( '^' + - funcToString - .call(hasOwnProperty$2) + funcToString$1 + .call(hasOwnProperty$1) .replace(reRegExpChar, '\\$&') .replace( /hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, @@ -2974,13 +2991,13 @@ function hashDelete(key) { } /** Used to stand-in for `undefined` hash values. */ -var HASH_UNDEFINED$1 = '__lodash_hash_undefined__'; +var HASH_UNDEFINED = '__lodash_hash_undefined__'; /** Used for built-in method references. */ -var objectProto$1 = Object.prototype; +var objectProto$3 = Object.prototype; /** Used to check objects for own properties. */ -var hasOwnProperty$1 = objectProto$1.hasOwnProperty; +var hasOwnProperty$2 = objectProto$3.hasOwnProperty; /** * Gets the hash value for `key`. @@ -2995,16 +3012,16 @@ function hashGet(key) { var data = this.__data__; if (nativeCreate) { var result = data[key]; - return result === HASH_UNDEFINED$1 ? undefined : result; + return result === HASH_UNDEFINED ? undefined : result; } - return hasOwnProperty$1.call(data, key) ? data[key] : undefined; + return hasOwnProperty$2.call(data, key) ? data[key] : undefined; } /** Used for built-in method references. */ -var objectProto = Object.prototype; +var objectProto$4 = Object.prototype; /** Used to check objects for own properties. */ -var hasOwnProperty = objectProto.hasOwnProperty; +var hasOwnProperty$3 = objectProto$4.hasOwnProperty; /** * Checks if a hash value for `key` exists. @@ -3019,11 +3036,11 @@ function hashHas(key) { var data = this.__data__; return nativeCreate ? data[key] !== undefined - : hasOwnProperty.call(data, key); + : hasOwnProperty$3.call(data, key); } /** Used to stand-in for `undefined` hash values. */ -var HASH_UNDEFINED = '__lodash_hash_undefined__'; +var HASH_UNDEFINED$1 = '__lodash_hash_undefined__'; /** * Sets the hash `key` to `value`. @@ -3038,7 +3055,7 @@ var HASH_UNDEFINED = '__lodash_hash_undefined__'; function hashSet(key, value) { var data = this.__data__; this.size += this.has(key) ? 0 : 1; - data[key] = nativeCreate && value === undefined ? HASH_UNDEFINED : value; + data[key] = nativeCreate && value === undefined ? HASH_UNDEFINED$1 : value; return this; } @@ -3522,7 +3539,7 @@ function arrayMap(array, iteratee) { } /** Used as references for various `Number` constants. */ -var INFINITY$1 = 1 / 0; +var INFINITY = 1 / 0; /** Used to convert symbols to primitives and strings. */ var symbolProto = Symbol$1 ? Symbol$1.prototype : undefined, @@ -3549,7 +3566,7 @@ function baseToString(value) { return symbolToString ? symbolToString.call(value) : ''; } var result = value + ''; - return result == '0' && 1 / value == -INFINITY$1 ? '-0' : result; + return result == '0' && 1 / value == -INFINITY ? '-0' : result; } /** @@ -3593,7 +3610,7 @@ function castPath(value, object) { } /** Used as references for various `Number` constants. */ -var INFINITY = 1 / 0; +var INFINITY$1 = 1 / 0; /** * Converts `value` to a string key if it's not a string or symbol. @@ -3607,7 +3624,7 @@ function toKey(value) { return value; } var result = value + ''; - return result == '0' && 1 / value == -INFINITY ? '-0' : result; + return result == '0' && 1 / value == -INFINITY$1 ? '-0' : result; } /** @@ -3692,10 +3709,10 @@ const eventIncrementId = incrementId(); let TaroRootElement = class TaroRootElement extends TaroElement { constructor(nodeImpl, getElement, hooks, elementImpl, eventCenter) { // eslint-disable-next-line @typescript-eslint/indent super(nodeImpl, getElement, hooks, elementImpl); - this.pendingUpdate = false; this.pendingFlush = false; this.updatePayloads = []; this.updateCallbacks = []; + this.pendingUpdate = false; this.ctx = null; this.nodeName = ROOT_STR; this.eventCenter = eventCenter; @@ -3745,6 +3762,7 @@ let TaroRootElement = class TaroRootElement extends TaroElement { } else { this.pendingUpdate = false; const customWrapperUpdate = []; + const customWrapperMap = new Map(); const normalUpdate = {}; if (!initRender) { for (const p in data) { @@ -3761,12 +3779,16 @@ let TaroRootElement = class TaroRootElement extends TaroElement { const splitedPath = dataPathArr.slice(i).join('.'); if (customWrapper) { hasCustomWrapper = true; - customWrapperUpdate.push({ - ctx: ctx.selectComponent(`#${customWrapperId}`), - data: { - [`i.${splitedPath}`]: data[p], - }, - }); + customWrapperMap.set( + customWrapper, + Object.assign( + Object.assign( + {}, + customWrapperMap.get(customWrapper) || {}, + ), + { [`i.${splitedPath}`]: data[p] }, + ), + ); } break; } @@ -3775,6 +3797,11 @@ let TaroRootElement = class TaroRootElement extends TaroElement { normalUpdate[p] = data[p]; } } + if (customWrapperMap.size > 0) { + customWrapperMap.forEach((data, ctx) => { + customWrapperUpdate.push({ ctx, data }); + }); + } } const updateArrLen = customWrapperUpdate.length; if (updateArrLen) { @@ -3891,149 +3918,8 @@ class FormElement extends TaroElement { } } -let TaroNodeImpl = class TaroNodeImpl { - constructor(getElement, innerHTMLImpl, adjacentImpl) { // eslint-disable-next-line @typescript-eslint/indent - this.getDoc = () => getElement(ElementNames.Document)(); - this.innerHTMLImpl = innerHTMLImpl; - this.adjacentImpl = adjacentImpl; - } - bind(ctx) { - this.ctx = ctx; - this.bindInnerHTML(); - this.bindAdjacentHTML(); - } - bindInnerHTML() { - const { ctx, innerHTMLImpl: impl, getDoc } = this; - Object.defineProperty(ctx, 'innerHTML', { - configurable: true, - enumerable: true, - set(html) { - if (isFunction$1(impl)) { - impl.call(ctx, ctx, html, getDoc); - } else { - process.env.NODE_ENV !== 'production' && - warn(true, '请实现 node.innerHTML'); - } - }, - get() { - return ''; - }, - }); - } - bindAdjacentHTML() { - const { ctx, adjacentImpl: impl, getDoc } = this; - ctx.insertAdjacentHTML = function (position, html) { - if (isFunction$1(impl)) { - impl.call(ctx, position, html, getDoc); - } else { - process.env.NODE_ENV !== 'production' && - warn(true, '请实现 node.insertAdjacentHTML'); - } - }; - } -}; -TaroNodeImpl = __decorate( - [ - injectable(), - __param(0, inject(SERVICE_IDENTIFIER.TaroElementFactory)), - __param(1, inject(SERVICE_IDENTIFIER.InnerHTMLImpl)), - __param(1, optional()), - __param(2, inject(SERVICE_IDENTIFIER.insertAdjacentHTMLImpl)), - __param(2, optional()), - __metadata('design:paramtypes', [Function, Function, Function]), - ], - TaroNodeImpl, -); - -let TaroElementImpl = class TaroElementImpl { - constructor(rectImpl) { // eslint-disable-next-line @typescript-eslint/indent - this.rectImpl = rectImpl; - } - bind(ctx) { - this.bindRect(ctx); - } - bindRect(ctx) { - const impl = this.rectImpl; - ctx.getBoundingClientRect = async function (...args) { - if (isFunction$1(impl)) { - return await impl.apply(ctx, args); - } - process.env.NODE_ENV !== 'production' && - warn(true, '请实现 element.getBoundingClientRect'); - return Promise.resolve(null); - }; - } -}; -TaroElementImpl = __decorate( - [ - injectable(), - __param(0, inject(SERVICE_IDENTIFIER.getBoundingClientRectImpl)), - __param(0, optional()), - __metadata('design:paramtypes', [Object]), - ], - TaroElementImpl, -); - -let TaroDocument = class TaroDocument extends TaroElement { - constructor(nodeImpl, getElement, hooks, elementImpl, getText) { // eslint-disable-next-line @typescript-eslint/indent - super(nodeImpl, getElement, hooks, elementImpl); - this._getText = getText; - this.nodeType = 9 /* DOCUMENT_NODE */; - this.nodeName = DOCUMENT_ELEMENT_NAME; - } - createElement(type) { - if (type === ROOT_STR) { - return this._getElement(ElementNames.RootElement)(); - } - if (controlledComponent.has(type)) { - return this._getElement(ElementNames.FormElement)(type); - } - return this._getElement(ElementNames.Element)(type); - } - // an ugly fake createElementNS to deal with @vue/runtime-dom's - // support mounting app to svg container since vue@3.0.8 - createElementNS(_svgNS, type) { - return this.createElement(type); - } - createTextNode(text) { - return this._getText(text); - } - getElementById(id) { - const el = eventSource.get(id); - return isUndefined(el) ? null : el; - } - querySelector(query) { - // 为了 Vue3 的乞丐版实现 - if (/^#/.test(query)) { - return this.getElementById(query.slice(1)); - } - return null; - } - // @TODO: @PERF: 在 hydrate 移除掉空的 node - createComment() { - const textnode = this._getText(''); - textnode.nodeName = COMMENT; - return textnode; - } -}; -TaroDocument = __decorate( - [ - injectable(), - __param(0, inject(SERVICE_IDENTIFIER.TaroNodeImpl)), - __param(1, inject(SERVICE_IDENTIFIER.TaroElementFactory)), - __param(2, inject(SERVICE_IDENTIFIER.Hooks)), - __param(3, inject(SERVICE_IDENTIFIER.TaroElementImpl)), - __param(4, inject(SERVICE_IDENTIFIER.TaroTextFactory)), - __metadata('design:paramtypes', [ - Function, - Function, - Function, - Function, - Function, - ]), - ], - TaroDocument, -); +// for Vue3 +class SVGElement extends TaroElement {} function initPosition() { return { @@ -4403,7 +4289,13 @@ class StyleTagParser { while (lb > -1) { const rb = style.indexOf(RIGHT_BRACKET); const selectors = style.slice(0, lb).trim(); - let content = style.slice(lb + 1, rb).replace(/ /g, ''); + let content = style.slice(lb + 1, rb); + content = content.replace(/:(.*);/g, function (_, $1) { + const t = $1.trim().replace(/ +/g, '+++'); + return `:${t};`; + }); + content = content.replace(/ /g, ''); + content = content.replace(/\+\+\+/g, ' '); if (!/;$/.test(content)) { content += ';'; } @@ -4856,28 +4748,15 @@ options.html = { renderHTMLTag: false, }; function setInnerHTML(element, html, getDoc) { - element.childNodes.forEach((node) => { - element.removeChild(node); - }); + while (element.firstChild) { + element.removeChild(element.firstChild); + } const children = parser(html, getDoc()); for (let i = 0; i < children.length; i++) { element.appendChild(children[i]); } } -function getBoundingClientRectImpl() { - if (!options.miniGlobal) return Promise.resolve(null); - return new Promise((resolve) => { - const query = options.miniGlobal.createSelectorQuery(); - query - .select(`#${this.uid}`) - .boundingClientRect((res) => { - resolve(res); - }) - .exec(); - }); -} - /** * An implementation of `Element.insertAdjacentHTML()` * to support Vue 3 with a version of or greater than `vue@3.1.2` @@ -4911,24 +4790,186 @@ function insertAdjacentHTMLImpl(position, html, getDoc) { } } } +function cloneNode(ctx, getDoc, isDeep = false) { + const document = getDoc(); + let newNode; + if (ctx.nodeType === 1 /* ELEMENT_NODE */) { + newNode = document.createElement(ctx.nodeName); + } else if (ctx.nodeType === 3 /* TEXT_NODE */) { + newNode = document.createTextNode(''); + } + for (const key in this) { + const value = this[key]; + if ([PROPS, DATASET].includes(key) && typeof value === OBJECT) { + newNode[key] = Object.assign({}, value); + } else if (key === '_value') { + newNode[key] = value; + } else if (key === STYLE) { + newNode.style._value = Object.assign({}, value._value); + newNode.style._usedStyleProp = new Set(Array.from(value._usedStyleProp)); + } + } + if (isDeep) { + newNode.childNodes = ctx.childNodes.map((node) => node.cloneNode(true)); + } + return newNode; +} -const domExternal = new ContainerModule((bind) => { - if (process.env.TARO_ENV !== 'h5') { - if (typeof ENABLE_INNER_HTML !== 'undefined' && ENABLE_INNER_HTML) { - bind(SERVICE_IDENTIFIER.InnerHTMLImpl).toFunction(setInnerHTML); - if (typeof ENABLE_ADJACENT_HTML !== 'undefined' && ENABLE_ADJACENT_HTML) { - bind(SERVICE_IDENTIFIER.insertAdjacentHTMLImpl).toFunction( - insertAdjacentHTMLImpl, - ); +let TaroNodeImpl = class TaroNodeImpl { + constructor(getElement) { // eslint-disable-next-line @typescript-eslint/indent + this.getDoc = () => getElement(ElementNames.Document)(); + } + bind(ctx) { + const getDoc = this.getDoc; + if (ENABLE_INNER_HTML) { + bindInnerHTML(ctx, getDoc); + if (ENABLE_ADJACENT_HTML) { + bindAdjacentHTML(ctx, getDoc); } } - if (typeof ENABLE_SIZE_APIS !== 'undefined' && ENABLE_SIZE_APIS) { - bind(SERVICE_IDENTIFIER.getBoundingClientRectImpl).toFunction( - getBoundingClientRectImpl, - ); + if (ENABLE_CLONE_NODE) { + ctx.cloneNode = cloneNode.bind(ctx, ctx, getDoc); } } -}); +}; +TaroNodeImpl = __decorate( + [ + injectable(), + __param(0, inject(SERVICE_IDENTIFIER.TaroElementFactory)), + __metadata('design:paramtypes', [Function]), + ], + TaroNodeImpl, +); +function bindInnerHTML(ctx, getDoc) { + Object.defineProperty(ctx, 'innerHTML', { + configurable: true, + enumerable: true, + set(html) { + setInnerHTML.call(ctx, ctx, html, getDoc); + }, + get() { + return ''; + }, + }); +} +function bindAdjacentHTML(ctx, getDoc) { + ctx.insertAdjacentHTML = function (position, html) { + insertAdjacentHTMLImpl.call(ctx, position, html, getDoc); + }; +} + +function getBoundingClientRectImpl() { + if (!options.miniGlobal) return Promise.resolve(null); + return new Promise((resolve) => { + const query = options.miniGlobal.createSelectorQuery(); + query + .select(`#${this.uid}`) + .boundingClientRect((res) => { + resolve(res); + }) + .exec(); + }); +} +function getTemplateContent(ctx) { + if (ctx.nodeName === 'template') { + const content = ctx._getElement(ElementNames.Element)(DOCUMENT_FRAGMENT); + content.childNodes = ctx.childNodes; + ctx.childNodes = [content]; + content.parentNode = ctx; + content.childNodes.forEach((nodes) => { + nodes.parentNode = content; + }); + return content; + } +} + +let TaroElementImpl = class TaroElementImpl { + bind(ctx) { + if (ENABLE_SIZE_APIS) { + ctx.getBoundingClientRect = async function (...args) { + return await getBoundingClientRectImpl.apply(ctx, args); + }; + } + if (ENABLE_TEMPLATE_CONTENT) { + bindContent(ctx); + } + } +}; +TaroElementImpl = __decorate([injectable()], TaroElementImpl); +function bindContent(ctx) { + Object.defineProperty(ctx, 'content', { + configurable: true, + enumerable: true, + get() { + return getTemplateContent(ctx); + }, + }); +} + +let TaroDocument = class TaroDocument extends TaroElement { + constructor(nodeImpl, getElement, hooks, elementImpl, getText) { // eslint-disable-next-line @typescript-eslint/indent + super(nodeImpl, getElement, hooks, elementImpl); + this._getText = getText; + this.nodeType = 9 /* DOCUMENT_NODE */; + this.nodeName = DOCUMENT_ELEMENT_NAME; + } + createElement(type) { + if (type === ROOT_STR) { + return this._getElement(ElementNames.RootElement)(); + } + if (controlledComponent.has(type)) { + return this._getElement(ElementNames.FormElement)(type); + } + return this._getElement(ElementNames.Element)(type); + } + // an ugly fake createElementNS to deal with @vue/runtime-dom's + // support mounting app to svg container since vue@3.0.8 + createElementNS(_svgNS, type) { + return this.createElement(type); + } + createTextNode(text) { + return this._getText(text); + } + getElementById(id) { + const el = eventSource.get(id); + return isUndefined(el) ? null : el; + } + querySelector(query) { + // 为了 Vue3 的乞丐版实现 + if (/^#/.test(query)) { + return this.getElementById(query.slice(1)); + } + return null; + } + querySelectorAll() { + // fake hack + return []; + } + // @TODO: @PERF: 在 hydrate 移除掉空的 node + createComment() { + const textnode = this._getText(''); + textnode.nodeName = COMMENT; + return textnode; + } +}; +TaroDocument = __decorate( + [ + injectable(), + __param(0, inject(SERVICE_IDENTIFIER.TaroNodeImpl)), + __param(1, inject(SERVICE_IDENTIFIER.TaroElementFactory)), + __param(2, inject(SERVICE_IDENTIFIER.Hooks)), + __param(3, inject(SERVICE_IDENTIFIER.TaroElementImpl)), + __param(4, inject(SERVICE_IDENTIFIER.TaroTextFactory)), + __metadata('design:paramtypes', [ + Function, + Function, + Function, + Function, + Function, + ]), + ], + TaroDocument, +); let Hooks = class Hooks { modifyMpEvent(e) { @@ -4949,6 +4990,12 @@ let Hooks = class Hooks { ? void 0 : _a.forEach((fn) => fn(taro)); } + patchElement(element) { + var _a; + (_a = this.patchElementImpls) === null || _a === void 0 + ? void 0 + : _a.forEach((fn) => fn(element)); + } }; __decorate( [ @@ -5115,6 +5162,16 @@ __decorate( 'initNativeApiImpls', void 0, ); +__decorate( + [ + multiInject(SERVICE_IDENTIFIER.patchElement), + optional(), + __metadata('design:type', Array), + ], + Hooks.prototype, + 'patchElementImpls', + void 0, +); Hooks = __decorate([injectable()], Hooks); /** @@ -5182,59 +5239,66 @@ function processPluginHooks(container) { } const container = new Container(); -container - .bind(SERVICE_IDENTIFIER.TaroElement) - .to(TaroElement) - .whenTargetNamed(ElementNames.Element); -container - .bind(SERVICE_IDENTIFIER.TaroElement) - .to(TaroDocument) - .inSingletonScope() - .whenTargetNamed(ElementNames.Document); -container - .bind(SERVICE_IDENTIFIER.TaroElement) - .to(TaroRootElement) - .whenTargetNamed(ElementNames.RootElement); -container - .bind(SERVICE_IDENTIFIER.TaroElement) - .to(FormElement) - .whenTargetNamed(ElementNames.FormElement); -container.bind(SERVICE_IDENTIFIER.TaroElementFactory).toFactory((context) => { - return (named) => (nodeName) => { - const el = context.container.getNamed( - SERVICE_IDENTIFIER.TaroElement, - named, - ); - if (nodeName) { - el.nodeName = nodeName; - } - el.tagName = el.nodeName.toUpperCase(); - return el; - }; -}); -container.bind(SERVICE_IDENTIFIER.TaroText).to(TaroText); -container.bind(SERVICE_IDENTIFIER.TaroTextFactory).toFactory((context) => { - return (text) => { - const textNode = context.container.get(SERVICE_IDENTIFIER.TaroText); - textNode._value = text; - return textNode; - }; -}); -container - .bind(SERVICE_IDENTIFIER.TaroNodeImpl) - .to(TaroNodeImpl) - .inSingletonScope(); -container - .bind(SERVICE_IDENTIFIER.TaroElementImpl) - .to(TaroElementImpl) - .inSingletonScope(); +if (process.env.TARO_ENV !== 'h5') { + container + .bind(SERVICE_IDENTIFIER.TaroElement) + .to(TaroElement) + .whenTargetNamed(ElementNames.Element); + container + .bind(SERVICE_IDENTIFIER.TaroElement) + .to(TaroDocument) + .inSingletonScope() + .whenTargetNamed(ElementNames.Document); + container + .bind(SERVICE_IDENTIFIER.TaroElement) + .to(TaroRootElement) + .whenTargetNamed(ElementNames.RootElement); + container + .bind(SERVICE_IDENTIFIER.TaroElement) + .to(FormElement) + .whenTargetNamed(ElementNames.FormElement); + container.bind(SERVICE_IDENTIFIER.TaroElementFactory).toFactory((context) => { + return (named) => (nodeName) => { + const el = context.container.getNamed( + SERVICE_IDENTIFIER.TaroElement, + named, + ); + if (nodeName) { + el.nodeName = nodeName; + } + el.tagName = el.nodeName.toUpperCase(); + return el; + }; + }); + container.bind(SERVICE_IDENTIFIER.TaroText).to(TaroText); + container.bind(SERVICE_IDENTIFIER.TaroTextFactory).toFactory((context) => { + return (text) => { + const textNode = context.container.get(SERVICE_IDENTIFIER.TaroText); + textNode._value = text; + return textNode; + }; + }); + container + .bind(SERVICE_IDENTIFIER.TaroNodeImpl) + .to(TaroNodeImpl) + .inSingletonScope(); + container + .bind(SERVICE_IDENTIFIER.TaroElementImpl) + .to(TaroElementImpl) + .inSingletonScope(); +} container.bind(SERVICE_IDENTIFIER.Hooks).to(Hooks).inSingletonScope(); -container.load(domExternal, DefaultHooksContainer); +container.load(DefaultHooksContainer); processPluginHooks(container); -const hooks$3 = container.get(SERVICE_IDENTIFIER.Hooks); -const getElement = container.get(SERVICE_IDENTIFIER.TaroElementFactory); -const document$2 = getElement(ElementNames.Document)(); +let hooks; +let getElement; +let document$1; +if (process.env.TARO_ENV !== 'h5') { + hooks = container.get(SERVICE_IDENTIFIER.Hooks); + getElement = container.get(SERVICE_IDENTIFIER.TaroElementFactory); + document$1 = getElement(ElementNames.Document)(); +} // Taro 事件对象。以 Web 标准的事件对象为基础，加入小程序事件对象中携带的部分信息，并模拟实现事件冒泡。 class TaroEvent { constructor(type, opts, event) { @@ -5260,7 +5324,7 @@ class TaroEvent { } get target() { var _a, _b, _c; - const element = document$2.getElementById( + const element = document$1.getElementById( (_a = this.mpEvent) === null || _a === void 0 ? void 0 : _a.target.id, ); return Object.assign( @@ -5276,7 +5340,7 @@ class TaroEvent { } get currentTarget() { var _a, _b, _c; - const element = document$2.getElementById( + const element = document$1.getElementById( (_a = this.mpEvent) === null || _a === void 0 ? void 0 : _a.currentTarget.id, @@ -5333,31 +5397,31 @@ const eventsBatch = {}; // 小程序的事件代理回调函数 function eventHandler(event) { var _a; - (_a = hooks$3.modifyMpEvent) === null || _a === void 0 + (_a = hooks.modifyMpEvent) === null || _a === void 0 ? void 0 - : _a.call(hooks$3, event); + : _a.call(hooks, event); if (event.currentTarget == null) { event.currentTarget = event.target; } - const node = document$2.getElementById(event.currentTarget.id); + const node = document$1.getElementById(event.currentTarget.id); if (node) { const dispatch = () => { var _a; const e = createEvent(event, node); - (_a = hooks$3.modifyTaroEvent) === null || _a === void 0 + (_a = hooks.modifyTaroEvent) === null || _a === void 0 ? void 0 - : _a.call(hooks$3, e, node); + : _a.call(hooks, e, node); node.dispatchEvent(e); }; - if (typeof hooks$3.batchedEventUpdates === 'function') { + if (typeof hooks.batchedEventUpdates === 'function') { const type = event.type; if ( - !hooks$3.isBubbleEvents(type) || + !hooks.isBubbleEvents(type) || !isParentBinded(node, type) || (type === TOUCHMOVE && !!node.props.catchMove) ) { // 最上层组件统一 batchUpdate - hooks$3.batchedEventUpdates(() => { + hooks.batchedEventUpdates(() => { if (eventsBatch[type]) { eventsBatch[type].forEach((fn) => fn()); delete eventsBatch[type]; @@ -5411,7 +5475,7 @@ function createDocument() { doc.createEvent = createEvent; return doc; } -const document$1 = isBrowser ? doc : createDocument(); +const document$2 = isBrowser ? doc : createDocument(); const machine = 'Macintosh'; const arch = 'Intel Mac OS X 10_14_5'; @@ -5489,7 +5553,7 @@ const window$1 = isBrowser ? win : { navigator, - document: document$1, + document: document$2, }; if (!isBrowser) { const globalProperties = [ @@ -5502,6 +5566,7 @@ if (!isBrowser) { window$1[property] = global[property]; } }); + document$2.defaultView = window$1; } if (process.env.TARO_ENV && process.env.TARO_ENV !== 'h5') { window$1.requestAnimationFrame = raf; @@ -5607,19 +5672,19 @@ class Events { } } Events.eventSplitter = /\s+/; -const hooks$2 = container.get(SERVICE_IDENTIFIER.Hooks); -const eventCenter = hooks$2.getEventCenter(Events); +const hooks$1 = container.get(SERVICE_IDENTIFIER.Hooks); +const eventCenter = hooks$1.getEventCenter(Events); container.bind(SERVICE_IDENTIFIER.eventCenter).toConstantValue(eventCenter); /* eslint-disable dot-notation */ const instances = new Map(); const pageId = incrementId(); -const hooks$1 = container.get(SERVICE_IDENTIFIER.Hooks); +const hooks$2 = container.get(SERVICE_IDENTIFIER.Hooks); function injectPageInstance(inst, id) { var _a; - (_a = hooks$1.mergePageInstance) === null || _a === void 0 + (_a = hooks$2.mergePageInstance) === null || _a === void 0 ? void 0 - : _a.call(hooks$1, instances.get(id), inst); + : _a.call(hooks$2, instances.get(id), inst); instances.set(id, inst); } function getPageInstance(id) { @@ -5636,7 +5701,7 @@ function safeExecute(path, lifecycle, ...args) { if (instance == null) { return; } - const func = hooks$1.getLifecycle(instance, lifecycle); + const func = hooks$2.getLifecycle(instance, lifecycle); if (isArray$1(func)) { const res = func.map((fn) => fn.apply(instance, args)); return res[0]; @@ -5705,12 +5770,14 @@ function createPageConfig(component, pageName, data, pageConfig) { }; const mount = () => { Current.app.mount(component, this.$taroPath, () => { - pageElement = document$1.getElementById(this.$taroPath); + pageElement = document$2.getElementById(this.$taroPath); ensure(pageElement !== null, '没有找到页面实例。'); safeExecute(this.$taroPath, 'onLoad', this.$taroParams); if (!isBrowser) { pageElement.ctx = this; pageElement.performUpdate(true, cb); + } else { + isFunction$1(cb) && cb(); } }); }; @@ -5807,7 +5874,7 @@ function createPageConfig(component, pageName, data, pageConfig) { options === null || options === void 0 ? void 0 : options.target; if (target != null) { const id = target.id; - const element = document$1.getElementById(id); + const element = document$2.getElementById(id); if (element != null) { options.target.dataset = element.dataset; } @@ -5853,7 +5920,7 @@ function createComponentConfig(component, componentName, data) { : _a.call(this)) || pageId(), }); Current.app.mount(component, path, () => { - componentElement = document$1.getElementById(path); + componentElement = document$2.getElementById(path); ensure(componentElement !== null, '没有找到组件实例。'); safeExecute(path, 'onLoad'); if (!isBrowser) { @@ -5925,7 +5992,7 @@ function createRecursiveComponentConfig(componentName) { }; } -const hooks = container.get(SERVICE_IDENTIFIER.Hooks); +const hooks$3 = container.get(SERVICE_IDENTIFIER.Hooks); function isClassComponent(R, component) { var _a; return ( @@ -5990,7 +6057,7 @@ function connectReactPage(R, id) { }; } let ReactDOM; -function setReconciler$2() { +function setReconciler() { const getLifecycle = function (instance, lifecycle) { lifecycle = lifecycle.replace(/^on(Show|Hide)$/, 'componentDid$1'); return instance[lifecycle]; @@ -6014,12 +6081,12 @@ function setReconciler$2() { } }); }; - hooks.getLifecycle = getLifecycle; - hooks.modifyMpEvent = modifyMpEvent; - hooks.batchedEventUpdates = batchedEventUpdates; - hooks.mergePageInstance = mergePageInstance; + hooks$3.getLifecycle = getLifecycle; + hooks$3.modifyMpEvent = modifyMpEvent; + hooks$3.batchedEventUpdates = batchedEventUpdates; + hooks$3.mergePageInstance = mergePageInstance; if (process.env.TARO_ENV === 'h5') { - hooks.createPullDownComponent = (el, _, R, customWrapper) => { + hooks$3.createPullDownComponent = (el, _, R, customWrapper) => { const isReactComponent = isClassComponent(R, el); return R.forwardRef((props, ref) => { const newProps = Object.assign({}, props); @@ -6037,7 +6104,7 @@ function setReconciler$2() { ); }); }; - hooks.getDOMNode = (inst) => { + hooks$3.getDOMNode = (inst) => { return ReactDOM.findDOMNode(inst); }; } @@ -6052,7 +6119,7 @@ function createReactApp(App, react, reactdom, config) { ); const ref = R.createRef(); const isReactComponent = isClassComponent(R, App); - setReconciler$2(); + setReconciler(); class AppWrapper extends R.Component { constructor() { super(...arguments); @@ -6099,7 +6166,7 @@ function createReactApp(App, react, reactdom, config) { // eslint-disable-next-line react/no-render-return-value wrapper = ReactDOM.render( R.createElement(AppWrapper), - document$1.getElementById('app'), + document$2.getElementById('app'), ); } const app = Object.create( @@ -6138,7 +6205,7 @@ function createReactApp(App, react, reactdom, config) { // eslint-disable-next-line react/no-render-return-value wrapper = ReactDOM.render( R.createElement(AppWrapper), - document$1.getElementById('app'), + document$2.getElementById('app'), ); } const app = ref.current; @@ -6215,7 +6282,7 @@ function createReactApp(App, react, reactdom, config) { const instance = getPageInstance(HOOKS_APP_ID); if (instance) { const app = ref.current; - const func = hooks.getLifecycle(instance, lifecycle); + const func = hooks$3.getLifecycle(instance, lifecycle); if (Array.isArray(func)) { func.forEach((cb) => cb.apply(app)); } @@ -6303,8 +6370,8 @@ function initNativeComponentEntry(R, ReactDOM) { return components.map(({ element }) => element); } } - setReconciler$2(); - const app = document$1.getElementById('app'); + setReconciler(); + const app = document$2.getElementById('app'); ReactDOM.render(R.createElement(Entry, {}), app); } function createNativeComponentConfig( @@ -6315,6 +6382,7 @@ function createNativeComponentConfig( ) { R = react; ReactDOM = reactdom; + setReconciler(); const config = { properties: { props: { @@ -6512,7 +6580,7 @@ function createVueApp(App, vue, config) { }, }); if (!isBrowser) { - wrapper.$mount(document$1.getElementById('app')); + wrapper.$mount(document$2.getElementById('app')); } const app = Object.create( { @@ -6544,7 +6612,7 @@ function createVueApp(App, vue, config) { ); if (isBrowser) { // 由于 H5 路由初始化的时候会清除 app 下的 dom 元素，所以需要在路由初始化后再执行 render - wrapper.$mount(document$1.getElementById('app')); + wrapper.$mount(document$2.getElementById('app')); } appInstance = wrapper.$refs.app; if ( @@ -6637,7 +6705,7 @@ function createVue3Page(h, id) { ); }; } -function setReconciler() { +function setReconciler$2() { const hooks = container.get(SERVICE_IDENTIFIER.Hooks); const getLifecycle = function (instance, lifecycle) { return instance.$options[lifecycle]; @@ -6681,7 +6749,7 @@ function createVue3App(app, h, config) { let pages = []; let appInstance; ensure(!isFunction$1(app._component), '入口组件不支持使用函数式组件'); - setReconciler(); + setReconciler$2(); app._component.render = function () { return pages.slice(); }; @@ -6781,11 +6849,11 @@ function createVue3App(app, h, config) { const taroHooks = (lifecycle) => { return (fn) => { - const id = React.useContext(PageContext) || HOOKS_APP_ID; + const id = R.useContext(PageContext) || HOOKS_APP_ID; // hold fn ref and keep up to date - const fnRef = React.useRef(fn); + const fnRef = R.useRef(fn); if (fnRef.current !== fn) fnRef.current = fn; - React.useLayoutEffect(() => { + R.useLayoutEffect(() => { let inst = getPageInstance(id); let first = false; if (inst == null) { @@ -6830,7 +6898,7 @@ const useShareTimeline = taroHooks('onShareTimeline'); const useAddToFavorites = taroHooks('onAddToFavorites'); const useReady = taroHooks('onReady'); const useRouter = (dynamic = false) => { - return dynamic ? Current.router : React.useMemo(() => Current.router, []); + return dynamic ? Current.router : R.useMemo(() => Current.router, []); }; const useScope = () => undefined; @@ -6851,8 +6919,12 @@ const nextTick = (cb, ctx) => { if (router !== null) { let pageElement = null; const path = getPath(removeLeadingSlash(router.path), router.params); - pageElement = document$1.getElementById(path); - if (pageElement !== null) { + pageElement = document$2.getElementById(path); + if ( + pageElement === null || pageElement === void 0 + ? void 0 + : pageElement.pendingUpdate + ) { if (isBrowser) { // eslint-disable-next-line dot-notation (_c = @@ -6883,6 +6955,7 @@ export { Events, FormElement, SERVICE_IDENTIFIER, + SVGElement, Style, TaroElement, TaroEvent, @@ -6902,7 +6975,7 @@ export { createRecursiveComponentConfig, createVue3App, createVueApp, - document$1 as document, + document$2 as document, eventCenter, getComputedStyle, getCurrentInstance, @@ -6912,6 +6985,7 @@ export { nextTick, now, options, + processPluginHooks, raf as requestAnimationFrame, stringify, useAddToFavorites, diff --git a/packages/taro-runtime/dist/runtime.esm.js.map b/packages/taro-runtime/dist/runtime.esm.js.map index 7d82f7712..1a4a93e30 100644 --- a/packages/taro-runtime/dist/runtime.esm.js.map +++ b/packages/taro-runtime/dist/runtime.esm.js.map @@ -1 +1 @@ -{"version":3,"file":"runtime.esm.js","sources":["../src/polyfill/reflect-metadata.js","../src/constants/identifiers.ts","../src/constants/index.ts","../src/utils/index.ts","../src/dom/event-target.ts","../src/hydrate.ts","../src/dom/event-source.ts","../src/interface/container.ts","../src/dom/node.ts","../src/dom/text.ts","../src/dom/style_properties.ts","../src/dom/style.ts","../src/dom/tree.ts","../src/dom/class-list.ts","../src/dom/element.ts","../../../node_modules/lodash-es/isArray.js","../../../node_modules/lodash-es/_freeGlobal.js","../../../node_modules/lodash-es/_root.js","../../../node_modules/lodash-es/_Symbol.js","../../../node_modules/lodash-es/_getRawTag.js","../../../node_modules/lodash-es/_objectToString.js","../../../node_modules/lodash-es/_baseGetTag.js","../../../node_modules/lodash-es/isObjectLike.js","../../../node_modules/lodash-es/isSymbol.js","../../../node_modules/lodash-es/_isKey.js","../../../node_modules/lodash-es/isObject.js","../../../node_modules/lodash-es/isFunction.js","../../../node_modules/lodash-es/_coreJsData.js","../../../node_modules/lodash-es/_isMasked.js","../../../node_modules/lodash-es/_toSource.js","../../../node_modules/lodash-es/_baseIsNative.js","../../../node_modules/lodash-es/_getValue.js","../../../node_modules/lodash-es/_getNative.js","../../../node_modules/lodash-es/_nativeCreate.js","../../../node_modules/lodash-es/_hashClear.js","../../../node_modules/lodash-es/_hashDelete.js","../../../node_modules/lodash-es/_hashGet.js","../../../node_modules/lodash-es/_hashHas.js","../../../node_modules/lodash-es/_hashSet.js","../../../node_modules/lodash-es/_Hash.js","../../../node_modules/lodash-es/_listCacheClear.js","../../../node_modules/lodash-es/eq.js","../../../node_modules/lodash-es/_assocIndexOf.js","../../../node_modules/lodash-es/_listCacheDelete.js","../../../node_modules/lodash-es/_listCacheGet.js","../../../node_modules/lodash-es/_listCacheHas.js","../../../node_modules/lodash-es/_listCacheSet.js","../../../node_modules/lodash-es/_ListCache.js","../../../node_modules/lodash-es/_Map.js","../../../node_modules/lodash-es/_mapCacheClear.js","../../../node_modules/lodash-es/_isKeyable.js","../../../node_modules/lodash-es/_getMapData.js","../../../node_modules/lodash-es/_mapCacheDelete.js","../../../node_modules/lodash-es/_mapCacheGet.js","../../../node_modules/lodash-es/_mapCacheHas.js","../../../node_modules/lodash-es/_mapCacheSet.js","../../../node_modules/lodash-es/_MapCache.js","../../../node_modules/lodash-es/memoize.js","../../../node_modules/lodash-es/_memoizeCapped.js","../../../node_modules/lodash-es/_stringToPath.js","../../../node_modules/lodash-es/_arrayMap.js","../../../node_modules/lodash-es/_baseToString.js","../../../node_modules/lodash-es/toString.js","../../../node_modules/lodash-es/_castPath.js","../../../node_modules/lodash-es/_toKey.js","../../../node_modules/lodash-es/_baseGet.js","../../../node_modules/lodash-es/get.js","../src/options.ts","../src/perf.ts","../src/dom/root.ts","../src/dom/form.ts","../src/dom-external/node-impl.ts","../src/dom-external/element-impl.ts","../src/dom/document.ts","../src/dom-external/inner-html/scaner.ts","../src/dom-external/inner-html/tags.ts","../src/dom-external/inner-html/utils.ts","../src/dom-external/inner-html/style.ts","../src/dom-external/inner-html/parser.ts","../src/dom-external/inner-html/html.ts","../src/dom-external/element.ts","../src/dom-external/node.ts","../src/dom-external/index.ts","../src/hooks.ts","../src/constants/events.ts","../src/container/default-hooks.ts","../src/container/plugin-hooks.ts","../src/container/index.ts","../src/dom/event.ts","../src/env.ts","../src/bom/document.ts","../src/bom/navigator.ts","../src/bom/raf.ts","../src/bom/getComputedStyle.ts","../src/bom/window.ts","../src/current.ts","../src/emitter/emitter.ts","../src/dsl/common.ts","../src/dsl/react.ts","../src/dsl/vue.ts","../src/dsl/vue3.ts","../src/dsl/hooks.ts","../src/next-tick.ts"],"sourcesContent":["/*! *****************************************************************************\nCopyright (C) Microsoft. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n/** https://github.com/rbuckton/reflect-metadata */\n\nif (process.env.TARO_ENV === 'h5') {\n require('reflect-metadata')\n} else {\n // var Reflect;\n (function (Reflect) {\n // Metadata Proposal\n // https://rbuckton.github.io/reflect-metadata/\n (function (factory) {\n // var root = typeof global === \"object\" ? global :\n // typeof self === \"object\" ? self :\n // typeof this === \"object\" ? this :\n // Function(\"return this;\")();\n var exporter = makeExporter(Reflect);\n // if (typeof root.Reflect === \"undefined\") {\n // root.Reflect = Reflect;\n // }\n // else {\n // exporter = makeExporter(root.Reflect, exporter);\n // }\n factory(exporter);\n function makeExporter(target, previous) {\n return function (key, value) {\n if (typeof target[key] !== \"function\") {\n Object.defineProperty(target, key, { configurable: true, writable: true, value: value });\n }\n if (previous)\n previous(key, value);\n };\n }\n })(function (exporter) {\n var hasOwn = Object.prototype.hasOwnProperty;\n // feature test for Symbol support\n var supportsSymbol = typeof Symbol === \"function\";\n var toPrimitiveSymbol = supportsSymbol && typeof Symbol.toPrimitive !== \"undefined\" ? Symbol.toPrimitive : \"@@toPrimitive\";\n var iteratorSymbol = supportsSymbol && typeof Symbol.iterator !== \"undefined\" ? Symbol.iterator : \"@@iterator\";\n var supportsCreate = typeof Object.create === \"function\"; // feature test for Object.create support\n var supportsProto = { __proto__: [] } instanceof Array; // feature test for __proto__ support\n var downLevel = !supportsCreate && !supportsProto;\n var HashMap = {\n // create an object in dictionary mode (a.k.a. \"slow\" mode in v8)\n create: supportsCreate\n ? function () { return MakeDictionary(Object.create(null)); }\n : supportsProto\n ? function () { return MakeDictionary({ __proto__: null }); }\n : function () { return MakeDictionary({}); },\n has: downLevel\n ? function (map, key) { return hasOwn.call(map, key); }\n : function (map, key) { return key in map; },\n get: downLevel\n ? function (map, key) { return hasOwn.call(map, key) ? map[key] : undefined; }\n : function (map, key) { return map[key]; },\n };\n // Load global or shim versions of Map, Set, and WeakMap\n var functionPrototype = Object.getPrototypeOf(Function);\n var usePolyfill = typeof process === \"object\" && process.env && process.env[\"REFLECT_METADATA_USE_MAP_POLYFILL\"] === \"true\";\n var _Map = !usePolyfill && typeof Map === \"function\" && typeof Map.prototype.entries === \"function\" ? Map : CreateMapPolyfill();\n var _Set = !usePolyfill && typeof Set === \"function\" && typeof Set.prototype.entries === \"function\" ? Set : CreateSetPolyfill();\n var _WeakMap = !usePolyfill && typeof WeakMap === \"function\" ? WeakMap : CreateWeakMapPolyfill();\n // [[Metadata]] internal slot\n // https://rbuckton.github.io/reflect-metadata/#ordinary-object-internal-methods-and-internal-slots\n var Metadata = new _WeakMap();\n /**\n * Applies a set of decorators to a property of a target object.\n * @param decorators An array of decorators.\n * @param target The target object.\n * @param propertyKey (Optional) The property key to decorate.\n * @param attributes (Optional) The property descriptor for the target key.\n * @remarks Decorators are applied in reverse order.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Example = Reflect.decorate(decoratorsArray, Example);\n *\n * // property (on constructor)\n * Reflect.decorate(decoratorsArray, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.decorate(decoratorsArray, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Object.defineProperty(Example, \"staticMethod\",\n * Reflect.decorate(decoratorsArray, Example, \"staticMethod\",\n * Object.getOwnPropertyDescriptor(Example, \"staticMethod\")));\n *\n * // method (on prototype)\n * Object.defineProperty(Example.prototype, \"method\",\n * Reflect.decorate(decoratorsArray, Example.prototype, \"method\",\n * Object.getOwnPropertyDescriptor(Example.prototype, \"method\")));\n *\n */\n function decorate(decorators, target, propertyKey, attributes) {\n if (!IsUndefined(propertyKey)) {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsObject(target))\n throw new TypeError();\n if (!IsObject(attributes) && !IsUndefined(attributes) && !IsNull(attributes))\n throw new TypeError();\n if (IsNull(attributes))\n attributes = undefined;\n propertyKey = ToPropertyKey(propertyKey);\n return DecorateProperty(decorators, target, propertyKey, attributes);\n }\n else {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsConstructor(target))\n throw new TypeError();\n return DecorateConstructor(decorators, target);\n }\n }\n exporter(\"decorate\", decorate);\n // 4.1.2 Reflect.metadata(metadataKey, metadataValue)\n // https://rbuckton.github.io/reflect-metadata/#reflect.metadata\n /**\n * A default metadata decorator factory that can be used on a class, class member, or parameter.\n * @param metadataKey The key for the metadata entry.\n * @param metadataValue The value for the metadata entry.\n * @returns A decorator function.\n * @remarks\n * If `metadataKey` is already defined for the target and target key, the\n * metadataValue for that key will be overwritten.\n * @example\n *\n * // constructor\n * @Reflect.metadata(key, value)\n * class Example {\n * }\n *\n * // property (on constructor, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticProperty;\n * }\n *\n * // property (on prototype, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * property;\n * }\n *\n * // method (on constructor)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticMethod() { }\n * }\n *\n * // method (on prototype)\n * class Example {\n * @Reflect.metadata(key, value)\n * method() { }\n * }\n *\n */\n function metadata(metadataKey, metadataValue) {\n function decorator(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey) && !IsPropertyKey(propertyKey))\n throw new TypeError();\n OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n return decorator;\n }\n exporter(\"metadata\", metadata);\n /**\n * Define a unique metadata entry on the target.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param metadataValue A value that contains attached metadata.\n * @param target The target object on which to define metadata.\n * @param propertyKey (Optional) The property key for the target.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Reflect.defineMetadata(\"custom:annotation\", options, Example);\n *\n * // property (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticMethod\");\n *\n * // method (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"method\");\n *\n * // decorator factory as metadata-producing annotation.\n * function MyAnnotation(options): Decorator {\n * return (target, key?) => Reflect.defineMetadata(\"custom:annotation\", options, target, key);\n * }\n *\n */\n function defineMetadata(metadataKey, metadataValue, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n exporter(\"defineMetadata\", defineMetadata);\n /**\n * Gets a value indicating whether the target object or its prototype chain has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object or its prototype chain; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasMetadata\", hasMetadata);\n /**\n * Gets a value indicating whether the target object has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasOwnMetadata\", hasOwnMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object or its prototype chain.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getMetadata\", getMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getOwnMetadata\", getOwnMetadata);\n /**\n * Gets the metadata keys defined on the target object or its prototype chain.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryMetadataKeys(target, propertyKey);\n }\n exporter(\"getMetadataKeys\", getMetadataKeys);\n /**\n * Gets the unique metadata keys defined on the target object.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getOwnMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryOwnMetadataKeys(target, propertyKey);\n }\n exporter(\"getOwnMetadataKeys\", getOwnMetadataKeys);\n /**\n * Deletes the metadata entry from the target object with the provided key.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata entry was found and deleted; otherwise, false.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function deleteMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n var metadataMap = GetOrCreateMetadataMap(target, propertyKey, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n if (!metadataMap.delete(metadataKey))\n return false;\n if (metadataMap.size > 0)\n return true;\n var targetMetadata = Metadata.get(target);\n targetMetadata.delete(propertyKey);\n if (targetMetadata.size > 0)\n return true;\n Metadata.delete(target);\n return true;\n }\n exporter(\"deleteMetadata\", deleteMetadata);\n function DecorateConstructor(decorators, target) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsConstructor(decorated))\n throw new TypeError();\n target = decorated;\n }\n }\n return target;\n }\n function DecorateProperty(decorators, target, propertyKey, descriptor) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target, propertyKey, descriptor);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsObject(decorated))\n throw new TypeError();\n descriptor = decorated;\n }\n }\n return descriptor;\n }\n function GetOrCreateMetadataMap(O, P, Create) {\n var targetMetadata = Metadata.get(O);\n if (IsUndefined(targetMetadata)) {\n if (!Create)\n return undefined;\n targetMetadata = new _Map();\n Metadata.set(O, targetMetadata);\n }\n var metadataMap = targetMetadata.get(P);\n if (IsUndefined(metadataMap)) {\n if (!Create)\n return undefined;\n metadataMap = new _Map();\n targetMetadata.set(P, metadataMap);\n }\n return metadataMap;\n }\n // 3.1.1.1 OrdinaryHasMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasmetadata\n function OrdinaryHasMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return true;\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryHasMetadata(MetadataKey, parent, P);\n return false;\n }\n // 3.1.2.1 OrdinaryHasOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasownmetadata\n function OrdinaryHasOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n return ToBoolean(metadataMap.has(MetadataKey));\n }\n // 3.1.3.1 OrdinaryGetMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetmetadata\n function OrdinaryGetMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return OrdinaryGetOwnMetadata(MetadataKey, O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryGetMetadata(MetadataKey, parent, P);\n return undefined;\n }\n // 3.1.4.1 OrdinaryGetOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetownmetadata\n function OrdinaryGetOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return undefined;\n return metadataMap.get(MetadataKey);\n }\n // 3.1.5.1 OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarydefineownmetadata\n function OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ true);\n metadataMap.set(MetadataKey, MetadataValue);\n }\n // 3.1.6.1 OrdinaryMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarymetadatakeys\n function OrdinaryMetadataKeys(O, P) {\n var ownKeys = OrdinaryOwnMetadataKeys(O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (parent === null)\n return ownKeys;\n var parentKeys = OrdinaryMetadataKeys(parent, P);\n if (parentKeys.length <= 0)\n return ownKeys;\n if (ownKeys.length <= 0)\n return parentKeys;\n var set = new _Set();\n var keys = [];\n for (var _i = 0, ownKeys_1 = ownKeys; _i < ownKeys_1.length; _i++) {\n var key = ownKeys_1[_i];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n for (var _a = 0, parentKeys_1 = parentKeys; _a < parentKeys_1.length; _a++) {\n var key = parentKeys_1[_a];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n return keys;\n }\n // 3.1.7.1 OrdinaryOwnMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryownmetadatakeys\n function OrdinaryOwnMetadataKeys(O, P) {\n var keys = [];\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return keys;\n var keysObj = metadataMap.keys();\n var iterator = GetIterator(keysObj);\n var k = 0;\n while (true) {\n var next = IteratorStep(iterator);\n if (!next) {\n keys.length = k;\n return keys;\n }\n var nextValue = IteratorValue(next);\n try {\n keys[k] = nextValue;\n }\n catch (e) {\n try {\n IteratorClose(iterator);\n }\n finally {\n throw e;\n }\n }\n k++;\n }\n }\n // 6 ECMAScript Data Typ0es and Values\n // https://tc39.github.io/ecma262/#sec-ecmascript-data-types-and-values\n function Type(x) {\n if (x === null)\n return 1 /* Null */;\n switch (typeof x) {\n case \"undefined\": return 0 /* Undefined */;\n case \"boolean\": return 2 /* Boolean */;\n case \"string\": return 3 /* String */;\n case \"symbol\": return 4 /* Symbol */;\n case \"number\": return 5 /* Number */;\n case \"object\": return x === null ? 1 /* Null */ : 6 /* Object */;\n default: return 6 /* Object */;\n }\n }\n // 6.1.1 The Undefined Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-undefined-type\n function IsUndefined(x) {\n return x === undefined;\n }\n // 6.1.2 The Null Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-null-type\n function IsNull(x) {\n return x === null;\n }\n // 6.1.5 The Symbol Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-symbol-type\n function IsSymbol(x) {\n return typeof x === \"symbol\";\n }\n // 6.1.7 The Object Type\n // https://tc39.github.io/ecma262/#sec-object-type\n function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }\n // 7.1 Type Conversion\n // https://tc39.github.io/ecma262/#sec-type-conversion\n // 7.1.1 ToPrimitive(input [, PreferredType])\n // https://tc39.github.io/ecma262/#sec-toprimitive\n function ToPrimitive(input, PreferredType) {\n switch (Type(input)) {\n case 0 /* Undefined */: return input;\n case 1 /* Null */: return input;\n case 2 /* Boolean */: return input;\n case 3 /* String */: return input;\n case 4 /* Symbol */: return input;\n case 5 /* Number */: return input;\n }\n var hint = PreferredType === 3 /* String */ ? \"string\" : PreferredType === 5 /* Number */ ? \"number\" : \"default\";\n var exoticToPrim = GetMethod(input, toPrimitiveSymbol);\n if (exoticToPrim !== undefined) {\n var result = exoticToPrim.call(input, hint);\n if (IsObject(result))\n throw new TypeError();\n return result;\n }\n return OrdinaryToPrimitive(input, hint === \"default\" ? \"number\" : hint);\n }\n // 7.1.1.1 OrdinaryToPrimitive(O, hint)\n // https://tc39.github.io/ecma262/#sec-ordinarytoprimitive\n function OrdinaryToPrimitive(O, hint) {\n if (hint === \"string\") {\n var toString_1 = O.toString;\n if (IsCallable(toString_1)) {\n var result = toString_1.call(O);\n if (!IsObject(result))\n return result;\n }\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n else {\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n var toString_2 = O.toString;\n if (IsCallable(toString_2)) {\n var result = toString_2.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n throw new TypeError();\n }\n // 7.1.2 ToBoolean(argument)\n // https://tc39.github.io/ecma262/2016/#sec-toboolean\n function ToBoolean(argument) {\n return !!argument;\n }\n // 7.1.12 ToString(argument)\n // https://tc39.github.io/ecma262/#sec-tostring\n function ToString(argument) {\n return \"\" + argument;\n }\n // 7.1.14 ToPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-topropertykey\n function ToPropertyKey(argument) {\n var key = ToPrimitive(argument, 3 /* String */);\n if (IsSymbol(key))\n return key;\n return ToString(key);\n }\n // 7.2 Testing and Comparison Operations\n // https://tc39.github.io/ecma262/#sec-testing-and-comparison-operations\n // 7.2.2 IsArray(argument)\n // https://tc39.github.io/ecma262/#sec-isarray\n function IsArray(argument) {\n return Array.isArray\n ? Array.isArray(argument)\n : argument instanceof Object\n ? argument instanceof Array\n : Object.prototype.toString.call(argument) === \"[object Array]\";\n }\n // 7.2.3 IsCallable(argument)\n // https://tc39.github.io/ecma262/#sec-iscallable\n function IsCallable(argument) {\n // NOTE: This is an approximation as we cannot check for [[Call]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.4 IsConstructor(argument)\n // https://tc39.github.io/ecma262/#sec-isconstructor\n function IsConstructor(argument) {\n // NOTE: This is an approximation as we cannot check for [[Construct]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.7 IsPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-ispropertykey\n function IsPropertyKey(argument) {\n switch (Type(argument)) {\n case 3 /* String */: return true;\n case 4 /* Symbol */: return true;\n default: return false;\n }\n }\n // 7.3 Operations on Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-objects\n // 7.3.9 GetMethod(V, P)\n // https://tc39.github.io/ecma262/#sec-getmethod\n function GetMethod(V, P) {\n var func = V[P];\n if (func === undefined || func === null)\n return undefined;\n if (!IsCallable(func))\n throw new TypeError();\n return func;\n }\n // 7.4 Operations on Iterator Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-iterator-objects\n function GetIterator(obj) {\n var method = GetMethod(obj, iteratorSymbol);\n if (!IsCallable(method))\n throw new TypeError(); // from Call\n var iterator = method.call(obj);\n if (!IsObject(iterator))\n throw new TypeError();\n return iterator;\n }\n // 7.4.4 IteratorValue(iterResult)\n // https://tc39.github.io/ecma262/2016/#sec-iteratorvalue\n function IteratorValue(iterResult) {\n return iterResult.value;\n }\n // 7.4.5 IteratorStep(iterator)\n // https://tc39.github.io/ecma262/#sec-iteratorstep\n function IteratorStep(iterator) {\n var result = iterator.next();\n return result.done ? false : result;\n }\n // 7.4.6 IteratorClose(iterator, completion)\n // https://tc39.github.io/ecma262/#sec-iteratorclose\n function IteratorClose(iterator) {\n var f = iterator[\"return\"];\n if (f)\n f.call(iterator);\n }\n // 9.1 Ordinary Object Internal Methods and Internal Slots\n // https://tc39.github.io/ecma262/#sec-ordinary-object-internal-methods-and-internal-slots\n // 9.1.1.1 OrdinaryGetPrototypeOf(O)\n // https://tc39.github.io/ecma262/#sec-ordinarygetprototypeof\n function OrdinaryGetPrototypeOf(O) {\n var proto = Object.getPrototypeOf(O);\n if (typeof O !== \"function\" || O === functionPrototype)\n return proto;\n // TypeScript doesn't set __proto__ in ES5, as it's non-standard.\n // Try to determine the superclass constructor. Compatible implementations\n // must either set __proto__ on a subclass constructor to the superclass constructor,\n // or ensure each class has a valid `constructor` property on its prototype that\n // points back to the constructor.\n // If this is not the same as Function.[[Prototype]], then this is definately inherited.\n // This is the case when in ES6 or when using __proto__ in a compatible browser.\n if (proto !== functionPrototype)\n return proto;\n // If the super prototype is Object.prototype, null, or undefined, then we cannot determine the heritage.\n var prototype = O.prototype;\n var prototypeProto = prototype && Object.getPrototypeOf(prototype);\n if (prototypeProto == null || prototypeProto === Object.prototype)\n return proto;\n // If the constructor was not a function, then we cannot determine the heritage.\n var constructor = prototypeProto.constructor;\n if (typeof constructor !== \"function\")\n return proto;\n // If we have some kind of self-reference, then we cannot determine the heritage.\n if (constructor === O)\n return proto;\n // we have a pretty good guess at the heritage.\n return constructor;\n }\n // naive Map shim\n function CreateMapPolyfill() {\n var cacheSentinel = {};\n var arraySentinel = [];\n var MapIterator = /** @class */ (function () {\n function MapIterator(keys, values, selector) {\n this._index = 0;\n this._keys = keys;\n this._values = values;\n this._selector = selector;\n }\n MapIterator.prototype[\"@@iterator\"] = function () { return this; };\n MapIterator.prototype[iteratorSymbol] = function () { return this; };\n MapIterator.prototype.next = function () {\n var index = this._index;\n if (index >= 0 && index < this._keys.length) {\n var result = this._selector(this._keys[index], this._values[index]);\n if (index + 1 >= this._keys.length) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n else {\n this._index++;\n }\n return { value: result, done: false };\n }\n return { value: undefined, done: true };\n };\n MapIterator.prototype.throw = function (error) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n throw error;\n };\n MapIterator.prototype.return = function (value) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n return { value: value, done: true };\n };\n return MapIterator;\n }());\n return /** @class */ (function () {\n function Map() {\n this._keys = [];\n this._values = [];\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n Object.defineProperty(Map.prototype, \"size\", {\n get: function () { return this._keys.length; },\n enumerable: true,\n configurable: true\n });\n Map.prototype.has = function (key) { return this._find(key, /*insert*/ false) >= 0; };\n Map.prototype.get = function (key) {\n var index = this._find(key, /*insert*/ false);\n return index >= 0 ? this._values[index] : undefined;\n };\n Map.prototype.set = function (key, value) {\n var index = this._find(key, /*insert*/ true);\n this._values[index] = value;\n return this;\n };\n Map.prototype.delete = function (key) {\n var index = this._find(key, /*insert*/ false);\n if (index >= 0) {\n var size = this._keys.length;\n for (var i = index + 1; i < size; i++) {\n this._keys[i - 1] = this._keys[i];\n this._values[i - 1] = this._values[i];\n }\n this._keys.length--;\n this._values.length--;\n if (key === this._cacheKey) {\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n return true;\n }\n return false;\n };\n Map.prototype.clear = function () {\n this._keys.length = 0;\n this._values.length = 0;\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n };\n Map.prototype.keys = function () { return new MapIterator(this._keys, this._values, getKey); };\n Map.prototype.values = function () { return new MapIterator(this._keys, this._values, getValue); };\n Map.prototype.entries = function () { return new MapIterator(this._keys, this._values, getEntry); };\n Map.prototype[\"@@iterator\"] = function () { return this.entries(); };\n Map.prototype[iteratorSymbol] = function () { return this.entries(); };\n Map.prototype._find = function (key, insert) {\n if (this._cacheKey !== key) {\n this._cacheIndex = this._keys.indexOf(this._cacheKey = key);\n }\n if (this._cacheIndex < 0 && insert) {\n this._cacheIndex = this._keys.length;\n this._keys.push(key);\n this._values.push(undefined);\n }\n return this._cacheIndex;\n };\n return Map;\n }());\n function getKey(key, _) {\n return key;\n }\n function getValue(_, value) {\n return value;\n }\n function getEntry(key, value) {\n return [key, value];\n }\n }\n // naive Set shim\n function CreateSetPolyfill() {\n return /** @class */ (function () {\n function Set() {\n this._map = new _Map();\n }\n Object.defineProperty(Set.prototype, \"size\", {\n get: function () { return this._map.size; },\n enumerable: true,\n configurable: true\n });\n Set.prototype.has = function (value) { return this._map.has(value); };\n Set.prototype.add = function (value) { return this._map.set(value, value), this; };\n Set.prototype.delete = function (value) { return this._map.delete(value); };\n Set.prototype.clear = function () { this._map.clear(); };\n Set.prototype.keys = function () { return this._map.keys(); };\n Set.prototype.values = function () { return this._map.values(); };\n Set.prototype.entries = function () { return this._map.entries(); };\n Set.prototype[\"@@iterator\"] = function () { return this.keys(); };\n Set.prototype[iteratorSymbol] = function () { return this.keys(); };\n return Set;\n }());\n }\n // naive WeakMap shim\n function CreateWeakMapPolyfill() {\n var UUID_SIZE = 16;\n var keys = HashMap.create();\n var rootKey = CreateUniqueKey();\n return /** @class */ (function () {\n function WeakMap() {\n this._key = CreateUniqueKey();\n }\n WeakMap.prototype.has = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.has(table, this._key) : false;\n };\n WeakMap.prototype.get = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.get(table, this._key) : undefined;\n };\n WeakMap.prototype.set = function (target, value) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ true);\n table[this._key] = value;\n return this;\n };\n WeakMap.prototype.delete = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? delete table[this._key] : false;\n };\n WeakMap.prototype.clear = function () {\n // NOTE: not a real clear, just makes the previous data unreachable\n this._key = CreateUniqueKey();\n };\n return WeakMap;\n }());\n function CreateUniqueKey() {\n var key;\n do\n key = \"@@WeakMap@@\" + CreateUUID();\n while (HashMap.has(keys, key));\n keys[key] = true;\n return key;\n }\n function GetOrCreateWeakMapTable(target, create) {\n if (!hasOwn.call(target, rootKey)) {\n if (!create)\n return undefined;\n Object.defineProperty(target, rootKey, { value: HashMap.create() });\n }\n return target[rootKey];\n }\n function FillRandomBytes(buffer, size) {\n for (var i = 0; i < size; ++i)\n buffer[i] = Math.random() * 0xff | 0;\n return buffer;\n }\n function GenRandomBytes(size) {\n if (typeof Uint8Array === \"function\") {\n if (typeof crypto !== \"undefined\")\n return crypto.getRandomValues(new Uint8Array(size));\n if (typeof msCrypto !== \"undefined\")\n return msCrypto.getRandomValues(new Uint8Array(size));\n return FillRandomBytes(new Uint8Array(size), size);\n }\n return FillRandomBytes(new Array(size), size);\n }\n function CreateUUID() {\n var data = GenRandomBytes(UUID_SIZE);\n // mark as random - RFC 4122 § 4.4\n data[6] = data[6] & 0x4f | 0x40;\n data[8] = data[8] & 0xbf | 0x80;\n var result = \"\";\n for (var offset = 0; offset < UUID_SIZE; ++offset) {\n var byte = data[offset];\n if (offset === 4 || offset === 6 || offset === 8)\n result += \"-\";\n if (byte < 16)\n result += \"0\";\n result += byte.toString(16).toLowerCase();\n }\n return result;\n }\n }\n // uses a heuristic used by v8 and chakra to force an object into dictionary mode.\n function MakeDictionary(obj) {\n obj.__ = undefined;\n delete obj.__;\n return obj;\n }\n });\n })(Reflect || (Reflect = {}))\n}\n","const SERVICE_IDENTIFIER = {\n TaroElement: 'TaroElement',\n TaroElementFactory: 'Factory',\n TaroText: 'TaroText',\n TaroTextFactory: 'Factory',\n TaroNodeImpl: 'TaroNodeImpl',\n TaroElementImpl: 'TaroElementImpl',\n InnerHTMLImpl: 'InnerHTMLImpl',\n insertAdjacentHTMLImpl: 'insertAdjacentHTMLImpl',\n getBoundingClientRectImpl: 'getBoundingClientRectImpl',\n Hooks: 'hooks',\n onRemoveAttribute: 'onRemoveAttribute',\n getLifecycle: 'getLifecycle',\n getPathIndex: 'getPathIndex',\n getEventCenter: 'getEventCenter',\n isBubbleEvents: 'isBubbleEvents',\n getSpecialNodes: 'getSpecialNodes',\n eventCenter: 'eventCenter',\n modifyMpEvent: 'modifyMpEvent',\n modifyTaroEvent: 'modifyTaroEvent',\n batchedEventUpdates: 'batchedEventUpdates',\n mergePageInstance: 'mergePageInstance',\n createPullDownComponent: 'createPullDownComponent',\n getDOMNode: 'getDOMNode',\n initNativeApi: 'initNativeApi',\n modifyHydrateData: 'modifyHydrateData',\n modifySetAttrPayload: 'modifySetAttrPayload',\n modifyRmAttrPayload: 'modifyRmAttrPayload',\n onAddEvent: 'onAddEvent'\n}\n\nexport default SERVICE_IDENTIFIER\n","export const PROPERTY_THRESHOLD = 2046\nexport const TARO_RUNTIME = 'Taro runtime'\nexport const HOOKS_APP_ID = 'taro-app'\nexport const SET_DATA = '小程序 setData'\nexport const PAGE_INIT = '页面初始化'\nexport const ROOT_STR = 'root'\nexport const HTML = 'html'\nexport const HEAD = 'head'\nexport const BODY = 'body'\nexport const APP = 'app'\nexport const CONTAINER = 'container'\nexport const DOCUMENT_ELEMENT_NAME = '#document'\nexport const ID = 'id'\nexport const UID = 'uid'\nexport const CLASS = 'class'\nexport const STYLE = 'style'\nexport const FOCUS = 'focus'\nexport const VIEW = 'view'\nexport const STATIC_VIEW = 'static-view'\nexport const PURE_VIEW = 'pure-view'\nexport const PROPS = 'props'\nexport const DATASET = 'dataset'\nexport const OBJECT = 'object'\nexport const VALUE = 'value'\nexport const INPUT = 'input'\nexport const CHANGE = 'change'\nexport const CUSTOM_WRAPPER = 'custom-wrapper'\nexport const TARGET = 'target'\nexport const CURRENT_TARGET = 'currentTarget'\nexport const TYPE = 'type'\nexport const CONFIRM = 'confirm'\nexport const TIME_STAMP = 'timeStamp'\nexport const KEY_CODE = 'keyCode'\nexport const TOUCHMOVE = 'touchmove'\nexport const DATE = 'Date'\nexport const SET_TIMEOUT = 'setTimeout'\nexport const CATCHMOVE = 'catchMove'\nexport const CATCH_VIEW = 'catch-view'\nexport const COMMENT = 'comment'\n","import { Shortcuts } from '@tarojs/shared'\nimport { NodeType } from '../dom/node_types'\nimport {\n ROOT_STR,\n STYLE,\n ID,\n UID,\n CLASS,\n COMMENT\n} from '../constants'\n\nimport type { TaroElement } from '../dom/element'\nimport type { TaroText } from '../dom/text'\nimport type { TaroNode } from '../dom/node'\n\nexport const incrementId = () => {\n let id = 0\n return () => (id++).toString()\n}\n\nexport function isElement (node: TaroNode): node is TaroElement {\n return node.nodeType === NodeType.ELEMENT_NODE\n}\n\nexport function isText (node: TaroNode): node is TaroText {\n return node.nodeType === NodeType.TEXT_NODE\n}\n\nexport function isComment (node: TaroNode): boolean {\n return node.nodeName === COMMENT\n}\n\nexport function isHasExtractProp (el: TaroElement): boolean {\n const res = Object.keys(el.props).find(prop => {\n return !(/^(class|style|id)$/.test(prop) || prop.startsWith('data-'))\n })\n return Boolean(res)\n}\n\n/**\n * 往上寻找组件树直到 root，寻找是否有祖先组件绑定了同类型的事件\n * @param node 当前组件\n * @param type 事件类型\n */\nexport function isParentBinded (node: TaroElement | null, type: string): boolean {\n let res = false\n while (node?.parentElement && node.parentElement._path !== ROOT_STR) {\n if (node.parentElement.__handlers[type]?.length) {\n res = true\n break\n }\n node = node.parentElement\n }\n return res\n}\n\nexport function shortcutAttr (key: string): string {\n switch (key) {\n case STYLE:\n return Shortcuts.Style\n case ID:\n return UID\n case CLASS:\n return Shortcuts.Class\n default:\n return key\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { isArray, isObject, warn } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { EventHandler, AddEventListenerOptions, IHooks } from '../interface'\n\n@injectable()\nexport class TaroEventTarget {\n public __handlers: Record = {}\n public hooks: IHooks\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: IHooks\n ) {\n this.hooks = hooks\n }\n\n public addEventListener (type: string, handler: EventHandler, options?: boolean | AddEventListenerOptions) {\n this.hooks.onAddEvent?.(type, handler, options, this)\n if (type === 'regionchange') {\n // map 组件的 regionchange 事件非常特殊，详情：https://github.com/NervJS/taro/issues/5766\n this.addEventListener('begin', handler, options)\n this.addEventListener('end', handler, options)\n return\n }\n type = type.toLowerCase()\n const handlers = this.__handlers[type]\n let isCapture = Boolean(options)\n let isOnce = false\n if (isObject(options)) {\n isCapture = Boolean(options.capture)\n isOnce = Boolean(options.once)\n }\n\n if (isOnce) {\n const wrapper = function () {\n handler.apply(this, arguments) // this 指向 Element\n this.removeEventListener(type, wrapper)\n }\n this.addEventListener(type, wrapper, {\n ...(options as AddEventListenerOptions),\n once: false\n })\n return\n }\n\n process.env.NODE_ENV !== 'production' && warn(isCapture, 'Taro 暂未实现 event 的 capture 特性。')\n\n if (isArray(handlers)) {\n handlers.push(handler)\n } else {\n this.__handlers[type] = [handler]\n }\n }\n\n public removeEventListener (type: string, handler: EventHandler) {\n type = type.toLowerCase()\n if (handler == null) {\n return\n }\n\n const handlers = this.__handlers[type]\n if (!isArray(handlers)) {\n return\n }\n\n const index = handlers.indexOf(handler)\n\n process.env.NODE_ENV !== 'production' && warn(index === -1, `事件: '${type}' 没有注册在 DOM 中，因此不会被移除。`)\n\n handlers.splice(index, 1)\n }\n\n public isAnyEventBinded (): boolean {\n const handlers = this.__handlers\n const isAnyEventBinded = Object.keys(handlers).find(key => handlers[key].length)\n return Boolean(isAnyEventBinded)\n }\n}\n","import { Shortcuts, toCamelCase } from '@tarojs/shared'\nimport { isText, isHasExtractProp, isComment } from './utils'\nimport {\n VIEW,\n CLASS,\n STYLE,\n ID,\n PURE_VIEW,\n CATCHMOVE,\n CATCH_VIEW\n} from './constants'\n\nimport type { MiniData, MiniElementData } from './interface'\nimport type { TaroElement } from './dom/element'\nimport type { TaroText } from './dom/text'\n\n/**\n * React also has a fancy function's name for this: `hydrate()`.\n * You may have been heard `hydrate` as a SSR-related function,\n * actually, `hydrate` basicly do the `render()` thing, but ignore some properties,\n * it's a vnode traverser and modifier: that's exactly what Taro's doing in here.\n */\nexport function hydrate (node: TaroElement | TaroText): MiniData {\n const nodeName = node.nodeName\n\n if (isText(node)) {\n return {\n [Shortcuts.Text]: node.nodeValue,\n [Shortcuts.NodeName]: nodeName\n }\n }\n\n const data: MiniElementData = {\n [Shortcuts.NodeName]: nodeName,\n uid: node.uid\n }\n const { props } = node\n const SPECIAL_NODES = node.hooks.getSpecialNodes()\n\n if (!node.isAnyEventBinded() && SPECIAL_NODES.indexOf(nodeName) > -1) {\n data[Shortcuts.NodeName] = `static-${nodeName}`\n if (nodeName === VIEW && !isHasExtractProp(node)) {\n data[Shortcuts.NodeName] = PURE_VIEW\n }\n }\n\n for (const prop in props) {\n const propInCamelCase = toCamelCase(prop)\n if (\n !prop.startsWith('data-') && // 在 node.dataset 的数据\n prop !== CLASS &&\n prop !== STYLE &&\n prop !== ID &&\n propInCamelCase !== CATCHMOVE\n ) {\n data[propInCamelCase] = props[prop]\n }\n if (nodeName === VIEW && propInCamelCase === CATCHMOVE && props[prop] !== 'false') {\n data[Shortcuts.NodeName] = CATCH_VIEW\n }\n }\n\n let { childNodes } = node\n\n // 过滤 comment 节点\n childNodes = childNodes.filter(node => !isComment(node))\n\n if (childNodes.length > 0) {\n data[Shortcuts.Childnodes] = childNodes.map(hydrate)\n } else {\n data[Shortcuts.Childnodes] = []\n }\n\n if (node.className !== '') {\n data[Shortcuts.Class] = node.className\n }\n\n if (node.cssText !== '' && nodeName !== 'swiper-item') {\n data[Shortcuts.Style] = node.cssText\n }\n\n node.hooks.modifyHydrateData?.(data)\n\n return data\n}\n","import type { TaroNode } from './node'\nexport const eventSource = new Map()\n","export enum ElementNames {\n Element = 'Element',\n Document = 'Document',\n RootElement = 'RootElement',\n FormElement = 'FormElement'\n}\n\nexport interface InstanceFactory {\n (...args: any[]): T\n}\n\nexport interface InstanceNamedFactory {\n (named: string): (...args: any[]) => T\n}\n","import { inject, injectable } from 'inversify'\nimport { Shortcuts, ensure } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { NodeType } from './node_types'\nimport { incrementId, isComment } from '../utils'\nimport { TaroEventTarget } from './event-target'\nimport { hydrate } from '../hydrate'\nimport { eventSource } from './event-source'\nimport { ElementNames } from '../interface'\nimport {\n STYLE,\n DATASET,\n PROPS,\n OBJECT\n} from '../constants'\n\nimport type { UpdatePayload, InstanceNamedFactory } from '../interface'\nimport type { TaroDocument } from './document'\nimport type { TaroRootElement } from './root'\nimport type { TaroElement } from './element'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { Hooks } from '../hooks'\n\nconst nodeId = incrementId()\n\n@injectable()\nexport class TaroNode extends TaroEventTarget {\n public uid: string\n public nodeType: NodeType\n public nodeName: string\n public parentNode: TaroNode | null = null\n public childNodes: TaroNode[] = []\n\n protected _getElement: InstanceNamedFactory\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) impl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks\n ) {\n super(hooks)\n impl.bind(this)\n this._getElement = getElement\n this.uid = `_n_${nodeId()}`\n eventSource.set(this.uid, this)\n }\n\n private hydrate = (node: TaroNode) => () => hydrate(node as TaroElement)\n\n /**\n * like jQuery's $.empty()\n */\n private _empty () {\n while (this.childNodes.length > 0) {\n const child = this.childNodes[0]\n child.parentNode = null\n eventSource.delete(child.uid)\n this.childNodes.shift()\n }\n }\n\n protected get _root (): TaroRootElement | null {\n return this.parentNode?._root || null\n }\n\n protected findIndex (refChild: TaroNode): number {\n const index = this.childNodes.indexOf(refChild)\n\n ensure(index !== -1, 'The node to be replaced is not a child of this node.')\n\n return index\n }\n\n public get _path (): string {\n const parentNode = this.parentNode\n\n if (parentNode) {\n // 计算路径时，先过滤掉 comment 节点\n const list = parentNode.childNodes.filter(node => !isComment(node))\n const indexOfNode = list.indexOf(this)\n const index = this.hooks.getPathIndex(indexOfNode)\n\n return `${parentNode._path}.${Shortcuts.Childnodes}.${index}`\n }\n\n return ''\n }\n\n public get nextSibling (): TaroNode | null {\n const parentNode = this.parentNode\n return parentNode?.childNodes[parentNode.findIndex(this) + 1] || null\n }\n\n public get previousSibling (): TaroNode | null {\n const parentNode = this.parentNode\n return parentNode?.childNodes[parentNode.findIndex(this) - 1] || null\n }\n\n public get parentElement (): TaroElement | null {\n const parentNode = this.parentNode\n if (parentNode?.nodeType === NodeType.ELEMENT_NODE) {\n return parentNode as TaroElement\n }\n return null\n }\n\n public get firstChild (): TaroNode | null {\n return this.childNodes[0] || null\n }\n\n public get lastChild (): TaroNode | null {\n const childNodes = this.childNodes\n return childNodes[childNodes.length - 1] || null\n }\n\n /**\n * @textContent 目前只能置空子元素\n * @TODO 等待完整 innerHTML 实现\n */\n public set textContent (text: string) {\n this._empty()\n if (text === '') {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => []\n })\n } else {\n const document = this._getElement(ElementNames.Document)()\n this.appendChild(document.createTextNode(text))\n }\n }\n\n public insertBefore (newChild: T, refChild?: TaroNode | null, isReplace?: boolean): T {\n newChild.remove()\n newChild.parentNode = this\n let payload: UpdatePayload\n\n if (refChild) {\n const index = this.findIndex(refChild)\n this.childNodes.splice(index, 0, newChild)\n if (isReplace) {\n payload = {\n path: newChild._path,\n value: this.hydrate(newChild)\n }\n } else {\n payload = {\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => this.childNodes.map(hydrate)\n }\n }\n } else {\n this.childNodes.push(newChild)\n payload = {\n path: newChild._path,\n value: this.hydrate(newChild)\n }\n }\n\n this.enqueueUpdate(payload)\n\n if (!eventSource.has(newChild.uid)) {\n eventSource.set(newChild.uid, newChild)\n }\n\n return newChild\n }\n\n public appendChild (child: TaroNode) {\n this.insertBefore(child)\n }\n\n public replaceChild (newChild: TaroNode, oldChild: TaroNode) {\n if (oldChild.parentNode === this) {\n this.insertBefore(newChild, oldChild, true)\n oldChild.remove(true)\n return oldChild\n }\n }\n\n public removeChild (child: T, isReplace?: boolean): T {\n const index = this.findIndex(child)\n this.childNodes.splice(index, 1)\n if (!isReplace) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => this.childNodes.map(hydrate)\n })\n }\n child.parentNode = null\n eventSource.delete(child.uid)\n // @TODO: eventSource memory overflow\n // child._empty()\n return child\n }\n\n public remove (isReplace?: boolean) {\n this.parentNode?.removeChild(this, isReplace)\n }\n\n public hasChildNodes () {\n return this.childNodes.length > 0\n }\n\n public enqueueUpdate (payload: UpdatePayload) {\n this._root?.enqueueUpdate(payload)\n }\n\n public cloneNode (isDeep = false) {\n const document = this._getElement(ElementNames.Document)()\n let newNode\n\n if (this.nodeType === NodeType.ELEMENT_NODE) {\n newNode = document.createElement(this.nodeName)\n } else if (this.nodeType === NodeType.TEXT_NODE) {\n newNode = document.createTextNode('')\n }\n\n for (const key in this) {\n const value: any = this[key]\n if ([PROPS, DATASET].includes(key) && typeof value === OBJECT) {\n newNode[key] = { ...value }\n } else if (key === '_value') {\n newNode[key] = value\n } else if (key === STYLE) {\n newNode.style._value = { ...value._value }\n newNode.style._usedStyleProp = new Set(Array.from(value._usedStyleProp))\n }\n }\n\n if (isDeep) {\n newNode.childNodes = this.childNodes.map(node => node.cloneNode(true))\n }\n\n return newNode\n }\n\n public contains (node: TaroNode & { id?: string }): boolean {\n let isContains = false\n this.childNodes.some(childNode => {\n const { uid } = childNode\n if (uid === node.uid || uid === node.id || childNode.contains(node)) {\n isContains = true\n return true\n }\n })\n return isContains\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { Shortcuts } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNode } from './node'\nimport { NodeType } from './node_types'\n\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { InstanceNamedFactory } from '../interface'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroText extends TaroNode {\n public _value: string\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks\n ) {\n super(nodeImpl, getElement, hooks)\n this.nodeType = NodeType.TEXT_NODE\n this.nodeName = '#text'\n }\n\n public set textContent (text: string) {\n this._value = text\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Text}`,\n value: text\n })\n }\n\n public get textContent (): string {\n return this._value\n }\n\n public set nodeValue (text: string) {\n this.textContent = text\n }\n\n public get nodeValue (): string {\n return this._value\n }\n}\n","/*\n *\n * https://www.w3.org/Style/CSS/all-properties.en.html\n */\n\nconst styleProperties = [\n 'all',\n 'appearance',\n 'blockOverflow',\n 'blockSize',\n 'bottom',\n 'clear',\n 'contain',\n 'content',\n 'continue',\n 'cursor',\n 'direction',\n 'display',\n 'filter',\n 'float',\n 'gap',\n 'height',\n 'inset',\n 'isolation',\n 'left',\n 'letterSpacing',\n 'lightingColor',\n 'markerSide',\n 'mixBlendMode',\n 'opacity',\n 'order',\n 'position',\n 'quotes',\n 'resize',\n 'right',\n 'rowGap',\n 'tabSize',\n 'tableLayout',\n 'top',\n 'userSelect',\n 'verticalAlign',\n 'visibility',\n 'voiceFamily',\n 'volume',\n 'whiteSpace',\n 'widows',\n 'width',\n 'zIndex'\n\n /** 非常用 style */\n // 'azimuth',\n // 'backfaceVisibility',\n // 'baselineShift',\n // 'captionSide',\n // 'chains',\n // 'dominantBaseline',\n // 'elevation',\n // 'emptyCells',\n // 'forcedColorAdjust',\n // 'glyphOrientationVertical',\n // 'hangingPunctuation',\n // 'hyphenateCharacter',\n // 'hyphens',\n // 'imageOrientation',\n // 'imageResolution',\n // 'orphans',\n // 'playDuring',\n // 'pointerEvents',\n // 'regionFragment',\n // 'richness',\n // 'running',\n // 'scrollBehavior',\n // 'speechRate',\n // 'stress',\n // 'stringSet',\n // 'unicodeBidi',\n // 'willChange',\n // 'writingMode',\n]\n\n// 减少文件体积\nfunction combine (prefix: string, list: string[], excludeSelf?: boolean) {\n !excludeSelf && styleProperties.push(prefix)\n list.forEach(item => {\n styleProperties.push(prefix + item)\n })\n}\n\nconst color = 'Color'\nconst style = 'Style'\nconst width = 'Width'\nconst image = 'Image'\nconst size = 'Size'\nconst color_style_width = [color, style, width]\nconst fitlength_fitwidth_image = ['FitLength', 'FitWidth', image]\nconst fitlength_fitwidth_image_radius = [...fitlength_fitwidth_image, 'Radius']\nconst color_style_width_fitlength_fitwidth_image = [...color_style_width, ...fitlength_fitwidth_image]\nconst endRadius_startRadius = ['EndRadius', 'StartRadius']\nconst bottom_left_right_top = ['Bottom', 'Left', 'Right', 'Top']\nconst end_start = ['End', 'Start']\nconst content_items_self = ['Content', 'Items', 'Self']\nconst blockSize_height_inlineSize_width = ['BlockSize', 'Height', 'InlineSize', width]\nconst after_before = ['After', 'Before']\n\ncombine('borderBlock', color_style_width)\ncombine('borderBlockEnd', color_style_width)\ncombine('borderBlockStart', color_style_width)\ncombine('outline', [...color_style_width, 'Offset'])\ncombine('border', [...color_style_width, 'Boundary', 'Break', 'Collapse', 'Radius', 'Spacing'])\ncombine('borderFit', ['Length', width])\ncombine('borderInline', color_style_width)\ncombine('borderInlineEnd', color_style_width)\ncombine('borderInlineStart', color_style_width)\ncombine('borderLeft', color_style_width_fitlength_fitwidth_image)\ncombine('borderRight', color_style_width_fitlength_fitwidth_image)\ncombine('borderTop', color_style_width_fitlength_fitwidth_image)\ncombine('borderBottom', color_style_width_fitlength_fitwidth_image)\ncombine('textDecoration', [color, style, 'Line'])\ncombine('textEmphasis', [color, style, 'Position'])\ncombine('scrollMargin', bottom_left_right_top)\ncombine('scrollPadding', bottom_left_right_top)\ncombine('padding', bottom_left_right_top)\ncombine('margin', [...bottom_left_right_top, 'Trim'])\ncombine('scrollMarginBlock', end_start)\ncombine('scrollMarginInline', end_start)\ncombine('scrollPaddingBlock', end_start)\ncombine('scrollPaddingInline', end_start)\ncombine('gridColumn', end_start)\ncombine('gridRow', end_start)\ncombine('insetBlock', end_start)\ncombine('insetInline', end_start)\ncombine('marginBlock', end_start)\ncombine('marginInline', end_start)\ncombine('paddingBlock', end_start)\ncombine('paddingInline', end_start)\ncombine('pause', after_before)\ncombine('cue', after_before)\ncombine('mask', ['Clip', 'Composite', image, 'Mode', 'Origin', 'Position', 'Repeat', size, 'Type'])\ncombine('borderImage', ['Outset', 'Repeat', 'Slice', 'Source', 'Transform', width])\ncombine('maskBorder', ['Mode', 'Outset', 'Repeat', 'Slice', 'Source', width])\ncombine('font', ['Family', 'FeatureSettings', 'Kerning', 'LanguageOverride', 'MaxSize', 'MinSize', 'OpticalSizing', 'Palette', size, 'SizeAdjust', 'Stretch', style, 'Weight', 'VariationSettings'])\ncombine('fontSynthesis', ['SmallCaps', style, 'Weight'])\ncombine('transform', ['Box', 'Origin', style])\ncombine('background', [color, image, 'Attachment', 'BlendMode', 'Clip', 'Origin', 'Position', 'Repeat', size])\ncombine('listStyle', [image, 'Position', 'Type'])\ncombine('scrollSnap', ['Align', 'Stop', 'Type'])\ncombine('grid', ['Area', 'AutoColumns', 'AutoFlow', 'AutoRows'])\ncombine('gridTemplate', ['Areas', 'Columns', 'Rows'])\ncombine('overflow', ['Block', 'Inline', 'Wrap', 'X', 'Y'])\ncombine('transition', ['Delay', 'Duration', 'Property', 'TimingFunction'])\ncombine('lineStacking', ['Ruby', 'Shift', 'Strategy'])\ncombine('color', ['Adjust', 'InterpolationFilters', 'Scheme'])\ncombine('textAlign', ['All', 'Last'])\ncombine('page', ['BreakAfter', 'BreakBefore', 'BreakInside'])\ncombine('speak', ['Header', 'Numeral', 'Punctuation'])\ncombine('animation', ['Delay', 'Direction', 'Duration', 'FillMode', 'IterationCount', 'Name', 'PlayState', 'TimingFunction'])\ncombine('flex', ['Basis', 'Direction', 'Flow', 'Grow', 'Shrink', 'Wrap'])\ncombine('offset', [...after_before, ...end_start, 'Anchor', 'Distance', 'Path', 'Position', 'Rotate'])\ncombine('fontVariant', ['Alternates', 'Caps', 'EastAsian', 'Emoji', 'Ligatures', 'Numeric', 'Position'])\ncombine('perspective', ['Origin'])\ncombine('pitch', ['Range'])\ncombine('clip', ['Path', 'Rule'])\ncombine('flow', ['From', 'Into'])\n\ncombine('align', ['Content', 'Items', 'Self'], true)\ncombine('alignment', ['Adjust', 'Baseline'], true)\ncombine('bookmark', ['Label', 'Level', 'State'], true)\ncombine('borderStart', endRadius_startRadius, true)\ncombine('borderEnd', endRadius_startRadius, true)\ncombine('borderCorner', ['Fit', image, 'ImageTransform'], true)\ncombine('borderTopLeft', fitlength_fitwidth_image_radius, true)\ncombine('borderTopRight', fitlength_fitwidth_image_radius, true)\ncombine('borderBottomLeft', fitlength_fitwidth_image_radius, true)\ncombine('borderBottomRight', fitlength_fitwidth_image_radius, true)\ncombine('column', ['s', 'Count', 'Fill', 'Gap', 'Rule', 'RuleColor', 'RuleStyle', 'RuleWidth', 'Span', width], true)\ncombine('break', [...after_before, 'Inside'], true)\ncombine('wrap', [...after_before, 'Flow', 'Inside', 'Through'], true)\ncombine('justify', content_items_self, true)\ncombine('place', content_items_self, true)\ncombine('max', [...blockSize_height_inlineSize_width, 'Lines'], true)\ncombine('min', blockSize_height_inlineSize_width, true)\ncombine('line', ['Break', 'Clamp', 'Grid', 'Height', 'Padding', 'Snap'], true)\ncombine('inline', ['BoxAlign', size, 'Sizing'], true)\ncombine('text', ['CombineUpright', 'GroupAlign', 'Height', 'Indent', 'Justify', 'Orientation', 'Overflow', 'Shadow', 'SpaceCollapse', 'SpaceTrim', 'Spacing', 'Transform', 'UnderlinePosition', 'Wrap'], true)\ncombine('shape', ['ImageThreshold', 'Inside', 'Margin', 'Outside'], true)\ncombine('word', ['Break', 'Spacing', 'Wrap'], true)\ncombine('nav', ['Down', 'Left', 'Right', 'Up'], true)\ncombine('object', ['Fit', 'Position'], true)\ncombine('box', ['DecorationBreak', 'Shadow', 'Sizing', 'Snap'], true)\n\n/** 非常用 style */\n// combine('caret', [color, 'Shape'])\n// combine('counter', ['Increment', 'Reset', 'Set'], true)\n// combine('dropInitial', ['AfterAdjust', 'AfterAlign', 'BeforeAdjust', 'BeforeAlign', size, 'Value'], true)\n// combine('flood', [color, 'Opacity'], true)\n// combine('footnote', ['Display', 'Policy'], true)\n// combine('hyphenateLimit', ['Chars', 'Last', 'Lines', 'Zone'], true)\n// combine('initialLetters', ['Align', 'Wrap'])\n// combine('ruby', ['Align', 'Merge', 'Position'], true)\n\nexport { styleProperties }\n","import { isUndefined, toCamelCase, toDashed, Shortcuts, warn, isString } from '@tarojs/shared'\nimport { styleProperties } from './style_properties'\nimport { TaroElement } from './element'\nimport { PROPERTY_THRESHOLD } from '../constants'\n\nfunction setStyle (this: Style, newVal: string, styleKey: string) {\n const old = this[styleKey]\n if (newVal) {\n this._usedStyleProp.add(styleKey)\n }\n\n process.env.NODE_ENV !== 'production' && warn(\n isString(newVal) && newVal.length > PROPERTY_THRESHOLD,\n `Style 属性 ${styleKey} 的值数据量过大，可能会影响渲染性能，考虑使用 CSS 类或其它方案替代。`\n )\n\n if (old !== newVal) {\n this._value[styleKey] = newVal\n this._element.enqueueUpdate({\n path: `${this._element._path}.${Shortcuts.Style}`,\n value: this.cssText\n })\n }\n}\n\nfunction initStyle (ctor: typeof Style) {\n const properties = {}\n\n for (let i = 0; i < styleProperties.length; i++) {\n const styleKey = styleProperties[i]\n properties[styleKey] = {\n get (this: Style) {\n return this._value[styleKey] || ''\n },\n set (this: Style, newVal: string) {\n setStyle.call(this, newVal, styleKey)\n }\n }\n }\n\n Object.defineProperties(ctor.prototype, properties)\n}\n\nfunction isCssVariable (propertyName) {\n return /^--/.test(propertyName)\n}\n\nexport class Style {\n public _usedStyleProp: Set\n\n public _value: Partial\n\n public _element: TaroElement\n\n public constructor (element: TaroElement) {\n this._element = element\n this._usedStyleProp = new Set()\n this._value = {}\n }\n\n private setCssVariables (styleKey: string) {\n this.hasOwnProperty(styleKey) || Object.defineProperty(this, styleKey, {\n enumerable: true,\n configurable: true,\n get: () => {\n return this._value[styleKey] || ''\n },\n set: (newVal: string) => {\n setStyle.call(this, newVal, styleKey)\n }\n })\n }\n\n public get cssText () {\n let text = ''\n this._usedStyleProp.forEach(key => {\n const val = this[key]\n if (!val) return\n const styleName = isCssVariable(key) ? key : toDashed(key)\n text += `${styleName}: ${val};`\n })\n return text\n }\n\n public set cssText (str: string) {\n if (str == null) {\n str = ''\n }\n\n this._usedStyleProp.forEach(prop => {\n this.removeProperty(prop)\n })\n\n if (str === '') {\n return\n }\n\n const rules = str.split(';')\n\n for (let i = 0; i < rules.length; i++) {\n const rule = rules[i].trim()\n if (rule === '') {\n continue\n }\n\n // 可能存在 'background: url(http:x/y/z)' 的情况\n const [propName, ...valList] = rule.split(':')\n const val = valList.join(':')\n\n if (isUndefined(val)) {\n continue\n }\n this.setProperty(propName.trim(), val.trim())\n }\n }\n\n public setProperty (propertyName: string, value?: string | null) {\n if (propertyName[0] === '-') {\n // 支持 webkit 属性或 css 变量\n this.setCssVariables(propertyName)\n } else {\n propertyName = toCamelCase(propertyName)\n }\n if (isUndefined(value)) {\n return\n }\n\n if (value === null || value === '') {\n this.removeProperty(propertyName)\n } else {\n this[propertyName] = value\n }\n }\n\n public removeProperty (propertyName: string): string {\n propertyName = toCamelCase(propertyName)\n if (!this._usedStyleProp.has(propertyName)) {\n return ''\n }\n\n const value = this[propertyName]\n this[propertyName] = ''\n this._usedStyleProp.delete(propertyName)\n return value\n }\n\n public getPropertyValue (propertyName: string) {\n propertyName = toCamelCase(propertyName)\n const value = this[propertyName]\n if (!value) {\n return ''\n }\n\n return value\n }\n}\n\ninitStyle(Style)\n","import { NodeType } from './node_types'\n\nimport type { TaroElement } from './element'\n\ntype Filter = (element: TaroElement) => boolean\n\nfunction returnTrue () {\n return true\n}\n\nexport function treeToArray (root: TaroElement, predict?: Filter): TaroElement[] {\n const array: TaroElement[] = []\n const filter = predict ?? returnTrue\n\n let object: TaroElement | null = root\n\n while (object) {\n if (object.nodeType === NodeType.ELEMENT_NODE && filter(object)) {\n array.push(object)\n }\n\n object = following(object, root)\n }\n\n return array\n}\n\nfunction following (el: TaroElement, root: TaroElement): TaroElement | null {\n const firstChild = el.firstChild\n\n if (firstChild) {\n return firstChild as TaroElement\n }\n\n let current: TaroElement | null = el\n\n do {\n if (current === root) {\n return null\n }\n\n const nextSibling = current.nextSibling\n\n if (nextSibling) {\n return nextSibling as TaroElement\n }\n current = current.parentElement\n } while (current)\n\n return null\n}\n","import type { TaroElement } from './element'\n\nexport class ClassList extends Set {\n private el: TaroElement\n\n constructor (className: string, el: TaroElement) {\n super()\n className.trim().split(/\\s+/).forEach(super.add.bind(this))\n this.el = el\n }\n\n public get value () {\n return [...this].join(' ')\n }\n\n public add (s: string) {\n super.add(s)\n this._update()\n\n return this\n }\n\n public get length (): number {\n return this.size\n }\n\n public remove (s: string) {\n super.delete(s)\n this._update()\n }\n\n public toggle (s: string) {\n if (super.has(s)) {\n super.delete(s)\n } else {\n super.add(s)\n }\n\n this._update()\n }\n\n public replace (s1: string, s2: string) {\n super.delete(s1)\n super.add(s2)\n\n this._update()\n }\n\n public contains (s: string) {\n return super.has(s)\n }\n\n public toString () {\n return this.value\n }\n\n private _update () {\n this.el.className = this.value\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { isArray, isUndefined, Shortcuts, EMPTY_OBJ, warn, isString, toCamelCase } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNode } from './node'\nimport { NodeType } from './node_types'\nimport { eventSource } from './event-source'\nimport { isElement, isHasExtractProp, shortcutAttr } from '../utils'\nimport { Style } from './style'\nimport { treeToArray } from './tree'\nimport { ClassList } from './class-list'\nimport {\n ID,\n CLASS,\n STYLE,\n FOCUS,\n VIEW,\n STATIC_VIEW,\n PURE_VIEW,\n PROPERTY_THRESHOLD\n} from '../constants'\n\nimport type { TaroEvent } from './event'\nimport type { Attributes, InstanceNamedFactory } from '../interface'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroElement extends TaroNode {\n public tagName: string\n public props: Record = {}\n public style: Style\n public dataset: Record = EMPTY_OBJ\n public innerHTML: string\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl\n ) {\n super(nodeImpl, getElement, hooks)\n elementImpl.bind(this)\n this.nodeType = NodeType.ELEMENT_NODE\n this.style = new Style(this)\n }\n\n private _stopPropagation (event: TaroEvent) {\n // eslint-disable-next-line @typescript-eslint/no-this-alias\n let target = this\n // eslint-disable-next-line no-cond-assign\n while ((target = target.parentNode as this)) {\n const listeners = target.__handlers[event.type]\n\n if (!isArray(listeners)) {\n continue\n }\n\n for (let i = listeners.length; i--;) {\n const l = listeners[i]\n l._stop = true\n }\n }\n }\n\n public get id (): string {\n return this.getAttribute(ID)!\n }\n\n public set id (val: string) {\n this.setAttribute(ID, val)\n }\n\n public get className (): string {\n return this.getAttribute(CLASS) || ''\n }\n\n public set className (val: string) {\n this.setAttribute(CLASS, val)\n }\n\n public get cssText (): string {\n return this.getAttribute(STYLE) || ''\n }\n\n public get classList (): ClassList {\n return new ClassList(this.className, this)\n }\n\n public get children (): TaroElement[] {\n return this.childNodes.filter(isElement)\n }\n\n public get attributes (): Attributes[] {\n const props = this.props\n const propKeys = Object.keys(props)\n const style = this.style.cssText\n const attrs = propKeys.map(key => ({ name: key, value: props[key] }))\n return attrs.concat(style ? { name: STYLE, value: style } : [])\n }\n\n public get textContent (): string {\n let text = ''\n const childNodes = this.childNodes\n\n for (let i = 0; i < childNodes.length; i++) {\n text += childNodes[i].textContent\n }\n\n return text\n }\n\n public set textContent (text: string) {\n super.textContent = text\n }\n\n public hasAttribute (qualifiedName: string): boolean {\n return !isUndefined(this.props[qualifiedName])\n }\n\n public hasAttributes (): boolean {\n return this.attributes.length > 0\n }\n\n public focus () {\n this.setAttribute(FOCUS, true)\n }\n\n public blur () {\n this.setAttribute(FOCUS, false)\n }\n\n public setAttribute (qualifiedName: string, value: any): void {\n process.env.NODE_ENV !== 'production' && warn(\n isString(value) && value.length > PROPERTY_THRESHOLD,\n `元素 ${this.nodeName} 的 属性 ${qualifiedName} 的值数据量过大，可能会影响渲染性能。考虑降低图片转为 base64 的阈值或在 CSS 中使用 base64。`\n )\n\n const isPureView = this.nodeName === VIEW && !isHasExtractProp(this) && !this.isAnyEventBinded()\n\n switch (qualifiedName) {\n case STYLE:\n this.style.cssText = value as string\n break\n case ID:\n eventSource.delete(this.uid)\n value = String(value)\n this.props[qualifiedName] = this.uid = value\n eventSource.set(value, this)\n break\n default:\n this.props[qualifiedName] = value as string\n\n if (qualifiedName.startsWith('data-')) {\n if (this.dataset === EMPTY_OBJ) {\n this.dataset = Object.create(null)\n }\n this.dataset[toCamelCase(qualifiedName.replace(/^data-/, ''))] = value\n }\n break\n }\n\n qualifiedName = shortcutAttr(qualifiedName)\n\n const payload = {\n path: `${this._path}.${toCamelCase(qualifiedName)}`,\n value\n }\n\n this.hooks.modifySetAttrPayload?.(this, qualifiedName, payload)\n\n this.enqueueUpdate(payload)\n\n // pure-view => static-view\n if (isPureView && isHasExtractProp(this)) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: STATIC_VIEW\n })\n }\n }\n\n public removeAttribute (qualifiedName: string) {\n const isStaticView = this.nodeName === VIEW && isHasExtractProp(this) && !this.isAnyEventBinded()\n\n if (qualifiedName === STYLE) {\n this.style.cssText = ''\n } else {\n const isInterrupt = this.hooks.onRemoveAttribute?.(this, qualifiedName)\n if (isInterrupt) {\n return\n }\n\n if (!this.props.hasOwnProperty(qualifiedName)) {\n return\n }\n delete this.props[qualifiedName]\n }\n\n qualifiedName = shortcutAttr(qualifiedName)\n\n const payload = {\n path: `${this._path}.${toCamelCase(qualifiedName)}`,\n value: ''\n }\n\n this.hooks.modifyRmAttrPayload?.(this, qualifiedName, payload)\n\n this.enqueueUpdate(payload)\n\n // static-view => pure-view\n if (isStaticView && !isHasExtractProp(this)) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: PURE_VIEW\n })\n }\n }\n\n public getAttribute (qualifiedName: string): string {\n const attr = qualifiedName === STYLE ? this.style.cssText : this.props[qualifiedName]\n return attr ?? ''\n }\n\n public getElementsByTagName (tagName: string): TaroElement[] {\n return treeToArray(this, (el) => {\n return el.nodeName === tagName || (tagName === '*' && this !== el)\n })\n }\n\n public getElementsByClassName (className: string): TaroElement[] {\n return treeToArray(this, (el) => {\n const classList = el.classList\n const classNames = className.trim().split(/\\s+/)\n return classNames.every(c => classList.has(c))\n })\n }\n\n public dispatchEvent (event: TaroEvent): boolean {\n const cancelable = event.cancelable\n\n const listeners = this.__handlers[event.type]\n\n if (!isArray(listeners)) {\n return false\n }\n\n for (let i = listeners.length; i--;) {\n const listener = listeners[i]\n let result: unknown\n if (listener._stop) {\n listener._stop = false\n } else {\n result = listener.call(this, event)\n }\n if ((result === false || event._end) && cancelable) {\n event.defaultPrevented = true\n }\n\n if (event._end && event._stop) {\n break\n }\n }\n\n if (event._stop) {\n this._stopPropagation(event)\n } else {\n event._stop = true\n }\n\n return listeners != null\n }\n\n public addEventListener (type, handler, options) {\n const name = this.nodeName\n const SPECIAL_NODES = this.hooks.getSpecialNodes()\n\n if (!this.isAnyEventBinded() && SPECIAL_NODES.indexOf(name) > -1) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: name\n })\n }\n\n super.addEventListener(type, handler, options)\n }\n\n public removeEventListener (type, handler) {\n super.removeEventListener(type, handler)\n\n const name = this.nodeName\n const SPECIAL_NODES = this.hooks.getSpecialNodes()\n\n if (!this.isAnyEventBinded() && SPECIAL_NODES.indexOf(name) > -1) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: isHasExtractProp(this) ? `static-${name}` : `pure-${name}`\n })\n }\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 */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n}\n\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nexport default baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n","import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n}\n\nexport default isKey;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\nexport default toSource;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\nfunction baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\nexport default listCacheClear;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n}\n\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}\n\nexport default mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n}\n\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n","import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n}\n\nexport default memoizeCapped;\n","import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n});\n\nexport default stringToPath;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\nexport default arrayMap;\n","import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default baseToString;\n","import baseToString from './_baseToString.js';\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n","import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default toKey;\n","import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n}\n\nexport default baseGet;\n","import baseGet from './_baseGet.js';\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n}\n\nexport default get;\n","import type { Options } from './interface'\n\nexport const options: Options = {\n prerender: true,\n debug: false\n}\n","import { options } from './options'\n\nclass Performance {\n private recorder = new Map()\n\n public start (id: string) {\n if (!options.debug) {\n return\n }\n this.recorder.set(id, Date.now())\n }\n\n public stop (id: string) {\n if (!options.debug) {\n return\n }\n const now = Date.now()\n const prev = this.recorder.get(id)!\n const time = now - prev\n // eslint-disable-next-line no-console\n console.log(`${id} 时长： ${time}ms`)\n }\n}\n\nexport const perf = new Performance()\n","import { inject, injectable } from 'inversify'\nimport { isFunction, Shortcuts } from '@tarojs/shared'\nimport get from 'lodash-es/get'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroElement } from './element'\nimport { incrementId } from '../utils'\nimport { perf } from '../perf'\nimport { options } from '../options'\nimport {\n SET_DATA,\n PAGE_INIT,\n ROOT_STR,\n CUSTOM_WRAPPER\n} from '../constants'\n\nimport type { Func, UpdatePayload, UpdatePayloadValue, InstanceNamedFactory, MpInstance, HydratedData } from '../interface'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\nimport type { Events } from '../emitter/emitter'\n\nconst eventIncrementId = incrementId()\n\n@injectable()\nexport class TaroRootElement extends TaroElement {\n private pendingUpdate = false\n private pendingFlush = false\n private updatePayloads: UpdatePayload[] = []\n private updateCallbacks: Func[]= []\n private eventCenter: Events\n public ctx: null | MpInstance = null\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl,\n @inject(SERVICE_IDENTIFIER.eventCenter) eventCenter: Events\n ) {\n super(nodeImpl, getElement, hooks, elementImpl)\n this.nodeName = ROOT_STR\n this.eventCenter = eventCenter\n }\n\n public get _path (): string {\n return ROOT_STR\n }\n\n protected get _root (): TaroRootElement {\n return this\n }\n\n public enqueueUpdate (payload: UpdatePayload): void {\n this.updatePayloads.push(payload)\n\n if (!this.pendingUpdate && this.ctx !== null) {\n this.performUpdate()\n }\n }\n\n public performUpdate (initRender = false, prerender?: Func) {\n this.pendingUpdate = true\n\n const ctx = this.ctx!\n\n setTimeout(() => {\n perf.start(SET_DATA)\n const data: Record> = Object.create(null)\n const resetPaths = new Set(\n initRender\n ? ['root.cn.[0]', 'root.cn[0]']\n : []\n )\n\n while (this.updatePayloads.length > 0) {\n const { path, value } = this.updatePayloads.shift()!\n if (path.endsWith(Shortcuts.Childnodes)) {\n resetPaths.add(path)\n }\n data[path] = value\n }\n\n for (const path in data) {\n resetPaths.forEach(p => {\n // 已经重置了数组，就不需要分别再设置了\n if (path.includes(p) && path !== p) {\n delete data[path]\n }\n })\n\n const value = data[path]\n if (isFunction(value)) {\n data[path] = value()\n }\n }\n\n if (isFunction(prerender)) {\n prerender(data)\n } else {\n this.pendingUpdate = false\n const customWrapperUpdate: { ctx: any, data: Record }[] = []\n const normalUpdate = {}\n if (!initRender) {\n for (const p in data) {\n const dataPathArr = p.split('.')\n let hasCustomWrapper = false\n for (let i = dataPathArr.length; i > 0; i--) {\n const allPath = dataPathArr.slice(0, i).join('.')\n const getData = get(ctx.__data__ || ctx.data, allPath)\n if (getData && getData.nn && getData.nn === CUSTOM_WRAPPER) {\n const customWrapperId = getData.uid\n const customWrapper = ctx.selectComponent(`#${customWrapperId}`)\n const splitedPath = dataPathArr.slice(i).join('.')\n if (customWrapper) {\n hasCustomWrapper = true\n customWrapperUpdate.push({\n ctx: ctx.selectComponent(`#${customWrapperId}`),\n data: {\n [`i.${splitedPath}`]: data[p]\n }\n })\n }\n break\n }\n }\n if (!hasCustomWrapper) {\n normalUpdate[p] = data[p]\n }\n }\n }\n const updateArrLen = customWrapperUpdate.length\n if (updateArrLen) {\n const eventId = `${this._path}_update_${eventIncrementId()}`\n const eventCenter = this.eventCenter\n let executeTime = 0\n eventCenter.once(eventId, () => {\n executeTime++\n if (executeTime === updateArrLen + 1) {\n perf.stop(SET_DATA)\n if (!this.pendingFlush) {\n this.flushUpdateCallback()\n }\n if (initRender) {\n perf.stop(PAGE_INIT)\n }\n }\n }, eventCenter)\n customWrapperUpdate.forEach(item => {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('custom wrapper setData: ', item.data)\n }\n item.ctx.setData(item.data, () => {\n eventCenter.trigger(eventId)\n })\n })\n if (Object.keys(normalUpdate).length) {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('setData:', normalUpdate)\n }\n ctx.setData(normalUpdate, () => {\n eventCenter.trigger(eventId)\n })\n }\n } else {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('setData:', data)\n }\n ctx.setData(data, () => {\n perf.stop(SET_DATA)\n if (!this.pendingFlush) {\n this.flushUpdateCallback()\n }\n if (initRender) {\n perf.stop(PAGE_INIT)\n }\n })\n }\n }\n }, 0)\n }\n\n public enqueueUpdateCallback (cb: Func, ctx?: Record) {\n this.updateCallbacks.push(() => {\n ctx ? cb.call(ctx) : cb()\n })\n }\n\n public flushUpdateCallback () {\n this.pendingFlush = false\n const copies = this.updateCallbacks.slice(0)\n this.updateCallbacks.length = 0\n for (let i = 0; i < copies.length; i++) {\n copies[i]()\n }\n }\n}\n","import { TaroElement } from './element'\nimport {\n VALUE,\n INPUT,\n CHANGE\n} from '../constants'\n\nimport type { TaroEvent } from './event'\n\nexport class FormElement extends TaroElement {\n public get value () {\n // eslint-disable-next-line dot-notation\n const val = this.props[VALUE]\n return val == null ? '' : val\n }\n\n public set value (val: string | boolean | number | any[]) {\n this.setAttribute(VALUE, val)\n }\n\n public dispatchEvent (event: TaroEvent) {\n if (event.mpEvent) {\n const val = event.mpEvent.detail.value\n if (event.type === CHANGE) {\n this.props.value = val as string\n } else if (event.type === INPUT) {\n // Web 规范中表单组件的 value 应该跟着输入改变\n // 只是改 this.props.value 的话不会进行 setData，因此这里修改 this.value。\n // 只测试了 React、Vue、Vue3 input 组件的 onInput 事件，onChange 事件不确定有没有副作用，所以暂不修改。\n this.value = val as string\n }\n }\n\n return super.dispatchEvent(event)\n }\n}\n","import { isFunction, warn } from '@tarojs/shared'\nimport { inject, injectable, optional } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { ElementNames, InstanceNamedFactory } from '../interface'\n\nimport type { Ctx, GetDoc } from '../interface'\nimport type { setInnerHTML } from '../dom-external/inner-html/html'\nimport type { TaroDocument } from '../dom/document'\nimport type { insertAdjacentHTMLImpl, IPosition } from './node'\n\ntype SetInnerHTML = typeof setInnerHTML\ntype InsertAdjacentHTMLImpl = typeof insertAdjacentHTMLImpl\n\n@injectable()\nexport class TaroNodeImpl {\n ctx: Ctx\n public getDoc: GetDoc\n public innerHTMLImpl: SetInnerHTML\n public adjacentImpl: InsertAdjacentHTMLImpl\n\n constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.InnerHTMLImpl) @optional() innerHTMLImpl: SetInnerHTML,\n @inject(SERVICE_IDENTIFIER.insertAdjacentHTMLImpl) @optional() adjacentImpl: InsertAdjacentHTMLImpl\n ) {\n this.getDoc = () => getElement(ElementNames.Document)()\n this.innerHTMLImpl = innerHTMLImpl\n this.adjacentImpl = adjacentImpl\n }\n\n public bind (ctx: Ctx) {\n this.ctx = ctx\n this.bindInnerHTML()\n this.bindAdjacentHTML()\n }\n\n private bindInnerHTML () {\n const { ctx, innerHTMLImpl: impl, getDoc } = this\n Object.defineProperty(ctx, 'innerHTML', {\n configurable: true,\n enumerable: true,\n set (html: string) {\n if (isFunction(impl)) {\n impl.call(ctx, ctx, html, getDoc)\n } else {\n process.env.NODE_ENV !== 'production' && warn(true, '请实现 node.innerHTML')\n }\n },\n get (): string {\n return ''\n }\n })\n }\n\n private bindAdjacentHTML () {\n const { ctx, adjacentImpl: impl, getDoc } = this\n ctx.insertAdjacentHTML = function (position: IPosition, html: string) {\n if (isFunction(impl)) {\n impl.call(ctx, position, html, getDoc)\n } else {\n process.env.NODE_ENV !== 'production' && warn(true, '请实现 node.insertAdjacentHTML')\n }\n }\n }\n}\n","import { isFunction, warn } from '@tarojs/shared'\nimport { inject, injectable, optional } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { Ctx } from '../interface'\nimport type { getBoundingClientRectImpl } from './element'\n\n@injectable()\nexport class TaroElementImpl {\n public rectImpl: typeof getBoundingClientRectImpl\n\n constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.getBoundingClientRectImpl) @optional() rectImpl: typeof getBoundingClientRectImpl\n ) {\n this.rectImpl = rectImpl\n }\n\n bind (ctx: Ctx) {\n this.bindRect(ctx)\n }\n\n bindRect (ctx: Ctx) {\n const impl = this.rectImpl\n ctx.getBoundingClientRect = async function (...args: any[]) {\n if (isFunction(impl)) {\n return await impl.apply(ctx, args)\n }\n\n process.env.NODE_ENV !== 'production' && warn(true, '请实现 element.getBoundingClientRect')\n return Promise.resolve(null)\n }\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { controlledComponent, isUndefined } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroElement } from '../dom/element'\nimport { NodeType } from '../dom/node_types'\nimport { eventSource } from '../dom/event-source'\nimport { ElementNames, InstanceFactory, InstanceNamedFactory } from '../interface'\nimport {\n ROOT_STR,\n DOCUMENT_ELEMENT_NAME,\n COMMENT\n} from '../constants'\n\nimport type { FormElement } from '../dom/form'\nimport type { TaroRootElement } from '../dom/root'\nimport type { TaroText } from '../dom/text'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroDocument extends TaroElement {\n private _getText: InstanceFactory\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl,\n @inject(SERVICE_IDENTIFIER.TaroTextFactory) getText: InstanceFactory\n ) {\n super(nodeImpl, getElement, hooks, elementImpl)\n this._getText = getText\n this.nodeType = NodeType.DOCUMENT_NODE\n this.nodeName = DOCUMENT_ELEMENT_NAME\n }\n\n public createElement (type: string): TaroElement | TaroRootElement | FormElement {\n if (type === ROOT_STR) {\n return this._getElement(ElementNames.RootElement)()\n }\n\n if (controlledComponent.has(type)) {\n return this._getElement(ElementNames.FormElement)(type)\n }\n\n return this._getElement(ElementNames.Element)(type)\n }\n\n // an ugly fake createElementNS to deal with @vue/runtime-dom's\n // support mounting app to svg container since vue@3.0.8\n public createElementNS (_svgNS: string, type: string): TaroElement | TaroRootElement | FormElement {\n return this.createElement(type)\n }\n\n public createTextNode (text: string): TaroText {\n return this._getText(text)\n }\n\n public getElementById (id: string | undefined | null): T | null {\n const el = eventSource.get(id)\n return isUndefined(el) ? null : el as T\n }\n\n public querySelector (query: string): T | null {\n // 为了 Vue3 的乞丐版实现\n if (/^#/.test(query)) {\n return this.getElementById(query.slice(1))\n }\n return null\n }\n\n // @TODO: @PERF: 在 hydrate 移除掉空的 node\n public createComment (): TaroText {\n const textnode = this._getText('')\n textnode.nodeName = COMMENT\n return textnode\n }\n}\n","import { options } from '../../options'\n\ninterface Position {\n index: number\n column: number\n line: number\n}\n\nexport interface Token {\n type: string\n content?: string\n position?: {\n start?: Position\n end?: Position\n }\n close?: boolean\n}\n\nfunction initPosition (): Position {\n return {\n index: 0,\n column: 0,\n line: 0\n }\n}\n\nfunction feedPosition (position: Position, str: string, len: number) {\n const start = position.index\n const end = position.index = start + len\n for (let i = start; i < end; i++) {\n const char = str.charAt(i)\n if (char === '\\n') {\n position.line++\n position.column = 0\n } else {\n position.column++\n }\n }\n}\n\nfunction jumpPosition (position: Position, str: string, end: number) {\n const len = end - position.index\n return feedPosition(position, str, len)\n}\n\nfunction copyPosition (position: Position) {\n return {\n index: position.index,\n line: position.line,\n column: position.column\n }\n}\n\nconst whitespace = /\\s/\nfunction isWhitespaceChar (char: string) {\n return whitespace.test(char)\n}\n\nconst equalSign = /=/\nfunction isEqualSignChar (char: string) {\n return equalSign.test(char)\n}\n\nfunction shouldBeIgnore (tagName: string) {\n const name = tagName.toLowerCase()\n if (options.html!.skipElements.has(name)) {\n return true\n }\n return false\n}\n\nconst alphanumeric = /[A-Za-z0-9]/\n\nfunction findTextEnd (str: string, index: number) {\n while (true) {\n const textEnd = str.indexOf('<', index)\n if (textEnd === -1) {\n return textEnd\n }\n const char = str.charAt(textEnd + 1)\n if (char === '/' || char === '!' || alphanumeric.test(char)) {\n return textEnd\n }\n index = textEnd + 1\n }\n}\n\nfunction isWordEnd (cursor: number, wordBegin: number, html: string) {\n if (!isWhitespaceChar(html.charAt(cursor))) return false\n\n const len = html.length\n\n // backwrad\n for (let i = cursor - 1; i > wordBegin; i--) {\n const char = html.charAt(i)\n if (!isWhitespaceChar(char)) {\n if (isEqualSignChar(char)) return false\n break\n }\n }\n\n // forward\n for (let i = cursor + 1; i < len; i++) {\n const char = html.charAt(i)\n if (!isWhitespaceChar(char)) {\n if (isEqualSignChar(char)) return false\n return true\n }\n }\n}\n\nexport class Scaner {\n private tokens: Token[] = []\n\n private position: Position = initPosition()\n\n private html: string\n\n constructor (html: string) {\n this.html = html\n }\n\n public scan (): Token[] {\n const { html, position } = this\n const len = html.length\n\n while (position.index < len) {\n const start = position.index\n this.scanText()\n if (position.index === start) {\n const isComment = html.startsWith('!--', start + 1)\n if (isComment) {\n this.scanComment()\n } else {\n const tagName = this.scanTag()\n if (shouldBeIgnore(tagName)) {\n this.scanSkipTag(tagName)\n }\n }\n }\n }\n\n return this.tokens\n }\n\n private scanText () {\n const type = 'text'\n const { html, position } = this\n let textEnd = findTextEnd(html, position.index)\n if (textEnd === position.index) {\n return\n }\n if (textEnd === -1) {\n textEnd = html.length\n }\n\n const start = copyPosition(position)\n const content = html.slice(position.index, textEnd)\n jumpPosition(position, html, textEnd)\n const end = copyPosition(position)\n this.tokens.push({ type, content, position: { start, end } })\n }\n\n private scanComment () {\n const type = 'comment'\n const { html, position } = this\n const start = copyPosition(position)\n feedPosition(position, html, 4) // \"', position.index)\n let commentEnd = contentEnd + 3 // \"-->\".length\n if (contentEnd === -1) {\n contentEnd = commentEnd = html.length\n }\n\n const content = html.slice(position.index, contentEnd)\n jumpPosition(position, html, commentEnd)\n this.tokens.push({\n type,\n content,\n position: {\n start,\n end: copyPosition(position)\n }\n })\n }\n\n private scanTag () {\n this.scanTagStart()\n const tagName = this.scanTagName()\n this.scanAttrs()\n this.scanTagEnd()\n\n return tagName\n }\n\n private scanTagStart () {\n const type = 'tag-start'\n const { html, position } = this\n\n const secondChar = html.charAt(position.index + 1)\n const close = secondChar === '/'\n const start = copyPosition(position)\n feedPosition(position, html, close ? 2 : 1)\n this.tokens.push({ type, close, position: { start } })\n }\n\n private scanTagEnd () {\n const type = 'tag-end'\n const { html, position } = this\n\n const firstChar = html.charAt(position.index)\n const close = firstChar === '/'\n feedPosition(position, html, close ? 2 : 1)\n const end = copyPosition(position)\n this.tokens.push({ type, close, position: { end } })\n }\n\n private scanTagName (): string {\n const type = 'tag'\n const { html, position } = this\n const len = html.length\n let start = position.index\n while (start < len) {\n const char = html.charAt(start)\n const isTagChar = !(isWhitespaceChar(char) || char === '/' || char === '>')\n if (isTagChar) break\n start++\n }\n\n let end = start + 1\n while (end < len) {\n const char = html.charAt(end)\n const isTagChar = !(isWhitespaceChar(char) || char === '/' || char === '>')\n if (!isTagChar) break\n end++\n }\n\n jumpPosition(position, html, end)\n const tagName = html.slice(start, end)\n this.tokens.push({\n type,\n content: tagName\n })\n\n return tagName\n }\n\n private scanAttrs () {\n const { html, position, tokens } = this\n let cursor = position.index\n let quote: string | null = null // null, single-, or double-quote\n let wordBegin = cursor // index of word start\n const words: string[] = [] // \"key\", \"key=value\", \"key='value'\", etc\n const len = html.length\n while (cursor < len) {\n const char = html.charAt(cursor)\n if (quote) {\n const isQuoteEnd = char === quote\n if (isQuoteEnd) {\n quote = null\n }\n cursor++\n continue\n }\n\n const isTagEnd = char === '/' || char === '>'\n if (isTagEnd) {\n if (cursor !== wordBegin) {\n words.push(html.slice(wordBegin, cursor))\n }\n break\n }\n\n if (isWordEnd(cursor, wordBegin, html)) {\n if (cursor !== wordBegin) {\n words.push(html.slice(wordBegin, cursor))\n }\n wordBegin = cursor + 1\n cursor++\n continue\n }\n\n const isQuoteStart = char === '\\'' || char === '\"'\n if (isQuoteStart) {\n quote = char\n cursor++\n continue\n }\n\n cursor++\n }\n\n jumpPosition(position, html, cursor)\n\n const wLen = words.length\n const type = 'attribute'\n for (let i = 0; i < wLen; i++) {\n const word = words[i]\n const isNotPair = word.includes('=')\n if (isNotPair) {\n const secondWord = words[i + 1]\n if (secondWord && secondWord.startsWith('=')) {\n if (secondWord.length > 1) {\n const newWord = word + secondWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n const thirdWord = words[i + 2]\n i += 1\n if (thirdWord) {\n const newWord = word + '=' + thirdWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n }\n }\n if (word.endsWith('=')) {\n const secondWord = words[i + 1]\n if (secondWord && !secondWord.includes('=')) {\n const newWord = word + secondWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n\n const newWord = word.slice(0, -1)\n tokens.push({ type, content: newWord })\n continue\n }\n\n tokens.push({ type, content: word })\n }\n }\n\n private scanSkipTag (tagName: string) {\n const { html, position } = this\n const safeTagName = tagName.toLowerCase()\n const len = html.length\n while (position.index < len) {\n const nextTag = html.indexOf(' boolean {\n const map: Record = Object.create(null)\n const list: Array = str.split(',')\n for (let i = 0; i < list.length; i++) {\n map[list[i]] = true\n }\n return expectsLowerCase ? val => !!map[val.toLowerCase()] : val => !!map[val]\n}\n\nexport const specialMiniElements = {\n img: 'image',\n iframe: 'web-view'\n}\n\nconst internalCompsList = Object.keys(internalComponents)\n .map(i => i.toLowerCase())\n .join(',')\n\n// https://developers.weixin.qq.com/miniprogram/dev/component\nexport const isMiniElements = makeMap(internalCompsList, true)\n\n// https://developer.mozilla.org/en-US/docs/Web/HTML/Inline_elements\nexport const isInlineElements = makeMap('a,i,abbr,iframe,select,acronym,slot,small,span,bdi,kbd,strong,big,map,sub,sup,br,mark,mark,meter,template,canvas,textarea,cite,object,time,code,output,u,data,picture,tt,datalist,var,dfn,del,q,em,s,embed,samp,b', true)\n\n// https://developer.mozilla.org/en-US/docs/Web/HTML/Block-level_elements\nexport const isBlockElements = makeMap('address,fieldset,li,article,figcaption,main,aside,figure,nav,blockquote,footer,ol,details,form,p,dialog,h1,h2,h3,h4,h5,h6,pre,dd,header,section,div,hgroup,table,dl,hr,ul,dt', true)\n","export function unquote (str: string): string {\n const car = str.charAt(0)\n const end = str.length - 1\n const isQuoteStart = car === '\"' || car === \"'\"\n if (isQuoteStart && car === str.charAt(end)) {\n return str.slice(1, end)\n }\n return str\n}\n","import { NodeType } from '../../dom/node_types'\nimport { unquote } from './utils'\n\nimport type { TaroNode } from '../../dom/node'\nimport type { ParsedTaroElement } from './parser'\n\nconst LEFT_BRACKET = '{'\nconst RIGHT_BRACKET = '}'\nconst CLASS_SELECTOR = '.'\nconst ID_SELECTOR = '#'\nconst CHILD_COMBINATOR = '>'\nconst GENERAL_SIBLING_COMBINATOR = '~'\nconst ADJACENT_SIBLING_COMBINATOR = '+'\n\ninterface ISelector {\n isChild: boolean\n isGeneralSibling: boolean\n isAdjacentSibling: boolean\n tag: string | null\n id: string | null\n class: string[]\n attrs: {\n all: boolean\n key: string\n value?: string | null\n }[]\n}\n\ninterface IStyle {\n content: string\n selectorList: ISelector[]\n}\n\nexport default class StyleTagParser {\n styles: IStyle[]= []\n\n extractStyle (src: string) {\n const REG_STYLE = /]*>((.|\\n|\\s)+?)<\\/style>/g\n let html = src\n // let html = src.replace(/\\n/g, '')\n\n html = html.replace(REG_STYLE, (_, $1: string) => {\n const style = $1.trim()\n this.stringToSelector(style)\n return ''\n })\n\n return html.trim()\n }\n\n stringToSelector (style: string) {\n let lb = style.indexOf(LEFT_BRACKET)\n\n while (lb > -1) {\n const rb = style.indexOf(RIGHT_BRACKET)\n const selectors = style.slice(0, lb).trim()\n let content = style.slice(lb + 1, rb).replace(/ /g, '')\n if (!(/;$/.test(content))) {\n content += ';'\n }\n selectors.split(',').forEach(src => {\n const selectorList = this.parseSelector(src)\n this.styles.push({\n content,\n selectorList\n })\n })\n style = style.slice(rb + 1)\n lb = style.indexOf(LEFT_BRACKET)\n }\n // console.log('res this.styles: ', this.styles)\n }\n\n parseSelector (src: string) {\n // todo: 属性选择器里可以带空格：[a = \"b\"]，这里的 split(' ') 需要作兼容\n const list = src.trim().replace(/ *([>~+]) */g, ' $1').replace(/ +/g, ' ').split(' ')\n const selectors = list.map(item => {\n const firstChar = item.charAt(0)\n const selector: ISelector = {\n isChild: firstChar === CHILD_COMBINATOR,\n isGeneralSibling: firstChar === GENERAL_SIBLING_COMBINATOR,\n isAdjacentSibling: firstChar === ADJACENT_SIBLING_COMBINATOR,\n tag: null,\n id: null,\n class: [],\n attrs: []\n }\n\n item = item.replace(/^[>~+]/, '')\n\n // 属性选择器\n item = item.replace(/\\[(.+?)\\]/g, function (_, $1: string) {\n const [key, value] = $1.split('=')\n const all = $1.indexOf('=') === -1\n\n const attr = {\n all,\n key,\n value: all ? null : value\n }\n selector.attrs.push(attr)\n return ''\n })\n\n item = item.replace(/([.#][A-Za-z0-9-_]+)/g, function (_, $1: string) {\n if ($1[0] === ID_SELECTOR) {\n // id 选择器\n selector.id = $1.substr(1)\n } else if ($1[0] === CLASS_SELECTOR) {\n // class 选择器\n selector.class.push($1.substr(1))\n }\n return ''\n })\n\n // 标签选择器\n if (item !== '') {\n selector.tag = item\n }\n\n return selector\n })\n return selectors\n }\n\n matchStyle (tagName: string, el: ParsedTaroElement, list: number[]): string {\n const res = sortStyles(this.styles).reduce((str, { content, selectorList }, i) => {\n let idx = list[i]\n let selector = selectorList[idx]\n const nextSelector = selectorList[idx + 1]\n\n if (nextSelector?.isGeneralSibling || nextSelector?.isAdjacentSibling) {\n selector = nextSelector\n idx += 1\n list[i] += 1\n }\n\n let isMatch = this.matchCurrent(tagName, el, selector)\n\n if (isMatch && selector.isGeneralSibling) {\n let prev: ParsedTaroElement = getPreviousElement(el)\n while (prev) {\n if (prev.h5tagName && this.matchCurrent(prev.h5tagName, prev, selectorList[idx - 1])) {\n isMatch = true\n break\n }\n prev = getPreviousElement(prev)\n isMatch = false\n }\n }\n if (isMatch && selector.isAdjacentSibling) {\n const prev: ParsedTaroElement = getPreviousElement(el)\n if (!prev || !prev.h5tagName) {\n isMatch = false\n } else {\n const isSiblingMatch = this.matchCurrent(prev.h5tagName, prev, selectorList[idx - 1])\n if (!isSiblingMatch) {\n isMatch = false\n }\n }\n }\n\n if (isMatch) {\n if (idx === selectorList.length - 1) {\n return str + content\n } else if (idx < selectorList.length - 1) {\n list[i] += 1\n }\n } else {\n // 直接子代组合器: >\n if (selector.isChild && idx > 0) {\n list[i] -= 1\n if (this.matchCurrent(tagName, el, selectorList[list[i]])) {\n list[i] += 1\n }\n }\n }\n\n return str\n }, '')\n return res\n }\n\n matchCurrent (tagName: string, el: ParsedTaroElement, selector: ISelector): boolean {\n // 标签选择器\n if (selector.tag && selector.tag !== tagName) return false\n\n // id 选择器\n if (selector.id && selector.id !== el.id) return false\n\n // class 选择器\n if (selector.class.length) {\n const classList = el.className.split(' ')\n for (let i = 0; i < selector.class.length; i++) {\n const cls = selector.class[i]\n if (classList.indexOf(cls) === -1) {\n return false\n }\n }\n }\n\n // 属性选择器\n if (selector.attrs.length) {\n for (let i = 0; i < selector.attrs.length; i++) {\n const { all, key, value } = selector.attrs[i]\n if (all && !el.hasAttribute(key)) {\n return false\n } else {\n const attr = el.getAttribute(key)\n if (attr !== unquote(value || '')) {\n return false\n }\n }\n }\n }\n\n return true\n }\n}\n\nfunction getPreviousElement (el: TaroNode) {\n const parent = el.parentElement\n if (!parent) return null\n\n const prev = el.previousSibling\n if (!prev) return null\n\n if (prev.nodeType === NodeType.ELEMENT_NODE) {\n return prev\n } else {\n return getPreviousElement(prev)\n }\n}\n\n// 根据 css selector 权重排序: 权重大的靠后\n// @WARN 不考虑伪类\n// https://developer.mozilla.org/en-US/docs/Learn/CSS/Building_blocks/Cascade_and_inheritance#specificity_2\nfunction sortStyles (styles: IStyle[]) {\n return styles.sort((s1, s2) => {\n const hundreds1 = getHundredsWeight(s1.selectorList)\n const hundreds2 = getHundredsWeight(s2.selectorList)\n\n if (hundreds1 !== hundreds2) return hundreds1 - hundreds2\n\n const tens1 = getTensWeight(s1.selectorList)\n const tens2 = getTensWeight(s2.selectorList)\n\n if (tens1 !== tens2) return tens1 - tens2\n\n const ones1 = getOnesWeight(s1.selectorList)\n const ones2 = getOnesWeight(s2.selectorList)\n\n return ones1 - ones2\n })\n}\n\nfunction getHundredsWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + (cur.id ? 1 : 0), 0)\n}\n\nfunction getTensWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + cur.class.length + cur.attrs.length, 0)\n}\n\nfunction getOnesWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + (cur.tag ? 1 : 0), 0)\n}\n","import { isFunction } from '@tarojs/shared'\nimport { Scaner, Token } from './scaner'\nimport { options } from '../../options'\nimport { specialMiniElements, isMiniElements, isBlockElements, isInlineElements } from './tags'\nimport StyleTagParser from './style'\nimport { unquote } from './utils'\n\nimport type { TaroElement } from '../../dom/element'\nimport type { TaroDocument } from '../../dom/document'\n\ninterface State {\n tokens: Token[]\n cursor: number\n stack: Element[]\n}\n\nconst closingTagAncestorBreakers = {\n li: ['ul', 'ol', 'menu'],\n dt: ['dl'],\n dd: ['dl'],\n tbody: ['table'],\n thead: ['table'],\n tfoot: ['table'],\n tr: ['table'],\n td: ['table']\n}\n\ninterface Node {\n type: string;\n}\n\ninterface Comment extends Node {\n type: 'comment'\n content: string\n}\n\nexport interface Text extends Node {\n type: 'text'\n content: string\n}\n\nexport interface Element extends Node {\n type: 'element'\n tagName: string\n children: ChildNode[]\n attributes: string[]\n}\n\nexport interface ParsedTaroElement extends TaroElement{\n h5tagName?: string\n}\n\ntype ChildNode = Comment | Text | Element\n\nfunction hasTerminalParent (tagName: string, stack: Element[]) {\n const tagParents: undefined | string[] = closingTagAncestorBreakers[tagName]\n if (tagParents) {\n let currentIndex = stack.length - 1\n while (currentIndex >= 0) {\n const parentTagName = stack[currentIndex].tagName\n if (parentTagName === tagName) {\n break\n }\n if (tagParents && tagParents.includes(parentTagName!)) {\n return true\n }\n currentIndex--\n }\n }\n return false\n}\n\nfunction getTagName (tag: string) {\n if (options.html!.renderHTMLTag) {\n return tag\n }\n\n if (specialMiniElements[tag]) {\n return specialMiniElements[tag]\n } else if (isMiniElements(tag)) {\n return tag\n } else if (isBlockElements(tag)) {\n return 'view'\n } else if (isInlineElements(tag)) {\n return 'text'\n }\n\n return 'view'\n}\n\nfunction splitEqual (str: string) {\n const sep = '='\n const idx = str.indexOf(sep)\n if (idx === -1) return [str]\n const key = str.slice(0, idx).trim()\n const value = str.slice(idx + sep.length).trim()\n return [key, value]\n}\n\nfunction format (\n children: ChildNode[],\n document: TaroDocument,\n styleOptions: {\n styleTagParser: StyleTagParser\n descendantList: number[]\n },\n parent?: TaroElement\n) {\n return children\n .filter(child => {\n // 过滤注释和空文本节点\n if (child.type === 'comment') {\n return false\n } else if (child.type === 'text') {\n return child.content !== ''\n }\n return true\n })\n .map((child: Text | Element) => {\n // 文本节点\n if (child.type === 'text') {\n const text = document.createTextNode(child.content)\n if (isFunction(options.html!.transformText)) {\n return options.html!.transformText(text, child)\n }\n parent?.appendChild(text)\n return text\n }\n\n const el: ParsedTaroElement = document.createElement(getTagName(child.tagName))\n el.h5tagName = child.tagName\n\n parent?.appendChild(el)\n\n if (!options.html!.renderHTMLTag) {\n el.className = `h5-${child.tagName}`\n }\n\n for (let i = 0; i < child.attributes.length; i++) {\n const attr = child.attributes[i]\n const [key, value] = splitEqual(attr)\n if (key === 'class') {\n el.className += ' ' + unquote(value)\n } else if (key[0] === 'o' && key[1] === 'n') {\n continue\n } else {\n el.setAttribute(key, value == null ? true : unquote(value))\n }\n }\n\n const { styleTagParser, descendantList } = styleOptions\n const list = descendantList.slice()\n const style = styleTagParser.matchStyle(child.tagName, el, list)\n\n el.setAttribute('style', style + el.style.cssText)\n // console.log('style, ', style)\n\n format(child.children, document, {\n styleTagParser,\n descendantList: list\n }, el)\n\n if (isFunction(options.html!.transformElement)) {\n return options.html!.transformElement(el, child)\n }\n\n return el\n })\n}\n\nexport function parser (html: string, document: TaroDocument) {\n const styleTagParser = new StyleTagParser()\n html = styleTagParser.extractStyle(html)\n\n const tokens = new Scaner(html).scan()\n\n const root: Element = { tagName: '', children: [], type: 'element', attributes: [] }\n\n const state = { tokens, options, cursor: 0, stack: [root] }\n parse(state)\n\n return format(root.children, document, {\n styleTagParser,\n descendantList: Array(styleTagParser.styles.length).fill(0)\n })\n}\n\nfunction parse (state: State) {\n const { tokens, stack } = state\n let { cursor } = state\n\n const len = tokens.length\n\n let nodes = stack[stack.length - 1].children\n\n while (cursor < len) {\n const token = tokens[cursor]\n if (token.type !== 'tag-start') {\n // comment or text\n nodes.push(token as ChildNode)\n cursor++\n continue\n }\n\n const tagToken = tokens[++cursor]\n cursor++\n const tagName = tagToken.content!.toLowerCase()\n if (token.close) {\n let index = stack.length\n let shouldRewind = false\n while (--index > -1) {\n if (stack[index].tagName === tagName) {\n shouldRewind = true\n break\n }\n }\n while (cursor < len) {\n const endToken = tokens[cursor]\n if (endToken.type !== 'tag-end') break\n cursor++\n }\n if (shouldRewind) {\n stack.splice(index)\n break\n } else {\n continue\n }\n }\n\n const isClosingTag = options.html!.closingElements.has(tagName)\n let shouldRewindToAutoClose = isClosingTag\n if (shouldRewindToAutoClose) {\n shouldRewindToAutoClose = !hasTerminalParent(tagName, stack)\n }\n\n if (shouldRewindToAutoClose) {\n let currentIndex = stack.length - 1\n while (currentIndex > 0) {\n if (tagName === stack[currentIndex].tagName) {\n stack.splice(currentIndex)\n const previousIndex = currentIndex - 1\n nodes = stack[previousIndex].children\n break\n }\n currentIndex = currentIndex - 1\n }\n }\n\n const attributes: string[] = []\n let attrToken: Token\n while (cursor < len) {\n attrToken = tokens[cursor]\n if (attrToken.type === 'tag-end') break\n attributes.push(attrToken.content!)\n cursor++\n }\n\n cursor++\n const children: Element[] = []\n const element: Element = {\n type: 'element',\n tagName: tagToken.content!,\n attributes,\n children\n }\n nodes.push(element)\n\n const hasChildren = !(attrToken!.close || options.html!.voidElements.has(tagName))\n if (hasChildren) {\n stack.push({ tagName, children } as any)\n const innerState: State = { tokens, cursor, stack }\n parse(innerState)\n cursor = innerState.cursor\n }\n }\n\n state.cursor = cursor\n}\n","import { parser } from './parser'\nimport { options } from '../../options'\n\nimport type { TaroNode } from '../../dom/node'\nimport type { TaroDocument } from '../../dom/document'\n\noptions.html = {\n skipElements: new Set(['style', 'script']),\n voidElements: new Set([\n '!doctype', 'area', 'base', 'br', 'col', 'command',\n 'embed', 'hr', 'img', 'input', 'keygen', 'link',\n 'meta', 'param', 'source', 'track', 'wbr'\n ]),\n closingElements: new Set([\n 'html', 'head', 'body', 'p', 'dt', 'dd', 'li', 'option',\n 'thead', 'th', 'tbody', 'tr', 'td', 'tfoot', 'colgroup'\n ]),\n renderHTMLTag: false\n}\n\nexport function setInnerHTML (element: TaroNode, html: string, getDoc: () => TaroDocument) {\n element.childNodes.forEach(node => {\n element.removeChild(node)\n })\n const children = parser(html, getDoc())\n\n for (let i = 0; i < children.length; i++) {\n element.appendChild(children[i])\n }\n}\n","import { options } from '../options'\n\nexport function getBoundingClientRectImpl (): Promise {\n if (!options.miniGlobal) return Promise.resolve(null)\n return new Promise(resolve => {\n const query = options.miniGlobal.createSelectorQuery()\n query.select(`#${this.uid}`).boundingClientRect(res => {\n resolve(res)\n }).exec()\n })\n}\n","import { parser } from '../dom-external/inner-html/parser'\nimport { GetDoc } from '../interface'\n\nexport type IPosition = 'beforebegin' | 'afterbegin' | 'beforeend' | 'afterend'\n\n/**\n * An implementation of `Element.insertAdjacentHTML()`\n * to support Vue 3 with a version of or greater than `vue@3.1.2`\n */\nexport function insertAdjacentHTMLImpl (\n position: IPosition,\n html: string,\n getDoc: GetDoc\n) {\n const parsedNodes = parser(html, getDoc())\n\n for (let i = 0; i < parsedNodes.length; i++) {\n const n = parsedNodes[i]\n\n switch (position) {\n case 'beforebegin':\n this.parentNode?.insertBefore(n, this)\n break\n case 'afterbegin':\n if (this.hasChildNodes()) {\n this.insertBefore(n, this.childNodes[0])\n } else {\n this.appendChild(n)\n }\n break\n case 'beforeend':\n this.appendChild(n)\n break\n case 'afterend':\n this.parentNode?.appendChild(n)\n break\n }\n }\n}\n","import { ContainerModule } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { setInnerHTML } from './inner-html/html'\nimport { getBoundingClientRectImpl } from './element'\nimport { insertAdjacentHTMLImpl } from './node'\n\n// webpack define plugin\ndeclare const ENABLE_INNER_HTML: boolean\ndeclare const ENABLE_ADJACENT_HTML: boolean\ndeclare const ENABLE_SIZE_APIS: boolean\n\nconst domExternal = new ContainerModule(bind => {\n if (process.env.TARO_ENV !== 'h5') {\n if (typeof ENABLE_INNER_HTML !== 'undefined' && ENABLE_INNER_HTML) {\n bind(SERVICE_IDENTIFIER.InnerHTMLImpl).toFunction(setInnerHTML)\n if (typeof ENABLE_ADJACENT_HTML !== 'undefined' && ENABLE_ADJACENT_HTML) {\n bind(SERVICE_IDENTIFIER.insertAdjacentHTMLImpl).toFunction(insertAdjacentHTMLImpl)\n }\n }\n if (typeof ENABLE_SIZE_APIS !== 'undefined' && ENABLE_SIZE_APIS) {\n bind(SERVICE_IDENTIFIER.getBoundingClientRectImpl).toFunction(getBoundingClientRectImpl)\n }\n }\n})\n\nexport default domExternal\n","import { inject, injectable, multiInject, /* multiInject, */ optional } from 'inversify'\nimport SERVICE_IDENTIFIER from './constants/identifiers'\n\nimport type {\n IHooks,\n OnRemoveAttribute,\n GetLifecycle,\n GetPathIndex,\n GetEventCenter,\n ModifyMpEvent,\n ModifyTaroEvent,\n IsBubbleEvents,\n GetSpecialNodes,\n BatchedEventUpdates,\n MergePageInstance,\n CreatePullDownComponent,\n GetDOMNode,\n InitNativeApi,\n ModifySetAttrPayload,\n ModifyHydrateData,\n ModifyRmAttrPayload,\n MpEvent,\n OnAddEvent\n} from './interface'\nimport type { TaroElement } from './dom/element'\nimport type { TaroEvent } from './dom/event'\n\n@injectable()\nexport class Hooks implements IHooks {\n @inject(SERVICE_IDENTIFIER.getLifecycle)\n public getLifecycle: GetLifecycle\n\n @inject(SERVICE_IDENTIFIER.getPathIndex)\n public getPathIndex: GetPathIndex\n\n @inject(SERVICE_IDENTIFIER.getEventCenter)\n public getEventCenter: GetEventCenter\n\n @inject(SERVICE_IDENTIFIER.isBubbleEvents)\n public isBubbleEvents: IsBubbleEvents\n\n @inject(SERVICE_IDENTIFIER.getSpecialNodes)\n public getSpecialNodes: GetSpecialNodes\n\n @inject(SERVICE_IDENTIFIER.onRemoveAttribute) @optional()\n public onRemoveAttribute?: OnRemoveAttribute\n\n @inject(SERVICE_IDENTIFIER.batchedEventUpdates) @optional()\n public batchedEventUpdates?: BatchedEventUpdates\n\n @inject(SERVICE_IDENTIFIER.mergePageInstance) @optional()\n public mergePageInstance?: MergePageInstance\n\n @inject(SERVICE_IDENTIFIER.createPullDownComponent) @optional()\n public createPullDownComponent?: CreatePullDownComponent\n\n @inject(SERVICE_IDENTIFIER.getDOMNode) @optional()\n public getDOMNode?: GetDOMNode\n\n @inject(SERVICE_IDENTIFIER.modifyHydrateData) @optional()\n public modifyHydrateData?: ModifyHydrateData\n\n @inject(SERVICE_IDENTIFIER.modifySetAttrPayload) @optional()\n public modifySetAttrPayload?: ModifySetAttrPayload\n\n @inject(SERVICE_IDENTIFIER.modifyRmAttrPayload) @optional()\n public modifyRmAttrPayload?: ModifyRmAttrPayload\n\n @inject(SERVICE_IDENTIFIER.onAddEvent) @optional()\n public onAddEvent?: OnAddEvent\n\n @multiInject(SERVICE_IDENTIFIER.modifyMpEvent) @optional()\n private modifyMpEventImpls?: ModifyMpEvent[]\n\n public modifyMpEvent (e: MpEvent) {\n this.modifyMpEventImpls?.forEach(fn => fn(e))\n }\n\n @multiInject(SERVICE_IDENTIFIER.modifyTaroEvent) @optional()\n private modifyTaroEventImpls?: ModifyTaroEvent[]\n\n public modifyTaroEvent (e: TaroEvent, element: TaroElement) {\n this.modifyTaroEventImpls?.forEach(fn => fn(e, element))\n }\n\n @multiInject(SERVICE_IDENTIFIER.initNativeApi) @optional()\n public initNativeApiImpls?: InitNativeApi[]\n\n public initNativeApi (taro: Record) {\n this.initNativeApiImpls?.forEach(fn => fn(taro))\n }\n}\n","/**\n * 支持冒泡的事件, 除 支付宝小程序外，其余的可冒泡事件都和微信保持一致\n * 详见 见 https://developers.weixin.qq.com/miniprogram/dev/framework/view/wxml/event.html\n */\nexport const BUBBLE_EVENTS = new Set([\n 'touchstart',\n 'touchmove',\n 'touchcancel',\n 'touchend',\n 'touchforcechange',\n 'tap',\n 'longpress',\n 'longtap',\n 'transitionend',\n 'animationstart',\n 'animationiteration',\n 'animationend'\n])\n","import { ContainerModule } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { BUBBLE_EVENTS } from '../constants/events'\n\nimport type { IsBubbleEvents, GetEventCenter, GetLifecycle, GetPathIndex, GetSpecialNodes } from '../interface'\n\nconst getLifecycle: GetLifecycle = function (instance, lifecycle) {\n return instance[lifecycle]\n}\n\nconst getPathIndex: GetPathIndex = function (indexOfNode) {\n return `[${indexOfNode}]`\n}\n\nconst getEventCenter: GetEventCenter = function (Events) {\n return new Events()\n}\n\nconst isBubbleEvents = function (eventName) {\n return BUBBLE_EVENTS.has(eventName)\n}\n\nconst getSpecialNodes = function () {\n return ['view', 'text', 'image']\n}\n\nexport const DefaultHooksContainer = new ContainerModule(bind => {\n bind(SERVICE_IDENTIFIER.getLifecycle).toFunction(getLifecycle)\n bind(SERVICE_IDENTIFIER.getPathIndex).toFunction(getPathIndex)\n bind(SERVICE_IDENTIFIER.getEventCenter).toFunction(getEventCenter)\n bind(SERVICE_IDENTIFIER.isBubbleEvents).toFunction(isBubbleEvents)\n bind(SERVICE_IDENTIFIER.getSpecialNodes).toFunction(getSpecialNodes)\n})\n","import { defaultReconciler, isArray } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { Container } from 'inversify'\n\nexport default function processPluginHooks (container: Container) {\n const keys = Object.keys(defaultReconciler)\n keys.forEach(key => {\n if (key in SERVICE_IDENTIFIER) {\n // is hooks\n const identifier = SERVICE_IDENTIFIER[key]\n const fn = defaultReconciler[key]\n\n if (isArray(fn)) {\n // is multi\n fn.forEach(item => container.bind(identifier).toFunction(item))\n } else {\n if (container.isBound(identifier)) {\n // 之前有绑定过，需要重新绑定以覆盖前者\n container.rebind(identifier).toFunction(fn)\n } else {\n container.bind(identifier).toFunction(fn)\n }\n }\n }\n })\n}\n","import { Container, interfaces } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNodeImpl } from '../dom-external/node-impl'\nimport { TaroElementImpl } from '../dom-external/element-impl'\nimport { TaroElement } from '../dom/element'\nimport { TaroText } from '../dom/text'\nimport { TaroDocument } from '../dom/document'\nimport { TaroRootElement } from '../dom/root'\nimport { FormElement } from '../dom/form'\nimport { ElementNames, InstanceFactory, InstanceNamedFactory } from '../interface'\nimport domExternal from '../dom-external'\nimport { Hooks } from '../hooks'\nimport { DefaultHooksContainer } from './default-hooks'\nimport processPluginHooks from './plugin-hooks'\n\nconst container = new Container()\n\ncontainer.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroElement).whenTargetNamed(ElementNames.Element)\ncontainer.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroDocument).inSingletonScope().whenTargetNamed(ElementNames.Document)\ncontainer.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroRootElement).whenTargetNamed(ElementNames.RootElement)\ncontainer.bind(SERVICE_IDENTIFIER.TaroElement).to(FormElement).whenTargetNamed(ElementNames.FormElement)\ncontainer.bind(SERVICE_IDENTIFIER.TaroElementFactory).toFactory((context: interfaces.Context) => {\n return (named: ElementNames) => (nodeName?: string) => {\n const el = context.container.getNamed(SERVICE_IDENTIFIER.TaroElement, named)\n if (nodeName) {\n el.nodeName = nodeName\n }\n el.tagName = el.nodeName.toUpperCase()\n return el\n }\n})\n\ncontainer.bind(SERVICE_IDENTIFIER.TaroText).to(TaroText)\ncontainer.bind>(SERVICE_IDENTIFIER.TaroTextFactory).toFactory((context: interfaces.Context) => {\n return (text: string) => {\n const textNode = context.container.get(SERVICE_IDENTIFIER.TaroText)\n textNode._value = text\n return textNode\n }\n})\n\ncontainer.bind(SERVICE_IDENTIFIER.TaroNodeImpl).to(TaroNodeImpl).inSingletonScope()\ncontainer.bind(SERVICE_IDENTIFIER.TaroElementImpl).to(TaroElementImpl).inSingletonScope()\ncontainer.bind(SERVICE_IDENTIFIER.Hooks).to(Hooks).inSingletonScope()\n\ncontainer.load(domExternal, DefaultHooksContainer)\n\nprocessPluginHooks(container)\n\nexport default container\n","import { EMPTY_OBJ } from '@tarojs/shared'\nimport container from '../container'\nimport { ElementNames } from '../interface'\nimport { isParentBinded } from '../utils'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport {\n CONFIRM,\n CURRENT_TARGET,\n INPUT,\n KEY_CODE,\n TARGET,\n TIME_STAMP,\n TYPE,\n TOUCHMOVE\n} from '../constants'\n\nimport type { TaroElement } from './element'\nimport type { InstanceNamedFactory, EventOptions, MpEvent, TaroDocumentInstance, IHooks } from '../interface'\n\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\nconst getElement = container.get(SERVICE_IDENTIFIER.TaroElementFactory)\nconst document = getElement(ElementNames.Document)() as TaroDocumentInstance\n\n// Taro 事件对象。以 Web 标准的事件对象为基础，加入小程序事件对象中携带的部分信息，并模拟实现事件冒泡。\nexport class TaroEvent {\n public type: string\n\n public bubbles: boolean\n\n public cancelable: boolean\n\n public _stop = false\n\n public _end = false\n\n public defaultPrevented = false\n\n // timestamp can either be hi-res ( relative to page load) or low-res (relative to UNIX epoch)\n // here use hi-res timestamp\n public timeStamp = Date.now()\n\n public mpEvent: MpEvent | undefined\n\n public constructor (type: string, opts: EventOptions, event?: MpEvent) {\n this.type = type.toLowerCase()\n this.mpEvent = event\n this.bubbles = Boolean(opts && opts.bubbles)\n this.cancelable = Boolean(opts && opts.cancelable)\n }\n\n public stopPropagation () {\n this._stop = true\n }\n\n public stopImmediatePropagation () {\n this._end = this._stop = true\n }\n\n public preventDefault () {\n this.defaultPrevented = true\n }\n\n get target () {\n const element = document.getElementById(this.mpEvent?.target.id)\n return {\n ...this.mpEvent?.target,\n ...this.mpEvent?.detail,\n dataset: element !== null ? element.dataset : EMPTY_OBJ\n }\n }\n\n get currentTarget () {\n const element = document.getElementById(this.mpEvent?.currentTarget.id)\n\n if (element === null) {\n return this.target\n }\n\n return {\n ...this.mpEvent?.currentTarget,\n ...this.mpEvent?.detail,\n dataset: element.dataset\n }\n }\n}\n\nexport function createEvent (event: MpEvent | string, node?: TaroElement) {\n if (typeof event === 'string') {\n // For Vue3 using document.createEvent\n return new TaroEvent(event, { bubbles: true, cancelable: true })\n }\n\n const domEv = new TaroEvent(event.type, { bubbles: true, cancelable: true }, event)\n\n for (const key in event) {\n if (key === CURRENT_TARGET || key === TARGET || key === TYPE || key === TIME_STAMP) {\n continue\n } else {\n domEv[key] = event[key]\n }\n }\n\n if (domEv.type === CONFIRM && node?.nodeName === INPUT) {\n // eslint-disable-next-line dot-notation\n domEv[KEY_CODE] = 13\n }\n\n return domEv\n}\n\nconst eventsBatch = {}\n\n// 小程序的事件代理回调函数\nexport function eventHandler (event: MpEvent) {\n hooks.modifyMpEvent?.(event)\n\n if (event.currentTarget == null) {\n event.currentTarget = event.target\n }\n\n const node = document.getElementById(event.currentTarget.id)\n if (node) {\n const dispatch = () => {\n const e = createEvent(event, node)\n hooks.modifyTaroEvent?.(e, node)\n node.dispatchEvent(e)\n }\n if (typeof hooks.batchedEventUpdates === 'function') {\n const type = event.type\n\n if (\n !hooks.isBubbleEvents(type) ||\n !isParentBinded(node, type) ||\n (type === TOUCHMOVE && !!node.props.catchMove)\n ) {\n // 最上层组件统一 batchUpdate\n hooks.batchedEventUpdates(() => {\n if (eventsBatch[type]) {\n eventsBatch[type].forEach(fn => fn())\n delete eventsBatch[type]\n }\n dispatch()\n })\n } else {\n // 如果上层组件也有绑定同类型的组件，委托给上层组件调用事件回调\n (eventsBatch[type] ||= []).push(dispatch)\n }\n } else {\n dispatch()\n }\n }\n}\n","import { EMPTY_OBJ } from '@tarojs/shared'\n\nexport const isBrowser = typeof document !== 'undefined' && !!document.scripts\nexport const doc: Document = isBrowser ? document : EMPTY_OBJ\nexport const win: Window = isBrowser ? window : EMPTY_OBJ\n","import { createEvent } from '../dom/event'\nimport { isBrowser, doc } from '../env'\nimport ioc_container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { ElementNames, InstanceNamedFactory } from '../interface'\nimport {\n HTML,\n HEAD,\n BODY,\n APP,\n CONTAINER\n} from '../constants'\n\nimport type { TaroDocumentInstance } from '../interface'\n\nexport function createDocument () {\n /**\n * \n * \n * \n * \n * \n * \n * \n * \n * \n * \n */\n const getElement = ioc_container.get(SERVICE_IDENTIFIER.TaroElementFactory)\n const doc = getElement(ElementNames.Document)() as TaroDocumentInstance\n const documentCreateElement = doc.createElement.bind(doc)\n const html = documentCreateElement(HTML)\n const head = documentCreateElement(HEAD)\n const body = documentCreateElement(BODY)\n const app = documentCreateElement(APP)\n app.id = APP\n const container = documentCreateElement(CONTAINER) // 多包一层主要为了兼容 vue\n\n doc.appendChild(html)\n html.appendChild(head)\n html.appendChild(body)\n body.appendChild(container)\n container.appendChild(app)\n\n doc.documentElement = html\n doc.head = head\n doc.body = body\n doc.createEvent = createEvent\n\n return doc\n}\n\nexport const document = (isBrowser ? doc : createDocument()) as TaroDocumentInstance\n","import { isBrowser, win } from '../env'\n\nconst machine = 'Macintosh'\nconst arch = 'Intel Mac OS X 10_14_5'\nconst engine = 'AppleWebKit/534.36 (KHTML, like Gecko) NodeJS/v4.1.0 Chrome/76.0.3809.132 Safari/534.36'\n\nexport const navigator = isBrowser ? win.navigator : {\n appCodeName: 'Mozilla',\n appName: 'Netscape',\n appVersion: '5.0 (' + machine + '; ' + arch + ') ' + engine,\n cookieEnabled: true,\n mimeTypes: [],\n onLine: true,\n platform: 'MacIntel',\n plugins: [],\n product: 'Taro',\n productSub: '20030107',\n userAgent: 'Mozilla/5.0 (' + machine + '; ' + arch + ') ' + engine,\n vendor: 'Joyent',\n vendorSub: ''\n}\n","// https://github.com/myrne/performance-now\nexport let now\n\n(function () {\n let loadTime\n if ((typeof performance !== 'undefined' && performance !== null) && performance.now) {\n now = function () {\n return performance.now()\n }\n } else if (Date.now) {\n now = function () {\n return Date.now() - loadTime\n }\n loadTime = Date.now()\n } else {\n now = function () {\n return new Date().getTime() - loadTime\n }\n loadTime = new Date().getTime()\n }\n})()\n\nlet lastTime = 0\n\n// https://gist.github.com/paulirish/1579671\n// https://gist.github.com/jalbam/5fe05443270fa6d8136238ec72accbc0\nlet raf = typeof requestAnimationFrame !== 'undefined' && requestAnimationFrame !== null ? requestAnimationFrame : function (callback) {\n const _now = now()\n const nextTime = Math.max(lastTime + 16, _now) // First time will execute it immediately but barely noticeable and performance is gained.\n return setTimeout(function () { callback(lastTime = nextTime) }, nextTime - _now)\n}\n\nlet caf = typeof cancelAnimationFrame !== 'undefined' && cancelAnimationFrame !== null ? cancelAnimationFrame : clearTimeout\n\nif (typeof global !== 'undefined') {\n raf = raf.bind(global)\n caf = caf.bind(global)\n}\n\nexport {\n raf,\n caf\n}\n","import type { TaroElement } from '../dom/element'\nimport type { Style } from '../dom/style'\n\nexport function getComputedStyle (element: TaroElement): Style {\n return element.style\n}\n","import { navigator } from './navigator'\nimport { document } from './document'\nimport { isBrowser, win } from '../env'\nimport { raf, caf } from './raf'\nimport { getComputedStyle } from './getComputedStyle'\nimport { DATE, SET_TIMEOUT } from '../constants'\n\nexport const window = isBrowser ? win : {\n navigator,\n document\n}\n\nif (!isBrowser) {\n const globalProperties = [\n ...Object.getOwnPropertyNames(global || win),\n ...Object.getOwnPropertySymbols(global || win)\n ]\n\n globalProperties.forEach(property => {\n if (property === 'atob') return\n if (!Object.prototype.hasOwnProperty.call(window, property)) {\n window[property] = global[property]\n }\n })\n}\n\nif (process.env.TARO_ENV && process.env.TARO_ENV !== 'h5') {\n (window as any).requestAnimationFrame = raf;\n (window as any).cancelAnimationFrame = caf;\n (window as any).getComputedStyle = getComputedStyle;\n (window as any).addEventListener = function () {};\n (window as any).removeEventListener = function () {}\n if (!(DATE in window)) {\n (window as any).Date = Date\n }\n if (!(SET_TIMEOUT in window)) {\n (window as any).setTimeout = setTimeout\n }\n}\n","import { AppInstance, PageInstance } from './dsl/instance'\n\nexport interface Router {\n params: Record,\n path: string,\n onReady: string,\n onHide: string,\n onShow: string\n}\n\ninterface Current {\n app: AppInstance | null,\n router: Router | null,\n page: PageInstance | null,\n preloadData?: any\n}\n\nexport const Current: Current = {\n app: null,\n router: null,\n page: null\n}\n\nexport const getCurrentInstance = () => Current\n","import container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { IHooks } from '../interface'\n\n/* eslint-disable no-dupe-class-members */\ntype Callback1 = (arg1: T1) => any;\ntype Callback2 = (arg1: T1, arg2: T2) => any;\ntype Callback3 = (arg1: T1, arg2: T2, arg3: T3) => any;\ntype Callback4 = (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => any;\ntype Callback5 = (arg1: T1, arg2: T2, arg3: T3,\n arg4: T4, arg5: T5) => any;\ntype Callback6Rest = (arg1: T1, arg2: T2, arg3: T3,\n arg4: T4, arg5: T5, arg6: T6,\n ...rest: any[]) => any;\n\nexport class Events {\n private callbacks?: Record\n static eventSplitter = /\\s+/\n\n constructor (opts?) {\n if (typeof opts !== 'undefined' && opts.callbacks) {\n this.callbacks = opts.callbacks\n } else {\n this.callbacks = {}\n }\n }\n\n on(event: string, callback: Callback1, context): this\n on(event: string, callback: Callback2, context): this\n on(event: string, callback: Callback3, context): this\n on(event: string, callback: Callback4, comtext): this\n on(event: string, callback: Callback5, context): this\n on(event: string, callback: Callback6Rest, context): this\n on (eventName, callback, context): this {\n let event, node, tail, list\n if (!callback) {\n return this\n }\n eventName = eventName.split(Events.eventSplitter)\n this.callbacks ||= {}\n const calls = this.callbacks\n while ((event = eventName.shift())) {\n list = calls[event]\n node = list ? list.tail : {}\n node.next = tail = {}\n node.context = context\n node.callback = callback\n calls[event] = {\n tail,\n next: list ? list.next : node\n }\n }\n return this\n }\n\n once (events, callback, context) {\n const wrapper = (...args) => {\n callback.apply(this, args)\n this.off(events, wrapper, context)\n }\n\n this.on(events, wrapper, context)\n\n return this\n }\n\n off (events, callback, context) {\n let event, calls, node, tail, cb, ctx\n if (!(calls = this.callbacks)) {\n return this\n }\n if (!(events || callback || context)) {\n delete this.callbacks\n return this\n }\n events = events ? events.split(Events.eventSplitter) : Object.keys(calls)\n while ((event = events.shift())) {\n node = calls[event]\n delete calls[event]\n if (!node || !(callback || context)) {\n continue\n }\n tail = node.tail\n while ((node = node.next) !== tail) {\n cb = node.callback\n ctx = node.context\n if ((callback && cb !== callback) || (context && ctx !== context)) {\n this.on(event, cb, ctx)\n }\n }\n }\n return this\n }\n\n trigger(event: string)\n trigger(event: string, arg: T1)\n trigger(event: string, arg1: T1, arg2: T2)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5,\n arg6: T6, ...rest: any[])\n\n trigger (events) {\n let event, node, calls, tail\n if (!(calls = this.callbacks)) {\n return this\n }\n events = events.split(Events.eventSplitter)\n const rest = [].slice.call(arguments, 1)\n while ((event = events.shift())) {\n if ((node = calls[event])) {\n tail = node.tail\n while ((node = node.next) !== tail) {\n node.callback.apply(node.context || this, rest)\n }\n }\n }\n return this\n }\n}\n\nexport type EventsType = typeof Events\n\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\nconst eventCenter = hooks.getEventCenter(Events)\ncontainer.bind(SERVICE_IDENTIFIER.eventCenter).toConstantValue(eventCenter)\n\nexport { eventCenter }\n","/* eslint-disable dot-notation */\nimport { isFunction, EMPTY_OBJ, ensure, Shortcuts, isUndefined, isArray } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { eventHandler } from '../dom/event'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { incrementId } from '../utils'\nimport { perf } from '../perf'\nimport { PAGE_INIT } from '../constants'\nimport { isBrowser } from '../env'\nimport { eventCenter } from '../emitter/emitter'\nimport { raf } from '../bom/raf'\n\nimport type { PageConfig } from '@tarojs/taro'\nimport type { Instance, PageInstance, PageProps } from './instance'\nimport type { Func, IHooks, MpInstance } from '../interface'\nimport type { TaroRootElement } from '../dom/root'\n\nconst instances = new Map()\nconst pageId = incrementId()\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\nexport function injectPageInstance (inst: Instance, id: string) {\n hooks.mergePageInstance?.(instances.get(id), inst)\n instances.set(id, inst)\n}\n\nexport function getPageInstance (id: string): Instance | undefined {\n return instances.get(id)\n}\n\nexport function addLeadingSlash (path?: string): string {\n if (path == null) {\n return ''\n }\n return path.charAt(0) === '/' ? path : '/' + path\n}\n\nexport function safeExecute (path: string, lifecycle: keyof PageInstance, ...args: unknown[]) {\n const instance = instances.get(path)\n\n if (instance == null) {\n return\n }\n\n const func = hooks.getLifecycle(instance, lifecycle)\n\n if (isArray(func)) {\n const res = func.map(fn => fn.apply(instance, args))\n return res[0]\n }\n\n if (!isFunction(func)) {\n return\n }\n\n return func.apply(instance, args)\n}\n\nexport function stringify (obj?: Record) {\n if (obj == null) {\n return ''\n }\n const path = Object.keys(obj).map((key) => {\n return key + '=' + obj[key]\n }).join('&')\n return path === '' ? path : '?' + path\n}\n\nexport function getPath (id: string, options?: Record): string {\n let path = id\n if (!isBrowser) {\n path = id + stringify(options)\n }\n return path\n}\n\nexport function getOnReadyEventKey (path: string) {\n return path + '.' + 'onReady'\n}\n\nexport function getOnShowEventKey (path: string) {\n return path + '.' + 'onShow'\n}\n\nexport function getOnHideEventKey (path: string) {\n return path + '.' + 'onHide'\n}\n\nexport function createPageConfig (component: any, pageName?: string, data?: Record, pageConfig?: PageConfig) {\n const id = pageName ?? `taro_page_${pageId()}`\n // 小程序 Page 构造器是一个傲娇小公主，不能把复杂的对象挂载到参数上\n let pageElement: TaroRootElement | null = null\n\n let unmounting = false\n let prepareMountList: (() => void)[] = []\n\n const config: PageInstance = {\n onLoad (this: MpInstance, options, cb?: Func) {\n perf.start(PAGE_INIT)\n\n Current.page = this as any\n this.config = pageConfig || {}\n options.$taroTimestamp = Date.now()\n\n // this.$taroPath 是页面唯一标识，不可变，因此页面参数 options 也不可变\n this.$taroPath = getPath(id, options)\n // this.$taroParams 作为暴露给开发者的页面参数对象，可以被随意修改\n if (this.$taroParams == null) {\n this.$taroParams = Object.assign({}, options)\n }\n\n const router = isBrowser ? this.$taroPath : this.route || this.__route__\n Current.router = {\n params: this.$taroParams,\n path: addLeadingSlash(router),\n onReady: getOnReadyEventKey(id),\n onShow: getOnShowEventKey(id),\n onHide: getOnHideEventKey(id)\n }\n\n const mount = () => {\n Current.app!.mount!(component, this.$taroPath, () => {\n pageElement = document.getElementById(this.$taroPath)\n\n ensure(pageElement !== null, '没有找到页面实例。')\n safeExecute(this.$taroPath, 'onLoad', this.$taroParams)\n if (!isBrowser) {\n pageElement.ctx = this\n pageElement.performUpdate(true, cb)\n }\n })\n }\n if (unmounting) {\n prepareMountList.push(mount)\n } else {\n mount()\n }\n },\n onReady () {\n raf(() => {\n eventCenter.trigger(getOnReadyEventKey(id))\n })\n\n safeExecute(this.$taroPath, 'onReady')\n this.onReady.called = true\n },\n onUnload () {\n unmounting = true\n Current.app!.unmount!(this.$taroPath, () => {\n unmounting = false\n instances.delete(this.$taroPath)\n if (pageElement) {\n pageElement.ctx = null\n }\n if (prepareMountList.length) {\n prepareMountList.forEach(fn => fn())\n prepareMountList = []\n }\n })\n },\n onShow () {\n Current.page = this as any\n this.config = pageConfig || {}\n const router = isBrowser ? this.$taroPath : this.route || this.__route__\n Current.router = {\n params: this.$taroParams,\n path: addLeadingSlash(router),\n onReady: getOnReadyEventKey(id),\n onShow: getOnShowEventKey(id),\n onHide: getOnHideEventKey(id)\n }\n\n raf(() => {\n eventCenter.trigger(getOnShowEventKey(id))\n })\n\n safeExecute(this.$taroPath, 'onShow')\n },\n onHide () {\n Current.page = null\n Current.router = null\n safeExecute(this.$taroPath, 'onHide')\n eventCenter.trigger(getOnHideEventKey(id))\n },\n onPullDownRefresh () {\n return safeExecute(this.$taroPath, 'onPullDownRefresh')\n },\n onReachBottom () {\n return safeExecute(this.$taroPath, 'onReachBottom')\n },\n onPageScroll (options) {\n return safeExecute(this.$taroPath, 'onPageScroll', options)\n },\n onResize (options) {\n return safeExecute(this.$taroPath, 'onResize', options)\n },\n onTabItemTap (options) {\n return safeExecute(this.$taroPath, 'onTabItemTap', options)\n },\n onTitleClick () {\n return safeExecute(this.$taroPath, 'onTitleClick')\n },\n onOptionMenuClick () {\n return safeExecute(this.$taroPath, 'onOptionMenuClick')\n },\n onPopMenuClick () {\n return safeExecute(this.$taroPath, 'onPopMenuClick')\n },\n onPullIntercept () {\n return safeExecute(this.$taroPath, 'onPullIntercept')\n },\n onAddToFavorites () {\n return safeExecute(this.$taroPath, 'onAddToFavorites')\n }\n }\n\n // onShareAppMessage 和 onShareTimeline 一样，会影响小程序右上方按钮的选项，因此不能默认注册。\n if (component.onShareAppMessage ||\n component.prototype?.onShareAppMessage ||\n component.enableShareAppMessage) {\n config.onShareAppMessage = function (options) {\n const target = options?.target\n if (target != null) {\n const id = target.id\n const element = document.getElementById(id)\n if (element != null) {\n options.target!.dataset = element.dataset\n }\n }\n return safeExecute(this.$taroPath, 'onShareAppMessage', options)\n }\n }\n if (component.onShareTimeline ||\n component.prototype?.onShareTimeline ||\n component.enableShareTimeline) {\n config.onShareTimeline = function () {\n return safeExecute(this.$taroPath, 'onShareTimeline')\n }\n }\n\n config.eh = eventHandler\n\n if (!isUndefined(data)) {\n config.data = data\n }\n\n if (isBrowser) {\n config.path = id\n }\n\n return config\n}\n\nexport function createComponentConfig (component: React.ComponentClass, componentName?: string, data?: Record) {\n const id = componentName ?? `taro_component_${pageId()}`\n let componentElement: TaroRootElement | null = null\n\n const config: any = {\n attached () {\n perf.start(PAGE_INIT)\n const path = getPath(id, { id: this.getPageId?.() || pageId() })\n Current.app!.mount!(component, path, () => {\n componentElement = document.getElementById(path)\n ensure(componentElement !== null, '没有找到组件实例。')\n safeExecute(path, 'onLoad')\n if (!isBrowser) {\n componentElement.ctx = this\n componentElement.performUpdate(true)\n }\n })\n },\n detached () {\n const path = getPath(id, { id: this.getPageId() })\n Current.app!.unmount!(path, () => {\n instances.delete(path)\n if (componentElement) {\n componentElement.ctx = null\n }\n })\n },\n methods: {\n eh: eventHandler\n }\n }\n if (!isUndefined(data)) {\n config.data = data\n }\n\n config['options'] = component?.['options'] ?? EMPTY_OBJ\n config['externalClasses'] = component?.['externalClasses'] ?? EMPTY_OBJ\n config['behaviors'] = component?.['behaviors'] ?? EMPTY_OBJ\n return config\n}\n\nexport function createRecursiveComponentConfig (componentName?: string) {\n return {\n properties: {\n i: {\n type: Object,\n value: {\n [Shortcuts.NodeName]: 'view'\n }\n },\n l: {\n type: String,\n value: ''\n }\n },\n options: {\n addGlobalClass: true,\n virtualHost: componentName !== 'custom-wrapper'\n },\n methods: {\n eh: eventHandler\n }\n }\n}\n","import type * as React from 'react'\nimport { isFunction, ensure, EMPTY_OBJ } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { getPageInstance, injectPageInstance, safeExecute, addLeadingSlash } from './common'\nimport { isBrowser } from '../env'\nimport { incrementId } from '../utils'\nimport { HOOKS_APP_ID } from '../constants'\nimport { eventHandler } from '../dom/event'\n\nimport type { AppConfig, PageInstance } from '@tarojs/taro'\nimport type { AppInstance, ReactPageComponent, PageProps, Instance, ReactAppInstance } from './instance'\nimport type { IHooks } from '../interface'\nimport type { TaroRootElement } from '../dom/root'\n\ndeclare const getCurrentPages: () => PageInstance[]\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\nfunction isClassComponent (R: typeof React, component): boolean {\n return isFunction(component.render) ||\n !!component.prototype?.isReactComponent ||\n component.prototype instanceof R.Component // compat for some others react-like library\n}\n\n// 初始值设置为 any 主要是为了过 TS 的校验\nexport let R: typeof React = EMPTY_OBJ\nexport let PageContext: React.Context = EMPTY_OBJ\n\nexport function connectReactPage (\n R: typeof React,\n id: string\n) {\n const h = R.createElement\n return (component: ReactPageComponent): React.ComponentClass => {\n // eslint-disable-next-line dot-notation\n const isReactComponent = isClassComponent(R, component)\n\n const inject = (node?: Instance) => node && injectPageInstance(node, id)\n const refs = isReactComponent ? { ref: inject } : {\n forwardedRef: inject,\n // 兼容 react-redux 7.20.1+\n reactReduxForwardedRef: inject\n }\n\n if (PageContext === EMPTY_OBJ) {\n PageContext = R.createContext('')\n }\n\n return class Page extends R.Component {\n state = {\n hasError: false\n }\n\n static getDerivedStateFromError (error: Error) {\n process.env.NODE_ENV !== 'production' && console.warn(error)\n return { hasError: true }\n }\n\n // React 16 uncaught error 会导致整个应用 crash，\n // 目前把错误缩小到页面\n componentDidCatch (error: Error, info: React.ErrorInfo) {\n process.env.NODE_ENV !== 'production' && console.warn(error)\n process.env.NODE_ENV !== 'production' && console.error(info.componentStack)\n }\n\n render () {\n const children = this.state.hasError\n ? []\n : h(PageContext.Provider, { value: id }, h(component, {\n ...this.props,\n ...refs\n }))\n\n if (isBrowser) {\n return h(\n 'div',\n { id, className: 'taro_page' },\n children\n )\n }\n\n return h(\n 'root',\n { id },\n children\n )\n }\n }\n }\n}\n\nlet ReactDOM\n\ntype PageComponent = React.CElement>\n\nfunction setReconciler () {\n const getLifecycle = function (instance, lifecycle) {\n lifecycle = lifecycle.replace(/^on(Show|Hide)$/, 'componentDid$1')\n return instance[lifecycle]\n }\n\n const modifyMpEvent = function (event) {\n event.type = event.type.replace(/-/g, '')\n }\n\n const batchedEventUpdates = function (cb) {\n ReactDOM.unstable_batchedUpdates(cb)\n }\n\n const mergePageInstance = function (prev, next) {\n if (!prev || !next) return\n\n // 子组件使用 lifecycle hooks 注册了生命周期后，会存在 prev，里面是注册的生命周期回调。\n\n // prev 使用 Object.create(null) 创建，H5 的 fast-refresh 可能也会导致存在 prev，要排除这些意外产生的 prev\n if ('constructor' in prev) return\n\n Object.keys(prev).forEach(item => {\n if (isFunction(next[item])) {\n next[item] = [next[item], ...prev[item]]\n } else {\n next[item] = [...(next[item] || []), ...prev[item]]\n }\n })\n }\n\n hooks.getLifecycle = getLifecycle\n hooks.modifyMpEvent = modifyMpEvent\n hooks.batchedEventUpdates = batchedEventUpdates\n hooks.mergePageInstance = mergePageInstance\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (\n el: React.FunctionComponent | React.ComponentClass,\n _,\n R: typeof React,\n customWrapper\n ) => {\n const isReactComponent = isClassComponent(R, el)\n\n return R.forwardRef((props, ref) => {\n const newProps: React.Props = { ...props }\n const refs = isReactComponent ? { ref: ref } : {\n forwardedRef: ref,\n // 兼容 react-redux 7.20.1+\n reactReduxForwardedRef: ref\n }\n\n return R.createElement(\n customWrapper || 'taro-pull-to-refresh',\n null,\n R.createElement(el, {\n ...newProps,\n ...refs\n })\n )\n })\n }\n\n hooks.getDOMNode = (inst) => {\n return ReactDOM.findDOMNode(inst)\n }\n }\n}\n\nconst pageKeyId = incrementId()\n\nexport function createReactApp (App: React.ComponentClass, react: typeof React, reactdom, config: AppConfig) {\n R = react\n ReactDOM = reactdom\n ensure(!!ReactDOM, '构建 React/Nerv 项目请把 process.env.FRAMEWORK 设置为 \\'react\\'/\\'nerv\\' ')\n\n const ref = R.createRef()\n const isReactComponent = isClassComponent(R, App)\n\n setReconciler()\n class AppWrapper extends R.Component {\n // run createElement() inside the render function to make sure that owner is right\n private pages: Array<() => PageComponent> = []\n private elements: Array = []\n\n public mount (component: React.ComponentClass, id: string, cb: () => void) {\n const key = id + pageKeyId()\n const page = () => R.createElement(component, { key, tid: id })\n this.pages.push(page)\n this.forceUpdate(cb)\n }\n\n public unmount (id: string, cb: () => void) {\n for (let i = 0; i < this.elements.length; i++) {\n const element = this.elements[i]\n if (element.props.tid === id) {\n this.elements.splice(i, 1)\n break\n }\n }\n\n this.forceUpdate(cb)\n }\n\n public render () {\n while (this.pages.length > 0) {\n const page = this.pages.pop()!\n this.elements.push(page())\n }\n\n let props: React.Props | null = null\n\n if (isReactComponent) {\n props = { ref }\n }\n\n return R.createElement(\n App,\n props,\n isBrowser ? R.createElement('div', null, this.elements.slice()) : this.elements.slice()\n )\n }\n }\n\n let wrapper: AppWrapper\n if (!isBrowser) {\n // eslint-disable-next-line react/no-render-return-value\n wrapper = ReactDOM.render(R.createElement(AppWrapper), document.getElementById('app'))\n }\n\n const app: AppInstance = Object.create({\n render (cb: () => void) {\n wrapper.forceUpdate(cb)\n },\n\n mount (component: ReactPageComponent, id: string, cb: () => void) {\n const page = connectReactPage(R, id)(component)\n wrapper.mount(page, id, cb)\n },\n\n unmount (id: string, cb: () => void) {\n wrapper.unmount(id, cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n enumerable: true,\n writable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n // 由于 H5 路由初始化的时候会清除 app 下的 dom 元素，所以需要在路由初始化后执行 render\n // eslint-disable-next-line react/no-render-return-value\n wrapper = ReactDOM.render(R.createElement(AppWrapper), document.getElementById('app'))\n }\n const app = ref.current\n\n // For taroize\n // 把 App Class 上挂载的额外属性同步到全局 app 对象中\n if (app?.taroGlobalData) {\n const globalData = app.taroGlobalData\n const keys = Object.keys(globalData)\n const descriptors = Object.getOwnPropertyDescriptors(globalData)\n keys.forEach(key => {\n Object.defineProperty(this, key, {\n configurable: true,\n enumerable: true,\n get () {\n return globalData[key]\n },\n set (value) {\n globalData[key] = value\n }\n })\n })\n Object.defineProperties(this, descriptors)\n }\n this.$app = app\n\n if (app != null && isFunction(app.onLaunch)) {\n app.onLaunch(options)\n }\n }\n },\n\n onShow: {\n enumerable: true,\n writable: true,\n value (options) {\n const app = ref.current\n Current.router = {\n params: options?.query,\n ...options\n }\n if (app != null && isFunction(app.componentDidShow)) {\n app.componentDidShow(options)\n }\n\n // app useDidShow\n triggerAppHook('onShow')\n }\n },\n\n onHide: {\n enumerable: true,\n writable: true,\n value (options: unknown) {\n const app = ref.current\n if (app != null && isFunction(app.componentDidHide)) {\n app.componentDidHide(options)\n }\n\n // app useDidHide\n triggerAppHook('onHide')\n }\n },\n\n onPageNotFound: {\n enumerable: true,\n writable: true,\n value (res: unknown) {\n const app = ref.current\n if (app != null && isFunction(app.onPageNotFound)) {\n app.onPageNotFound(res)\n }\n }\n }\n })\n\n function triggerAppHook (lifecycle) {\n const instance = getPageInstance(HOOKS_APP_ID)\n if (instance) {\n const app = ref.current\n const func = hooks.getLifecycle(instance, lifecycle)\n if (Array.isArray(func)) {\n func.forEach(cb => cb.apply(app))\n }\n }\n }\n\n Current.app = app\n return Current.app\n}\n\nconst getNativeCompId = incrementId()\n\nfunction initNativeComponentEntry (R: typeof React, ReactDOM) {\n interface IEntryState {\n components: {\n compId: string\n element: React.ReactElement\n }[]\n }\n\n interface IWrapperProps {\n getCtx: () => any\n renderComponent: (ctx: any) => React.ReactElement\n }\n\n class NativeComponentWrapper extends R.Component> {\n root = R.createRef()\n ctx = this.props.getCtx()\n\n componentDidMount () {\n this.ctx.component = this\n const rootElement = this.root.current!\n rootElement.ctx = this.ctx\n rootElement.performUpdate(true)\n }\n\n render () {\n return (\n R.createElement(\n 'root',\n {\n ref: this.root\n },\n this.props.renderComponent(this.ctx)\n )\n )\n }\n }\n\n class Entry extends R.Component, IEntryState> {\n state: IEntryState = {\n components: []\n }\n\n componentDidMount () {\n Current.app = this\n }\n\n mount (Component, compId, getCtx) {\n const isReactComponent = isClassComponent(R, Component)\n const inject = (node?: Instance) => node && injectPageInstance(node, compId)\n const refs = isReactComponent ? { ref: inject } : {\n forwardedRef: inject,\n reactReduxForwardedRef: inject\n }\n const item = {\n compId,\n element: R.createElement(NativeComponentWrapper, {\n key: compId,\n getCtx,\n renderComponent (ctx) {\n return R.createElement(Component, { ...(ctx.data ||= {}).props, ...refs })\n }\n })\n }\n this.setState({\n components: [...this.state.components, item]\n })\n }\n\n unmount (compId) {\n const components = this.state.components\n const index = components.findIndex(item => item.compId === compId)\n const next = [...components.slice(0, index), ...components.slice(index + 1)]\n this.setState({\n components: next\n })\n }\n\n render () {\n const components = this.state.components\n return (\n components.map(({ element }) => element)\n )\n }\n }\n\n setReconciler()\n\n const app = document.getElementById('app')\n\n ReactDOM.render(\n R.createElement(Entry, {}),\n app\n )\n}\n\nexport function createNativeComponentConfig (Component, react: typeof React, reactdom, componentConfig) {\n R = react\n ReactDOM = reactdom\n\n const config = {\n properties: {\n props: {\n type: null,\n value: null,\n observer (_newVal, oldVal) {\n oldVal && this.component.forceUpdate()\n }\n }\n },\n created () {\n if (!Current.app) {\n initNativeComponentEntry(R, ReactDOM)\n }\n },\n attached () {\n setCurrent()\n this.compId = getNativeCompId()\n this.config = componentConfig\n Current.app!.mount!(Component, this.compId, () => this)\n },\n ready () {\n safeExecute(this.compId, 'onReady')\n },\n detached () {\n Current.app!.unmount!(this.compId)\n },\n pageLifetimes: {\n show () {\n safeExecute(this.compId, 'onShow')\n },\n hide () {\n safeExecute(this.compId, 'onHide')\n }\n },\n methods: {\n eh: eventHandler\n }\n }\n\n function setCurrent () {\n const pages = getCurrentPages()\n const currentPage = pages[pages.length - 1]\n if (Current.page === currentPage) return\n\n Current.page = currentPage\n\n const route = (currentPage as any).route || (currentPage as any).__route__\n const router = {\n params: currentPage.options || {},\n path: addLeadingSlash(route),\n onReady: '',\n onHide: '',\n onShow: ''\n }\n Current.router = router\n\n if (!currentPage.options) {\n // 例如在微信小程序中，页面 options 的设置时机比组件 attached 慢\n Object.defineProperty(currentPage, 'options', {\n enumerable: true,\n configurable: true,\n get () {\n return this._optionsValue\n },\n set (value) {\n router.params = value\n this._optionsValue = value\n }\n })\n }\n }\n\n return config\n}\n","import { isFunction, noop, ensure, isBoolean } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { injectPageInstance } from './common'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { isBrowser } from '../env'\n\n/* eslint-disable import/no-duplicates */\nimport type VueCtor from 'vue'\nimport type { ComponentOptions, VueConstructor, VNode } from 'vue'\nimport type { AppConfig } from '@tarojs/taro'\nimport type { AppInstance, VueAppInstance, VueInstance } from './instance'\nimport type { IHooks } from '../interface'\n\nexport type V = typeof VueCtor\n\nexport function connectVuePage (Vue: VueConstructor, id: string) {\n return (component: ComponentOptions) => {\n const injectedPage = Vue.extend({\n props: {\n tid: String\n },\n mixins: [component, {\n created () {\n injectPageInstance(this, id)\n }\n }]\n })\n\n const options: ComponentOptions = {\n render (h) {\n return h(\n isBrowser ? 'div' : 'root',\n {\n attrs: {\n id,\n class: isBrowser ? 'taro_page' : ''\n }\n },\n [\n h(injectedPage, { props: { tid: id } })\n ]\n )\n }\n }\n\n return options\n }\n}\n\nfunction setReconciler () {\n const hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\n const onRemoveAttribute = function (dom, qualifiedName) {\n // 处理原因: https://github.com/NervJS/taro/pull/5990\n const props = dom.props\n if (!props.hasOwnProperty(qualifiedName) || isBoolean(props[qualifiedName])) {\n dom.setAttribute(qualifiedName, false)\n return true\n }\n }\n\n const getLifecycle = function (instance, lifecycle) {\n return instance.$options[lifecycle]\n }\n\n hooks.onRemoveAttribute = onRemoveAttribute\n hooks.getLifecycle = getLifecycle\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (el, path, vue: VueConstructor) => {\n const injectedPage = vue.extend({\n props: {\n tid: String\n },\n mixins: [el as ComponentOptions, {\n created () {\n injectPageInstance(this, path)\n }\n }]\n })\n\n const options: ComponentOptions = {\n name: 'PullToRefresh',\n render (h) {\n return h(\n 'taro-pull-to-refresh',\n {\n class: ['hydrated']\n },\n [h(injectedPage, this.$slots.default)]\n )\n }\n }\n\n return options\n }\n\n hooks.getDOMNode = (el) => {\n return el.$el as any\n }\n }\n}\n\nlet Vue\n\nexport function createVueApp (App: ComponentOptions, vue: V, config: AppConfig) {\n Vue = vue\n ensure(!!Vue, '构建 Vue 项目请把 process.env.FRAMEWORK 设置为 \\'vue\\'')\n\n setReconciler()\n\n Vue.config.getTagNamespace = noop\n\n const elements: VNode[] = []\n const pages: Array<(h: Vue.CreateElement) => VNode> = []\n let appInstance: VueAppInstance\n\n const wrapper = new (Vue as VueConstructor)({\n render (h) {\n while (pages.length > 0) {\n const page = pages.pop()!\n elements.push(page(h))\n }\n return h(App, { ref: 'app' }, elements.slice())\n },\n methods: {\n mount (component: ComponentOptions, id: string, cb: () => void) {\n pages.push((h) => h(component, { key: id }))\n this.updateSync(cb)\n },\n updateSync (this: VueInstance, cb: () => void) {\n this._update(this._render(), false)\n this.$children.forEach((child: VueInstance) => child._update(child._render(), false))\n cb()\n },\n unmount (id: string, cb: () => void) {\n for (let i = 0; i < elements.length; i++) {\n const element = elements[i]\n if (element.key === id) {\n elements.splice(i, 1)\n break\n }\n }\n\n this.updateSync(cb)\n }\n }\n })\n if (!isBrowser) {\n wrapper.$mount(document.getElementById('app') as any)\n }\n const app: AppInstance = Object.create({\n mount (component: ComponentOptions, id: string, cb: () => void) {\n const page = connectVuePage(Vue, id)(component)\n wrapper.mount(page, id, cb)\n },\n\n unmount (id: string, cb: () => void) {\n wrapper.unmount(id, cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n // 由于 H5 路由初始化的时候会清除 app 下的 dom 元素，所以需要在路由初始化后再执行 render\n wrapper.$mount(document.getElementById('app') as any)\n }\n appInstance = wrapper.$refs.app as VueAppInstance\n if (appInstance != null && isFunction(appInstance.$options.onLaunch)) {\n appInstance.$options.onLaunch.call(appInstance, options)\n }\n }\n },\n\n onShow: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (appInstance != null && isFunction(appInstance.$options.onShow)) {\n appInstance.$options.onShow.call(appInstance, options)\n }\n }\n },\n\n onHide: {\n writable: true,\n enumerable: true,\n value (options) {\n if (appInstance != null && isFunction(appInstance.$options.onHide)) {\n appInstance.$options.onHide.call(appInstance, options)\n }\n }\n }\n })\n\n Current.app = app\n\n return Current.app\n}\n","import { isFunction, isArray, ensure } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { Current } from '../current'\nimport { injectPageInstance, safeExecute } from './common'\nimport { isBrowser } from '../env'\n\nimport type {\n App,\n Component,\n ComponentPublicInstance,\n VNode,\n h as createElement\n} from '@vue/runtime-core'\nimport type { TaroElement } from '../dom/element'\nimport type { AppConfig as Config } from '@tarojs/taro'\nimport type { GetLifecycle, IHooks } from '../interface'\nimport type { AppInstance } from './instance'\n\nfunction createVue3Page (h: typeof createElement, id: string) {\n return function (component): VNode {\n const inject = {\n props: {\n tid: String\n },\n created () {\n injectPageInstance(this, id)\n // vue3 组件 created 时机比小程序页面 onShow 慢，因此在 created 后再手动触发一次 onShow。\n this.$nextTick(() => {\n safeExecute(id, 'onShow')\n })\n }\n }\n\n if (isArray(component.mixins)) {\n const mixins = component.mixins\n const idx = mixins.length - 1\n if (!mixins[idx].props?.tid) {\n // mixins 里还没注入过，直接推入数组\n component.mixins.push(inject)\n } else {\n // mixins 里已经注入过，代替前者\n component.mixins[idx] = inject\n }\n } else {\n component.mixins = [inject]\n }\n\n return h(\n isBrowser ? 'div' : 'root',\n {\n key: id,\n id,\n class: isBrowser ? 'taro_page' : ''\n },\n [\n h(Object.assign({}, component), {\n tid: id\n })\n ]\n )\n }\n}\n\nfunction setReconciler () {\n const hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\n const getLifecycle: GetLifecycle = function (instance, lifecycle) {\n return instance.$options[lifecycle]\n }\n\n const modifyMpEvent = function (event) {\n event.type = event.type.replace(/-/g, '')\n }\n\n hooks.getLifecycle = getLifecycle\n hooks.modifyMpEvent = modifyMpEvent\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (component, path, h: typeof createElement) => {\n const inject = {\n props: {\n tid: String\n },\n created () {\n injectPageInstance(this, path)\n }\n }\n\n component.mixins = isArray(component.mixins)\n ? component.mixins.push(inject)\n : [inject]\n\n return {\n render () {\n return h(\n 'taro-pull-to-refresh',\n {\n class: 'hydrated'\n },\n [h(component, this.$slots.default)]\n )\n }\n }\n }\n\n hooks.getDOMNode = (el) => {\n return el.$el as any\n }\n }\n}\n\nexport function createVue3App (app: App, h: typeof createElement, config: Config) {\n let pages: VNode[] = []\n let appInstance: ComponentPublicInstance\n\n ensure(!isFunction(app._component), '入口组件不支持使用函数式组件')\n\n setReconciler()\n\n app._component.render = function () {\n return pages.slice()\n }\n if (!isBrowser) {\n appInstance = app.mount('#app')\n }\n const appConfig: AppInstance = Object.create({\n mount (component: Component, id: string, cb: () => void) {\n const page = createVue3Page(h, id)(component)\n pages.push(page)\n this.updateAppInstance(cb)\n },\n\n unmount (id: string, cb: () => void) {\n pages = pages.filter(page => page.key !== id)\n this.updateAppInstance(cb)\n },\n\n updateAppInstance (cb?: (() => void | undefined)) {\n appInstance.$forceUpdate()\n appInstance.$nextTick(cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n appInstance = app.mount('#app')\n }\n const onLaunch = appInstance?.$options?.onLaunch\n isFunction(onLaunch) && onLaunch.call(appInstance, options)\n }\n },\n\n onShow: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n const onShow = appInstance?.$options?.onShow\n isFunction(onShow) && onShow.call(appInstance, options)\n }\n },\n\n onHide: {\n writable: true,\n enumerable: true,\n value (options) {\n const onHide = appInstance?.$options?.onHide\n isFunction(onHide) && onHide.call(appInstance, options)\n }\n }\n })\n\n Current.app = appConfig\n\n return Current.app\n}\n","import { isFunction, isArray } from '@tarojs/shared';\nimport { PageContext } from './react';\nimport React from 'react';\nimport { getPageInstance, injectPageInstance } from './common';\nimport { PageLifeCycle } from './instance';\nimport { Current } from '../current';\nimport { HOOKS_APP_ID } from '../constants';\n\nimport type { Func } from '../interface';\n\nconst taroHooks = (lifecycle: keyof PageLifeCycle) => {\n return (fn: Func) => {\n const id = React.useContext(PageContext) || HOOKS_APP_ID;\n\n // hold fn ref and keep up to date\n const fnRef = React.useRef(fn);\n if (fnRef.current !== fn) fnRef.current = fn;\n\n React.useLayoutEffect(() => {\n let inst = getPageInstance(id);\n let first = false;\n if (inst == null) {\n first = true;\n inst = Object.create(null);\n }\n\n inst = inst!;\n\n // callback is immutable but inner function is up to date\n const callback = (...args: any) => fnRef.current(...args);\n\n if (isFunction(inst[lifecycle])) {\n (inst[lifecycle] as any) = [inst[lifecycle], callback];\n } else {\n (inst[lifecycle] as any) = [\n ...((inst[lifecycle] as any) || []),\n callback,\n ];\n }\n\n if (first) {\n injectPageInstance(inst!, id);\n }\n return () => {\n const inst = getPageInstance(id);\n const list = inst![lifecycle];\n if (list === callback) {\n (inst![lifecycle] as any) = undefined;\n } else if (isArray(list)) {\n (inst![lifecycle] as any) = list.filter((item) => item !== callback);\n }\n };\n }, []);\n };\n};\n\nexport const useDidShow = taroHooks('componentDidShow');\n\nexport const useDidHide = taroHooks('componentDidHide');\n\nexport const usePullDownRefresh = taroHooks('onPullDownRefresh');\n\nexport const useReachBottom = taroHooks('onReachBottom');\n\nexport const usePageScroll = taroHooks('onPageScroll');\n\nexport const useResize = taroHooks('onResize');\n\nexport const useShareAppMessage = taroHooks('onShareAppMessage');\n\nexport const useTabItemTap = taroHooks('onTabItemTap');\n\nexport const useTitleClick = taroHooks('onTitleClick');\n\nexport const useOptionMenuClick = taroHooks('onOptionMenuClick');\n\nexport const usePullIntercept = taroHooks('onPullIntercept');\n\nexport const useShareTimeline = taroHooks('onShareTimeline');\n\nexport const useAddToFavorites = taroHooks('onAddToFavorites');\n\nexport const useReady = taroHooks('onReady');\n\nexport const useRouter = (dynamic = false) => {\n return dynamic ? Current.router : React.useMemo(() => Current.router, []);\n};\n\nexport const useScope = () => undefined;\n","import { Current } from './current'\nimport { getPath } from './dsl/common'\nimport { TaroRootElement } from './dom/root'\nimport { document } from './bom/document'\nimport { isBrowser } from './env'\n\nimport type { Func } from './interface'\n\nfunction removeLeadingSlash (path?: string) {\n if (path == null) {\n return ''\n }\n return path.charAt(0) === '/' ? path.slice(1) : path\n}\n\nexport const nextTick = (cb: Func, ctx?: Record) => {\n const router = Current.router\n const timerFunc = () => {\n setTimeout(function () {\n ctx ? cb.call(ctx) : cb()\n }, 1)\n }\n\n if (router !== null) {\n let pageElement: TaroRootElement | null = null\n const path = getPath(removeLeadingSlash(router.path), router.params)\n pageElement = document.getElementById(path)\n if (pageElement !== null) {\n if (isBrowser) {\n // eslint-disable-next-line dot-notation\n pageElement.firstChild?.['componentOnReady']?.().then(() => {\n timerFunc()\n }) ?? timerFunc()\n } else {\n pageElement.enqueueUpdateCallback(cb, ctx)\n }\n } else {\n timerFunc()\n }\n } else {\n timerFunc()\n }\n}\n"],"names":["isObject","isArray","Symbol","objectProto","hasOwnProperty","nativeObjectToString","symToStringTag","funcProto","funcToString","HASH_UNDEFINED","Map","INFINITY","isFunction","hooks","document","ioc_container","container","window","setReconciler"],"mappings":";;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;AACnC,EAAE,OAAO,CAAC,kBAAkB,EAAC;AAC7B,CAAC,MAAM;AACP;AACA,EAAE,CAAC,UAAU,OAAO,EAAE;AACtB;AACA;AACA,MAAM,CAAC,UAAU,OAAO,EAAE;AAC1B;AACA;AACA;AACA;AACA,UAAU,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC5B,UAAU,SAAS,YAAY,CAAC,MAAM,EAAE,QAAQ,EAAE;AAClD,cAAc,OAAO,UAAU,GAAG,EAAE,KAAK,EAAE;AAC3C,kBAAkB,IAAI,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,UAAU,EAAE;AACzD,sBAAsB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAC/G,mBAAmB;AACnB,kBAAkB,IAAI,QAAQ;AAC9B,sBAAsB,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAC3C,eAAe,CAAC;AAChB,WAAW;AACX,OAAO,EAAE,UAAU,QAAQ,EAAE;AAC7B,UAAU,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AACvD;AACA,UAAU,IAAI,cAAc,GAAG,OAAO,MAAM,KAAK,UAAU,CAAC;AAC5D,UAAU,IAAI,iBAAiB,GAAG,cAAc,IAAI,OAAO,MAAM,CAAC,WAAW,KAAK,WAAW,GAAG,MAAM,CAAC,WAAW,GAAG,eAAe,CAAC;AACrI,UAAU,IAAI,cAAc,GAAG,cAAc,IAAI,OAAO,MAAM,CAAC,QAAQ,KAAK,WAAW,GAAG,MAAM,CAAC,QAAQ,GAAG,YAAY,CAAC;AACzH,UAAU,IAAI,cAAc,GAAG,OAAO,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC;AACnE,UAAU,IAAI,aAAa,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,KAAK,CAAC;AACjE,UAAU,IAAI,SAAS,GAAG,CAAC,cAAc,IAAI,CAAC,aAAa,CAAC;AAC5D,UAAU,IAAI,OAAO,GAAG;AACxB;AACA,cAAc,MAAM,EAAE,cAAc;AACpC,oBAAoB,YAAY,EAAE,OAAO,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;AAC/E,oBAAoB,aAAa;AACjC,wBAAwB,YAAY,EAAE,OAAO,cAAc,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE;AACnF,wBAAwB,YAAY,EAAE,OAAO,cAAc,CAAC,EAAE,CAAC,CAAC,EAAE;AAClE,cAAc,GAAG,EAAE,SAAS;AAC5B,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;AACzE,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE;AAC9D,cAAc,GAAG,EAAE,SAAS;AAC5B,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,EAAE;AAChG,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;AAC5D,WAAW,CAAC;AACZ;AACA,UAAU,IAAI,iBAAiB,GAAG,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;AAClE,UAAU,IAAI,WAAW,GAAG,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,KAAK,MAAM,CAAC;AACtI,UAAU,IAAI,IAAI,GAAG,CAAC,WAAW,IAAI,OAAO,GAAG,KAAK,UAAU,IAAI,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,UAAU,GAAG,GAAG,GAAG,iBAAiB,EAAE,CAAC;AAC1I,UAAU,IAAI,IAAI,GAAG,CAAC,WAAW,IAAI,OAAO,GAAG,KAAK,UAAU,IAAI,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,UAAU,GAAG,GAAG,GAAG,iBAAiB,EAAE,CAAC;AAC1I,UAAU,IAAI,QAAQ,GAAG,CAAC,WAAW,IAAI,OAAO,OAAO,KAAK,UAAU,GAAG,OAAO,GAAG,qBAAqB,EAAE,CAAC;AAC3G;AACA;AACA,UAAU,IAAI,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE;AACzE,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE;AAC7C,kBAAkB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;AAC1C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACvC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;AAC9F,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,MAAM,CAAC,UAAU,CAAC;AACxC,sBAAsB,UAAU,GAAG,SAAS,CAAC;AAC7C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,kBAAkB,OAAO,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;AACvF,eAAe;AACf,mBAAmB;AACnB,kBAAkB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;AAC1C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;AAC5C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,OAAO,mBAAmB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AACjE,eAAe;AACf,WAAW;AACX,UAAU,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,WAAW,EAAE,aAAa,EAAE;AACxD,cAAc,SAAS,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE;AACtD,kBAAkB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACvC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC;AAC9E,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC7F,eAAe;AACf,cAAc,OAAO,SAAS,CAAC;AAC/B,WAAW;AACX,UAAU,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,EAAE;AACnF,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAChG,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACjE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC3E,WAAW;AACX,UAAU,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC9E,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACjE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC3E,WAAW;AACX,UAAU,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC9E,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,eAAe,CAAC,MAAM,EAAE,WAAW,EAAE;AACxD,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,oBAAoB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC/D,WAAW;AACX,UAAU,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC,CAAC;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,kBAAkB,CAAC,MAAM,EAAE,WAAW,EAAE;AAC3D,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,uBAAuB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAClE,WAAW;AACX,UAAU,QAAQ,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,EAAE,WAAW,aAAa,KAAK,CAAC,CAAC;AAC9F,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC;AAClD,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC;AACtC,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACxD,cAAc,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;AACjD,cAAc,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC;AACzC,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AACtC,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD,UAAU,SAAS,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE;AAC3D,cAAc,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC/D,kBAAkB,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAChD,kBAAkB,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AACpD,kBAAkB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;AACrE,sBAAsB,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC;AACnD,0BAA0B,MAAM,IAAI,SAAS,EAAE,CAAC;AAChD,sBAAsB,MAAM,GAAG,SAAS,CAAC;AACzC,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,MAAM,CAAC;AAC5B,WAAW;AACX,UAAU,SAAS,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE;AACjF,cAAc,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC/D,kBAAkB,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAChD,kBAAkB,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;AAC7E,kBAAkB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;AACrE,sBAAsB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;AAC9C,0BAA0B,MAAM,IAAI,SAAS,EAAE,CAAC;AAChD,sBAAsB,UAAU,GAAG,SAAS,CAAC;AAC7C,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,UAAU,CAAC;AAChC,WAAW;AACX,UAAU,SAAS,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;AACxD,cAAc,IAAI,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACnD,cAAc,IAAI,WAAW,CAAC,cAAc,CAAC,EAAE;AAC/C,kBAAkB,IAAI,CAAC,MAAM;AAC7B,sBAAsB,OAAO,SAAS,CAAC;AACvC,kBAAkB,cAAc,GAAG,IAAI,IAAI,EAAE,CAAC;AAC9C,kBAAkB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAClD,eAAe;AACf,cAAc,IAAI,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtD,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC,EAAE;AAC5C,kBAAkB,IAAI,CAAC,MAAM;AAC7B,sBAAsB,OAAO,SAAS,CAAC;AACvC,kBAAkB,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC;AAC3C,kBAAkB,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACrD,eAAe;AACf,cAAc,OAAO,WAAW,CAAC;AACjC,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,IAAI,MAAM;AACxB,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;AACjC,kBAAkB,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,OAAO,KAAK,CAAC;AAC3B,WAAW;AACX;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC7D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,OAAO,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;AAC7D,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,IAAI,MAAM;AACxB,kBAAkB,OAAO,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACnE,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;AACjC,kBAAkB,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,OAAO,SAAS,CAAC;AAC/B,WAAW;AACX;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC7D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,SAAS,CAAC;AACnC,cAAc,OAAO,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAClD,WAAW;AACX;AACA;AACA,UAAU,SAAS,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,EAAE;AAC/E,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,IAAI,CAAC,CAAC;AAC9E,cAAc,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;AAC1D,WAAW;AACX;AACA;AACA,UAAU,SAAS,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE;AAC9C,cAAc,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,MAAM,KAAK,IAAI;AACjC,kBAAkB,OAAO,OAAO,CAAC;AACjC,cAAc,IAAI,UAAU,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC/D,cAAc,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC;AACxC,kBAAkB,OAAO,OAAO,CAAC;AACjC,cAAc,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;AACrC,kBAAkB,OAAO,UAAU,CAAC;AACpC,cAAc,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AACnC,cAAc,IAAI,IAAI,GAAG,EAAE,CAAC;AAC5B,cAAc,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;AACjF,kBAAkB,IAAI,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;AAC1C,kBAAkB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5C,kBAAkB,IAAI,CAAC,MAAM,EAAE;AAC/B,sBAAsB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnC,sBAAsB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,mBAAmB;AACnB,eAAe;AACf,cAAc,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;AAC1F,kBAAkB,IAAI,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;AAC7C,kBAAkB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5C,kBAAkB,IAAI,CAAC,MAAM,EAAE;AAC/B,sBAAsB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnC,sBAAsB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX;AACA;AACA,UAAU,SAAS,uBAAuB,CAAC,CAAC,EAAE,CAAC,EAAE;AACjD,cAAc,IAAI,IAAI,GAAG,EAAE,CAAC;AAC5B,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC;AAC/C,cAAc,IAAI,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;AAClD,cAAc,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,cAAc,OAAO,IAAI,EAAE;AAC3B,kBAAkB,IAAI,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;AACpD,kBAAkB,IAAI,CAAC,IAAI,EAAE;AAC7B,sBAAsB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB;AACnB,kBAAkB,IAAI,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;AACtD,kBAAkB,IAAI;AACtB,sBAAsB,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAC1C,mBAAmB;AACnB,kBAAkB,OAAO,CAAC,EAAE;AAC5B,sBAAsB,IAAI;AAC1B,0BAA0B,aAAa,CAAC,QAAQ,CAAC,CAAC;AAClD,uBAAuB;AACvB,8BAA8B;AAC9B,0BAA0B,MAAM,CAAC,CAAC;AAClC,uBAAuB;AACvB,mBAAmB;AACnB,kBAAkB,CAAC,EAAE,CAAC;AACtB,eAAe;AACf,WAAW;AACX;AACA;AACA,UAAU,SAAS,IAAI,CAAC,CAAC,EAAE;AAC3B,cAAc,IAAI,CAAC,KAAK,IAAI;AAC5B,kBAAkB,OAAO,CAAC,YAAY;AACtC,cAAc,QAAQ,OAAO,CAAC;AAC9B,kBAAkB,KAAK,WAAW,EAAE,OAAO,CAAC,iBAAiB;AAC7D,kBAAkB,KAAK,SAAS,EAAE,OAAO,CAAC,eAAe;AACzD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC,cAAc,CAAC,cAAc;AACnF,kBAAkB,SAAS,OAAO,CAAC,cAAc;AACjD,eAAe;AACf,WAAW;AACX;AACA;AACA,UAAU,SAAS,WAAW,CAAC,CAAC,EAAE;AAClC,cAAc,OAAO,CAAC,KAAK,SAAS,CAAC;AACrC,WAAW;AACX;AACA;AACA,UAAU,SAAS,MAAM,CAAC,CAAC,EAAE;AAC7B,cAAc,OAAO,CAAC,KAAK,IAAI,CAAC;AAChC,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC/B,cAAc,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC3C,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC/B,cAAc,OAAO,OAAO,CAAC,KAAK,QAAQ,GAAG,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,KAAK,UAAU,CAAC;AAClF,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,KAAK,EAAE,aAAa,EAAE;AACrD,cAAc,QAAQ,IAAI,CAAC,KAAK,CAAC;AACjC,kBAAkB,KAAK,CAAC,kBAAkB,OAAO,KAAK,CAAC;AACvD,kBAAkB,KAAK,CAAC,aAAa,OAAO,KAAK,CAAC;AAClD,kBAAkB,KAAK,CAAC,gBAAgB,OAAO,KAAK,CAAC;AACrD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,eAAe;AACf,cAAc,IAAI,IAAI,GAAG,aAAa,KAAK,CAAC,gBAAgB,QAAQ,GAAG,aAAa,KAAK,CAAC,gBAAgB,QAAQ,GAAG,SAAS,CAAC;AAC/H,cAAc,IAAI,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;AACrE,cAAc,IAAI,YAAY,KAAK,SAAS,EAAE;AAC9C,kBAAkB,IAAI,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAC9D,kBAAkB,IAAI,QAAQ,CAAC,MAAM,CAAC;AACtC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,cAAc,OAAO,mBAAmB,CAAC,KAAK,EAAE,IAAI,KAAK,SAAS,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC;AACtF,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,CAAC,EAAE,IAAI,EAAE;AAChD,cAAc,IAAI,IAAI,KAAK,QAAQ,EAAE;AACrC,kBAAkB,IAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC;AAC9C,kBAAkB,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE;AAC9C,sBAAsB,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,kBAAkB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;AAC1C,kBAAkB,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE;AAC3C,sBAAsB,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,eAAe;AACf,mBAAmB;AACnB,kBAAkB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;AAC1C,kBAAkB,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE;AAC3C,sBAAsB,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,kBAAkB,IAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC;AAC9C,kBAAkB,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE;AAC9C,sBAAsB,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,eAAe;AACf,cAAc,MAAM,IAAI,SAAS,EAAE,CAAC;AACpC,WAAW;AACX;AACA;AACA,UAAU,SAAS,SAAS,CAAC,QAAQ,EAAE;AACvC,cAAc,OAAO,CAAC,CAAC,QAAQ,CAAC;AAChC,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,QAAQ,EAAE;AACtC,cAAc,OAAO,EAAE,GAAG,QAAQ,CAAC;AACnC,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,IAAI,GAAG,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,cAAc,CAAC;AAC9D,cAAc,IAAI,QAAQ,CAAC,GAAG,CAAC;AAC/B,kBAAkB,OAAO,GAAG,CAAC;AAC7B,cAAc,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC;AACnC,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,OAAO,CAAC,QAAQ,EAAE;AACrC,cAAc,OAAO,KAAK,CAAC,OAAO;AAClC,oBAAoB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;AAC3C,oBAAoB,QAAQ,YAAY,MAAM;AAC9C,wBAAwB,QAAQ,YAAY,KAAK;AACjD,wBAAwB,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,gBAAgB,CAAC;AACtF,WAAW;AACX;AACA;AACA,UAAU,SAAS,UAAU,CAAC,QAAQ,EAAE;AACxC;AACA,cAAc,OAAO,OAAO,QAAQ,KAAK,UAAU,CAAC;AACpD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C;AACA,cAAc,OAAO,OAAO,QAAQ,KAAK,UAAU,CAAC;AACpD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,QAAQ,IAAI,CAAC,QAAQ,CAAC;AACpC,kBAAkB,KAAK,CAAC,eAAe,OAAO,IAAI,CAAC;AACnD,kBAAkB,KAAK,CAAC,eAAe,OAAO,IAAI,CAAC;AACnD,kBAAkB,SAAS,OAAO,KAAK,CAAC;AACxC,eAAe;AACf,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE;AACnC,cAAc,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9B,cAAc,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI;AACrD,kBAAkB,OAAO,SAAS,CAAC;AACnC,cAAc,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX;AACA;AACA,UAAU,SAAS,WAAW,CAAC,GAAG,EAAE;AACpC,cAAc,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;AAC1D,cAAc,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;AACrC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9C,cAAc,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACrC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,OAAO,QAAQ,CAAC;AAC9B,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,UAAU,EAAE;AAC7C,cAAc,OAAO,UAAU,CAAC,KAAK,CAAC;AACtC,WAAW;AACX;AACA;AACA,UAAU,SAAS,YAAY,CAAC,QAAQ,EAAE;AAC1C,cAAc,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,cAAc,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG,MAAM,CAAC;AAClD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACzC,cAAc,IAAI,CAAC;AACnB,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACnC,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,CAAC,EAAE;AAC7C,cAAc,IAAI,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;AACnD,cAAc,IAAI,OAAO,CAAC,KAAK,UAAU,IAAI,CAAC,KAAK,iBAAiB;AACpE,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,IAAI,KAAK,KAAK,iBAAiB;AAC7C,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;AAC1C,cAAc,IAAI,cAAc,GAAG,SAAS,IAAI,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;AACjF,cAAc,IAAI,cAAc,IAAI,IAAI,IAAI,cAAc,KAAK,MAAM,CAAC,SAAS;AAC/E,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,WAAW,GAAG,cAAc,CAAC,WAAW,CAAC;AAC3D,cAAc,IAAI,OAAO,WAAW,KAAK,UAAU;AACnD,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,WAAW,KAAK,CAAC;AACnC,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,OAAO,WAAW,CAAC;AACjC,WAAW;AACX;AACA,UAAU,SAAS,iBAAiB,GAAG;AACvC,cAAc,IAAI,aAAa,GAAG,EAAE,CAAC;AACrC,cAAc,IAAI,aAAa,GAAG,EAAE,CAAC;AACrC,cAAc,IAAI,WAAW,kBAAkB,YAAY;AAC3D,kBAAkB,SAAS,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE;AAC/D,sBAAsB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,sBAAsB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AACxC,sBAAsB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;AAC5C,sBAAsB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;AAChD,mBAAmB;AACnB,kBAAkB,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;AACrF,kBAAkB,WAAW,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;AACvF,kBAAkB,WAAW,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY;AAC3D,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;AAC9C,sBAAsB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;AACnE,0BAA0B,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AAC9F,0BAA0B,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;AAC9D,8BAA8B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/C,8BAA8B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACzD,8BAA8B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AAC3D,2BAA2B;AAC3B,+BAA+B;AAC/B,8BAA8B,IAAI,CAAC,MAAM,EAAE,CAAC;AAC5C,2BAA2B;AAC3B,0BAA0B,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAChE,uBAAuB;AACvB,sBAAsB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC9D,mBAAmB,CAAC;AACpB,kBAAkB,WAAW,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,KAAK,EAAE;AACjE,sBAAsB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE;AAC5C,0BAA0B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,0BAA0B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACrD,0BAA0B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,MAAM,KAAK,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,WAAW,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE;AAClE,sBAAsB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE;AAC5C,0BAA0B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,0BAA0B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACrD,0BAA0B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC1D,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,WAAW,CAAC;AACrC,eAAe,EAAE,CAAC,CAAC;AACnB,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,GAAG,GAAG;AACjC,sBAAsB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;AACtC,sBAAsB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;AACxC,sBAAsB,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AACrD,sBAAsB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AAC5C,mBAAmB;AACnB,kBAAkB,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE;AAC/D,sBAAsB,GAAG,EAAE,YAAY,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;AACpE,sBAAsB,UAAU,EAAE,IAAI;AACtC,sBAAsB,YAAY,EAAE,IAAI;AACxC,mBAAmB,CAAC,CAAC;AACrB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AACxG,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE;AACrD,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC;AACpE,sBAAsB,OAAO,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AAC1E,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,KAAK,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,IAAI,CAAC,CAAC;AACnE,sBAAsB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;AAClD,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,GAAG,EAAE;AACxD,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC;AACpE,sBAAsB,IAAI,KAAK,IAAI,CAAC,EAAE;AACtC,0BAA0B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AACvD,0BAA0B,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjE,8BAA8B,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAChE,8BAA8B,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACpE,2BAA2B;AAC3B,0BAA0B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;AAC9C,0BAA0B,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;AAChD,0BAA0B,IAAI,GAAG,KAAK,IAAI,CAAC,SAAS,EAAE;AACtD,8BAA8B,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AAC7D,8BAA8B,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AACpD,2BAA2B;AAC3B,0BAA0B,OAAO,IAAI,CAAC;AACtC,uBAAuB;AACvB,sBAAsB,OAAO,KAAK,CAAC;AACnC,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;AACpD,sBAAsB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AAC5C,sBAAsB,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC9C,sBAAsB,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AACrD,sBAAsB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AAC5C,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AACjH,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;AACrH,kBAAkB,GAAG,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;AACtH,kBAAkB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACvF,kBAAkB,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACzF,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AAC/D,sBAAsB,IAAI,IAAI,CAAC,SAAS,KAAK,GAAG,EAAE;AAClD,0BAA0B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;AACtF,uBAAuB;AACvB,sBAAsB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,MAAM,EAAE;AAC1D,0BAA0B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AAC/D,0BAA0B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC/C,0BAA0B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,OAAO,IAAI,CAAC,WAAW,CAAC;AAC9C,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe,EAAE,EAAE;AACnB,cAAc,SAAS,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE;AACtC,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe;AACf,cAAc,SAAS,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,eAAe;AACf,cAAc,SAAS,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE;AAC5C,kBAAkB,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACtC,eAAe;AACf,WAAW;AACX;AACA,UAAU,SAAS,iBAAiB,GAAG;AACvC,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,GAAG,GAAG;AACjC,sBAAsB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;AAC7C,mBAAmB;AACnB,kBAAkB,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE;AAC/D,sBAAsB,GAAG,EAAE,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AACjE,sBAAsB,UAAU,EAAE,IAAI;AACtC,sBAAsB,YAAY,EAAE,IAAI;AACxC,mBAAmB,CAAC,CAAC;AACrB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACxF,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AACrG,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC9F,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;AAC3E,kBAAkB,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AAChF,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;AACpF,kBAAkB,GAAG,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtF,kBAAkB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AACpF,kBAAkB,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AACtF,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe,EAAE,EAAE;AACnB,WAAW;AACX;AACA,UAAU,SAAS,qBAAqB,GAAG;AAC3C,cAAc,IAAI,SAAS,GAAG,EAAE,CAAC;AACjC,cAAc,IAAI,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;AAC1C,cAAc,IAAI,OAAO,GAAG,eAAe,EAAE,CAAC;AAC9C,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,OAAO,GAAG;AACrC,sBAAsB,IAAI,CAAC,IAAI,GAAG,eAAe,EAAE,CAAC;AACpD,mBAAmB;AACnB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AACzF,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;AAC7F,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE,KAAK,EAAE;AACnE,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,IAAI,CAAC,CAAC;AACnF,sBAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AAC/C,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,MAAM,EAAE;AAC/D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AACnF,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;AACxD;AACA,sBAAsB,IAAI,CAAC,IAAI,GAAG,eAAe,EAAE,CAAC;AACpD,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,OAAO,CAAC;AACjC,eAAe,EAAE,EAAE;AACnB,cAAc,SAAS,eAAe,GAAG;AACzC,kBAAkB,IAAI,GAAG,CAAC;AAC1B,kBAAkB;AAClB,sBAAsB,GAAG,GAAG,aAAa,GAAG,UAAU,EAAE,CAAC;AACzD,yBAAyB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACjD,kBAAkB,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AACnC,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe;AACf,cAAc,SAAS,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE;AAC/D,kBAAkB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;AACrD,sBAAsB,IAAI,CAAC,MAAM;AACjC,0BAA0B,OAAO,SAAS,CAAC;AAC3C,sBAAsB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAC1F,mBAAmB;AACnB,kBAAkB,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;AACzC,eAAe;AACf,cAAc,SAAS,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE;AACrD,kBAAkB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC;AAC/C,sBAAsB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;AAC3D,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,cAAc,SAAS,cAAc,CAAC,IAAI,EAAE;AAC5C,kBAAkB,IAAI,OAAO,UAAU,KAAK,UAAU,EAAE;AACxD,sBAAsB,IAAI,OAAO,MAAM,KAAK,WAAW;AACvD,0BAA0B,OAAO,MAAM,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9E,sBAAsB,IAAI,OAAO,QAAQ,KAAK,WAAW;AACzD,0BAA0B,OAAO,QAAQ,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAChF,sBAAsB,OAAO,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AACzE,mBAAmB;AACnB,kBAAkB,OAAO,eAAe,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAChE,eAAe;AACf,cAAc,SAAS,UAAU,GAAG;AACpC,kBAAkB,IAAI,IAAI,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;AACvD;AACA,kBAAkB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAClD,kBAAkB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAClD,kBAAkB,IAAI,MAAM,GAAG,EAAE,CAAC;AAClC,kBAAkB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,EAAE,MAAM,EAAE;AACrE,sBAAsB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,sBAAsB,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC;AACtE,0BAA0B,MAAM,IAAI,GAAG,CAAC;AACxC,sBAAsB,IAAI,IAAI,GAAG,EAAE;AACnC,0BAA0B,MAAM,IAAI,GAAG,CAAC;AACxC,sBAAsB,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AAChE,mBAAmB;AACnB,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,WAAW;AACX;AACA,UAAU,SAAS,cAAc,CAAC,GAAG,EAAE;AACvC,cAAc,GAAG,CAAC,EAAE,GAAG,SAAS,CAAC;AACjC,cAAc,OAAO,GAAG,CAAC,EAAE,CAAC;AAC5B,cAAc,OAAO,GAAG,CAAC;AACzB,WAAW;AACX,OAAO,CAAC,CAAC;AACT,GAAG,EAAE,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC,EAAC;AAC/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MCjnCM,kBAAkB,GAAG;IACzB,WAAW,EAAE,aAAa;IAC1B,kBAAkB,EAAE,sBAAsB;IAC1C,QAAQ,EAAE,UAAU;IACpB,eAAe,EAAE,mBAAmB;IACpC,YAAY,EAAE,cAAc;IAC5B,eAAe,EAAE,iBAAiB;IAClC,aAAa,EAAE,eAAe;IAC9B,sBAAsB,EAAE,wBAAwB;IAChD,yBAAyB,EAAE,2BAA2B;IACtD,KAAK,EAAE,OAAO;IACd,iBAAiB,EAAE,mBAAmB;IACtC,YAAY,EAAE,cAAc;IAC5B,YAAY,EAAE,cAAc;IAC5B,cAAc,EAAE,gBAAgB;IAChC,cAAc,EAAE,gBAAgB;IAChC,eAAe,EAAE,iBAAiB;IAClC,WAAW,EAAE,aAAa;IAC1B,aAAa,EAAE,eAAe;IAC9B,eAAe,EAAE,iBAAiB;IAClC,mBAAmB,EAAE,qBAAqB;IAC1C,iBAAiB,EAAE,mBAAmB;IACtC,uBAAuB,EAAE,yBAAyB;IAClD,UAAU,EAAE,YAAY;IACxB,aAAa,EAAE,eAAe;IAC9B,iBAAiB,EAAE,mBAAmB;IACtC,oBAAoB,EAAE,sBAAsB;IAC5C,mBAAmB,EAAE,qBAAqB;IAC1C,UAAU,EAAE,YAAY;;;AC5BnB,MAAM,kBAAkB,GAAG,IAAI,CAAA;AAE/B,MAAM,YAAY,GAAG,UAAU,CAAA;AAC/B,MAAM,QAAQ,GAAG,aAAa,CAAA;AAC9B,MAAM,SAAS,GAAG,OAAO,CAAA;AACzB,MAAM,QAAQ,GAAG,MAAM,CAAA;AACvB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,GAAG,GAAG,KAAK,CAAA;AACjB,MAAM,SAAS,GAAG,WAAW,CAAA;AAC7B,MAAM,qBAAqB,GAAG,WAAW,CAAA;AACzC,MAAM,EAAE,GAAG,IAAI,CAAA;AACf,MAAM,GAAG,GAAG,KAAK,CAAA;AACjB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,WAAW,GAAG,aAAa,CAAA;AACjC,MAAM,SAAS,GAAG,WAAW,CAAA;AAC7B,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,OAAO,GAAG,SAAS,CAAA;AACzB,MAAM,MAAM,GAAG,QAAQ,CAAA;AACvB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,MAAM,GAAG,QAAQ,CAAA;AACvB,MAAM,cAAc,GAAG,gBAAgB,CAAA;AACvC,MAAM,MAAM,GAAG,QAAQ,CAAA;AACvB,MAAM,cAAc,GAAG,eAAe,CAAA;AACtC,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,OAAO,GAAG,SAAS,CAAA;AACzB,MAAM,UAAU,GAAG,WAAW,CAAA;AAC9B,MAAM,QAAQ,GAAG,SAAS,CAAA;AAC1B,MAAM,SAAS,GAAG,WAAW,CAAA;AAC7B,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,WAAW,GAAG,YAAY,CAAA;AAChC,MAAM,SAAS,GAAG,WAAW,CAAA;AAC7B,MAAM,UAAU,GAAG,YAAY,CAAA;AAC/B,MAAM,OAAO,GAAG,SAAS;;ACvBzB,MAAM,WAAW,GAAG;IACzB,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,OAAO,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAA;AAChC,CAAC,CAAA;SAEe,SAAS,CAAE,IAAc;IACvC,OAAO,IAAI,CAAC,QAAQ,0BAA0B;AAChD,CAAC;SAEe,MAAM,CAAE,IAAc;IACpC,OAAO,IAAI,CAAC,QAAQ,uBAAuB;AAC7C,CAAC;SAEe,SAAS,CAAE,IAAc;IACvC,OAAO,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;AAClC,CAAC;SAEe,gBAAgB,CAAE,EAAe;IAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI;QACzC,OAAO,EAAE,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;KACtE,CAAC,CAAA;IACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAA;AACrB,CAAC;AAED;;;;;SAKgB,cAAc,CAAE,IAAwB,EAAE,IAAY;;IACpE,IAAI,GAAG,GAAG,KAAK,CAAA;IACf,OAAO,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,aAAa,KAAI,IAAI,CAAC,aAAa,CAAC,KAAK,KAAK,QAAQ,EAAE;QACnE,IAAI,MAAA,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,0CAAE,MAAM,EAAE;YAC/C,GAAG,GAAG,IAAI,CAAA;YACV,MAAK;SACN;QACD,IAAI,GAAG,IAAI,CAAC,aAAa,CAAA;KAC1B;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;SAEe,YAAY,CAAE,GAAW;IACvC,QAAQ,GAAG;QACT,KAAK,KAAK;YACR,wBAAsB;QACxB,KAAK,EAAE;YACL,OAAO,GAAG,CAAA;QACZ,KAAK,KAAK;YACR,wBAAsB;QACxB;YACE,OAAO,GAAG,CAAA;KACb;AACH;;AC5DA,IAAa,eAAe,GAA5B,MAAa,eAAe;IAI1B;IACoC,KAAa;QAJ1C,eAAU,GAAmC,EAAE,CAAA;QAMpD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;KACnB;IAEM,gBAAgB,CAAE,IAAY,EAAE,OAAqB,EAAE,OAA2C;;QACvG,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,UAAU,mDAAG,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QACrD,IAAI,IAAI,KAAK,cAAc,EAAE;;YAE3B,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;YAChD,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;YAC9C,OAAM;SACP;QACD,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;QAChC,IAAI,MAAM,GAAG,KAAK,CAAA;QAClB,IAAIA,UAAQ,CAA0B,OAAO,CAAC,EAAE;YAC9C,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YACpC,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;SAC/B;QAED,IAAI,MAAM,EAAE;YACV,MAAM,OAAO,GAAG;gBACd,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;gBAC9B,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;aACxC,CAAA;YACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,kCAC7B,OAAmC,KACvC,IAAI,EAAE,KAAK,IACX,CAAA;YACF,OAAM;SACP;QAED,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,CAAA;QAEzF,IAAIC,SAAO,CAAC,QAAQ,CAAC,EAAE;YACrB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SACvB;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;SAClC;KACF;IAEM,mBAAmB,CAAE,IAAY,EAAE,OAAqB;QAC7D,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACzB,IAAI,OAAO,IAAI,IAAI,EAAE;YACnB,OAAM;SACP;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,CAACA,SAAO,CAAC,QAAQ,CAAC,EAAE;YACtB,OAAM;SACP;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAEvC,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,wBAAwB,CAAC,CAAA;QAEjG,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;KAC1B;IAEM,gBAAgB;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAA;QAChC,MAAM,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;QAChF,OAAO,OAAO,CAAC,gBAAgB,CAAC,CAAA;KACjC;CACF,CAAA;AAvEY,eAAe;IAD3B,UAAU,EAAE;IAMR,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GALxB,eAAe,CAuE3B;;AC9DD;;;;;;SAMgB,OAAO,CAAE,IAA4B;;IACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAE9B,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;QAChB,OAAO;YACL,kBAAkB,IAAI,CAAC,SAAS;YAChC,uBAAsB,QAAQ;SAC/B,CAAA;KACF;IAED,MAAM,IAAI,GAAoB;QAC5B,uBAAsB,QAAQ;QAC9B,GAAG,EAAE,IAAI,CAAC,GAAG;KACd,CAAA;IACD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;IACtB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;IAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE;QACpE,IAAI,qBAAoB,GAAG,UAAU,QAAQ,EAAE,CAAA;QAC/C,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAChD,IAAI,qBAAoB,GAAG,SAAS,CAAA;SACrC;KACF;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACxB,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QACzC,IACE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;YACzB,IAAI,KAAK,KAAK;YACd,IAAI,KAAK,KAAK;YACd,IAAI,KAAK,EAAE;YACX,eAAe,KAAK,SAAS,EAC7B;YACA,IAAI,CAAC,eAAe,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;SACpC;QACD,IAAI,QAAQ,KAAK,IAAI,IAAI,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE;YACjF,IAAI,qBAAoB,GAAG,UAAU,CAAA;SACtC;KACF;IAED,IAAI,EAAE,UAAU,EAAE,GAAG,IAAI,CAAA;;IAGzB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;IAExD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;QACzB,IAAI,uBAAsB,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;KACrD;SAAM;QACL,IAAI,uBAAsB,GAAG,EAAE,CAAA;KAChC;IAED,IAAI,IAAI,CAAC,SAAS,KAAK,EAAE,EAAE;QACzB,IAAI,kBAAiB,GAAG,IAAI,CAAC,SAAS,CAAA;KACvC;IAED,IAAI,IAAI,CAAC,OAAO,KAAK,EAAE,IAAI,QAAQ,KAAK,aAAa,EAAE;QACrD,IAAI,kBAAiB,GAAG,IAAI,CAAC,OAAO,CAAA;KACrC;IAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,iBAAiB,mDAAG,IAAI,CAAC,CAAA;IAEpC,OAAO,IAAI,CAAA;AACb;;ACnFO,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuC;;ICD7D;AAAZ,WAAY,YAAY;IACtB,mCAAmB,CAAA;IACnB,qCAAqB,CAAA;IACrB,2CAA2B,CAAA;IAC3B,2CAA2B,CAAA;AAC7B,CAAC,EALW,YAAY,KAAZ,YAAY;;ACuBxB,MAAM,MAAM,GAAG,WAAW,EAAE,CAAA;IAGf,QAAQ,GAArB,MAAa,QAAS,SAAQ,eAAe;IAS3C;IAC2C,IAAkB,EACZ,UAAgC,EAC7C,KAAY;QAE9C,KAAK,CAAC,KAAK,CAAC,CAAA;QAVP,eAAU,GAAoB,IAAI,CAAA;QAClC,eAAU,GAAe,EAAE,CAAA;QAgB1B,YAAO,GAAG,CAAC,IAAc,KAAK,MAAM,OAAO,CAAC,IAAmB,CAAC,CAAA;QANtE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACf,IAAI,CAAC,WAAW,GAAG,UAAU,CAAA;QAC7B,IAAI,CAAC,GAAG,GAAG,MAAM,MAAM,EAAE,EAAE,CAAA;QAC3B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;KAChC;;;;IAOO,MAAM;QACZ,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAChC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAA;YACvB,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC7B,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAA;SACxB;KACF;IAED,IAAc,KAAK;;QACjB,OAAO,CAAA,MAAA,IAAI,CAAC,UAAU,0CAAE,KAAK,KAAI,IAAI,CAAA;KACtC;IAES,SAAS,CAAE,QAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QAE/C,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,sDAAsD,CAAC,CAAA;QAE5E,OAAO,KAAK,CAAA;KACb;IAED,IAAW,KAAK;QACd,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAElC,IAAI,UAAU,EAAE;;YAEd,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;YACnE,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;YAElD,OAAO,GAAG,UAAU,CAAC,KAAK,IAAI,yBAAwB,KAAK,EAAE,CAAA;SAC9D;QAED,OAAO,EAAE,CAAA;KACV;IAED,IAAW,WAAW;QACpB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI,IAAI,CAAA;KACtE;IAED,IAAW,eAAe;QACxB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI,IAAI,CAAA;KACtE;IAED,IAAW,aAAa;QACtB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,IAAI,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,QAAQ,4BAA4B;YAClD,OAAO,UAAyB,CAAA;SACjC;QACD,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;KAClC;IAED,IAAW,SAAS;QAClB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;KACjD;;;;;IAMD,IAAW,WAAW,CAAE,IAAY;QAClC,IAAI,CAAC,MAAM,EAAE,CAAA;QACb,IAAI,IAAI,KAAK,EAAE,EAAE;YACf,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;gBAC7C,KAAK,EAAE,MAAM,EAAE;aAChB,CAAC,CAAA;SACH;aAAM;YACL,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;YACxE,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAA;SAChD;KACF;IAEM,YAAY,CAAsB,QAAW,EAAE,QAA0B,EAAE,SAAmB;QACnG,QAAQ,CAAC,MAAM,EAAE,CAAA;QACjB,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAA;QAC1B,IAAI,OAAsB,CAAA;QAE1B,IAAI,QAAQ,EAAE;YACZ,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;YAC1C,IAAI,SAAS,EAAE;gBACb,OAAO,GAAG;oBACR,IAAI,EAAE,QAAQ,CAAC,KAAK;oBACpB,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;iBAC9B,CAAA;aACF;iBAAM;gBACL,OAAO,GAAG;oBACR,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;oBAC7C,KAAK,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;iBAC1C,CAAA;aACF;SACF;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC9B,OAAO,GAAG;gBACR,IAAI,EAAE,QAAQ,CAAC,KAAK;gBACpB,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;aAC9B,CAAA;SACF;QAED,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QAE3B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;YAClC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;SACxC;QAED,OAAO,QAAQ,CAAA;KAChB;IAEM,WAAW,CAAE,KAAe;QACjC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;KACzB;IAEM,YAAY,CAAE,QAAkB,EAAE,QAAkB;QACzD,IAAI,QAAQ,CAAC,UAAU,KAAK,IAAI,EAAE;YAChC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YAC3C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACrB,OAAO,QAAQ,CAAA;SAChB;KACF;IAEM,WAAW,CAAsB,KAAQ,EAAE,SAAmB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QACnC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,EAAE;YACd,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;gBAC7C,KAAK,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;aAC1C,CAAC,CAAA;SACH;QACD,KAAK,CAAC,UAAU,GAAG,IAAI,CAAA;QACvB,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;;;QAG7B,OAAO,KAAK,CAAA;KACb;IAEM,MAAM,CAAE,SAAmB;;QAChC,MAAA,IAAI,CAAC,UAAU,0CAAE,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;KAC9C;IAEM,aAAa;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;KAClC;IAEM,aAAa,CAAE,OAAsB;;QAC1C,MAAA,IAAI,CAAC,KAAK,0CAAE,aAAa,CAAC,OAAO,CAAC,CAAA;KACnC;IAEM,SAAS,CAAE,MAAM,GAAG,KAAK;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;QACxE,IAAI,OAAO,CAAA;QAEX,IAAI,IAAI,CAAC,QAAQ,2BAA4B;YAC3C,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;SAChD;aAAM,IAAI,IAAI,CAAC,QAAQ,wBAAyB;YAC/C,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;SACtC;QAED,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACtB,MAAM,KAAK,GAAQ,IAAI,CAAC,GAAG,CAAC,CAAA;YAC5B,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,KAAK,KAAK,MAAM,EAAE;gBAC7D,OAAO,CAAC,GAAG,CAAC,qBAAQ,KAAK,CAAE,CAAA;aAC5B;iBAAM,IAAI,GAAG,KAAK,QAAQ,EAAE;gBAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;aACrB;iBAAM,IAAI,GAAG,KAAK,KAAK,EAAE;gBACxB,OAAO,CAAC,KAAK,CAAC,MAAM,qBAAQ,KAAK,CAAC,MAAM,CAAE,CAAA;gBAC1C,OAAO,CAAC,KAAK,CAAC,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAA;aACzE;SACF;QAED,IAAI,MAAM,EAAE;YACV,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;SACvE;QAED,OAAO,OAAO,CAAA;KACf;IAEM,QAAQ,CAAE,IAAgC;QAC/C,IAAI,UAAU,GAAG,KAAK,CAAA;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS;YAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,CAAA;YACzB,IAAI,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;gBACnE,UAAU,GAAG,IAAI,CAAA;gBACjB,OAAO,IAAI,CAAA;aACZ;SACF,CAAC,CAAA;QACF,OAAO,UAAU,CAAA;KAClB;EACF;AA9NY,QAAQ;IADpB,UAAU,EAAE;IAWR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GAZxB,QAAQ,CA8NpB;;IC7OY,QAAQ,GAArB,MAAa,QAAS,SAAQ,QAAQ;IAGpC;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY;QAE9C,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAClC,IAAI,CAAC,QAAQ,qBAAqB;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;KACxB;IAED,IAAW,WAAW,CAAE,IAAY;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;QAClB,IAAI,CAAC,aAAa,CAAC;YACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,gBAAgB;YACvC,KAAK,EAAE,IAAI;SACZ,CAAC,CAAA;KACH;IAED,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;IAED,IAAW,SAAS,CAAE,IAAY;QAChC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAA;KACxB;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;EACF;AAhCY,QAAQ;IADpB,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GANxB,QAAQ,CAgCpB;;AC3CD;;;;AAKA,MAAM,eAAe,GAAG;IACtB,KAAK;IACL,YAAY;IACZ,eAAe;IACf,WAAW;IACX,QAAQ;IACR,OAAO;IACP,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,WAAW;IACX,SAAS;IACT,QAAQ;IACR,OAAO;IACP,KAAK;IACL,QAAQ;IACR,OAAO;IACP,WAAW;IACX,MAAM;IACN,eAAe;IACf,eAAe;IACf,YAAY;IACZ,cAAc;IACd,SAAS;IACT,OAAO;IACP,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,SAAS;IACT,aAAa;IACb,KAAK;IACL,YAAY;IACZ,eAAe;IACf,YAAY;IACZ,aAAa;IACb,QAAQ;IACR,YAAY;IACZ,QAAQ;IACR,OAAO;IACP,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+BT,CAAA;AAED;AACA,SAAS,OAAO,CAAE,MAAc,EAAE,IAAc,EAAE,WAAqB;IACrE,CAAC,WAAW,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC5C,IAAI,CAAC,OAAO,CAAC,IAAI;QACf,eAAe,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAA;KACpC,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AAC/C,MAAM,wBAAwB,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;AACjE,MAAM,+BAA+B,GAAG,CAAC,GAAG,wBAAwB,EAAE,QAAQ,CAAC,CAAA;AAC/E,MAAM,0CAA0C,GAAG,CAAC,GAAG,iBAAiB,EAAE,GAAG,wBAAwB,CAAC,CAAA;AACtG,MAAM,qBAAqB,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;AAC1D,MAAM,qBAAqB,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AAChE,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;AAClC,MAAM,kBAAkB,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,CAAA;AACvD,MAAM,iCAAiC,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,CAAC,CAAA;AACtF,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;AAExC,OAAO,CAAC,aAAa,EAAE,iBAAiB,CAAC,CAAA;AACzC,OAAO,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAA;AAC5C,OAAO,CAAC,kBAAkB,EAAE,iBAAiB,CAAC,CAAA;AAC9C,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,iBAAiB,EAAE,QAAQ,CAAC,CAAC,CAAA;AACpD,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,iBAAiB,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAA;AAC/F,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AACvC,OAAO,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAA;AAC1C,OAAO,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAA;AAC7C,OAAO,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,CAAA;AAC/C,OAAO,CAAC,YAAY,EAAE,0CAA0C,CAAC,CAAA;AACjE,OAAO,CAAC,aAAa,EAAE,0CAA0C,CAAC,CAAA;AAClE,OAAO,CAAC,WAAW,EAAE,0CAA0C,CAAC,CAAA;AAChE,OAAO,CAAC,cAAc,EAAE,0CAA0C,CAAC,CAAA;AACnE,OAAO,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AACjD,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAA;AACnD,OAAO,CAAC,cAAc,EAAE,qBAAqB,CAAC,CAAA;AAC9C,OAAO,CAAC,eAAe,EAAE,qBAAqB,CAAC,CAAA;AAC/C,OAAO,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAA;AACzC,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,qBAAqB,EAAE,MAAM,CAAC,CAAC,CAAA;AACrD,OAAO,CAAC,mBAAmB,EAAE,SAAS,CAAC,CAAA;AACvC,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAA;AACxC,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAA;AACxC,OAAO,CAAC,qBAAqB,EAAE,SAAS,CAAC,CAAA;AACzC,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAA;AAChC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;AAC7B,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAA;AAChC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAA;AACjC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAA;AACjC,OAAO,CAAC,cAAc,EAAE,SAAS,CAAC,CAAA;AAClC,OAAO,CAAC,cAAc,EAAE,SAAS,CAAC,CAAA;AAClC,OAAO,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;AACnC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;AAC9B,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;AAC5B,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAA;AACnG,OAAO,CAAC,aAAa,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAA;AACnF,OAAO,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AAC7E,OAAO,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,kBAAkB,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC,CAAA;AACpM,OAAO,CAAC,eAAe,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAA;AACxD,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AAC9C,OAAO,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;AAC9G,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAA;AACjD,OAAO,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AAChD,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAA;AAChE,OAAO,CAAC,cAAc,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;AACrD,OAAO,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;AAC1D,OAAO,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC1E,OAAO,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAA;AACtD,OAAO,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,sBAAsB,EAAE,QAAQ,CAAC,CAAC,CAAA;AAC9D,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AACrC,OAAO,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC,CAAA;AAC7D,OAAO,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,CAAA;AACtD,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC7H,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAA;AACzE,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,YAAY,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAA;AACtG,OAAO,CAAC,aAAa,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAA;AACxG,OAAO,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAA;AAClC,OAAO,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;AAC3B,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AACjC,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AAEjC,OAAO,CAAC,OAAO,EAAE,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AACpD,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;AAClD,OAAO,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAA;AACtD,OAAO,CAAC,aAAa,EAAE,qBAAqB,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,WAAW,EAAE,qBAAqB,EAAE,IAAI,CAAC,CAAA;AACjD,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,gBAAgB,CAAC,EAAE,IAAI,CAAC,CAAA;AAC/D,OAAO,CAAC,eAAe,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAC/D,OAAO,CAAC,gBAAgB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAChE,OAAO,CAAC,kBAAkB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAClE,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AACnE,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAA;AACpH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAA;AACrE,OAAO,CAAC,SAAS,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAA;AAC5C,OAAO,CAAC,OAAO,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAA;AAC1C,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,iCAAiC,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAA;AACrE,OAAO,CAAC,KAAK,EAAE,iCAAiC,EAAE,IAAI,CAAC,CAAA;AACvD,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AAC9E,OAAO,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAA;AACrD,OAAO,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AAC9M,OAAO,CAAC,OAAO,EAAE,CAAC,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAA;AACzE,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;AACrD,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;AAC5C,OAAO,CAAC,KAAK,EAAE,CAAC,iBAAiB,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC;;ACvLrE,SAAS,QAAQ,CAAe,MAAc,EAAE,QAAgB;IAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC1B,IAAI,MAAM,EAAE;QACV,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;KAClC;IAED,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAC3C,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,kBAAkB,EACtD,YAAY,QAAQ,uCAAuC,CAC5D,CAAA;IAED,IAAI,GAAG,KAAK,MAAM,EAAE;QAClB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAA;QAC9B,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;YAC1B,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,kBAAiB;YACjD,KAAK,EAAE,IAAI,CAAC,OAAO;SACpB,CAAC,CAAA;KACH;AACH,CAAC;AAED,SAAS,SAAS,CAAE,IAAkB;IACpC,MAAM,UAAU,GAAG,EAAE,CAAA;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/C,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;QACnC,UAAU,CAAC,QAAQ,CAAC,GAAG;YACrB,GAAG;gBACD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;aACnC;YACD,GAAG,CAAe,MAAc;gBAC9B,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF,CAAA;KACF;IAED,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAA;AACrD,CAAC;AAED,SAAS,aAAa,CAAE,YAAY;IAClC,OAAO,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;AACjC,CAAC;MAEY,KAAK;IAOhB,YAAoB,OAAoB;QACtC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAE,CAAA;QAC/B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAA;KACjB;IAEO,eAAe,CAAE,QAAgB;QACvC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;YACrE,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,GAAG,EAAE;gBACH,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;aACnC;YACD,GAAG,EAAE,CAAC,MAAc;gBAClB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF,CAAC,CAAA;KACH;IAED,IAAW,OAAO;QAChB,IAAI,IAAI,GAAG,EAAE,CAAA;QACb,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACrB,IAAI,CAAC,GAAG;gBAAE,OAAM;YAChB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC1D,IAAI,IAAI,GAAG,SAAS,KAAK,GAAG,GAAG,CAAA;SAChC,CAAC,CAAA;QACF,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,OAAO,CAAE,GAAW;QAC7B,IAAI,GAAG,IAAI,IAAI,EAAE;YACf,GAAG,GAAG,EAAE,CAAA;SACT;QAED,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI;YAC9B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;SAC1B,CAAC,CAAA;QAEF,IAAI,GAAG,KAAK,EAAE,EAAE;YACd,OAAM;SACP;QAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;YAC5B,IAAI,IAAI,KAAK,EAAE,EAAE;gBACf,SAAQ;aACT;;YAGD,MAAM,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAE7B,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;gBACpB,SAAQ;aACT;YACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;SAC9C;KACF;IAEM,WAAW,CAAE,YAAoB,EAAE,KAAqB;QAC7D,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;;YAE3B,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAA;SACnC;aAAM;YACL,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;SACzC;QACD,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE;YACtB,OAAM;SACP;QAED,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,EAAE;YAClC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;SAClC;aAAM;YACL,IAAI,CAAC,YAAY,CAAC,GAAG,KAAK,CAAA;SAC3B;KACF;IAEM,cAAc,CAAE,YAAoB;QACzC,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;QACxC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;YAC1C,OAAO,EAAE,CAAA;SACV;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAA;QACvB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;QACxC,OAAO,KAAK,CAAA;KACb;IAEM,gBAAgB,CAAE,YAAoB;QAC3C,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,KAAK,EAAE;YACV,OAAO,EAAE,CAAA;SACV;QAED,OAAO,KAAK,CAAA;KACb;CACF;AAED,SAAS,CAAC,KAAK,CAAC;;ACvJhB,SAAS,UAAU;IACjB,OAAO,IAAI,CAAA;AACb,CAAC;SAEe,WAAW,CAAE,IAAiB,EAAE,OAAgB;IAC9D,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,MAAM,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,UAAU,CAAA;IAEpC,IAAI,MAAM,GAAuB,IAAI,CAAA;IAErC,OAAO,MAAM,EAAE;QACb,IAAI,MAAM,CAAC,QAAQ,6BAA8B,MAAM,CAAC,MAAM,CAAC,EAAE;YAC/D,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SACnB;QAED,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;KACjC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,SAAS,CAAE,EAAe,EAAE,IAAiB;IACpD,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU,CAAA;IAEhC,IAAI,UAAU,EAAE;QACd,OAAO,UAAyB,CAAA;KACjC;IAED,IAAI,OAAO,GAAuB,EAAE,CAAA;IAEpC,GAAG;QACD,IAAI,OAAO,KAAK,IAAI,EAAE;YACpB,OAAO,IAAI,CAAA;SACZ;QAED,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QAEvC,IAAI,WAAW,EAAE;YACf,OAAO,WAA0B,CAAA;SAClC;QACD,OAAO,GAAG,OAAO,CAAC,aAAa,CAAA;KAChC,QAAQ,OAAO,EAAC;IAEjB,OAAO,IAAI,CAAA;AACb;;MChDa,SAAU,SAAQ,GAAW;IAGxC,YAAa,SAAiB,EAAE,EAAe;QAC7C,KAAK,EAAE,CAAA;QACP,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QAC3D,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;KACb;IAED,IAAW,KAAK;QACd,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;KAC3B;IAEM,GAAG,CAAE,CAAS;QACnB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACZ,IAAI,CAAC,OAAO,EAAE,CAAA;QAEd,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,IAAI,CAAA;KACjB;IAEM,MAAM,CAAE,CAAS;QACtB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,MAAM,CAAE,CAAS;QACtB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAChB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;SAChB;aAAM;YACL,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;SACb;QAED,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,OAAO,CAAE,EAAU,EAAE,EAAU;QACpC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAChB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAEb,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,QAAQ,CAAE,CAAS;QACxB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;KACpB;IAEM,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAA;KAClB;IAEO,OAAO;QACb,IAAI,CAAC,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;KAC/B;;;IC9BU,WAAW,GAAxB,MAAa,WAAY,SAAQ,QAAQ;IAOvC;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B;QAExE,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAX7B,UAAK,GAAwB,EAAE,CAAA;QAE/B,YAAO,GAA4B,SAAS,CAAA;QAUjD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtB,IAAI,CAAC,QAAQ,wBAAwB;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;KAC7B;IAEO,gBAAgB,CAAE,KAAgB;;QAExC,IAAI,MAAM,GAAG,IAAI,CAAA;;QAEjB,QAAQ,MAAM,GAAG,MAAM,CAAC,UAAkB,GAAG;YAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAE/C,IAAI,CAACA,SAAO,CAAC,SAAS,CAAC,EAAE;gBACvB,SAAQ;aACT;YAED,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;gBACtB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAA;aACf;SACF;KACF;IAED,IAAW,EAAE;QACX,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAE,CAAA;KAC9B;IAED,IAAW,EAAE,CAAE,GAAW;QACxB,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;KAC3B;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;KACtC;IAED,IAAW,SAAS,CAAE,GAAW;QAC/B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;KAC9B;IAED,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;KACtC;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;KAC3C;IAED,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;KACzC;IAED,IAAW,UAAU;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAA;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACrE,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;KAChE;IAED,IAAW,WAAW;QACpB,IAAI,IAAI,GAAG,EAAE,CAAA;QACb,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,CAAA;SAClC;QAED,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,WAAW,CAAE,IAAY;QAClC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAA;KACzB;IAEM,YAAY,CAAE,aAAqB;QACxC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAA;KAC/C;IAEM,aAAa;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;KAClC;IAEM,KAAK;QACV,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;KAC/B;IAEM,IAAI;QACT,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;KAChC;IAEM,YAAY,CAAE,aAAqB,EAAE,KAAU;;QACpD,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAC3C,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,kBAAkB,EACpD,MAAM,IAAI,CAAC,QAAQ,SAAS,aAAa,0DAA0D,CACpG,CAAA;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEhG,QAAQ,aAAa;YACnB,KAAK,KAAK;gBACR,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,KAAe,CAAA;gBACpC,MAAK;YACP,KAAK,EAAE;gBACL,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAC5B,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;gBACrB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,CAAA;gBAC5C,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAC5B,MAAK;YACP;gBACE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,KAAe,CAAA;gBAE3C,IAAI,aAAa,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE;oBACrC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;wBAC9B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;qBACnC;oBACD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;iBACvE;gBACD,MAAK;SACR;QAED,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAA;QAE3C,MAAM,OAAO,GAAG;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,CAAC,aAAa,CAAC,EAAE;YACnD,KAAK;SACN,CAAA;QAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,oBAAoB,mDAAG,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;QAE/D,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;;QAG3B,IAAI,UAAU,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YACxC,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,WAAW;aACnB,CAAC,CAAA;SACH;KACF;IAEM,eAAe,CAAE,aAAqB;;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEjG,IAAI,aAAa,KAAK,KAAK,EAAE;YAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAA;SACxB;aAAM;YACL,MAAM,WAAW,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,iBAAiB,mDAAG,IAAI,EAAE,aAAa,CAAC,CAAA;YACvE,IAAI,WAAW,EAAE;gBACf,OAAM;aACP;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,EAAE;gBAC7C,OAAM;aACP;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;SACjC;QAED,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAA;QAE3C,MAAM,OAAO,GAAG;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,CAAC,aAAa,CAAC,EAAE;YACnD,KAAK,EAAE,EAAE;SACV,CAAA;QAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,mBAAmB,mDAAG,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;QAE9D,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;;QAG3B,IAAI,YAAY,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3C,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,SAAS;aACjB,CAAC,CAAA;SACH;KACF;IAEM,YAAY,CAAE,aAAqB;QACxC,MAAM,IAAI,GAAG,aAAa,KAAK,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;QACrF,OAAO,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,EAAE,CAAA;KAClB;IAEM,oBAAoB,CAAE,OAAe;QAC1C,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;YAC1B,OAAO,EAAE,CAAC,QAAQ,KAAK,OAAO,KAAK,OAAO,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAA;SACnE,CAAC,CAAA;KACH;IAEM,sBAAsB,CAAE,SAAiB;QAC9C,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;YAC9B,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAChD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;SAC/C,CAAC,CAAA;KACH;IAEM,aAAa,CAAE,KAAgB;QACpC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAA;QAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAE7C,IAAI,CAACA,SAAO,CAAC,SAAS,CAAC,EAAE;YACvB,OAAO,KAAK,CAAA;SACb;QAED,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;YACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YAC7B,IAAI,MAAe,CAAA;YACnB,IAAI,QAAQ,CAAC,KAAK,EAAE;gBAClB,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;aACvB;iBAAM;gBACL,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;aACpC;YACD,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE;gBAClD,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAA;aAC9B;YAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;gBAC7B,MAAK;aACN;SACF;QAED,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;SAC7B;aAAM;YACL,KAAK,CAAC,KAAK,GAAG,IAAI,CAAA;SACnB;QAED,OAAO,SAAS,IAAI,IAAI,CAAA;KACzB;IAEM,gBAAgB,CAAE,IAAI,EAAE,OAAO,EAAE,OAAO;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;QAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YAChE,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,IAAI;aACZ,CAAC,CAAA;SACH;QAED,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;KAC/C;IAEM,mBAAmB,CAAE,IAAI,EAAE,OAAO;QACvC,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;QAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YAChE,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,gBAAgB,CAAC,IAAI,CAAC,GAAG,UAAU,IAAI,EAAE,GAAG,QAAQ,IAAI,EAAE;aAClE,CAAC,CAAA;SACH;KACF;EACF;AAhRY,WAAW;IADvB,UAAU,EAAE;IASR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;;GAXlC,WAAW,CAgRvB;;AC5SD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO;;ACvB3B;AACA,IAAI,UAAU,GAAG,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,IAAI,MAAM;;ACC1F;AACA,IAAI,QAAQ,GAAG,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC;AACjF;AACA;AACA,IAAI,IAAI,GAAG,UAAU,IAAI,QAAQ,IAAI,QAAQ,CAAC,aAAa,CAAC,EAAE;;ACJ9D;AACA,IAAIC,QAAM,GAAG,IAAI,CAAC,MAAM;;ACDxB;AACA,IAAIC,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAIC,gBAAc,GAAGD,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA,IAAIE,sBAAoB,GAAGF,aAAW,CAAC,QAAQ,CAAC;AAChD;AACA;AACA,IAAIG,gBAAc,GAAGJ,QAAM,GAAGA,QAAM,CAAC,WAAW,GAAG,SAAS,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE,IAAI,KAAK,GAAGE,gBAAc,CAAC,IAAI,CAAC,KAAK,EAAEE,gBAAc,CAAC;AACxD,MAAM,GAAG,GAAG,KAAK,CAACA,gBAAc,CAAC,CAAC;AAClC;AACA,EAAE,IAAI;AACN,IAAI,KAAK,CAACA,gBAAc,CAAC,GAAG,SAAS,CAAC;AACtC,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC;AACxB,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE;AAChB;AACA,EAAE,IAAI,MAAM,GAAGD,sBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAChD,EAAE,IAAI,QAAQ,EAAE;AAChB,IAAI,IAAI,KAAK,EAAE;AACf,MAAM,KAAK,CAACC,gBAAc,CAAC,GAAG,GAAG,CAAC;AAClC,KAAK,MAAM;AACX,MAAM,OAAO,KAAK,CAACA,gBAAc,CAAC,CAAC;AACnC,KAAK;AACL,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB;;AC3CA;AACA,IAAIH,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,oBAAoB,GAAGA,aAAW,CAAC,QAAQ,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,EAAE,OAAO,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1C;;ACfA;AACA,IAAI,OAAO,GAAG,eAAe;AAC7B,IAAI,YAAY,GAAG,oBAAoB,CAAC;AACxC;AACA;AACA,IAAI,cAAc,GAAGD,QAAM,GAAGA,QAAM,CAAC,WAAW,GAAG,SAAS,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE;AACrB,IAAI,OAAO,KAAK,KAAK,SAAS,GAAG,YAAY,GAAG,OAAO,CAAC;AACxD,GAAG;AACH,EAAE,OAAO,CAAC,cAAc,IAAI,cAAc,IAAI,MAAM,CAAC,KAAK,CAAC;AAC3D,MAAM,SAAS,CAAC,KAAK,CAAC;AACtB,MAAM,cAAc,CAAC,KAAK,CAAC,CAAC;AAC5B;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,QAAQ,CAAC;AACnD;;ACvBA;AACA,IAAI,SAAS,GAAG,iBAAiB,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,OAAO,KAAK,IAAI,QAAQ;AACjC,KAAK,YAAY,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC;AAC5D;;ACvBA;AACA,IAAI,YAAY,GAAG,kDAAkD;AACrE,IAAI,aAAa,GAAG,OAAO,CAAC;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE;AAC9B,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,SAAS;AAC/D,MAAM,KAAK,IAAI,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACxC,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH,EAAE,OAAO,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;AAC/D,KAAK,MAAM,IAAI,IAAI,IAAI,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AAChD;;AC1BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,OAAO,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,UAAU,CAAC,CAAC;AACnE;;ACzBA;AACA,IAAI,QAAQ,GAAG,wBAAwB;AACvC,IAAI,OAAO,GAAG,mBAAmB;AACjC,IAAI,MAAM,GAAG,4BAA4B;AACzC,IAAI,QAAQ,GAAG,gBAAgB,CAAC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;AACxB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA,EAAE,IAAI,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,OAAO,GAAG,IAAI,OAAO,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,CAAC;AAC/E;;AChCA;AACA,IAAI,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC;;ACD3C;AACA,IAAI,UAAU,IAAI,WAAW;AAC7B,EAAE,IAAI,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;AAC3F,EAAE,OAAO,GAAG,IAAI,gBAAgB,GAAG,GAAG,IAAI,EAAE,CAAC;AAC7C,CAAC,EAAE,CAAC,CAAC;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,IAAI,EAAE;AACxB,EAAE,OAAO,CAAC,CAAC,UAAU,KAAK,UAAU,IAAI,IAAI,CAAC,CAAC;AAC9C;;ACjBA;AACA,IAAIK,WAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAIC,cAAY,GAAGD,WAAS,CAAC,QAAQ,CAAC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,IAAI,EAAE;AACxB,EAAE,IAAI,IAAI,IAAI,IAAI,EAAE;AACpB,IAAI,IAAI;AACR,MAAM,OAAOC,cAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE;AAClB,IAAI,IAAI;AACR,MAAM,QAAQ,IAAI,GAAG,EAAE,EAAE;AACzB,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE;AAClB,GAAG;AACH,EAAE,OAAO,EAAE,CAAC;AACZ;;AClBA;AACA;AACA;AACA;AACA,IAAI,YAAY,GAAG,qBAAqB,CAAC;AACzC;AACA;AACA,IAAI,YAAY,GAAG,6BAA6B,CAAC;AACjD;AACA;AACA,IAAI,SAAS,GAAG,QAAQ,CAAC,SAAS;AAClC,IAAIL,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAI,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC;AACtC;AACA;AACA,IAAIC,gBAAc,GAAGD,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA,IAAI,UAAU,GAAG,MAAM,CAAC,GAAG;AAC3B,EAAE,YAAY,CAAC,IAAI,CAACC,gBAAc,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC;AACjE,GAAG,OAAO,CAAC,wDAAwD,EAAE,OAAO,CAAC,GAAG,GAAG;AACnF,CAAC,CAAC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC3C,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,GAAG,YAAY,CAAC;AAC9D,EAAE,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACvC;;AC5CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;AAC/B,EAAE,OAAO,MAAM,IAAI,IAAI,GAAG,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAClD;;ACPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE;AAChC,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACpC,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC;AACjD;;ACZA;AACA,IAAI,YAAY,GAAG,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC;;ACD9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,GAAG;AACrB,EAAE,IAAI,CAAC,QAAQ,GAAG,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;AACzD,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB;;ACZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,GAAG,EAAE;AACzB,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC1D,EAAE,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9B,EAAE,OAAO,MAAM,CAAC;AAChB;;ACZA;AACA,IAAIK,gBAAc,GAAG,2BAA2B,CAAC;AACjD;AACA;AACA,IAAIN,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAIC,gBAAc,GAAGD,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE;AACtB,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,IAAI,YAAY,EAAE;AACpB,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AAC3B,IAAI,OAAO,MAAM,KAAKM,gBAAc,GAAG,SAAS,GAAG,MAAM,CAAC;AAC1D,GAAG;AACH,EAAE,OAAOL,gBAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;AAChE;;ACzBA;AACA,IAAI,WAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAI,cAAc,GAAG,WAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE;AACtB,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,OAAO,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnF;;AClBA;AACA,IAAI,cAAc,GAAG,2BAA2B,CAAC;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE;AAC7B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACrC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,IAAI,KAAK,KAAK,SAAS,IAAI,cAAc,GAAG,KAAK,CAAC;AAC7E,EAAE,OAAO,IAAI,CAAC;AACd;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,IAAI,CAAC,OAAO,EAAE;AACvB,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;AACjC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;AACtC,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;AAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;AAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO;;AC7B5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,GAAG;AAC1B,EAAE,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;AACrB,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB;;ACVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE;AAC1B,EAAE,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC;AACjE;;AChCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;AAClC,EAAE,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AAC5B,EAAE,OAAO,MAAM,EAAE,EAAE;AACnB,IAAI,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;AACnC,MAAM,OAAO,MAAM,CAAC;AACpB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,CAAC,CAAC,CAAC;AACZ;;AChBA;AACA,IAAI,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC;AACjC;AACA;AACA,IAAI,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,eAAe,CAAC,GAAG,EAAE;AAC9B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE;AACjB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AAClC,EAAE,IAAI,KAAK,IAAI,SAAS,EAAE;AAC1B,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;AACf,GAAG,MAAM;AACT,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAChC,GAAG;AACH,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC;AACd,EAAE,OAAO,IAAI,CAAC;AACd;;AC9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE;AAC3B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,OAAO,KAAK,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE;AAC3B,EAAE,OAAO,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/C;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE;AAClC,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE;AACjB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;AAChB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAC5B,GAAG,MAAM;AACT,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;AAC3B,GAAG;AACH,EAAE,OAAO,IAAI,CAAC;AACd;;ACjBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,OAAO,EAAE;AAC5B,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,SAAS,CAAC,SAAS,CAAC,KAAK,GAAG,cAAc,CAAC;AAC3C,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,eAAe,CAAC;AAChD,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC;AACvC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC;AACvC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY;;AC1BtC;AACA,IAAIM,KAAG,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC;;ACAhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,GAAG;AACzB,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB,EAAE,IAAI,CAAC,QAAQ,GAAG;AAClB,IAAI,MAAM,EAAE,IAAI,IAAI;AACpB,IAAI,KAAK,EAAE,KAAKA,KAAG,IAAI,SAAS,CAAC;AACjC,IAAI,QAAQ,EAAE,IAAI,IAAI;AACtB,GAAG,CAAC;AACJ;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,OAAO,CAAC,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,SAAS;AACvF,OAAO,KAAK,KAAK,WAAW;AAC5B,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC;AACvB;;ACVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE;AAC9B,EAAE,IAAI,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;AAC1B,EAAE,OAAO,SAAS,CAAC,GAAG,CAAC;AACvB,MAAM,IAAI,CAAC,OAAO,GAAG,IAAI,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC;AACtD,MAAM,IAAI,CAAC,GAAG,CAAC;AACf;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,GAAG,EAAE;AAC7B,EAAE,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;AACpD,EAAE,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9B,EAAE,OAAO,MAAM,CAAC;AAChB;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACxC;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACxC;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE;AACjC,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC;AAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;AACvB;AACA,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACvB,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;AACzC,EAAE,OAAO,IAAI,CAAC;AACd;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,OAAO,EAAE;AAC3B,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,aAAa,CAAC;AACzC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC;AAC9C,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW,CAAC;AACrC,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW,CAAC;AACrC,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW;;AC3BpC;AACA,IAAI,eAAe,GAAG,qBAAqB,CAAC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE;AACjC,EAAE,IAAI,OAAO,IAAI,IAAI,UAAU,KAAK,QAAQ,IAAI,IAAI,IAAI,OAAO,QAAQ,IAAI,UAAU,CAAC,EAAE;AACxF,IAAI,MAAM,IAAI,SAAS,CAAC,eAAe,CAAC,CAAC;AACzC,GAAG;AACH,EAAE,IAAI,QAAQ,GAAG,WAAW;AAC5B,IAAI,IAAI,IAAI,GAAG,SAAS;AACxB,QAAQ,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAC7D,QAAQ,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;AAC/B;AACA,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AACxB,MAAM,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5B,KAAK;AACL,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACxC,IAAI,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC;AACrD,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG,CAAC;AACJ,EAAE,QAAQ,CAAC,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;AACnD,EAAE,OAAO,QAAQ,CAAC;AAClB,CAAC;AACD;AACA;AACA,OAAO,CAAC,KAAK,GAAG,QAAQ;;ACpExB;AACA,IAAI,gBAAgB,GAAG,GAAG,CAAC;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,IAAI,EAAE;AAC7B,EAAE,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,EAAE;AAC3C,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE;AACzC,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;AACpB,KAAK;AACL,IAAI,OAAO,GAAG,CAAC;AACf,GAAG,CAAC,CAAC;AACL;AACA,EAAE,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;AAC3B,EAAE,OAAO,MAAM,CAAC;AAChB;;ACrBA;AACA,IAAI,UAAU,GAAG,kGAAkG,CAAC;AACpH;AACA;AACA,IAAI,YAAY,GAAG,UAAU,CAAC;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,YAAY,GAAG,aAAa,CAAC,SAAS,MAAM,EAAE;AAClD,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;AAClB,EAAE,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU;AAC3C,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACpB,GAAG;AACH,EAAE,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE;AACvE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC;AACnF,GAAG,CAAC,CAAC;AACL,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;;ACxBF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE;AACnC,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM;AAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;AAC7B;AACA,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACzD,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB;;ACbA;AACA,IAAIC,UAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB;AACA;AACA,IAAI,WAAW,GAAGT,QAAM,GAAGA,QAAM,CAAC,SAAS,GAAG,SAAS;AACvD,IAAI,cAAc,GAAG,WAAW,GAAG,WAAW,CAAC,QAAQ,GAAG,SAAS,CAAC;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B;AACA,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,EAAE;AAChC,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB;AACA,IAAI,OAAO,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,GAAG,EAAE,CAAC;AAC9C,GAAG;AACH,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACvB,IAAI,OAAO,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;AAC5D,GAAG;AACH,EAAE,IAAI,MAAM,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC;AAC5B,EAAE,OAAO,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK,CAACS,UAAQ,IAAI,IAAI,GAAG,MAAM,CAAC;AACrE;;AChCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,KAAK,IAAI,IAAI,GAAG,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;AAClD;;ACpBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE;AACjC,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,OAAO,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACxE;;AChBA;AACA,IAAI,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE;AACtB,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACnD,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,MAAM,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC;AAC5B,EAAE,OAAO,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,QAAQ,IAAI,IAAI,GAAG,MAAM,CAAC;AACrE;;ACfA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE;AAC/B,EAAE,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAChC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC;AACf,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;AAC3B;AACA,EAAE,OAAO,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG,MAAM,EAAE;AAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1C,GAAG;AACH,EAAE,OAAO,CAAC,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,GAAG,SAAS,CAAC;AACzD;;ACnBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE;AACzC,EAAE,IAAI,MAAM,GAAG,MAAM,IAAI,IAAI,GAAG,SAAS,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAClE,EAAE,OAAO,MAAM,KAAK,SAAS,GAAG,YAAY,GAAG,MAAM,CAAC;AACtD;;MC5Ba,OAAO,GAAY;IAC9B,SAAS,EAAE,IAAI;IACf,KAAK,EAAE,KAAK;;;ACFd,MAAM,WAAW;IAAjB;QACU,aAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;KAmB7C;IAjBQ,KAAK,CAAE,EAAU;QACtB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE;YAClB,OAAM;SACP;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;KAClC;IAEM,IAAI,CAAE,EAAU;QACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE;YAClB,OAAM;SACP;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAA;QACnC,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;;QAEvB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,IAAI,IAAI,CAAC,CAAA;KACnC;CACF;AAEM,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE;;ACHrC,MAAM,gBAAgB,GAAG,WAAW,EAAE,CAAA;IAGzB,eAAe,GAA5B,MAAa,eAAgB,SAAQ,WAAW;IAQ9C;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B,EAChC,WAAmB;QAE3D,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;QAdzC,kBAAa,GAAG,KAAK,CAAA;QACrB,iBAAY,GAAG,KAAK,CAAA;QACpB,mBAAc,GAAoB,EAAE,CAAA;QACpC,oBAAe,GAAU,EAAE,CAAA;QAE5B,QAAG,GAAsB,IAAI,CAAA;QAUlC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;KAC/B;IAED,IAAW,KAAK;QACd,OAAO,QAAQ,CAAA;KAChB;IAED,IAAc,KAAK;QACjB,OAAO,IAAI,CAAA;KACZ;IAEM,aAAa,CAAE,OAAsB;QAC1C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAEjC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE;YAC5C,IAAI,CAAC,aAAa,EAAE,CAAA;SACrB;KACF;IAEM,aAAa,CAAE,UAAU,GAAG,KAAK,EAAE,SAAgB;QACxD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAA;QAEzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAI,CAAA;QAErB,UAAU,CAAC;YACT,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;YACpB,MAAM,IAAI,GAAkE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC/F,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,UAAU;kBACN,CAAC,aAAa,EAAE,YAAY,CAAC;kBAC7B,EAAE,CACP,CAAA;YAED,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;gBACrC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAG,CAAA;gBACpD,IAAI,IAAI,CAAC,QAAQ,uBAAsB,EAAE;oBACvC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;iBACrB;gBACD,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;aACnB;YAED,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,UAAU,CAAC,OAAO,CAAC,CAAC;;oBAElB,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,EAAE;wBAClC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAA;qBAClB;iBACF,CAAC,CAAA;gBAEF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;gBACxB,IAAIC,YAAU,CAAC,KAAK,CAAC,EAAE;oBACrB,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAA;iBACrB;aACF;YAED,IAAIA,YAAU,CAAC,SAAS,CAAC,EAAE;gBACzB,SAAS,CAAC,IAAI,CAAC,CAAA;aAChB;iBAAM;gBACL,IAAI,CAAC,aAAa,GAAG,KAAK,CAAA;gBAC1B,MAAM,mBAAmB,GAA8C,EAAE,CAAA;gBACzE,MAAM,YAAY,GAAG,EAAE,CAAA;gBACvB,IAAI,CAAC,UAAU,EAAE;oBACf,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;wBACpB,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;wBAChC,IAAI,gBAAgB,GAAG,KAAK,CAAA;wBAC5B,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;4BAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;4BACjD,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;4BACtD,IAAI,OAAO,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,KAAK,cAAc,EAAE;gCAC1D,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAA;gCACnC,MAAM,aAAa,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,eAAe,EAAE,CAAC,CAAA;gCAChE,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gCAClD,IAAI,aAAa,EAAE;oCACjB,gBAAgB,GAAG,IAAI,CAAA;oCACvB,mBAAmB,CAAC,IAAI,CAAC;wCACvB,GAAG,EAAE,GAAG,CAAC,eAAe,CAAC,IAAI,eAAe,EAAE,CAAC;wCAC/C,IAAI,EAAE;4CACJ,CAAC,KAAK,WAAW,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;yCAC9B;qCACF,CAAC,CAAA;iCACH;gCACD,MAAK;6BACN;yBACF;wBACD,IAAI,CAAC,gBAAgB,EAAE;4BACrB,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;yBAC1B;qBACF;iBACF;gBACD,MAAM,YAAY,GAAG,mBAAmB,CAAC,MAAM,CAAA;gBAC/C,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,WAAW,gBAAgB,EAAE,EAAE,CAAA;oBAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;oBACpC,IAAI,WAAW,GAAG,CAAC,CAAA;oBACnB,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE;wBACxB,WAAW,EAAE,CAAA;wBACb,IAAI,WAAW,KAAK,YAAY,GAAG,CAAC,EAAE;4BACpC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;4BACnB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gCACtB,IAAI,CAAC,mBAAmB,EAAE,CAAA;6BAC3B;4BACD,IAAI,UAAU,EAAE;gCACd,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;6BACrB;yBACF;qBACF,EAAE,WAAW,CAAC,CAAA;oBACf,mBAAmB,CAAC,OAAO,CAAC,IAAI;wBAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;4BAE1D,OAAO,CAAC,GAAG,CAAC,0BAA0B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;yBACnD;wBACD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;4BAC1B,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;yBAC7B,CAAC,CAAA;qBACH,CAAC,CAAA;oBACF,IAAI,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,EAAE;wBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;4BAE1D,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAA;yBACtC;wBACD,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE;4BACxB,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;yBAC7B,CAAC,CAAA;qBACH;iBACF;qBAAM;oBACL,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;wBAE1D,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;qBAC9B;oBACD,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE;wBAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;wBACnB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;4BACtB,IAAI,CAAC,mBAAmB,EAAE,CAAA;yBAC3B;wBACD,IAAI,UAAU,EAAE;4BACd,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;yBACrB;qBACF,CAAC,CAAA;iBACH;aACF;SACF,EAAE,CAAC,CAAC,CAAA;KACN;IAEM,qBAAqB,CAAE,EAAQ,EAAE,GAAyB;QAC/D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;YACxB,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAA;SAC1B,CAAC,CAAA;KACH;IAEM,mBAAmB;QACxB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC5C,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAA;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAA;SACZ;KACF;EACF;AA9KY,eAAe;IAD3B,UAAU,EAAE;IAUR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;IAC1C,WAAA,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAA;;GAb9B,eAAe,CA8K3B;;MC7LY,WAAY,SAAQ,WAAW;IAC1C,IAAW,KAAK;;QAEd,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC7B,OAAO,GAAG,IAAI,IAAI,GAAG,EAAE,GAAG,GAAG,CAAA;KAC9B;IAED,IAAW,KAAK,CAAE,GAAsC;QACtD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;KAC9B;IAEM,aAAa,CAAE,KAAgB;QACpC,IAAI,KAAK,CAAC,OAAO,EAAE;YACjB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAA;YACtC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;gBACzB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAa,CAAA;aACjC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE;;;;gBAI/B,IAAI,CAAC,KAAK,GAAG,GAAa,CAAA;aAC3B;SACF;QAED,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;KAClC;;;ACpBH,IAAa,YAAY,GAAzB,MAAa,YAAY;IAMvB;IACiD,UAAgC,EACzB,aAA2B,EAClB,YAAoC;QAEnG,IAAI,CAAC,MAAM,GAAG,MAAM,UAAU,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;QACrE,IAAI,CAAC,aAAa,GAAG,aAAa,CAAA;QAClC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;KACjC;IAEM,IAAI,CAAE,GAAQ;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,aAAa,EAAE,CAAA;QACpB,IAAI,CAAC,gBAAgB,EAAE,CAAA;KACxB;IAEO,aAAa;QACnB,MAAM,EAAE,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QACjD,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,WAAW,EAAE;YACtC,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,IAAI;YAChB,GAAG,CAAE,IAAY;gBACf,IAAIA,YAAU,CAAC,IAAI,CAAC,EAAE;oBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;iBAClC;qBAAM;oBACL,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAA;iBAC1E;aACF;YACD,GAAG;gBACD,OAAO,EAAE,CAAA;aACV;SACF,CAAC,CAAA;KACH;IAEO,gBAAgB;QACtB,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QAChD,GAAG,CAAC,kBAAkB,GAAG,UAAU,QAAmB,EAAE,IAAY;YAClE,IAAIA,YAAU,CAAC,IAAI,CAAC,EAAE;gBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;aACvC;iBAAM;gBACL,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,EAAE,6BAA6B,CAAC,CAAA;aACnF;SACF,CAAA;KACF;CACF,CAAA;AAlDY,YAAY;IADxB,UAAU,EAAE;IAQR,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAA,EAAE,WAAA,QAAQ,EAAE,CAAA;IACpD,WAAA,MAAM,CAAC,kBAAkB,CAAC,sBAAsB,CAAC,CAAA,EAAE,WAAA,QAAQ,EAAE,CAAA;;GATrD,YAAY,CAkDxB;;ACxDD,IAAa,eAAe,GAA5B,MAAa,eAAe;IAG1B;IACoE,QAA0C;QAE5G,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;KACzB;IAED,IAAI,CAAE,GAAQ;QACZ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;KACnB;IAED,QAAQ,CAAE,GAAQ;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC1B,GAAG,CAAC,qBAAqB,GAAG,gBAAgB,GAAG,IAAW;YACxD,IAAIA,YAAU,CAAC,IAAI,CAAC,EAAE;gBACpB,OAAO,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;aACnC;YAED,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,EAAE,mCAAmC,CAAC,CAAA;YACxF,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;SAC7B,CAAA;KACF;CACF,CAAA;AAxBY,eAAe;IAD3B,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,yBAAyB,CAAC,CAAA,EAAE,WAAA,QAAQ,EAAE,CAAA;;GAJxD,eAAe,CAwB3B;;ACXD,IAAa,YAAY,GAAzB,MAAa,YAAa,SAAQ,WAAW;IAG3C;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B,EAC5B,OAAkC;QAE9E,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;QAC/C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,QAAQ,yBAAyB;QACtC,IAAI,CAAC,QAAQ,GAAG,qBAAqB,CAAA;KACtC;IAEM,aAAa,CAAE,IAAY;QAChC,IAAI,IAAI,KAAK,QAAQ,EAAE;YACrB,OAAO,IAAI,CAAC,WAAW,CAAkB,YAAY,CAAC,WAAW,CAAC,EAAE,CAAA;SACrE;QAED,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACjC,OAAO,IAAI,CAAC,WAAW,CAAc,YAAY,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAA;SACrE;QAED,OAAO,IAAI,CAAC,WAAW,CAAc,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAA;KACjE;;;IAIM,eAAe,CAAE,MAAc,EAAE,IAAY;QAClD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;KAChC;IAEM,cAAc,CAAE,IAAY;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;KAC3B;IAEM,cAAc,CAAyB,EAA6B;QACzE,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC9B,OAAO,WAAW,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,EAAO,CAAA;KACxC;IAEM,aAAa,CAAyB,KAAa;;QAExD,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,cAAc,CAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;SAC9C;QACD,OAAO,IAAI,CAAA;KACZ;;IAGM,aAAa;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAClC,QAAQ,CAAC,QAAQ,GAAG,OAAO,CAAA;QAC3B,OAAO,QAAQ,CAAA;KAChB;CACF,CAAA;AAzDY,YAAY;IADxB,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;IAC1C,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;;GARlC,YAAY,CAyDxB;;AC5DD,SAAS,YAAY;IACnB,OAAO;QACL,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;KACR,CAAA;AACH,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB,EAAE,GAAW,EAAE,GAAW;IACjE,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;IAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,GAAG,KAAK,GAAG,GAAG,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAChC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,IAAI,KAAK,IAAI,EAAE;YACjB,QAAQ,CAAC,IAAI,EAAE,CAAA;YACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;SACpB;aAAM;YACL,QAAQ,CAAC,MAAM,EAAE,CAAA;SAClB;KACF;AACH,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB,EAAE,GAAW,EAAE,GAAW;IACjE,MAAM,GAAG,GAAG,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAA;IAChC,OAAO,YAAY,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AACzC,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB;IACvC,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,MAAM,EAAE,QAAQ,CAAC,MAAM;KACxB,CAAA;AACH,CAAC;AAED,MAAM,UAAU,GAAG,IAAI,CAAA;AACvB,SAAS,gBAAgB,CAAE,IAAY;IACrC,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED,MAAM,SAAS,GAAG,GAAG,CAAA;AACrB,SAAS,eAAe,CAAE,IAAY;IACpC,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC7B,CAAC;AAED,SAAS,cAAc,CAAE,OAAe;IACtC,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAA;IAClC,IAAI,OAAO,CAAC,IAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACxC,OAAO,IAAI,CAAA;KACZ;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,YAAY,GAAG,aAAa,CAAA;AAElC,SAAS,WAAW,CAAE,GAAW,EAAE,KAAa;IAC9C,OAAO,IAAI,EAAE;QACX,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACvC,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;YAClB,OAAO,OAAO,CAAA;SACf;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;QACpC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3D,OAAO,OAAO,CAAA;SACf;QACD,KAAK,GAAG,OAAO,GAAG,CAAC,CAAA;KACpB;AACH,CAAC;AAED,SAAS,SAAS,CAAE,MAAc,EAAE,SAAiB,EAAE,IAAY;IACjE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAExD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;;IAGvB,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YACvC,MAAK;SACN;KACF;;IAGD,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YACvC,OAAO,IAAI,CAAA;SACZ;KACF;AACH,CAAC;MAEY,MAAM;IAOjB,YAAa,IAAY;QANjB,WAAM,GAAY,EAAE,CAAA;QAEpB,aAAQ,GAAa,YAAY,EAAE,CAAA;QAKzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;KACjB;IAEM,IAAI;QACT,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QAEvB,OAAO,QAAQ,CAAC,KAAK,GAAG,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;YAC5B,IAAI,CAAC,QAAQ,EAAE,CAAA;YACf,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,EAAE;gBAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBACnD,IAAI,SAAS,EAAE;oBACb,IAAI,CAAC,WAAW,EAAE,CAAA;iBACnB;qBAAM;oBACL,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;oBAC9B,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE;wBAC3B,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;qBAC1B;iBACF;aACF;SACF;QAED,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;IAEO,QAAQ;QACd,MAAM,IAAI,GAAG,MAAM,CAAA;QACnB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC/C,IAAI,OAAO,KAAK,QAAQ,CAAC,KAAK,EAAE;YAC9B,OAAM;SACP;QACD,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;YAClB,OAAO,GAAG,IAAI,CAAC,MAAM,CAAA;SACtB;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QACnD,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QACrC,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;KAC9D;IAEO,WAAW;QACjB,MAAM,IAAI,GAAG,SAAS,CAAA;QACtB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;QAC/B,IAAI,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QACpD,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC,CAAA;QAC/B,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE;YACrB,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAA;SACtC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QACtD,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YACf,IAAI;YACJ,OAAO;YACP,QAAQ,EAAE;gBACR,KAAK;gBACL,GAAG,EAAE,YAAY,CAAC,QAAQ,CAAC;aAC5B;SACF,CAAC,CAAA;KACH;IAEO,OAAO;QACb,IAAI,CAAC,YAAY,EAAE,CAAA;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAClC,IAAI,CAAC,SAAS,EAAE,CAAA;QAChB,IAAI,CAAC,UAAU,EAAE,CAAA;QAEjB,OAAO,OAAO,CAAA;KACf;IAEO,YAAY;QAClB,MAAM,IAAI,GAAG,WAAW,CAAA;QACxB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAE/B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAClD,MAAM,KAAK,GAAG,UAAU,KAAK,GAAG,CAAA;QAChC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;KACvD;IAEO,UAAU;QAChB,MAAM,IAAI,GAAG,SAAS,CAAA;QACtB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC7C,MAAM,KAAK,GAAG,SAAS,KAAK,GAAG,CAAA;QAC/B,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;KACrD;IAEO,WAAW;QACjB,MAAM,IAAI,GAAG,KAAK,CAAA;QAClB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC1B,OAAO,KAAK,GAAG,GAAG,EAAE;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAC/B,MAAM,SAAS,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAA;YAC3E,IAAI,SAAS;gBAAE,MAAK;YACpB,KAAK,EAAE,CAAA;SACR;QAED,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAA;QACnB,OAAO,GAAG,GAAG,GAAG,EAAE;YAChB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC7B,MAAM,SAAS,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAA;YAC3E,IAAI,CAAC,SAAS;gBAAE,MAAK;YACrB,GAAG,EAAE,CAAA;SACN;QAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QACtC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YACf,IAAI;YACJ,OAAO,EAAE,OAAO;SACjB,CAAC,CAAA;QAEF,OAAO,OAAO,CAAA;KACf;IAEO,SAAS;QACf,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QACvC,IAAI,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC3B,IAAI,KAAK,GAAkB,IAAI,CAAA;QAC/B,IAAI,SAAS,GAAG,MAAM,CAAA;QACtB,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,OAAO,MAAM,GAAG,GAAG,EAAE;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAChC,IAAI,KAAK,EAAE;gBACT,MAAM,UAAU,GAAG,IAAI,KAAK,KAAK,CAAA;gBACjC,IAAI,UAAU,EAAE;oBACd,KAAK,GAAG,IAAI,CAAA;iBACb;gBACD,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,QAAQ,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAA;YAC7C,IAAI,QAAQ,EAAE;gBACZ,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;iBAC1C;gBACD,MAAK;aACN;YAED,IAAI,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE;gBACtC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;iBAC1C;gBACD,SAAS,GAAG,MAAM,GAAG,CAAC,CAAA;gBACtB,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,YAAY,GAAG,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,CAAA;YAClD,IAAI,YAAY,EAAE;gBAChB,KAAK,GAAG,IAAI,CAAA;gBACZ,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,EAAE,CAAA;SACT;QAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QAEpC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAA;QACzB,MAAM,IAAI,GAAG,WAAW,CAAA;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;YACpC,IAAI,SAAS,EAAE;gBACb,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC/B,IAAI,UAAU,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;oBAC5C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;wBACzB,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU,CAAA;wBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;wBACvC,CAAC,IAAI,CAAC,CAAA;wBACN,SAAQ;qBACT;oBACD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;oBAC9B,CAAC,IAAI,CAAC,CAAA;oBACN,IAAI,SAAS,EAAE;wBACb,MAAM,OAAO,GAAG,IAAI,GAAG,GAAG,GAAG,SAAS,CAAA;wBACtC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;wBACvC,CAAC,IAAI,CAAC,CAAA;wBACN,SAAQ;qBACT;iBACF;aACF;YACD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;gBACtB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC/B,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;oBAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU,CAAA;oBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;oBACvC,CAAC,IAAI,CAAC,CAAA;oBACN,SAAQ;iBACT;gBAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;gBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;gBACvC,SAAQ;aACT;YAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;SACrC;KACF;IAEO,WAAW,CAAE,OAAe;QAClC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,EAAE,CAAA;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,OAAO,QAAQ,CAAC,KAAK,GAAG,GAAG,EAAE;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;YAClD,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;gBAClB,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACf,MAAK;aACN;YAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YAC3B,IAAI,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,EAAE;gBACtC,MAAK;aACN;SACF;KACF;;;SC/Va,OAAO,CACrB,GAAW,EACX,gBAA0B;IAE1B,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACxD,MAAM,IAAI,GAAkB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;KACpB;IACD,OAAO,gBAAgB,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAC/E,CAAC;AAEM,MAAM,mBAAmB,GAAG;IACjC,GAAG,EAAE,OAAO;IACZ,MAAM,EAAE,UAAU;CACnB,CAAA;AAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC;KACtD,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;KACzB,IAAI,CAAC,GAAG,CAAC,CAAA;AAEZ;AACO,MAAM,cAAc,GAAG,OAAO,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAA;AAE9D;AACO,MAAM,gBAAgB,GAAG,OAAO,CAAC,mNAAmN,EAAE,IAAI,CAAC,CAAA;AAElQ;AACO,MAAM,eAAe,GAAG,OAAO,CAAC,8KAA8K,EAAE,IAAI,CAAC;;SC9B5M,OAAO,CAAE,GAAW;IAClC,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACzB,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;IAC1B,MAAM,YAAY,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,CAAA;IAC/C,IAAI,YAAY,IAAI,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;QAC3C,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;KACzB;IACD,OAAO,GAAG,CAAA;AACZ;;ACFA,MAAM,YAAY,GAAG,GAAG,CAAA;AACxB,MAAM,aAAa,GAAG,GAAG,CAAA;AACzB,MAAM,cAAc,GAAG,GAAG,CAAA;AAC1B,MAAM,WAAW,GAAG,GAAG,CAAA;AACvB,MAAM,gBAAgB,GAAG,GAAG,CAAA;AAC5B,MAAM,0BAA0B,GAAG,GAAG,CAAA;AACtC,MAAM,2BAA2B,GAAG,GAAG,CAAA;MAqBlB,cAAc;IAAnC;QACE,WAAM,GAAY,EAAE,CAAA;KAwLrB;IAtLC,YAAY,CAAE,GAAW;QACvB,MAAM,SAAS,GAAG,wCAAwC,CAAA;QAC1D,IAAI,IAAI,GAAG,GAAG,CAAA;;QAGd,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAU;YAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,EAAE,CAAA;YACvB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;YAC5B,OAAO,EAAE,CAAA;SACV,CAAC,CAAA;QAEF,OAAO,IAAI,CAAC,IAAI,EAAE,CAAA;KACnB;IAED,gBAAgB,CAAE,KAAa;QAC7B,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;QAEpC,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE;YACd,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAA;YACvC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;YAC3C,IAAI,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YACvD,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE;gBACzB,OAAO,IAAI,GAAG,CAAA;aACf;YACD,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG;gBAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;gBAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBACf,OAAO;oBACP,YAAY;iBACb,CAAC,CAAA;aACH,CAAC,CAAA;YACF,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;YAC3B,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;SACjC;;KAEF;IAED,aAAa,CAAE,GAAW;;QAExB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACrF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,QAAQ,GAAc;gBAC1B,OAAO,EAAE,SAAS,KAAK,gBAAgB;gBACvC,gBAAgB,EAAE,SAAS,KAAK,0BAA0B;gBAC1D,iBAAiB,EAAE,SAAS,KAAK,2BAA2B;gBAC5D,GAAG,EAAE,IAAI;gBACT,EAAE,EAAE,IAAI;gBACR,KAAK,EAAE,EAAE;gBACT,KAAK,EAAE,EAAE;aACV,CAAA;YAED,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA;;YAGjC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,UAAU,CAAC,EAAE,EAAU;gBACvD,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBAClC,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;gBAElC,MAAM,IAAI,GAAG;oBACX,GAAG;oBACH,GAAG;oBACH,KAAK,EAAE,GAAG,GAAG,IAAI,GAAG,KAAK;iBAC1B,CAAA;gBACD,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzB,OAAO,EAAE,CAAA;aACV,CAAC,CAAA;YAEF,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,uBAAuB,EAAE,UAAU,CAAC,EAAE,EAAU;gBAClE,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE;;oBAEzB,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;iBAC3B;qBAAM,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,cAAc,EAAE;;oBAEnC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;iBAClC;gBACD,OAAO,EAAE,CAAA;aACV,CAAC,CAAA;;YAGF,IAAI,IAAI,KAAK,EAAE,EAAE;gBACf,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAA;aACpB;YAED,OAAO,QAAQ,CAAA;SAChB,CAAC,CAAA;QACF,OAAO,SAAS,CAAA;KACjB;IAED,UAAU,CAAE,OAAe,EAAE,EAAqB,EAAE,IAAc;QAChE,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,CAAC;YAC3E,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACjB,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAA;YAChC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YAE1C,IAAI,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,gBAAgB,MAAI,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,iBAAiB,CAAA,EAAE;gBACrE,QAAQ,GAAG,YAAY,CAAA;gBACvB,GAAG,IAAI,CAAC,CAAA;gBACR,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;aACb;YAED,IAAI,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAA;YAEtD,IAAI,OAAO,IAAI,QAAQ,CAAC,gBAAgB,EAAE;gBACxC,IAAI,IAAI,GAAsB,kBAAkB,CAAC,EAAE,CAAC,CAAA;gBACpD,OAAO,IAAI,EAAE;oBACX,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE;wBACpF,OAAO,GAAG,IAAI,CAAA;wBACd,MAAK;qBACN;oBACD,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;oBAC/B,OAAO,GAAG,KAAK,CAAA;iBAChB;aACF;YACD,IAAI,OAAO,IAAI,QAAQ,CAAC,iBAAiB,EAAE;gBACzC,MAAM,IAAI,GAAsB,kBAAkB,CAAC,EAAE,CAAC,CAAA;gBACtD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;oBAC5B,OAAO,GAAG,KAAK,CAAA;iBAChB;qBAAM;oBACL,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;oBACrF,IAAI,CAAC,cAAc,EAAE;wBACnB,OAAO,GAAG,KAAK,CAAA;qBAChB;iBACF;aACF;YAED,IAAI,OAAO,EAAE;gBACX,IAAI,GAAG,KAAK,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBACnC,OAAO,GAAG,GAAG,OAAO,CAAA;iBACrB;qBAAM,IAAI,GAAG,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;iBACb;aACF;iBAAM;;gBAEL,IAAI,QAAQ,CAAC,OAAO,IAAI,GAAG,GAAG,CAAC,EAAE;oBAC/B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;oBACZ,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBACzD,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;qBACb;iBACF;aACF;YAED,OAAO,GAAG,CAAA;SACX,EAAE,EAAE,CAAC,CAAA;QACN,OAAO,GAAG,CAAA;KACX;IAED,YAAY,CAAE,OAAe,EAAE,EAAqB,EAAE,QAAmB;;QAEvE,IAAI,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK,OAAO;YAAE,OAAO,KAAK,CAAA;;QAG1D,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YAAE,OAAO,KAAK,CAAA;;QAGtD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE;YACzB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC7B,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;oBACjC,OAAO,KAAK,CAAA;iBACb;aACF;SACF;;QAGD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC7C,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE;oBAChC,OAAO,KAAK,CAAA;iBACb;qBAAM;oBACL,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAA;oBACjC,IAAI,IAAI,KAAK,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE;wBACjC,OAAO,KAAK,CAAA;qBACb;iBACF;aACF;SACF;QAED,OAAO,IAAI,CAAA;KACZ;CACF;AAED,SAAS,kBAAkB,CAAE,EAAY;IACvC,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAA;IAC/B,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAA;IAExB,MAAM,IAAI,GAAG,EAAE,CAAC,eAAe,CAAA;IAC/B,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAEtB,IAAI,IAAI,CAAC,QAAQ,2BAA4B;QAC3C,OAAO,IAAI,CAAA;KACZ;SAAM;QACL,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAA;KAChC;AACH,CAAC;AAED;AACA;AACA;AACA,SAAS,UAAU,CAAE,MAAgB;IACnC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;QACxB,MAAM,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QACpD,MAAM,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAEpD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,GAAG,SAAS,CAAA;QAEzD,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAE5C,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,KAAK,CAAA;QAEzC,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAE5C,OAAO,KAAK,GAAG,KAAK,CAAA;KACrB,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAE,SAAsB;IAChD,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAClE,CAAC;AAED,SAAS,aAAa,CAAE,SAAsB;IAC5C,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AACrF,CAAC;AAED,SAAS,aAAa,CAAE,SAAsB;IAC5C,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACnE;;AC1PA,MAAM,0BAA0B,GAAG;IACjC,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC;IACxB,EAAE,EAAE,CAAC,IAAI,CAAC;IACV,EAAE,EAAE,CAAC,IAAI,CAAC;IACV,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,EAAE,EAAE,CAAC,OAAO,CAAC;IACb,EAAE,EAAE,CAAC,OAAO,CAAC;CACd,CAAA;AA6BD,SAAS,iBAAiB,CAAE,OAAe,EAAE,KAAgB;IAC3D,MAAM,UAAU,GAAyB,0BAA0B,CAAC,OAAO,CAAC,CAAA;IAC5E,IAAI,UAAU,EAAE;QACd,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QACnC,OAAO,YAAY,IAAI,CAAC,EAAE;YACxB,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,OAAO,CAAA;YACjD,IAAI,aAAa,KAAK,OAAO,EAAE;gBAC7B,MAAK;aACN;YACD,IAAI,UAAU,IAAI,UAAU,CAAC,QAAQ,CAAC,aAAc,CAAC,EAAE;gBACrD,OAAO,IAAI,CAAA;aACZ;YACD,YAAY,EAAE,CAAA;SACf;KACF;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,UAAU,CAAE,GAAW;IAC9B,IAAI,OAAO,CAAC,IAAK,CAAC,aAAa,EAAE;QAC/B,OAAO,GAAG,CAAA;KACX;IAED,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE;QAC5B,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAA;KAChC;SAAM,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE;QAC9B,OAAO,GAAG,CAAA;KACX;SAAM,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;QAC/B,OAAO,MAAM,CAAA;KACd;SAAM,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE;QAChC,OAAO,MAAM,CAAA;KACd;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,UAAU,CAAE,GAAW;IAC9B,MAAM,GAAG,GAAG,GAAG,CAAA;IACf,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;IACpC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAA;IAChD,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AACrB,CAAC;AAED,SAAS,MAAM,CACb,QAAqB,EACrB,QAAsB,EACtB,YAGC,EACD,MAAoB;IAEpB,OAAO,QAAQ;SACZ,MAAM,CAAC,KAAK;;QAEX,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE;YAC5B,OAAO,KAAK,CAAA;SACb;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;YAChC,OAAO,KAAK,CAAC,OAAO,KAAK,EAAE,CAAA;SAC5B;QACD,OAAO,IAAI,CAAA;KACZ,CAAC;SACD,GAAG,CAAC,CAAC,KAAqB;;QAEzB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;YACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnD,IAAIA,YAAU,CAAC,OAAO,CAAC,IAAK,CAAC,aAAa,CAAC,EAAE;gBAC3C,OAAO,OAAO,CAAC,IAAK,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;aAChD;YACD,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,WAAW,CAAC,IAAI,CAAC,CAAA;YACzB,OAAO,IAAI,CAAA;SACZ;QAED,MAAM,EAAE,GAAsB,QAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;QAC/E,EAAE,CAAC,SAAS,GAAG,KAAK,CAAC,OAAO,CAAA;QAE5B,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,WAAW,CAAC,EAAE,CAAC,CAAA;QAEvB,IAAI,CAAC,OAAO,CAAC,IAAK,CAAC,aAAa,EAAE;YAChC,EAAE,CAAC,SAAS,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAA;SACrC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAChD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;YACrC,IAAI,GAAG,KAAK,OAAO,EAAE;gBACnB,EAAE,CAAC,SAAS,IAAI,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;aACrC;iBAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;gBAC3C,SAAQ;aACT;iBAAM;gBACL,EAAE,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;aAC5D;SACF;QAED,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,GAAG,YAAY,CAAA;QACvD,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;QAEhE,EAAE,CAAC,YAAY,CAAC,OAAO,EAAE,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;;QAGlD,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE;YAC/B,cAAc;YACd,cAAc,EAAE,IAAI;SACrB,EAAE,EAAE,CAAC,CAAA;QAEN,IAAIA,YAAU,CAAC,OAAO,CAAC,IAAK,CAAC,gBAAgB,CAAC,EAAE;YAC9C,OAAO,OAAO,CAAC,IAAK,CAAC,gBAAgB,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;SACjD;QAED,OAAO,EAAE,CAAA;KACV,CAAC,CAAA;AACN,CAAC;SAEe,MAAM,CAAE,IAAY,EAAE,QAAsB;IAC1D,MAAM,cAAc,GAAG,IAAI,cAAc,EAAE,CAAA;IAC3C,IAAI,GAAG,cAAc,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;IAEtC,MAAM,IAAI,GAAY,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAA;IAEpF,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAA;IAC3D,KAAK,CAAC,KAAK,CAAC,CAAA;IAEZ,OAAO,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE;QACrC,cAAc;QACd,cAAc,EAAE,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KAC5D,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,KAAK,CAAE,KAAY;IAC1B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAA;IAC/B,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,CAAA;IAEtB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;IAEzB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAA;IAE5C,OAAO,MAAM,GAAG,GAAG,EAAE;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE;;YAE9B,KAAK,CAAC,IAAI,CAAC,KAAkB,CAAC,CAAA;YAC9B,MAAM,EAAE,CAAA;YACR,SAAQ;SACT;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,CAAA;QACjC,MAAM,EAAE,CAAA;QACR,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAQ,CAAC,WAAW,EAAE,CAAA;QAC/C,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAA;YACxB,IAAI,YAAY,GAAG,KAAK,CAAA;YACxB,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE;gBACnB,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE;oBACpC,YAAY,GAAG,IAAI,CAAA;oBACnB,MAAK;iBACN;aACF;YACD,OAAO,MAAM,GAAG,GAAG,EAAE;gBACnB,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;gBAC/B,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS;oBAAE,MAAK;gBACtC,MAAM,EAAE,CAAA;aACT;YACD,IAAI,YAAY,EAAE;gBAChB,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBACnB,MAAK;aACN;iBAAM;gBACL,SAAQ;aACT;SACF;QAED,MAAM,YAAY,GAAG,OAAO,CAAC,IAAK,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAC/D,IAAI,uBAAuB,GAAG,YAAY,CAAA;QAC1C,IAAI,uBAAuB,EAAE;YAC3B,uBAAuB,GAAG,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;SAC7D;QAED,IAAI,uBAAuB,EAAE;YAC3B,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;YACnC,OAAO,YAAY,GAAG,CAAC,EAAE;gBACvB,IAAI,OAAO,KAAK,KAAK,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE;oBAC3C,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;oBAC1B,MAAM,aAAa,GAAG,YAAY,GAAG,CAAC,CAAA;oBACtC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,QAAQ,CAAA;oBACrC,MAAK;iBACN;gBACD,YAAY,GAAG,YAAY,GAAG,CAAC,CAAA;aAChC;SACF;QAED,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,IAAI,SAAgB,CAAA;QACpB,OAAO,MAAM,GAAG,GAAG,EAAE;YACnB,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;YAC1B,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;gBAAE,MAAK;YACvC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,OAAQ,CAAC,CAAA;YACnC,MAAM,EAAE,CAAA;SACT;QAED,MAAM,EAAE,CAAA;QACR,MAAM,QAAQ,GAAc,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,QAAQ,CAAC,OAAQ;YAC1B,UAAU;YACV,QAAQ;SACT,CAAA;QACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAEnB,MAAM,WAAW,GAAG,EAAE,SAAU,CAAC,KAAK,IAAI,OAAO,CAAC,IAAK,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;QAClF,IAAI,WAAW,EAAE;YACf,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAS,CAAC,CAAA;YACxC,MAAM,UAAU,GAAU,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;YACnD,KAAK,CAAC,UAAU,CAAC,CAAA;YACjB,MAAM,GAAG,UAAU,CAAC,MAAM,CAAA;SAC3B;KACF;IAED,KAAK,CAAC,MAAM,GAAG,MAAM,CAAA;AACvB;;AC/QA,OAAO,CAAC,IAAI,GAAG;IACb,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC1C,YAAY,EAAE,IAAI,GAAG,CAAC;QACpB,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS;QAClD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM;QAC/C,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK;KAC1C,CAAC;IACF,eAAe,EAAE,IAAI,GAAG,CAAC;QACvB,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ;QACvD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU;KACxD,CAAC;IACF,aAAa,EAAE,KAAK;CACrB,CAAA;SAEe,YAAY,CAAE,OAAiB,EAAE,IAAY,EAAE,MAA0B;IACvF,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI;QAC7B,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;KAC1B,CAAC,CAAA;IACF,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;KACjC;AACH;;SC3BgB,yBAAyB;IACvC,IAAI,CAAC,OAAO,CAAC,UAAU;QAAE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACrD,OAAO,IAAI,OAAO,CAAC,OAAO;QACxB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,mBAAmB,EAAE,CAAA;QACtD,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,kBAAkB,CAAC,GAAG;YACjD,OAAO,CAAC,GAAG,CAAC,CAAA;SACb,CAAC,CAAC,IAAI,EAAE,CAAA;KACV,CAAC,CAAA;AACJ;;ACLA;;;;SAIgB,sBAAsB,CACpC,QAAmB,EACnB,IAAY,EACZ,MAAc;;IAEd,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QAExB,QAAQ,QAAQ;YACd,KAAK,aAAa;gBAChB,MAAA,IAAI,CAAC,UAAU,0CAAE,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBACtC,MAAK;YACP,KAAK,YAAY;gBACf,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;oBACxB,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;iBACzC;qBAAM;oBACL,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;iBACpB;gBACD,MAAK;YACP,KAAK,WAAW;gBACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;gBACnB,MAAK;YACP,KAAK,UAAU;gBACb,MAAA,IAAI,CAAC,UAAU,0CAAE,WAAW,CAAC,CAAC,CAAC,CAAA;gBAC/B,MAAK;SACR;KACF;AACH;;AC3BA,MAAM,WAAW,GAAG,IAAI,eAAe,CAAC,IAAI;IAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,IAAI,OAAO,iBAAiB,KAAK,WAAW,IAAI,iBAAiB,EAAE;YACjE,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;YAC/D,IAAI,OAAO,oBAAoB,KAAK,WAAW,IAAI,oBAAoB,EAAE;gBACvE,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAA;aACnF;SACF;QACD,IAAI,OAAO,gBAAgB,KAAK,WAAW,IAAI,gBAAgB,EAAE;YAC/D,IAAI,CAAC,kBAAkB,CAAC,yBAAyB,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAA;SACzF;KACF;AACH,CAAC,CAAC;;ACKF,IAAa,KAAK,GAAlB,MAAa,KAAK;IA8CT,aAAa,CAAE,CAAU;;QAC9B,MAAA,IAAI,CAAC,kBAAkB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;KAC9C;IAKM,eAAe,CAAE,CAAY,EAAE,OAAoB;;QACxD,MAAA,IAAI,CAAC,oBAAoB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;KACzD;IAKM,aAAa,CAAE,IAAyB;;QAC7C,MAAA,IAAI,CAAC,kBAAkB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;KACjD;CACF,CAAA;AA7DC;IADC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC;;2CACP;AAGjC;IADC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC;;2CACP;AAGjC;IADC,MAAM,CAAC,kBAAkB,CAAC,cAAc,CAAC;;6CACL;AAGrC;IADC,MAAM,CAAC,kBAAkB,CAAC,cAAc,CAAC;;6CACL;AAGrC;IADC,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC;;8CACJ;AAGvC;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,mBAAmB,CAAC;IAAE,QAAQ,EAAE;;kDACX;AAGhD;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,uBAAuB,CAAC;IAAE,QAAQ,EAAE;;sDACP;AAGxD;IADC,MAAM,CAAC,kBAAkB,CAAC,UAAU,CAAC;IAAE,QAAQ,EAAE;;yCACpB;AAG9B;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,oBAAoB,CAAC;IAAE,QAAQ,EAAE;;mDACV;AAGlD;IADC,MAAM,CAAC,kBAAkB,CAAC,mBAAmB,CAAC;IAAE,QAAQ,EAAE;;kDACX;AAGhD;IADC,MAAM,CAAC,kBAAkB,CAAC,UAAU,CAAC;IAAE,QAAQ,EAAE;;yCACpB;AAG9B;IADC,WAAW,CAAC,kBAAkB,CAAC,aAAa,CAAC;IAAE,QAAQ,EAAE;;iDACd;AAO5C;IADC,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC;IAAE,QAAQ,EAAE;;mDACZ;AAOhD;IADC,WAAW,CAAC,kBAAkB,CAAC,aAAa,CAAC;IAAE,QAAQ,EAAE;;iDACf;AA1DhC,KAAK;IADjB,UAAU,EAAE;GACA,KAAK,CA+DjB;;AC3FD;;;;AAIO,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IACnC,YAAY;IACZ,WAAW;IACX,aAAa;IACb,UAAU;IACV,kBAAkB;IAClB,KAAK;IACL,WAAW;IACX,SAAS;IACT,eAAe;IACf,gBAAgB;IAChB,oBAAoB;IACpB,cAAc;CACf,CAAC;;ACXF,MAAM,YAAY,GAAiB,UAAU,QAAQ,EAAE,SAAS;IAC9D,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAA;AAC5B,CAAC,CAAA;AAED,MAAM,YAAY,GAAiB,UAAU,WAAW;IACtD,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B,CAAC,CAAA;AAED,MAAM,cAAc,GAAmB,UAAU,MAAM;IACrD,OAAO,IAAI,MAAM,EAAE,CAAA;AACrB,CAAC,CAAA;AAED,MAAM,cAAc,GAAG,UAAU,SAAS;IACxC,OAAO,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;AACrC,CAAC,CAAA;AAED,MAAM,eAAe,GAAG;IACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;AAClC,CAAC,CAAA;AAEM,MAAM,qBAAqB,GAAG,IAAI,eAAe,CAAC,IAAI;IAC3D,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;IAC5E,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;IAC5E,IAAI,CAAiB,kBAAkB,CAAC,cAAc,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;IAClF,IAAI,CAAiB,kBAAkB,CAAC,cAAc,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;IAClF,IAAI,CAAkB,kBAAkB,CAAC,eAAe,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAA;AACvF,CAAC,CAAC;;SC3BsB,kBAAkB,CAAE,SAAoB;IAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;IAC3C,IAAI,CAAC,OAAO,CAAC,GAAG;QACd,IAAI,GAAG,IAAI,kBAAkB,EAAE;;YAE7B,MAAM,UAAU,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;YAC1C,MAAM,EAAE,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAA;YAEjC,IAAIX,SAAO,CAAC,EAAE,CAAC,EAAE;;gBAEf,EAAE,CAAC,OAAO,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;aAChE;iBAAM;gBACL,IAAI,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;;oBAEjC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;iBAC5C;qBAAM;oBACL,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;iBAC1C;aACF;SACF;KACF,CAAC,CAAA;AACJ;;MCXM,SAAS,GAAG,IAAI,SAAS,GAAE;AAEjC,SAAS,CAAC,IAAI,CAAc,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;AACjH,SAAS,CAAC,IAAI,CAAe,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,gBAAgB,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;AACvI,SAAS,CAAC,IAAI,CAAkB,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;AAC7H,SAAS,CAAC,IAAI,CAAc,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;AACrH,SAAS,CAAC,IAAI,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAC,SAAS,CAAc,CAAC,OAA2B;IAC7H,OAAO,CAAC,KAAmB,KAAK,CAAC,QAAiB;QAChD,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAc,kBAAkB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;QACzF,IAAI,QAAQ,EAAE;YACZ,EAAE,CAAC,QAAQ,GAAG,QAAQ,CAAA;SACvB;QACD,EAAE,CAAC,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAA;QACtC,OAAO,EAAE,CAAA;KACV,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,SAAS,CAAC,IAAI,CAAW,kBAAkB,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAA;AAClE,SAAS,CAAC,IAAI,CAA4B,kBAAkB,CAAC,eAAe,CAAC,CAAC,SAAS,CAAW,CAAC,OAA2B;IAC5H,OAAO,CAAC,IAAY;QAClB,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAW,kBAAkB,CAAC,QAAQ,CAAC,CAAA;QAC7E,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAA;QACtB,OAAO,QAAQ,CAAA;KAChB,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,SAAS,CAAC,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,gBAAgB,EAAE,CAAA;AACjG,SAAS,CAAC,IAAI,CAAkB,kBAAkB,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,gBAAgB,EAAE,CAAA;AAC1G,SAAS,CAAC,IAAI,CAAQ,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,gBAAgB,EAAE,CAAA;AAE5E,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAA;AAElD,kBAAkB,CAAC,SAAS,CAAC;;AC5B7B,MAAMY,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;AAC7D,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;AAC7F,MAAMC,UAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,QAAQ,CAAC,EAA0B,CAAA;AAE5E;MACa,SAAS;IAmBpB,YAAoB,IAAY,EAAE,IAAkB,EAAE,KAAe;QAZ9D,UAAK,GAAG,KAAK,CAAA;QAEb,SAAI,GAAG,KAAK,CAAA;QAEZ,qBAAgB,GAAG,KAAK,CAAA;;;QAIxB,cAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAK3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAC9B,IAAI,CAAC,OAAO,GAAG,KAAK,CAAA;QACpB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAA;QAC5C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAA;KACnD;IAEM,eAAe;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;KAClB;IAEM,wBAAwB;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;KAC9B;IAEM,cAAc;QACnB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAA;KAC7B;IAED,IAAI,MAAM;;QACR,MAAM,OAAO,GAAGA,UAAQ,CAAC,cAAc,CAAC,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,CAAC,EAAE,CAAC,CAAA;QAChE,qDACK,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,GACpB,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,KACvB,OAAO,EAAE,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,IACxD;KACF;IAED,IAAI,aAAa;;QACf,MAAM,OAAO,GAAGA,UAAQ,CAAC,cAAc,CAAC,MAAA,IAAI,CAAC,OAAO,0CAAE,aAAa,CAAC,EAAE,CAAC,CAAA;QAEvE,IAAI,OAAO,KAAK,IAAI,EAAE;YACpB,OAAO,IAAI,CAAC,MAAM,CAAA;SACnB;QAED,qDACK,MAAA,IAAI,CAAC,OAAO,0CAAE,aAAa,GAC3B,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,KACvB,OAAO,EAAE,OAAO,CAAC,OAAO,IACzB;KACF;CACF;SAEe,WAAW,CAAE,KAAuB,EAAE,IAAkB;IACtE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;;QAE7B,OAAO,IAAI,SAAS,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;KACjE;IAED,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,KAAK,CAAC,CAAA;IAEnF,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;QACvB,IAAI,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,UAAU,EAAE;YAClF,SAAQ;SACT;aAAM;YACL,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;SACxB;KACF;IAED,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,QAAQ,MAAK,KAAK,EAAE;;QAEtD,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAA;KACrB;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,WAAW,GAAG,EAAE,CAAA;AAEtB;SACgB,YAAY,CAAE,KAAc;;IAC1C,MAAAD,OAAK,CAAC,aAAa,+CAAnBA,OAAK,EAAiB,KAAK,CAAC,CAAA;IAE5B,IAAI,KAAK,CAAC,aAAa,IAAI,IAAI,EAAE;QAC/B,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAA;KACnC;IAED,MAAM,IAAI,GAAGC,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;IAC5D,IAAI,IAAI,EAAE;QACR,MAAM,QAAQ,GAAG;;YACf,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YAClC,MAAAD,OAAK,CAAC,eAAe,+CAArBA,OAAK,EAAmB,CAAC,EAAE,IAAI,CAAC,CAAA;YAChC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;SACtB,CAAA;QACD,IAAI,OAAOA,OAAK,CAAC,mBAAmB,KAAK,UAAU,EAAE;YACnD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;YAEvB,IACE,CAACA,OAAK,CAAC,cAAc,CAAC,IAAI,CAAC;gBAC3B,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC;iBAC1B,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAC9C;;gBAEAA,OAAK,CAAC,mBAAmB,CAAC;oBACxB,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE;wBACrB,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;wBACrC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;qBACzB;oBACD,QAAQ,EAAE,CAAA;iBACX,CAAC,CAAA;aACH;iBAAM;;gBAEL,CAAC,WAAW,CAAC,IAAI,MAAhB,WAAW,CAAC,IAAI,IAAM,EAAE,GAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;aAC1C;SACF;aAAM;YACL,QAAQ,EAAE,CAAA;SACX;KACF;AACH;;ACrJO,MAAM,SAAS,GAAG,OAAO,QAAQ,KAAK,WAAW,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAA;AACvE,MAAM,GAAG,GAAa,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAA;AACtD,MAAM,GAAG,GAAW,SAAS,GAAG,MAAM,GAAG,SAAS;;SCWzC,cAAc;;;;;;;;;;;;;IAa5B,MAAM,UAAU,GAAGE,SAAa,CAAC,GAAG,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IACjG,MAAM,GAAG,GAAG,UAAU,CAAC,YAAY,CAAC,QAAQ,CAAC,EAA0B,CAAA;IACvE,MAAM,qBAAqB,GAAG,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACzD,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,GAAG,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAA;IACtC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAA;IACZ,MAAMC,WAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAA;IAElD,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACrB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,CAAC,WAAW,CAACA,WAAS,CAAC,CAAA;IAC3BA,WAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IAE1B,GAAG,CAAC,eAAe,GAAG,IAAI,CAAA;IAC1B,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,GAAG,CAAC,WAAW,GAAG,WAAW,CAAA;IAE7B,OAAO,GAAG,CAAA;AACZ,CAAC;MAEYF,UAAQ,IAAI,SAAS,GAAG,GAAG,GAAG,cAAc,EAAE;;AClD3D,MAAM,OAAO,GAAG,WAAW,CAAA;AAC3B,MAAM,IAAI,GAAG,wBAAwB,CAAA;AACrC,MAAM,MAAM,GAAG,yFAAyF,CAAA;MAE3F,SAAS,GAAG,SAAS,GAAG,GAAG,CAAC,SAAS,GAAG;IACnD,WAAW,EAAE,SAAS;IACtB,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,OAAO,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM;IAC3D,aAAa,EAAE,IAAI;IACnB,SAAS,EAAE,EAAE;IACb,MAAM,EAAE,IAAI;IACZ,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,MAAM;IACf,UAAU,EAAE,UAAU;IACtB,SAAS,EAAE,eAAe,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM;IAClE,MAAM,EAAE,QAAQ;IAChB,SAAS,EAAE,EAAE;;;ACnBf;IACW,IAAG;AAEd,CAAC;IACC,IAAI,QAAQ,CAAA;IACZ,IAAI,CAAC,OAAO,WAAW,KAAK,WAAW,IAAI,WAAW,KAAK,IAAI,KAAK,WAAW,CAAC,GAAG,EAAE;QACnF,GAAG,GAAG;YACJ,OAAO,WAAW,CAAC,GAAG,EAAE,CAAA;SACzB,CAAA;KACF;SAAM,IAAI,IAAI,CAAC,GAAG,EAAE;QACnB,GAAG,GAAG;YACJ,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAA;SAC7B,CAAA;QACD,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;KACtB;SAAM;QACL,GAAG,GAAG;YACJ,OAAO,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,QAAQ,CAAA;SACvC,CAAA;QACD,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAA;KAChC;AACH,CAAC,GAAG,CAAA;AAEJ,IAAI,QAAQ,GAAG,CAAC,CAAA;AAEhB;AACA;IACI,GAAG,GAAG,OAAO,qBAAqB,KAAK,WAAW,IAAI,qBAAqB,KAAK,IAAI,GAAG,qBAAqB,GAAG,UAAU,QAAQ;IACnI,MAAM,IAAI,GAAG,GAAG,EAAE,CAAA;IAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,EAAE,IAAI,CAAC,CAAA;IAC9C,OAAO,UAAU,CAAC,cAAc,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAA,EAAE,EAAE,QAAQ,GAAG,IAAI,CAAC,CAAA;AACnF,EAAC;IAEG,GAAG,GAAG,OAAO,oBAAoB,KAAK,WAAW,IAAI,oBAAoB,KAAK,IAAI,GAAG,oBAAoB,GAAG,aAAY;AAE5H,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IACjC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACtB,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;;;SCjCR,gBAAgB,CAAE,OAAoB;IACpD,OAAO,OAAO,CAAC,KAAK,CAAA;AACtB;;MCEaG,QAAM,GAAG,SAAS,GAAG,GAAG,GAAG;IACtC,SAAS;cACTH,UAAQ;EACT;AAED,IAAI,CAAC,SAAS,EAAE;IACd,MAAM,gBAAgB,GAAG;QACvB,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,IAAI,GAAG,CAAC;QAC5C,GAAG,MAAM,CAAC,qBAAqB,CAAC,MAAM,IAAI,GAAG,CAAC;KAC/C,CAAA;IAED,gBAAgB,CAAC,OAAO,CAAC,QAAQ;QAC/B,IAAI,QAAQ,KAAK,MAAM;YAAE,OAAM;QAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAACG,QAAM,EAAE,QAAQ,CAAC,EAAE;YAC3DA,QAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAA;SACpC;KACF,CAAC,CAAA;CACH;AAED,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;IACxDA,QAAc,CAAC,qBAAqB,GAAG,GAAG,CAAC;IAC3CA,QAAc,CAAC,oBAAoB,GAAG,GAAG,CAAC;IAC1CA,QAAc,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IACnDA,QAAc,CAAC,gBAAgB,GAAG,eAAc,CAAC;IACjDA,QAAc,CAAC,mBAAmB,GAAG,eAAc,CAAA;IACpD,IAAI,EAAE,IAAI,IAAIA,QAAM,CAAC,EAAE;QACpBA,QAAc,CAAC,IAAI,GAAG,IAAI,CAAA;KAC5B;IACD,IAAI,EAAE,WAAW,IAAIA,QAAM,CAAC,EAAE;QAC3BA,QAAc,CAAC,UAAU,GAAG,UAAU,CAAA;KACxC;;;MCpBU,OAAO,GAAY;IAC9B,GAAG,EAAE,IAAI;IACT,MAAM,EAAE,IAAI;IACZ,IAAI,EAAE,IAAI;EACX;MAEY,kBAAkB,GAAG,MAAM;;MCP3B,MAAM;IAIjB,YAAa,IAAK;QAChB,IAAI,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,CAAC,SAAS,EAAE;YACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;SAChC;aAAM;YACL,IAAI,CAAC,SAAS,GAAG,EAAE,CAAA;SACpB;KACF;IAQD,EAAE,CAAE,SAAS,EAAE,QAAQ,EAAE,OAAO;QAC9B,IAAI,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAA;QAC3B,IAAI,CAAC,QAAQ,EAAE;YACb,OAAO,IAAI,CAAA;SACZ;QACD,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,CAAC,SAAS,KAAd,IAAI,CAAC,SAAS,GAAK,EAAE,EAAA;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAA;QAC5B,QAAQ,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG;YAClC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAA;YACrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;YACtB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YACxB,KAAK,CAAC,KAAK,CAAC,GAAG;gBACb,IAAI;gBACJ,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI;aAC9B,CAAA;SACF;QACD,OAAO,IAAI,CAAA;KACZ;IAED,IAAI,CAAE,MAAM,EAAE,QAAQ,EAAE,OAAO;QAC7B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI;YACtB,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YAC1B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;SACnC,CAAA;QAED,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;QAEjC,OAAO,IAAI,CAAA;KACZ;IAED,GAAG,CAAE,MAAM,EAAE,QAAQ,EAAE,OAAO;QAC5B,IAAI,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,CAAA;QACrC,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAA;SACZ;QACD,IAAI,EAAE,MAAM,IAAI,QAAQ,IAAI,OAAO,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC,SAAS,CAAA;YACrB,OAAO,IAAI,CAAA;SACZ;QACD,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzE,QAAQ,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG;YAC/B,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,IAAI,CAAC,IAAI,IAAI,EAAE,QAAQ,IAAI,OAAO,CAAC,EAAE;gBACnC,SAAQ;aACT;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,MAAM,IAAI,EAAE;gBAClC,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAA;gBAClB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAA;gBAClB,IAAI,CAAC,QAAQ,IAAI,EAAE,KAAK,QAAQ,MAAM,OAAO,IAAI,GAAG,KAAK,OAAO,CAAC,EAAE;oBACjE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;iBACxB;aACF;SACF;QACD,OAAO,IAAI,CAAA;KACZ;IAWD,OAAO,CAAE,MAAM;QACb,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAA;QAC5B,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAA;SACZ;QACD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QACxC,QAAQ,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG;YAC/B,KAAK,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG;gBACzB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,MAAM,IAAI,EAAE;oBAClC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,CAAA;iBAChD;aACF;SACF;QACD,OAAO,IAAI,CAAA;KACZ;;AAtGM,oBAAa,GAAG,KAAK,CAAA;AA2G9B,MAAMJ,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;MACvD,WAAW,GAAGA,OAAK,CAAC,cAAc,CAAC,MAAM,EAAC;AAChD,SAAS,CAAC,IAAI,CAAS,kBAAkB,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,WAAW,CAAC;;AC/HnF;AAmBA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;AAC7C,MAAM,MAAM,GAAG,WAAW,EAAE,CAAA;AAC5B,MAAMA,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;SAE7C,kBAAkB,CAAE,IAAyB,EAAE,EAAU;;IACvE,MAAAA,OAAK,CAAC,iBAAiB,+CAAvBA,OAAK,EAAqB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;IAClD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;AACzB,CAAC;SAEe,eAAe,CAAE,EAAU;IACzC,OAAO,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;AAC1B,CAAC;SAEe,eAAe,CAAE,IAAa;IAC5C,IAAI,IAAI,IAAI,IAAI,EAAE;QAChB,OAAO,EAAE,CAAA;KACV;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;AACnD,CAAC;SAEe,WAAW,CAAE,IAAY,EAAE,SAA6B,EAAE,GAAG,IAAe;IAC1F,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAEpC,IAAI,QAAQ,IAAI,IAAI,EAAE;QACpB,OAAM;KACP;IAED,MAAM,IAAI,GAAGA,OAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;IAEpD,IAAIZ,SAAO,CAAC,IAAI,CAAC,EAAE;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;QACpD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAA;KACd;IAED,IAAI,CAACW,YAAU,CAAC,IAAI,CAAC,EAAE;QACrB,OAAM;KACP;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AACnC,CAAC;SAEe,SAAS,CAAE,GAA6B;IACtD,IAAI,GAAG,IAAI,IAAI,EAAE;QACf,OAAO,EAAE,CAAA;KACV;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG;QACpC,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;KAC5B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACZ,OAAO,IAAI,KAAK,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;AACxC,CAAC;SAEe,OAAO,CAAE,EAAU,EAAE,OAAiC;IACpE,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,IAAI,CAAC,SAAS,EAAE;QACd,IAAI,GAAG,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;KAC/B;IACD,OAAO,IAAI,CAAA;AACb,CAAC;SAEe,kBAAkB,CAAE,IAAY;IAC9C,OAAO,IAAI,GAAG,GAAG,GAAG,SAAS,CAAA;AAC/B,CAAC;SAEe,iBAAiB,CAAE,IAAY;IAC7C,OAAO,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAA;AAC9B,CAAC;SAEe,iBAAiB,CAAE,IAAY;IAC7C,OAAO,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAA;AAC9B,CAAC;SAEe,gBAAgB,CAAE,SAAc,EAAE,QAAiB,EAAE,IAA8B,EAAE,UAAuB;;IAC1H,MAAM,EAAE,GAAG,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,aAAa,MAAM,EAAE,EAAE,CAAA;;IAE9C,IAAI,WAAW,GAA2B,IAAI,CAAA;IAE9C,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,IAAI,gBAAgB,GAAmB,EAAE,CAAA;IAEzC,MAAM,MAAM,GAAiB;QAC3B,MAAM,CAAoB,OAAO,EAAE,EAAS;YAC1C,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;YAErB,OAAO,CAAC,IAAI,GAAG,IAAW,CAAA;YAC1B,IAAI,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAA;YAC9B,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;;YAGnC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;;YAErC,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;gBAC5B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;aAC9C;YAED,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAA;YACxE,OAAO,CAAC,MAAM,GAAG;gBACf,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC;gBAC7B,OAAO,EAAE,kBAAkB,CAAC,EAAE,CAAC;gBAC/B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;gBAC7B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;aAC9B,CAAA;YAED,MAAM,KAAK,GAAG;gBACZ,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE;oBAC7C,WAAW,GAAGE,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,SAAS,CAAC,CAAA;oBAEtE,MAAM,CAAC,WAAW,KAAK,IAAI,EAAE,WAAW,CAAC,CAAA;oBACzC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;oBACvD,IAAI,CAAC,SAAS,EAAE;wBACd,WAAW,CAAC,GAAG,GAAG,IAAI,CAAA;wBACtB,WAAW,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;qBACpC;iBACF,CAAC,CAAA;aACH,CAAA;YACD,IAAI,UAAU,EAAE;gBACd,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;aAC7B;iBAAM;gBACL,KAAK,EAAE,CAAA;aACR;SACF;QACD,OAAO;YACL,GAAG,CAAC;gBACF,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAA;aAC5C,CAAC,CAAA;YAEF,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;YACtC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAA;SAC3B;QACD,QAAQ;YACN,UAAU,GAAG,IAAI,CAAA;YACjB,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,SAAS,EAAE;gBACpC,UAAU,GAAG,KAAK,CAAA;gBAClB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAChC,IAAI,WAAW,EAAE;oBACf,WAAW,CAAC,GAAG,GAAG,IAAI,CAAA;iBACvB;gBACD,IAAI,gBAAgB,CAAC,MAAM,EAAE;oBAC3B,gBAAgB,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;oBACpC,gBAAgB,GAAG,EAAE,CAAA;iBACtB;aACF,CAAC,CAAA;SACH;QACD,MAAM;YACJ,OAAO,CAAC,IAAI,GAAG,IAAW,CAAA;YAC1B,IAAI,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAA;YACxE,OAAO,CAAC,MAAM,GAAG;gBACf,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC;gBAC7B,OAAO,EAAE,kBAAkB,CAAC,EAAE,CAAC;gBAC/B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;gBAC7B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;aAC9B,CAAA;YAED,GAAG,CAAC;gBACF,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAA;aAC3C,CAAC,CAAA;YAEF,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;SACtC;QACD,MAAM;YACJ,OAAO,CAAC,IAAI,GAAG,IAAI,CAAA;YACnB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAA;YACrB,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;YACrC,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAA;SAC3C;QACD,iBAAiB;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAA;SACxD;QACD,aAAa;YACX,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,eAAe,CAAC,CAAA;SACpD;QACD,YAAY,CAAE,OAAO;YACnB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;SAC5D;QACD,QAAQ,CAAE,OAAO;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,CAAA;SACxD;QACD,YAAY,CAAE,OAAO;YACnB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;SAC5D;QACD,YAAY;YACV,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAA;SACnD;QACD,iBAAiB;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAA;SACxD;QACD,cAAc;YACZ,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAA;SACrD;QACD,eAAe;YACb,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAA;SACtD;QACD,gBAAgB;YACd,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAA;SACvD;KACF,CAAA;;IAGD,IAAI,SAAS,CAAC,iBAAiB;SAC3B,MAAA,SAAS,CAAC,SAAS,0CAAE,iBAAiB,CAAA;QACtC,SAAS,CAAC,qBAAqB,EAAE;QACnC,MAAM,CAAC,iBAAiB,GAAG,UAAU,OAAO;YAC1C,MAAM,MAAM,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAA;YAC9B,IAAI,MAAM,IAAI,IAAI,EAAE;gBAClB,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAA;gBACpB,MAAM,OAAO,GAAGA,UAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;gBAC3C,IAAI,OAAO,IAAI,IAAI,EAAE;oBACnB,OAAO,CAAC,MAAO,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAA;iBAC1C;aACF;YACD,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAA;SACjE,CAAA;KACF;IACD,IAAI,SAAS,CAAC,eAAe;SACzB,MAAA,SAAS,CAAC,SAAS,0CAAE,eAAe,CAAA;QACpC,SAAS,CAAC,mBAAmB,EAAE;QACjC,MAAM,CAAC,eAAe,GAAG;YACvB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAA;SACtD,CAAA;KACF;IAED,MAAM,CAAC,EAAE,GAAG,YAAY,CAAA;IAExB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;QACtB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;KACnB;IAED,IAAI,SAAS,EAAE;QACb,MAAM,CAAC,IAAI,GAAG,EAAE,CAAA;KACjB;IAED,OAAO,MAAM,CAAA;AACf,CAAC;SAEe,qBAAqB,CAAE,SAA+B,EAAE,aAAsB,EAAE,IAA8B;;IAC5H,MAAM,EAAE,GAAG,aAAa,aAAb,aAAa,cAAb,aAAa,GAAI,kBAAkB,MAAM,EAAE,EAAE,CAAA;IACxD,IAAI,gBAAgB,GAA2B,IAAI,CAAA;IAEnD,MAAM,MAAM,GAAQ;QAClB,QAAQ;;YACN,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAA,MAAA,IAAI,CAAC,SAAS,+CAAd,IAAI,CAAc,KAAI,MAAM,EAAE,EAAE,CAAC,CAAA;YAChE,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,EAAE;gBACnC,gBAAgB,GAAGA,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,CAAA;gBACjE,MAAM,CAAC,gBAAgB,KAAK,IAAI,EAAE,WAAW,CAAC,CAAA;gBAC9C,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;gBAC3B,IAAI,CAAC,SAAS,EAAE;oBACd,gBAAgB,CAAC,GAAG,GAAG,IAAI,CAAA;oBAC3B,gBAAgB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;iBACrC;aACF,CAAC,CAAA;SACH;QACD,QAAQ;YACN,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;YAClD,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,EAAE;gBAC1B,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACtB,IAAI,gBAAgB,EAAE;oBACpB,gBAAgB,CAAC,GAAG,GAAG,IAAI,CAAA;iBAC5B;aACF,CAAC,CAAA;SACH;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;IACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;QACtB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;KACnB;IAED,MAAM,CAAC,SAAS,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,SAAS,CAAC,mCAAI,SAAS,CAAA;IACvD,MAAM,CAAC,iBAAiB,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,iBAAiB,CAAC,mCAAI,SAAS,CAAA;IACvE,MAAM,CAAC,WAAW,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,WAAW,CAAC,mCAAI,SAAS,CAAA;IAC3D,OAAO,MAAM,CAAA;AACf,CAAC;SAEe,8BAA8B,CAAE,aAAsB;IACpE,OAAO;QACL,UAAU,EAAE;YACV,CAAC,EAAE;gBACD,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE;oBACL,uBAAsB,MAAM;iBAC7B;aACF;YACD,CAAC,EAAE;gBACD,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE,EAAE;aACV;SACF;QACD,OAAO,EAAE;YACP,cAAc,EAAE,IAAI;YACpB,WAAW,EAAE,aAAa,KAAK,gBAAgB;SAChD;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;AACH;;AC5SA,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;AAE7D,SAAS,gBAAgB,CAAE,CAAe,EAAE,SAAS;;IACnD,OAAOF,YAAU,CAAC,SAAS,CAAC,MAAM,CAAC;QACnC,CAAC,EAAC,MAAA,SAAS,CAAC,SAAS,0CAAE,gBAAgB,CAAA;QACvC,SAAS,CAAC,SAAS,YAAY,CAAC,CAAC,SAAS,CAAA;AAC5C,CAAC;AAED;AACO,IAAI,CAAC,GAAiB,SAAS,CAAA;AAC/B,IAAI,WAAW,GAA0B,SAAS,CAAA;SAEzC,gBAAgB,CAC9B,CAAe,EACf,EAAU;IAEV,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,CAAA;IACzB,OAAO,CAAC,SAA6B;;QAEnC,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QAEvD,MAAM,MAAM,GAAG,CAAC,IAAe,KAAK,IAAI,IAAI,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QACxE,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG;YAChD,YAAY,EAAE,MAAM;;YAEpB,sBAAsB,EAAE,MAAM;SAC/B,CAAA;QAED,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,WAAW,GAAG,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;SAClC;QAED,OAAO,MAAM,IAAK,SAAQ,CAAC,CAAC,SAA2C;YAAhE;;gBACL,UAAK,GAAG;oBACN,QAAQ,EAAE,KAAK;iBAChB,CAAA;aAoCF;YAlCC,OAAO,wBAAwB,CAAE,KAAY;gBAC3C,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC5D,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;aAC1B;;;YAID,iBAAiB,CAAE,KAAY,EAAE,IAAqB;gBACpD,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC5D,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;aAC5E;YAED,MAAM;gBACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ;sBAChC,EAAE;sBACF,CAAC,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,kCAC/C,IAAI,CAAC,KAAK,GACV,IAAI,EACP,CAAC,CAAA;gBAEL,IAAI,SAAS,EAAE;oBACb,OAAO,CAAC,CACN,KAAK,EACL,EAAE,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,EAC9B,QAAQ,CACT,CAAA;iBACF;gBAED,OAAO,CAAC,CACN,MAAM,EACN,EAAE,EAAE,EAAE,EACN,QAAQ,CACT,CAAA;aACF;SACF,CAAA;KACF,CAAA;AACH,CAAC;AAED,IAAI,QAAQ,CAAA;AAIZ,SAASM,eAAa;IACpB,MAAM,YAAY,GAAG,UAAU,QAAQ,EAAE,SAAS;QAChD,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAA;QAClE,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAA;KAC3B,CAAA;IAED,MAAM,aAAa,GAAG,UAAU,KAAK;QACnC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;KAC1C,CAAA;IAED,MAAM,mBAAmB,GAAG,UAAU,EAAE;QACtC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAA;KACrC,CAAA;IAED,MAAM,iBAAiB,GAAG,UAAU,IAAI,EAAE,IAAI;QAC5C,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,OAAM;;;QAK1B,IAAI,aAAa,IAAI,IAAI;YAAE,OAAM;QAEjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI;YAC5B,IAAIN,YAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;aACzC;iBAAM;gBACL,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;aACpD;SACF,CAAC,CAAA;KACH,CAAA;IAED,KAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IACjC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;IACnC,KAAK,CAAC,mBAAmB,GAAG,mBAAmB,CAAA;IAC/C,KAAK,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;IAE3C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,KAAK,CAAC,uBAAuB,GAAG,CAC9B,EAAwE,EACxE,CAAC,EACD,CAAe,EACf,aAAa;YAEb,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;YAEhD,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG;gBAC7B,MAAM,QAAQ,qBAA0B,KAAK,CAAE,CAAA;gBAC/C,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;oBAC7C,YAAY,EAAE,GAAG;;oBAEjB,sBAAsB,EAAE,GAAG;iBAC5B,CAAA;gBAED,OAAO,CAAC,CAAC,aAAa,CACpB,aAAa,IAAI,sBAAsB,EACvC,IAAI,EACJ,CAAC,CAAC,aAAa,CAAC,EAAE,kCACb,QAAQ,GACR,IAAI,EACP,CACH,CAAA;aACF,CAAC,CAAA;SACH,CAAA;QAED,KAAK,CAAC,UAAU,GAAG,CAAC,IAAI;YACtB,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;SAClC,CAAA;KACF;AACH,CAAC;AAED,MAAM,SAAS,GAAG,WAAW,EAAE,CAAA;SAEf,cAAc,CAAE,GAAyB,EAAE,KAAmB,EAAE,QAAQ,EAAE,MAAiB;IACzG,CAAC,GAAG,KAAK,CAAA;IACT,QAAQ,GAAG,QAAQ,CAAA;IACnB,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,kEAAkE,CAAC,CAAA;IAEtF,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,EAAoB,CAAA;IAC3C,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAEjDM,eAAa,EAAE,CAAA;IACf,MAAM,UAAW,SAAQ,CAAC,CAAC,SAAS;QAApC;;;YAEU,UAAK,GAA+B,EAAE,CAAA;YACtC,aAAQ,GAAyB,EAAE,CAAA;SAuC5C;QArCQ,KAAK,CAAE,SAA0C,EAAE,EAAU,EAAE,EAAc;YAClF,MAAM,GAAG,GAAG,EAAE,GAAG,SAAS,EAAE,CAAA;YAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,aAAa,CAAC,SAAS,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;YAC/D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrB,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACrB;QAEM,OAAO,CAAE,EAAU,EAAE,EAAc;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;gBAChC,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,EAAE,EAAE;oBAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;oBAC1B,MAAK;iBACN;aACF;YAED,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACrB;QAEM,MAAM;YACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAA;gBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;aAC3B;YAED,IAAI,KAAK,GAA4B,IAAI,CAAA;YAEzC,IAAI,gBAAgB,EAAE;gBACpB,KAAK,GAAG,EAAE,GAAG,EAAE,CAAA;aAChB;YAED,OAAO,CAAC,CAAC,aAAa,CACpB,GAAG,EACH,KAAK,EACL,SAAS,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CACxF,CAAA;SACF;KACF;IAED,IAAI,OAAmB,CAAA;IACvB,IAAI,CAAC,SAAS,EAAE;;QAEd,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,EAAEJ,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAA;KACvF;IAED,MAAM,GAAG,GAAgB,MAAM,CAAC,MAAM,CAAC;QACrC,MAAM,CAAE,EAAc;YACpB,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACxB;QAED,KAAK,CAAE,SAA6B,EAAE,EAAU,EAAE,EAAc;YAC9D,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC/C,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;SAC5B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;SACxB;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;;;oBAGb,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,EAAEA,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAA;iBACvF;gBACD,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;;;gBAIvB,IAAI,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,cAAc,EAAE;oBACvB,MAAM,UAAU,GAAG,GAAG,CAAC,cAAc,CAAA;oBACrC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACpC,MAAM,WAAW,GAAG,MAAM,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAA;oBAChE,IAAI,CAAC,OAAO,CAAC,GAAG;wBACd,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE;4BAC/B,YAAY,EAAE,IAAI;4BAClB,UAAU,EAAE,IAAI;4BAChB,GAAG;gCACD,OAAO,UAAU,CAAC,GAAG,CAAC,CAAA;6BACvB;4BACD,GAAG,CAAE,KAAK;gCACR,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;6BACxB;yBACF,CAAC,CAAA;qBACH,CAAC,CAAA;oBACF,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;iBAC3C;gBACD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;gBAEf,IAAI,GAAG,IAAI,IAAI,IAAIF,YAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3C,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;iBACtB;aACF;SACF;QAED,MAAM,EAAE;YACN,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAO;gBACZ,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE;oBACnD,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;iBAC9B;;gBAGD,cAAc,CAAC,QAAQ,CAAC,CAAA;aACzB;SACF;QAED,MAAM,EAAE;YACN,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAgB;gBACrB,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE;oBACnD,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;iBAC9B;;gBAGD,cAAc,CAAC,QAAQ,CAAC,CAAA;aACzB;SACF;QAED,cAAc,EAAE;YACd,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,GAAY;gBACjB,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE;oBACjD,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAA;iBACxB;aACF;SACF;KACF,CAAC,CAAA;IAEF,SAAS,cAAc,CAAE,SAAS;QAChC,MAAM,QAAQ,GAAG,eAAe,CAAC,YAAY,CAAC,CAAA;QAC9C,IAAI,QAAQ,EAAE;YACZ,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;YACvB,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;YACpD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;aAClC;SACF;KACF;IAED,OAAO,CAAC,GAAG,GAAG,GAAG,CAAA;IACjB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB,CAAC;AAED,MAAM,eAAe,GAAG,WAAW,EAAE,CAAA;AAErC,SAAS,wBAAwB,CAAE,CAAe,EAAE,QAAQ;IAa1D,MAAM,sBAAuB,SAAQ,CAAC,CAAC,SAA0C;QAAjF;;YACE,SAAI,GAAG,CAAC,CAAC,SAAS,EAAmB,CAAA;YACrC,QAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAA;SAoB1B;QAlBC,iBAAiB;YACf,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAA;YACzB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAQ,CAAA;YACtC,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;YAC1B,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;SAChC;QAED,MAAM;YACJ,QACE,CAAC,CAAC,aAAa,CACb,MAAM,EACN;gBACE,GAAG,EAAE,IAAI,CAAC,IAAI;aACf,EACD,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CACrC,EACF;SACF;KACF;IAED,MAAM,KAAM,SAAQ,CAAC,CAAC,SAAwC;QAA9D;;YACE,UAAK,GAAgB;gBACnB,UAAU,EAAE,EAAE;aACf,CAAA;SA2CF;QAzCC,iBAAiB;YACf,OAAO,CAAC,GAAG,GAAG,IAAI,CAAA;SACnB;QAED,KAAK,CAAE,SAAS,EAAE,MAAM,EAAE,MAAM;YAC9B,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;YACvD,MAAM,MAAM,GAAG,CAAC,IAAe,KAAK,IAAI,IAAI,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC5E,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG;gBAChD,YAAY,EAAE,MAAM;gBACpB,sBAAsB,EAAE,MAAM;aAC/B,CAAA;YACD,MAAM,IAAI,GAAG;gBACX,MAAM;gBACN,OAAO,EAAE,CAAC,CAAC,aAAa,CAAC,sBAAsB,EAAE;oBAC/C,GAAG,EAAE,MAAM;oBACX,MAAM;oBACN,eAAe,CAAE,GAAG;wBAClB,OAAO,CAAC,CAAC,aAAa,CAAC,SAAS,kCAAO,CAAC,GAAG,CAAC,IAAI,KAAR,GAAG,CAAC,IAAI,GAAK,EAAE,GAAE,KAAK,GAAK,IAAI,EAAG,CAAA;qBAC3E;iBACF,CAAC;aACH,CAAA;YACD,IAAI,CAAC,QAAQ,CAAC;gBACZ,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC;aAC7C,CAAC,CAAA;SACH;QAED,OAAO,CAAE,MAAM;YACb,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAA;YACxC,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAA;YAClE,MAAM,IAAI,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA;YAC5E,IAAI,CAAC,QAAQ,CAAC;gBACZ,UAAU,EAAE,IAAI;aACjB,CAAC,CAAA;SACH;QAED,MAAM;YACJ,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAA;YACxC,QACE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC,EACzC;SACF;KACF;IAEDM,eAAa,EAAE,CAAA;IAEf,MAAM,GAAG,GAAGJ,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAA;IAE1C,QAAQ,CAAC,MAAM,CACb,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,EAC1B,GAAG,CACJ,CAAA;AACH,CAAC;SAEe,2BAA2B,CAAE,SAAS,EAAE,KAAmB,EAAE,QAAQ,EAAE,eAAe;IACpG,CAAC,GAAG,KAAK,CAAA;IACT,QAAQ,GAAG,QAAQ,CAAA;IAEnB,MAAM,MAAM,GAAG;QACb,UAAU,EAAE;YACV,KAAK,EAAE;gBACL,IAAI,EAAE,IAAI;gBACV,KAAK,EAAE,IAAI;gBACX,QAAQ,CAAE,OAAO,EAAE,MAAM;oBACvB,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,CAAA;iBACvC;aACF;SACF;QACD,OAAO;YACL,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;gBAChB,wBAAwB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF;QACD,QAAQ;YACN,UAAU,EAAE,CAAA;YACZ,IAAI,CAAC,MAAM,GAAG,eAAe,EAAE,CAAA;YAC/B,IAAI,CAAC,MAAM,GAAG,eAAe,CAAA;YAC7B,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAA;SACxD;QACD,KAAK;YACH,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;SACpC;QACD,QAAQ;YACN,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SACnC;QACD,aAAa,EAAE;YACb,IAAI;gBACF,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;aACnC;YACD,IAAI;gBACF,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;aACnC;SACF;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;IAED,SAAS,UAAU;QACjB,MAAM,KAAK,GAAG,eAAe,EAAE,CAAA;QAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW;YAAE,OAAM;QAExC,OAAO,CAAC,IAAI,GAAG,WAAW,CAAA;QAE1B,MAAM,KAAK,GAAI,WAAmB,CAAC,KAAK,IAAK,WAAmB,CAAC,SAAS,CAAA;QAC1E,MAAM,MAAM,GAAG;YACb,MAAM,EAAE,WAAW,CAAC,OAAO,IAAI,EAAE;YACjC,IAAI,EAAE,eAAe,CAAC,KAAK,CAAC;YAC5B,OAAO,EAAE,EAAE;YACX,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,EAAE;SACX,CAAA;QACD,OAAO,CAAC,MAAM,GAAG,MAAM,CAAA;QAEvB,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE;;YAExB,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,EAAE;gBAC5C,UAAU,EAAE,IAAI;gBAChB,YAAY,EAAE,IAAI;gBAClB,GAAG;oBACD,OAAO,IAAI,CAAC,aAAa,CAAA;iBAC1B;gBACD,GAAG,CAAE,KAAK;oBACR,MAAM,CAAC,MAAM,GAAG,KAAK,CAAA;oBACrB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAA;iBAC3B;aACF,CAAC,CAAA;SACH;KACF;IAED,OAAO,MAAM,CAAA;AACf;;SC7fgB,cAAc,CAAE,GAAmB,EAAE,EAAU;IAC7D,OAAO,CAAC,SAAoC;QAC1C,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;YAC9B,KAAK,EAAE;gBACL,GAAG,EAAE,MAAM;aACZ;YACD,MAAM,EAAE,CAAC,SAAS,EAAE;oBAClB,OAAO;wBACL,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;qBAC7B;iBACF,CAAC;SACH,CAAC,CAAA;QAEF,MAAM,OAAO,GAA8B;YACzC,MAAM,CAAE,CAAC;gBACP,OAAO,CAAC,CACN,SAAS,GAAG,KAAK,GAAG,MAAM,EAC1B;oBACE,KAAK,EAAE;wBACL,EAAE;wBACF,KAAK,EAAE,SAAS,GAAG,WAAW,GAAG,EAAE;qBACpC;iBACF,EACD;oBACE,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;iBACxC,CACF,CAAA;aACF;SACF,CAAA;QAED,OAAO,OAAO,CAAA;KACf,CAAA;AACH,CAAC;AAED,SAASI,eAAa;IACpB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAE7D,MAAM,iBAAiB,GAAG,UAAU,GAAG,EAAE,aAAa;;QAEpD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAA;QACvB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EAAE;YAC3E,GAAG,CAAC,YAAY,CAAC,aAAa,EAAE,KAAK,CAAC,CAAA;YACtC,OAAO,IAAI,CAAA;SACZ;KACF,CAAA;IAED,MAAM,YAAY,GAAG,UAAU,QAAQ,EAAE,SAAS;QAChD,OAAO,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;KACpC,CAAA;IAED,KAAK,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;IAC3C,KAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IAEjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,KAAK,CAAC,uBAAuB,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,GAAmB;YAC5D,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;gBAC9B,KAAK,EAAE;oBACL,GAAG,EAAE,MAAM;iBACZ;gBACD,MAAM,EAAE,CAAC,EAA2B,EAAE;wBACpC,OAAO;4BACL,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;yBAC/B;qBACF,CAAC;aACH,CAAC,CAAA;YAEF,MAAM,OAAO,GAA0B;gBACrC,IAAI,EAAE,eAAe;gBACrB,MAAM,CAAE,CAAC;oBACP,OAAO,CAAC,CACN,sBAAsB,EACtB;wBACE,KAAK,EAAE,CAAC,UAAU,CAAC;qBACpB,EACD,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACvC,CAAA;iBACF;aACF,CAAA;YAED,OAAO,OAAO,CAAA;SACf,CAAA;QAED,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE;YACpB,OAAO,EAAE,CAAC,GAAU,CAAA;SACrB,CAAA;KACF;AACH,CAAC;AAED,IAAI,GAAG,CAAA;SAES,YAAY,CAAE,GAA8B,EAAE,GAAM,EAAE,MAAiB;IACrF,GAAG,GAAG,GAAG,CAAA;IACT,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,+CAA+C,CAAC,CAAA;IAE9DA,eAAa,EAAE,CAAA;IAEf,GAAG,CAAC,MAAM,CAAC,eAAe,GAAG,IAAI,CAAA;IAEjC,MAAM,QAAQ,GAAY,EAAE,CAAA;IAC5B,MAAM,KAAK,GAA2C,EAAE,CAAA;IACxD,IAAI,WAA2B,CAAA;IAE/B,MAAM,OAAO,GAAG,IAAK,GAAsB,CAAC;QAC1C,MAAM,CAAE,CAAC;YACP,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;gBACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;aACvB;YACD,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;SAChD;QACD,OAAO,EAAE;YACP,KAAK,CAAE,SAAoC,EAAE,EAAU,EAAE,EAAc;gBACrE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;gBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;aACpB;YACD,UAAU,CAAqB,EAAc;gBAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,KAAkB,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;gBACrF,EAAE,EAAE,CAAA;aACL;YACD,OAAO,CAAE,EAAU,EAAE,EAAc;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACxC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;oBAC3B,IAAI,OAAO,CAAC,GAAG,KAAK,EAAE,EAAE;wBACtB,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;wBACrB,MAAK;qBACN;iBACF;gBAED,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;aACpB;SACF;KACF,CAAC,CAAA;IACF,IAAI,CAAC,SAAS,EAAE;QACd,OAAO,CAAC,MAAM,CAACJ,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAQ,CAAC,CAAA;KACtD;IACD,MAAM,GAAG,GAAgB,MAAM,CAAC,MAAM,CAAC;QACrC,KAAK,CAAE,SAAoC,EAAE,EAAU,EAAE,EAAc;YACrE,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC/C,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;SAC5B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;SACxB;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;;oBAEb,OAAO,CAAC,MAAM,CAACA,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAQ,CAAC,CAAA;iBACtD;gBACD,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,GAAqB,CAAA;gBACjD,IAAI,WAAW,IAAI,IAAI,IAAIF,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;oBACpE,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACzD;aACF;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,WAAW,IAAI,IAAI,IAAIA,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClE,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACvD;aACF;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,IAAI,WAAW,IAAI,IAAI,IAAIA,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClE,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACvD;aACF;SACF;KACF,CAAC,CAAA;IAEF,OAAO,CAAC,GAAG,GAAG,GAAG,CAAA;IAEjB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB;;ACtMA,SAAS,cAAc,CAAE,CAAuB,EAAE,EAAU;IAC1D,OAAO,UAAU,SAAS;;QACxB,MAAM,MAAM,GAAG;YACb,KAAK,EAAE;gBACL,GAAG,EAAE,MAAM;aACZ;YACD,OAAO;gBACL,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;;gBAE5B,IAAI,CAAC,SAAS,CAAC;oBACb,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;iBAC1B,CAAC,CAAA;aACH;SACF,CAAA;QAED,IAAIX,SAAO,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;YAC7B,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAA;YAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;YAC7B,IAAI,EAAC,MAAA,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,0CAAE,GAAG,CAAA,EAAE;;gBAE3B,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;aAC9B;iBAAM;;gBAEL,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAA;aAC/B;SACF;aAAM;YACL,SAAS,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAA;SAC5B;QAED,OAAO,CAAC,CACN,SAAS,GAAG,KAAK,GAAG,MAAM,EAC1B;YACE,GAAG,EAAE,EAAE;YACP,EAAE;YACF,KAAK,EAAE,SAAS,GAAG,WAAW,GAAG,EAAE;SACpC,EACD;YACE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;gBAC9B,GAAG,EAAE,EAAE;aACR,CAAC;SACH,CACF,CAAA;KACF,CAAA;AACH,CAAC;AAED,SAAS,aAAa;IACpB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAE7D,MAAM,YAAY,GAAiB,UAAU,QAAQ,EAAE,SAAS;QAC9D,OAAO,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;KACpC,CAAA;IAED,MAAM,aAAa,GAAG,UAAU,KAAK;QACnC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;KAC1C,CAAA;IAED,KAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IACjC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;IAEnC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,KAAK,CAAC,uBAAuB,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,CAAuB;YACvE,MAAM,MAAM,GAAG;gBACb,KAAK,EAAE;oBACL,GAAG,EAAE,MAAM;iBACZ;gBACD,OAAO;oBACL,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;iBAC/B;aACF,CAAA;YAED,SAAS,CAAC,MAAM,GAAGA,SAAO,CAAC,SAAS,CAAC,MAAM,CAAC;kBACxC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;kBAC7B,CAAC,MAAM,CAAC,CAAA;YAEZ,OAAO;gBACL,MAAM;oBACJ,OAAO,CAAC,CACN,sBAAsB,EACtB;wBACE,KAAK,EAAE,UAAU;qBAClB,EACD,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACpC,CAAA;iBACF;aACF,CAAA;SACF,CAAA;QAED,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE;YACpB,OAAO,EAAE,CAAC,GAAU,CAAA;SACrB,CAAA;KACF;AACH,CAAC;SAEe,aAAa,CAAE,GAAqB,EAAE,CAAuB,EAAE,MAAc;IAC3F,IAAI,KAAK,GAAY,EAAE,CAAA;IACvB,IAAI,WAAoC,CAAA;IAExC,MAAM,CAAC,CAACW,YAAU,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,CAAA;IAErD,aAAa,EAAE,CAAA;IAEf,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG;QACtB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAA;KACrB,CAAA;IACD,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;KAChC;IACD,MAAM,SAAS,GAAgB,MAAM,CAAC,MAAM,CAAC;QAC3C,KAAK,CAAE,SAAoB,EAAE,EAAU,EAAE,EAAc;YACrD,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC7C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAChB,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAA;SAC3B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAA;YAC7C,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAA;SAC3B;QAED,iBAAiB,CAAE,EAA6B;YAC9C,WAAW,CAAC,YAAY,EAAE,CAAA;YAC1B,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;SAC1B;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;oBACb,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;iBAChC;gBACD,MAAM,QAAQ,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,QAAQ,CAAA;gBAChDA,YAAU,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aAC5D;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,MAAM,MAAM,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,MAAM,CAAA;gBAC5CA,YAAU,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aACxD;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,MAAM,MAAM,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,MAAM,CAAA;gBAC5CA,YAAU,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aACxD;SACF;KACF,CAAC,CAAA;IAEF,OAAO,CAAC,GAAG,GAAG,SAAS,CAAA;IAEvB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB;;ACtLA,MAAM,SAAS,GAAG,CAAC,SAA8B;IAC/C,OAAO,CAAC,EAAQ;QACd,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,YAAY,CAAC;;QAGzD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,KAAK,CAAC,OAAO,KAAK,EAAE;YAAE,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC;QAE7C,KAAK,CAAC,eAAe,CAAC;YACpB,IAAI,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,KAAK,GAAG,IAAI,CAAC;gBACb,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;aAC5B;YAED,IAAI,GAAG,IAAK,CAAC;;YAGb,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAS,KAAK,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;YAE1D,IAAIA,YAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;gBAC9B,IAAI,CAAC,SAAS,CAAS,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,CAAC;aACxD;iBAAM;gBACJ,IAAI,CAAC,SAAS,CAAS,GAAG;oBACzB,IAAK,IAAI,CAAC,SAAS,CAAS,IAAI,EAAE,CAAC;oBACnC,QAAQ;iBACT,CAAC;aACH;YAED,IAAI,KAAK,EAAE;gBACT,kBAAkB,CAAC,IAAK,EAAE,EAAE,CAAC,CAAC;aAC/B;YACD,OAAO;gBACL,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;gBACjC,MAAM,IAAI,GAAG,IAAK,CAAC,SAAS,CAAC,CAAC;gBAC9B,IAAI,IAAI,KAAK,QAAQ,EAAE;oBACpB,IAAK,CAAC,SAAS,CAAS,GAAG,SAAS,CAAC;iBACvC;qBAAM,IAAIX,SAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,IAAK,CAAC,SAAS,CAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,KAAK,QAAQ,CAAC,CAAC;iBACtE;aACF,CAAC;SACH,EAAE,EAAE,CAAC,CAAC;KACR,CAAC;AACJ,CAAC,CAAC;MAEW,UAAU,GAAG,SAAS,CAAC,kBAAkB,EAAE;MAE3C,UAAU,GAAG,SAAS,CAAC,kBAAkB,EAAE;MAE3C,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,EAAE;MAEpD,cAAc,GAAG,SAAS,CAAC,eAAe,EAAE;MAE5C,aAAa,GAAG,SAAS,CAAC,cAAc,EAAE;MAE1C,SAAS,GAAG,SAAS,CAAC,UAAU,EAAE;MAElC,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,EAAE;MAEpD,aAAa,GAAG,SAAS,CAAC,cAAc,EAAE;MAE1C,aAAa,GAAG,SAAS,CAAC,cAAc,EAAE;MAE1C,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,EAAE;MAEpD,gBAAgB,GAAG,SAAS,CAAC,iBAAiB,EAAE;MAEhD,gBAAgB,GAAG,SAAS,CAAC,iBAAiB,EAAE;MAEhD,iBAAiB,GAAG,SAAS,CAAC,kBAAkB,EAAE;MAElD,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE;MAEhC,SAAS,GAAG,CAAC,OAAO,GAAG,KAAK;IACvC,OAAO,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAC5E,EAAE;MAEW,QAAQ,GAAG,MAAM;;AChF9B,SAAS,kBAAkB,CAAE,IAAa;IACxC,IAAI,IAAI,IAAI,IAAI,EAAE;QAChB,OAAO,EAAE,CAAA;KACV;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;AACtD,CAAC;MAEY,QAAQ,GAAG,CAAC,EAAQ,EAAE,GAAyB;;IAC1D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;IAC7B,MAAM,SAAS,GAAG;QAChB,UAAU,CAAC;YACT,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAA;SAC1B,EAAE,CAAC,CAAC,CAAA;KACN,CAAA;IAED,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,IAAI,WAAW,GAA2B,IAAI,CAAA;QAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;QACpE,WAAW,GAAGa,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,CAAA;QAC5D,IAAI,WAAW,KAAK,IAAI,EAAE;YACxB,IAAI,SAAS,EAAE;;gBAEb,MAAA,MAAA,MAAA,WAAW,CAAC,UAAU,0CAAG,kBAAkB,CAAC,mDAAK,IAAI,CAAC;oBACpD,SAAS,EAAE,CAAA;iBACZ,CAAC,mCAAI,SAAS,EAAE,CAAA;aAClB;iBAAM;gBACL,WAAW,CAAC,qBAAqB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;aAC3C;SACF;aAAM;YACL,SAAS,EAAE,CAAA;SACZ;KACF;SAAM;QACL,SAAS,EAAE,CAAA;KACZ;AACH;;;;"} \ No newline at end of file +{"version":3,"file":"runtime.esm.js","sources":["../src/polyfill/reflect-metadata.js","../src/constants/identifiers.ts","../src/constants/index.ts","../src/utils/index.ts","../src/dom/event-target.ts","../src/hydrate.ts","../src/dom/event-source.ts","../src/interface/container.ts","../src/dom/node.ts","../src/dom/text.ts","../src/dom/style_properties.ts","../src/dom/style.ts","../src/dom/tree.ts","../src/dom/class-list.ts","../src/dom/element.ts","../../../node_modules/lodash-es/isArray.js","../../../node_modules/lodash-es/_freeGlobal.js","../../../node_modules/lodash-es/_root.js","../../../node_modules/lodash-es/_Symbol.js","../../../node_modules/lodash-es/_getRawTag.js","../../../node_modules/lodash-es/_objectToString.js","../../../node_modules/lodash-es/_baseGetTag.js","../../../node_modules/lodash-es/isObjectLike.js","../../../node_modules/lodash-es/isSymbol.js","../../../node_modules/lodash-es/_isKey.js","../../../node_modules/lodash-es/isObject.js","../../../node_modules/lodash-es/isFunction.js","../../../node_modules/lodash-es/_coreJsData.js","../../../node_modules/lodash-es/_isMasked.js","../../../node_modules/lodash-es/_toSource.js","../../../node_modules/lodash-es/_baseIsNative.js","../../../node_modules/lodash-es/_getValue.js","../../../node_modules/lodash-es/_getNative.js","../../../node_modules/lodash-es/_nativeCreate.js","../../../node_modules/lodash-es/_hashClear.js","../../../node_modules/lodash-es/_hashDelete.js","../../../node_modules/lodash-es/_hashGet.js","../../../node_modules/lodash-es/_hashHas.js","../../../node_modules/lodash-es/_hashSet.js","../../../node_modules/lodash-es/_Hash.js","../../../node_modules/lodash-es/_listCacheClear.js","../../../node_modules/lodash-es/eq.js","../../../node_modules/lodash-es/_assocIndexOf.js","../../../node_modules/lodash-es/_listCacheDelete.js","../../../node_modules/lodash-es/_listCacheGet.js","../../../node_modules/lodash-es/_listCacheHas.js","../../../node_modules/lodash-es/_listCacheSet.js","../../../node_modules/lodash-es/_ListCache.js","../../../node_modules/lodash-es/_Map.js","../../../node_modules/lodash-es/_mapCacheClear.js","../../../node_modules/lodash-es/_isKeyable.js","../../../node_modules/lodash-es/_getMapData.js","../../../node_modules/lodash-es/_mapCacheDelete.js","../../../node_modules/lodash-es/_mapCacheGet.js","../../../node_modules/lodash-es/_mapCacheHas.js","../../../node_modules/lodash-es/_mapCacheSet.js","../../../node_modules/lodash-es/_MapCache.js","../../../node_modules/lodash-es/memoize.js","../../../node_modules/lodash-es/_memoizeCapped.js","../../../node_modules/lodash-es/_stringToPath.js","../../../node_modules/lodash-es/_arrayMap.js","../../../node_modules/lodash-es/_baseToString.js","../../../node_modules/lodash-es/toString.js","../../../node_modules/lodash-es/_castPath.js","../../../node_modules/lodash-es/_toKey.js","../../../node_modules/lodash-es/_baseGet.js","../../../node_modules/lodash-es/get.js","../src/options.ts","../src/perf.ts","../src/dom/root.ts","../src/dom/form.ts","../src/dom/svg.ts","../src/dom-external/inner-html/scaner.ts","../src/dom-external/inner-html/tags.ts","../src/dom-external/inner-html/utils.ts","../src/dom-external/inner-html/style.ts","../src/dom-external/inner-html/parser.ts","../src/dom-external/inner-html/html.ts","../src/dom-external/node.ts","../src/dom-external/node-impl.ts","../src/dom-external/element.ts","../src/dom-external/element-impl.ts","../src/dom/document.ts","../src/hooks.ts","../src/constants/events.ts","../src/container/default-hooks.ts","../src/container/plugin-hooks.ts","../src/container/index.ts","../src/dom/event.ts","../src/env.ts","../src/bom/document.ts","../src/bom/navigator.ts","../src/bom/raf.ts","../src/bom/getComputedStyle.ts","../src/bom/window.ts","../src/current.ts","../src/emitter/emitter.ts","../src/dsl/common.ts","../src/dsl/react.ts","../src/dsl/vue.ts","../src/dsl/vue3.ts","../src/dsl/hooks.ts","../src/next-tick.ts"],"sourcesContent":["/*! *****************************************************************************\nCopyright (C) Microsoft. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n/** https://github.com/rbuckton/reflect-metadata */\n\nif (process.env.TARO_ENV === 'h5') {\n require('reflect-metadata')\n} else {\n // var Reflect;\n (function (Reflect) {\n // Metadata Proposal\n // https://rbuckton.github.io/reflect-metadata/\n (function (factory) {\n // var root = typeof global === \"object\" ? global :\n // typeof self === \"object\" ? self :\n // typeof this === \"object\" ? this :\n // Function(\"return this;\")();\n var exporter = makeExporter(Reflect);\n // if (typeof root.Reflect === \"undefined\") {\n // root.Reflect = Reflect;\n // }\n // else {\n // exporter = makeExporter(root.Reflect, exporter);\n // }\n factory(exporter);\n function makeExporter(target, previous) {\n return function (key, value) {\n if (typeof target[key] !== \"function\") {\n Object.defineProperty(target, key, { configurable: true, writable: true, value: value });\n }\n if (previous)\n previous(key, value);\n };\n }\n })(function (exporter) {\n var hasOwn = Object.prototype.hasOwnProperty;\n // feature test for Symbol support\n var supportsSymbol = typeof Symbol === \"function\";\n var toPrimitiveSymbol = supportsSymbol && typeof Symbol.toPrimitive !== \"undefined\" ? Symbol.toPrimitive : \"@@toPrimitive\";\n var iteratorSymbol = supportsSymbol && typeof Symbol.iterator !== \"undefined\" ? Symbol.iterator : \"@@iterator\";\n var supportsCreate = typeof Object.create === \"function\"; // feature test for Object.create support\n var supportsProto = { __proto__: [] } instanceof Array; // feature test for __proto__ support\n var downLevel = !supportsCreate && !supportsProto;\n var HashMap = {\n // create an object in dictionary mode (a.k.a. \"slow\" mode in v8)\n create: supportsCreate\n ? function () { return MakeDictionary(Object.create(null)); }\n : supportsProto\n ? function () { return MakeDictionary({ __proto__: null }); }\n : function () { return MakeDictionary({}); },\n has: downLevel\n ? function (map, key) { return hasOwn.call(map, key); }\n : function (map, key) { return key in map; },\n get: downLevel\n ? function (map, key) { return hasOwn.call(map, key) ? map[key] : undefined; }\n : function (map, key) { return map[key]; },\n };\n // Load global or shim versions of Map, Set, and WeakMap\n var functionPrototype = Object.getPrototypeOf(Function);\n var usePolyfill = typeof process === \"object\" && process.env && process.env[\"REFLECT_METADATA_USE_MAP_POLYFILL\"] === \"true\";\n var _Map = !usePolyfill && typeof Map === \"function\" && typeof Map.prototype.entries === \"function\" ? Map : CreateMapPolyfill();\n var _Set = !usePolyfill && typeof Set === \"function\" && typeof Set.prototype.entries === \"function\" ? Set : CreateSetPolyfill();\n var _WeakMap = !usePolyfill && typeof WeakMap === \"function\" ? WeakMap : CreateWeakMapPolyfill();\n // [[Metadata]] internal slot\n // https://rbuckton.github.io/reflect-metadata/#ordinary-object-internal-methods-and-internal-slots\n var Metadata = new _WeakMap();\n /**\n * Applies a set of decorators to a property of a target object.\n * @param decorators An array of decorators.\n * @param target The target object.\n * @param propertyKey (Optional) The property key to decorate.\n * @param attributes (Optional) The property descriptor for the target key.\n * @remarks Decorators are applied in reverse order.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Example = Reflect.decorate(decoratorsArray, Example);\n *\n * // property (on constructor)\n * Reflect.decorate(decoratorsArray, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.decorate(decoratorsArray, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Object.defineProperty(Example, \"staticMethod\",\n * Reflect.decorate(decoratorsArray, Example, \"staticMethod\",\n * Object.getOwnPropertyDescriptor(Example, \"staticMethod\")));\n *\n * // method (on prototype)\n * Object.defineProperty(Example.prototype, \"method\",\n * Reflect.decorate(decoratorsArray, Example.prototype, \"method\",\n * Object.getOwnPropertyDescriptor(Example.prototype, \"method\")));\n *\n */\n function decorate(decorators, target, propertyKey, attributes) {\n if (!IsUndefined(propertyKey)) {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsObject(target))\n throw new TypeError();\n if (!IsObject(attributes) && !IsUndefined(attributes) && !IsNull(attributes))\n throw new TypeError();\n if (IsNull(attributes))\n attributes = undefined;\n propertyKey = ToPropertyKey(propertyKey);\n return DecorateProperty(decorators, target, propertyKey, attributes);\n }\n else {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsConstructor(target))\n throw new TypeError();\n return DecorateConstructor(decorators, target);\n }\n }\n exporter(\"decorate\", decorate);\n // 4.1.2 Reflect.metadata(metadataKey, metadataValue)\n // https://rbuckton.github.io/reflect-metadata/#reflect.metadata\n /**\n * A default metadata decorator factory that can be used on a class, class member, or parameter.\n * @param metadataKey The key for the metadata entry.\n * @param metadataValue The value for the metadata entry.\n * @returns A decorator function.\n * @remarks\n * If `metadataKey` is already defined for the target and target key, the\n * metadataValue for that key will be overwritten.\n * @example\n *\n * // constructor\n * @Reflect.metadata(key, value)\n * class Example {\n * }\n *\n * // property (on constructor, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticProperty;\n * }\n *\n * // property (on prototype, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * property;\n * }\n *\n * // method (on constructor)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticMethod() { }\n * }\n *\n * // method (on prototype)\n * class Example {\n * @Reflect.metadata(key, value)\n * method() { }\n * }\n *\n */\n function metadata(metadataKey, metadataValue) {\n function decorator(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey) && !IsPropertyKey(propertyKey))\n throw new TypeError();\n OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n return decorator;\n }\n exporter(\"metadata\", metadata);\n /**\n * Define a unique metadata entry on the target.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param metadataValue A value that contains attached metadata.\n * @param target The target object on which to define metadata.\n * @param propertyKey (Optional) The property key for the target.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Reflect.defineMetadata(\"custom:annotation\", options, Example);\n *\n * // property (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticMethod\");\n *\n * // method (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"method\");\n *\n * // decorator factory as metadata-producing annotation.\n * function MyAnnotation(options): Decorator {\n * return (target, key?) => Reflect.defineMetadata(\"custom:annotation\", options, target, key);\n * }\n *\n */\n function defineMetadata(metadataKey, metadataValue, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n exporter(\"defineMetadata\", defineMetadata);\n /**\n * Gets a value indicating whether the target object or its prototype chain has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object or its prototype chain; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasMetadata\", hasMetadata);\n /**\n * Gets a value indicating whether the target object has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasOwnMetadata\", hasOwnMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object or its prototype chain.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getMetadata\", getMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getOwnMetadata\", getOwnMetadata);\n /**\n * Gets the metadata keys defined on the target object or its prototype chain.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryMetadataKeys(target, propertyKey);\n }\n exporter(\"getMetadataKeys\", getMetadataKeys);\n /**\n * Gets the unique metadata keys defined on the target object.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getOwnMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryOwnMetadataKeys(target, propertyKey);\n }\n exporter(\"getOwnMetadataKeys\", getOwnMetadataKeys);\n /**\n * Deletes the metadata entry from the target object with the provided key.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata entry was found and deleted; otherwise, false.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function deleteMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n var metadataMap = GetOrCreateMetadataMap(target, propertyKey, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n if (!metadataMap.delete(metadataKey))\n return false;\n if (metadataMap.size > 0)\n return true;\n var targetMetadata = Metadata.get(target);\n targetMetadata.delete(propertyKey);\n if (targetMetadata.size > 0)\n return true;\n Metadata.delete(target);\n return true;\n }\n exporter(\"deleteMetadata\", deleteMetadata);\n function DecorateConstructor(decorators, target) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsConstructor(decorated))\n throw new TypeError();\n target = decorated;\n }\n }\n return target;\n }\n function DecorateProperty(decorators, target, propertyKey, descriptor) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target, propertyKey, descriptor);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsObject(decorated))\n throw new TypeError();\n descriptor = decorated;\n }\n }\n return descriptor;\n }\n function GetOrCreateMetadataMap(O, P, Create) {\n var targetMetadata = Metadata.get(O);\n if (IsUndefined(targetMetadata)) {\n if (!Create)\n return undefined;\n targetMetadata = new _Map();\n Metadata.set(O, targetMetadata);\n }\n var metadataMap = targetMetadata.get(P);\n if (IsUndefined(metadataMap)) {\n if (!Create)\n return undefined;\n metadataMap = new _Map();\n targetMetadata.set(P, metadataMap);\n }\n return metadataMap;\n }\n // 3.1.1.1 OrdinaryHasMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasmetadata\n function OrdinaryHasMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return true;\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryHasMetadata(MetadataKey, parent, P);\n return false;\n }\n // 3.1.2.1 OrdinaryHasOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasownmetadata\n function OrdinaryHasOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n return ToBoolean(metadataMap.has(MetadataKey));\n }\n // 3.1.3.1 OrdinaryGetMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetmetadata\n function OrdinaryGetMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return OrdinaryGetOwnMetadata(MetadataKey, O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryGetMetadata(MetadataKey, parent, P);\n return undefined;\n }\n // 3.1.4.1 OrdinaryGetOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetownmetadata\n function OrdinaryGetOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return undefined;\n return metadataMap.get(MetadataKey);\n }\n // 3.1.5.1 OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarydefineownmetadata\n function OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ true);\n metadataMap.set(MetadataKey, MetadataValue);\n }\n // 3.1.6.1 OrdinaryMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarymetadatakeys\n function OrdinaryMetadataKeys(O, P) {\n var ownKeys = OrdinaryOwnMetadataKeys(O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (parent === null)\n return ownKeys;\n var parentKeys = OrdinaryMetadataKeys(parent, P);\n if (parentKeys.length <= 0)\n return ownKeys;\n if (ownKeys.length <= 0)\n return parentKeys;\n var set = new _Set();\n var keys = [];\n for (var _i = 0, ownKeys_1 = ownKeys; _i < ownKeys_1.length; _i++) {\n var key = ownKeys_1[_i];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n for (var _a = 0, parentKeys_1 = parentKeys; _a < parentKeys_1.length; _a++) {\n var key = parentKeys_1[_a];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n return keys;\n }\n // 3.1.7.1 OrdinaryOwnMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryownmetadatakeys\n function OrdinaryOwnMetadataKeys(O, P) {\n var keys = [];\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return keys;\n var keysObj = metadataMap.keys();\n var iterator = GetIterator(keysObj);\n var k = 0;\n while (true) {\n var next = IteratorStep(iterator);\n if (!next) {\n keys.length = k;\n return keys;\n }\n var nextValue = IteratorValue(next);\n try {\n keys[k] = nextValue;\n }\n catch (e) {\n try {\n IteratorClose(iterator);\n }\n finally {\n throw e;\n }\n }\n k++;\n }\n }\n // 6 ECMAScript Data Typ0es and Values\n // https://tc39.github.io/ecma262/#sec-ecmascript-data-types-and-values\n function Type(x) {\n if (x === null)\n return 1 /* Null */;\n switch (typeof x) {\n case \"undefined\": return 0 /* Undefined */;\n case \"boolean\": return 2 /* Boolean */;\n case \"string\": return 3 /* String */;\n case \"symbol\": return 4 /* Symbol */;\n case \"number\": return 5 /* Number */;\n case \"object\": return x === null ? 1 /* Null */ : 6 /* Object */;\n default: return 6 /* Object */;\n }\n }\n // 6.1.1 The Undefined Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-undefined-type\n function IsUndefined(x) {\n return x === undefined;\n }\n // 6.1.2 The Null Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-null-type\n function IsNull(x) {\n return x === null;\n }\n // 6.1.5 The Symbol Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-symbol-type\n function IsSymbol(x) {\n return typeof x === \"symbol\";\n }\n // 6.1.7 The Object Type\n // https://tc39.github.io/ecma262/#sec-object-type\n function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }\n // 7.1 Type Conversion\n // https://tc39.github.io/ecma262/#sec-type-conversion\n // 7.1.1 ToPrimitive(input [, PreferredType])\n // https://tc39.github.io/ecma262/#sec-toprimitive\n function ToPrimitive(input, PreferredType) {\n switch (Type(input)) {\n case 0 /* Undefined */: return input;\n case 1 /* Null */: return input;\n case 2 /* Boolean */: return input;\n case 3 /* String */: return input;\n case 4 /* Symbol */: return input;\n case 5 /* Number */: return input;\n }\n var hint = PreferredType === 3 /* String */ ? \"string\" : PreferredType === 5 /* Number */ ? \"number\" : \"default\";\n var exoticToPrim = GetMethod(input, toPrimitiveSymbol);\n if (exoticToPrim !== undefined) {\n var result = exoticToPrim.call(input, hint);\n if (IsObject(result))\n throw new TypeError();\n return result;\n }\n return OrdinaryToPrimitive(input, hint === \"default\" ? \"number\" : hint);\n }\n // 7.1.1.1 OrdinaryToPrimitive(O, hint)\n // https://tc39.github.io/ecma262/#sec-ordinarytoprimitive\n function OrdinaryToPrimitive(O, hint) {\n if (hint === \"string\") {\n var toString_1 = O.toString;\n if (IsCallable(toString_1)) {\n var result = toString_1.call(O);\n if (!IsObject(result))\n return result;\n }\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n else {\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n var toString_2 = O.toString;\n if (IsCallable(toString_2)) {\n var result = toString_2.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n throw new TypeError();\n }\n // 7.1.2 ToBoolean(argument)\n // https://tc39.github.io/ecma262/2016/#sec-toboolean\n function ToBoolean(argument) {\n return !!argument;\n }\n // 7.1.12 ToString(argument)\n // https://tc39.github.io/ecma262/#sec-tostring\n function ToString(argument) {\n return \"\" + argument;\n }\n // 7.1.14 ToPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-topropertykey\n function ToPropertyKey(argument) {\n var key = ToPrimitive(argument, 3 /* String */);\n if (IsSymbol(key))\n return key;\n return ToString(key);\n }\n // 7.2 Testing and Comparison Operations\n // https://tc39.github.io/ecma262/#sec-testing-and-comparison-operations\n // 7.2.2 IsArray(argument)\n // https://tc39.github.io/ecma262/#sec-isarray\n function IsArray(argument) {\n return Array.isArray\n ? Array.isArray(argument)\n : argument instanceof Object\n ? argument instanceof Array\n : Object.prototype.toString.call(argument) === \"[object Array]\";\n }\n // 7.2.3 IsCallable(argument)\n // https://tc39.github.io/ecma262/#sec-iscallable\n function IsCallable(argument) {\n // NOTE: This is an approximation as we cannot check for [[Call]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.4 IsConstructor(argument)\n // https://tc39.github.io/ecma262/#sec-isconstructor\n function IsConstructor(argument) {\n // NOTE: This is an approximation as we cannot check for [[Construct]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.7 IsPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-ispropertykey\n function IsPropertyKey(argument) {\n switch (Type(argument)) {\n case 3 /* String */: return true;\n case 4 /* Symbol */: return true;\n default: return false;\n }\n }\n // 7.3 Operations on Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-objects\n // 7.3.9 GetMethod(V, P)\n // https://tc39.github.io/ecma262/#sec-getmethod\n function GetMethod(V, P) {\n var func = V[P];\n if (func === undefined || func === null)\n return undefined;\n if (!IsCallable(func))\n throw new TypeError();\n return func;\n }\n // 7.4 Operations on Iterator Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-iterator-objects\n function GetIterator(obj) {\n var method = GetMethod(obj, iteratorSymbol);\n if (!IsCallable(method))\n throw new TypeError(); // from Call\n var iterator = method.call(obj);\n if (!IsObject(iterator))\n throw new TypeError();\n return iterator;\n }\n // 7.4.4 IteratorValue(iterResult)\n // https://tc39.github.io/ecma262/2016/#sec-iteratorvalue\n function IteratorValue(iterResult) {\n return iterResult.value;\n }\n // 7.4.5 IteratorStep(iterator)\n // https://tc39.github.io/ecma262/#sec-iteratorstep\n function IteratorStep(iterator) {\n var result = iterator.next();\n return result.done ? false : result;\n }\n // 7.4.6 IteratorClose(iterator, completion)\n // https://tc39.github.io/ecma262/#sec-iteratorclose\n function IteratorClose(iterator) {\n var f = iterator[\"return\"];\n if (f)\n f.call(iterator);\n }\n // 9.1 Ordinary Object Internal Methods and Internal Slots\n // https://tc39.github.io/ecma262/#sec-ordinary-object-internal-methods-and-internal-slots\n // 9.1.1.1 OrdinaryGetPrototypeOf(O)\n // https://tc39.github.io/ecma262/#sec-ordinarygetprototypeof\n function OrdinaryGetPrototypeOf(O) {\n var proto = Object.getPrototypeOf(O);\n if (typeof O !== \"function\" || O === functionPrototype)\n return proto;\n // TypeScript doesn't set __proto__ in ES5, as it's non-standard.\n // Try to determine the superclass constructor. Compatible implementations\n // must either set __proto__ on a subclass constructor to the superclass constructor,\n // or ensure each class has a valid `constructor` property on its prototype that\n // points back to the constructor.\n // If this is not the same as Function.[[Prototype]], then this is definately inherited.\n // This is the case when in ES6 or when using __proto__ in a compatible browser.\n if (proto !== functionPrototype)\n return proto;\n // If the super prototype is Object.prototype, null, or undefined, then we cannot determine the heritage.\n var prototype = O.prototype;\n var prototypeProto = prototype && Object.getPrototypeOf(prototype);\n if (prototypeProto == null || prototypeProto === Object.prototype)\n return proto;\n // If the constructor was not a function, then we cannot determine the heritage.\n var constructor = prototypeProto.constructor;\n if (typeof constructor !== \"function\")\n return proto;\n // If we have some kind of self-reference, then we cannot determine the heritage.\n if (constructor === O)\n return proto;\n // we have a pretty good guess at the heritage.\n return constructor;\n }\n // naive Map shim\n function CreateMapPolyfill() {\n var cacheSentinel = {};\n var arraySentinel = [];\n var MapIterator = /** @class */ (function () {\n function MapIterator(keys, values, selector) {\n this._index = 0;\n this._keys = keys;\n this._values = values;\n this._selector = selector;\n }\n MapIterator.prototype[\"@@iterator\"] = function () { return this; };\n MapIterator.prototype[iteratorSymbol] = function () { return this; };\n MapIterator.prototype.next = function () {\n var index = this._index;\n if (index >= 0 && index < this._keys.length) {\n var result = this._selector(this._keys[index], this._values[index]);\n if (index + 1 >= this._keys.length) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n else {\n this._index++;\n }\n return { value: result, done: false };\n }\n return { value: undefined, done: true };\n };\n MapIterator.prototype.throw = function (error) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n throw error;\n };\n MapIterator.prototype.return = function (value) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n return { value: value, done: true };\n };\n return MapIterator;\n }());\n return /** @class */ (function () {\n function Map() {\n this._keys = [];\n this._values = [];\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n Object.defineProperty(Map.prototype, \"size\", {\n get: function () { return this._keys.length; },\n enumerable: true,\n configurable: true\n });\n Map.prototype.has = function (key) { return this._find(key, /*insert*/ false) >= 0; };\n Map.prototype.get = function (key) {\n var index = this._find(key, /*insert*/ false);\n return index >= 0 ? this._values[index] : undefined;\n };\n Map.prototype.set = function (key, value) {\n var index = this._find(key, /*insert*/ true);\n this._values[index] = value;\n return this;\n };\n Map.prototype.delete = function (key) {\n var index = this._find(key, /*insert*/ false);\n if (index >= 0) {\n var size = this._keys.length;\n for (var i = index + 1; i < size; i++) {\n this._keys[i - 1] = this._keys[i];\n this._values[i - 1] = this._values[i];\n }\n this._keys.length--;\n this._values.length--;\n if (key === this._cacheKey) {\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n return true;\n }\n return false;\n };\n Map.prototype.clear = function () {\n this._keys.length = 0;\n this._values.length = 0;\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n };\n Map.prototype.keys = function () { return new MapIterator(this._keys, this._values, getKey); };\n Map.prototype.values = function () { return new MapIterator(this._keys, this._values, getValue); };\n Map.prototype.entries = function () { return new MapIterator(this._keys, this._values, getEntry); };\n Map.prototype[\"@@iterator\"] = function () { return this.entries(); };\n Map.prototype[iteratorSymbol] = function () { return this.entries(); };\n Map.prototype._find = function (key, insert) {\n if (this._cacheKey !== key) {\n this._cacheIndex = this._keys.indexOf(this._cacheKey = key);\n }\n if (this._cacheIndex < 0 && insert) {\n this._cacheIndex = this._keys.length;\n this._keys.push(key);\n this._values.push(undefined);\n }\n return this._cacheIndex;\n };\n return Map;\n }());\n function getKey(key, _) {\n return key;\n }\n function getValue(_, value) {\n return value;\n }\n function getEntry(key, value) {\n return [key, value];\n }\n }\n // naive Set shim\n function CreateSetPolyfill() {\n return /** @class */ (function () {\n function Set() {\n this._map = new _Map();\n }\n Object.defineProperty(Set.prototype, \"size\", {\n get: function () { return this._map.size; },\n enumerable: true,\n configurable: true\n });\n Set.prototype.has = function (value) { return this._map.has(value); };\n Set.prototype.add = function (value) { return this._map.set(value, value), this; };\n Set.prototype.delete = function (value) { return this._map.delete(value); };\n Set.prototype.clear = function () { this._map.clear(); };\n Set.prototype.keys = function () { return this._map.keys(); };\n Set.prototype.values = function () { return this._map.values(); };\n Set.prototype.entries = function () { return this._map.entries(); };\n Set.prototype[\"@@iterator\"] = function () { return this.keys(); };\n Set.prototype[iteratorSymbol] = function () { return this.keys(); };\n return Set;\n }());\n }\n // naive WeakMap shim\n function CreateWeakMapPolyfill() {\n var UUID_SIZE = 16;\n var keys = HashMap.create();\n var rootKey = CreateUniqueKey();\n return /** @class */ (function () {\n function WeakMap() {\n this._key = CreateUniqueKey();\n }\n WeakMap.prototype.has = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.has(table, this._key) : false;\n };\n WeakMap.prototype.get = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.get(table, this._key) : undefined;\n };\n WeakMap.prototype.set = function (target, value) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ true);\n table[this._key] = value;\n return this;\n };\n WeakMap.prototype.delete = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? delete table[this._key] : false;\n };\n WeakMap.prototype.clear = function () {\n // NOTE: not a real clear, just makes the previous data unreachable\n this._key = CreateUniqueKey();\n };\n return WeakMap;\n }());\n function CreateUniqueKey() {\n var key;\n do\n key = \"@@WeakMap@@\" + CreateUUID();\n while (HashMap.has(keys, key));\n keys[key] = true;\n return key;\n }\n function GetOrCreateWeakMapTable(target, create) {\n if (!hasOwn.call(target, rootKey)) {\n if (!create)\n return undefined;\n Object.defineProperty(target, rootKey, { value: HashMap.create() });\n }\n return target[rootKey];\n }\n function FillRandomBytes(buffer, size) {\n for (var i = 0; i < size; ++i)\n buffer[i] = Math.random() * 0xff | 0;\n return buffer;\n }\n function GenRandomBytes(size) {\n if (typeof Uint8Array === \"function\") {\n if (typeof crypto !== \"undefined\")\n return crypto.getRandomValues(new Uint8Array(size));\n if (typeof msCrypto !== \"undefined\")\n return msCrypto.getRandomValues(new Uint8Array(size));\n return FillRandomBytes(new Uint8Array(size), size);\n }\n return FillRandomBytes(new Array(size), size);\n }\n function CreateUUID() {\n var data = GenRandomBytes(UUID_SIZE);\n // mark as random - RFC 4122 § 4.4\n data[6] = data[6] & 0x4f | 0x40;\n data[8] = data[8] & 0xbf | 0x80;\n var result = \"\";\n for (var offset = 0; offset < UUID_SIZE; ++offset) {\n var byte = data[offset];\n if (offset === 4 || offset === 6 || offset === 8)\n result += \"-\";\n if (byte < 16)\n result += \"0\";\n result += byte.toString(16).toLowerCase();\n }\n return result;\n }\n }\n // uses a heuristic used by v8 and chakra to force an object into dictionary mode.\n function MakeDictionary(obj) {\n obj.__ = undefined;\n delete obj.__;\n return obj;\n }\n });\n })(Reflect || (Reflect = {}))\n}\n","const SERVICE_IDENTIFIER = {\n TaroElement: 'TaroElement',\n TaroElementFactory: 'Factory',\n TaroText: 'TaroText',\n TaroTextFactory: 'Factory',\n TaroNodeImpl: 'TaroNodeImpl',\n TaroElementImpl: 'TaroElementImpl',\n Hooks: 'hooks',\n onRemoveAttribute: 'onRemoveAttribute',\n getLifecycle: 'getLifecycle',\n getPathIndex: 'getPathIndex',\n getEventCenter: 'getEventCenter',\n isBubbleEvents: 'isBubbleEvents',\n getSpecialNodes: 'getSpecialNodes',\n eventCenter: 'eventCenter',\n modifyMpEvent: 'modifyMpEvent',\n modifyTaroEvent: 'modifyTaroEvent',\n batchedEventUpdates: 'batchedEventUpdates',\n mergePageInstance: 'mergePageInstance',\n createPullDownComponent: 'createPullDownComponent',\n getDOMNode: 'getDOMNode',\n initNativeApi: 'initNativeApi',\n modifyHydrateData: 'modifyHydrateData',\n modifySetAttrPayload: 'modifySetAttrPayload',\n modifyRmAttrPayload: 'modifyRmAttrPayload',\n onAddEvent: 'onAddEvent',\n patchElement: 'patchElement'\n}\n\nexport default SERVICE_IDENTIFIER\n","export const PROPERTY_THRESHOLD = 2046\nexport const TARO_RUNTIME = 'Taro runtime'\nexport const HOOKS_APP_ID = 'taro-app'\nexport const SET_DATA = '小程序 setData'\nexport const PAGE_INIT = '页面初始化'\nexport const ROOT_STR = 'root'\nexport const HTML = 'html'\nexport const HEAD = 'head'\nexport const BODY = 'body'\nexport const APP = 'app'\nexport const CONTAINER = 'container'\nexport const DOCUMENT_ELEMENT_NAME = '#document'\nexport const DOCUMENT_FRAGMENT = 'document-fragment'\nexport const ID = 'id'\nexport const UID = 'uid'\nexport const CLASS = 'class'\nexport const STYLE = 'style'\nexport const FOCUS = 'focus'\nexport const VIEW = 'view'\nexport const STATIC_VIEW = 'static-view'\nexport const PURE_VIEW = 'pure-view'\nexport const PROPS = 'props'\nexport const DATASET = 'dataset'\nexport const OBJECT = 'object'\nexport const VALUE = 'value'\nexport const INPUT = 'input'\nexport const CHANGE = 'change'\nexport const CUSTOM_WRAPPER = 'custom-wrapper'\nexport const TARGET = 'target'\nexport const CURRENT_TARGET = 'currentTarget'\nexport const TYPE = 'type'\nexport const CONFIRM = 'confirm'\nexport const TIME_STAMP = 'timeStamp'\nexport const KEY_CODE = 'keyCode'\nexport const TOUCHMOVE = 'touchmove'\nexport const DATE = 'Date'\nexport const SET_TIMEOUT = 'setTimeout'\nexport const CATCHMOVE = 'catchMove'\nexport const CATCH_VIEW = 'catch-view'\nexport const COMMENT = 'comment'\n","import { Shortcuts } from '@tarojs/shared'\nimport { NodeType } from '../dom/node_types'\nimport {\n ROOT_STR,\n STYLE,\n ID,\n UID,\n CLASS,\n COMMENT\n} from '../constants'\n\nimport type { TaroElement } from '../dom/element'\nimport type { TaroText } from '../dom/text'\nimport type { TaroNode } from '../dom/node'\n\nexport const incrementId = () => {\n let id = 0\n return () => (id++).toString()\n}\n\nexport function isElement (node: TaroNode): node is TaroElement {\n return node.nodeType === NodeType.ELEMENT_NODE\n}\n\nexport function isText (node: TaroNode): node is TaroText {\n return node.nodeType === NodeType.TEXT_NODE\n}\n\nexport function isComment (node: TaroNode): boolean {\n return node.nodeName === COMMENT\n}\n\nexport function isHasExtractProp (el: TaroElement): boolean {\n const res = Object.keys(el.props).find(prop => {\n return !(/^(class|style|id)$/.test(prop) || prop.startsWith('data-'))\n })\n return Boolean(res)\n}\n\n/**\n * 往上寻找组件树直到 root，寻找是否有祖先组件绑定了同类型的事件\n * @param node 当前组件\n * @param type 事件类型\n */\nexport function isParentBinded (node: TaroElement | null, type: string): boolean {\n let res = false\n while (node?.parentElement && node.parentElement._path !== ROOT_STR) {\n if (node.parentElement.__handlers[type]?.length) {\n res = true\n break\n }\n node = node.parentElement\n }\n return res\n}\n\nexport function shortcutAttr (key: string): string {\n switch (key) {\n case STYLE:\n return Shortcuts.Style\n case ID:\n return UID\n case CLASS:\n return Shortcuts.Class\n default:\n return key\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { isArray, isObject, warn } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { EventHandler, AddEventListenerOptions, IHooks } from '../interface'\n\n@injectable()\nexport class TaroEventTarget {\n public __handlers: Record = {}\n public hooks: IHooks\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: IHooks\n ) {\n this.hooks = hooks\n }\n\n public addEventListener (type: string, handler: EventHandler, options?: boolean | AddEventListenerOptions) {\n this.hooks.onAddEvent?.(type, handler, options, this)\n if (type === 'regionchange') {\n // map 组件的 regionchange 事件非常特殊，详情：https://github.com/NervJS/taro/issues/5766\n this.addEventListener('begin', handler, options)\n this.addEventListener('end', handler, options)\n return\n }\n type = type.toLowerCase()\n const handlers = this.__handlers[type]\n let isCapture = Boolean(options)\n let isOnce = false\n if (isObject(options)) {\n isCapture = Boolean(options.capture)\n isOnce = Boolean(options.once)\n }\n\n if (isOnce) {\n const wrapper = function () {\n handler.apply(this, arguments) // this 指向 Element\n this.removeEventListener(type, wrapper)\n }\n this.addEventListener(type, wrapper, {\n ...(options as AddEventListenerOptions),\n once: false\n })\n return\n }\n\n process.env.NODE_ENV !== 'production' && warn(isCapture, 'Taro 暂未实现 event 的 capture 特性。')\n\n if (isArray(handlers)) {\n handlers.push(handler)\n } else {\n this.__handlers[type] = [handler]\n }\n }\n\n public removeEventListener (type: string, handler: EventHandler) {\n type = type.toLowerCase()\n if (handler == null) {\n return\n }\n\n const handlers = this.__handlers[type]\n if (!isArray(handlers)) {\n return\n }\n\n const index = handlers.indexOf(handler)\n\n process.env.NODE_ENV !== 'production' && warn(index === -1, `事件: '${type}' 没有注册在 DOM 中，因此不会被移除。`)\n\n handlers.splice(index, 1)\n }\n\n public isAnyEventBinded (): boolean {\n const handlers = this.__handlers\n const isAnyEventBinded = Object.keys(handlers).find(key => handlers[key].length)\n return Boolean(isAnyEventBinded)\n }\n}\n","import { Shortcuts, toCamelCase } from '@tarojs/shared'\nimport { isText, isHasExtractProp, isComment } from './utils'\nimport {\n VIEW,\n CLASS,\n STYLE,\n ID,\n PURE_VIEW,\n CATCHMOVE,\n CATCH_VIEW\n} from './constants'\n\nimport type { MiniData, MiniElementData } from './interface'\nimport type { TaroElement } from './dom/element'\nimport type { TaroText } from './dom/text'\n\n/**\n * React also has a fancy function's name for this: `hydrate()`.\n * You may have been heard `hydrate` as a SSR-related function,\n * actually, `hydrate` basicly do the `render()` thing, but ignore some properties,\n * it's a vnode traverser and modifier: that's exactly what Taro's doing in here.\n */\nexport function hydrate (node: TaroElement | TaroText): MiniData {\n const nodeName = node.nodeName\n\n if (isText(node)) {\n return {\n [Shortcuts.Text]: node.nodeValue,\n [Shortcuts.NodeName]: nodeName\n }\n }\n\n const data: MiniElementData = {\n [Shortcuts.NodeName]: nodeName,\n uid: node.uid\n }\n const { props } = node\n const SPECIAL_NODES = node.hooks.getSpecialNodes()\n\n if (!node.isAnyEventBinded() && SPECIAL_NODES.indexOf(nodeName) > -1) {\n data[Shortcuts.NodeName] = `static-${nodeName}`\n if (nodeName === VIEW && !isHasExtractProp(node)) {\n data[Shortcuts.NodeName] = PURE_VIEW\n }\n }\n\n for (const prop in props) {\n const propInCamelCase = toCamelCase(prop)\n if (\n !prop.startsWith('data-') && // 在 node.dataset 的数据\n prop !== CLASS &&\n prop !== STYLE &&\n prop !== ID &&\n propInCamelCase !== CATCHMOVE\n ) {\n data[propInCamelCase] = props[prop]\n }\n if (nodeName === VIEW && propInCamelCase === CATCHMOVE && props[prop] !== false) {\n data[Shortcuts.NodeName] = CATCH_VIEW\n }\n }\n\n let { childNodes } = node\n\n // 过滤 comment 节点\n childNodes = childNodes.filter(node => !isComment(node))\n\n if (childNodes.length > 0) {\n data[Shortcuts.Childnodes] = childNodes.map(hydrate)\n } else {\n data[Shortcuts.Childnodes] = []\n }\n\n if (node.className !== '') {\n data[Shortcuts.Class] = node.className\n }\n\n if (node.cssText !== '' && nodeName !== 'swiper-item') {\n data[Shortcuts.Style] = node.cssText\n }\n\n node.hooks.modifyHydrateData?.(data)\n\n return data\n}\n","import type { TaroNode } from './node'\nexport const eventSource = new Map()\n","export enum ElementNames {\n Element = 'Element',\n Document = 'Document',\n RootElement = 'RootElement',\n FormElement = 'FormElement'\n}\n\nexport interface InstanceFactory {\n (...args: any[]): T\n}\n\nexport interface InstanceNamedFactory {\n (named: string): (...args: any[]) => T\n}\n","import { inject, injectable } from 'inversify'\nimport { Shortcuts, ensure } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { NodeType } from './node_types'\nimport { incrementId, isComment } from '../utils'\nimport { TaroEventTarget } from './event-target'\nimport { hydrate } from '../hydrate'\nimport { eventSource } from './event-source'\nimport { ElementNames } from '../interface'\nimport {\n DOCUMENT_FRAGMENT\n} from '../constants'\n\nimport type { UpdatePayload, InstanceNamedFactory } from '../interface'\nimport type { TaroDocument } from './document'\nimport type { TaroRootElement } from './root'\nimport type { TaroElement } from './element'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { Hooks } from '../hooks'\n\nconst nodeId = incrementId()\n\n@injectable()\nexport class TaroNode extends TaroEventTarget {\n public uid: string\n public nodeType: NodeType\n public nodeName: string\n public parentNode: TaroNode | null = null\n public childNodes: TaroNode[] = []\n\n protected _getElement: InstanceNamedFactory\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) impl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks\n ) {\n super(hooks)\n impl.bind(this)\n this._getElement = getElement\n this.uid = `_n_${nodeId()}`\n eventSource.set(this.uid, this)\n }\n\n private hydrate = (node: TaroNode) => () => hydrate(node as TaroElement)\n\n /**\n * like jQuery's $.empty()\n */\n private _empty () {\n while (this.childNodes.length > 0) {\n const child = this.childNodes[0]\n child.parentNode = null\n eventSource.delete(child.uid)\n this.childNodes.shift()\n }\n }\n\n protected get _root (): TaroRootElement | null {\n return this.parentNode?._root || null\n }\n\n protected findIndex (refChild: TaroNode): number {\n const index = this.childNodes.indexOf(refChild)\n\n ensure(index !== -1, 'The node to be replaced is not a child of this node.')\n\n return index\n }\n\n public get _path (): string {\n const parentNode = this.parentNode\n\n if (parentNode) {\n // 计算路径时，先过滤掉 comment 节点\n const list = parentNode.childNodes.filter(node => !isComment(node))\n const indexOfNode = list.indexOf(this)\n const index = this.hooks.getPathIndex(indexOfNode)\n\n return `${parentNode._path}.${Shortcuts.Childnodes}.${index}`\n }\n\n return ''\n }\n\n public get nextSibling (): TaroNode | null {\n const parentNode = this.parentNode\n return parentNode?.childNodes[parentNode.findIndex(this) + 1] || null\n }\n\n public get previousSibling (): TaroNode | null {\n const parentNode = this.parentNode\n return parentNode?.childNodes[parentNode.findIndex(this) - 1] || null\n }\n\n public get parentElement (): TaroElement | null {\n const parentNode = this.parentNode\n if (parentNode?.nodeType === NodeType.ELEMENT_NODE) {\n return parentNode as TaroElement\n }\n return null\n }\n\n public get firstChild (): TaroNode | null {\n return this.childNodes[0] || null\n }\n\n public get lastChild (): TaroNode | null {\n const childNodes = this.childNodes\n return childNodes[childNodes.length - 1] || null\n }\n\n /**\n * @textContent 目前只能置空子元素\n * @TODO 等待完整 innerHTML 实现\n */\n public set textContent (text: string) {\n this._empty()\n if (text === '') {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => []\n })\n } else {\n const document = this._getElement(ElementNames.Document)()\n this.appendChild(document.createTextNode(text))\n }\n }\n\n public insertBefore (newChild: T, refChild?: TaroNode | null, isReplace?: boolean): T {\n if (newChild.nodeName === DOCUMENT_FRAGMENT) {\n newChild.childNodes.reduceRight((previousValue, currentValue) => {\n this.insertBefore(currentValue, previousValue)\n return currentValue\n }, refChild)\n return newChild\n }\n\n newChild.remove()\n newChild.parentNode = this\n let payload: UpdatePayload\n\n if (refChild) {\n const index = this.findIndex(refChild)\n this.childNodes.splice(index, 0, newChild)\n if (isReplace) {\n payload = {\n path: newChild._path,\n value: this.hydrate(newChild)\n }\n } else {\n payload = {\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => {\n const childNodes = this.childNodes.filter(node => !isComment(node))\n return childNodes.map(hydrate)\n }\n }\n }\n } else {\n this.childNodes.push(newChild)\n payload = {\n path: newChild._path,\n value: this.hydrate(newChild)\n }\n }\n\n this.enqueueUpdate(payload)\n\n if (!eventSource.has(newChild.uid)) {\n eventSource.set(newChild.uid, newChild)\n }\n\n return newChild\n }\n\n public appendChild (child: TaroNode) {\n this.insertBefore(child)\n }\n\n public replaceChild (newChild: TaroNode, oldChild: TaroNode) {\n if (oldChild.parentNode === this) {\n this.insertBefore(newChild, oldChild, true)\n oldChild.remove(true)\n return oldChild\n }\n }\n\n public removeChild (child: T, isReplace?: boolean): T {\n const index = this.findIndex(child)\n this.childNodes.splice(index, 1)\n if (!isReplace) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Childnodes}`,\n value: () => {\n const childNodes = this.childNodes.filter(node => !isComment(node))\n return childNodes.map(hydrate)\n }\n })\n }\n child.parentNode = null\n eventSource.delete(child.uid)\n // @TODO: eventSource memory overflow\n // child._empty()\n return child\n }\n\n public remove (isReplace?: boolean) {\n this.parentNode?.removeChild(this, isReplace)\n }\n\n public hasChildNodes () {\n return this.childNodes.length > 0\n }\n\n public enqueueUpdate (payload: UpdatePayload) {\n this._root?.enqueueUpdate(payload)\n }\n\n public contains (node: TaroNode & { id?: string }): boolean {\n let isContains = false\n this.childNodes.some(childNode => {\n const { uid } = childNode\n if (uid === node.uid || uid === node.id || childNode.contains(node)) {\n isContains = true\n return true\n }\n })\n return isContains\n }\n\n public get ownerDocument () {\n const document = this._getElement(ElementNames.Document)()\n return document\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { Shortcuts } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNode } from './node'\nimport { NodeType } from './node_types'\n\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { InstanceNamedFactory } from '../interface'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroText extends TaroNode {\n public _value: string\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks\n ) {\n super(nodeImpl, getElement, hooks)\n this.nodeType = NodeType.TEXT_NODE\n this.nodeName = '#text'\n }\n\n public set textContent (text: string) {\n this._value = text\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.Text}`,\n value: text\n })\n }\n\n public get textContent (): string {\n return this._value\n }\n\n public set nodeValue (text: string) {\n this.textContent = text\n }\n\n public get nodeValue (): string {\n return this._value\n }\n}\n","/*\n *\n * https://www.w3.org/Style/CSS/all-properties.en.html\n */\n\nconst styleProperties = [\n 'all',\n 'appearance',\n 'blockOverflow',\n 'blockSize',\n 'bottom',\n 'clear',\n 'contain',\n 'content',\n 'continue',\n 'cursor',\n 'direction',\n 'display',\n 'filter',\n 'float',\n 'gap',\n 'height',\n 'inset',\n 'isolation',\n 'left',\n 'letterSpacing',\n 'lightingColor',\n 'markerSide',\n 'mixBlendMode',\n 'opacity',\n 'order',\n 'position',\n 'quotes',\n 'resize',\n 'right',\n 'rowGap',\n 'tabSize',\n 'tableLayout',\n 'top',\n 'userSelect',\n 'verticalAlign',\n 'visibility',\n 'voiceFamily',\n 'volume',\n 'whiteSpace',\n 'widows',\n 'width',\n 'zIndex'\n\n /** 非常用 style */\n // 'azimuth',\n // 'backfaceVisibility',\n // 'baselineShift',\n // 'captionSide',\n // 'chains',\n // 'dominantBaseline',\n // 'elevation',\n // 'emptyCells',\n // 'forcedColorAdjust',\n // 'glyphOrientationVertical',\n // 'hangingPunctuation',\n // 'hyphenateCharacter',\n // 'hyphens',\n // 'imageOrientation',\n // 'imageResolution',\n // 'orphans',\n // 'playDuring',\n // 'pointerEvents',\n // 'regionFragment',\n // 'richness',\n // 'running',\n // 'scrollBehavior',\n // 'speechRate',\n // 'stress',\n // 'stringSet',\n // 'unicodeBidi',\n // 'willChange',\n // 'writingMode',\n]\n\n// 减少文件体积\nfunction combine (prefix: string, list: string[], excludeSelf?: boolean) {\n !excludeSelf && styleProperties.push(prefix)\n list.forEach(item => {\n styleProperties.push(prefix + item)\n })\n}\n\nconst color = 'Color'\nconst style = 'Style'\nconst width = 'Width'\nconst image = 'Image'\nconst size = 'Size'\nconst color_style_width = [color, style, width]\nconst fitlength_fitwidth_image = ['FitLength', 'FitWidth', image]\nconst fitlength_fitwidth_image_radius = [...fitlength_fitwidth_image, 'Radius']\nconst color_style_width_fitlength_fitwidth_image = [...color_style_width, ...fitlength_fitwidth_image]\nconst endRadius_startRadius = ['EndRadius', 'StartRadius']\nconst bottom_left_right_top = ['Bottom', 'Left', 'Right', 'Top']\nconst end_start = ['End', 'Start']\nconst content_items_self = ['Content', 'Items', 'Self']\nconst blockSize_height_inlineSize_width = ['BlockSize', 'Height', 'InlineSize', width]\nconst after_before = ['After', 'Before']\n\ncombine('borderBlock', color_style_width)\ncombine('borderBlockEnd', color_style_width)\ncombine('borderBlockStart', color_style_width)\ncombine('outline', [...color_style_width, 'Offset'])\ncombine('border', [...color_style_width, 'Boundary', 'Break', 'Collapse', 'Radius', 'Spacing'])\ncombine('borderFit', ['Length', width])\ncombine('borderInline', color_style_width)\ncombine('borderInlineEnd', color_style_width)\ncombine('borderInlineStart', color_style_width)\ncombine('borderLeft', color_style_width_fitlength_fitwidth_image)\ncombine('borderRight', color_style_width_fitlength_fitwidth_image)\ncombine('borderTop', color_style_width_fitlength_fitwidth_image)\ncombine('borderBottom', color_style_width_fitlength_fitwidth_image)\ncombine('textDecoration', [color, style, 'Line'])\ncombine('textEmphasis', [color, style, 'Position'])\ncombine('scrollMargin', bottom_left_right_top)\ncombine('scrollPadding', bottom_left_right_top)\ncombine('padding', bottom_left_right_top)\ncombine('margin', [...bottom_left_right_top, 'Trim'])\ncombine('scrollMarginBlock', end_start)\ncombine('scrollMarginInline', end_start)\ncombine('scrollPaddingBlock', end_start)\ncombine('scrollPaddingInline', end_start)\ncombine('gridColumn', end_start)\ncombine('gridRow', end_start)\ncombine('insetBlock', end_start)\ncombine('insetInline', end_start)\ncombine('marginBlock', end_start)\ncombine('marginInline', end_start)\ncombine('paddingBlock', end_start)\ncombine('paddingInline', end_start)\ncombine('pause', after_before)\ncombine('cue', after_before)\ncombine('mask', ['Clip', 'Composite', image, 'Mode', 'Origin', 'Position', 'Repeat', size, 'Type'])\ncombine('borderImage', ['Outset', 'Repeat', 'Slice', 'Source', 'Transform', width])\ncombine('maskBorder', ['Mode', 'Outset', 'Repeat', 'Slice', 'Source', width])\ncombine('font', ['Family', 'FeatureSettings', 'Kerning', 'LanguageOverride', 'MaxSize', 'MinSize', 'OpticalSizing', 'Palette', size, 'SizeAdjust', 'Stretch', style, 'Weight', 'VariationSettings'])\ncombine('fontSynthesis', ['SmallCaps', style, 'Weight'])\ncombine('transform', ['Box', 'Origin', style])\ncombine('background', [color, image, 'Attachment', 'BlendMode', 'Clip', 'Origin', 'Position', 'Repeat', size])\ncombine('listStyle', [image, 'Position', 'Type'])\ncombine('scrollSnap', ['Align', 'Stop', 'Type'])\ncombine('grid', ['Area', 'AutoColumns', 'AutoFlow', 'AutoRows'])\ncombine('gridTemplate', ['Areas', 'Columns', 'Rows'])\ncombine('overflow', ['Block', 'Inline', 'Wrap', 'X', 'Y'])\ncombine('transition', ['Delay', 'Duration', 'Property', 'TimingFunction'])\ncombine('lineStacking', ['Ruby', 'Shift', 'Strategy'])\ncombine('color', ['Adjust', 'InterpolationFilters', 'Scheme'])\ncombine('textAlign', ['All', 'Last'])\ncombine('page', ['BreakAfter', 'BreakBefore', 'BreakInside'])\ncombine('speak', ['Header', 'Numeral', 'Punctuation'])\ncombine('animation', ['Delay', 'Direction', 'Duration', 'FillMode', 'IterationCount', 'Name', 'PlayState', 'TimingFunction'])\ncombine('flex', ['Basis', 'Direction', 'Flow', 'Grow', 'Shrink', 'Wrap'])\ncombine('offset', [...after_before, ...end_start, 'Anchor', 'Distance', 'Path', 'Position', 'Rotate'])\ncombine('fontVariant', ['Alternates', 'Caps', 'EastAsian', 'Emoji', 'Ligatures', 'Numeric', 'Position'])\ncombine('perspective', ['Origin'])\ncombine('pitch', ['Range'])\ncombine('clip', ['Path', 'Rule'])\ncombine('flow', ['From', 'Into'])\n\ncombine('align', ['Content', 'Items', 'Self'], true)\ncombine('alignment', ['Adjust', 'Baseline'], true)\ncombine('bookmark', ['Label', 'Level', 'State'], true)\ncombine('borderStart', endRadius_startRadius, true)\ncombine('borderEnd', endRadius_startRadius, true)\ncombine('borderCorner', ['Fit', image, 'ImageTransform'], true)\ncombine('borderTopLeft', fitlength_fitwidth_image_radius, true)\ncombine('borderTopRight', fitlength_fitwidth_image_radius, true)\ncombine('borderBottomLeft', fitlength_fitwidth_image_radius, true)\ncombine('borderBottomRight', fitlength_fitwidth_image_radius, true)\ncombine('column', ['s', 'Count', 'Fill', 'Gap', 'Rule', 'RuleColor', 'RuleStyle', 'RuleWidth', 'Span', width], true)\ncombine('break', [...after_before, 'Inside'], true)\ncombine('wrap', [...after_before, 'Flow', 'Inside', 'Through'], true)\ncombine('justify', content_items_self, true)\ncombine('place', content_items_self, true)\ncombine('max', [...blockSize_height_inlineSize_width, 'Lines'], true)\ncombine('min', blockSize_height_inlineSize_width, true)\ncombine('line', ['Break', 'Clamp', 'Grid', 'Height', 'Padding', 'Snap'], true)\ncombine('inline', ['BoxAlign', size, 'Sizing'], true)\ncombine('text', ['CombineUpright', 'GroupAlign', 'Height', 'Indent', 'Justify', 'Orientation', 'Overflow', 'Shadow', 'SpaceCollapse', 'SpaceTrim', 'Spacing', 'Transform', 'UnderlinePosition', 'Wrap'], true)\ncombine('shape', ['ImageThreshold', 'Inside', 'Margin', 'Outside'], true)\ncombine('word', ['Break', 'Spacing', 'Wrap'], true)\ncombine('nav', ['Down', 'Left', 'Right', 'Up'], true)\ncombine('object', ['Fit', 'Position'], true)\ncombine('box', ['DecorationBreak', 'Shadow', 'Sizing', 'Snap'], true)\n\n/** 非常用 style */\n// combine('caret', [color, 'Shape'])\n// combine('counter', ['Increment', 'Reset', 'Set'], true)\n// combine('dropInitial', ['AfterAdjust', 'AfterAlign', 'BeforeAdjust', 'BeforeAlign', size, 'Value'], true)\n// combine('flood', [color, 'Opacity'], true)\n// combine('footnote', ['Display', 'Policy'], true)\n// combine('hyphenateLimit', ['Chars', 'Last', 'Lines', 'Zone'], true)\n// combine('initialLetters', ['Align', 'Wrap'])\n// combine('ruby', ['Align', 'Merge', 'Position'], true)\n\nexport { styleProperties }\n","import { isUndefined, toCamelCase, toDashed, Shortcuts, warn, isString } from '@tarojs/shared'\nimport { styleProperties } from './style_properties'\nimport { TaroElement } from './element'\nimport { PROPERTY_THRESHOLD } from '../constants'\n\nfunction setStyle (this: Style, newVal: string, styleKey: string) {\n const old = this[styleKey]\n if (newVal) {\n this._usedStyleProp.add(styleKey)\n }\n\n process.env.NODE_ENV !== 'production' && warn(\n isString(newVal) && newVal.length > PROPERTY_THRESHOLD,\n `Style 属性 ${styleKey} 的值数据量过大，可能会影响渲染性能，考虑使用 CSS 类或其它方案替代。`\n )\n\n if (old !== newVal) {\n this._value[styleKey] = newVal\n this._element.enqueueUpdate({\n path: `${this._element._path}.${Shortcuts.Style}`,\n value: this.cssText\n })\n }\n}\n\nfunction initStyle (ctor: typeof Style) {\n const properties = {}\n\n for (let i = 0; i < styleProperties.length; i++) {\n const styleKey = styleProperties[i]\n properties[styleKey] = {\n get (this: Style) {\n return this._value[styleKey] || ''\n },\n set (this: Style, newVal: string) {\n setStyle.call(this, newVal, styleKey)\n }\n }\n }\n\n Object.defineProperties(ctor.prototype, properties)\n}\n\nfunction isCssVariable (propertyName) {\n return /^--/.test(propertyName)\n}\n\nexport class Style {\n public _usedStyleProp: Set\n\n public _value: Partial\n\n public _element: TaroElement\n\n public constructor (element: TaroElement) {\n this._element = element\n this._usedStyleProp = new Set()\n this._value = {}\n }\n\n private setCssVariables (styleKey: string) {\n this.hasOwnProperty(styleKey) || Object.defineProperty(this, styleKey, {\n enumerable: true,\n configurable: true,\n get: () => {\n return this._value[styleKey] || ''\n },\n set: (newVal: string) => {\n setStyle.call(this, newVal, styleKey)\n }\n })\n }\n\n public get cssText () {\n let text = ''\n this._usedStyleProp.forEach(key => {\n const val = this[key]\n if (!val) return\n const styleName = isCssVariable(key) ? key : toDashed(key)\n text += `${styleName}: ${val};`\n })\n return text\n }\n\n public set cssText (str: string) {\n if (str == null) {\n str = ''\n }\n\n this._usedStyleProp.forEach(prop => {\n this.removeProperty(prop)\n })\n\n if (str === '') {\n return\n }\n\n const rules = str.split(';')\n\n for (let i = 0; i < rules.length; i++) {\n const rule = rules[i].trim()\n if (rule === '') {\n continue\n }\n\n // 可能存在 'background: url(http:x/y/z)' 的情况\n const [propName, ...valList] = rule.split(':')\n const val = valList.join(':')\n\n if (isUndefined(val)) {\n continue\n }\n this.setProperty(propName.trim(), val.trim())\n }\n }\n\n public setProperty (propertyName: string, value?: string | null) {\n if (propertyName[0] === '-') {\n // 支持 webkit 属性或 css 变量\n this.setCssVariables(propertyName)\n } else {\n propertyName = toCamelCase(propertyName)\n }\n if (isUndefined(value)) {\n return\n }\n\n if (value === null || value === '') {\n this.removeProperty(propertyName)\n } else {\n this[propertyName] = value\n }\n }\n\n public removeProperty (propertyName: string): string {\n propertyName = toCamelCase(propertyName)\n if (!this._usedStyleProp.has(propertyName)) {\n return ''\n }\n\n const value = this[propertyName]\n this[propertyName] = ''\n this._usedStyleProp.delete(propertyName)\n return value\n }\n\n public getPropertyValue (propertyName: string) {\n propertyName = toCamelCase(propertyName)\n const value = this[propertyName]\n if (!value) {\n return ''\n }\n\n return value\n }\n}\n\ninitStyle(Style)\n","import { NodeType } from './node_types'\n\nimport type { TaroElement } from './element'\n\ntype Filter = (element: TaroElement) => boolean\n\nfunction returnTrue () {\n return true\n}\n\nexport function treeToArray (root: TaroElement, predict?: Filter): TaroElement[] {\n const array: TaroElement[] = []\n const filter = predict ?? returnTrue\n\n let object: TaroElement | null = root\n\n while (object) {\n if (object.nodeType === NodeType.ELEMENT_NODE && filter(object)) {\n array.push(object)\n }\n\n object = following(object, root)\n }\n\n return array\n}\n\nfunction following (el: TaroElement, root: TaroElement): TaroElement | null {\n const firstChild = el.firstChild\n\n if (firstChild) {\n return firstChild as TaroElement\n }\n\n let current: TaroElement | null = el\n\n do {\n if (current === root) {\n return null\n }\n\n const nextSibling = current.nextSibling\n\n if (nextSibling) {\n return nextSibling as TaroElement\n }\n current = current.parentElement\n } while (current)\n\n return null\n}\n","import type { TaroElement } from './element'\n\nexport class ClassList extends Set {\n private el: TaroElement\n\n constructor (className: string, el: TaroElement) {\n super()\n className.trim().split(/\\s+/).forEach(super.add.bind(this))\n this.el = el\n }\n\n public get value () {\n return [...this].join(' ')\n }\n\n public add (s: string) {\n super.add(s)\n this._update()\n\n return this\n }\n\n public get length (): number {\n return this.size\n }\n\n public remove (s: string) {\n super.delete(s)\n this._update()\n }\n\n public toggle (s: string) {\n if (super.has(s)) {\n super.delete(s)\n } else {\n super.add(s)\n }\n\n this._update()\n }\n\n public replace (s1: string, s2: string) {\n super.delete(s1)\n super.add(s2)\n\n this._update()\n }\n\n public contains (s: string) {\n return super.has(s)\n }\n\n public toString () {\n return this.value\n }\n\n private _update () {\n this.el.className = this.value\n }\n}\n","import { inject, injectable } from 'inversify'\nimport { isArray, isUndefined, Shortcuts, EMPTY_OBJ, warn, isString, toCamelCase } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNode } from './node'\nimport { NodeType } from './node_types'\nimport { eventSource } from './event-source'\nimport { isElement, isHasExtractProp, shortcutAttr } from '../utils'\nimport { Style } from './style'\nimport { treeToArray } from './tree'\nimport { ClassList } from './class-list'\nimport {\n ID,\n CLASS,\n STYLE,\n FOCUS,\n VIEW,\n STATIC_VIEW,\n PURE_VIEW,\n PROPERTY_THRESHOLD,\n CATCHMOVE,\n CATCH_VIEW\n} from '../constants'\n\nimport type { TaroEvent } from './event'\nimport type { Attributes, InstanceNamedFactory } from '../interface'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroElement extends TaroNode {\n public tagName: string\n public props: Record = {}\n public style: Style\n public dataset: Record = EMPTY_OBJ\n public innerHTML: string\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl\n ) {\n super(nodeImpl, getElement, hooks)\n elementImpl.bind(this)\n this.nodeType = NodeType.ELEMENT_NODE\n this.style = new Style(this)\n hooks.patchElement(this)\n }\n\n private _stopPropagation (event: TaroEvent) {\n // eslint-disable-next-line @typescript-eslint/no-this-alias\n let target = this\n // eslint-disable-next-line no-cond-assign\n while ((target = target.parentNode as this)) {\n const listeners = target.__handlers[event.type]\n\n if (!isArray(listeners)) {\n continue\n }\n\n for (let i = listeners.length; i--;) {\n const l = listeners[i]\n l._stop = true\n }\n }\n }\n\n public get id (): string {\n return this.getAttribute(ID)!\n }\n\n public set id (val: string) {\n this.setAttribute(ID, val)\n }\n\n public get className (): string {\n return this.getAttribute(CLASS) || ''\n }\n\n public set className (val: string) {\n this.setAttribute(CLASS, val)\n }\n\n public get cssText (): string {\n return this.getAttribute(STYLE) || ''\n }\n\n public get classList (): ClassList {\n return new ClassList(this.className, this)\n }\n\n public get children (): TaroElement[] {\n return this.childNodes.filter(isElement)\n }\n\n public get attributes (): Attributes[] {\n const props = this.props\n const propKeys = Object.keys(props)\n const style = this.style.cssText\n const attrs = propKeys.map(key => ({ name: key, value: props[key] }))\n return attrs.concat(style ? { name: STYLE, value: style } : [])\n }\n\n public get textContent (): string {\n let text = ''\n const childNodes = this.childNodes\n\n for (let i = 0; i < childNodes.length; i++) {\n text += childNodes[i].textContent\n }\n\n return text\n }\n\n public set textContent (text: string) {\n super.textContent = text\n }\n\n public hasAttribute (qualifiedName: string): boolean {\n return !isUndefined(this.props[qualifiedName])\n }\n\n public hasAttributes (): boolean {\n return this.attributes.length > 0\n }\n\n public focus () {\n this.setAttribute(FOCUS, true)\n }\n\n public blur () {\n this.setAttribute(FOCUS, false)\n }\n\n public setAttribute (qualifiedName: string, value: any): void {\n process.env.NODE_ENV !== 'production' && warn(\n isString(value) && value.length > PROPERTY_THRESHOLD,\n `元素 ${this.nodeName} 的 属性 ${qualifiedName} 的值数据量过大，可能会影响渲染性能。考虑降低图片转为 base64 的阈值或在 CSS 中使用 base64。`\n )\n\n const isPureView = this.nodeName === VIEW && !isHasExtractProp(this) && !this.isAnyEventBinded()\n\n switch (qualifiedName) {\n case STYLE:\n this.style.cssText = value as string\n break\n case ID:\n eventSource.delete(this.uid)\n value = String(value)\n this.props[qualifiedName] = this.uid = value\n eventSource.set(value, this)\n break\n default:\n this.props[qualifiedName] = value as string\n\n if (qualifiedName.startsWith('data-')) {\n if (this.dataset === EMPTY_OBJ) {\n this.dataset = Object.create(null)\n }\n this.dataset[toCamelCase(qualifiedName.replace(/^data-/, ''))] = value\n }\n break\n }\n\n qualifiedName = shortcutAttr(qualifiedName)\n\n const payload = {\n path: `${this._path}.${toCamelCase(qualifiedName)}`,\n value\n }\n\n this.hooks.modifySetAttrPayload?.(this, qualifiedName, payload)\n\n this.enqueueUpdate(payload)\n\n if (this.nodeName === VIEW) {\n if (toCamelCase(qualifiedName) === CATCHMOVE) {\n // catchMove = true: catch-view\n // catchMove = false: view or static-view\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: value ? CATCH_VIEW : (\n this.isAnyEventBinded() ? VIEW : STATIC_VIEW\n )\n })\n } else if (isPureView && isHasExtractProp(this)) {\n // pure-view => static-view\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: STATIC_VIEW\n })\n }\n }\n }\n\n public removeAttribute (qualifiedName: string) {\n const isStaticView = this.nodeName === VIEW && isHasExtractProp(this) && !this.isAnyEventBinded()\n\n if (qualifiedName === STYLE) {\n this.style.cssText = ''\n } else {\n const isInterrupt = this.hooks.onRemoveAttribute?.(this, qualifiedName)\n if (isInterrupt) {\n return\n }\n\n if (!this.props.hasOwnProperty(qualifiedName)) {\n return\n }\n delete this.props[qualifiedName]\n }\n\n qualifiedName = shortcutAttr(qualifiedName)\n\n const payload = {\n path: `${this._path}.${toCamelCase(qualifiedName)}`,\n value: ''\n }\n\n this.hooks.modifyRmAttrPayload?.(this, qualifiedName, payload)\n\n this.enqueueUpdate(payload)\n\n if (this.nodeName === VIEW) {\n if (toCamelCase(qualifiedName) === CATCHMOVE) {\n // catch-view => view or static-view or pure-view\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: this.isAnyEventBinded() ? VIEW : (isHasExtractProp(this) ? STATIC_VIEW : PURE_VIEW)\n })\n } else if (isStaticView && !isHasExtractProp(this)) {\n // static-view => pure-view\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: PURE_VIEW\n })\n }\n }\n }\n\n public getAttribute (qualifiedName: string): string {\n const attr = qualifiedName === STYLE ? this.style.cssText : this.props[qualifiedName]\n return attr ?? ''\n }\n\n public getElementsByTagName (tagName: string): TaroElement[] {\n return treeToArray(this, (el) => {\n return el.nodeName === tagName || (tagName === '*' && this !== el)\n })\n }\n\n public getElementsByClassName (className: string): TaroElement[] {\n return treeToArray(this, (el) => {\n const classList = el.classList\n const classNames = className.trim().split(/\\s+/)\n return classNames.every(c => classList.has(c))\n })\n }\n\n public dispatchEvent (event: TaroEvent): boolean {\n const cancelable = event.cancelable\n\n const listeners = this.__handlers[event.type]\n\n if (!isArray(listeners)) {\n return false\n }\n\n for (let i = listeners.length; i--;) {\n const listener = listeners[i]\n let result: unknown\n if (listener._stop) {\n listener._stop = false\n } else {\n result = listener.call(this, event)\n }\n if ((result === false || event._end) && cancelable) {\n event.defaultPrevented = true\n }\n\n if (event._end && event._stop) {\n break\n }\n }\n\n if (event._stop) {\n this._stopPropagation(event)\n } else {\n event._stop = true\n }\n\n return listeners != null\n }\n\n public addEventListener (type, handler, options) {\n const name = this.nodeName\n const SPECIAL_NODES = this.hooks.getSpecialNodes()\n\n if (!this.isAnyEventBinded() && SPECIAL_NODES.indexOf(name) > -1) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: name\n })\n }\n\n super.addEventListener(type, handler, options)\n }\n\n public removeEventListener (type, handler) {\n super.removeEventListener(type, handler)\n\n const name = this.nodeName\n const SPECIAL_NODES = this.hooks.getSpecialNodes()\n\n if (!this.isAnyEventBinded() && SPECIAL_NODES.indexOf(name) > -1) {\n this.enqueueUpdate({\n path: `${this._path}.${Shortcuts.NodeName}`,\n value: isHasExtractProp(this) ? `static-${name}` : `pure-${name}`\n })\n }\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 */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n}\n\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nexport default baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n","import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n}\n\nexport default isKey;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\nexport default toSource;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\nfunction baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\nexport default listCacheClear;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n}\n\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}\n\nexport default mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n}\n\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n","import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n}\n\nexport default memoizeCapped;\n","import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n});\n\nexport default stringToPath;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\nexport default arrayMap;\n","import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default baseToString;\n","import baseToString from './_baseToString.js';\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n","import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default toKey;\n","import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n}\n\nexport default baseGet;\n","import baseGet from './_baseGet.js';\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n}\n\nexport default get;\n","import type { Options } from './interface'\n\nexport const options: Options = {\n prerender: true,\n debug: false\n}\n","import { options } from './options'\n\nclass Performance {\n private recorder = new Map()\n\n public start (id: string) {\n if (!options.debug) {\n return\n }\n this.recorder.set(id, Date.now())\n }\n\n public stop (id: string) {\n if (!options.debug) {\n return\n }\n const now = Date.now()\n const prev = this.recorder.get(id)!\n const time = now - prev\n // eslint-disable-next-line no-console\n console.log(`${id} 时长： ${time}ms`)\n }\n}\n\nexport const perf = new Performance()\n","import { inject, injectable } from 'inversify'\nimport { isFunction, Shortcuts } from '@tarojs/shared'\nimport get from 'lodash-es/get'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroElement } from './element'\nimport { incrementId } from '../utils'\nimport { perf } from '../perf'\nimport { options } from '../options'\nimport {\n SET_DATA,\n PAGE_INIT,\n ROOT_STR,\n CUSTOM_WRAPPER\n} from '../constants'\n\nimport type { Func, UpdatePayload, UpdatePayloadValue, InstanceNamedFactory, MpInstance, HydratedData } from '../interface'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\nimport type { Events } from '../emitter/emitter'\n\nconst eventIncrementId = incrementId()\n\n@injectable()\nexport class TaroRootElement extends TaroElement {\n private pendingFlush = false\n\n private updatePayloads: UpdatePayload[] = []\n\n private updateCallbacks: Func[]= []\n\n private eventCenter: Events\n\n public pendingUpdate = false\n\n public ctx: null | MpInstance = null\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl,\n @inject(SERVICE_IDENTIFIER.eventCenter) eventCenter: Events\n ) {\n super(nodeImpl, getElement, hooks, elementImpl)\n this.nodeName = ROOT_STR\n this.eventCenter = eventCenter\n }\n\n public get _path (): string {\n return ROOT_STR\n }\n\n protected get _root (): TaroRootElement {\n return this\n }\n\n public enqueueUpdate (payload: UpdatePayload): void {\n this.updatePayloads.push(payload)\n\n if (!this.pendingUpdate && this.ctx !== null) {\n this.performUpdate()\n }\n }\n\n public performUpdate (initRender = false, prerender?: Func) {\n this.pendingUpdate = true\n\n const ctx = this.ctx!\n\n setTimeout(() => {\n perf.start(SET_DATA)\n const data: Record> = Object.create(null)\n const resetPaths = new Set(\n initRender\n ? ['root.cn.[0]', 'root.cn[0]']\n : []\n )\n\n while (this.updatePayloads.length > 0) {\n const { path, value } = this.updatePayloads.shift()!\n if (path.endsWith(Shortcuts.Childnodes)) {\n resetPaths.add(path)\n }\n data[path] = value\n }\n\n for (const path in data) {\n resetPaths.forEach(p => {\n // 已经重置了数组，就不需要分别再设置了\n if (path.includes(p) && path !== p) {\n delete data[path]\n }\n })\n\n const value = data[path]\n if (isFunction(value)) {\n data[path] = value()\n }\n }\n\n if (isFunction(prerender)) {\n prerender(data)\n } else {\n this.pendingUpdate = false\n const customWrapperUpdate: { ctx: any, data: Record }[] = []\n const customWrapperMap: Map, Record> = new Map()\n const normalUpdate = {}\n if (!initRender) {\n for (const p in data) {\n const dataPathArr = p.split('.')\n let hasCustomWrapper = false\n for (let i = dataPathArr.length; i > 0; i--) {\n const allPath = dataPathArr.slice(0, i).join('.')\n const getData = get(ctx.__data__ || ctx.data, allPath)\n if (getData && getData.nn && getData.nn === CUSTOM_WRAPPER) {\n const customWrapperId = getData.uid\n const customWrapper = ctx.selectComponent(`#${customWrapperId}`)\n const splitedPath = dataPathArr.slice(i).join('.')\n if (customWrapper) {\n hasCustomWrapper = true\n customWrapperMap.set(customWrapper, { ...(customWrapperMap.get(customWrapper) || {}), [`i.${splitedPath}`]: data[p] })\n }\n break\n }\n }\n if (!hasCustomWrapper) {\n normalUpdate[p] = data[p]\n }\n }\n if (customWrapperMap.size > 0) {\n customWrapperMap.forEach((data, ctx) => {\n customWrapperUpdate.push({ ctx, data })\n })\n }\n }\n const updateArrLen = customWrapperUpdate.length\n if (updateArrLen) {\n const eventId = `${this._path}_update_${eventIncrementId()}`\n const eventCenter = this.eventCenter\n let executeTime = 0\n eventCenter.once(eventId, () => {\n executeTime++\n if (executeTime === updateArrLen + 1) {\n perf.stop(SET_DATA)\n if (!this.pendingFlush) {\n this.flushUpdateCallback()\n }\n if (initRender) {\n perf.stop(PAGE_INIT)\n }\n }\n }, eventCenter)\n customWrapperUpdate.forEach(item => {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('custom wrapper setData: ', item.data)\n }\n item.ctx.setData(item.data, () => {\n eventCenter.trigger(eventId)\n })\n })\n if (Object.keys(normalUpdate).length) {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('setData:', normalUpdate)\n }\n ctx.setData(normalUpdate, () => {\n eventCenter.trigger(eventId)\n })\n }\n } else {\n if (process.env.NODE_ENV !== 'production' && options.debug) {\n // eslint-disable-next-line no-console\n console.log('setData:', data)\n }\n ctx.setData(data, () => {\n perf.stop(SET_DATA)\n if (!this.pendingFlush) {\n this.flushUpdateCallback()\n }\n if (initRender) {\n perf.stop(PAGE_INIT)\n }\n })\n }\n }\n }, 0)\n }\n\n public enqueueUpdateCallback (cb: Func, ctx?: Record) {\n this.updateCallbacks.push(() => {\n ctx ? cb.call(ctx) : cb()\n })\n }\n\n public flushUpdateCallback () {\n this.pendingFlush = false\n const copies = this.updateCallbacks.slice(0)\n this.updateCallbacks.length = 0\n for (let i = 0; i < copies.length; i++) {\n copies[i]()\n }\n }\n}\n","import { TaroElement } from './element'\nimport {\n VALUE,\n INPUT,\n CHANGE\n} from '../constants'\n\nimport type { TaroEvent } from './event'\n\nexport class FormElement extends TaroElement {\n public get value () {\n // eslint-disable-next-line dot-notation\n const val = this.props[VALUE]\n return val == null ? '' : val\n }\n\n public set value (val: string | boolean | number | any[]) {\n this.setAttribute(VALUE, val)\n }\n\n public dispatchEvent (event: TaroEvent) {\n if (event.mpEvent) {\n const val = event.mpEvent.detail.value\n if (event.type === CHANGE) {\n this.props.value = val as string\n } else if (event.type === INPUT) {\n // Web 规范中表单组件的 value 应该跟着输入改变\n // 只是改 this.props.value 的话不会进行 setData，因此这里修改 this.value。\n // 只测试了 React、Vue、Vue3 input 组件的 onInput 事件，onChange 事件不确定有没有副作用，所以暂不修改。\n this.value = val as string\n }\n }\n\n return super.dispatchEvent(event)\n }\n}\n","import { TaroElement } from './element'\n\n// for Vue3\nexport class SVGElement extends TaroElement {}\n","import { options } from '../../options'\n\ninterface Position {\n index: number\n column: number\n line: number\n}\n\nexport interface Token {\n type: string\n content?: string\n position?: {\n start?: Position\n end?: Position\n }\n close?: boolean\n}\n\nfunction initPosition (): Position {\n return {\n index: 0,\n column: 0,\n line: 0\n }\n}\n\nfunction feedPosition (position: Position, str: string, len: number) {\n const start = position.index\n const end = position.index = start + len\n for (let i = start; i < end; i++) {\n const char = str.charAt(i)\n if (char === '\\n') {\n position.line++\n position.column = 0\n } else {\n position.column++\n }\n }\n}\n\nfunction jumpPosition (position: Position, str: string, end: number) {\n const len = end - position.index\n return feedPosition(position, str, len)\n}\n\nfunction copyPosition (position: Position) {\n return {\n index: position.index,\n line: position.line,\n column: position.column\n }\n}\n\nconst whitespace = /\\s/\nfunction isWhitespaceChar (char: string) {\n return whitespace.test(char)\n}\n\nconst equalSign = /=/\nfunction isEqualSignChar (char: string) {\n return equalSign.test(char)\n}\n\nfunction shouldBeIgnore (tagName: string) {\n const name = tagName.toLowerCase()\n if (options.html!.skipElements.has(name)) {\n return true\n }\n return false\n}\n\nconst alphanumeric = /[A-Za-z0-9]/\n\nfunction findTextEnd (str: string, index: number) {\n while (true) {\n const textEnd = str.indexOf('<', index)\n if (textEnd === -1) {\n return textEnd\n }\n const char = str.charAt(textEnd + 1)\n if (char === '/' || char === '!' || alphanumeric.test(char)) {\n return textEnd\n }\n index = textEnd + 1\n }\n}\n\nfunction isWordEnd (cursor: number, wordBegin: number, html: string) {\n if (!isWhitespaceChar(html.charAt(cursor))) return false\n\n const len = html.length\n\n // backwrad\n for (let i = cursor - 1; i > wordBegin; i--) {\n const char = html.charAt(i)\n if (!isWhitespaceChar(char)) {\n if (isEqualSignChar(char)) return false\n break\n }\n }\n\n // forward\n for (let i = cursor + 1; i < len; i++) {\n const char = html.charAt(i)\n if (!isWhitespaceChar(char)) {\n if (isEqualSignChar(char)) return false\n return true\n }\n }\n}\n\nexport class Scaner {\n private tokens: Token[] = []\n\n private position: Position = initPosition()\n\n private html: string\n\n constructor (html: string) {\n this.html = html\n }\n\n public scan (): Token[] {\n const { html, position } = this\n const len = html.length\n\n while (position.index < len) {\n const start = position.index\n this.scanText()\n if (position.index === start) {\n const isComment = html.startsWith('!--', start + 1)\n if (isComment) {\n this.scanComment()\n } else {\n const tagName = this.scanTag()\n if (shouldBeIgnore(tagName)) {\n this.scanSkipTag(tagName)\n }\n }\n }\n }\n\n return this.tokens\n }\n\n private scanText () {\n const type = 'text'\n const { html, position } = this\n let textEnd = findTextEnd(html, position.index)\n if (textEnd === position.index) {\n return\n }\n if (textEnd === -1) {\n textEnd = html.length\n }\n\n const start = copyPosition(position)\n const content = html.slice(position.index, textEnd)\n jumpPosition(position, html, textEnd)\n const end = copyPosition(position)\n this.tokens.push({ type, content, position: { start, end } })\n }\n\n private scanComment () {\n const type = 'comment'\n const { html, position } = this\n const start = copyPosition(position)\n feedPosition(position, html, 4) // \"', position.index)\n let commentEnd = contentEnd + 3 // \"-->\".length\n if (contentEnd === -1) {\n contentEnd = commentEnd = html.length\n }\n\n const content = html.slice(position.index, contentEnd)\n jumpPosition(position, html, commentEnd)\n this.tokens.push({\n type,\n content,\n position: {\n start,\n end: copyPosition(position)\n }\n })\n }\n\n private scanTag () {\n this.scanTagStart()\n const tagName = this.scanTagName()\n this.scanAttrs()\n this.scanTagEnd()\n\n return tagName\n }\n\n private scanTagStart () {\n const type = 'tag-start'\n const { html, position } = this\n\n const secondChar = html.charAt(position.index + 1)\n const close = secondChar === '/'\n const start = copyPosition(position)\n feedPosition(position, html, close ? 2 : 1)\n this.tokens.push({ type, close, position: { start } })\n }\n\n private scanTagEnd () {\n const type = 'tag-end'\n const { html, position } = this\n\n const firstChar = html.charAt(position.index)\n const close = firstChar === '/'\n feedPosition(position, html, close ? 2 : 1)\n const end = copyPosition(position)\n this.tokens.push({ type, close, position: { end } })\n }\n\n private scanTagName (): string {\n const type = 'tag'\n const { html, position } = this\n const len = html.length\n let start = position.index\n while (start < len) {\n const char = html.charAt(start)\n const isTagChar = !(isWhitespaceChar(char) || char === '/' || char === '>')\n if (isTagChar) break\n start++\n }\n\n let end = start + 1\n while (end < len) {\n const char = html.charAt(end)\n const isTagChar = !(isWhitespaceChar(char) || char === '/' || char === '>')\n if (!isTagChar) break\n end++\n }\n\n jumpPosition(position, html, end)\n const tagName = html.slice(start, end)\n this.tokens.push({\n type,\n content: tagName\n })\n\n return tagName\n }\n\n private scanAttrs () {\n const { html, position, tokens } = this\n let cursor = position.index\n let quote: string | null = null // null, single-, or double-quote\n let wordBegin = cursor // index of word start\n const words: string[] = [] // \"key\", \"key=value\", \"key='value'\", etc\n const len = html.length\n while (cursor < len) {\n const char = html.charAt(cursor)\n if (quote) {\n const isQuoteEnd = char === quote\n if (isQuoteEnd) {\n quote = null\n }\n cursor++\n continue\n }\n\n const isTagEnd = char === '/' || char === '>'\n if (isTagEnd) {\n if (cursor !== wordBegin) {\n words.push(html.slice(wordBegin, cursor))\n }\n break\n }\n\n if (isWordEnd(cursor, wordBegin, html)) {\n if (cursor !== wordBegin) {\n words.push(html.slice(wordBegin, cursor))\n }\n wordBegin = cursor + 1\n cursor++\n continue\n }\n\n const isQuoteStart = char === '\\'' || char === '\"'\n if (isQuoteStart) {\n quote = char\n cursor++\n continue\n }\n\n cursor++\n }\n\n jumpPosition(position, html, cursor)\n\n const wLen = words.length\n const type = 'attribute'\n for (let i = 0; i < wLen; i++) {\n const word = words[i]\n const isNotPair = word.includes('=')\n if (isNotPair) {\n const secondWord = words[i + 1]\n if (secondWord && secondWord.startsWith('=')) {\n if (secondWord.length > 1) {\n const newWord = word + secondWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n const thirdWord = words[i + 2]\n i += 1\n if (thirdWord) {\n const newWord = word + '=' + thirdWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n }\n }\n if (word.endsWith('=')) {\n const secondWord = words[i + 1]\n if (secondWord && !secondWord.includes('=')) {\n const newWord = word + secondWord\n tokens.push({ type, content: newWord })\n i += 1\n continue\n }\n\n const newWord = word.slice(0, -1)\n tokens.push({ type, content: newWord })\n continue\n }\n\n tokens.push({ type, content: word })\n }\n }\n\n private scanSkipTag (tagName: string) {\n const { html, position } = this\n const safeTagName = tagName.toLowerCase()\n const len = html.length\n while (position.index < len) {\n const nextTag = html.indexOf(' boolean {\n const map: Record = Object.create(null)\n const list: Array = str.split(',')\n for (let i = 0; i < list.length; i++) {\n map[list[i]] = true\n }\n return expectsLowerCase ? val => !!map[val.toLowerCase()] : val => !!map[val]\n}\n\nexport const specialMiniElements = {\n img: 'image',\n iframe: 'web-view'\n}\n\nconst internalCompsList = Object.keys(internalComponents)\n .map(i => i.toLowerCase())\n .join(',')\n\n// https://developers.weixin.qq.com/miniprogram/dev/component\nexport const isMiniElements = makeMap(internalCompsList, true)\n\n// https://developer.mozilla.org/en-US/docs/Web/HTML/Inline_elements\nexport const isInlineElements = makeMap('a,i,abbr,iframe,select,acronym,slot,small,span,bdi,kbd,strong,big,map,sub,sup,br,mark,mark,meter,template,canvas,textarea,cite,object,time,code,output,u,data,picture,tt,datalist,var,dfn,del,q,em,s,embed,samp,b', true)\n\n// https://developer.mozilla.org/en-US/docs/Web/HTML/Block-level_elements\nexport const isBlockElements = makeMap('address,fieldset,li,article,figcaption,main,aside,figure,nav,blockquote,footer,ol,details,form,p,dialog,h1,h2,h3,h4,h5,h6,pre,dd,header,section,div,hgroup,table,dl,hr,ul,dt', true)\n","export function unquote (str: string): string {\n const car = str.charAt(0)\n const end = str.length - 1\n const isQuoteStart = car === '\"' || car === \"'\"\n if (isQuoteStart && car === str.charAt(end)) {\n return str.slice(1, end)\n }\n return str\n}\n","import { NodeType } from '../../dom/node_types'\nimport { unquote } from './utils'\n\nimport type { TaroNode } from '../../dom/node'\nimport type { ParsedTaroElement } from './parser'\n\nconst LEFT_BRACKET = '{'\nconst RIGHT_BRACKET = '}'\nconst CLASS_SELECTOR = '.'\nconst ID_SELECTOR = '#'\nconst CHILD_COMBINATOR = '>'\nconst GENERAL_SIBLING_COMBINATOR = '~'\nconst ADJACENT_SIBLING_COMBINATOR = '+'\n\ninterface ISelector {\n isChild: boolean\n isGeneralSibling: boolean\n isAdjacentSibling: boolean\n tag: string | null\n id: string | null\n class: string[]\n attrs: {\n all: boolean\n key: string\n value?: string | null\n }[]\n}\n\ninterface IStyle {\n content: string\n selectorList: ISelector[]\n}\n\nexport default class StyleTagParser {\n styles: IStyle[]= []\n\n extractStyle (src: string) {\n const REG_STYLE = /]*>((.|\\n|\\s)+?)<\\/style>/g\n let html = src\n // let html = src.replace(/\\n/g, '')\n\n html = html.replace(REG_STYLE, (_, $1: string) => {\n const style = $1.trim()\n this.stringToSelector(style)\n return ''\n })\n\n return html.trim()\n }\n\n stringToSelector (style: string) {\n let lb = style.indexOf(LEFT_BRACKET)\n\n while (lb > -1) {\n const rb = style.indexOf(RIGHT_BRACKET)\n const selectors = style.slice(0, lb).trim()\n\n let content = style.slice(lb + 1, rb)\n content = content.replace(/:(.*);/g, function (_, $1) {\n const t = $1.trim().replace(/ +/g, '+++')\n return `:${t};`\n })\n content = content.replace(/ /g, '')\n content = content.replace(/\\+\\+\\+/g, ' ')\n\n if (!(/;$/.test(content))) {\n content += ';'\n }\n selectors.split(',').forEach(src => {\n const selectorList = this.parseSelector(src)\n this.styles.push({\n content,\n selectorList\n })\n })\n style = style.slice(rb + 1)\n lb = style.indexOf(LEFT_BRACKET)\n }\n // console.log('res this.styles: ', this.styles)\n }\n\n parseSelector (src: string) {\n // todo: 属性选择器里可以带空格：[a = \"b\"]，这里的 split(' ') 需要作兼容\n const list = src.trim().replace(/ *([>~+]) */g, ' $1').replace(/ +/g, ' ').split(' ')\n const selectors = list.map(item => {\n const firstChar = item.charAt(0)\n const selector: ISelector = {\n isChild: firstChar === CHILD_COMBINATOR,\n isGeneralSibling: firstChar === GENERAL_SIBLING_COMBINATOR,\n isAdjacentSibling: firstChar === ADJACENT_SIBLING_COMBINATOR,\n tag: null,\n id: null,\n class: [],\n attrs: []\n }\n\n item = item.replace(/^[>~+]/, '')\n\n // 属性选择器\n item = item.replace(/\\[(.+?)\\]/g, function (_, $1: string) {\n const [key, value] = $1.split('=')\n const all = $1.indexOf('=') === -1\n\n const attr = {\n all,\n key,\n value: all ? null : value\n }\n selector.attrs.push(attr)\n return ''\n })\n\n item = item.replace(/([.#][A-Za-z0-9-_]+)/g, function (_, $1: string) {\n if ($1[0] === ID_SELECTOR) {\n // id 选择器\n selector.id = $1.substr(1)\n } else if ($1[0] === CLASS_SELECTOR) {\n // class 选择器\n selector.class.push($1.substr(1))\n }\n return ''\n })\n\n // 标签选择器\n if (item !== '') {\n selector.tag = item\n }\n\n return selector\n })\n return selectors\n }\n\n matchStyle (tagName: string, el: ParsedTaroElement, list: number[]): string {\n const res = sortStyles(this.styles).reduce((str, { content, selectorList }, i) => {\n let idx = list[i]\n let selector = selectorList[idx]\n const nextSelector = selectorList[idx + 1]\n\n if (nextSelector?.isGeneralSibling || nextSelector?.isAdjacentSibling) {\n selector = nextSelector\n idx += 1\n list[i] += 1\n }\n\n let isMatch = this.matchCurrent(tagName, el, selector)\n\n if (isMatch && selector.isGeneralSibling) {\n let prev: ParsedTaroElement = getPreviousElement(el)\n while (prev) {\n if (prev.h5tagName && this.matchCurrent(prev.h5tagName, prev, selectorList[idx - 1])) {\n isMatch = true\n break\n }\n prev = getPreviousElement(prev)\n isMatch = false\n }\n }\n if (isMatch && selector.isAdjacentSibling) {\n const prev: ParsedTaroElement = getPreviousElement(el)\n if (!prev || !prev.h5tagName) {\n isMatch = false\n } else {\n const isSiblingMatch = this.matchCurrent(prev.h5tagName, prev, selectorList[idx - 1])\n if (!isSiblingMatch) {\n isMatch = false\n }\n }\n }\n\n if (isMatch) {\n if (idx === selectorList.length - 1) {\n return str + content\n } else if (idx < selectorList.length - 1) {\n list[i] += 1\n }\n } else {\n // 直接子代组合器: >\n if (selector.isChild && idx > 0) {\n list[i] -= 1\n if (this.matchCurrent(tagName, el, selectorList[list[i]])) {\n list[i] += 1\n }\n }\n }\n\n return str\n }, '')\n return res\n }\n\n matchCurrent (tagName: string, el: ParsedTaroElement, selector: ISelector): boolean {\n // 标签选择器\n if (selector.tag && selector.tag !== tagName) return false\n\n // id 选择器\n if (selector.id && selector.id !== el.id) return false\n\n // class 选择器\n if (selector.class.length) {\n const classList = el.className.split(' ')\n for (let i = 0; i < selector.class.length; i++) {\n const cls = selector.class[i]\n if (classList.indexOf(cls) === -1) {\n return false\n }\n }\n }\n\n // 属性选择器\n if (selector.attrs.length) {\n for (let i = 0; i < selector.attrs.length; i++) {\n const { all, key, value } = selector.attrs[i]\n if (all && !el.hasAttribute(key)) {\n return false\n } else {\n const attr = el.getAttribute(key)\n if (attr !== unquote(value || '')) {\n return false\n }\n }\n }\n }\n\n return true\n }\n}\n\nfunction getPreviousElement (el: TaroNode) {\n const parent = el.parentElement\n if (!parent) return null\n\n const prev = el.previousSibling\n if (!prev) return null\n\n if (prev.nodeType === NodeType.ELEMENT_NODE) {\n return prev\n } else {\n return getPreviousElement(prev)\n }\n}\n\n// 根据 css selector 权重排序: 权重大的靠后\n// @WARN 不考虑伪类\n// https://developer.mozilla.org/en-US/docs/Learn/CSS/Building_blocks/Cascade_and_inheritance#specificity_2\nfunction sortStyles (styles: IStyle[]) {\n return styles.sort((s1, s2) => {\n const hundreds1 = getHundredsWeight(s1.selectorList)\n const hundreds2 = getHundredsWeight(s2.selectorList)\n\n if (hundreds1 !== hundreds2) return hundreds1 - hundreds2\n\n const tens1 = getTensWeight(s1.selectorList)\n const tens2 = getTensWeight(s2.selectorList)\n\n if (tens1 !== tens2) return tens1 - tens2\n\n const ones1 = getOnesWeight(s1.selectorList)\n const ones2 = getOnesWeight(s2.selectorList)\n\n return ones1 - ones2\n })\n}\n\nfunction getHundredsWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + (cur.id ? 1 : 0), 0)\n}\n\nfunction getTensWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + cur.class.length + cur.attrs.length, 0)\n}\n\nfunction getOnesWeight (selectors: ISelector[]) {\n return selectors.reduce((pre, cur) => pre + (cur.tag ? 1 : 0), 0)\n}\n","import { isFunction } from '@tarojs/shared'\nimport { Scaner, Token } from './scaner'\nimport { options } from '../../options'\nimport { specialMiniElements, isMiniElements, isBlockElements, isInlineElements } from './tags'\nimport StyleTagParser from './style'\nimport { unquote } from './utils'\n\nimport type { TaroElement } from '../../dom/element'\nimport type { TaroDocument } from '../../dom/document'\n\ninterface State {\n tokens: Token[]\n cursor: number\n stack: Element[]\n}\n\nconst closingTagAncestorBreakers = {\n li: ['ul', 'ol', 'menu'],\n dt: ['dl'],\n dd: ['dl'],\n tbody: ['table'],\n thead: ['table'],\n tfoot: ['table'],\n tr: ['table'],\n td: ['table']\n}\n\ninterface Node {\n type: string;\n}\n\ninterface Comment extends Node {\n type: 'comment'\n content: string\n}\n\nexport interface Text extends Node {\n type: 'text'\n content: string\n}\n\nexport interface Element extends Node {\n type: 'element'\n tagName: string\n children: ChildNode[]\n attributes: string[]\n}\n\nexport interface ParsedTaroElement extends TaroElement{\n h5tagName?: string\n}\n\ntype ChildNode = Comment | Text | Element\n\nfunction hasTerminalParent (tagName: string, stack: Element[]) {\n const tagParents: undefined | string[] = closingTagAncestorBreakers[tagName]\n if (tagParents) {\n let currentIndex = stack.length - 1\n while (currentIndex >= 0) {\n const parentTagName = stack[currentIndex].tagName\n if (parentTagName === tagName) {\n break\n }\n if (tagParents && tagParents.includes(parentTagName!)) {\n return true\n }\n currentIndex--\n }\n }\n return false\n}\n\nfunction getTagName (tag: string) {\n if (options.html!.renderHTMLTag) {\n return tag\n }\n\n if (specialMiniElements[tag]) {\n return specialMiniElements[tag]\n } else if (isMiniElements(tag)) {\n return tag\n } else if (isBlockElements(tag)) {\n return 'view'\n } else if (isInlineElements(tag)) {\n return 'text'\n }\n\n return 'view'\n}\n\nfunction splitEqual (str: string) {\n const sep = '='\n const idx = str.indexOf(sep)\n if (idx === -1) return [str]\n const key = str.slice(0, idx).trim()\n const value = str.slice(idx + sep.length).trim()\n return [key, value]\n}\n\nfunction format (\n children: ChildNode[],\n document: TaroDocument,\n styleOptions: {\n styleTagParser: StyleTagParser\n descendantList: number[]\n },\n parent?: TaroElement\n) {\n return children\n .filter(child => {\n // 过滤注释和空文本节点\n if (child.type === 'comment') {\n return false\n } else if (child.type === 'text') {\n return child.content !== ''\n }\n return true\n })\n .map((child: Text | Element) => {\n // 文本节点\n if (child.type === 'text') {\n const text = document.createTextNode(child.content)\n if (isFunction(options.html!.transformText)) {\n return options.html!.transformText(text, child)\n }\n parent?.appendChild(text)\n return text\n }\n\n const el: ParsedTaroElement = document.createElement(getTagName(child.tagName))\n el.h5tagName = child.tagName\n\n parent?.appendChild(el)\n\n if (!options.html!.renderHTMLTag) {\n el.className = `h5-${child.tagName}`\n }\n\n for (let i = 0; i < child.attributes.length; i++) {\n const attr = child.attributes[i]\n const [key, value] = splitEqual(attr)\n if (key === 'class') {\n el.className += ' ' + unquote(value)\n } else if (key[0] === 'o' && key[1] === 'n') {\n continue\n } else {\n el.setAttribute(key, value == null ? true : unquote(value))\n }\n }\n\n const { styleTagParser, descendantList } = styleOptions\n const list = descendantList.slice()\n const style = styleTagParser.matchStyle(child.tagName, el, list)\n\n el.setAttribute('style', style + el.style.cssText)\n // console.log('style, ', style)\n\n format(child.children, document, {\n styleTagParser,\n descendantList: list\n }, el)\n\n if (isFunction(options.html!.transformElement)) {\n return options.html!.transformElement(el, child)\n }\n\n return el\n })\n}\n\nexport function parser (html: string, document: TaroDocument) {\n const styleTagParser = new StyleTagParser()\n html = styleTagParser.extractStyle(html)\n\n const tokens = new Scaner(html).scan()\n\n const root: Element = { tagName: '', children: [], type: 'element', attributes: [] }\n\n const state = { tokens, options, cursor: 0, stack: [root] }\n parse(state)\n\n return format(root.children, document, {\n styleTagParser,\n descendantList: Array(styleTagParser.styles.length).fill(0)\n })\n}\n\nfunction parse (state: State) {\n const { tokens, stack } = state\n let { cursor } = state\n\n const len = tokens.length\n\n let nodes = stack[stack.length - 1].children\n\n while (cursor < len) {\n const token = tokens[cursor]\n if (token.type !== 'tag-start') {\n // comment or text\n nodes.push(token as ChildNode)\n cursor++\n continue\n }\n\n const tagToken = tokens[++cursor]\n cursor++\n const tagName = tagToken.content!.toLowerCase()\n if (token.close) {\n let index = stack.length\n let shouldRewind = false\n while (--index > -1) {\n if (stack[index].tagName === tagName) {\n shouldRewind = true\n break\n }\n }\n while (cursor < len) {\n const endToken = tokens[cursor]\n if (endToken.type !== 'tag-end') break\n cursor++\n }\n if (shouldRewind) {\n stack.splice(index)\n break\n } else {\n continue\n }\n }\n\n const isClosingTag = options.html!.closingElements.has(tagName)\n let shouldRewindToAutoClose = isClosingTag\n if (shouldRewindToAutoClose) {\n shouldRewindToAutoClose = !hasTerminalParent(tagName, stack)\n }\n\n if (shouldRewindToAutoClose) {\n let currentIndex = stack.length - 1\n while (currentIndex > 0) {\n if (tagName === stack[currentIndex].tagName) {\n stack.splice(currentIndex)\n const previousIndex = currentIndex - 1\n nodes = stack[previousIndex].children\n break\n }\n currentIndex = currentIndex - 1\n }\n }\n\n const attributes: string[] = []\n let attrToken: Token\n while (cursor < len) {\n attrToken = tokens[cursor]\n if (attrToken.type === 'tag-end') break\n attributes.push(attrToken.content!)\n cursor++\n }\n\n cursor++\n const children: Element[] = []\n const element: Element = {\n type: 'element',\n tagName: tagToken.content!,\n attributes,\n children\n }\n nodes.push(element)\n\n const hasChildren = !(attrToken!.close || options.html!.voidElements.has(tagName))\n if (hasChildren) {\n stack.push({ tagName, children } as any)\n const innerState: State = { tokens, cursor, stack }\n parse(innerState)\n cursor = innerState.cursor\n }\n }\n\n state.cursor = cursor\n}\n","import { parser } from './parser'\nimport { options } from '../../options'\n\nimport type { TaroNode } from '../../dom/node'\nimport type { TaroDocument } from '../../dom/document'\n\noptions.html = {\n skipElements: new Set(['style', 'script']),\n voidElements: new Set([\n '!doctype', 'area', 'base', 'br', 'col', 'command',\n 'embed', 'hr', 'img', 'input', 'keygen', 'link',\n 'meta', 'param', 'source', 'track', 'wbr'\n ]),\n closingElements: new Set([\n 'html', 'head', 'body', 'p', 'dt', 'dd', 'li', 'option',\n 'thead', 'th', 'tbody', 'tr', 'td', 'tfoot', 'colgroup'\n ]),\n renderHTMLTag: false\n}\n\nexport function setInnerHTML (element: TaroNode, html: string, getDoc: () => TaroDocument) {\n while (element.firstChild) {\n element.removeChild(element.firstChild)\n }\n const children = parser(html, getDoc())\n\n for (let i = 0; i < children.length; i++) {\n element.appendChild(children[i])\n }\n}\n","import {\n STYLE,\n DATASET,\n PROPS,\n OBJECT\n} from '../constants'\nimport { parser } from '../dom-external/inner-html/parser'\nimport { GetDoc } from '../interface'\nimport { NodeType } from '../dom/node_types'\n\nimport type { Ctx } from '../interface'\n\nexport type IPosition = 'beforebegin' | 'afterbegin' | 'beforeend' | 'afterend'\n\n/**\n * An implementation of `Element.insertAdjacentHTML()`\n * to support Vue 3 with a version of or greater than `vue@3.1.2`\n */\nexport function insertAdjacentHTMLImpl (\n position: IPosition,\n html: string,\n getDoc: GetDoc\n) {\n const parsedNodes = parser(html, getDoc())\n\n for (let i = 0; i < parsedNodes.length; i++) {\n const n = parsedNodes[i]\n\n switch (position) {\n case 'beforebegin':\n this.parentNode?.insertBefore(n, this)\n break\n case 'afterbegin':\n if (this.hasChildNodes()) {\n this.insertBefore(n, this.childNodes[0])\n } else {\n this.appendChild(n)\n }\n break\n case 'beforeend':\n this.appendChild(n)\n break\n case 'afterend':\n this.parentNode?.appendChild(n)\n break\n }\n }\n}\n\nexport function cloneNode (ctx: Ctx, getDoc, isDeep = false) {\n const document = getDoc()\n let newNode\n\n if (ctx.nodeType === NodeType.ELEMENT_NODE) {\n newNode = document.createElement(ctx.nodeName)\n } else if (ctx.nodeType === NodeType.TEXT_NODE) {\n newNode = document.createTextNode('')\n }\n\n for (const key in this) {\n const value: any = this[key]\n if ([PROPS, DATASET].includes(key) && typeof value === OBJECT) {\n newNode[key] = { ...value }\n } else if (key === '_value') {\n newNode[key] = value\n } else if (key === STYLE) {\n newNode.style._value = { ...value._value }\n newNode.style._usedStyleProp = new Set(Array.from(value._usedStyleProp))\n }\n }\n\n if (isDeep) {\n newNode.childNodes = ctx.childNodes.map(node => node.cloneNode(true))\n }\n\n return newNode\n}\n","import { inject, injectable } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { ElementNames, InstanceNamedFactory } from '../interface'\nimport { setInnerHTML } from '../dom-external/inner-html/html'\nimport { cloneNode, insertAdjacentHTMLImpl } from './node'\n\nimport type { Ctx, GetDoc } from '../interface'\nimport type { TaroDocument } from '../dom/document'\nimport type { IPosition } from './node'\n\ndeclare const ENABLE_INNER_HTML: boolean\ndeclare const ENABLE_ADJACENT_HTML: boolean\ndeclare const ENABLE_CLONE_NODE: boolean\n\n@injectable()\nexport class TaroNodeImpl {\n public getDoc: GetDoc\n\n constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory\n ) {\n this.getDoc = () => getElement(ElementNames.Document)()\n }\n\n public bind (ctx: Ctx) {\n const getDoc = this.getDoc\n\n if (ENABLE_INNER_HTML) {\n bindInnerHTML(ctx, getDoc)\n if (ENABLE_ADJACENT_HTML) {\n bindAdjacentHTML(ctx, getDoc)\n }\n }\n if (ENABLE_CLONE_NODE) {\n ctx.cloneNode = cloneNode.bind(ctx, ctx, getDoc)\n }\n }\n}\n\nfunction bindInnerHTML (ctx, getDoc) {\n Object.defineProperty(ctx, 'innerHTML', {\n configurable: true,\n enumerable: true,\n set (html: string) {\n setInnerHTML.call(ctx, ctx, html, getDoc)\n },\n get (): string {\n return ''\n }\n })\n}\n\nfunction bindAdjacentHTML (ctx, getDoc) {\n ctx.insertAdjacentHTML = function (position: IPosition, html: string) {\n insertAdjacentHTMLImpl.call(ctx, position, html, getDoc)\n }\n}\n","import { options } from '../options'\nimport { ElementNames } from '../interface'\nimport { DOCUMENT_FRAGMENT } from '../constants'\n\nimport type { Ctx } from '../interface'\n\nexport function getBoundingClientRectImpl (): Promise {\n if (!options.miniGlobal) return Promise.resolve(null)\n return new Promise(resolve => {\n const query = options.miniGlobal.createSelectorQuery()\n query.select(`#${this.uid}`).boundingClientRect(res => {\n resolve(res)\n }).exec()\n })\n}\n\nexport function getTemplateContent (ctx: Ctx): string | undefined {\n if (ctx.nodeName === 'template') {\n const content = ctx._getElement(ElementNames.Element)(DOCUMENT_FRAGMENT)\n content.childNodes = ctx.childNodes\n ctx.childNodes = [content]\n content.parentNode = ctx\n content.childNodes.forEach(nodes => {\n nodes.parentNode = content\n })\n return content\n }\n}\n","import { injectable } from 'inversify'\nimport { getBoundingClientRectImpl, getTemplateContent } from './element'\n\nimport type { Ctx } from '../interface'\n\ndeclare const ENABLE_SIZE_APIS: boolean\ndeclare const ENABLE_TEMPLATE_CONTENT: boolean\n\n@injectable()\nexport class TaroElementImpl {\n bind (ctx: Ctx) {\n if (ENABLE_SIZE_APIS) {\n ctx.getBoundingClientRect = async function (...args: any[]) {\n return await getBoundingClientRectImpl.apply(ctx, args)\n }\n }\n if (ENABLE_TEMPLATE_CONTENT) {\n bindContent(ctx)\n }\n }\n}\n\nfunction bindContent (ctx: Ctx) {\n Object.defineProperty(ctx, 'content', {\n configurable: true,\n enumerable: true,\n get () {\n return getTemplateContent(ctx)\n }\n })\n}\n","import { inject, injectable } from 'inversify'\nimport { controlledComponent, isUndefined } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroElement } from '../dom/element'\nimport { NodeType } from '../dom/node_types'\nimport { eventSource } from '../dom/event-source'\nimport { ElementNames, InstanceFactory, InstanceNamedFactory } from '../interface'\nimport {\n ROOT_STR,\n DOCUMENT_ELEMENT_NAME,\n COMMENT\n} from '../constants'\n\nimport type { FormElement } from '../dom/form'\nimport type { TaroRootElement } from '../dom/root'\nimport type { TaroText } from '../dom/text'\nimport type { TaroNodeImpl } from '../dom-external/node-impl'\nimport type { TaroElementImpl } from '../dom-external/element-impl'\nimport type { Hooks } from '../hooks'\n\n@injectable()\nexport class TaroDocument extends TaroElement {\n private _getText: InstanceFactory\n\n public constructor (// eslint-disable-next-line @typescript-eslint/indent\n @inject(SERVICE_IDENTIFIER.TaroNodeImpl) nodeImpl: TaroNodeImpl,\n @inject(SERVICE_IDENTIFIER.TaroElementFactory) getElement: InstanceNamedFactory,\n @inject(SERVICE_IDENTIFIER.Hooks) hooks: Hooks,\n @inject(SERVICE_IDENTIFIER.TaroElementImpl) elementImpl: TaroElementImpl,\n @inject(SERVICE_IDENTIFIER.TaroTextFactory) getText: InstanceFactory\n ) {\n super(nodeImpl, getElement, hooks, elementImpl)\n this._getText = getText\n this.nodeType = NodeType.DOCUMENT_NODE\n this.nodeName = DOCUMENT_ELEMENT_NAME\n }\n\n public createElement (type: string): TaroElement | TaroRootElement | FormElement {\n if (type === ROOT_STR) {\n return this._getElement(ElementNames.RootElement)()\n }\n\n if (controlledComponent.has(type)) {\n return this._getElement(ElementNames.FormElement)(type)\n }\n\n return this._getElement(ElementNames.Element)(type)\n }\n\n // an ugly fake createElementNS to deal with @vue/runtime-dom's\n // support mounting app to svg container since vue@3.0.8\n public createElementNS (_svgNS: string, type: string): TaroElement | TaroRootElement | FormElement {\n return this.createElement(type)\n }\n\n public createTextNode (text: string): TaroText {\n return this._getText(text)\n }\n\n public getElementById (id: string | undefined | null): T | null {\n const el = eventSource.get(id)\n return isUndefined(el) ? null : el as T\n }\n\n public querySelector (query: string): T | null {\n // 为了 Vue3 的乞丐版实现\n if (/^#/.test(query)) {\n return this.getElementById(query.slice(1))\n }\n return null\n }\n\n public querySelectorAll () {\n // fake hack\n return []\n }\n\n // @TODO: @PERF: 在 hydrate 移除掉空的 node\n public createComment (): TaroText {\n const textnode = this._getText('')\n textnode.nodeName = COMMENT\n return textnode\n }\n}\n","import { inject, injectable, multiInject, /* multiInject, */ optional } from 'inversify'\nimport SERVICE_IDENTIFIER from './constants/identifiers'\n\nimport type {\n IHooks,\n OnRemoveAttribute,\n GetLifecycle,\n GetPathIndex,\n GetEventCenter,\n ModifyMpEvent,\n ModifyTaroEvent,\n IsBubbleEvents,\n GetSpecialNodes,\n BatchedEventUpdates,\n MergePageInstance,\n CreatePullDownComponent,\n GetDOMNode,\n InitNativeApi,\n ModifySetAttrPayload,\n ModifyHydrateData,\n ModifyRmAttrPayload,\n MpEvent,\n OnAddEvent,\n patchElement\n} from './interface'\nimport type { TaroElement } from './dom/element'\nimport type { TaroEvent } from './dom/event'\n\n@injectable()\nexport class Hooks implements IHooks {\n @inject(SERVICE_IDENTIFIER.getLifecycle)\n public getLifecycle: GetLifecycle\n\n @inject(SERVICE_IDENTIFIER.getPathIndex)\n public getPathIndex: GetPathIndex\n\n @inject(SERVICE_IDENTIFIER.getEventCenter)\n public getEventCenter: GetEventCenter\n\n @inject(SERVICE_IDENTIFIER.isBubbleEvents)\n public isBubbleEvents: IsBubbleEvents\n\n @inject(SERVICE_IDENTIFIER.getSpecialNodes)\n public getSpecialNodes: GetSpecialNodes\n\n @inject(SERVICE_IDENTIFIER.onRemoveAttribute) @optional()\n public onRemoveAttribute?: OnRemoveAttribute\n\n @inject(SERVICE_IDENTIFIER.batchedEventUpdates) @optional()\n public batchedEventUpdates?: BatchedEventUpdates\n\n @inject(SERVICE_IDENTIFIER.mergePageInstance) @optional()\n public mergePageInstance?: MergePageInstance\n\n @inject(SERVICE_IDENTIFIER.createPullDownComponent) @optional()\n public createPullDownComponent?: CreatePullDownComponent\n\n @inject(SERVICE_IDENTIFIER.getDOMNode) @optional()\n public getDOMNode?: GetDOMNode\n\n @inject(SERVICE_IDENTIFIER.modifyHydrateData) @optional()\n public modifyHydrateData?: ModifyHydrateData\n\n @inject(SERVICE_IDENTIFIER.modifySetAttrPayload) @optional()\n public modifySetAttrPayload?: ModifySetAttrPayload\n\n @inject(SERVICE_IDENTIFIER.modifyRmAttrPayload) @optional()\n public modifyRmAttrPayload?: ModifyRmAttrPayload\n\n @inject(SERVICE_IDENTIFIER.onAddEvent) @optional()\n public onAddEvent?: OnAddEvent\n\n @multiInject(SERVICE_IDENTIFIER.modifyMpEvent) @optional()\n private modifyMpEventImpls?: ModifyMpEvent[]\n\n public modifyMpEvent (e: MpEvent) {\n this.modifyMpEventImpls?.forEach(fn => fn(e))\n }\n\n @multiInject(SERVICE_IDENTIFIER.modifyTaroEvent) @optional()\n private modifyTaroEventImpls?: ModifyTaroEvent[]\n\n public modifyTaroEvent (e: TaroEvent, element: TaroElement) {\n this.modifyTaroEventImpls?.forEach(fn => fn(e, element))\n }\n\n @multiInject(SERVICE_IDENTIFIER.initNativeApi) @optional()\n public initNativeApiImpls?: InitNativeApi[]\n\n public initNativeApi (taro: Record) {\n this.initNativeApiImpls?.forEach(fn => fn(taro))\n }\n\n @multiInject(SERVICE_IDENTIFIER.patchElement) @optional()\n public patchElementImpls?: patchElement[]\n\n public patchElement (element: TaroElement) {\n this.patchElementImpls?.forEach(fn => fn(element))\n }\n}\n","/**\n * 支持冒泡的事件, 除 支付宝小程序外，其余的可冒泡事件都和微信保持一致\n * 详见 见 https://developers.weixin.qq.com/miniprogram/dev/framework/view/wxml/event.html\n */\nexport const BUBBLE_EVENTS = new Set([\n 'touchstart',\n 'touchmove',\n 'touchcancel',\n 'touchend',\n 'touchforcechange',\n 'tap',\n 'longpress',\n 'longtap',\n 'transitionend',\n 'animationstart',\n 'animationiteration',\n 'animationend'\n])\n","import { ContainerModule } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { BUBBLE_EVENTS } from '../constants/events'\n\nimport type { IsBubbleEvents, GetEventCenter, GetLifecycle, GetPathIndex, GetSpecialNodes } from '../interface'\n\nconst getLifecycle: GetLifecycle = function (instance, lifecycle) {\n return instance[lifecycle]\n}\n\nconst getPathIndex: GetPathIndex = function (indexOfNode) {\n return `[${indexOfNode}]`\n}\n\nconst getEventCenter: GetEventCenter = function (Events) {\n return new Events()\n}\n\nconst isBubbleEvents = function (eventName) {\n return BUBBLE_EVENTS.has(eventName)\n}\n\nconst getSpecialNodes = function () {\n return ['view', 'text', 'image']\n}\n\nexport const DefaultHooksContainer = new ContainerModule(bind => {\n bind(SERVICE_IDENTIFIER.getLifecycle).toFunction(getLifecycle)\n bind(SERVICE_IDENTIFIER.getPathIndex).toFunction(getPathIndex)\n bind(SERVICE_IDENTIFIER.getEventCenter).toFunction(getEventCenter)\n bind(SERVICE_IDENTIFIER.isBubbleEvents).toFunction(isBubbleEvents)\n bind(SERVICE_IDENTIFIER.getSpecialNodes).toFunction(getSpecialNodes)\n})\n","import { defaultReconciler, isArray } from '@tarojs/shared'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { Container } from 'inversify'\n\nexport default function processPluginHooks (container: Container) {\n const keys = Object.keys(defaultReconciler)\n keys.forEach(key => {\n if (key in SERVICE_IDENTIFIER) {\n // is hooks\n const identifier = SERVICE_IDENTIFIER[key]\n const fn = defaultReconciler[key]\n\n if (isArray(fn)) {\n // is multi\n fn.forEach(item => container.bind(identifier).toFunction(item))\n } else {\n if (container.isBound(identifier)) {\n // 之前有绑定过，需要重新绑定以覆盖前者\n container.rebind(identifier).toFunction(fn)\n } else {\n container.bind(identifier).toFunction(fn)\n }\n }\n }\n })\n}\n","import { Container, interfaces } from 'inversify'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { TaroNodeImpl } from '../dom-external/node-impl'\nimport { TaroElementImpl } from '../dom-external/element-impl'\nimport { TaroElement } from '../dom/element'\nimport { TaroText } from '../dom/text'\nimport { TaroDocument } from '../dom/document'\nimport { TaroRootElement } from '../dom/root'\nimport { FormElement } from '../dom/form'\nimport { ElementNames, InstanceFactory, InstanceNamedFactory } from '../interface'\nimport { Hooks } from '../hooks'\nimport { DefaultHooksContainer } from './default-hooks'\nimport processPluginHooks from './plugin-hooks'\n\nconst container = new Container()\n\nif (process.env.TARO_ENV !== 'h5') {\n container.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroElement).whenTargetNamed(ElementNames.Element)\n container.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroDocument).inSingletonScope().whenTargetNamed(ElementNames.Document)\n container.bind(SERVICE_IDENTIFIER.TaroElement).to(TaroRootElement).whenTargetNamed(ElementNames.RootElement)\n container.bind(SERVICE_IDENTIFIER.TaroElement).to(FormElement).whenTargetNamed(ElementNames.FormElement)\n container.bind(SERVICE_IDENTIFIER.TaroElementFactory).toFactory((context: interfaces.Context) => {\n return (named: ElementNames) => (nodeName?: string) => {\n const el = context.container.getNamed(SERVICE_IDENTIFIER.TaroElement, named)\n if (nodeName) {\n el.nodeName = nodeName\n }\n el.tagName = el.nodeName.toUpperCase()\n return el\n }\n })\n\n container.bind(SERVICE_IDENTIFIER.TaroText).to(TaroText)\n container.bind>(SERVICE_IDENTIFIER.TaroTextFactory).toFactory((context: interfaces.Context) => {\n return (text: string) => {\n const textNode = context.container.get(SERVICE_IDENTIFIER.TaroText)\n textNode._value = text\n return textNode\n }\n })\n\n container.bind(SERVICE_IDENTIFIER.TaroNodeImpl).to(TaroNodeImpl).inSingletonScope()\n container.bind(SERVICE_IDENTIFIER.TaroElementImpl).to(TaroElementImpl).inSingletonScope()\n}\n\ncontainer.bind(SERVICE_IDENTIFIER.Hooks).to(Hooks).inSingletonScope()\ncontainer.load(DefaultHooksContainer)\nprocessPluginHooks(container)\n\nexport default container\n","import { EMPTY_OBJ } from '@tarojs/shared'\nimport container from '../container'\nimport { ElementNames } from '../interface'\nimport { isParentBinded } from '../utils'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport {\n CONFIRM,\n CURRENT_TARGET,\n INPUT,\n KEY_CODE,\n TARGET,\n TIME_STAMP,\n TYPE,\n TOUCHMOVE\n} from '../constants'\n\nimport type { TaroElement } from './element'\nimport type { InstanceNamedFactory, EventOptions, MpEvent, TaroDocumentInstance, IHooks } from '../interface'\n\nlet hooks\nlet getElement\nlet document\nif (process.env.TARO_ENV !== 'h5') {\n hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n getElement = container.get(SERVICE_IDENTIFIER.TaroElementFactory)\n document = getElement(ElementNames.Document)() as TaroDocumentInstance\n}\n\n// Taro 事件对象。以 Web 标准的事件对象为基础，加入小程序事件对象中携带的部分信息，并模拟实现事件冒泡。\nexport class TaroEvent {\n public type: string\n\n public bubbles: boolean\n\n public cancelable: boolean\n\n public _stop = false\n\n public _end = false\n\n public defaultPrevented = false\n\n // timestamp can either be hi-res ( relative to page load) or low-res (relative to UNIX epoch)\n // here use hi-res timestamp\n public timeStamp = Date.now()\n\n public mpEvent: MpEvent | undefined\n\n public constructor (type: string, opts: EventOptions, event?: MpEvent) {\n this.type = type.toLowerCase()\n this.mpEvent = event\n this.bubbles = Boolean(opts && opts.bubbles)\n this.cancelable = Boolean(opts && opts.cancelable)\n }\n\n public stopPropagation () {\n this._stop = true\n }\n\n public stopImmediatePropagation () {\n this._end = this._stop = true\n }\n\n public preventDefault () {\n this.defaultPrevented = true\n }\n\n get target () {\n const element = document.getElementById(this.mpEvent?.target.id)\n return {\n ...this.mpEvent?.target,\n ...this.mpEvent?.detail,\n dataset: element !== null ? element.dataset : EMPTY_OBJ\n }\n }\n\n get currentTarget () {\n const element = document.getElementById(this.mpEvent?.currentTarget.id)\n\n if (element === null) {\n return this.target\n }\n\n return {\n ...this.mpEvent?.currentTarget,\n ...this.mpEvent?.detail,\n dataset: element.dataset\n }\n }\n}\n\nexport function createEvent (event: MpEvent | string, node?: TaroElement) {\n if (typeof event === 'string') {\n // For Vue3 using document.createEvent\n return new TaroEvent(event, { bubbles: true, cancelable: true })\n }\n\n const domEv = new TaroEvent(event.type, { bubbles: true, cancelable: true }, event)\n\n for (const key in event) {\n if (key === CURRENT_TARGET || key === TARGET || key === TYPE || key === TIME_STAMP) {\n continue\n } else {\n domEv[key] = event[key]\n }\n }\n\n if (domEv.type === CONFIRM && node?.nodeName === INPUT) {\n // eslint-disable-next-line dot-notation\n domEv[KEY_CODE] = 13\n }\n\n return domEv\n}\n\nconst eventsBatch = {}\n\n// 小程序的事件代理回调函数\nexport function eventHandler (event: MpEvent) {\n hooks.modifyMpEvent?.(event)\n\n if (event.currentTarget == null) {\n event.currentTarget = event.target\n }\n\n const node = document.getElementById(event.currentTarget.id)\n if (node) {\n const dispatch = () => {\n const e = createEvent(event, node)\n hooks.modifyTaroEvent?.(e, node)\n node.dispatchEvent(e)\n }\n if (typeof hooks.batchedEventUpdates === 'function') {\n const type = event.type\n\n if (\n !hooks.isBubbleEvents(type) ||\n !isParentBinded(node, type) ||\n (type === TOUCHMOVE && !!node.props.catchMove)\n ) {\n // 最上层组件统一 batchUpdate\n hooks.batchedEventUpdates(() => {\n if (eventsBatch[type]) {\n eventsBatch[type].forEach(fn => fn())\n delete eventsBatch[type]\n }\n dispatch()\n })\n } else {\n // 如果上层组件也有绑定同类型的组件，委托给上层组件调用事件回调\n (eventsBatch[type] ||= []).push(dispatch)\n }\n } else {\n dispatch()\n }\n }\n}\n","import { EMPTY_OBJ } from '@tarojs/shared'\n\nexport const isBrowser = typeof document !== 'undefined' && !!document.scripts\nexport const doc: Document = isBrowser ? document : EMPTY_OBJ\nexport const win: Window = isBrowser ? window : EMPTY_OBJ\n","import { createEvent } from '../dom/event'\nimport { isBrowser, doc } from '../env'\nimport ioc_container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { ElementNames, InstanceNamedFactory } from '../interface'\nimport {\n HTML,\n HEAD,\n BODY,\n APP,\n CONTAINER\n} from '../constants'\n\nimport type { TaroDocumentInstance } from '../interface'\n\nexport function createDocument () {\n /**\n * \n * \n * \n * \n * \n * \n * \n * \n * \n * \n */\n const getElement = ioc_container.get(SERVICE_IDENTIFIER.TaroElementFactory)\n const doc = getElement(ElementNames.Document)() as TaroDocumentInstance\n const documentCreateElement = doc.createElement.bind(doc)\n const html = documentCreateElement(HTML)\n const head = documentCreateElement(HEAD)\n const body = documentCreateElement(BODY)\n const app = documentCreateElement(APP)\n app.id = APP\n const container = documentCreateElement(CONTAINER) // 多包一层主要为了兼容 vue\n\n doc.appendChild(html)\n html.appendChild(head)\n html.appendChild(body)\n body.appendChild(container)\n container.appendChild(app)\n\n doc.documentElement = html\n doc.head = head\n doc.body = body\n doc.createEvent = createEvent\n\n return doc\n}\n\nexport const document = (isBrowser ? doc : createDocument()) as TaroDocumentInstance\n","import { isBrowser, win } from '../env'\n\nconst machine = 'Macintosh'\nconst arch = 'Intel Mac OS X 10_14_5'\nconst engine = 'AppleWebKit/534.36 (KHTML, like Gecko) NodeJS/v4.1.0 Chrome/76.0.3809.132 Safari/534.36'\n\nexport const navigator = isBrowser ? win.navigator : {\n appCodeName: 'Mozilla',\n appName: 'Netscape',\n appVersion: '5.0 (' + machine + '; ' + arch + ') ' + engine,\n cookieEnabled: true,\n mimeTypes: [],\n onLine: true,\n platform: 'MacIntel',\n plugins: [],\n product: 'Taro',\n productSub: '20030107',\n userAgent: 'Mozilla/5.0 (' + machine + '; ' + arch + ') ' + engine,\n vendor: 'Joyent',\n vendorSub: ''\n}\n","// https://github.com/myrne/performance-now\nexport let now\n\n(function () {\n let loadTime\n if ((typeof performance !== 'undefined' && performance !== null) && performance.now) {\n now = function () {\n return performance.now()\n }\n } else if (Date.now) {\n now = function () {\n return Date.now() - loadTime\n }\n loadTime = Date.now()\n } else {\n now = function () {\n return new Date().getTime() - loadTime\n }\n loadTime = new Date().getTime()\n }\n})()\n\nlet lastTime = 0\n\n// https://gist.github.com/paulirish/1579671\n// https://gist.github.com/jalbam/5fe05443270fa6d8136238ec72accbc0\nlet raf = typeof requestAnimationFrame !== 'undefined' && requestAnimationFrame !== null ? requestAnimationFrame : function (callback) {\n const _now = now()\n const nextTime = Math.max(lastTime + 16, _now) // First time will execute it immediately but barely noticeable and performance is gained.\n return setTimeout(function () { callback(lastTime = nextTime) }, nextTime - _now)\n}\n\nlet caf = typeof cancelAnimationFrame !== 'undefined' && cancelAnimationFrame !== null ? cancelAnimationFrame : clearTimeout\n\nif (typeof global !== 'undefined') {\n raf = raf.bind(global)\n caf = caf.bind(global)\n}\n\nexport {\n raf,\n caf\n}\n","import type { TaroElement } from '../dom/element'\nimport type { Style } from '../dom/style'\n\nexport function getComputedStyle (element: TaroElement): Style {\n return element.style\n}\n","import { navigator } from './navigator'\nimport { document } from './document'\nimport { isBrowser, win } from '../env'\nimport { raf, caf } from './raf'\nimport { getComputedStyle } from './getComputedStyle'\nimport { DATE, SET_TIMEOUT } from '../constants'\n\nexport const window = isBrowser ? win : {\n navigator,\n document\n}\n\nif (!isBrowser) {\n const globalProperties = [\n ...Object.getOwnPropertyNames(global || win),\n ...Object.getOwnPropertySymbols(global || win)\n ]\n\n globalProperties.forEach(property => {\n if (property === 'atob') return\n if (!Object.prototype.hasOwnProperty.call(window, property)) {\n window[property] = global[property]\n }\n })\n\n ;(document as any).defaultView = window\n}\n\nif (process.env.TARO_ENV && process.env.TARO_ENV !== 'h5') {\n (window as any).requestAnimationFrame = raf;\n (window as any).cancelAnimationFrame = caf;\n (window as any).getComputedStyle = getComputedStyle;\n (window as any).addEventListener = function () {};\n (window as any).removeEventListener = function () {}\n if (!(DATE in window)) {\n (window as any).Date = Date\n }\n if (!(SET_TIMEOUT in window)) {\n (window as any).setTimeout = setTimeout\n }\n}\n","import { AppInstance, PageInstance } from './dsl/instance'\n\nexport interface Router {\n params: Record,\n path: string,\n onReady: string,\n onHide: string,\n onShow: string\n}\n\ninterface Current {\n app: AppInstance | null,\n router: Router | null,\n page: PageInstance | null,\n preloadData?: any\n}\n\nexport const Current: Current = {\n app: null,\n router: null,\n page: null\n}\n\nexport const getCurrentInstance = () => Current\n","import container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\n\nimport type { IHooks } from '../interface'\n\n/* eslint-disable no-dupe-class-members */\ntype Callback1 = (arg1: T1) => any;\ntype Callback2 = (arg1: T1, arg2: T2) => any;\ntype Callback3 = (arg1: T1, arg2: T2, arg3: T3) => any;\ntype Callback4 = (arg1: T1, arg2: T2, arg3: T3, arg4: T4) => any;\ntype Callback5 = (arg1: T1, arg2: T2, arg3: T3,\n arg4: T4, arg5: T5) => any;\ntype Callback6Rest = (arg1: T1, arg2: T2, arg3: T3,\n arg4: T4, arg5: T5, arg6: T6,\n ...rest: any[]) => any;\n\nexport class Events {\n private callbacks?: Record\n static eventSplitter = /\\s+/\n\n constructor (opts?) {\n if (typeof opts !== 'undefined' && opts.callbacks) {\n this.callbacks = opts.callbacks\n } else {\n this.callbacks = {}\n }\n }\n\n on(event: string, callback: Callback1, context): this\n on(event: string, callback: Callback2, context): this\n on(event: string, callback: Callback3, context): this\n on(event: string, callback: Callback4, comtext): this\n on(event: string, callback: Callback5, context): this\n on(event: string, callback: Callback6Rest, context): this\n on (eventName, callback, context): this {\n let event, node, tail, list\n if (!callback) {\n return this\n }\n eventName = eventName.split(Events.eventSplitter)\n this.callbacks ||= {}\n const calls = this.callbacks\n while ((event = eventName.shift())) {\n list = calls[event]\n node = list ? list.tail : {}\n node.next = tail = {}\n node.context = context\n node.callback = callback\n calls[event] = {\n tail,\n next: list ? list.next : node\n }\n }\n return this\n }\n\n once (events, callback, context) {\n const wrapper = (...args) => {\n callback.apply(this, args)\n this.off(events, wrapper, context)\n }\n\n this.on(events, wrapper, context)\n\n return this\n }\n\n off (events, callback, context) {\n let event, calls, node, tail, cb, ctx\n if (!(calls = this.callbacks)) {\n return this\n }\n if (!(events || callback || context)) {\n delete this.callbacks\n return this\n }\n events = events ? events.split(Events.eventSplitter) : Object.keys(calls)\n while ((event = events.shift())) {\n node = calls[event]\n delete calls[event]\n if (!node || !(callback || context)) {\n continue\n }\n tail = node.tail\n while ((node = node.next) !== tail) {\n cb = node.callback\n ctx = node.context\n if ((callback && cb !== callback) || (context && ctx !== context)) {\n this.on(event, cb, ctx)\n }\n }\n }\n return this\n }\n\n trigger(event: string)\n trigger(event: string, arg: T1)\n trigger(event: string, arg1: T1, arg2: T2)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5)\n trigger(event: string, arg1: T1, arg2: T2, arg3: T3, arg4: T4, arg5: T5,\n arg6: T6, ...rest: any[])\n\n trigger (events) {\n let event, node, calls, tail\n if (!(calls = this.callbacks)) {\n return this\n }\n events = events.split(Events.eventSplitter)\n const rest = [].slice.call(arguments, 1)\n while ((event = events.shift())) {\n if ((node = calls[event])) {\n tail = node.tail\n while ((node = node.next) !== tail) {\n node.callback.apply(node.context || this, rest)\n }\n }\n }\n return this\n }\n}\n\nexport type EventsType = typeof Events\n\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\nconst eventCenter = hooks.getEventCenter(Events)\ncontainer.bind(SERVICE_IDENTIFIER.eventCenter).toConstantValue(eventCenter)\n\nexport { eventCenter }\n","/* eslint-disable dot-notation */\nimport { isFunction, EMPTY_OBJ, ensure, Shortcuts, isUndefined, isArray } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { eventHandler } from '../dom/event'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { incrementId } from '../utils'\nimport { perf } from '../perf'\nimport { PAGE_INIT } from '../constants'\nimport { isBrowser } from '../env'\nimport { eventCenter } from '../emitter/emitter'\nimport { raf } from '../bom/raf'\n\nimport type { PageConfig } from '@tarojs/taro'\nimport type { Instance, PageInstance, PageProps } from './instance'\nimport type { Func, IHooks, MpInstance } from '../interface'\nimport type { TaroRootElement } from '../dom/root'\n\nconst instances = new Map()\nconst pageId = incrementId()\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\nexport function injectPageInstance (inst: Instance, id: string) {\n hooks.mergePageInstance?.(instances.get(id), inst)\n instances.set(id, inst)\n}\n\nexport function getPageInstance (id: string): Instance | undefined {\n return instances.get(id)\n}\n\nexport function addLeadingSlash (path?: string): string {\n if (path == null) {\n return ''\n }\n return path.charAt(0) === '/' ? path : '/' + path\n}\n\nexport function safeExecute (path: string, lifecycle: keyof PageInstance, ...args: unknown[]) {\n const instance = instances.get(path)\n\n if (instance == null) {\n return\n }\n\n const func = hooks.getLifecycle(instance, lifecycle)\n\n if (isArray(func)) {\n const res = func.map(fn => fn.apply(instance, args))\n return res[0]\n }\n\n if (!isFunction(func)) {\n return\n }\n\n return func.apply(instance, args)\n}\n\nexport function stringify (obj?: Record) {\n if (obj == null) {\n return ''\n }\n const path = Object.keys(obj).map((key) => {\n return key + '=' + obj[key]\n }).join('&')\n return path === '' ? path : '?' + path\n}\n\nexport function getPath (id: string, options?: Record): string {\n let path = id\n if (!isBrowser) {\n path = id + stringify(options)\n }\n return path\n}\n\nexport function getOnReadyEventKey (path: string) {\n return path + '.' + 'onReady'\n}\n\nexport function getOnShowEventKey (path: string) {\n return path + '.' + 'onShow'\n}\n\nexport function getOnHideEventKey (path: string) {\n return path + '.' + 'onHide'\n}\n\nexport function createPageConfig (component: any, pageName?: string, data?: Record, pageConfig?: PageConfig) {\n const id = pageName ?? `taro_page_${pageId()}`\n // 小程序 Page 构造器是一个傲娇小公主，不能把复杂的对象挂载到参数上\n let pageElement: TaroRootElement | null = null\n\n let unmounting = false\n let prepareMountList: (() => void)[] = []\n\n const config: PageInstance = {\n onLoad (this: MpInstance, options, cb?: Func) {\n perf.start(PAGE_INIT)\n\n Current.page = this as any\n this.config = pageConfig || {}\n options.$taroTimestamp = Date.now()\n\n // this.$taroPath 是页面唯一标识，不可变，因此页面参数 options 也不可变\n this.$taroPath = getPath(id, options)\n // this.$taroParams 作为暴露给开发者的页面参数对象，可以被随意修改\n if (this.$taroParams == null) {\n this.$taroParams = Object.assign({}, options)\n }\n\n const router = isBrowser ? this.$taroPath : this.route || this.__route__\n Current.router = {\n params: this.$taroParams,\n path: addLeadingSlash(router),\n onReady: getOnReadyEventKey(id),\n onShow: getOnShowEventKey(id),\n onHide: getOnHideEventKey(id)\n }\n\n const mount = () => {\n Current.app!.mount!(component, this.$taroPath, () => {\n pageElement = document.getElementById(this.$taroPath)\n\n ensure(pageElement !== null, '没有找到页面实例。')\n safeExecute(this.$taroPath, 'onLoad', this.$taroParams)\n if (!isBrowser) {\n pageElement.ctx = this\n pageElement.performUpdate(true, cb)\n } else {\n isFunction(cb) && cb()\n }\n })\n }\n if (unmounting) {\n prepareMountList.push(mount)\n } else {\n mount()\n }\n },\n onReady () {\n raf(() => {\n eventCenter.trigger(getOnReadyEventKey(id))\n })\n\n safeExecute(this.$taroPath, 'onReady')\n this.onReady.called = true\n },\n onUnload () {\n unmounting = true\n Current.app!.unmount!(this.$taroPath, () => {\n unmounting = false\n instances.delete(this.$taroPath)\n if (pageElement) {\n pageElement.ctx = null\n }\n if (prepareMountList.length) {\n prepareMountList.forEach(fn => fn())\n prepareMountList = []\n }\n })\n },\n onShow () {\n Current.page = this as any\n this.config = pageConfig || {}\n const router = isBrowser ? this.$taroPath : this.route || this.__route__\n Current.router = {\n params: this.$taroParams,\n path: addLeadingSlash(router),\n onReady: getOnReadyEventKey(id),\n onShow: getOnShowEventKey(id),\n onHide: getOnHideEventKey(id)\n }\n\n raf(() => {\n eventCenter.trigger(getOnShowEventKey(id))\n })\n\n safeExecute(this.$taroPath, 'onShow')\n },\n onHide () {\n Current.page = null\n Current.router = null\n safeExecute(this.$taroPath, 'onHide')\n eventCenter.trigger(getOnHideEventKey(id))\n },\n onPullDownRefresh () {\n return safeExecute(this.$taroPath, 'onPullDownRefresh')\n },\n onReachBottom () {\n return safeExecute(this.$taroPath, 'onReachBottom')\n },\n onPageScroll (options) {\n return safeExecute(this.$taroPath, 'onPageScroll', options)\n },\n onResize (options) {\n return safeExecute(this.$taroPath, 'onResize', options)\n },\n onTabItemTap (options) {\n return safeExecute(this.$taroPath, 'onTabItemTap', options)\n },\n onTitleClick () {\n return safeExecute(this.$taroPath, 'onTitleClick')\n },\n onOptionMenuClick () {\n return safeExecute(this.$taroPath, 'onOptionMenuClick')\n },\n onPopMenuClick () {\n return safeExecute(this.$taroPath, 'onPopMenuClick')\n },\n onPullIntercept () {\n return safeExecute(this.$taroPath, 'onPullIntercept')\n },\n onAddToFavorites () {\n return safeExecute(this.$taroPath, 'onAddToFavorites')\n }\n }\n\n // onShareAppMessage 和 onShareTimeline 一样，会影响小程序右上方按钮的选项，因此不能默认注册。\n if (component.onShareAppMessage ||\n component.prototype?.onShareAppMessage ||\n component.enableShareAppMessage) {\n config.onShareAppMessage = function (options) {\n const target = options?.target\n if (target != null) {\n const id = target.id\n const element = document.getElementById(id)\n if (element != null) {\n options.target!.dataset = element.dataset\n }\n }\n return safeExecute(this.$taroPath, 'onShareAppMessage', options)\n }\n }\n if (component.onShareTimeline ||\n component.prototype?.onShareTimeline ||\n component.enableShareTimeline) {\n config.onShareTimeline = function () {\n return safeExecute(this.$taroPath, 'onShareTimeline')\n }\n }\n\n config.eh = eventHandler\n\n if (!isUndefined(data)) {\n config.data = data\n }\n\n if (isBrowser) {\n config.path = id\n }\n\n return config\n}\n\nexport function createComponentConfig (component: React.ComponentClass, componentName?: string, data?: Record) {\n const id = componentName ?? `taro_component_${pageId()}`\n let componentElement: TaroRootElement | null = null\n\n const config: any = {\n attached () {\n perf.start(PAGE_INIT)\n const path = getPath(id, { id: this.getPageId?.() || pageId() })\n Current.app!.mount!(component, path, () => {\n componentElement = document.getElementById(path)\n ensure(componentElement !== null, '没有找到组件实例。')\n safeExecute(path, 'onLoad')\n if (!isBrowser) {\n componentElement.ctx = this\n componentElement.performUpdate(true)\n }\n })\n },\n detached () {\n const path = getPath(id, { id: this.getPageId() })\n Current.app!.unmount!(path, () => {\n instances.delete(path)\n if (componentElement) {\n componentElement.ctx = null\n }\n })\n },\n methods: {\n eh: eventHandler\n }\n }\n if (!isUndefined(data)) {\n config.data = data\n }\n\n config['options'] = component?.['options'] ?? EMPTY_OBJ\n config['externalClasses'] = component?.['externalClasses'] ?? EMPTY_OBJ\n config['behaviors'] = component?.['behaviors'] ?? EMPTY_OBJ\n return config\n}\n\nexport function createRecursiveComponentConfig (componentName?: string) {\n return {\n properties: {\n i: {\n type: Object,\n value: {\n [Shortcuts.NodeName]: 'view'\n }\n },\n l: {\n type: String,\n value: ''\n }\n },\n options: {\n addGlobalClass: true,\n virtualHost: componentName !== 'custom-wrapper'\n },\n methods: {\n eh: eventHandler\n }\n }\n}\n","import type * as React from 'react'\nimport { isFunction, ensure, EMPTY_OBJ } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { getPageInstance, injectPageInstance, safeExecute, addLeadingSlash } from './common'\nimport { isBrowser } from '../env'\nimport { incrementId } from '../utils'\nimport { HOOKS_APP_ID } from '../constants'\nimport { eventHandler } from '../dom/event'\n\nimport type { AppConfig, PageInstance } from '@tarojs/taro'\nimport type { AppInstance, ReactPageComponent, PageProps, Instance, ReactAppInstance } from './instance'\nimport type { IHooks } from '../interface'\nimport type { TaroRootElement } from '../dom/root'\n\ndeclare const getCurrentPages: () => PageInstance[]\nconst hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\nfunction isClassComponent (R: typeof React, component): boolean {\n return isFunction(component.render) ||\n !!component.prototype?.isReactComponent ||\n component.prototype instanceof R.Component // compat for some others react-like library\n}\n\n// 初始值设置为 any 主要是为了过 TS 的校验\nexport let R: typeof React = EMPTY_OBJ\nexport let PageContext: React.Context = EMPTY_OBJ\n\nexport function connectReactPage (\n R: typeof React,\n id: string\n) {\n const h = R.createElement\n return (component: ReactPageComponent): React.ComponentClass => {\n // eslint-disable-next-line dot-notation\n const isReactComponent = isClassComponent(R, component)\n\n const inject = (node?: Instance) => node && injectPageInstance(node, id)\n const refs = isReactComponent ? { ref: inject } : {\n forwardedRef: inject,\n // 兼容 react-redux 7.20.1+\n reactReduxForwardedRef: inject\n }\n\n if (PageContext === EMPTY_OBJ) {\n PageContext = R.createContext('')\n }\n\n return class Page extends R.Component {\n state = {\n hasError: false\n }\n\n static getDerivedStateFromError (error: Error) {\n process.env.NODE_ENV !== 'production' && console.warn(error)\n return { hasError: true }\n }\n\n // React 16 uncaught error 会导致整个应用 crash，\n // 目前把错误缩小到页面\n componentDidCatch (error: Error, info: React.ErrorInfo) {\n process.env.NODE_ENV !== 'production' && console.warn(error)\n process.env.NODE_ENV !== 'production' && console.error(info.componentStack)\n }\n\n render () {\n const children = this.state.hasError\n ? []\n : h(PageContext.Provider, { value: id }, h(component, {\n ...this.props,\n ...refs\n }))\n\n if (isBrowser) {\n return h(\n 'div',\n { id, className: 'taro_page' },\n children\n )\n }\n\n return h(\n 'root',\n { id },\n children\n )\n }\n }\n }\n}\n\nlet ReactDOM\n\ntype PageComponent = React.CElement>\n\nfunction setReconciler () {\n const getLifecycle = function (instance, lifecycle) {\n lifecycle = lifecycle.replace(/^on(Show|Hide)$/, 'componentDid$1')\n return instance[lifecycle]\n }\n\n const modifyMpEvent = function (event) {\n event.type = event.type.replace(/-/g, '')\n }\n\n const batchedEventUpdates = function (cb) {\n ReactDOM.unstable_batchedUpdates(cb)\n }\n\n const mergePageInstance = function (prev, next) {\n if (!prev || !next) return\n\n // 子组件使用 lifecycle hooks 注册了生命周期后，会存在 prev，里面是注册的生命周期回调。\n\n // prev 使用 Object.create(null) 创建，H5 的 fast-refresh 可能也会导致存在 prev，要排除这些意外产生的 prev\n if ('constructor' in prev) return\n\n Object.keys(prev).forEach(item => {\n if (isFunction(next[item])) {\n next[item] = [next[item], ...prev[item]]\n } else {\n next[item] = [...(next[item] || []), ...prev[item]]\n }\n })\n }\n\n hooks.getLifecycle = getLifecycle\n hooks.modifyMpEvent = modifyMpEvent\n hooks.batchedEventUpdates = batchedEventUpdates\n hooks.mergePageInstance = mergePageInstance\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (\n el: React.FunctionComponent | React.ComponentClass,\n _,\n R: typeof React,\n customWrapper\n ) => {\n const isReactComponent = isClassComponent(R, el)\n\n return R.forwardRef((props, ref) => {\n const newProps: React.Props = { ...props }\n const refs = isReactComponent ? { ref: ref } : {\n forwardedRef: ref,\n // 兼容 react-redux 7.20.1+\n reactReduxForwardedRef: ref\n }\n\n return R.createElement(\n customWrapper || 'taro-pull-to-refresh',\n null,\n R.createElement(el, {\n ...newProps,\n ...refs\n })\n )\n })\n }\n\n hooks.getDOMNode = (inst) => {\n return ReactDOM.findDOMNode(inst)\n }\n }\n}\n\nconst pageKeyId = incrementId()\n\nexport function createReactApp (App: React.ComponentClass, react: typeof React, reactdom, config: AppConfig) {\n R = react\n ReactDOM = reactdom\n ensure(!!ReactDOM, '构建 React/Nerv 项目请把 process.env.FRAMEWORK 设置为 \\'react\\'/\\'nerv\\' ')\n\n const ref = R.createRef()\n const isReactComponent = isClassComponent(R, App)\n\n setReconciler()\n class AppWrapper extends R.Component {\n // run createElement() inside the render function to make sure that owner is right\n private pages: Array<() => PageComponent> = []\n private elements: Array = []\n\n public mount (component: React.ComponentClass, id: string, cb: () => void) {\n const key = id + pageKeyId()\n const page = () => R.createElement(component, { key, tid: id })\n this.pages.push(page)\n this.forceUpdate(cb)\n }\n\n public unmount (id: string, cb: () => void) {\n for (let i = 0; i < this.elements.length; i++) {\n const element = this.elements[i]\n if (element.props.tid === id) {\n this.elements.splice(i, 1)\n break\n }\n }\n\n this.forceUpdate(cb)\n }\n\n public render () {\n while (this.pages.length > 0) {\n const page = this.pages.pop()!\n this.elements.push(page())\n }\n\n let props: React.Props | null = null\n\n if (isReactComponent) {\n props = { ref }\n }\n\n return R.createElement(\n App,\n props,\n isBrowser ? R.createElement('div', null, this.elements.slice()) : this.elements.slice()\n )\n }\n }\n\n let wrapper: AppWrapper\n if (!isBrowser) {\n // eslint-disable-next-line react/no-render-return-value\n wrapper = ReactDOM.render(R.createElement(AppWrapper), document.getElementById('app'))\n }\n\n const app: AppInstance = Object.create({\n render (cb: () => void) {\n wrapper.forceUpdate(cb)\n },\n\n mount (component: ReactPageComponent, id: string, cb: () => void) {\n const page = connectReactPage(R, id)(component)\n wrapper.mount(page, id, cb)\n },\n\n unmount (id: string, cb: () => void) {\n wrapper.unmount(id, cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n enumerable: true,\n writable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n // 由于 H5 路由初始化的时候会清除 app 下的 dom 元素，所以需要在路由初始化后执行 render\n // eslint-disable-next-line react/no-render-return-value\n wrapper = ReactDOM.render(R.createElement(AppWrapper), document.getElementById('app'))\n }\n const app = ref.current\n\n // For taroize\n // 把 App Class 上挂载的额外属性同步到全局 app 对象中\n if (app?.taroGlobalData) {\n const globalData = app.taroGlobalData\n const keys = Object.keys(globalData)\n const descriptors = Object.getOwnPropertyDescriptors(globalData)\n keys.forEach(key => {\n Object.defineProperty(this, key, {\n configurable: true,\n enumerable: true,\n get () {\n return globalData[key]\n },\n set (value) {\n globalData[key] = value\n }\n })\n })\n Object.defineProperties(this, descriptors)\n }\n this.$app = app\n\n if (app != null && isFunction(app.onLaunch)) {\n app.onLaunch(options)\n }\n }\n },\n\n onShow: {\n enumerable: true,\n writable: true,\n value (options) {\n const app = ref.current\n Current.router = {\n params: options?.query,\n ...options\n }\n if (app != null && isFunction(app.componentDidShow)) {\n app.componentDidShow(options)\n }\n\n // app useDidShow\n triggerAppHook('onShow')\n }\n },\n\n onHide: {\n enumerable: true,\n writable: true,\n value (options: unknown) {\n const app = ref.current\n if (app != null && isFunction(app.componentDidHide)) {\n app.componentDidHide(options)\n }\n\n // app useDidHide\n triggerAppHook('onHide')\n }\n },\n\n onPageNotFound: {\n enumerable: true,\n writable: true,\n value (res: unknown) {\n const app = ref.current\n if (app != null && isFunction(app.onPageNotFound)) {\n app.onPageNotFound(res)\n }\n }\n }\n })\n\n function triggerAppHook (lifecycle) {\n const instance = getPageInstance(HOOKS_APP_ID)\n if (instance) {\n const app = ref.current\n const func = hooks.getLifecycle(instance, lifecycle)\n if (Array.isArray(func)) {\n func.forEach(cb => cb.apply(app))\n }\n }\n }\n\n Current.app = app\n return Current.app\n}\n\nconst getNativeCompId = incrementId()\n\nfunction initNativeComponentEntry (R: typeof React, ReactDOM) {\n interface IEntryState {\n components: {\n compId: string\n element: React.ReactElement\n }[]\n }\n\n interface IWrapperProps {\n getCtx: () => any\n renderComponent: (ctx: any) => React.ReactElement\n }\n\n class NativeComponentWrapper extends R.Component> {\n root = R.createRef()\n ctx = this.props.getCtx()\n\n componentDidMount () {\n this.ctx.component = this\n const rootElement = this.root.current!\n rootElement.ctx = this.ctx\n rootElement.performUpdate(true)\n }\n\n render () {\n return (\n R.createElement(\n 'root',\n {\n ref: this.root\n },\n this.props.renderComponent(this.ctx)\n )\n )\n }\n }\n\n class Entry extends R.Component, IEntryState> {\n state: IEntryState = {\n components: []\n }\n\n componentDidMount () {\n Current.app = this\n }\n\n mount (Component, compId, getCtx) {\n const isReactComponent = isClassComponent(R, Component)\n const inject = (node?: Instance) => node && injectPageInstance(node, compId)\n const refs = isReactComponent ? { ref: inject } : {\n forwardedRef: inject,\n reactReduxForwardedRef: inject\n }\n const item = {\n compId,\n element: R.createElement(NativeComponentWrapper, {\n key: compId,\n getCtx,\n renderComponent (ctx) {\n return R.createElement(Component, { ...(ctx.data ||= {}).props, ...refs })\n }\n })\n }\n this.setState({\n components: [...this.state.components, item]\n })\n }\n\n unmount (compId) {\n const components = this.state.components\n const index = components.findIndex(item => item.compId === compId)\n const next = [...components.slice(0, index), ...components.slice(index + 1)]\n this.setState({\n components: next\n })\n }\n\n render () {\n const components = this.state.components\n return (\n components.map(({ element }) => element)\n )\n }\n }\n\n setReconciler()\n\n const app = document.getElementById('app')\n\n ReactDOM.render(\n R.createElement(Entry, {}),\n app\n )\n}\n\nexport function createNativeComponentConfig (Component, react: typeof React, reactdom, componentConfig) {\n R = react\n ReactDOM = reactdom\n\n setReconciler()\n\n const config = {\n properties: {\n props: {\n type: null,\n value: null,\n observer (_newVal, oldVal) {\n oldVal && this.component.forceUpdate()\n }\n }\n },\n created () {\n if (!Current.app) {\n initNativeComponentEntry(R, ReactDOM)\n }\n },\n attached () {\n setCurrent()\n this.compId = getNativeCompId()\n this.config = componentConfig\n Current.app!.mount!(Component, this.compId, () => this)\n },\n ready () {\n safeExecute(this.compId, 'onReady')\n },\n detached () {\n Current.app!.unmount!(this.compId)\n },\n pageLifetimes: {\n show () {\n safeExecute(this.compId, 'onShow')\n },\n hide () {\n safeExecute(this.compId, 'onHide')\n }\n },\n methods: {\n eh: eventHandler\n }\n }\n\n function setCurrent () {\n const pages = getCurrentPages()\n const currentPage = pages[pages.length - 1]\n if (Current.page === currentPage) return\n\n Current.page = currentPage\n\n const route = (currentPage as any).route || (currentPage as any).__route__\n const router = {\n params: currentPage.options || {},\n path: addLeadingSlash(route),\n onReady: '',\n onHide: '',\n onShow: ''\n }\n Current.router = router\n\n if (!currentPage.options) {\n // 例如在微信小程序中，页面 options 的设置时机比组件 attached 慢\n Object.defineProperty(currentPage, 'options', {\n enumerable: true,\n configurable: true,\n get () {\n return this._optionsValue\n },\n set (value) {\n router.params = value\n this._optionsValue = value\n }\n })\n }\n }\n\n return config\n}\n","import { isFunction, noop, ensure, isBoolean } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { injectPageInstance } from './common'\nimport { Current } from '../current'\nimport { document } from '../bom/document'\nimport { isBrowser } from '../env'\n\n/* eslint-disable import/no-duplicates */\nimport type VueCtor from 'vue'\nimport type { ComponentOptions, VueConstructor, VNode } from 'vue'\nimport type { AppConfig } from '@tarojs/taro'\nimport type { AppInstance, VueAppInstance, VueInstance } from './instance'\nimport type { IHooks } from '../interface'\n\nexport type V = typeof VueCtor\n\nexport function connectVuePage (Vue: VueConstructor, id: string) {\n return (component: ComponentOptions) => {\n const injectedPage = Vue.extend({\n props: {\n tid: String\n },\n mixins: [component, {\n created () {\n injectPageInstance(this, id)\n }\n }]\n })\n\n const options: ComponentOptions = {\n render (h) {\n return h(\n isBrowser ? 'div' : 'root',\n {\n attrs: {\n id,\n class: isBrowser ? 'taro_page' : ''\n }\n },\n [\n h(injectedPage, { props: { tid: id } })\n ]\n )\n }\n }\n\n return options\n }\n}\n\nfunction setReconciler () {\n const hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\n const onRemoveAttribute = function (dom, qualifiedName) {\n // 处理原因: https://github.com/NervJS/taro/pull/5990\n const props = dom.props\n if (!props.hasOwnProperty(qualifiedName) || isBoolean(props[qualifiedName])) {\n dom.setAttribute(qualifiedName, false)\n return true\n }\n }\n\n const getLifecycle = function (instance, lifecycle) {\n return instance.$options[lifecycle]\n }\n\n hooks.onRemoveAttribute = onRemoveAttribute\n hooks.getLifecycle = getLifecycle\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (el, path, vue: VueConstructor) => {\n const injectedPage = vue.extend({\n props: {\n tid: String\n },\n mixins: [el as ComponentOptions, {\n created () {\n injectPageInstance(this, path)\n }\n }]\n })\n\n const options: ComponentOptions = {\n name: 'PullToRefresh',\n render (h) {\n return h(\n 'taro-pull-to-refresh',\n {\n class: ['hydrated']\n },\n [h(injectedPage, this.$slots.default)]\n )\n }\n }\n\n return options\n }\n\n hooks.getDOMNode = (el) => {\n return el.$el as any\n }\n }\n}\n\nlet Vue\n\nexport function createVueApp (App: ComponentOptions, vue: V, config: AppConfig) {\n Vue = vue\n ensure(!!Vue, '构建 Vue 项目请把 process.env.FRAMEWORK 设置为 \\'vue\\'')\n\n setReconciler()\n\n Vue.config.getTagNamespace = noop\n\n const elements: VNode[] = []\n const pages: Array<(h: Vue.CreateElement) => VNode> = []\n let appInstance: VueAppInstance\n\n const wrapper = new (Vue as VueConstructor)({\n render (h) {\n while (pages.length > 0) {\n const page = pages.pop()!\n elements.push(page(h))\n }\n return h(App, { ref: 'app' }, elements.slice())\n },\n methods: {\n mount (component: ComponentOptions, id: string, cb: () => void) {\n pages.push((h) => h(component, { key: id }))\n this.updateSync(cb)\n },\n updateSync (this: VueInstance, cb: () => void) {\n this._update(this._render(), false)\n this.$children.forEach((child: VueInstance) => child._update(child._render(), false))\n cb()\n },\n unmount (id: string, cb: () => void) {\n for (let i = 0; i < elements.length; i++) {\n const element = elements[i]\n if (element.key === id) {\n elements.splice(i, 1)\n break\n }\n }\n\n this.updateSync(cb)\n }\n }\n })\n if (!isBrowser) {\n wrapper.$mount(document.getElementById('app') as any)\n }\n const app: AppInstance = Object.create({\n mount (component: ComponentOptions, id: string, cb: () => void) {\n const page = connectVuePage(Vue, id)(component)\n wrapper.mount(page, id, cb)\n },\n\n unmount (id: string, cb: () => void) {\n wrapper.unmount(id, cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n // 由于 H5 路由初始化的时候会清除 app 下的 dom 元素，所以需要在路由初始化后再执行 render\n wrapper.$mount(document.getElementById('app') as any)\n }\n appInstance = wrapper.$refs.app as VueAppInstance\n if (appInstance != null && isFunction(appInstance.$options.onLaunch)) {\n appInstance.$options.onLaunch.call(appInstance, options)\n }\n }\n },\n\n onShow: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (appInstance != null && isFunction(appInstance.$options.onShow)) {\n appInstance.$options.onShow.call(appInstance, options)\n }\n }\n },\n\n onHide: {\n writable: true,\n enumerable: true,\n value (options) {\n if (appInstance != null && isFunction(appInstance.$options.onHide)) {\n appInstance.$options.onHide.call(appInstance, options)\n }\n }\n }\n })\n\n Current.app = app\n\n return Current.app\n}\n","import { isFunction, isArray, ensure } from '@tarojs/shared'\nimport container from '../container'\nimport SERVICE_IDENTIFIER from '../constants/identifiers'\nimport { Current } from '../current'\nimport { injectPageInstance, safeExecute } from './common'\nimport { isBrowser } from '../env'\n\nimport type {\n App,\n Component,\n ComponentPublicInstance,\n VNode,\n h as createElement\n} from '@vue/runtime-core'\nimport type { TaroElement } from '../dom/element'\nimport type { AppConfig as Config } from '@tarojs/taro'\nimport type { GetLifecycle, IHooks } from '../interface'\nimport type { AppInstance } from './instance'\n\nfunction createVue3Page (h: typeof createElement, id: string) {\n return function (component): VNode {\n const inject = {\n props: {\n tid: String\n },\n created () {\n injectPageInstance(this, id)\n // vue3 组件 created 时机比小程序页面 onShow 慢，因此在 created 后再手动触发一次 onShow。\n this.$nextTick(() => {\n safeExecute(id, 'onShow')\n })\n }\n }\n\n if (isArray(component.mixins)) {\n const mixins = component.mixins\n const idx = mixins.length - 1\n if (!mixins[idx].props?.tid) {\n // mixins 里还没注入过，直接推入数组\n component.mixins.push(inject)\n } else {\n // mixins 里已经注入过，代替前者\n component.mixins[idx] = inject\n }\n } else {\n component.mixins = [inject]\n }\n\n return h(\n isBrowser ? 'div' : 'root',\n {\n key: id,\n id,\n class: isBrowser ? 'taro_page' : ''\n },\n [\n h(Object.assign({}, component), {\n tid: id\n })\n ]\n )\n }\n}\n\nfunction setReconciler () {\n const hooks = container.get(SERVICE_IDENTIFIER.Hooks)\n\n const getLifecycle: GetLifecycle = function (instance, lifecycle) {\n return instance.$options[lifecycle]\n }\n\n const modifyMpEvent = function (event) {\n event.type = event.type.replace(/-/g, '')\n }\n\n hooks.getLifecycle = getLifecycle\n hooks.modifyMpEvent = modifyMpEvent\n\n if (process.env.TARO_ENV === 'h5') {\n hooks.createPullDownComponent = (component, path, h: typeof createElement) => {\n const inject = {\n props: {\n tid: String\n },\n created () {\n injectPageInstance(this, path)\n }\n }\n\n component.mixins = isArray(component.mixins)\n ? component.mixins.push(inject)\n : [inject]\n\n return {\n render () {\n return h(\n 'taro-pull-to-refresh',\n {\n class: 'hydrated'\n },\n [h(component, this.$slots.default)]\n )\n }\n }\n }\n\n hooks.getDOMNode = (el) => {\n return el.$el as any\n }\n }\n}\n\nexport function createVue3App (app: App, h: typeof createElement, config: Config) {\n let pages: VNode[] = []\n let appInstance: ComponentPublicInstance\n\n ensure(!isFunction(app._component), '入口组件不支持使用函数式组件')\n\n setReconciler()\n\n app._component.render = function () {\n return pages.slice()\n }\n if (!isBrowser) {\n appInstance = app.mount('#app')\n }\n const appConfig: AppInstance = Object.create({\n mount (component: Component, id: string, cb: () => void) {\n const page = createVue3Page(h, id)(component)\n pages.push(page)\n this.updateAppInstance(cb)\n },\n\n unmount (id: string, cb: () => void) {\n pages = pages.filter(page => page.key !== id)\n this.updateAppInstance(cb)\n },\n\n updateAppInstance (cb?: (() => void | undefined)) {\n appInstance.$forceUpdate()\n appInstance.$nextTick(cb)\n }\n }, {\n config: {\n writable: true,\n enumerable: true,\n configurable: true,\n value: config\n },\n\n onLaunch: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n if (isBrowser) {\n appInstance = app.mount('#app')\n }\n const onLaunch = appInstance?.$options?.onLaunch\n isFunction(onLaunch) && onLaunch.call(appInstance, options)\n }\n },\n\n onShow: {\n writable: true,\n enumerable: true,\n value (options) {\n Current.router = {\n params: options?.query,\n ...options\n }\n const onShow = appInstance?.$options?.onShow\n isFunction(onShow) && onShow.call(appInstance, options)\n }\n },\n\n onHide: {\n writable: true,\n enumerable: true,\n value (options) {\n const onHide = appInstance?.$options?.onHide\n isFunction(onHide) && onHide.call(appInstance, options)\n }\n }\n })\n\n Current.app = appConfig\n\n return Current.app\n}\n","import { isFunction, isArray } from '@tarojs/shared'\nimport { PageContext, R as React } from './react'\nimport { getPageInstance, injectPageInstance } from './common'\nimport { PageLifeCycle } from './instance'\nimport { Current } from '../current'\nimport { HOOKS_APP_ID } from '../constants'\n\nimport type { Func } from '../interface'\n\nconst taroHooks = (lifecycle: keyof PageLifeCycle) => {\n return (fn: Func) => {\n const id = React.useContext(PageContext) || HOOKS_APP_ID\n\n // hold fn ref and keep up to date\n const fnRef = React.useRef(fn)\n if (fnRef.current !== fn) fnRef.current = fn\n\n React.useLayoutEffect(() => {\n let inst = getPageInstance(id)\n let first = false\n if (inst == null) {\n first = true\n inst = Object.create(null)\n }\n\n inst = inst!\n\n // callback is immutable but inner function is up to date\n const callback = (...args: any) => fnRef.current(...args)\n\n if (isFunction(inst[lifecycle])) {\n (inst[lifecycle] as any) = [inst[lifecycle], callback]\n } else {\n (inst[lifecycle] as any) = [\n ...((inst[lifecycle] as any) || []),\n callback\n ]\n }\n\n if (first) {\n injectPageInstance(inst!, id)\n }\n return () => {\n const inst = getPageInstance(id)\n const list = inst![lifecycle]\n if (list === callback) {\n (inst![lifecycle] as any) = undefined\n } else if (isArray(list)) {\n (inst![lifecycle] as any) = list.filter(item => item !== callback)\n }\n }\n }, [])\n }\n}\n\nexport const useDidShow = taroHooks('componentDidShow')\n\nexport const useDidHide = taroHooks('componentDidHide')\n\nexport const usePullDownRefresh = taroHooks('onPullDownRefresh')\n\nexport const useReachBottom = taroHooks('onReachBottom')\n\nexport const usePageScroll = taroHooks('onPageScroll')\n\nexport const useResize = taroHooks('onResize')\n\nexport const useShareAppMessage = taroHooks('onShareAppMessage')\n\nexport const useTabItemTap = taroHooks('onTabItemTap')\n\nexport const useTitleClick = taroHooks('onTitleClick')\n\nexport const useOptionMenuClick = taroHooks('onOptionMenuClick')\n\nexport const usePullIntercept = taroHooks('onPullIntercept')\n\nexport const useShareTimeline = taroHooks('onShareTimeline')\n\nexport const useAddToFavorites = taroHooks('onAddToFavorites')\n\nexport const useReady = taroHooks('onReady')\n\nexport const useRouter = (dynamic = false) => {\n return dynamic ? Current.router : React.useMemo(() => Current.router, [])\n}\n\nexport const useScope = () => undefined\n","import { Current } from './current'\nimport { getPath } from './dsl/common'\nimport { TaroRootElement } from './dom/root'\nimport { document } from './bom/document'\nimport { isBrowser } from './env'\n\nimport type { Func } from './interface'\n\nfunction removeLeadingSlash (path?: string) {\n if (path == null) {\n return ''\n }\n return path.charAt(0) === '/' ? path.slice(1) : path\n}\n\nexport const nextTick = (cb: Func, ctx?: Record) => {\n const router = Current.router\n const timerFunc = () => {\n setTimeout(function () {\n ctx ? cb.call(ctx) : cb()\n }, 1)\n }\n\n if (router !== null) {\n let pageElement: TaroRootElement | null = null\n const path = getPath(removeLeadingSlash(router.path), router.params)\n pageElement = document.getElementById(path)\n if (pageElement?.pendingUpdate) {\n if (isBrowser) {\n // eslint-disable-next-line dot-notation\n pageElement.firstChild?.['componentOnReady']?.().then(() => {\n timerFunc()\n }) ?? timerFunc()\n } else {\n pageElement.enqueueUpdateCallback(cb, ctx)\n }\n } else {\n timerFunc()\n }\n } else {\n timerFunc()\n }\n}\n"],"names":["isObject","isArray","Symbol","objectProto","nativeObjectToString","symToStringTag","funcProto","funcToString","hasOwnProperty","HASH_UNDEFINED","Map","INFINITY","isFunction","document","ioc_container","container","window","hooks","setReconciler","React"],"mappings":";;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;AACnC,EAAE,OAAO,CAAC,kBAAkB,EAAC;AAC7B,CAAC,MAAM;AACP;AACA,EAAE,CAAC,UAAU,OAAO,EAAE;AACtB;AACA;AACA,MAAM,CAAC,UAAU,OAAO,EAAE;AAC1B;AACA;AACA;AACA;AACA,UAAU,IAAI,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC5B,UAAU,SAAS,YAAY,CAAC,MAAM,EAAE,QAAQ,EAAE;AAClD,cAAc,OAAO,UAAU,GAAG,EAAE,KAAK,EAAE;AAC3C,kBAAkB,IAAI,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,UAAU,EAAE;AACzD,sBAAsB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAC/G,mBAAmB;AACnB,kBAAkB,IAAI,QAAQ;AAC9B,sBAAsB,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAC3C,eAAe,CAAC;AAChB,WAAW;AACX,OAAO,EAAE,UAAU,QAAQ,EAAE;AAC7B,UAAU,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AACvD;AACA,UAAU,IAAI,cAAc,GAAG,OAAO,MAAM,KAAK,UAAU,CAAC;AAC5D,UAAU,IAAI,iBAAiB,GAAG,cAAc,IAAI,OAAO,MAAM,CAAC,WAAW,KAAK,WAAW,GAAG,MAAM,CAAC,WAAW,GAAG,eAAe,CAAC;AACrI,UAAU,IAAI,cAAc,GAAG,cAAc,IAAI,OAAO,MAAM,CAAC,QAAQ,KAAK,WAAW,GAAG,MAAM,CAAC,QAAQ,GAAG,YAAY,CAAC;AACzH,UAAU,IAAI,cAAc,GAAG,OAAO,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC;AACnE,UAAU,IAAI,aAAa,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,KAAK,CAAC;AACjE,UAAU,IAAI,SAAS,GAAG,CAAC,cAAc,IAAI,CAAC,aAAa,CAAC;AAC5D,UAAU,IAAI,OAAO,GAAG;AACxB;AACA,cAAc,MAAM,EAAE,cAAc;AACpC,oBAAoB,YAAY,EAAE,OAAO,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;AAC/E,oBAAoB,aAAa;AACjC,wBAAwB,YAAY,EAAE,OAAO,cAAc,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE;AACnF,wBAAwB,YAAY,EAAE,OAAO,cAAc,CAAC,EAAE,CAAC,CAAC,EAAE;AAClE,cAAc,GAAG,EAAE,SAAS;AAC5B,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;AACzE,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE;AAC9D,cAAc,GAAG,EAAE,SAAS;AAC5B,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,EAAE;AAChG,oBAAoB,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;AAC5D,WAAW,CAAC;AACZ;AACA,UAAU,IAAI,iBAAiB,GAAG,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;AAClE,UAAU,IAAI,WAAW,GAAG,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,KAAK,MAAM,CAAC;AACtI,UAAU,IAAI,IAAI,GAAG,CAAC,WAAW,IAAI,OAAO,GAAG,KAAK,UAAU,IAAI,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,UAAU,GAAG,GAAG,GAAG,iBAAiB,EAAE,CAAC;AAC1I,UAAU,IAAI,IAAI,GAAG,CAAC,WAAW,IAAI,OAAO,GAAG,KAAK,UAAU,IAAI,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,UAAU,GAAG,GAAG,GAAG,iBAAiB,EAAE,CAAC;AAC1I,UAAU,IAAI,QAAQ,GAAG,CAAC,WAAW,IAAI,OAAO,OAAO,KAAK,UAAU,GAAG,OAAO,GAAG,qBAAqB,EAAE,CAAC;AAC3G;AACA;AACA,UAAU,IAAI,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE;AACzE,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE;AAC7C,kBAAkB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;AAC1C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACvC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;AAC9F,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,MAAM,CAAC,UAAU,CAAC;AACxC,sBAAsB,UAAU,GAAG,SAAS,CAAC;AAC7C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,kBAAkB,OAAO,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;AACvF,eAAe;AACf,mBAAmB;AACnB,kBAAkB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;AAC1C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;AAC5C,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,OAAO,mBAAmB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AACjE,eAAe;AACf,WAAW;AACX,UAAU,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,WAAW,EAAE,aAAa,EAAE;AACxD,cAAc,SAAS,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE;AACtD,kBAAkB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACvC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC;AAC9E,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC7F,eAAe;AACf,cAAc,OAAO,SAAS,CAAC;AAC/B,WAAW;AACX,UAAU,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,EAAE;AACnF,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAChG,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACjE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC3E,WAAW;AACX,UAAU,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC9E,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACjE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC3E,WAAW;AACX,UAAU,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AAC9E,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,eAAe,CAAC,MAAM,EAAE,WAAW,EAAE;AACxD,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,oBAAoB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC/D,WAAW;AACX,UAAU,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC,CAAC;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,kBAAkB,CAAC,MAAM,EAAE,WAAW,EAAE;AAC3D,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,OAAO,uBAAuB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAClE,WAAW;AACX,UAAU,QAAQ,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,SAAS,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;AACpE,cAAc,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;AAC3C,kBAAkB,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAC3D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,EAAE,WAAW,aAAa,KAAK,CAAC,CAAC;AAC9F,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC;AAClD,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC;AACtC,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACxD,cAAc,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;AACjD,cAAc,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC;AACzC,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AACtC,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX,UAAU,QAAQ,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;AACrD,UAAU,SAAS,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE;AAC3D,cAAc,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC/D,kBAAkB,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAChD,kBAAkB,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AACpD,kBAAkB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;AACrE,sBAAsB,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC;AACnD,0BAA0B,MAAM,IAAI,SAAS,EAAE,CAAC;AAChD,sBAAsB,MAAM,GAAG,SAAS,CAAC;AACzC,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,MAAM,CAAC;AAC5B,WAAW;AACX,UAAU,SAAS,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE;AACjF,cAAc,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC/D,kBAAkB,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAChD,kBAAkB,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;AAC7E,kBAAkB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;AACrE,sBAAsB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;AAC9C,0BAA0B,MAAM,IAAI,SAAS,EAAE,CAAC;AAChD,sBAAsB,UAAU,GAAG,SAAS,CAAC;AAC7C,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,UAAU,CAAC;AAChC,WAAW;AACX,UAAU,SAAS,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;AACxD,cAAc,IAAI,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACnD,cAAc,IAAI,WAAW,CAAC,cAAc,CAAC,EAAE;AAC/C,kBAAkB,IAAI,CAAC,MAAM;AAC7B,sBAAsB,OAAO,SAAS,CAAC;AACvC,kBAAkB,cAAc,GAAG,IAAI,IAAI,EAAE,CAAC;AAC9C,kBAAkB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAClD,eAAe;AACf,cAAc,IAAI,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtD,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC,EAAE;AAC5C,kBAAkB,IAAI,CAAC,MAAM;AAC7B,sBAAsB,OAAO,SAAS,CAAC;AACvC,kBAAkB,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC;AAC3C,kBAAkB,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACrD,eAAe;AACf,cAAc,OAAO,WAAW,CAAC;AACjC,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,IAAI,MAAM;AACxB,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;AACjC,kBAAkB,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,OAAO,KAAK,CAAC;AAC3B,WAAW;AACX;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC7D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,cAAc,OAAO,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;AAC7D,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,IAAI,MAAM;AACxB,kBAAkB,OAAO,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACnE,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;AACjC,kBAAkB,OAAO,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AACrE,cAAc,OAAO,SAAS,CAAC;AAC/B,WAAW;AACX;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AAC7D,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,SAAS,CAAC;AACnC,cAAc,OAAO,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAClD,WAAW;AACX;AACA;AACA,UAAU,SAAS,yBAAyB,CAAC,WAAW,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,EAAE;AAC/E,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,IAAI,CAAC,CAAC;AAC9E,cAAc,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;AAC1D,WAAW;AACX;AACA;AACA,UAAU,SAAS,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE;AAC9C,cAAc,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,cAAc,IAAI,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;AACrD,cAAc,IAAI,MAAM,KAAK,IAAI;AACjC,kBAAkB,OAAO,OAAO,CAAC;AACjC,cAAc,IAAI,UAAU,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC/D,cAAc,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC;AACxC,kBAAkB,OAAO,OAAO,CAAC;AACjC,cAAc,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;AACrC,kBAAkB,OAAO,UAAU,CAAC;AACpC,cAAc,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AACnC,cAAc,IAAI,IAAI,GAAG,EAAE,CAAC;AAC5B,cAAc,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;AACjF,kBAAkB,IAAI,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;AAC1C,kBAAkB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5C,kBAAkB,IAAI,CAAC,MAAM,EAAE;AAC/B,sBAAsB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnC,sBAAsB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,mBAAmB;AACnB,eAAe;AACf,cAAc,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;AAC1F,kBAAkB,IAAI,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;AAC7C,kBAAkB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5C,kBAAkB,IAAI,CAAC,MAAM,EAAE;AAC/B,sBAAsB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnC,sBAAsB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,mBAAmB;AACnB,eAAe;AACf,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX;AACA;AACA,UAAU,SAAS,uBAAuB,CAAC,CAAC,EAAE,CAAC,EAAE;AACjD,cAAc,IAAI,IAAI,GAAG,EAAE,CAAC;AAC5B,cAAc,IAAI,WAAW,GAAG,sBAAsB,CAAC,CAAC,EAAE,CAAC,aAAa,KAAK,CAAC,CAAC;AAC/E,cAAc,IAAI,WAAW,CAAC,WAAW,CAAC;AAC1C,kBAAkB,OAAO,IAAI,CAAC;AAC9B,cAAc,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC;AAC/C,cAAc,IAAI,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;AAClD,cAAc,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,cAAc,OAAO,IAAI,EAAE;AAC3B,kBAAkB,IAAI,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;AACpD,kBAAkB,IAAI,CAAC,IAAI,EAAE;AAC7B,sBAAsB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB;AACnB,kBAAkB,IAAI,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;AACtD,kBAAkB,IAAI;AACtB,sBAAsB,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAC1C,mBAAmB;AACnB,kBAAkB,OAAO,CAAC,EAAE;AAC5B,sBAAsB,IAAI;AAC1B,0BAA0B,aAAa,CAAC,QAAQ,CAAC,CAAC;AAClD,uBAAuB;AACvB,8BAA8B;AAC9B,0BAA0B,MAAM,CAAC,CAAC;AAClC,uBAAuB;AACvB,mBAAmB;AACnB,kBAAkB,CAAC,EAAE,CAAC;AACtB,eAAe;AACf,WAAW;AACX;AACA;AACA,UAAU,SAAS,IAAI,CAAC,CAAC,EAAE;AAC3B,cAAc,IAAI,CAAC,KAAK,IAAI;AAC5B,kBAAkB,OAAO,CAAC,YAAY;AACtC,cAAc,QAAQ,OAAO,CAAC;AAC9B,kBAAkB,KAAK,WAAW,EAAE,OAAO,CAAC,iBAAiB;AAC7D,kBAAkB,KAAK,SAAS,EAAE,OAAO,CAAC,eAAe;AACzD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,cAAc;AACvD,kBAAkB,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC,cAAc,CAAC,cAAc;AACnF,kBAAkB,SAAS,OAAO,CAAC,cAAc;AACjD,eAAe;AACf,WAAW;AACX;AACA;AACA,UAAU,SAAS,WAAW,CAAC,CAAC,EAAE;AAClC,cAAc,OAAO,CAAC,KAAK,SAAS,CAAC;AACrC,WAAW;AACX;AACA;AACA,UAAU,SAAS,MAAM,CAAC,CAAC,EAAE;AAC7B,cAAc,OAAO,CAAC,KAAK,IAAI,CAAC;AAChC,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC/B,cAAc,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC3C,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC/B,cAAc,OAAO,OAAO,CAAC,KAAK,QAAQ,GAAG,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,KAAK,UAAU,CAAC;AAClF,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,WAAW,CAAC,KAAK,EAAE,aAAa,EAAE;AACrD,cAAc,QAAQ,IAAI,CAAC,KAAK,CAAC;AACjC,kBAAkB,KAAK,CAAC,kBAAkB,OAAO,KAAK,CAAC;AACvD,kBAAkB,KAAK,CAAC,aAAa,OAAO,KAAK,CAAC;AAClD,kBAAkB,KAAK,CAAC,gBAAgB,OAAO,KAAK,CAAC;AACrD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,kBAAkB,KAAK,CAAC,eAAe,OAAO,KAAK,CAAC;AACpD,eAAe;AACf,cAAc,IAAI,IAAI,GAAG,aAAa,KAAK,CAAC,gBAAgB,QAAQ,GAAG,aAAa,KAAK,CAAC,gBAAgB,QAAQ,GAAG,SAAS,CAAC;AAC/H,cAAc,IAAI,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;AACrE,cAAc,IAAI,YAAY,KAAK,SAAS,EAAE;AAC9C,kBAAkB,IAAI,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAC9D,kBAAkB,IAAI,QAAQ,CAAC,MAAM,CAAC;AACtC,sBAAsB,MAAM,IAAI,SAAS,EAAE,CAAC;AAC5C,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,cAAc,OAAO,mBAAmB,CAAC,KAAK,EAAE,IAAI,KAAK,SAAS,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC;AACtF,WAAW;AACX;AACA;AACA,UAAU,SAAS,mBAAmB,CAAC,CAAC,EAAE,IAAI,EAAE;AAChD,cAAc,IAAI,IAAI,KAAK,QAAQ,EAAE;AACrC,kBAAkB,IAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC;AAC9C,kBAAkB,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE;AAC9C,sBAAsB,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,kBAAkB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;AAC1C,kBAAkB,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE;AAC3C,sBAAsB,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,eAAe;AACf,mBAAmB;AACnB,kBAAkB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;AAC1C,kBAAkB,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE;AAC3C,sBAAsB,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,kBAAkB,IAAI,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC;AAC9C,kBAAkB,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE;AAC9C,sBAAsB,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtD,sBAAsB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC3C,0BAA0B,OAAO,MAAM,CAAC;AACxC,mBAAmB;AACnB,eAAe;AACf,cAAc,MAAM,IAAI,SAAS,EAAE,CAAC;AACpC,WAAW;AACX;AACA;AACA,UAAU,SAAS,SAAS,CAAC,QAAQ,EAAE;AACvC,cAAc,OAAO,CAAC,CAAC,QAAQ,CAAC;AAChC,WAAW;AACX;AACA;AACA,UAAU,SAAS,QAAQ,CAAC,QAAQ,EAAE;AACtC,cAAc,OAAO,EAAE,GAAG,QAAQ,CAAC;AACnC,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,IAAI,GAAG,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,cAAc,CAAC;AAC9D,cAAc,IAAI,QAAQ,CAAC,GAAG,CAAC;AAC/B,kBAAkB,OAAO,GAAG,CAAC;AAC7B,cAAc,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC;AACnC,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,OAAO,CAAC,QAAQ,EAAE;AACrC,cAAc,OAAO,KAAK,CAAC,OAAO;AAClC,oBAAoB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;AAC3C,oBAAoB,QAAQ,YAAY,MAAM;AAC9C,wBAAwB,QAAQ,YAAY,KAAK;AACjD,wBAAwB,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,gBAAgB,CAAC;AACtF,WAAW;AACX;AACA;AACA,UAAU,SAAS,UAAU,CAAC,QAAQ,EAAE;AACxC;AACA,cAAc,OAAO,OAAO,QAAQ,KAAK,UAAU,CAAC;AACpD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C;AACA,cAAc,OAAO,OAAO,QAAQ,KAAK,UAAU,CAAC;AACpD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,QAAQ,IAAI,CAAC,QAAQ,CAAC;AACpC,kBAAkB,KAAK,CAAC,eAAe,OAAO,IAAI,CAAC;AACnD,kBAAkB,KAAK,CAAC,eAAe,OAAO,IAAI,CAAC;AACnD,kBAAkB,SAAS,OAAO,KAAK,CAAC;AACxC,eAAe;AACf,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE;AACnC,cAAc,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9B,cAAc,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI;AACrD,kBAAkB,OAAO,SAAS,CAAC;AACnC,cAAc,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;AACnC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,OAAO,IAAI,CAAC;AAC1B,WAAW;AACX;AACA;AACA,UAAU,SAAS,WAAW,CAAC,GAAG,EAAE;AACpC,cAAc,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;AAC1D,cAAc,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;AACrC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,IAAI,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9C,cAAc,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACrC,kBAAkB,MAAM,IAAI,SAAS,EAAE,CAAC;AACxC,cAAc,OAAO,QAAQ,CAAC;AAC9B,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,UAAU,EAAE;AAC7C,cAAc,OAAO,UAAU,CAAC,KAAK,CAAC;AACtC,WAAW;AACX;AACA;AACA,UAAU,SAAS,YAAY,CAAC,QAAQ,EAAE;AAC1C,cAAc,IAAI,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,cAAc,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG,MAAM,CAAC;AAClD,WAAW;AACX;AACA;AACA,UAAU,SAAS,aAAa,CAAC,QAAQ,EAAE;AAC3C,cAAc,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACzC,cAAc,IAAI,CAAC;AACnB,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACnC,WAAW;AACX;AACA;AACA;AACA;AACA,UAAU,SAAS,sBAAsB,CAAC,CAAC,EAAE;AAC7C,cAAc,IAAI,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;AACnD,cAAc,IAAI,OAAO,CAAC,KAAK,UAAU,IAAI,CAAC,KAAK,iBAAiB;AACpE,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,IAAI,KAAK,KAAK,iBAAiB;AAC7C,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;AAC1C,cAAc,IAAI,cAAc,GAAG,SAAS,IAAI,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;AACjF,cAAc,IAAI,cAAc,IAAI,IAAI,IAAI,cAAc,KAAK,MAAM,CAAC,SAAS;AAC/E,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,WAAW,GAAG,cAAc,CAAC,WAAW,CAAC;AAC3D,cAAc,IAAI,OAAO,WAAW,KAAK,UAAU;AACnD,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,IAAI,WAAW,KAAK,CAAC;AACnC,kBAAkB,OAAO,KAAK,CAAC;AAC/B;AACA,cAAc,OAAO,WAAW,CAAC;AACjC,WAAW;AACX;AACA,UAAU,SAAS,iBAAiB,GAAG;AACvC,cAAc,IAAI,aAAa,GAAG,EAAE,CAAC;AACrC,cAAc,IAAI,aAAa,GAAG,EAAE,CAAC;AACrC,cAAc,IAAI,WAAW,kBAAkB,YAAY;AAC3D,kBAAkB,SAAS,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE;AAC/D,sBAAsB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,sBAAsB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AACxC,sBAAsB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;AAC5C,sBAAsB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;AAChD,mBAAmB;AACnB,kBAAkB,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;AACrF,kBAAkB,WAAW,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;AACvF,kBAAkB,WAAW,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY;AAC3D,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;AAC9C,sBAAsB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;AACnE,0BAA0B,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AAC9F,0BAA0B,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;AAC9D,8BAA8B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/C,8BAA8B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACzD,8BAA8B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AAC3D,2BAA2B;AAC3B,+BAA+B;AAC/B,8BAA8B,IAAI,CAAC,MAAM,EAAE,CAAC;AAC5C,2BAA2B;AAC3B,0BAA0B,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAChE,uBAAuB;AACvB,sBAAsB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC9D,mBAAmB,CAAC;AACpB,kBAAkB,WAAW,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,KAAK,EAAE;AACjE,sBAAsB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE;AAC5C,0BAA0B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,0BAA0B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACrD,0BAA0B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,MAAM,KAAK,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,WAAW,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE;AAClE,sBAAsB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE;AAC5C,0BAA0B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,0BAA0B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;AACrD,0BAA0B,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC1D,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,WAAW,CAAC;AACrC,eAAe,EAAE,CAAC,CAAC;AACnB,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,GAAG,GAAG;AACjC,sBAAsB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;AACtC,sBAAsB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;AACxC,sBAAsB,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AACrD,sBAAsB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AAC5C,mBAAmB;AACnB,kBAAkB,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE;AAC/D,sBAAsB,GAAG,EAAE,YAAY,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;AACpE,sBAAsB,UAAU,EAAE,IAAI;AACtC,sBAAsB,YAAY,EAAE,IAAI;AACxC,mBAAmB,CAAC,CAAC;AACrB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AACxG,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE;AACrD,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC;AACpE,sBAAsB,OAAO,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AAC1E,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,KAAK,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,IAAI,CAAC,CAAC;AACnE,sBAAsB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;AAClD,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,GAAG,EAAE;AACxD,sBAAsB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC;AACpE,sBAAsB,IAAI,KAAK,IAAI,CAAC,EAAE;AACtC,0BAA0B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AACvD,0BAA0B,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjE,8BAA8B,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAChE,8BAA8B,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACpE,2BAA2B;AAC3B,0BAA0B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;AAC9C,0BAA0B,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;AAChD,0BAA0B,IAAI,GAAG,KAAK,IAAI,CAAC,SAAS,EAAE;AACtD,8BAA8B,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AAC7D,8BAA8B,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AACpD,2BAA2B;AAC3B,0BAA0B,OAAO,IAAI,CAAC;AACtC,uBAAuB;AACvB,sBAAsB,OAAO,KAAK,CAAC;AACnC,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;AACpD,sBAAsB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AAC5C,sBAAsB,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC9C,sBAAsB,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;AACrD,sBAAsB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;AAC5C,mBAAmB,CAAC;AACpB,kBAAkB,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AACjH,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;AACrH,kBAAkB,GAAG,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY,EAAE,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;AACtH,kBAAkB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACvF,kBAAkB,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACzF,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AAC/D,sBAAsB,IAAI,IAAI,CAAC,SAAS,KAAK,GAAG,EAAE;AAClD,0BAA0B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;AACtF,uBAAuB;AACvB,sBAAsB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,MAAM,EAAE;AAC1D,0BAA0B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AAC/D,0BAA0B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC/C,0BAA0B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACvD,uBAAuB;AACvB,sBAAsB,OAAO,IAAI,CAAC,WAAW,CAAC;AAC9C,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe,EAAE,EAAE;AACnB,cAAc,SAAS,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE;AACtC,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe;AACf,cAAc,SAAS,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE;AAC1C,kBAAkB,OAAO,KAAK,CAAC;AAC/B,eAAe;AACf,cAAc,SAAS,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE;AAC5C,kBAAkB,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACtC,eAAe;AACf,WAAW;AACX;AACA,UAAU,SAAS,iBAAiB,GAAG;AACvC,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,GAAG,GAAG;AACjC,sBAAsB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;AAC7C,mBAAmB;AACnB,kBAAkB,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE;AAC/D,sBAAsB,GAAG,EAAE,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AACjE,sBAAsB,UAAU,EAAE,IAAI;AACtC,sBAAsB,YAAY,EAAE,IAAI;AACxC,mBAAmB,CAAC,CAAC;AACrB,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACxF,kBAAkB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AACrG,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AAC9F,kBAAkB,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;AAC3E,kBAAkB,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AAChF,kBAAkB,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;AACpF,kBAAkB,GAAG,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;AACtF,kBAAkB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AACpF,kBAAkB,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AACtF,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe,EAAE,EAAE;AACnB,WAAW;AACX;AACA,UAAU,SAAS,qBAAqB,GAAG;AAC3C,cAAc,IAAI,SAAS,GAAG,EAAE,CAAC;AACjC,cAAc,IAAI,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;AAC1C,cAAc,IAAI,OAAO,GAAG,eAAe,EAAE,CAAC;AAC9C,cAAc,sBAAsB,YAAY;AAChD,kBAAkB,SAAS,OAAO,GAAG;AACrC,sBAAsB,IAAI,CAAC,IAAI,GAAG,eAAe,EAAE,CAAC;AACpD,mBAAmB;AACnB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AACzF,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE;AAC5D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;AAC7F,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,MAAM,EAAE,KAAK,EAAE;AACnE,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,IAAI,CAAC,CAAC;AACnF,sBAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AAC/C,sBAAsB,OAAO,IAAI,CAAC;AAClC,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,MAAM,EAAE;AAC/D,sBAAsB,IAAI,KAAK,GAAG,uBAAuB,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AACpF,sBAAsB,OAAO,KAAK,KAAK,SAAS,GAAG,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;AACnF,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;AACxD;AACA,sBAAsB,IAAI,CAAC,IAAI,GAAG,eAAe,EAAE,CAAC;AACpD,mBAAmB,CAAC;AACpB,kBAAkB,OAAO,OAAO,CAAC;AACjC,eAAe,EAAE,EAAE;AACnB,cAAc,SAAS,eAAe,GAAG;AACzC,kBAAkB,IAAI,GAAG,CAAC;AAC1B,kBAAkB;AAClB,sBAAsB,GAAG,GAAG,aAAa,GAAG,UAAU,EAAE,CAAC;AACzD,yBAAyB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AACjD,kBAAkB,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AACnC,kBAAkB,OAAO,GAAG,CAAC;AAC7B,eAAe;AACf,cAAc,SAAS,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE;AAC/D,kBAAkB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;AACrD,sBAAsB,IAAI,CAAC,MAAM;AACjC,0BAA0B,OAAO,SAAS,CAAC;AAC3C,sBAAsB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAC1F,mBAAmB;AACnB,kBAAkB,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;AACzC,eAAe;AACf,cAAc,SAAS,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE;AACrD,kBAAkB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC;AAC/C,sBAAsB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;AAC3D,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,cAAc,SAAS,cAAc,CAAC,IAAI,EAAE;AAC5C,kBAAkB,IAAI,OAAO,UAAU,KAAK,UAAU,EAAE;AACxD,sBAAsB,IAAI,OAAO,MAAM,KAAK,WAAW;AACvD,0BAA0B,OAAO,MAAM,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9E,sBAAsB,IAAI,OAAO,QAAQ,KAAK,WAAW;AACzD,0BAA0B,OAAO,QAAQ,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;AAChF,sBAAsB,OAAO,eAAe,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AACzE,mBAAmB;AACnB,kBAAkB,OAAO,eAAe,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAChE,eAAe;AACf,cAAc,SAAS,UAAU,GAAG;AACpC,kBAAkB,IAAI,IAAI,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;AACvD;AACA,kBAAkB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAClD,kBAAkB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAClD,kBAAkB,IAAI,MAAM,GAAG,EAAE,CAAC;AAClC,kBAAkB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,EAAE,MAAM,EAAE;AACrE,sBAAsB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,sBAAsB,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC;AACtE,0BAA0B,MAAM,IAAI,GAAG,CAAC;AACxC,sBAAsB,IAAI,IAAI,GAAG,EAAE;AACnC,0BAA0B,MAAM,IAAI,GAAG,CAAC;AACxC,sBAAsB,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AAChE,mBAAmB;AACnB,kBAAkB,OAAO,MAAM,CAAC;AAChC,eAAe;AACf,WAAW;AACX;AACA,UAAU,SAAS,cAAc,CAAC,GAAG,EAAE;AACvC,cAAc,GAAG,CAAC,EAAE,GAAG,SAAS,CAAC;AACjC,cAAc,OAAO,GAAG,CAAC,EAAE,CAAC;AAC5B,cAAc,OAAO,GAAG,CAAC;AACzB,WAAW;AACX,OAAO,CAAC,CAAC;AACT,GAAG,EAAE,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC,EAAC;AAC/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACjnCA,MAAM,kBAAkB,GAAG;IACzB,WAAW,EAAE,aAAa;IAC1B,kBAAkB,EAAE,sBAAsB;IAC1C,QAAQ,EAAE,UAAU;IACpB,eAAe,EAAE,mBAAmB;IACpC,YAAY,EAAE,cAAc;IAC5B,eAAe,EAAE,iBAAiB;IAClC,KAAK,EAAE,OAAO;IACd,iBAAiB,EAAE,mBAAmB;IACtC,YAAY,EAAE,cAAc;IAC5B,YAAY,EAAE,cAAc;IAC5B,cAAc,EAAE,gBAAgB;IAChC,cAAc,EAAE,gBAAgB;IAChC,eAAe,EAAE,iBAAiB;IAClC,WAAW,EAAE,aAAa;IAC1B,aAAa,EAAE,eAAe;IAC9B,eAAe,EAAE,iBAAiB;IAClC,mBAAmB,EAAE,qBAAqB;IAC1C,iBAAiB,EAAE,mBAAmB;IACtC,uBAAuB,EAAE,yBAAyB;IAClD,UAAU,EAAE,YAAY;IACxB,aAAa,EAAE,eAAe;IAC9B,iBAAiB,EAAE,mBAAmB;IACtC,oBAAoB,EAAE,sBAAsB;IAC5C,mBAAmB,EAAE,qBAAqB;IAC1C,UAAU,EAAE,YAAY;IACxB,YAAY,EAAE,cAAc;CAC7B,CAAA;;AC3BM,MAAM,kBAAkB,GAAG,IAAI,CAAA;AACtC,AACO,MAAM,YAAY,GAAG,UAAU,CAAA;AACtC,AAAO,MAAM,QAAQ,GAAG,aAAa,CAAA;AACrC,AAAO,MAAM,SAAS,GAAG,OAAO,CAAA;AAChC,AAAO,MAAM,QAAQ,GAAG,MAAM,CAAA;AAC9B,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,GAAG,GAAG,KAAK,CAAA;AACxB,AAAO,MAAM,SAAS,GAAG,WAAW,CAAA;AACpC,AAAO,MAAM,qBAAqB,GAAG,WAAW,CAAA;AAChD,AAAO,MAAM,iBAAiB,GAAG,mBAAmB,CAAA;AACpD,AAAO,MAAM,EAAE,GAAG,IAAI,CAAA;AACtB,AAAO,MAAM,GAAG,GAAG,KAAK,CAAA;AACxB,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,WAAW,GAAG,aAAa,CAAA;AACxC,AAAO,MAAM,SAAS,GAAG,WAAW,CAAA;AACpC,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,OAAO,GAAG,SAAS,CAAA;AAChC,AAAO,MAAM,MAAM,GAAG,QAAQ,CAAA;AAC9B,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,KAAK,GAAG,OAAO,CAAA;AAC5B,AAAO,MAAM,MAAM,GAAG,QAAQ,CAAA;AAC9B,AAAO,MAAM,cAAc,GAAG,gBAAgB,CAAA;AAC9C,AAAO,MAAM,MAAM,GAAG,QAAQ,CAAA;AAC9B,AAAO,MAAM,cAAc,GAAG,eAAe,CAAA;AAC7C,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,OAAO,GAAG,SAAS,CAAA;AAChC,AAAO,MAAM,UAAU,GAAG,WAAW,CAAA;AACrC,AAAO,MAAM,QAAQ,GAAG,SAAS,CAAA;AACjC,AAAO,MAAM,SAAS,GAAG,WAAW,CAAA;AACpC,AAAO,MAAM,IAAI,GAAG,MAAM,CAAA;AAC1B,AAAO,MAAM,WAAW,GAAG,YAAY,CAAA;AACvC,AAAO,MAAM,SAAS,GAAG,WAAW,CAAA;AACpC,AAAO,MAAM,UAAU,GAAG,YAAY,CAAA;AACtC,AAAO,MAAM,OAAO,GAAG,SAAS,CAAA;;ACxBzB,MAAM,WAAW,GAAG;IACzB,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,OAAO,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAA;AAChC,CAAC,CAAA;AAED,SAAgB,SAAS,CAAE,IAAc;IACvC,OAAO,IAAI,CAAC,QAAQ,0BAA0B;AAChD,CAAC;AAED,SAAgB,MAAM,CAAE,IAAc;IACpC,OAAO,IAAI,CAAC,QAAQ,uBAAuB;AAC7C,CAAC;AAED,SAAgB,SAAS,CAAE,IAAc;IACvC,OAAO,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;AAClC,CAAC;AAED,SAAgB,gBAAgB,CAAE,EAAe;IAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI;QACzC,OAAO,EAAE,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;KACtE,CAAC,CAAA;IACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAA;AACrB,CAAC;AAED;;;;;AAKA,SAAgB,cAAc,CAAE,IAAwB,EAAE,IAAY;;IACpE,IAAI,GAAG,GAAG,KAAK,CAAA;IACf,OAAO,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,aAAa,KAAI,IAAI,CAAC,aAAa,CAAC,KAAK,KAAK,QAAQ,EAAE;QACnE,IAAI,MAAA,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,0CAAE,MAAM,EAAE;YAC/C,GAAG,GAAG,IAAI,CAAA;YACV,MAAK;SACN;QACD,IAAI,GAAG,IAAI,CAAC,aAAa,CAAA;KAC1B;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAgB,YAAY,CAAE,GAAW;IACvC,QAAQ,GAAG;QACT,KAAK,KAAK;YACR,wBAAsB;QACxB,KAAK,EAAE;YACL,OAAO,GAAG,CAAA;QACZ,KAAK,KAAK;YACR,wBAAsB;QACxB;YACE,OAAO,GAAG,CAAA;KACb;AACH,CAAC;;AC5DD,IAAa,eAAe,GAA5B,MAAa,eAAe;IAI1B;IACoC,KAAa;QAJ1C,eAAU,GAAmC,EAAE,CAAA;QAMpD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;KACnB;IAEM,gBAAgB,CAAE,IAAY,EAAE,OAAqB,EAAE,OAA2C;;QACvG,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,UAAU,mDAAG,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QACrD,IAAI,IAAI,KAAK,cAAc,EAAE;;YAE3B,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;YAChD,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;YAC9C,OAAM;SACP;QACD,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;QAChC,IAAI,MAAM,GAAG,KAAK,CAAA;QAClB,IAAIA,UAAQ,CAA0B,OAAO,CAAC,EAAE;YAC9C,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YACpC,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;SAC/B;QAED,IAAI,MAAM,EAAE;YACV,MAAM,OAAO,GAAG;gBACd,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;gBAC9B,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;aACxC,CAAA;YACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,kCAC7B,OAAmC,KACvC,IAAI,EAAE,KAAK,IACX,CAAA;YACF,OAAM;SACP;QAED,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,CAAA;QAEzF,IAAIC,SAAO,CAAC,QAAQ,CAAC,EAAE;YACrB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SACvB;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;SAClC;KACF;IAEM,mBAAmB,CAAE,IAAY,EAAE,OAAqB;QAC7D,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACzB,IAAI,OAAO,IAAI,IAAI,EAAE;YACnB,OAAM;SACP;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,CAACA,SAAO,CAAC,QAAQ,CAAC,EAAE;YACtB,OAAM;SACP;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAEvC,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,wBAAwB,CAAC,CAAA;QAEjG,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;KAC1B;IAEM,gBAAgB;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAA;QAChC,MAAM,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;QAChF,OAAO,OAAO,CAAC,gBAAgB,CAAC,CAAA;KACjC;CACF,CAAA;AAvEY,eAAe;IAD3B,UAAU,EAAE;IAMR,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GALxB,eAAe,CAuE3B;;AC9DD;;;;;;AAMA,SAAgB,OAAO,CAAE,IAA4B;;IACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAE9B,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;QAChB,OAAO;YACL,kBAAkB,IAAI,CAAC,SAAS;YAChC,uBAAsB,QAAQ;SAC/B,CAAA;KACF;IAED,MAAM,IAAI,GAAoB;QAC5B,uBAAsB,QAAQ;QAC9B,GAAG,EAAE,IAAI,CAAC,GAAG;KACd,CAAA;IACD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;IACtB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;IAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE;QACpE,IAAI,qBAAoB,GAAG,UAAU,QAAQ,EAAE,CAAA;QAC/C,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAChD,IAAI,qBAAoB,GAAG,SAAS,CAAA;SACrC;KACF;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACxB,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QACzC,IACE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;YACzB,IAAI,KAAK,KAAK;YACd,IAAI,KAAK,KAAK;YACd,IAAI,KAAK,EAAE;YACX,eAAe,KAAK,SAAS,EAC7B;YACA,IAAI,CAAC,eAAe,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;SACpC;QACD,IAAI,QAAQ,KAAK,IAAI,IAAI,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE;YAC/E,IAAI,qBAAoB,GAAG,UAAU,CAAA;SACtC;KACF;IAED,IAAI,EAAE,UAAU,EAAE,GAAG,IAAI,CAAA;;IAGzB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;IAExD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;QACzB,IAAI,uBAAsB,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;KACrD;SAAM;QACL,IAAI,uBAAsB,GAAG,EAAE,CAAA;KAChC;IAED,IAAI,IAAI,CAAC,SAAS,KAAK,EAAE,EAAE;QACzB,IAAI,kBAAiB,GAAG,IAAI,CAAC,SAAS,CAAA;KACvC;IAED,IAAI,IAAI,CAAC,OAAO,KAAK,EAAE,IAAI,QAAQ,KAAK,aAAa,EAAE;QACrD,IAAI,kBAAiB,GAAG,IAAI,CAAC,OAAO,CAAA;KACrC;IAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,iBAAiB,mDAAG,IAAI,CAAC,CAAA;IAEpC,OAAO,IAAI,CAAA;AACb,CAAC;;ACnFM,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuC,CAAA;;ICD7D,YAKX;AALD,WAAY,YAAY;IACtB,mCAAmB,CAAA;IACnB,qCAAqB,CAAA;IACrB,2CAA2B,CAAA;IAC3B,2CAA2B,CAAA;AAC7B,CAAC,EALW,YAAY,KAAZ,YAAY,QAKvB;;ACeD,MAAM,MAAM,GAAG,WAAW,EAAE,CAAA;AAG5B,IAAa,QAAQ,GAArB,MAAa,QAAS,SAAQ,eAAe;IAS3C;IAC2C,IAAkB,EACZ,UAAgC,EAC7C,KAAY;QAE9C,KAAK,CAAC,KAAK,CAAC,CAAA;QAVP,eAAU,GAAoB,IAAI,CAAA;QAClC,eAAU,GAAe,EAAE,CAAA;QAgB1B,YAAO,GAAG,CAAC,IAAc,KAAK,MAAM,OAAO,CAAC,IAAmB,CAAC,CAAA;QANtE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACf,IAAI,CAAC,WAAW,GAAG,UAAU,CAAA;QAC7B,IAAI,CAAC,GAAG,GAAG,MAAM,MAAM,EAAE,EAAE,CAAA;QAC3B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;KAChC;;;;IAOO,MAAM;QACZ,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAChC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAA;YACvB,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC7B,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAA;SACxB;KACF;IAED,IAAc,KAAK;;QACjB,OAAO,CAAA,MAAA,IAAI,CAAC,UAAU,0CAAE,KAAK,KAAI,IAAI,CAAA;KACtC;IAES,SAAS,CAAE,QAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QAE/C,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,sDAAsD,CAAC,CAAA;QAE5E,OAAO,KAAK,CAAA;KACb;IAED,IAAW,KAAK;QACd,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAElC,IAAI,UAAU,EAAE;;YAEd,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;YACnE,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;YAElD,OAAO,GAAG,UAAU,CAAC,KAAK,IAAI,yBAAwB,KAAK,EAAE,CAAA;SAC9D;QAED,OAAO,EAAE,CAAA;KACV;IAED,IAAW,WAAW;QACpB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI,IAAI,CAAA;KACtE;IAED,IAAW,eAAe;QACxB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI,IAAI,CAAA;KACtE;IAED,IAAW,aAAa;QACtB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,IAAI,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,QAAQ,4BAA4B;YAClD,OAAO,UAAyB,CAAA;SACjC;QACD,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;KAClC;IAED,IAAW,SAAS;QAClB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAClC,OAAO,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;KACjD;;;;;IAMD,IAAW,WAAW,CAAE,IAAY;QAClC,IAAI,CAAC,MAAM,EAAE,CAAA;QACb,IAAI,IAAI,KAAK,EAAE,EAAE;YACf,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;gBAC7C,KAAK,EAAE,MAAM,EAAE;aAChB,CAAC,CAAA;SACH;aAAM;YACL,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;YACxE,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAA;SAChD;KACF;IAEM,YAAY,CAAsB,QAAW,EAAE,QAA0B,EAAE,SAAmB;QACnG,IAAI,QAAQ,CAAC,QAAQ,KAAK,iBAAiB,EAAE;YAC3C,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,aAAa,EAAE,YAAY;gBAC1D,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,aAAa,CAAC,CAAA;gBAC9C,OAAO,YAAY,CAAA;aACpB,EAAE,QAAQ,CAAC,CAAA;YACZ,OAAO,QAAQ,CAAA;SAChB;QAED,QAAQ,CAAC,MAAM,EAAE,CAAA;QACjB,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAA;QAC1B,IAAI,OAAsB,CAAA;QAE1B,IAAI,QAAQ,EAAE;YACZ,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;YAC1C,IAAI,SAAS,EAAE;gBACb,OAAO,GAAG;oBACR,IAAI,EAAE,QAAQ,CAAC,KAAK;oBACpB,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;iBAC9B,CAAA;aACF;iBAAM;gBACL,OAAO,GAAG;oBACR,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;oBAC7C,KAAK,EAAE;wBACL,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;wBACnE,OAAO,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;qBAC/B;iBACF,CAAA;aACF;SACF;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC9B,OAAO,GAAG;gBACR,IAAI,EAAE,QAAQ,CAAC,KAAK;gBACpB,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;aAC9B,CAAA;SACF;QAED,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QAE3B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;YAClC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;SACxC;QAED,OAAO,QAAQ,CAAA;KAChB;IAEM,WAAW,CAAE,KAAe;QACjC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;KACzB;IAEM,YAAY,CAAE,QAAkB,EAAE,QAAkB;QACzD,IAAI,QAAQ,CAAC,UAAU,KAAK,IAAI,EAAE;YAChC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YAC3C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACrB,OAAO,QAAQ,CAAA;SAChB;KACF;IAEM,WAAW,CAAsB,KAAQ,EAAE,SAAmB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QACnC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,EAAE;YACd,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,uBAAsB;gBAC7C,KAAK,EAAE;oBACL,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;oBACnE,OAAO,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;iBAC/B;aACF,CAAC,CAAA;SACH;QACD,KAAK,CAAC,UAAU,GAAG,IAAI,CAAA;QACvB,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;;;QAG7B,OAAO,KAAK,CAAA;KACb;IAEM,MAAM,CAAE,SAAmB;;QAChC,MAAA,IAAI,CAAC,UAAU,0CAAE,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;KAC9C;IAEM,aAAa;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;KAClC;IAEM,aAAa,CAAE,OAAsB;;QAC1C,MAAA,IAAI,CAAC,KAAK,0CAAE,aAAa,CAAC,OAAO,CAAC,CAAA;KACnC;IAEM,QAAQ,CAAE,IAAgC;QAC/C,IAAI,UAAU,GAAG,KAAK,CAAA;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS;YAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,CAAA;YACzB,IAAI,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;gBACnE,UAAU,GAAG,IAAI,CAAA;gBACjB,OAAO,IAAI,CAAA;aACZ;SACF,CAAC,CAAA;QACF,OAAO,UAAU,CAAA;KAClB;IAED,IAAW,aAAa;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;QACxE,OAAO,QAAQ,CAAA;KAChB;CACF,CAAA;AApNY,QAAQ;IADpB,UAAU,EAAE;IAWR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GAZxB,QAAQ,CAoNpB;;IChOY,QAAQ,GAArB,MAAa,QAAS,SAAQ,QAAQ;IAGpC;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY;QAE9C,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAClC,IAAI,CAAC,QAAQ,qBAAqB;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;KACxB;IAED,IAAW,WAAW,CAAE,IAAY;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;QAClB,IAAI,CAAC,aAAa,CAAC;YACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,gBAAgB;YACvC,KAAK,EAAE,IAAI;SACZ,CAAC,CAAA;KACH;IAED,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;IAED,IAAW,SAAS,CAAE,IAAY;QAChC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAA;KACxB;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;CACF,CAAA;AAhCY,QAAQ;IADpB,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;;GANxB,QAAQ,CAgCpB;;AC3CD;;;;AAKA,MAAM,eAAe,GAAG;IACtB,KAAK;IACL,YAAY;IACZ,eAAe;IACf,WAAW;IACX,QAAQ;IACR,OAAO;IACP,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,WAAW;IACX,SAAS;IACT,QAAQ;IACR,OAAO;IACP,KAAK;IACL,QAAQ;IACR,OAAO;IACP,WAAW;IACX,MAAM;IACN,eAAe;IACf,eAAe;IACf,YAAY;IACZ,cAAc;IACd,SAAS;IACT,OAAO;IACP,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,SAAS;IACT,aAAa;IACb,KAAK;IACL,YAAY;IACZ,eAAe;IACf,YAAY;IACZ,aAAa;IACb,QAAQ;IACR,YAAY;IACZ,QAAQ;IACR,OAAO;IACP,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+BT,CAAA;AAED;AACA,SAAS,OAAO,CAAE,MAAc,EAAE,IAAc,EAAE,WAAqB;IACrE,CAAC,WAAW,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC5C,IAAI,CAAC,OAAO,CAAC,IAAI;QACf,eAAe,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAA;KACpC,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,KAAK,GAAG,OAAO,CAAA;AACrB,MAAM,IAAI,GAAG,MAAM,CAAA;AACnB,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AAC/C,MAAM,wBAAwB,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;AACjE,MAAM,+BAA+B,GAAG,CAAC,GAAG,wBAAwB,EAAE,QAAQ,CAAC,CAAA;AAC/E,MAAM,0CAA0C,GAAG,CAAC,GAAG,iBAAiB,EAAE,GAAG,wBAAwB,CAAC,CAAA;AACtG,MAAM,qBAAqB,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;AAC1D,MAAM,qBAAqB,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AAChE,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;AAClC,MAAM,kBAAkB,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,CAAA;AACvD,MAAM,iCAAiC,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,CAAC,CAAA;AACtF,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;AAExC,OAAO,CAAC,aAAa,EAAE,iBAAiB,CAAC,CAAA;AACzC,OAAO,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAA;AAC5C,OAAO,CAAC,kBAAkB,EAAE,iBAAiB,CAAC,CAAA;AAC9C,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,iBAAiB,EAAE,QAAQ,CAAC,CAAC,CAAA;AACpD,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,iBAAiB,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAA;AAC/F,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AACvC,OAAO,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAA;AAC1C,OAAO,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAA;AAC7C,OAAO,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,CAAA;AAC/C,OAAO,CAAC,YAAY,EAAE,0CAA0C,CAAC,CAAA;AACjE,OAAO,CAAC,aAAa,EAAE,0CAA0C,CAAC,CAAA;AAClE,OAAO,CAAC,WAAW,EAAE,0CAA0C,CAAC,CAAA;AAChE,OAAO,CAAC,cAAc,EAAE,0CAA0C,CAAC,CAAA;AACnE,OAAO,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AACjD,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAA;AACnD,OAAO,CAAC,cAAc,EAAE,qBAAqB,CAAC,CAAA;AAC9C,OAAO,CAAC,eAAe,EAAE,qBAAqB,CAAC,CAAA;AAC/C,OAAO,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAA;AACzC,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,qBAAqB,EAAE,MAAM,CAAC,CAAC,CAAA;AACrD,OAAO,CAAC,mBAAmB,EAAE,SAAS,CAAC,CAAA;AACvC,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAA;AACxC,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAA;AACxC,OAAO,CAAC,qBAAqB,EAAE,SAAS,CAAC,CAAA;AACzC,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAA;AAChC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;AAC7B,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAA;AAChC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAA;AACjC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAA;AACjC,OAAO,CAAC,cAAc,EAAE,SAAS,CAAC,CAAA;AAClC,OAAO,CAAC,cAAc,EAAE,SAAS,CAAC,CAAA;AAClC,OAAO,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;AACnC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;AAC9B,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;AAC5B,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAA;AACnG,OAAO,CAAC,aAAa,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAA;AACnF,OAAO,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AAC7E,OAAO,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,kBAAkB,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC,CAAA;AACpM,OAAO,CAAC,eAAe,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAA;AACxD,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;AAC9C,OAAO,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;AAC9G,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAA;AACjD,OAAO,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AAChD,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAA;AAChE,OAAO,CAAC,cAAc,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;AACrD,OAAO,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;AAC1D,OAAO,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC1E,OAAO,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAA;AACtD,OAAO,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,sBAAsB,EAAE,QAAQ,CAAC,CAAC,CAAA;AAC9D,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AACrC,OAAO,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC,CAAA;AAC7D,OAAO,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,CAAA;AACtD,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC7H,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAA;AACzE,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,YAAY,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAA;AACtG,OAAO,CAAC,aAAa,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAA;AACxG,OAAO,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAA;AAClC,OAAO,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;AAC3B,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AACjC,OAAO,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AAEjC,OAAO,CAAC,OAAO,EAAE,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AACpD,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;AAClD,OAAO,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAA;AACtD,OAAO,CAAC,aAAa,EAAE,qBAAqB,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,WAAW,EAAE,qBAAqB,EAAE,IAAI,CAAC,CAAA;AACjD,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,gBAAgB,CAAC,EAAE,IAAI,CAAC,CAAA;AAC/D,OAAO,CAAC,eAAe,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAC/D,OAAO,CAAC,gBAAgB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAChE,OAAO,CAAC,kBAAkB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AAClE,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,EAAE,IAAI,CAAC,CAAA;AACnE,OAAO,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAA;AACpH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAA;AACrE,OAAO,CAAC,SAAS,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAA;AAC5C,OAAO,CAAC,OAAO,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAA;AAC1C,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,iCAAiC,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAA;AACrE,OAAO,CAAC,KAAK,EAAE,iCAAiC,EAAE,IAAI,CAAC,CAAA;AACvD,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AAC9E,OAAO,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAA;AACrD,OAAO,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AAC9M,OAAO,CAAC,OAAO,EAAE,CAAC,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAA;AACzE,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;AACnD,OAAO,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;AACrD,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;AAC5C,OAAO,CAAC,KAAK,EAAE,CAAC,iBAAiB,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAA;;ACvLrE,SAAS,QAAQ,CAAe,MAAc,EAAE,QAAgB;IAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC1B,IAAI,MAAM,EAAE;QACV,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;KAClC;IAED,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAC3C,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,kBAAkB,EACtD,YAAY,QAAQ,uCAAuC,CAC5D,CAAA;IAED,IAAI,GAAG,KAAK,MAAM,EAAE;QAClB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAA;QAC9B,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;YAC1B,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,kBAAiB;YACjD,KAAK,EAAE,IAAI,CAAC,OAAO;SACpB,CAAC,CAAA;KACH;AACH,CAAC;AAED,SAAS,SAAS,CAAE,IAAkB;IACpC,MAAM,UAAU,GAAG,EAAE,CAAA;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/C,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;QACnC,UAAU,CAAC,QAAQ,CAAC,GAAG;YACrB,GAAG;gBACD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;aACnC;YACD,GAAG,CAAe,MAAc;gBAC9B,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF,CAAA;KACF;IAED,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAA;AACrD,CAAC;AAED,SAAS,aAAa,CAAE,YAAY;IAClC,OAAO,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;AACjC,CAAC;AAED,MAAa,KAAK;IAOhB,YAAoB,OAAoB;QACtC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAE,CAAA;QAC/B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAA;KACjB;IAEO,eAAe,CAAE,QAAgB;QACvC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;YACrE,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,GAAG,EAAE;gBACH,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;aACnC;YACD,GAAG,EAAE,CAAC,MAAc;gBAClB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF,CAAC,CAAA;KACH;IAED,IAAW,OAAO;QAChB,IAAI,IAAI,GAAG,EAAE,CAAA;QACb,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACrB,IAAI,CAAC,GAAG;gBAAE,OAAM;YAChB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC1D,IAAI,IAAI,GAAG,SAAS,KAAK,GAAG,GAAG,CAAA;SAChC,CAAC,CAAA;QACF,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,OAAO,CAAE,GAAW;QAC7B,IAAI,GAAG,IAAI,IAAI,EAAE;YACf,GAAG,GAAG,EAAE,CAAA;SACT;QAED,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI;YAC9B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;SAC1B,CAAC,CAAA;QAEF,IAAI,GAAG,KAAK,EAAE,EAAE;YACd,OAAM;SACP;QAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;YAC5B,IAAI,IAAI,KAAK,EAAE,EAAE;gBACf,SAAQ;aACT;;YAGD,MAAM,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAE7B,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;gBACpB,SAAQ;aACT;YACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;SAC9C;KACF;IAEM,WAAW,CAAE,YAAoB,EAAE,KAAqB;QAC7D,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;;YAE3B,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAA;SACnC;aAAM;YACL,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;SACzC;QACD,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE;YACtB,OAAM;SACP;QAED,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,EAAE;YAClC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;SAClC;aAAM;YACL,IAAI,CAAC,YAAY,CAAC,GAAG,KAAK,CAAA;SAC3B;KACF;IAEM,cAAc,CAAE,YAAoB;QACzC,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;QACxC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;YAC1C,OAAO,EAAE,CAAA;SACV;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAA;QACvB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;QACxC,OAAO,KAAK,CAAA;KACb;IAEM,gBAAgB,CAAE,YAAoB;QAC3C,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAA;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,KAAK,EAAE;YACV,OAAO,EAAE,CAAA;SACV;QAED,OAAO,KAAK,CAAA;KACb;CACF;AAED,SAAS,CAAC,KAAK,CAAC,CAAA;;ACvJhB,SAAS,UAAU;IACjB,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAgB,WAAW,CAAE,IAAiB,EAAE,OAAgB;IAC9D,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,MAAM,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,UAAU,CAAA;IAEpC,IAAI,MAAM,GAAuB,IAAI,CAAA;IAErC,OAAO,MAAM,EAAE;QACb,IAAI,MAAM,CAAC,QAAQ,6BAA8B,MAAM,CAAC,MAAM,CAAC,EAAE;YAC/D,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SACnB;QAED,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;KACjC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,SAAS,CAAE,EAAe,EAAE,IAAiB;IACpD,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU,CAAA;IAEhC,IAAI,UAAU,EAAE;QACd,OAAO,UAAyB,CAAA;KACjC;IAED,IAAI,OAAO,GAAuB,EAAE,CAAA;IAEpC,GAAG;QACD,IAAI,OAAO,KAAK,IAAI,EAAE;YACpB,OAAO,IAAI,CAAA;SACZ;QAED,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QAEvC,IAAI,WAAW,EAAE;YACf,OAAO,WAA0B,CAAA;SAClC;QACD,OAAO,GAAG,OAAO,CAAC,aAAa,CAAA;KAChC,QAAQ,OAAO,EAAC;IAEjB,OAAO,IAAI,CAAA;AACb,CAAC;;MChDY,SAAU,SAAQ,GAAW;IAGxC,YAAa,SAAiB,EAAE,EAAe;QAC7C,KAAK,EAAE,CAAA;QACP,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QAC3D,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;KACb;IAED,IAAW,KAAK;QACd,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;KAC3B;IAEM,GAAG,CAAE,CAAS;QACnB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACZ,IAAI,CAAC,OAAO,EAAE,CAAA;QAEd,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,IAAI,CAAA;KACjB;IAEM,MAAM,CAAE,CAAS;QACtB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,MAAM,CAAE,CAAS;QACtB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAChB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;SAChB;aAAM;YACL,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;SACb;QAED,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,OAAO,CAAE,EAAU,EAAE,EAAU;QACpC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAChB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAEb,IAAI,CAAC,OAAO,EAAE,CAAA;KACf;IAEM,QAAQ,CAAE,CAAS;QACxB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;KACpB;IAEM,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAA;KAClB;IAEO,OAAO;QACb,IAAI,CAAC,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;KAC/B;CACF;;IC7BY,WAAW,GAAxB,MAAa,WAAY,SAAQ,QAAQ;IAOvC;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B;QAExE,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAX7B,UAAK,GAAwB,EAAE,CAAA;QAE/B,YAAO,GAA4B,SAAS,CAAA;QAUjD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtB,IAAI,CAAC,QAAQ,wBAAwB;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;QAC5B,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;KACzB;IAEO,gBAAgB,CAAE,KAAgB;;QAExC,IAAI,MAAM,GAAG,IAAI,CAAA;;QAEjB,QAAQ,MAAM,GAAG,MAAM,CAAC,UAAkB,GAAG;YAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAE/C,IAAI,CAACA,SAAO,CAAC,SAAS,CAAC,EAAE;gBACvB,SAAQ;aACT;YAED,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;gBACtB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAA;aACf;SACF;KACF;IAED,IAAW,EAAE;QACX,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAE,CAAA;KAC9B;IAED,IAAW,EAAE,CAAE,GAAW;QACxB,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;KAC3B;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;KACtC;IAED,IAAW,SAAS,CAAE,GAAW;QAC/B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;KAC9B;IAED,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;KACtC;IAED,IAAW,SAAS;QAClB,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;KAC3C;IAED,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;KACzC;IAED,IAAW,UAAU;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAA;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACrE,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;KAChE;IAED,IAAW,WAAW;QACpB,IAAI,IAAI,GAAG,EAAE,CAAA;QACb,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAA;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,CAAA;SAClC;QAED,OAAO,IAAI,CAAA;KACZ;IAED,IAAW,WAAW,CAAE,IAAY;QAClC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAA;KACzB;IAEM,YAAY,CAAE,aAAqB;QACxC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAA;KAC/C;IAEM,aAAa;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;KAClC;IAEM,KAAK;QACV,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;KAC/B;IAEM,IAAI;QACT,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;KAChC;IAEM,YAAY,CAAE,aAAqB,EAAE,KAAU;;QACpD,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,IAAI,CAC3C,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,kBAAkB,EACpD,MAAM,IAAI,CAAC,QAAQ,SAAS,aAAa,0DAA0D,CACpG,CAAA;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEhG,QAAQ,aAAa;YACnB,KAAK,KAAK;gBACR,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,KAAe,CAAA;gBACpC,MAAK;YACP,KAAK,EAAE;gBACL,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAC5B,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;gBACrB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,CAAA;gBAC5C,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAC5B,MAAK;YACP;gBACE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,KAAe,CAAA;gBAE3C,IAAI,aAAa,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE;oBACrC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;wBAC9B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;qBACnC;oBACD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;iBACvE;gBACD,MAAK;SACR;QAED,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAA;QAE3C,MAAM,OAAO,GAAG;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,CAAC,aAAa,CAAC,EAAE;YACnD,KAAK;SACN,CAAA;QAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,oBAAoB,mDAAG,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;QAE/D,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QAE3B,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE;YAC1B,IAAI,WAAW,CAAC,aAAa,CAAC,KAAK,SAAS,EAAE;;;gBAG5C,IAAI,CAAC,aAAa,CAAC;oBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;oBAC3C,KAAK,EAAE,KAAK,GAAG,UAAU,IACvB,IAAI,CAAC,gBAAgB,EAAE,GAAG,IAAI,GAAG,WAAW,CAC7C;iBACF,CAAC,CAAA;aACH;iBAAM,IAAI,UAAU,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;;gBAE/C,IAAI,CAAC,aAAa,CAAC;oBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;oBAC3C,KAAK,EAAE,WAAW;iBACnB,CAAC,CAAA;aACH;SACF;KACF;IAEM,eAAe,CAAE,aAAqB;;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAA;QAEjG,IAAI,aAAa,KAAK,KAAK,EAAE;YAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAA;SACxB;aAAM;YACL,MAAM,WAAW,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,iBAAiB,mDAAG,IAAI,EAAE,aAAa,CAAC,CAAA;YACvE,IAAI,WAAW,EAAE;gBACf,OAAM;aACP;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,EAAE;gBAC7C,OAAM;aACP;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;SACjC;QAED,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC,CAAA;QAE3C,MAAM,OAAO,GAAG;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,CAAC,aAAa,CAAC,EAAE;YACnD,KAAK,EAAE,EAAE;SACV,CAAA;QAED,MAAA,MAAA,IAAI,CAAC,KAAK,EAAC,mBAAmB,mDAAG,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;QAE9D,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QAE3B,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE;YAC1B,IAAI,WAAW,CAAC,aAAa,CAAC,KAAK,SAAS,EAAE;;gBAE5C,IAAI,CAAC,aAAa,CAAC;oBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;oBAC3C,KAAK,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,IAAI,IAAI,gBAAgB,CAAC,IAAI,CAAC,GAAG,WAAW,GAAG,SAAS,CAAC;iBAC3F,CAAC,CAAA;aACH;iBAAM,IAAI,YAAY,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;;gBAElD,IAAI,CAAC,aAAa,CAAC;oBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;oBAC3C,KAAK,EAAE,SAAS;iBACjB,CAAC,CAAA;aACH;SACF;KACF;IAEM,YAAY,CAAE,aAAqB;QACxC,MAAM,IAAI,GAAG,aAAa,KAAK,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;QACrF,OAAO,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,EAAE,CAAA;KAClB;IAEM,oBAAoB,CAAE,OAAe;QAC1C,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;YAC1B,OAAO,EAAE,CAAC,QAAQ,KAAK,OAAO,KAAK,OAAO,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAA;SACnE,CAAC,CAAA;KACH;IAEM,sBAAsB,CAAE,SAAiB;QAC9C,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;YAC9B,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAChD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;SAC/C,CAAC,CAAA;KACH;IAEM,aAAa,CAAE,KAAgB;QACpC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAA;QAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAE7C,IAAI,CAACA,SAAO,CAAC,SAAS,CAAC,EAAE;YACvB,OAAO,KAAK,CAAA;SACb;QAED,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;YACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YAC7B,IAAI,MAAe,CAAA;YACnB,IAAI,QAAQ,CAAC,KAAK,EAAE;gBAClB,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;aACvB;iBAAM;gBACL,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;aACpC;YACD,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE;gBAClD,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAA;aAC9B;YAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;gBAC7B,MAAK;aACN;SACF;QAED,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;SAC7B;aAAM;YACL,KAAK,CAAC,KAAK,GAAG,IAAI,CAAA;SACnB;QAED,OAAO,SAAS,IAAI,IAAI,CAAA;KACzB;IAEM,gBAAgB,CAAE,IAAI,EAAE,OAAO,EAAE,OAAO;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;QAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YAChE,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,IAAI;aACZ,CAAC,CAAA;SACH;QAED,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;KAC/C;IAEM,mBAAmB,CAAE,IAAI,EAAE,OAAO;QACvC,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;QAElD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YAChE,IAAI,CAAC,aAAa,CAAC;gBACjB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,qBAAoB;gBAC3C,KAAK,EAAE,gBAAgB,CAAC,IAAI,CAAC,GAAG,UAAU,IAAI,EAAE,GAAG,QAAQ,IAAI,EAAE;aAClE,CAAC,CAAA;SACH;KACF;CACF,CAAA;AApSY,WAAW;IADvB,UAAU,EAAE;IASR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;;GAXlC,WAAW,CAoSvB;;AClUD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;;ACvB5B;AACA,IAAI,UAAU,GAAG,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,IAAI,MAAM,CAAC;;ACC3F;AACA,IAAI,QAAQ,GAAG,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC;AACjF;AACA;AACA,IAAI,IAAI,GAAG,UAAU,IAAI,QAAQ,IAAI,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;;ACJ/D;AACA,IAAIC,QAAM,GAAG,IAAI,CAAC,MAAM,CAAC;;ACDzB;AACA,IAAI,WAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAI,cAAc,GAAG,WAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,oBAAoB,GAAG,WAAW,CAAC,QAAQ,CAAC;AAChD;AACA;AACA,IAAI,cAAc,GAAGA,QAAM,GAAGA,QAAM,CAAC,WAAW,GAAG,SAAS,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE,IAAI,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,CAAC;AACxD,MAAM,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;AAClC;AACA,EAAE,IAAI;AACN,IAAI,KAAK,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;AACtC,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC;AACxB,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE;AAChB;AACA,EAAE,IAAI,MAAM,GAAG,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAChD,EAAE,IAAI,QAAQ,EAAE;AAChB,IAAI,IAAI,KAAK,EAAE;AACf,MAAM,KAAK,CAAC,cAAc,CAAC,GAAG,GAAG,CAAC;AAClC,KAAK,MAAM;AACX,MAAM,OAAO,KAAK,CAAC,cAAc,CAAC,CAAC;AACnC,KAAK;AACL,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;;AC3CD;AACA,IAAIC,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,sBAAoB,GAAGD,aAAW,CAAC,QAAQ,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,EAAE,OAAOC,sBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1C,CAAC;;ACfD;AACA,IAAI,OAAO,GAAG,eAAe;AAC7B,IAAI,YAAY,GAAG,oBAAoB,CAAC;AACxC;AACA;AACA,IAAIC,gBAAc,GAAGH,QAAM,GAAGA,QAAM,CAAC,WAAW,GAAG,SAAS,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE;AACrB,IAAI,OAAO,KAAK,KAAK,SAAS,GAAG,YAAY,GAAG,OAAO,CAAC;AACxD,GAAG;AACH,EAAE,OAAO,CAACG,gBAAc,IAAIA,gBAAc,IAAI,MAAM,CAAC,KAAK,CAAC;AAC3D,MAAM,SAAS,CAAC,KAAK,CAAC;AACtB,MAAM,cAAc,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;;ACzBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,QAAQ,CAAC;AACnD,CAAC;;ACvBD;AACA,IAAI,SAAS,GAAG,iBAAiB,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,OAAO,KAAK,IAAI,QAAQ;AACjC,KAAK,YAAY,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC;AAC5D,CAAC;;ACvBD;AACA,IAAI,YAAY,GAAG,kDAAkD;AACrE,IAAI,aAAa,GAAG,OAAO,CAAC;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE;AAC9B,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,SAAS;AAC/D,MAAM,KAAK,IAAI,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACxC,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH,EAAE,OAAO,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;AAC/D,KAAK,MAAM,IAAI,IAAI,IAAI,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AAChD,CAAC;;AC1BD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,OAAO,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,UAAU,CAAC,CAAC;AACnE,CAAC;;ACzBD;AACA,IAAI,QAAQ,GAAG,wBAAwB;AACvC,IAAI,OAAO,GAAG,mBAAmB;AACjC,IAAI,MAAM,GAAG,4BAA4B;AACzC,IAAI,QAAQ,GAAG,gBAAgB,CAAC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;AACxB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA,EAAE,IAAI,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,OAAO,GAAG,IAAI,OAAO,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,CAAC;AAC/E,CAAC;;AChCD;AACA,IAAI,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC;;ACD5C;AACA,IAAI,UAAU,IAAI,WAAW;AAC7B,EAAE,IAAI,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;AAC3F,EAAE,OAAO,GAAG,IAAI,gBAAgB,GAAG,GAAG,IAAI,EAAE,CAAC;AAC7C,CAAC,EAAE,CAAC,CAAC;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,IAAI,EAAE;AACxB,EAAE,OAAO,CAAC,CAAC,UAAU,KAAK,UAAU,IAAI,IAAI,CAAC,CAAC;AAC9C,CAAC;;ACjBD;AACA,IAAI,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAI,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,IAAI,EAAE;AACxB,EAAE,IAAI,IAAI,IAAI,IAAI,EAAE;AACpB,IAAI,IAAI;AACR,MAAM,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE;AAClB,IAAI,IAAI;AACR,MAAM,QAAQ,IAAI,GAAG,EAAE,EAAE;AACzB,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE;AAClB,GAAG;AACH,EAAE,OAAO,EAAE,CAAC;AACZ,CAAC;;AClBD;AACA;AACA;AACA;AACA,IAAI,YAAY,GAAG,qBAAqB,CAAC;AACzC;AACA;AACA,IAAI,YAAY,GAAG,6BAA6B,CAAC;AACjD;AACA;AACA,IAAIC,WAAS,GAAG,QAAQ,CAAC,SAAS;AAClC,IAAIH,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAII,cAAY,GAAGD,WAAS,CAAC,QAAQ,CAAC;AACtC;AACA;AACA,IAAIE,gBAAc,GAAGL,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA,IAAI,UAAU,GAAG,MAAM,CAAC,GAAG;AAC3B,EAAEI,cAAY,CAAC,IAAI,CAACC,gBAAc,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC;AACjE,GAAG,OAAO,CAAC,wDAAwD,EAAE,OAAO,CAAC,GAAG,GAAG;AACnF,CAAC,CAAC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC3C,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,GAAG,YAAY,CAAC;AAC9D,EAAE,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACvC,CAAC;;AC5CD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;AAC/B,EAAE,OAAO,MAAM,IAAI,IAAI,GAAG,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAClD,CAAC;;ACPD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE;AAChC,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACpC,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC;AACjD,CAAC;;ACZD;AACA,IAAI,YAAY,GAAG,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;;ACD/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,GAAG;AACrB,EAAE,IAAI,CAAC,QAAQ,GAAG,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;AACzD,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB,CAAC;;ACZD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,GAAG,EAAE;AACzB,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC1D,EAAE,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9B,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;;ACZD;AACA,IAAI,cAAc,GAAG,2BAA2B,CAAC;AACjD;AACA;AACA,IAAIL,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAIK,gBAAc,GAAGL,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE;AACtB,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,IAAI,YAAY,EAAE;AACpB,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AAC3B,IAAI,OAAO,MAAM,KAAK,cAAc,GAAG,SAAS,GAAG,MAAM,CAAC;AAC1D,GAAG;AACH,EAAE,OAAOK,gBAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;AAChE,CAAC;;ACzBD;AACA,IAAIL,aAAW,GAAG,MAAM,CAAC,SAAS,CAAC;AACnC;AACA;AACA,IAAIK,gBAAc,GAAGL,aAAW,CAAC,cAAc,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE;AACtB,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,OAAO,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,IAAIK,gBAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnF,CAAC;;AClBD;AACA,IAAIC,gBAAc,GAAG,2BAA2B,CAAC;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE;AAC7B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC3B,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACrC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,IAAI,KAAK,KAAK,SAAS,IAAIA,gBAAc,GAAG,KAAK,CAAC;AAC7E,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;;ACdD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,IAAI,CAAC,OAAO,EAAE;AACvB,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;AACjC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;AACtC,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;AAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;AAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;;AC7B7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,GAAG;AAC1B,EAAE,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;AACrB,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB,CAAC;;ACVD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE;AAC1B,EAAE,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC;AACjE,CAAC;;AChCD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;AAClC,EAAE,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AAC5B,EAAE,OAAO,MAAM,EAAE,EAAE;AACnB,IAAI,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;AACnC,MAAM,OAAO,MAAM,CAAC;AACpB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;;AChBD;AACA,IAAI,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC;AACjC;AACA;AACA,IAAI,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,eAAe,CAAC,GAAG,EAAE;AAC9B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE;AACjB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AAClC,EAAE,IAAI,KAAK,IAAI,SAAS,EAAE;AAC1B,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;AACf,GAAG,MAAM;AACT,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAChC,GAAG;AACH,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC;AACd,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;;AC9BD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE;AAC3B,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,OAAO,KAAK,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;;ACdD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE;AAC3B,EAAE,OAAO,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;;ACXD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE;AAClC,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE;AACjB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;AAChB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAC5B,GAAG,MAAM;AACT,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;AAC3B,GAAG;AACH,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;;ACjBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,OAAO,EAAE;AAC5B,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,SAAS,CAAC,SAAS,CAAC,KAAK,GAAG,cAAc,CAAC;AAC3C,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,eAAe,CAAC;AAChD,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC;AACvC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC;AACvC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC;;AC1BvC;AACA,IAAIC,KAAG,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;;ACAjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,GAAG;AACzB,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AAChB,EAAE,IAAI,CAAC,QAAQ,GAAG;AAClB,IAAI,MAAM,EAAE,IAAI,IAAI;AACpB,IAAI,KAAK,EAAE,KAAKA,KAAG,IAAI,SAAS,CAAC;AACjC,IAAI,QAAQ,EAAE,IAAI,IAAI;AACtB,GAAG,CAAC;AACJ,CAAC;;AClBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC1B,EAAE,OAAO,CAAC,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,SAAS;AACvF,OAAO,KAAK,KAAK,WAAW;AAC5B,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC;AACvB,CAAC;;ACVD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE;AAC9B,EAAE,IAAI,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;AAC1B,EAAE,OAAO,SAAS,CAAC,GAAG,CAAC;AACvB,MAAM,IAAI,CAAC,OAAO,GAAG,IAAI,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC;AACtD,MAAM,IAAI,CAAC,GAAG,CAAC;AACf,CAAC;;ACbD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,GAAG,EAAE;AAC7B,EAAE,IAAI,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;AACpD,EAAE,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9B,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;;ACbD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACxC,CAAC;;ACXD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACxC,CAAC;;ACXD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE;AACjC,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC;AAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;AACvB;AACA,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACvB,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;AACzC,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;;ACbD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,OAAO,EAAE;AAC3B,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AACpD;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACf,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,aAAa,CAAC;AACzC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC;AAC9C,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW,CAAC;AACrC,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW,CAAC;AACrC,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,WAAW,CAAC;;AC3BrC;AACA,IAAI,eAAe,GAAG,qBAAqB,CAAC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE;AACjC,EAAE,IAAI,OAAO,IAAI,IAAI,UAAU,KAAK,QAAQ,IAAI,IAAI,IAAI,OAAO,QAAQ,IAAI,UAAU,CAAC,EAAE;AACxF,IAAI,MAAM,IAAI,SAAS,CAAC,eAAe,CAAC,CAAC;AACzC,GAAG;AACH,EAAE,IAAI,QAAQ,GAAG,WAAW;AAC5B,IAAI,IAAI,IAAI,GAAG,SAAS;AACxB,QAAQ,GAAG,GAAG,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAC7D,QAAQ,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;AAC/B;AACA,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AACxB,MAAM,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC5B,KAAK;AACL,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACxC,IAAI,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC;AACrD,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG,CAAC;AACJ,EAAE,QAAQ,CAAC,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;AACnD,EAAE,OAAO,QAAQ,CAAC;AAClB,CAAC;AACD;AACA;AACA,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC;;ACpEzB;AACA,IAAI,gBAAgB,GAAG,GAAG,CAAC;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,IAAI,EAAE;AAC7B,EAAE,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,EAAE;AAC3C,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE;AACzC,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;AACpB,KAAK;AACL,IAAI,OAAO,GAAG,CAAC;AACf,GAAG,CAAC,CAAC;AACL;AACA,EAAE,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;AAC3B,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;;ACrBD;AACA,IAAI,UAAU,GAAG,kGAAkG,CAAC;AACpH;AACA;AACA,IAAI,YAAY,GAAG,UAAU,CAAC;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,YAAY,GAAG,aAAa,CAAC,SAAS,MAAM,EAAE;AAClD,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;AAClB,EAAE,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU;AAC3C,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACpB,GAAG;AACH,EAAE,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE;AACvE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC;AACnF,GAAG,CAAC,CAAC;AACL,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC,CAAC;;ACxBH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE;AACnC,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM;AAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;AAC7B;AACA,EAAE,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;AAC3B,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACzD,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;;ACbD;AACA,IAAI,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB;AACA;AACA,IAAI,WAAW,GAAGR,QAAM,GAAGA,QAAM,CAAC,SAAS,GAAG,SAAS;AACvD,IAAI,cAAc,GAAG,WAAW,GAAG,WAAW,CAAC,QAAQ,GAAG,SAAS,CAAC;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B;AACA,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,EAAE;AAChC,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB;AACA,IAAI,OAAO,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,GAAG,EAAE,CAAC;AAC9C,GAAG;AACH,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACvB,IAAI,OAAO,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;AAC5D,GAAG;AACH,EAAE,IAAI,MAAM,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC;AAC5B,EAAE,OAAO,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,QAAQ,IAAI,IAAI,GAAG,MAAM,CAAC;AACrE,CAAC;;AChCD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,KAAK,IAAI,IAAI,GAAG,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;;ACpBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE;AACjC,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACtB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,OAAO,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACxE,CAAC;;AChBD;AACA,IAAIS,UAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE;AACtB,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACnD,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,EAAE,IAAI,MAAM,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC;AAC5B,EAAE,OAAO,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,KAAK,CAACA,UAAQ,IAAI,IAAI,GAAG,MAAM,CAAC;AACrE,CAAC;;ACfD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE;AAC/B,EAAE,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAChC;AACA,EAAE,IAAI,KAAK,GAAG,CAAC;AACf,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;AAC3B;AACA,EAAE,OAAO,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG,MAAM,EAAE;AAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1C,GAAG;AACH,EAAE,OAAO,CAAC,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,GAAG,SAAS,CAAC;AACzD,CAAC;;ACnBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE;AACzC,EAAE,IAAI,MAAM,GAAG,MAAM,IAAI,IAAI,GAAG,SAAS,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAClE,EAAE,OAAO,MAAM,KAAK,SAAS,GAAG,YAAY,GAAG,MAAM,CAAC;AACtD,CAAC;;MC5BY,OAAO,GAAY;IAC9B,SAAS,EAAE,IAAI;IACf,KAAK,EAAE,KAAK;CACb;;ACHD,MAAM,WAAW;IAAjB;QACU,aAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;KAmB7C;IAjBQ,KAAK,CAAE,EAAU;QACtB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE;YAClB,OAAM;SACP;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;KAClC;IAEM,IAAI,CAAE,EAAU;QACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE;YAClB,OAAM;SACP;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAA;QACnC,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;;QAEvB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,IAAI,IAAI,CAAC,CAAA;KACnC;CACF;AAED,AAAO,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAA;;ACHrC,MAAM,gBAAgB,GAAG,WAAW,EAAE,CAAA;AAGtC,IAAa,eAAe,GAA5B,MAAa,eAAgB,SAAQ,WAAW;IAa9C;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B,EAChC,WAAmB;QAE3D,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;QAnBzC,iBAAY,GAAG,KAAK,CAAA;QAEpB,mBAAc,GAAoB,EAAE,CAAA;QAEpC,oBAAe,GAAU,EAAE,CAAA;QAI5B,kBAAa,GAAG,KAAK,CAAA;QAErB,QAAG,GAAsB,IAAI,CAAA;QAUlC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;KAC/B;IAED,IAAW,KAAK;QACd,OAAO,QAAQ,CAAA;KAChB;IAED,IAAc,KAAK;QACjB,OAAO,IAAI,CAAA;KACZ;IAEM,aAAa,CAAE,OAAsB;QAC1C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAEjC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE;YAC5C,IAAI,CAAC,aAAa,EAAE,CAAA;SACrB;KACF;IAEM,aAAa,CAAE,UAAU,GAAG,KAAK,EAAE,SAAgB;QACxD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAA;QAEzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAI,CAAA;QAErB,UAAU,CAAC;YACT,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;YACpB,MAAM,IAAI,GAAkE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC/F,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,UAAU;kBACN,CAAC,aAAa,EAAE,YAAY,CAAC;kBAC7B,EAAE,CACP,CAAA;YAED,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;gBACrC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAG,CAAA;gBACpD,IAAI,IAAI,CAAC,QAAQ,uBAAsB,EAAE;oBACvC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;iBACrB;gBACD,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;aACnB;YAED,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,UAAU,CAAC,OAAO,CAAC,CAAC;;oBAElB,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,EAAE;wBAClC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAA;qBAClB;iBACF,CAAC,CAAA;gBAEF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;gBACxB,IAAIC,YAAU,CAAC,KAAK,CAAC,EAAE;oBACrB,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAA;iBACrB;aACF;YAED,IAAIA,YAAU,CAAC,SAAS,CAAC,EAAE;gBACzB,SAAS,CAAC,IAAI,CAAC,CAAA;aAChB;iBAAM;gBACL,IAAI,CAAC,aAAa,GAAG,KAAK,CAAA;gBAC1B,MAAM,mBAAmB,GAA8C,EAAE,CAAA;gBACzE,MAAM,gBAAgB,GAA+C,IAAI,GAAG,EAAE,CAAA;gBAC9E,MAAM,YAAY,GAAG,EAAE,CAAA;gBACvB,IAAI,CAAC,UAAU,EAAE;oBACf,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;wBACpB,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;wBAChC,IAAI,gBAAgB,GAAG,KAAK,CAAA;wBAC5B,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;4BAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;4BACjD,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;4BACtD,IAAI,OAAO,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,KAAK,cAAc,EAAE;gCAC1D,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAA;gCACnC,MAAM,aAAa,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,eAAe,EAAE,CAAC,CAAA;gCAChE,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gCAClD,IAAI,aAAa,EAAE;oCACjB,gBAAgB,GAAG,IAAI,CAAA;oCACvB,gBAAgB,CAAC,GAAG,CAAC,aAAa,mCAAQ,gBAAgB,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,MAAG,CAAC,KAAK,WAAW,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAG,CAAA;iCACvH;gCACD,MAAK;6BACN;yBACF;wBACD,IAAI,CAAC,gBAAgB,EAAE;4BACrB,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;yBAC1B;qBACF;oBACD,IAAI,gBAAgB,CAAC,IAAI,GAAG,CAAC,EAAE;wBAC7B,gBAAgB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,GAAG;4BACjC,mBAAmB,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;yBACxC,CAAC,CAAA;qBACH;iBACF;gBACD,MAAM,YAAY,GAAG,mBAAmB,CAAC,MAAM,CAAA;gBAC/C,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,WAAW,gBAAgB,EAAE,EAAE,CAAA;oBAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;oBACpC,IAAI,WAAW,GAAG,CAAC,CAAA;oBACnB,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE;wBACxB,WAAW,EAAE,CAAA;wBACb,IAAI,WAAW,KAAK,YAAY,GAAG,CAAC,EAAE;4BACpC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;4BACnB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gCACtB,IAAI,CAAC,mBAAmB,EAAE,CAAA;6BAC3B;4BACD,IAAI,UAAU,EAAE;gCACd,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;6BACrB;yBACF;qBACF,EAAE,WAAW,CAAC,CAAA;oBACf,mBAAmB,CAAC,OAAO,CAAC,IAAI;wBAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;4BAE1D,OAAO,CAAC,GAAG,CAAC,0BAA0B,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;yBACnD;wBACD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;4BAC1B,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;yBAC7B,CAAC,CAAA;qBACH,CAAC,CAAA;oBACF,IAAI,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,EAAE;wBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;4BAE1D,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAA;yBACtC;wBACD,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE;4BACxB,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;yBAC7B,CAAC,CAAA;qBACH;iBACF;qBAAM;oBACL,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,EAAE;;wBAE1D,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;qBAC9B;oBACD,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE;wBAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;wBACnB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;4BACtB,IAAI,CAAC,mBAAmB,EAAE,CAAA;yBAC3B;wBACD,IAAI,UAAU,EAAE;4BACd,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;yBACrB;qBACF,CAAC,CAAA;iBACH;aACF;SACF,EAAE,CAAC,CAAC,CAAA;KACN;IAEM,qBAAqB,CAAE,EAAQ,EAAE,GAAyB;QAC/D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;YACxB,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAA;SAC1B,CAAC,CAAA;KACH;IAEM,mBAAmB;QACxB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC5C,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAA;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAA;SACZ;KACF;CACF,CAAA;AApLY,eAAe;IAD3B,UAAU,EAAE;IAeR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;IAC1C,WAAA,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAA;;GAlB9B,eAAe,CAoL3B;;MCnMY,WAAY,SAAQ,WAAW;IAC1C,IAAW,KAAK;;QAEd,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC7B,OAAO,GAAG,IAAI,IAAI,GAAG,EAAE,GAAG,GAAG,CAAA;KAC9B;IAED,IAAW,KAAK,CAAE,GAAsC;QACtD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;KAC9B;IAEM,aAAa,CAAE,KAAgB;QACpC,IAAI,KAAK,CAAC,OAAO,EAAE;YACjB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAA;YACtC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;gBACzB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAa,CAAA;aACjC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE;;;;gBAI/B,IAAI,CAAC,KAAK,GAAG,GAAa,CAAA;aAC3B;SACF;QAED,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;KAClC;CACF;;ACjCD;AACA,MAAa,UAAW,SAAQ,WAAW;CAAG;;ACe9C,SAAS,YAAY;IACnB,OAAO;QACL,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;KACR,CAAA;AACH,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB,EAAE,GAAW,EAAE,GAAW;IACjE,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;IAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,GAAG,KAAK,GAAG,GAAG,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAChC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,IAAI,KAAK,IAAI,EAAE;YACjB,QAAQ,CAAC,IAAI,EAAE,CAAA;YACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;SACpB;aAAM;YACL,QAAQ,CAAC,MAAM,EAAE,CAAA;SAClB;KACF;AACH,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB,EAAE,GAAW,EAAE,GAAW;IACjE,MAAM,GAAG,GAAG,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAA;IAChC,OAAO,YAAY,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AACzC,CAAC;AAED,SAAS,YAAY,CAAE,QAAkB;IACvC,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,MAAM,EAAE,QAAQ,CAAC,MAAM;KACxB,CAAA;AACH,CAAC;AAED,MAAM,UAAU,GAAG,IAAI,CAAA;AACvB,SAAS,gBAAgB,CAAE,IAAY;IACrC,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED,MAAM,SAAS,GAAG,GAAG,CAAA;AACrB,SAAS,eAAe,CAAE,IAAY;IACpC,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC7B,CAAC;AAED,SAAS,cAAc,CAAE,OAAe;IACtC,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAA;IAClC,IAAI,OAAO,CAAC,IAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACxC,OAAO,IAAI,CAAA;KACZ;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,YAAY,GAAG,aAAa,CAAA;AAElC,SAAS,WAAW,CAAE,GAAW,EAAE,KAAa;IAC9C,OAAO,IAAI,EAAE;QACX,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACvC,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;YAClB,OAAO,OAAO,CAAA;SACf;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;QACpC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3D,OAAO,OAAO,CAAA;SACf;QACD,KAAK,GAAG,OAAO,GAAG,CAAC,CAAA;KACpB;AACH,CAAC;AAED,SAAS,SAAS,CAAE,MAAc,EAAE,SAAiB,EAAE,IAAY;IACjE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAExD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;;IAGvB,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YACvC,MAAK;SACN;KACF;;IAGD,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YACvC,OAAO,IAAI,CAAA;SACZ;KACF;AACH,CAAC;AAED,MAAa,MAAM;IAOjB,YAAa,IAAY;QANjB,WAAM,GAAY,EAAE,CAAA;QAEpB,aAAQ,GAAa,YAAY,EAAE,CAAA;QAKzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;KACjB;IAEM,IAAI;QACT,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QAEvB,OAAO,QAAQ,CAAC,KAAK,GAAG,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;YAC5B,IAAI,CAAC,QAAQ,EAAE,CAAA;YACf,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,EAAE;gBAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBACnD,IAAI,SAAS,EAAE;oBACb,IAAI,CAAC,WAAW,EAAE,CAAA;iBACnB;qBAAM;oBACL,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;oBAC9B,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE;wBAC3B,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;qBAC1B;iBACF;aACF;SACF;QAED,OAAO,IAAI,CAAC,MAAM,CAAA;KACnB;IAEO,QAAQ;QACd,MAAM,IAAI,GAAG,MAAM,CAAA;QACnB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC/C,IAAI,OAAO,KAAK,QAAQ,CAAC,KAAK,EAAE;YAC9B,OAAM;SACP;QACD,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;YAClB,OAAO,GAAG,IAAI,CAAC,MAAM,CAAA;SACtB;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QACnD,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QACrC,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;KAC9D;IAEO,WAAW;QACjB,MAAM,IAAI,GAAG,SAAS,CAAA;QACtB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;QAC/B,IAAI,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QACpD,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC,CAAA;QAC/B,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE;YACrB,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAA;SACtC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QACtD,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YACf,IAAI;YACJ,OAAO;YACP,QAAQ,EAAE;gBACR,KAAK;gBACL,GAAG,EAAE,YAAY,CAAC,QAAQ,CAAC;aAC5B;SACF,CAAC,CAAA;KACH;IAEO,OAAO;QACb,IAAI,CAAC,YAAY,EAAE,CAAA;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAClC,IAAI,CAAC,SAAS,EAAE,CAAA;QAChB,IAAI,CAAC,UAAU,EAAE,CAAA;QAEjB,OAAO,OAAO,CAAA;KACf;IAEO,YAAY;QAClB,MAAM,IAAI,GAAG,WAAW,CAAA;QACxB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAE/B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAClD,MAAM,KAAK,GAAG,UAAU,KAAK,GAAG,CAAA;QAChC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACpC,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;KACvD;IAEO,UAAU;QAChB,MAAM,IAAI,GAAG,SAAS,CAAA;QACtB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC7C,MAAM,KAAK,GAAG,SAAS,KAAK,GAAG,CAAA;QAC/B,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;KACrD;IAEO,WAAW;QACjB,MAAM,IAAI,GAAG,KAAK,CAAA;QAClB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC1B,OAAO,KAAK,GAAG,GAAG,EAAE;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAC/B,MAAM,SAAS,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAA;YAC3E,IAAI,SAAS;gBAAE,MAAK;YACpB,KAAK,EAAE,CAAA;SACR;QAED,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAA;QACnB,OAAO,GAAG,GAAG,GAAG,EAAE;YAChB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC7B,MAAM,SAAS,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAA;YAC3E,IAAI,CAAC,SAAS;gBAAE,MAAK;YACrB,GAAG,EAAE,CAAA;SACN;QAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QACtC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YACf,IAAI;YACJ,OAAO,EAAE,OAAO;SACjB,CAAC,CAAA;QAEF,OAAO,OAAO,CAAA;KACf;IAEO,SAAS;QACf,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QACvC,IAAI,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAA;QAC3B,IAAI,KAAK,GAAkB,IAAI,CAAA;QAC/B,IAAI,SAAS,GAAG,MAAM,CAAA;QACtB,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,OAAO,MAAM,GAAG,GAAG,EAAE;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAChC,IAAI,KAAK,EAAE;gBACT,MAAM,UAAU,GAAG,IAAI,KAAK,KAAK,CAAA;gBACjC,IAAI,UAAU,EAAE;oBACd,KAAK,GAAG,IAAI,CAAA;iBACb;gBACD,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,QAAQ,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAA;YAC7C,IAAI,QAAQ,EAAE;gBACZ,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;iBAC1C;gBACD,MAAK;aACN;YAED,IAAI,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE;gBACtC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;iBAC1C;gBACD,SAAS,GAAG,MAAM,GAAG,CAAC,CAAA;gBACtB,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,YAAY,GAAG,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,CAAA;YAClD,IAAI,YAAY,EAAE;gBAChB,KAAK,GAAG,IAAI,CAAA;gBACZ,MAAM,EAAE,CAAA;gBACR,SAAQ;aACT;YAED,MAAM,EAAE,CAAA;SACT;QAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QAEpC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAA;QACzB,MAAM,IAAI,GAAG,WAAW,CAAA;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;YACpC,IAAI,SAAS,EAAE;gBACb,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC/B,IAAI,UAAU,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;oBAC5C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;wBACzB,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU,CAAA;wBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;wBACvC,CAAC,IAAI,CAAC,CAAA;wBACN,SAAQ;qBACT;oBACD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;oBAC9B,CAAC,IAAI,CAAC,CAAA;oBACN,IAAI,SAAS,EAAE;wBACb,MAAM,OAAO,GAAG,IAAI,GAAG,GAAG,GAAG,SAAS,CAAA;wBACtC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;wBACvC,CAAC,IAAI,CAAC,CAAA;wBACN,SAAQ;qBACT;iBACF;aACF;YACD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;gBACtB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC/B,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;oBAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU,CAAA;oBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;oBACvC,CAAC,IAAI,CAAC,CAAA;oBACN,SAAQ;iBACT;gBAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;gBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;gBACvC,SAAQ;aACT;YAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;SACrC;KACF;IAEO,WAAW,CAAE,OAAe;QAClC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;QAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,EAAE,CAAA;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;QACvB,OAAO,QAAQ,CAAC,KAAK,GAAG,GAAG,EAAE;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;YAClD,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE;gBAClB,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACf,MAAK;aACN;YAED,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YAC3B,IAAI,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,EAAE;gBACtC,MAAK;aACN;SACF;KACF;CACF;;SChWe,OAAO,CACrB,GAAW,EACX,gBAA0B;IAE1B,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACxD,MAAM,IAAI,GAAkB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;KACpB;IACD,OAAO,gBAAgB,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAC/E,CAAC;AAED,AAAO,MAAM,mBAAmB,GAAG;IACjC,GAAG,EAAE,OAAO;IACZ,MAAM,EAAE,UAAU;CACnB,CAAA;AAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC;KACtD,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;KACzB,IAAI,CAAC,GAAG,CAAC,CAAA;AAEZ;AACA,AAAO,MAAM,cAAc,GAAG,OAAO,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAA;AAE9D;AACA,AAAO,MAAM,gBAAgB,GAAG,OAAO,CAAC,mNAAmN,EAAE,IAAI,CAAC,CAAA;AAElQ;AACA,AAAO,MAAM,eAAe,GAAG,OAAO,CAAC,8KAA8K,EAAE,IAAI,CAAC,CAAA;;SC9B5M,OAAO,CAAE,GAAW;IAClC,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACzB,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;IAC1B,MAAM,YAAY,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,CAAA;IAC/C,IAAI,YAAY,IAAI,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;QAC3C,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;KACzB;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;;ACFD,MAAM,YAAY,GAAG,GAAG,CAAA;AACxB,MAAM,aAAa,GAAG,GAAG,CAAA;AACzB,MAAM,cAAc,GAAG,GAAG,CAAA;AAC1B,MAAM,WAAW,GAAG,GAAG,CAAA;AACvB,MAAM,gBAAgB,GAAG,GAAG,CAAA;AAC5B,MAAM,0BAA0B,GAAG,GAAG,CAAA;AACtC,MAAM,2BAA2B,GAAG,GAAG,CAAA;AAqBvC,MAAqB,cAAc;IAAnC;QACE,WAAM,GAAY,EAAE,CAAA;KAgMrB;IA9LC,YAAY,CAAE,GAAW;QACvB,MAAM,SAAS,GAAG,wCAAwC,CAAA;QAC1D,IAAI,IAAI,GAAG,GAAG,CAAA;;QAGd,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAU;YAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,EAAE,CAAA;YACvB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;YAC5B,OAAO,EAAE,CAAA;SACV,CAAC,CAAA;QAEF,OAAO,IAAI,CAAC,IAAI,EAAE,CAAA;KACnB;IAED,gBAAgB,CAAE,KAAa;QAC7B,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;QAEpC,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE;YACd,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAA;YACvC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;YAE3C,IAAI,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;YACrC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE;gBAClD,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBACzC,OAAO,IAAI,CAAC,GAAG,CAAA;aAChB,CAAC,CAAA;YACF,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YACnC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;YAEzC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE;gBACzB,OAAO,IAAI,GAAG,CAAA;aACf;YACD,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG;gBAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;gBAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBACf,OAAO;oBACP,YAAY;iBACb,CAAC,CAAA;aACH,CAAC,CAAA;YACF,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;YAC3B,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;SACjC;;KAEF;IAED,aAAa,CAAE,GAAW;;QAExB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACrF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,QAAQ,GAAc;gBAC1B,OAAO,EAAE,SAAS,KAAK,gBAAgB;gBACvC,gBAAgB,EAAE,SAAS,KAAK,0BAA0B;gBAC1D,iBAAiB,EAAE,SAAS,KAAK,2BAA2B;gBAC5D,GAAG,EAAE,IAAI;gBACT,EAAE,EAAE,IAAI;gBACR,KAAK,EAAE,EAAE;gBACT,KAAK,EAAE,EAAE;aACV,CAAA;YAED,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA;;YAGjC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,UAAU,CAAC,EAAE,EAAU;gBACvD,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBAClC,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;gBAElC,MAAM,IAAI,GAAG;oBACX,GAAG;oBACH,GAAG;oBACH,KAAK,EAAE,GAAG,GAAG,IAAI,GAAG,KAAK;iBAC1B,CAAA;gBACD,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzB,OAAO,EAAE,CAAA;aACV,CAAC,CAAA;YAEF,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,uBAAuB,EAAE,UAAU,CAAC,EAAE,EAAU;gBAClE,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE;;oBAEzB,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;iBAC3B;qBAAM,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,cAAc,EAAE;;oBAEnC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;iBAClC;gBACD,OAAO,EAAE,CAAA;aACV,CAAC,CAAA;;YAGF,IAAI,IAAI,KAAK,EAAE,EAAE;gBACf,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAA;aACpB;YAED,OAAO,QAAQ,CAAA;SAChB,CAAC,CAAA;QACF,OAAO,SAAS,CAAA;KACjB;IAED,UAAU,CAAE,OAAe,EAAE,EAAqB,EAAE,IAAc;QAChE,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,CAAC;YAC3E,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACjB,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAA;YAChC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YAE1C,IAAI,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,gBAAgB,MAAI,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,iBAAiB,CAAA,EAAE;gBACrE,QAAQ,GAAG,YAAY,CAAA;gBACvB,GAAG,IAAI,CAAC,CAAA;gBACR,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;aACb;YAED,IAAI,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAA;YAEtD,IAAI,OAAO,IAAI,QAAQ,CAAC,gBAAgB,EAAE;gBACxC,IAAI,IAAI,GAAsB,kBAAkB,CAAC,EAAE,CAAC,CAAA;gBACpD,OAAO,IAAI,EAAE;oBACX,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE;wBACpF,OAAO,GAAG,IAAI,CAAA;wBACd,MAAK;qBACN;oBACD,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;oBAC/B,OAAO,GAAG,KAAK,CAAA;iBAChB;aACF;YACD,IAAI,OAAO,IAAI,QAAQ,CAAC,iBAAiB,EAAE;gBACzC,MAAM,IAAI,GAAsB,kBAAkB,CAAC,EAAE,CAAC,CAAA;gBACtD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;oBAC5B,OAAO,GAAG,KAAK,CAAA;iBAChB;qBAAM;oBACL,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;oBACrF,IAAI,CAAC,cAAc,EAAE;wBACnB,OAAO,GAAG,KAAK,CAAA;qBAChB;iBACF;aACF;YAED,IAAI,OAAO,EAAE;gBACX,IAAI,GAAG,KAAK,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBACnC,OAAO,GAAG,GAAG,OAAO,CAAA;iBACrB;qBAAM,IAAI,GAAG,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;iBACb;aACF;iBAAM;;gBAEL,IAAI,QAAQ,CAAC,OAAO,IAAI,GAAG,GAAG,CAAC,EAAE;oBAC/B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;oBACZ,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBACzD,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;qBACb;iBACF;aACF;YAED,OAAO,GAAG,CAAA;SACX,EAAE,EAAE,CAAC,CAAA;QACN,OAAO,GAAG,CAAA;KACX;IAED,YAAY,CAAE,OAAe,EAAE,EAAqB,EAAE,QAAmB;;QAEvE,IAAI,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK,OAAO;YAAE,OAAO,KAAK,CAAA;;QAG1D,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YAAE,OAAO,KAAK,CAAA;;QAGtD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE;YACzB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC7B,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;oBACjC,OAAO,KAAK,CAAA;iBACb;aACF;SACF;;QAGD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC7C,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE;oBAChC,OAAO,KAAK,CAAA;iBACb;qBAAM;oBACL,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAA;oBACjC,IAAI,IAAI,KAAK,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE;wBACjC,OAAO,KAAK,CAAA;qBACb;iBACF;aACF;SACF;QAED,OAAO,IAAI,CAAA;KACZ;CACF;AAED,SAAS,kBAAkB,CAAE,EAAY;IACvC,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAA;IAC/B,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAA;IAExB,MAAM,IAAI,GAAG,EAAE,CAAC,eAAe,CAAA;IAC/B,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAEtB,IAAI,IAAI,CAAC,QAAQ,2BAA4B;QAC3C,OAAO,IAAI,CAAA;KACZ;SAAM;QACL,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAA;KAChC;AACH,CAAC;AAED;AACA;AACA;AACA,SAAS,UAAU,CAAE,MAAgB;IACnC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;QACxB,MAAM,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QACpD,MAAM,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAEpD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,GAAG,SAAS,CAAA;QAEzD,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAE5C,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,KAAK,CAAA;QAEzC,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,CAAC,CAAA;QAE5C,OAAO,KAAK,GAAG,KAAK,CAAA;KACrB,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAE,SAAsB;IAChD,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAClE,CAAC;AAED,SAAS,aAAa,CAAE,SAAsB;IAC5C,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AACrF,CAAC;AAED,SAAS,aAAa,CAAE,SAAsB;IAC5C,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACnE,CAAC;;AClQD,MAAM,0BAA0B,GAAG;IACjC,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC;IACxB,EAAE,EAAE,CAAC,IAAI,CAAC;IACV,EAAE,EAAE,CAAC,IAAI,CAAC;IACV,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,KAAK,EAAE,CAAC,OAAO,CAAC;IAChB,EAAE,EAAE,CAAC,OAAO,CAAC;IACb,EAAE,EAAE,CAAC,OAAO,CAAC;CACd,CAAA;AA6BD,SAAS,iBAAiB,CAAE,OAAe,EAAE,KAAgB;IAC3D,MAAM,UAAU,GAAyB,0BAA0B,CAAC,OAAO,CAAC,CAAA;IAC5E,IAAI,UAAU,EAAE;QACd,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QACnC,OAAO,YAAY,IAAI,CAAC,EAAE;YACxB,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,OAAO,CAAA;YACjD,IAAI,aAAa,KAAK,OAAO,EAAE;gBAC7B,MAAK;aACN;YACD,IAAI,UAAU,IAAI,UAAU,CAAC,QAAQ,CAAC,aAAc,CAAC,EAAE;gBACrD,OAAO,IAAI,CAAA;aACZ;YACD,YAAY,EAAE,CAAA;SACf;KACF;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,UAAU,CAAE,GAAW;IAC9B,IAAI,OAAO,CAAC,IAAK,CAAC,aAAa,EAAE;QAC/B,OAAO,GAAG,CAAA;KACX;IAED,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE;QAC5B,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAA;KAChC;SAAM,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE;QAC9B,OAAO,GAAG,CAAA;KACX;SAAM,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;QAC/B,OAAO,MAAM,CAAA;KACd;SAAM,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE;QAChC,OAAO,MAAM,CAAA;KACd;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,UAAU,CAAE,GAAW;IAC9B,MAAM,GAAG,GAAG,GAAG,CAAA;IACf,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;IACpC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAA;IAChD,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AACrB,CAAC;AAED,SAAS,MAAM,CACb,QAAqB,EACrB,QAAsB,EACtB,YAGC,EACD,MAAoB;IAEpB,OAAO,QAAQ;SACZ,MAAM,CAAC,KAAK;;QAEX,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE;YAC5B,OAAO,KAAK,CAAA;SACb;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;YAChC,OAAO,KAAK,CAAC,OAAO,KAAK,EAAE,CAAA;SAC5B;QACD,OAAO,IAAI,CAAA;KACZ,CAAC;SACD,GAAG,CAAC,CAAC,KAAqB;;QAEzB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE;YACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnD,IAAIA,YAAU,CAAC,OAAO,CAAC,IAAK,CAAC,aAAa,CAAC,EAAE;gBAC3C,OAAO,OAAO,CAAC,IAAK,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;aAChD;YACD,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,WAAW,CAAC,IAAI,CAAC,CAAA;YACzB,OAAO,IAAI,CAAA;SACZ;QAED,MAAM,EAAE,GAAsB,QAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;QAC/E,EAAE,CAAC,SAAS,GAAG,KAAK,CAAC,OAAO,CAAA;QAE5B,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,WAAW,CAAC,EAAE,CAAC,CAAA;QAEvB,IAAI,CAAC,OAAO,CAAC,IAAK,CAAC,aAAa,EAAE;YAChC,EAAE,CAAC,SAAS,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAA;SACrC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAChD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;YACrC,IAAI,GAAG,KAAK,OAAO,EAAE;gBACnB,EAAE,CAAC,SAAS,IAAI,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;aACrC;iBAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;gBAC3C,SAAQ;aACT;iBAAM;gBACL,EAAE,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;aAC5D;SACF;QAED,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,GAAG,YAAY,CAAA;QACvD,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;QAEhE,EAAE,CAAC,YAAY,CAAC,OAAO,EAAE,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;;QAGlD,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE;YAC/B,cAAc;YACd,cAAc,EAAE,IAAI;SACrB,EAAE,EAAE,CAAC,CAAA;QAEN,IAAIA,YAAU,CAAC,OAAO,CAAC,IAAK,CAAC,gBAAgB,CAAC,EAAE;YAC9C,OAAO,OAAO,CAAC,IAAK,CAAC,gBAAgB,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;SACjD;QAED,OAAO,EAAE,CAAA;KACV,CAAC,CAAA;AACN,CAAC;AAED,SAAgB,MAAM,CAAE,IAAY,EAAE,QAAsB;IAC1D,MAAM,cAAc,GAAG,IAAI,cAAc,EAAE,CAAA;IAC3C,IAAI,GAAG,cAAc,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;IAEtC,MAAM,IAAI,GAAY,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAA;IAEpF,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAA;IAC3D,KAAK,CAAC,KAAK,CAAC,CAAA;IAEZ,OAAO,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE;QACrC,cAAc;QACd,cAAc,EAAE,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;KAC5D,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,KAAK,CAAE,KAAY;IAC1B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAA;IAC/B,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,CAAA;IAEtB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;IAEzB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAA;IAE5C,OAAO,MAAM,GAAG,GAAG,EAAE;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE;;YAE9B,KAAK,CAAC,IAAI,CAAC,KAAkB,CAAC,CAAA;YAC9B,MAAM,EAAE,CAAA;YACR,SAAQ;SACT;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,CAAA;QACjC,MAAM,EAAE,CAAA;QACR,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAQ,CAAC,WAAW,EAAE,CAAA;QAC/C,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAA;YACxB,IAAI,YAAY,GAAG,KAAK,CAAA;YACxB,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE;gBACnB,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE;oBACpC,YAAY,GAAG,IAAI,CAAA;oBACnB,MAAK;iBACN;aACF;YACD,OAAO,MAAM,GAAG,GAAG,EAAE;gBACnB,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;gBAC/B,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS;oBAAE,MAAK;gBACtC,MAAM,EAAE,CAAA;aACT;YACD,IAAI,YAAY,EAAE;gBAChB,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBACnB,MAAK;aACN;iBAAM;gBACL,SAAQ;aACT;SACF;QAED,MAAM,YAAY,GAAG,OAAO,CAAC,IAAK,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAC/D,IAAI,uBAAuB,GAAG,YAAY,CAAA;QAC1C,IAAI,uBAAuB,EAAE;YAC3B,uBAAuB,GAAG,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;SAC7D;QAED,IAAI,uBAAuB,EAAE;YAC3B,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;YACnC,OAAO,YAAY,GAAG,CAAC,EAAE;gBACvB,IAAI,OAAO,KAAK,KAAK,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE;oBAC3C,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;oBAC1B,MAAM,aAAa,GAAG,YAAY,GAAG,CAAC,CAAA;oBACtC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,QAAQ,CAAA;oBACrC,MAAK;iBACN;gBACD,YAAY,GAAG,YAAY,GAAG,CAAC,CAAA;aAChC;SACF;QAED,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,IAAI,SAAgB,CAAA;QACpB,OAAO,MAAM,GAAG,GAAG,EAAE;YACnB,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;YAC1B,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;gBAAE,MAAK;YACvC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,OAAQ,CAAC,CAAA;YACnC,MAAM,EAAE,CAAA;SACT;QAED,MAAM,EAAE,CAAA;QACR,MAAM,QAAQ,GAAc,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,QAAQ,CAAC,OAAQ;YAC1B,UAAU;YACV,QAAQ;SACT,CAAA;QACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAEnB,MAAM,WAAW,GAAG,EAAE,SAAU,CAAC,KAAK,IAAI,OAAO,CAAC,IAAK,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;QAClF,IAAI,WAAW,EAAE;YACf,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAS,CAAC,CAAA;YACxC,MAAM,UAAU,GAAU,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;YACnD,KAAK,CAAC,UAAU,CAAC,CAAA;YACjB,MAAM,GAAG,UAAU,CAAC,MAAM,CAAA;SAC3B;KACF;IAED,KAAK,CAAC,MAAM,GAAG,MAAM,CAAA;AACvB,CAAC;;AC/QD,OAAO,CAAC,IAAI,GAAG;IACb,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC1C,YAAY,EAAE,IAAI,GAAG,CAAC;QACpB,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS;QAClD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM;QAC/C,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK;KAC1C,CAAC;IACF,eAAe,EAAE,IAAI,GAAG,CAAC;QACvB,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ;QACvD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU;KACxD,CAAC;IACF,aAAa,EAAE,KAAK;CACrB,CAAA;AAED,SAAgB,YAAY,CAAE,OAAiB,EAAE,IAAY,EAAE,MAA0B;IACvF,OAAO,OAAO,CAAC,UAAU,EAAE;QACzB,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;KACxC;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;KACjC;AACH,CAAC;;ACfD;;;;AAIA,SAAgB,sBAAsB,CACpC,QAAmB,EACnB,IAAY,EACZ,MAAc;;IAEd,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QAExB,QAAQ,QAAQ;YACd,KAAK,aAAa;gBAChB,MAAA,IAAI,CAAC,UAAU,0CAAE,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBACtC,MAAK;YACP,KAAK,YAAY;gBACf,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;oBACxB,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;iBACzC;qBAAM;oBACL,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;iBACpB;gBACD,MAAK;YACP,KAAK,WAAW;gBACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;gBACnB,MAAK;YACP,KAAK,UAAU;gBACb,MAAA,IAAI,CAAC,UAAU,0CAAE,WAAW,CAAC,CAAC,CAAC,CAAA;gBAC/B,MAAK;SACR;KACF;AACH,CAAC;AAED,SAAgB,SAAS,CAAE,GAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK;IACzD,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAA;IACzB,IAAI,OAAO,CAAA;IAEX,IAAI,GAAG,CAAC,QAAQ,2BAA4B;QAC1C,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;KAC/C;SAAM,IAAI,GAAG,CAAC,QAAQ,wBAAyB;QAC9C,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;KACtC;IAED,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;QACtB,MAAM,KAAK,GAAQ,IAAI,CAAC,GAAG,CAAC,CAAA;QAC5B,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,KAAK,KAAK,MAAM,EAAE;YAC7D,OAAO,CAAC,GAAG,CAAC,qBAAQ,KAAK,CAAE,CAAA;SAC5B;aAAM,IAAI,GAAG,KAAK,QAAQ,EAAE;YAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;SACrB;aAAM,IAAI,GAAG,KAAK,KAAK,EAAE;YACxB,OAAO,CAAC,KAAK,CAAC,MAAM,qBAAQ,KAAK,CAAC,MAAM,CAAE,CAAA;YAC1C,OAAO,CAAC,KAAK,CAAC,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAA;SACzE;KACF;IAED,IAAI,MAAM,EAAE;QACV,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAA;KACtE;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;;AC7DD,IAAa,YAAY,GAAzB,MAAa,YAAY;IAGvB;IACiD,UAAgC;QAE/E,IAAI,CAAC,MAAM,GAAG,MAAM,UAAU,CAAe,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAA;KACtE;IAEM,IAAI,CAAE,GAAQ;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAE1B,IAAI,iBAAiB,EAAE;YACrB,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YAC1B,IAAI,oBAAoB,EAAE;gBACxB,gBAAgB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;aAC9B;SACF;QACD,IAAI,iBAAiB,EAAE;YACrB,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;SACjD;KACF;CACF,CAAA;AAtBY,YAAY;IADxB,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;;GAJrC,YAAY,CAsBxB;AAED,SAAS,aAAa,CAAE,GAAG,EAAE,MAAM;IACjC,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,WAAW,EAAE;QACtC,YAAY,EAAE,IAAI;QAClB,UAAU,EAAE,IAAI;QAChB,GAAG,CAAE,IAAY;YACf,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;SAC1C;QACD,GAAG;YACD,OAAO,EAAE,CAAA;SACV;KACF,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAE,GAAG,EAAE,MAAM;IACpC,GAAG,CAAC,kBAAkB,GAAG,UAAU,QAAmB,EAAE,IAAY;QAClE,sBAAsB,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;KACzD,CAAA;AACH,CAAC;;SClDe,yBAAyB;IACvC,IAAI,CAAC,OAAO,CAAC,UAAU;QAAE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACrD,OAAO,IAAI,OAAO,CAAC,OAAO;QACxB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,mBAAmB,EAAE,CAAA;QACtD,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,kBAAkB,CAAC,GAAG;YACjD,OAAO,CAAC,GAAG,CAAC,CAAA;SACb,CAAC,CAAC,IAAI,EAAE,CAAA;KACV,CAAC,CAAA;AACJ,CAAC;AAED,SAAgB,kBAAkB,CAAE,GAAQ;IAC1C,IAAI,GAAG,CAAC,QAAQ,KAAK,UAAU,EAAE;QAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAA;QACxE,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAA;QACnC,GAAG,CAAC,UAAU,GAAG,CAAC,OAAO,CAAC,CAAA;QAC1B,OAAO,CAAC,UAAU,GAAG,GAAG,CAAA;QACxB,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK;YAC9B,KAAK,CAAC,UAAU,GAAG,OAAO,CAAA;SAC3B,CAAC,CAAA;QACF,OAAO,OAAO,CAAA;KACf;AACH,CAAC;;AClBD,IAAa,eAAe,GAA5B,MAAa,eAAe;IAC1B,IAAI,CAAE,GAAQ;QACZ,IAAI,gBAAgB,EAAE;YACpB,GAAG,CAAC,qBAAqB,GAAG,gBAAgB,GAAG,IAAW;gBACxD,OAAO,MAAM,yBAAyB,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;aACxD,CAAA;SACF;QACD,IAAI,uBAAuB,EAAE;YAC3B,WAAW,CAAC,GAAG,CAAC,CAAA;SACjB;KACF;CACF,CAAA;AAXY,eAAe;IAD3B,UAAU,EAAE;GACA,eAAe,CAW3B;AAED,SAAS,WAAW,CAAE,GAAQ;IAC5B,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,SAAS,EAAE;QACpC,YAAY,EAAE,IAAI;QAClB,UAAU,EAAE,IAAI;QAChB,GAAG;YACD,OAAO,kBAAkB,CAAC,GAAG,CAAC,CAAA;SAC/B;KACF,CAAC,CAAA;AACJ,CAAC;;ACTD,IAAa,YAAY,GAAzB,MAAa,YAAa,SAAQ,WAAW;IAG3C;IAC2C,QAAsB,EAChB,UAAgC,EAC7C,KAAY,EACF,WAA4B,EAC5B,OAAkC;QAE9E,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;QAC/C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,QAAQ,yBAAyB;QACtC,IAAI,CAAC,QAAQ,GAAG,qBAAqB,CAAA;KACtC;IAEM,aAAa,CAAE,IAAY;QAChC,IAAI,IAAI,KAAK,QAAQ,EAAE;YACrB,OAAO,IAAI,CAAC,WAAW,CAAkB,YAAY,CAAC,WAAW,CAAC,EAAE,CAAA;SACrE;QAED,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACjC,OAAO,IAAI,CAAC,WAAW,CAAc,YAAY,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAA;SACrE;QAED,OAAO,IAAI,CAAC,WAAW,CAAc,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAA;KACjE;;;IAIM,eAAe,CAAE,MAAc,EAAE,IAAY;QAClD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;KAChC;IAEM,cAAc,CAAE,IAAY;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;KAC3B;IAEM,cAAc,CAAyB,EAA6B;QACzE,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC9B,OAAO,WAAW,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,EAAO,CAAA;KACxC;IAEM,aAAa,CAAyB,KAAa;;QAExD,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,cAAc,CAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;SAC9C;QACD,OAAO,IAAI,CAAA;KACZ;IAEM,gBAAgB;;QAErB,OAAO,EAAE,CAAA;KACV;;IAGM,aAAa;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAClC,QAAQ,CAAC,QAAQ,GAAG,OAAO,CAAA;QAC3B,OAAO,QAAQ,CAAA;KAChB;CACF,CAAA;AA9DY,YAAY;IADxB,UAAU,EAAE;IAKR,WAAA,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;IACvC,WAAA,MAAM,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IAC7C,WAAA,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAChC,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;IAC1C,WAAA,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAA;;GARlC,YAAY,CA8DxB;;ACtDD,IAAa,KAAK,GAAlB,MAAa,KAAK;IA8CT,aAAa,CAAE,CAAU;;QAC9B,MAAA,IAAI,CAAC,kBAAkB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;KAC9C;IAKM,eAAe,CAAE,CAAY,EAAE,OAAoB;;QACxD,MAAA,IAAI,CAAC,oBAAoB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;KACzD;IAKM,aAAa,CAAE,IAAyB;;QAC7C,MAAA,IAAI,CAAC,kBAAkB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;KACjD;IAKM,YAAY,CAAE,OAAoB;;QACvC,MAAA,IAAI,CAAC,iBAAiB,0CAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;KACnD;CACF,CAAA;AApEC;IADC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC;;2CACP;AAGjC;IADC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC;;2CACP;AAGjC;IADC,MAAM,CAAC,kBAAkB,CAAC,cAAc,CAAC;;6CACL;AAGrC;IADC,MAAM,CAAC,kBAAkB,CAAC,cAAc,CAAC;;6CACL;AAGrC;IADC,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC;;8CACJ;AAGvC;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,mBAAmB,CAAC;IAAE,QAAQ,EAAE;;kDACX;AAGhD;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,uBAAuB,CAAC;IAAE,QAAQ,EAAE;;sDACP;AAGxD;IADC,MAAM,CAAC,kBAAkB,CAAC,UAAU,CAAC;IAAE,QAAQ,EAAE;;yCACpB;AAG9B;IADC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;IAAE,QAAQ,EAAE;;gDACb;AAG5C;IADC,MAAM,CAAC,kBAAkB,CAAC,oBAAoB,CAAC;IAAE,QAAQ,EAAE;;mDACV;AAGlD;IADC,MAAM,CAAC,kBAAkB,CAAC,mBAAmB,CAAC;IAAE,QAAQ,EAAE;;kDACX;AAGhD;IADC,MAAM,CAAC,kBAAkB,CAAC,UAAU,CAAC;IAAE,QAAQ,EAAE;;yCACpB;AAG9B;IADC,WAAW,CAAC,kBAAkB,CAAC,aAAa,CAAC;IAAE,QAAQ,EAAE;;iDACd;AAO5C;IADC,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC;IAAE,QAAQ,EAAE;;mDACZ;AAOhD;IADC,WAAW,CAAC,kBAAkB,CAAC,aAAa,CAAC;IAAE,QAAQ,EAAE;;iDACf;AAO3C;IADC,WAAW,CAAC,kBAAkB,CAAC,YAAY,CAAC;IAAE,QAAQ,EAAE;;gDAChB;AAjE9B,KAAK;IADjB,UAAU,EAAE;GACA,KAAK,CAsEjB;;ACnGD;;;;AAIA,AAAO,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IACnC,YAAY;IACZ,WAAW;IACX,aAAa;IACb,UAAU;IACV,kBAAkB;IAClB,KAAK;IACL,WAAW;IACX,SAAS;IACT,eAAe;IACf,gBAAgB;IAChB,oBAAoB;IACpB,cAAc;CACf,CAAC,CAAA;;ACXF,MAAM,YAAY,GAAiB,UAAU,QAAQ,EAAE,SAAS;IAC9D,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAA;AAC5B,CAAC,CAAA;AAED,MAAM,YAAY,GAAiB,UAAU,WAAW;IACtD,OAAO,IAAI,WAAW,GAAG,CAAA;AAC3B,CAAC,CAAA;AAED,MAAM,cAAc,GAAmB,UAAU,MAAM;IACrD,OAAO,IAAI,MAAM,EAAE,CAAA;AACrB,CAAC,CAAA;AAED,MAAM,cAAc,GAAG,UAAU,SAAS;IACxC,OAAO,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;AACrC,CAAC,CAAA;AAED,MAAM,eAAe,GAAG;IACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;AAClC,CAAC,CAAA;AAED,AAAO,MAAM,qBAAqB,GAAG,IAAI,eAAe,CAAC,IAAI;IAC3D,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;IAC5E,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;IAC5E,IAAI,CAAiB,kBAAkB,CAAC,cAAc,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;IAClF,IAAI,CAAiB,kBAAkB,CAAC,cAAc,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;IAClF,IAAI,CAAkB,kBAAkB,CAAC,eAAe,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAA;AACvF,CAAC,CAAC,CAAA;;SC3BsB,kBAAkB,CAAE,SAAoB;IAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;IAC3C,IAAI,CAAC,OAAO,CAAC,GAAG;QACd,IAAI,GAAG,IAAI,kBAAkB,EAAE;;YAE7B,MAAM,UAAU,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;YAC1C,MAAM,EAAE,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAA;YAEjC,IAAIX,SAAO,CAAC,EAAE,CAAC,EAAE;;gBAEf,EAAE,CAAC,OAAO,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;aAChE;iBAAM;gBACL,IAAI,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;;oBAEjC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;iBAC5C;qBAAM;oBACL,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;iBAC1C;aACF;SACF;KACF,CAAC,CAAA;AACJ,CAAC;;ACZD,MAAM,SAAS,GAAG,IAAI,SAAS,EAAE,CAAA;AAEjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;IACjC,SAAS,CAAC,IAAI,CAAc,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;IACjH,SAAS,CAAC,IAAI,CAAe,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,gBAAgB,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;IACvI,SAAS,CAAC,IAAI,CAAkB,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;IAC7H,SAAS,CAAC,IAAI,CAAc,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,WAAW,CAAC,CAAA;IACrH,SAAS,CAAC,IAAI,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAC,SAAS,CAAc,CAAC,OAA2B;QAC7H,OAAO,CAAC,KAAmB,KAAK,CAAC,QAAiB;YAChD,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAc,kBAAkB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;YACzF,IAAI,QAAQ,EAAE;gBACZ,EAAE,CAAC,QAAQ,GAAG,QAAQ,CAAA;aACvB;YACD,EAAE,CAAC,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAA;YACtC,OAAO,EAAE,CAAA;SACV,CAAA;KACF,CAAC,CAAA;IAEF,SAAS,CAAC,IAAI,CAAW,kBAAkB,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAA;IAClE,SAAS,CAAC,IAAI,CAA4B,kBAAkB,CAAC,eAAe,CAAC,CAAC,SAAS,CAAW,CAAC,OAA2B;QAC5H,OAAO,CAAC,IAAY;YAClB,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAW,kBAAkB,CAAC,QAAQ,CAAC,CAAA;YAC7E,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAA;YACtB,OAAO,QAAQ,CAAA;SAChB,CAAA;KACF,CAAC,CAAA;IAEF,SAAS,CAAC,IAAI,CAAe,kBAAkB,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,gBAAgB,EAAE,CAAA;IACjG,SAAS,CAAC,IAAI,CAAkB,kBAAkB,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,gBAAgB,EAAE,CAAA;CAC3G;AAED,SAAS,CAAC,IAAI,CAAQ,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,gBAAgB,EAAE,CAAA;AAC5E,SAAS,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;AACrC,kBAAkB,CAAC,SAAS,CAAC,CAAA;;AC5B7B,IAAI,KAAK,CAAA;AACT,IAAI,UAAU,CAAA;AACd,IAAIY,UAAQ,CAAA;AACZ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;IACjC,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;IACvD,UAAU,GAAG,SAAS,CAAC,GAAG,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IACvFA,UAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,QAAQ,CAAC,EAA0B,CAAA;CACvE;AAED;AACA,MAAa,SAAS;IAmBpB,YAAoB,IAAY,EAAE,IAAkB,EAAE,KAAe;QAZ9D,UAAK,GAAG,KAAK,CAAA;QAEb,SAAI,GAAG,KAAK,CAAA;QAEZ,qBAAgB,GAAG,KAAK,CAAA;;;QAIxB,cAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAK3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAC9B,IAAI,CAAC,OAAO,GAAG,KAAK,CAAA;QACpB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAA;QAC5C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAA;KACnD;IAEM,eAAe;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;KAClB;IAEM,wBAAwB;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;KAC9B;IAEM,cAAc;QACnB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAA;KAC7B;IAED,IAAI,MAAM;;QACR,MAAM,OAAO,GAAGA,UAAQ,CAAC,cAAc,CAAC,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,CAAC,EAAE,CAAC,CAAA;QAChE,qDACK,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,GACpB,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,KACvB,OAAO,EAAE,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,IACxD;KACF;IAED,IAAI,aAAa;;QACf,MAAM,OAAO,GAAGA,UAAQ,CAAC,cAAc,CAAC,MAAA,IAAI,CAAC,OAAO,0CAAE,aAAa,CAAC,EAAE,CAAC,CAAA;QAEvE,IAAI,OAAO,KAAK,IAAI,EAAE;YACpB,OAAO,IAAI,CAAC,MAAM,CAAA;SACnB;QAED,qDACK,MAAA,IAAI,CAAC,OAAO,0CAAE,aAAa,GAC3B,MAAA,IAAI,CAAC,OAAO,0CAAE,MAAM,KACvB,OAAO,EAAE,OAAO,CAAC,OAAO,IACzB;KACF;CACF;AAED,SAAgB,WAAW,CAAE,KAAuB,EAAE,IAAkB;IACtE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;;QAE7B,OAAO,IAAI,SAAS,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;KACjE;IAED,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,KAAK,CAAC,CAAA;IAEnF,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;QACvB,IAAI,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,UAAU,EAAE;YAClF,SAAQ;SACT;aAAM;YACL,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;SACxB;KACF;IAED,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,QAAQ,MAAK,KAAK,EAAE;;QAEtD,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAA;KACrB;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,WAAW,GAAG,EAAE,CAAA;AAEtB;AACA,SAAgB,YAAY,CAAE,KAAc;;IAC1C,MAAA,KAAK,CAAC,aAAa,+CAAnB,KAAK,EAAiB,KAAK,CAAC,CAAA;IAE5B,IAAI,KAAK,CAAC,aAAa,IAAI,IAAI,EAAE;QAC/B,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAA;KACnC;IAED,MAAM,IAAI,GAAGA,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;IAC5D,IAAI,IAAI,EAAE;QACR,MAAM,QAAQ,GAAG;;YACf,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YAClC,MAAA,KAAK,CAAC,eAAe,+CAArB,KAAK,EAAmB,CAAC,EAAE,IAAI,CAAC,CAAA;YAChC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;SACtB,CAAA;QACD,IAAI,OAAO,KAAK,CAAC,mBAAmB,KAAK,UAAU,EAAE;YACnD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;YAEvB,IACE,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC;gBAC3B,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC;iBAC1B,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAC9C;;gBAEA,KAAK,CAAC,mBAAmB,CAAC;oBACxB,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE;wBACrB,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;wBACrC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;qBACzB;oBACD,QAAQ,EAAE,CAAA;iBACX,CAAC,CAAA;aACH;iBAAM;;gBAEL,CAAC,WAAW,CAAC,IAAI,MAAhB,WAAW,CAAC,IAAI,IAAM,EAAE,GAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;aAC1C;SACF;aAAM;YACL,QAAQ,EAAE,CAAA;SACX;KACF;AACH,CAAC;;AC1JM,MAAM,SAAS,GAAG,OAAO,QAAQ,KAAK,WAAW,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAA;AAC9E,AAAO,MAAM,GAAG,GAAa,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAA;AAC7D,AAAO,MAAM,GAAG,GAAW,SAAS,GAAG,MAAM,GAAG,SAAS,CAAA;;SCWzC,cAAc;;;;;;;;;;;;;IAa5B,MAAM,UAAU,GAAGC,SAAa,CAAC,GAAG,CAAuB,kBAAkB,CAAC,kBAAkB,CAAC,CAAA;IACjG,MAAM,GAAG,GAAG,UAAU,CAAC,YAAY,CAAC,QAAQ,CAAC,EAA0B,CAAA;IACvE,MAAM,qBAAqB,GAAG,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACzD,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,GAAG,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAA;IACtC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAA;IACZ,MAAMC,WAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAA;IAElD,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACrB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,CAAC,WAAW,CAACA,WAAS,CAAC,CAAA;IAC3BA,WAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IAE1B,GAAG,CAAC,eAAe,GAAG,IAAI,CAAA;IAC1B,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,GAAG,CAAC,WAAW,GAAG,WAAW,CAAA;IAE7B,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,MAAaF,UAAQ,IAAI,SAAS,GAAG,GAAG,GAAG,cAAc,EAAE,CAAyB;;AClDpF,MAAM,OAAO,GAAG,WAAW,CAAA;AAC3B,MAAM,IAAI,GAAG,wBAAwB,CAAA;AACrC,MAAM,MAAM,GAAG,yFAAyF,CAAA;AAExG,MAAa,SAAS,GAAG,SAAS,GAAG,GAAG,CAAC,SAAS,GAAG;IACnD,WAAW,EAAE,SAAS;IACtB,OAAO,EAAE,UAAU;IACnB,UAAU,EAAE,OAAO,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM;IAC3D,aAAa,EAAE,IAAI;IACnB,SAAS,EAAE,EAAE;IACb,MAAM,EAAE,IAAI;IACZ,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,MAAM;IACf,UAAU,EAAE,UAAU;IACtB,SAAS,EAAE,eAAe,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM;IAClE,MAAM,EAAE,QAAQ;IAChB,SAAS,EAAE,EAAE;CACd;;ACpBD;AACA,IAAW,GAAG,CAAA;AAEd,CAAC;IACC,IAAI,QAAQ,CAAA;IACZ,IAAI,CAAC,OAAO,WAAW,KAAK,WAAW,IAAI,WAAW,KAAK,IAAI,KAAK,WAAW,CAAC,GAAG,EAAE;QACnF,GAAG,GAAG;YACJ,OAAO,WAAW,CAAC,GAAG,EAAE,CAAA;SACzB,CAAA;KACF;SAAM,IAAI,IAAI,CAAC,GAAG,EAAE;QACnB,GAAG,GAAG;YACJ,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAA;SAC7B,CAAA;QACD,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;KACtB;SAAM;QACL,GAAG,GAAG;YACJ,OAAO,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,QAAQ,CAAA;SACvC,CAAA;QACD,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAA;KAChC;AACH,CAAC,GAAG,CAAA;AAEJ,IAAI,QAAQ,GAAG,CAAC,CAAA;AAEhB;AACA;AACA,IAAI,GAAG,GAAG,OAAO,qBAAqB,KAAK,WAAW,IAAI,qBAAqB,KAAK,IAAI,GAAG,qBAAqB,GAAG,UAAU,QAAQ;IACnI,MAAM,IAAI,GAAG,GAAG,EAAE,CAAA;IAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,EAAE,IAAI,CAAC,CAAA;IAC9C,OAAO,UAAU,CAAC,cAAc,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAA,EAAE,EAAE,QAAQ,GAAG,IAAI,CAAC,CAAA;AACnF,CAAC,CAAA;AAED,IAAI,GAAG,GAAG,OAAO,oBAAoB,KAAK,WAAW,IAAI,oBAAoB,KAAK,IAAI,GAAG,oBAAoB,GAAG,YAAY,CAAA;AAE5H,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IACjC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACtB,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;CACvB;;SClCe,gBAAgB,CAAE,OAAoB;IACpD,OAAO,OAAO,CAAC,KAAK,CAAA;AACtB,CAAC;;MCEYG,QAAM,GAAG,SAAS,GAAG,GAAG,GAAG;IACtC,SAAS;cACTH,UAAQ;CACT,CAAA;AAED,IAAI,CAAC,SAAS,EAAE;IACd,MAAM,gBAAgB,GAAG;QACvB,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,IAAI,GAAG,CAAC;QAC5C,GAAG,MAAM,CAAC,qBAAqB,CAAC,MAAM,IAAI,GAAG,CAAC;KAC/C,CAAA;IAED,gBAAgB,CAAC,OAAO,CAAC,QAAQ;QAC/B,IAAI,QAAQ,KAAK,MAAM;YAAE,OAAM;QAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAACG,QAAM,EAAE,QAAQ,CAAC,EAAE;YAC3DA,QAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAA;SACpC;KACF,CAAC,CAED;IAACH,UAAgB,CAAC,WAAW,GAAGG,QAAM,CAAA;CACxC;AAED,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;IACxDA,QAAc,CAAC,qBAAqB,GAAG,GAAG,CAAC;IAC3CA,QAAc,CAAC,oBAAoB,GAAG,GAAG,CAAC;IAC1CA,QAAc,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IACnDA,QAAc,CAAC,gBAAgB,GAAG,eAAc,CAAC;IACjDA,QAAc,CAAC,mBAAmB,GAAG,eAAc,CAAA;IACpD,IAAI,EAAE,IAAI,IAAIA,QAAM,CAAC,EAAE;QACpBA,QAAc,CAAC,IAAI,GAAG,IAAI,CAAA;KAC5B;IACD,IAAI,EAAE,WAAW,IAAIA,QAAM,CAAC,EAAE;QAC3BA,QAAc,CAAC,UAAU,GAAG,UAAU,CAAA;KACxC;CACF;;MCvBY,OAAO,GAAY;IAC9B,GAAG,EAAE,IAAI;IACT,MAAM,EAAE,IAAI;IACZ,IAAI,EAAE,IAAI;CACX,CAAA;AAED,MAAa,kBAAkB,GAAG,MAAM,OAAO;;MCPlC,MAAM;IAIjB,YAAa,IAAK;QAChB,IAAI,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,CAAC,SAAS,EAAE;YACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;SAChC;aAAM;YACL,IAAI,CAAC,SAAS,GAAG,EAAE,CAAA;SACpB;KACF;IAQD,EAAE,CAAE,SAAS,EAAE,QAAQ,EAAE,OAAO;QAC9B,IAAI,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAA;QAC3B,IAAI,CAAC,QAAQ,EAAE;YACb,OAAO,IAAI,CAAA;SACZ;QACD,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,CAAC,SAAS,KAAd,IAAI,CAAC,SAAS,GAAK,EAAE,EAAA;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAA;QAC5B,QAAQ,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG;YAClC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAA;YACrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;YACtB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YACxB,KAAK,CAAC,KAAK,CAAC,GAAG;gBACb,IAAI;gBACJ,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI;aAC9B,CAAA;SACF;QACD,OAAO,IAAI,CAAA;KACZ;IAED,IAAI,CAAE,MAAM,EAAE,QAAQ,EAAE,OAAO;QAC7B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI;YACtB,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YAC1B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;SACnC,CAAA;QAED,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;QAEjC,OAAO,IAAI,CAAA;KACZ;IAED,GAAG,CAAE,MAAM,EAAE,QAAQ,EAAE,OAAO;QAC5B,IAAI,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,CAAA;QACrC,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAA;SACZ;QACD,IAAI,EAAE,MAAM,IAAI,QAAQ,IAAI,OAAO,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC,SAAS,CAAA;YACrB,OAAO,IAAI,CAAA;SACZ;QACD,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzE,QAAQ,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG;YAC/B,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAA;YACnB,IAAI,CAAC,IAAI,IAAI,EAAE,QAAQ,IAAI,OAAO,CAAC,EAAE;gBACnC,SAAQ;aACT;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,MAAM,IAAI,EAAE;gBAClC,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAA;gBAClB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAA;gBAClB,IAAI,CAAC,QAAQ,IAAI,EAAE,KAAK,QAAQ,MAAM,OAAO,IAAI,GAAG,KAAK,OAAO,CAAC,EAAE;oBACjE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;iBACxB;aACF;SACF;QACD,OAAO,IAAI,CAAA;KACZ;IAWD,OAAO,CAAE,MAAM;QACb,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAA;QAC5B,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAA;SACZ;QACD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QACxC,QAAQ,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG;YAC/B,KAAK,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG;gBACzB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,MAAM,IAAI,EAAE;oBAClC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,CAAA;iBAChD;aACF;SACF;QACD,OAAO,IAAI,CAAA;KACZ;;AAtGM,oBAAa,GAAG,KAAK,CAAA;AA2G9B,MAAMC,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;AAC7D,MAAM,WAAW,GAAGA,OAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;AAChD,SAAS,CAAC,IAAI,CAAS,kBAAkB,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,WAAW,CAAC,CAAA;;AC/HnF;AACA,AAkBA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;AAC7C,MAAM,MAAM,GAAG,WAAW,EAAE,CAAA;AAC5B,MAAMA,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;AAE7D,SAAgB,kBAAkB,CAAE,IAAyB,EAAE,EAAU;;IACvE,MAAAA,OAAK,CAAC,iBAAiB,+CAAvBA,OAAK,EAAqB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;IAClD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;AACzB,CAAC;AAED,SAAgB,eAAe,CAAE,EAAU;IACzC,OAAO,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;AAC1B,CAAC;AAED,SAAgB,eAAe,CAAE,IAAa;IAC5C,IAAI,IAAI,IAAI,IAAI,EAAE;QAChB,OAAO,EAAE,CAAA;KACV;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;AACnD,CAAC;AAED,SAAgB,WAAW,CAAE,IAAY,EAAE,SAA6B,EAAE,GAAG,IAAe;IAC1F,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAEpC,IAAI,QAAQ,IAAI,IAAI,EAAE;QACpB,OAAM;KACP;IAED,MAAM,IAAI,GAAGA,OAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;IAEpD,IAAIhB,SAAO,CAAC,IAAI,CAAC,EAAE;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;QACpD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAA;KACd;IAED,IAAI,CAACW,YAAU,CAAC,IAAI,CAAC,EAAE;QACrB,OAAM;KACP;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AACnC,CAAC;AAED,SAAgB,SAAS,CAAE,GAA6B;IACtD,IAAI,GAAG,IAAI,IAAI,EAAE;QACf,OAAO,EAAE,CAAA;KACV;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG;QACpC,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;KAC5B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACZ,OAAO,IAAI,KAAK,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;AACxC,CAAC;AAED,SAAgB,OAAO,CAAE,EAAU,EAAE,OAAiC;IACpE,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,IAAI,CAAC,SAAS,EAAE;QACd,IAAI,GAAG,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;KAC/B;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAgB,kBAAkB,CAAE,IAAY;IAC9C,OAAO,IAAI,GAAG,GAAG,GAAG,SAAS,CAAA;AAC/B,CAAC;AAED,SAAgB,iBAAiB,CAAE,IAAY;IAC7C,OAAO,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAA;AAC9B,CAAC;AAED,SAAgB,iBAAiB,CAAE,IAAY;IAC7C,OAAO,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAA;AAC9B,CAAC;AAED,SAAgB,gBAAgB,CAAE,SAAc,EAAE,QAAiB,EAAE,IAA8B,EAAE,UAAuB;;IAC1H,MAAM,EAAE,GAAG,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,aAAa,MAAM,EAAE,EAAE,CAAA;;IAE9C,IAAI,WAAW,GAA2B,IAAI,CAAA;IAE9C,IAAI,UAAU,GAAG,KAAK,CAAA;IACtB,IAAI,gBAAgB,GAAmB,EAAE,CAAA;IAEzC,MAAM,MAAM,GAAiB;QAC3B,MAAM,CAAoB,OAAO,EAAE,EAAS;YAC1C,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;YAErB,OAAO,CAAC,IAAI,GAAG,IAAW,CAAA;YAC1B,IAAI,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAA;YAC9B,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;;YAGnC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;;YAErC,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;gBAC5B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;aAC9C;YAED,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAA;YACxE,OAAO,CAAC,MAAM,GAAG;gBACf,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC;gBAC7B,OAAO,EAAE,kBAAkB,CAAC,EAAE,CAAC;gBAC/B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;gBAC7B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;aAC9B,CAAA;YAED,MAAM,KAAK,GAAG;gBACZ,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE;oBAC7C,WAAW,GAAGC,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,SAAS,CAAC,CAAA;oBAEtE,MAAM,CAAC,WAAW,KAAK,IAAI,EAAE,WAAW,CAAC,CAAA;oBACzC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;oBACvD,IAAI,CAAC,SAAS,EAAE;wBACd,WAAW,CAAC,GAAG,GAAG,IAAI,CAAA;wBACtB,WAAW,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;qBACpC;yBAAM;wBACLD,YAAU,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAA;qBACvB;iBACF,CAAC,CAAA;aACH,CAAA;YACD,IAAI,UAAU,EAAE;gBACd,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;aAC7B;iBAAM;gBACL,KAAK,EAAE,CAAA;aACR;SACF;QACD,OAAO;YACL,GAAG,CAAC;gBACF,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAA;aAC5C,CAAC,CAAA;YAEF,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;YACtC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAA;SAC3B;QACD,QAAQ;YACN,UAAU,GAAG,IAAI,CAAA;YACjB,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,SAAS,EAAE;gBACpC,UAAU,GAAG,KAAK,CAAA;gBAClB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAChC,IAAI,WAAW,EAAE;oBACf,WAAW,CAAC,GAAG,GAAG,IAAI,CAAA;iBACvB;gBACD,IAAI,gBAAgB,CAAC,MAAM,EAAE;oBAC3B,gBAAgB,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;oBACpC,gBAAgB,GAAG,EAAE,CAAA;iBACtB;aACF,CAAC,CAAA;SACH;QACD,MAAM;YACJ,OAAO,CAAC,IAAI,GAAG,IAAW,CAAA;YAC1B,IAAI,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAA;YACxE,OAAO,CAAC,MAAM,GAAG;gBACf,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC;gBAC7B,OAAO,EAAE,kBAAkB,CAAC,EAAE,CAAC;gBAC/B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;gBAC7B,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC;aAC9B,CAAA;YAED,GAAG,CAAC;gBACF,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAA;aAC3C,CAAC,CAAA;YAEF,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;SACtC;QACD,MAAM;YACJ,OAAO,CAAC,IAAI,GAAG,IAAI,CAAA;YACnB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAA;YACrB,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;YACrC,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAA;SAC3C;QACD,iBAAiB;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAA;SACxD;QACD,aAAa;YACX,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,eAAe,CAAC,CAAA;SACpD;QACD,YAAY,CAAE,OAAO;YACnB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;SAC5D;QACD,QAAQ,CAAE,OAAO;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,CAAA;SACxD;QACD,YAAY,CAAE,OAAO;YACnB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;SAC5D;QACD,YAAY;YACV,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAA;SACnD;QACD,iBAAiB;YACf,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAA;SACxD;QACD,cAAc;YACZ,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAA;SACrD;QACD,eAAe;YACb,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAA;SACtD;QACD,gBAAgB;YACd,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAA;SACvD;KACF,CAAA;;IAGD,IAAI,SAAS,CAAC,iBAAiB;SAC3B,MAAA,SAAS,CAAC,SAAS,0CAAE,iBAAiB,CAAA;QACtC,SAAS,CAAC,qBAAqB,EAAE;QACnC,MAAM,CAAC,iBAAiB,GAAG,UAAU,OAAO;YAC1C,MAAM,MAAM,GAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAA;YAC9B,IAAI,MAAM,IAAI,IAAI,EAAE;gBAClB,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAA;gBACpB,MAAM,OAAO,GAAGC,UAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;gBAC3C,IAAI,OAAO,IAAI,IAAI,EAAE;oBACnB,OAAO,CAAC,MAAO,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAA;iBAC1C;aACF;YACD,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAA;SACjE,CAAA;KACF;IACD,IAAI,SAAS,CAAC,eAAe;SACzB,MAAA,SAAS,CAAC,SAAS,0CAAE,eAAe,CAAA;QACpC,SAAS,CAAC,mBAAmB,EAAE;QACjC,MAAM,CAAC,eAAe,GAAG;YACvB,OAAO,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAA;SACtD,CAAA;KACF;IAED,MAAM,CAAC,EAAE,GAAG,YAAY,CAAA;IAExB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;QACtB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;KACnB;IAED,IAAI,SAAS,EAAE;QACb,MAAM,CAAC,IAAI,GAAG,EAAE,CAAA;KACjB;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAgB,qBAAqB,CAAE,SAA+B,EAAE,aAAsB,EAAE,IAA8B;;IAC5H,MAAM,EAAE,GAAG,aAAa,aAAb,aAAa,cAAb,aAAa,GAAI,kBAAkB,MAAM,EAAE,EAAE,CAAA;IACxD,IAAI,gBAAgB,GAA2B,IAAI,CAAA;IAEnD,MAAM,MAAM,GAAQ;QAClB,QAAQ;;YACN,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAA,MAAA,IAAI,CAAC,SAAS,+CAAd,IAAI,CAAc,KAAI,MAAM,EAAE,EAAE,CAAC,CAAA;YAChE,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,EAAE;gBACnC,gBAAgB,GAAGA,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,CAAA;gBACjE,MAAM,CAAC,gBAAgB,KAAK,IAAI,EAAE,WAAW,CAAC,CAAA;gBAC9C,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;gBAC3B,IAAI,CAAC,SAAS,EAAE;oBACd,gBAAgB,CAAC,GAAG,GAAG,IAAI,CAAA;oBAC3B,gBAAgB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;iBACrC;aACF,CAAC,CAAA;SACH;QACD,QAAQ;YACN,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;YAClD,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,EAAE;gBAC1B,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACtB,IAAI,gBAAgB,EAAE;oBACpB,gBAAgB,CAAC,GAAG,GAAG,IAAI,CAAA;iBAC5B;aACF,CAAC,CAAA;SACH;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;IACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;QACtB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;KACnB;IAED,MAAM,CAAC,SAAS,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,SAAS,CAAC,mCAAI,SAAS,CAAA;IACvD,MAAM,CAAC,iBAAiB,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,iBAAiB,CAAC,mCAAI,SAAS,CAAA;IACvE,MAAM,CAAC,WAAW,CAAC,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,WAAW,CAAC,mCAAI,SAAS,CAAA;IAC3D,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAgB,8BAA8B,CAAE,aAAsB;IACpE,OAAO;QACL,UAAU,EAAE;YACV,CAAC,EAAE;gBACD,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE;oBACL,uBAAsB,MAAM;iBAC7B;aACF;YACD,CAAC,EAAE;gBACD,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE,EAAE;aACV;SACF;QACD,OAAO,EAAE;YACP,cAAc,EAAE,IAAI;YACpB,WAAW,EAAE,aAAa,KAAK,gBAAgB;SAChD;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;AACH,CAAC;;AC9SD,MAAMI,OAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;AAE7D,SAAS,gBAAgB,CAAE,CAAe,EAAE,SAAS;;IACnD,OAAOL,YAAU,CAAC,SAAS,CAAC,MAAM,CAAC;QACnC,CAAC,EAAC,MAAA,SAAS,CAAC,SAAS,0CAAE,gBAAgB,CAAA;QACvC,SAAS,CAAC,SAAS,YAAY,CAAC,CAAC,SAAS,CAAA;AAC5C,CAAC;AAED;AACA,AAAO,IAAI,CAAC,GAAiB,SAAS,CAAA;AACtC,AAAO,IAAI,WAAW,GAA0B,SAAS,CAAA;AAEzD,SAAgB,gBAAgB,CAC9B,CAAe,EACf,EAAU;IAEV,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,CAAA;IACzB,OAAO,CAAC,SAA6B;;QAEnC,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QAEvD,MAAM,MAAM,GAAG,CAAC,IAAe,KAAK,IAAI,IAAI,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QACxE,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG;YAChD,YAAY,EAAE,MAAM;;YAEpB,sBAAsB,EAAE,MAAM;SAC/B,CAAA;QAED,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,WAAW,GAAG,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;SAClC;QAED,OAAO,MAAM,IAAK,SAAQ,CAAC,CAAC,SAA2C;YAAhE;;gBACL,UAAK,GAAG;oBACN,QAAQ,EAAE,KAAK;iBAChB,CAAA;aAoCF;YAlCC,OAAO,wBAAwB,CAAE,KAAY;gBAC3C,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC5D,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;aAC1B;;;YAID,iBAAiB,CAAE,KAAY,EAAE,IAAqB;gBACpD,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC5D,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;aAC5E;YAED,MAAM;gBACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ;sBAChC,EAAE;sBACF,CAAC,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,kCAC/C,IAAI,CAAC,KAAK,GACV,IAAI,EACP,CAAC,CAAA;gBAEL,IAAI,SAAS,EAAE;oBACb,OAAO,CAAC,CACN,KAAK,EACL,EAAE,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,EAC9B,QAAQ,CACT,CAAA;iBACF;gBAED,OAAO,CAAC,CACN,MAAM,EACN,EAAE,EAAE,EAAE,EACN,QAAQ,CACT,CAAA;aACF;SACF,CAAA;KACF,CAAA;AACH,CAAC;AAED,IAAI,QAAQ,CAAA;AAIZ,SAAS,aAAa;IACpB,MAAM,YAAY,GAAG,UAAU,QAAQ,EAAE,SAAS;QAChD,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAA;QAClE,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAA;KAC3B,CAAA;IAED,MAAM,aAAa,GAAG,UAAU,KAAK;QACnC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;KAC1C,CAAA;IAED,MAAM,mBAAmB,GAAG,UAAU,EAAE;QACtC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAA;KACrC,CAAA;IAED,MAAM,iBAAiB,GAAG,UAAU,IAAI,EAAE,IAAI;QAC5C,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,OAAM;;;QAK1B,IAAI,aAAa,IAAI,IAAI;YAAE,OAAM;QAEjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI;YAC5B,IAAIA,YAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;aACzC;iBAAM;gBACL,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;aACpD;SACF,CAAC,CAAA;KACH,CAAA;IAEDK,OAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IACjCA,OAAK,CAAC,aAAa,GAAG,aAAa,CAAA;IACnCA,OAAK,CAAC,mBAAmB,GAAG,mBAAmB,CAAA;IAC/CA,OAAK,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;IAE3C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjCA,OAAK,CAAC,uBAAuB,GAAG,CAC9B,EAAwE,EACxE,CAAC,EACD,CAAe,EACf,aAAa;YAEb,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;YAEhD,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG;gBAC7B,MAAM,QAAQ,qBAA0B,KAAK,CAAE,CAAA;gBAC/C,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;oBAC7C,YAAY,EAAE,GAAG;;oBAEjB,sBAAsB,EAAE,GAAG;iBAC5B,CAAA;gBAED,OAAO,CAAC,CAAC,aAAa,CACpB,aAAa,IAAI,sBAAsB,EACvC,IAAI,EACJ,CAAC,CAAC,aAAa,CAAC,EAAE,kCACb,QAAQ,GACR,IAAI,EACP,CACH,CAAA;aACF,CAAC,CAAA;SACH,CAAA;QAEDA,OAAK,CAAC,UAAU,GAAG,CAAC,IAAI;YACtB,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;SAClC,CAAA;KACF;AACH,CAAC;AAED,MAAM,SAAS,GAAG,WAAW,EAAE,CAAA;AAE/B,SAAgB,cAAc,CAAE,GAAyB,EAAE,KAAmB,EAAE,QAAQ,EAAE,MAAiB;IACzG,CAAC,GAAG,KAAK,CAAA;IACT,QAAQ,GAAG,QAAQ,CAAA;IACnB,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,kEAAkE,CAAC,CAAA;IAEtF,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,EAAoB,CAAA;IAC3C,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAEjD,aAAa,EAAE,CAAA;IACf,MAAM,UAAW,SAAQ,CAAC,CAAC,SAAS;QAApC;;;YAEU,UAAK,GAA+B,EAAE,CAAA;YACtC,aAAQ,GAAyB,EAAE,CAAA;SAuC5C;QArCQ,KAAK,CAAE,SAA0C,EAAE,EAAU,EAAE,EAAc;YAClF,MAAM,GAAG,GAAG,EAAE,GAAG,SAAS,EAAE,CAAA;YAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,aAAa,CAAC,SAAS,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;YAC/D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrB,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACrB;QAEM,OAAO,CAAE,EAAU,EAAE,EAAc;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;gBAChC,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,EAAE,EAAE;oBAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;oBAC1B,MAAK;iBACN;aACF;YAED,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACrB;QAEM,MAAM;YACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAA;gBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;aAC3B;YAED,IAAI,KAAK,GAA4B,IAAI,CAAA;YAEzC,IAAI,gBAAgB,EAAE;gBACpB,KAAK,GAAG,EAAE,GAAG,EAAE,CAAA;aAChB;YAED,OAAO,CAAC,CAAC,aAAa,CACpB,GAAG,EACH,KAAK,EACL,SAAS,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CACxF,CAAA;SACF;KACF;IAED,IAAI,OAAmB,CAAA;IACvB,IAAI,CAAC,SAAS,EAAE;;QAEd,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,EAAEJ,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAA;KACvF;IAED,MAAM,GAAG,GAAgB,MAAM,CAAC,MAAM,CAAC;QACrC,MAAM,CAAE,EAAc;YACpB,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;SACxB;QAED,KAAK,CAAE,SAA6B,EAAE,EAAU,EAAE,EAAc;YAC9D,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC/C,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;SAC5B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;SACxB;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;;;oBAGb,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,EAAEA,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAA;iBACvF;gBACD,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;;;gBAIvB,IAAI,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,cAAc,EAAE;oBACvB,MAAM,UAAU,GAAG,GAAG,CAAC,cAAc,CAAA;oBACrC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACpC,MAAM,WAAW,GAAG,MAAM,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAA;oBAChE,IAAI,CAAC,OAAO,CAAC,GAAG;wBACd,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE;4BAC/B,YAAY,EAAE,IAAI;4BAClB,UAAU,EAAE,IAAI;4BAChB,GAAG;gCACD,OAAO,UAAU,CAAC,GAAG,CAAC,CAAA;6BACvB;4BACD,GAAG,CAAE,KAAK;gCACR,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;6BACxB;yBACF,CAAC,CAAA;qBACH,CAAC,CAAA;oBACF,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;iBAC3C;gBACD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;gBAEf,IAAI,GAAG,IAAI,IAAI,IAAID,YAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3C,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;iBACtB;aACF;SACF;QAED,MAAM,EAAE;YACN,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAO;gBACZ,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE;oBACnD,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;iBAC9B;;gBAGD,cAAc,CAAC,QAAQ,CAAC,CAAA;aACzB;SACF;QAED,MAAM,EAAE;YACN,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,OAAgB;gBACrB,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE;oBACnD,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;iBAC9B;;gBAGD,cAAc,CAAC,QAAQ,CAAC,CAAA;aACzB;SACF;QAED,cAAc,EAAE;YACd,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,CAAE,GAAY;gBACjB,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;gBACvB,IAAI,GAAG,IAAI,IAAI,IAAIA,YAAU,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE;oBACjD,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAA;iBACxB;aACF;SACF;KACF,CAAC,CAAA;IAEF,SAAS,cAAc,CAAE,SAAS;QAChC,MAAM,QAAQ,GAAG,eAAe,CAAC,YAAY,CAAC,CAAA;QAC9C,IAAI,QAAQ,EAAE;YACZ,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAA;YACvB,MAAM,IAAI,GAAGK,OAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;YACpD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;aAClC;SACF;KACF;IAED,OAAO,CAAC,GAAG,GAAG,GAAG,CAAA;IACjB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB,CAAC;AAED,MAAM,eAAe,GAAG,WAAW,EAAE,CAAA;AAErC,SAAS,wBAAwB,CAAE,CAAe,EAAE,QAAQ;IAa1D,MAAM,sBAAuB,SAAQ,CAAC,CAAC,SAA0C;QAAjF;;YACE,SAAI,GAAG,CAAC,CAAC,SAAS,EAAmB,CAAA;YACrC,QAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAA;SAoB1B;QAlBC,iBAAiB;YACf,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAA;YACzB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAQ,CAAA;YACtC,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;YAC1B,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;SAChC;QAED,MAAM;YACJ,QACE,CAAC,CAAC,aAAa,CACb,MAAM,EACN;gBACE,GAAG,EAAE,IAAI,CAAC,IAAI;aACf,EACD,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CACrC,EACF;SACF;KACF;IAED,MAAM,KAAM,SAAQ,CAAC,CAAC,SAAwC;QAA9D;;YACE,UAAK,GAAgB;gBACnB,UAAU,EAAE,EAAE;aACf,CAAA;SA2CF;QAzCC,iBAAiB;YACf,OAAO,CAAC,GAAG,GAAG,IAAI,CAAA;SACnB;QAED,KAAK,CAAE,SAAS,EAAE,MAAM,EAAE,MAAM;YAC9B,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;YACvD,MAAM,MAAM,GAAG,CAAC,IAAe,KAAK,IAAI,IAAI,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC5E,MAAM,IAAI,GAAG,gBAAgB,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG;gBAChD,YAAY,EAAE,MAAM;gBACpB,sBAAsB,EAAE,MAAM;aAC/B,CAAA;YACD,MAAM,IAAI,GAAG;gBACX,MAAM;gBACN,OAAO,EAAE,CAAC,CAAC,aAAa,CAAC,sBAAsB,EAAE;oBAC/C,GAAG,EAAE,MAAM;oBACX,MAAM;oBACN,eAAe,CAAE,GAAG;wBAClB,OAAO,CAAC,CAAC,aAAa,CAAC,SAAS,kCAAO,CAAC,GAAG,CAAC,IAAI,KAAR,GAAG,CAAC,IAAI,GAAK,EAAE,GAAE,KAAK,GAAK,IAAI,EAAG,CAAA;qBAC3E;iBACF,CAAC;aACH,CAAA;YACD,IAAI,CAAC,QAAQ,CAAC;gBACZ,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC;aAC7C,CAAC,CAAA;SACH;QAED,OAAO,CAAE,MAAM;YACb,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAA;YACxC,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAA;YAClE,MAAM,IAAI,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA;YAC5E,IAAI,CAAC,QAAQ,CAAC;gBACZ,UAAU,EAAE,IAAI;aACjB,CAAC,CAAA;SACH;QAED,MAAM;YACJ,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAA;YACxC,QACE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC,EACzC;SACF;KACF;IAED,aAAa,EAAE,CAAA;IAEf,MAAM,GAAG,GAAGJ,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,CAAA;IAE1C,QAAQ,CAAC,MAAM,CACb,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,EAC1B,GAAG,CACJ,CAAA;AACH,CAAC;AAED,SAAgB,2BAA2B,CAAE,SAAS,EAAE,KAAmB,EAAE,QAAQ,EAAE,eAAe;IACpG,CAAC,GAAG,KAAK,CAAA;IACT,QAAQ,GAAG,QAAQ,CAAA;IAEnB,aAAa,EAAE,CAAA;IAEf,MAAM,MAAM,GAAG;QACb,UAAU,EAAE;YACV,KAAK,EAAE;gBACL,IAAI,EAAE,IAAI;gBACV,KAAK,EAAE,IAAI;gBACX,QAAQ,CAAE,OAAO,EAAE,MAAM;oBACvB,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,CAAA;iBACvC;aACF;SACF;QACD,OAAO;YACL,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;gBAChB,wBAAwB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;aACtC;SACF;QACD,QAAQ;YACN,UAAU,EAAE,CAAA;YACZ,IAAI,CAAC,MAAM,GAAG,eAAe,EAAE,CAAA;YAC/B,IAAI,CAAC,MAAM,GAAG,eAAe,CAAA;YAC7B,OAAO,CAAC,GAAI,CAAC,KAAM,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAA;SACxD;QACD,KAAK;YACH,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;SACpC;QACD,QAAQ;YACN,OAAO,CAAC,GAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SACnC;QACD,aAAa,EAAE;YACb,IAAI;gBACF,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;aACnC;YACD,IAAI;gBACF,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;aACnC;SACF;QACD,OAAO,EAAE;YACP,EAAE,EAAE,YAAY;SACjB;KACF,CAAA;IAED,SAAS,UAAU;QACjB,MAAM,KAAK,GAAG,eAAe,EAAE,CAAA;QAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW;YAAE,OAAM;QAExC,OAAO,CAAC,IAAI,GAAG,WAAW,CAAA;QAE1B,MAAM,KAAK,GAAI,WAAmB,CAAC,KAAK,IAAK,WAAmB,CAAC,SAAS,CAAA;QAC1E,MAAM,MAAM,GAAG;YACb,MAAM,EAAE,WAAW,CAAC,OAAO,IAAI,EAAE;YACjC,IAAI,EAAE,eAAe,CAAC,KAAK,CAAC;YAC5B,OAAO,EAAE,EAAE;YACX,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,EAAE;SACX,CAAA;QACD,OAAO,CAAC,MAAM,GAAG,MAAM,CAAA;QAEvB,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE;;YAExB,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,EAAE;gBAC5C,UAAU,EAAE,IAAI;gBAChB,YAAY,EAAE,IAAI;gBAClB,GAAG;oBACD,OAAO,IAAI,CAAC,aAAa,CAAA;iBAC1B;gBACD,GAAG,CAAE,KAAK;oBACR,MAAM,CAAC,MAAM,GAAG,KAAK,CAAA;oBACrB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAA;iBAC3B;aACF,CAAC,CAAA;SACH;KACF;IAED,OAAO,MAAM,CAAA;AACf,CAAC;;SC/fe,cAAc,CAAE,GAAmB,EAAE,EAAU;IAC7D,OAAO,CAAC,SAAoC;QAC1C,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;YAC9B,KAAK,EAAE;gBACL,GAAG,EAAE,MAAM;aACZ;YACD,MAAM,EAAE,CAAC,SAAS,EAAE;oBAClB,OAAO;wBACL,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;qBAC7B;iBACF,CAAC;SACH,CAAC,CAAA;QAEF,MAAM,OAAO,GAA8B;YACzC,MAAM,CAAE,CAAC;gBACP,OAAO,CAAC,CACN,SAAS,GAAG,KAAK,GAAG,MAAM,EAC1B;oBACE,KAAK,EAAE;wBACL,EAAE;wBACF,KAAK,EAAE,SAAS,GAAG,WAAW,GAAG,EAAE;qBACpC;iBACF,EACD;oBACE,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;iBACxC,CACF,CAAA;aACF;SACF,CAAA;QAED,OAAO,OAAO,CAAA;KACf,CAAA;AACH,CAAC;AAED,SAASK,eAAa;IACpB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAE7D,MAAM,iBAAiB,GAAG,UAAU,GAAG,EAAE,aAAa;;QAEpD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAA;QACvB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EAAE;YAC3E,GAAG,CAAC,YAAY,CAAC,aAAa,EAAE,KAAK,CAAC,CAAA;YACtC,OAAO,IAAI,CAAA;SACZ;KACF,CAAA;IAED,MAAM,YAAY,GAAG,UAAU,QAAQ,EAAE,SAAS;QAChD,OAAO,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;KACpC,CAAA;IAED,KAAK,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;IAC3C,KAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IAEjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,KAAK,CAAC,uBAAuB,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,GAAmB;YAC5D,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;gBAC9B,KAAK,EAAE;oBACL,GAAG,EAAE,MAAM;iBACZ;gBACD,MAAM,EAAE,CAAC,EAA2B,EAAE;wBACpC,OAAO;4BACL,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;yBAC/B;qBACF,CAAC;aACH,CAAC,CAAA;YAEF,MAAM,OAAO,GAA0B;gBACrC,IAAI,EAAE,eAAe;gBACrB,MAAM,CAAE,CAAC;oBACP,OAAO,CAAC,CACN,sBAAsB,EACtB;wBACE,KAAK,EAAE,CAAC,UAAU,CAAC;qBACpB,EACD,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACvC,CAAA;iBACF;aACF,CAAA;YAED,OAAO,OAAO,CAAA;SACf,CAAA;QAED,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE;YACpB,OAAO,EAAE,CAAC,GAAU,CAAA;SACrB,CAAA;KACF;AACH,CAAC;AAED,IAAI,GAAG,CAAA;AAEP,SAAgB,YAAY,CAAE,GAA8B,EAAE,GAAM,EAAE,MAAiB;IACrF,GAAG,GAAG,GAAG,CAAA;IACT,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,+CAA+C,CAAC,CAAA;IAE9DA,eAAa,EAAE,CAAA;IAEf,GAAG,CAAC,MAAM,CAAC,eAAe,GAAG,IAAI,CAAA;IAEjC,MAAM,QAAQ,GAAY,EAAE,CAAA;IAC5B,MAAM,KAAK,GAA2C,EAAE,CAAA;IACxD,IAAI,WAA2B,CAAA;IAE/B,MAAM,OAAO,GAAG,IAAK,GAAsB,CAAC;QAC1C,MAAM,CAAE,CAAC;YACP,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;gBACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;aACvB;YACD,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;SAChD;QACD,OAAO,EAAE;YACP,KAAK,CAAE,SAAoC,EAAE,EAAU,EAAE,EAAc;gBACrE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;gBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;aACpB;YACD,UAAU,CAAqB,EAAc;gBAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAA;gBACnC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,KAAkB,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;gBACrF,EAAE,EAAE,CAAA;aACL;YACD,OAAO,CAAE,EAAU,EAAE,EAAc;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACxC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;oBAC3B,IAAI,OAAO,CAAC,GAAG,KAAK,EAAE,EAAE;wBACtB,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;wBACrB,MAAK;qBACN;iBACF;gBAED,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;aACpB;SACF;KACF,CAAC,CAAA;IACF,IAAI,CAAC,SAAS,EAAE;QACd,OAAO,CAAC,MAAM,CAACL,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAQ,CAAC,CAAA;KACtD;IACD,MAAM,GAAG,GAAgB,MAAM,CAAC,MAAM,CAAC;QACrC,KAAK,CAAE,SAAoC,EAAE,EAAU,EAAE,EAAc;YACrE,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC/C,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;SAC5B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;SACxB;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;;oBAEb,OAAO,CAAC,MAAM,CAACA,UAAQ,CAAC,cAAc,CAAC,KAAK,CAAQ,CAAC,CAAA;iBACtD;gBACD,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,GAAqB,CAAA;gBACjD,IAAI,WAAW,IAAI,IAAI,IAAID,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;oBACpE,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACzD;aACF;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,WAAW,IAAI,IAAI,IAAIA,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClE,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACvD;aACF;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;gBACZ,IAAI,WAAW,IAAI,IAAI,IAAIA,YAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClE,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;iBACvD;aACF;SACF;KACF,CAAC,CAAA;IAEF,OAAO,CAAC,GAAG,GAAG,GAAG,CAAA;IAEjB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB,CAAC;;ACtMD,SAAS,cAAc,CAAE,CAAuB,EAAE,EAAU;IAC1D,OAAO,UAAU,SAAS;;QACxB,MAAM,MAAM,GAAG;YACb,KAAK,EAAE;gBACL,GAAG,EAAE,MAAM;aACZ;YACD,OAAO;gBACL,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;;gBAE5B,IAAI,CAAC,SAAS,CAAC;oBACb,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;iBAC1B,CAAC,CAAA;aACH;SACF,CAAA;QAED,IAAIX,SAAO,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;YAC7B,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAA;YAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;YAC7B,IAAI,EAAC,MAAA,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,0CAAE,GAAG,CAAA,EAAE;;gBAE3B,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;aAC9B;iBAAM;;gBAEL,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAA;aAC/B;SACF;aAAM;YACL,SAAS,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAA;SAC5B;QAED,OAAO,CAAC,CACN,SAAS,GAAG,KAAK,GAAG,MAAM,EAC1B;YACE,GAAG,EAAE,EAAE;YACP,EAAE;YACF,KAAK,EAAE,SAAS,GAAG,WAAW,GAAG,EAAE;SACpC,EACD;YACE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE;gBAC9B,GAAG,EAAE,EAAE;aACR,CAAC;SACH,CACF,CAAA;KACF,CAAA;AACH,CAAC;AAED,SAASiB,eAAa;IACpB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAS,kBAAkB,CAAC,KAAK,CAAC,CAAA;IAE7D,MAAM,YAAY,GAAiB,UAAU,QAAQ,EAAE,SAAS;QAC9D,OAAO,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;KACpC,CAAA;IAED,MAAM,aAAa,GAAG,UAAU,KAAK;QACnC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;KAC1C,CAAA;IAED,KAAK,CAAC,YAAY,GAAG,YAAY,CAAA;IACjC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;IAEnC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE;QACjC,KAAK,CAAC,uBAAuB,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,CAAuB;YACvE,MAAM,MAAM,GAAG;gBACb,KAAK,EAAE;oBACL,GAAG,EAAE,MAAM;iBACZ;gBACD,OAAO;oBACL,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;iBAC/B;aACF,CAAA;YAED,SAAS,CAAC,MAAM,GAAGjB,SAAO,CAAC,SAAS,CAAC,MAAM,CAAC;kBACxC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;kBAC7B,CAAC,MAAM,CAAC,CAAA;YAEZ,OAAO;gBACL,MAAM;oBACJ,OAAO,CAAC,CACN,sBAAsB,EACtB;wBACE,KAAK,EAAE,UAAU;qBAClB,EACD,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACpC,CAAA;iBACF;aACF,CAAA;SACF,CAAA;QAED,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE;YACpB,OAAO,EAAE,CAAC,GAAU,CAAA;SACrB,CAAA;KACF;AACH,CAAC;AAED,SAAgB,aAAa,CAAE,GAAqB,EAAE,CAAuB,EAAE,MAAc;IAC3F,IAAI,KAAK,GAAY,EAAE,CAAA;IACvB,IAAI,WAAoC,CAAA;IAExC,MAAM,CAAC,CAACW,YAAU,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,CAAA;IAErDM,eAAa,EAAE,CAAA;IAEf,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG;QACtB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAA;KACrB,CAAA;IACD,IAAI,CAAC,SAAS,EAAE;QACd,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;KAChC;IACD,MAAM,SAAS,GAAgB,MAAM,CAAC,MAAM,CAAC;QAC3C,KAAK,CAAE,SAAoB,EAAE,EAAU,EAAE,EAAc;YACrD,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;YAC7C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAChB,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAA;SAC3B;QAED,OAAO,CAAE,EAAU,EAAE,EAAc;YACjC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAA;YAC7C,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAA;SAC3B;QAED,iBAAiB,CAAE,EAA6B;YAC9C,WAAW,CAAC,YAAY,EAAE,CAAA;YAC1B,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;SAC1B;KACF,EAAE;QACD,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,KAAK,EAAE,MAAM;SACd;QAED,QAAQ,EAAE;YACR,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,IAAI,SAAS,EAAE;oBACb,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;iBAChC;gBACD,MAAM,QAAQ,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,QAAQ,CAAA;gBAChDN,YAAU,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aAC5D;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,OAAO,CAAC,MAAM,mBACZ,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,IACnB,OAAO,CACX,CAAA;gBACD,MAAM,MAAM,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,MAAM,CAAA;gBAC5CA,YAAU,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aACxD;SACF;QAED,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,IAAI;YAChB,KAAK,CAAE,OAAO;;gBACZ,MAAM,MAAM,GAAG,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,0CAAE,MAAM,CAAA;gBAC5CA,YAAU,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAA;aACxD;SACF;KACF,CAAC,CAAA;IAEF,OAAO,CAAC,GAAG,GAAG,SAAS,CAAA;IAEvB,OAAO,OAAO,CAAC,GAAG,CAAA;AACpB,CAAC;;ACvLD,MAAM,SAAS,GAAG,CAAC,SAA8B;IAC/C,OAAO,CAAC,EAAQ;QACd,MAAM,EAAE,GAAGO,CAAK,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,YAAY,CAAA;;QAGxD,MAAM,KAAK,GAAGA,CAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAC9B,IAAI,KAAK,CAAC,OAAO,KAAK,EAAE;YAAE,KAAK,CAAC,OAAO,GAAG,EAAE,CAAA;QAE5CA,CAAK,CAAC,eAAe,CAAC;YACpB,IAAI,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAA;YAC9B,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,KAAK,GAAG,IAAI,CAAA;gBACZ,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;aAC3B;YAED,IAAI,GAAG,IAAK,CAAA;;YAGZ,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAS,KAAK,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAA;YAEzD,IAAIP,YAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;gBAC9B,IAAI,CAAC,SAAS,CAAS,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,CAAA;aACvD;iBAAM;gBACJ,IAAI,CAAC,SAAS,CAAS,GAAG;oBACzB,IAAK,IAAI,CAAC,SAAS,CAAS,IAAI,EAAE,CAAC;oBACnC,QAAQ;iBACT,CAAA;aACF;YAED,IAAI,KAAK,EAAE;gBACT,kBAAkB,CAAC,IAAK,EAAE,EAAE,CAAC,CAAA;aAC9B;YACD,OAAO;gBACL,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAA;gBAChC,MAAM,IAAI,GAAG,IAAK,CAAC,SAAS,CAAC,CAAA;gBAC7B,IAAI,IAAI,KAAK,QAAQ,EAAE;oBACpB,IAAK,CAAC,SAAS,CAAS,GAAG,SAAS,CAAA;iBACtC;qBAAM,IAAIX,SAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,IAAK,CAAC,SAAS,CAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,KAAK,QAAQ,CAAC,CAAA;iBACnE;aACF,CAAA;SACF,EAAE,EAAE,CAAC,CAAA;KACP,CAAA;AACH,CAAC,CAAA;AAED,MAAa,UAAU,GAAG,SAAS,CAAC,kBAAkB,CAAC,CAAA;AAEvD,MAAa,UAAU,GAAG,SAAS,CAAC,kBAAkB,CAAC,CAAA;AAEvD,MAAa,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,CAAC,CAAA;AAEhE,MAAa,cAAc,GAAG,SAAS,CAAC,eAAe,CAAC,CAAA;AAExD,MAAa,aAAa,GAAG,SAAS,CAAC,cAAc,CAAC,CAAA;AAEtD,MAAa,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,CAAA;AAE9C,MAAa,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,CAAC,CAAA;AAEhE,MAAa,aAAa,GAAG,SAAS,CAAC,cAAc,CAAC,CAAA;AAEtD,MAAa,aAAa,GAAG,SAAS,CAAC,cAAc,CAAC,CAAA;AAEtD,MAAa,kBAAkB,GAAG,SAAS,CAAC,mBAAmB,CAAC,CAAA;AAEhE,MAAa,gBAAgB,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAA;AAE5D,MAAa,gBAAgB,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAA;AAE5D,MAAa,iBAAiB,GAAG,SAAS,CAAC,kBAAkB,CAAC,CAAA;AAE9D,MAAa,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,CAAA;AAE5C,MAAa,SAAS,GAAG,CAAC,OAAO,GAAG,KAAK;IACvC,OAAO,OAAO,GAAG,OAAO,CAAC,MAAM,GAAGkB,CAAK,CAAC,OAAO,CAAC,MAAM,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;AAC3E,CAAC,CAAA;AAED,MAAa,QAAQ,GAAG,MAAM,SAAS;;AC/EvC,SAAS,kBAAkB,CAAE,IAAa;IACxC,IAAI,IAAI,IAAI,IAAI,EAAE;QAChB,OAAO,EAAE,CAAA;KACV;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;AACtD,CAAC;AAED,MAAa,QAAQ,GAAG,CAAC,EAAQ,EAAE,GAAyB;;IAC1D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;IAC7B,MAAM,SAAS,GAAG;QAChB,UAAU,CAAC;YACT,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAA;SAC1B,EAAE,CAAC,CAAC,CAAA;KACN,CAAA;IAED,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,IAAI,WAAW,GAA2B,IAAI,CAAA;QAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;QACpE,WAAW,GAAGN,UAAQ,CAAC,cAAc,CAAkB,IAAI,CAAC,CAAA;QAC5D,IAAI,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,aAAa,EAAE;YAC9B,IAAI,SAAS,EAAE;;gBAEb,MAAA,MAAA,MAAA,WAAW,CAAC,UAAU,0CAAG,kBAAkB,CAAC,mDAAK,IAAI,CAAC;oBACpD,SAAS,EAAE,CAAA;iBACZ,CAAC,mCAAI,SAAS,EAAE,CAAA;aAClB;iBAAM;gBACL,WAAW,CAAC,qBAAqB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;aAC3C;SACF;aAAM;YACL,SAAS,EAAE,CAAA;SACZ;KACF;SAAM;QACL,SAAS,EAAE,CAAA;KACZ;AACH,CAAC;;;;"} \ No newline at end of file diff --git a/packages/taro-runtime/jest.config.js b/packages/taro-runtime/jest.config.js index de81da343..8a8b43122 100644 --- a/packages/taro-runtime/jest.config.js +++ b/packages/taro-runtime/jest.config.js @@ -16,6 +16,8 @@ module.exports = { ENABLE_INNER_HTML: true, ENABLE_ADJACENT_HTML: true, ENABLE_SIZE_APIS: true, + ENABLE_TEMPLATE_CONTENT: true, + ENABLE_CLONE_NODE: true, 'ts-jest': { diagnostics: false, tsConfig: 'tsconfig.test.json', diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/CHANGELOG.md b/packages/taro-runtime/node_modules/@rollup/pluginutils/CHANGELOG.md deleted file mode 100755 index 42cfcbcae..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/CHANGELOG.md +++ /dev/null @@ -1,369 +0,0 @@ -# @rollup/pluginutils ChangeLog - -## v4.1.1 - -_2021-07-16_ - -### Bugfixes - -- fix - -### Updates - -- chore - -## v4.1.0 - -_2020-10-27_ - -### Bugfixes - -- fix: attach scope object to for-loop (#616) - -### Features - -- feat: normalizePath (#550) - -### Updates - -- refactor: improve readability of attachScopes test (#551) - -## v4.0.0 - -_2020-08-13_ - -### Breaking Changes - -- fix!: don't add cwd to absolute or patterns that start with a glob (#517) - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -### Features - -- feat: add native node es modules support (#419) - -### Updates - -- docs: Correct minimatch to picomatch (#525) -- chore: update dependencies (9f56d37) -- refactor: replace micromatch with picomatch. (#306) -- chore: Don't bundle micromatch (#220) -- chore: add missing typescript devDep (238b140) -- chore: Use readonly arrays, add TSDoc (#187) -- chore: Use typechecking (2ae08eb) - -## v3.1.0 - -_2020-06-05_ - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -### Features - -- feat: add native node es modules support (#419) - -### Updates - -- refactor: replace micromatch with picomatch. (#306) -- chore: Don't bundle micromatch (#220) -- chore: add missing typescript devDep (238b140) -- chore: Use readonly arrays, add TSDoc (#187) -- chore: Use typechecking (2ae08eb) - -## v3.0.10 - -_2020-05-02_ - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -### Updates - -- refactor: replace micromatch with picomatch. (#306) -- chore: Don't bundle micromatch (#220) -- chore: add missing typescript devDep (238b140) -- chore: Use readonly arrays, add TSDoc (#187) -- chore: Use typechecking (2ae08eb) - -## v3.0.9 - -_2020-04-12_ - -### Updates - -- chore: support Rollup v2 - -## v3.0.8 - -_2020-02-01_ - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -### Updates - -- chore: add missing typescript devDep (238b140) -- chore: Use readonly arrays, add TSDoc (#187) -- chore: Use typechecking (2ae08eb) - -## v3.0.7 - -_2020-02-01_ - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -### Updates - -- chore: Use readonly arrays, add TSDoc (#187) -- chore: Use typechecking (2ae08eb) - -## v3.0.6 - -_2020-01-27_ - -### Bugfixes - -- fix: resolve relative paths starting with "./" (#180) - -## v3.0.5 - -_2020-01-25_ - -### Bugfixes - -- fix: bring back named exports (#176) - -## v3.0.4 - -_2020-01-10_ - -### Bugfixes - -- fix: keep for(const..) out of scope (#151) - -## v3.0.3 - -_2020-01-07_ - -### Bugfixes - -- fix: createFilter Windows regression (#141) - -### Updates - -- test: fix windows path failure (0a0de65) -- chore: fix test script (5eae320) - -## v3.0.2 - -_2020-01-04_ - -### Bugfixes - -- fix: makeLegalIdentifier - potentially unsafe input for blacklisted identifier (#116) - -### Updates - -- docs: Fix documented type of createFilter's include/exclude (#123) -- chore: update minor linting correction (bcbf9d2) - -## 3.0.1 - -- fix: Escape glob characters in folder (#84) - -## 3.0.0 - -_2019-11-25_ - -- **Breaking:** Minimum compatible Rollup version is 1.20.0 -- **Breaking:** Minimum supported Node version is 8.0.0 -- Published as @rollup/plugins-image - -## 2.8.2 - -_2019-09-13_ - -- Handle optional catch parameter in attachScopes ([#70](https://github.com/rollup/rollup-pluginutils/pulls/70)) - -## 2.8.1 - -_2019-06-04_ - -- Support serialization of many edge cases ([#64](https://github.com/rollup/rollup-pluginutils/issues/64)) - -## 2.8.0 - -_2019-05-30_ - -- Bundle updated micromatch dependency ([#60](https://github.com/rollup/rollup-pluginutils/issues/60)) - -## 2.7.1 - -_2019-05-17_ - -- Do not ignore files with a leading "." in createFilter ([#62](https://github.com/rollup/rollup-pluginutils/issues/62)) - -## 2.7.0 - -_2019-05-15_ - -- Add `resolve` option to createFilter ([#59](https://github.com/rollup/rollup-pluginutils/issues/59)) - -## 2.6.0 - -_2019-04-04_ - -- Add `extractAssignedNames` ([#59](https://github.com/rollup/rollup-pluginutils/issues/59)) -- Provide dedicated TypeScript typings file ([#58](https://github.com/rollup/rollup-pluginutils/issues/58)) - -## 2.5.0 - -_2019-03-18_ - -- Generalize dataToEsm type ([#55](https://github.com/rollup/rollup-pluginutils/issues/55)) -- Handle empty keys in dataToEsm ([#56](https://github.com/rollup/rollup-pluginutils/issues/56)) - -## 2.4.1 - -_2019-02-16_ - -- Remove unnecessary dependency - -## 2.4.0 - -_2019-02-16_ -Update dependencies to solve micromatch vulnerability ([#53](https://github.com/rollup/rollup-pluginutils/issues/53)) - -## 2.3.3 - -_2018-09-19_ - -- Revert micromatch update ([#43](https://github.com/rollup/rollup-pluginutils/issues/43)) - -## 2.3.2 - -_2018-09-18_ - -- Bumb micromatch dependency ([#36](https://github.com/rollup/rollup-pluginutils/issues/36)) -- Bumb dependencies ([#41](https://github.com/rollup/rollup-pluginutils/issues/41)) -- Split up tests ([#40](https://github.com/rollup/rollup-pluginutils/issues/40)) - -## 2.3.1 - -_2018-08-06_ - -- Fixed ObjectPattern scope in attachScopes to recognise { ...rest } syntax ([#37](https://github.com/rollup/rollup-pluginutils/issues/37)) - -## 2.3.0 - -_2018-05-21_ - -- Add option to not generate named exports ([#32](https://github.com/rollup/rollup-pluginutils/issues/32)) - -## 2.2.1 - -_2018-05-21_ - -- Support `null` serialization ([#34](https://github.com/rollup/rollup-pluginutils/issues/34)) - -## 2.2.0 - -_2018-05-11_ - -- Improve white-space handling in `dataToEsm` and add `prepare` script ([#31](https://github.com/rollup/rollup-pluginutils/issues/31)) - -## 2.1.1 - -_2018-05-09_ - -- Update dependencies - -## 2.1.0 - -_2018-05-08_ - -- Add `dataToEsm` helper to create named exports from objects ([#29](https://github.com/rollup/rollup-pluginutils/issues/29)) -- Support literal keys in object patterns ([#27](https://github.com/rollup/rollup-pluginutils/issues/27)) -- Support function declarations without id in `attachScopes` ([#28](https://github.com/rollup/rollup-pluginutils/issues/28)) - -## 2.0.1 - -_2017-01-03_ - -- Don't add extension to file with trailing dot ([#14](https://github.com/rollup/rollup-pluginutils/issues/14)) - -## 2.0.0 - -_2017-01-03_ - -- Use `micromatch` instead of `minimatch` ([#19](https://github.com/rollup/rollup-pluginutils/issues/19)) -- Allow `createFilter` to take regexes ([#5](https://github.com/rollup/rollup-pluginutils/issues/5)) - -## 1.5.2 - -_2016-08-29_ - -- Treat `arguments` as a reserved word ([#10](https://github.com/rollup/rollup-pluginutils/issues/10)) - -## 1.5.1 - -_2016-06-24_ - -- Add all declarators in a var declaration to scope, not just the first - -## 1.5.0 - -_2016-06-07_ - -- Exclude IDs with null character (`\0`) - -## 1.4.0 - -_2016-06-07_ - -- Workaround minimatch issue ([#6](https://github.com/rollup/rollup-pluginutils/pull/6)) -- Exclude non-string IDs in `createFilter` - -## 1.3.1 - -_2015-12-16_ - -- Build with Rollup directly, rather than via Gobble - -## 1.3.0 - -_2015-12-16_ - -- Use correct path separator on Windows - -## 1.2.0 - -_2015-11-02_ - -- Add `attachScopes` and `makeLegalIdentifier` - -## 1.1.0 - -2015-10-24\* - -- Add `addExtension` function - -## 1.0.1 - -_2015-10-24_ - -- Include dist files in package - -## 1.0.0 - -_2015-10-24_ - -- First release \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/README.md b/packages/taro-runtime/node_modules/@rollup/pluginutils/README.md deleted file mode 100755 index 91dc81ae2..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/README.md +++ /dev/null @@ -1,255 +0,0 @@ -[npm]: https://img.shields.io/npm/v/@rollup/pluginutils -[npm-url]: https://www.npmjs.com/package/@rollup/pluginutils -[size]: https://packagephobia.now.sh/badge?p=@rollup/pluginutils -[size-url]: https://packagephobia.now.sh/result?p=@rollup/pluginutils - -[![npm][npm]][npm-url] -[![size][size]][size-url] -[![libera manifesto](https://img.shields.io/badge/libera-manifesto-lightgrey.svg)](https://liberamanifesto.com) - -# @rollup/pluginutils - -A set of utility functions commonly used by 🍣 Rollup plugins. - -## Requirements - -This plugin requires an [LTS](https://github.com/nodejs/Release) Node version (v8.0.0+) and Rollup v1.20.0+. - -## Install - -Using npm: - -```console -npm install @rollup/pluginutils --save-dev -``` - -## Usage - -```js -import utils from '@rollup/pluginutils'; -//... -``` - -## API - -Available utility functions are listed below: - -_Note: Parameter names immediately followed by a `?` indicate that the parameter is optional._ - -### addExtension - -Adds an extension to a module ID if one does not exist. - -Parameters: `(filename: String, ext?: String)`
-Returns: `String` - -```js -import { addExtension } from '@rollup/pluginutils'; - -export default function myPlugin(options = {}) { - return { - resolveId(code, id) { - // only adds an extension if there isn't one already - id = addExtension(id); // `foo` -> `foo.js`, `foo.js` -> `foo.js` - id = addExtension(id, '.myext'); // `foo` -> `foo.myext`, `foo.js` -> `foo.js` - } - }; -} -``` - -### attachScopes - -Attaches `Scope` objects to the relevant nodes of an AST. Each `Scope` object has a `scope.contains(name)` method that returns `true` if a given name is defined in the current scope or a parent scope. - -Parameters: `(ast: Node, propertyName?: String)`
-Returns: `Object` - -See [rollup-plugin-inject](https://github.com/rollup/rollup-plugin-inject) or [rollup-plugin-commonjs](https://github.com/rollup/rollup-plugin-commonjs) for an example of usage. - -```js -import { attachScopes } from '@rollup/pluginutils'; -import { walk } from 'estree-walker'; - -export default function myPlugin(options = {}) { - return { - transform(code) { - const ast = this.parse(code); - - let scope = attachScopes(ast, 'scope'); - - walk(ast, { - enter(node) { - if (node.scope) scope = node.scope; - - if (!scope.contains('foo')) { - // `foo` is not defined, so if we encounter it, - // we assume it's a global - } - }, - leave(node) { - if (node.scope) scope = scope.parent; - } - }); - } - }; -} -``` - -### createFilter - -Constructs a filter function which can be used to determine whether or not certain modules should be operated upon. - -Parameters: `(include?: , exclude?: , options?: Object)`
-Returns: `String` - -#### `include` and `exclude` - -Type: `String | RegExp | Array[...String|RegExp]`
- -A valid [`picomatch`](https://github.com/micromatch/picomatch#globbing-features) pattern, or array of patterns. If `options.include` is omitted or has zero length, filter will return `true` by default. Otherwise, an ID must match one or more of the `picomatch` patterns, and must not match any of the `options.exclude` patterns. - -Note that `picomatch` patterns are very similar to [`minimatch`](https://github.com/isaacs/minimatch#readme) patterns, and in most use cases, they are interchangeable. If you have more specific pattern matching needs, you can view [this comparison table](https://github.com/micromatch/picomatch#library-comparisons) to learn more about where the libraries differ. - -#### `options` - -##### `resolve` - -Type: `String | Boolean | null` - -Optionally resolves the patterns against a directory other than `process.cwd()`. If a `String` is specified, then the value will be used as the base directory. Relative paths will be resolved against `process.cwd()` first. If `false`, then the patterns will not be resolved against any directory. This can be useful if you want to create a filter for virtual module names. - -#### Usage - -```js -import { createFilter } from '@rollup/pluginutils'; - -export default function myPlugin(options = {}) { - // assume that the myPlugin accepts options of `options.include` and `options.exclude` - var filter = createFilter(options.include, options.exclude, { - resolve: '/my/base/dir' - }); - - return { - transform(code, id) { - if (!filter(id)) return; - - // proceed with the transformation... - } - }; -} -``` - -### dataToEsm - -Transforms objects into tree-shakable ES Module imports. - -Parameters: `(data: Object)`
-Returns: `String` - -#### `data` - -Type: `Object` - -An object to transform into an ES module. - -#### Usage - -```js -import { dataToEsm } from '@rollup/pluginutils'; - -const esModuleSource = dataToEsm( - { - custom: 'data', - to: ['treeshake'] - }, - { - compact: false, - indent: '\t', - preferConst: false, - objectShorthand: false, - namedExports: true - } -); -/* -Outputs the string ES module source: - export const custom = 'data'; - export const to = ['treeshake']; - export default { custom, to }; -*/ -``` - -### extractAssignedNames - -Extracts the names of all assignment targets based upon specified patterns. - -Parameters: `(param: Node)`
-Returns: `Array[...String]` - -#### `param` - -Type: `Node` - -An `acorn` AST Node. - -#### Usage - -```js -import { extractAssignedNames } from '@rollup/pluginutils'; -import { walk } from 'estree-walker'; - -export default function myPlugin(options = {}) { - return { - transform(code) { - const ast = this.parse(code); - - walk(ast, { - enter(node) { - if (node.type === 'VariableDeclarator') { - const declaredNames = extractAssignedNames(node.id); - // do something with the declared names - // e.g. for `const {x, y: z} = ...` => declaredNames = ['x', 'z'] - } - } - }); - } - }; -} -``` - -### makeLegalIdentifier - -Constructs a bundle-safe identifier from a `String`. - -Parameters: `(str: String)`
-Returns: `String` - -#### Usage - -```js -import { makeLegalIdentifier } from '@rollup/pluginutils'; - -makeLegalIdentifier('foo-bar'); // 'foo_bar' -makeLegalIdentifier('typeof'); // '_typeof' -``` - -### normalizePath - -Converts path separators to forward slash. - -Parameters: `(filename: String)`
-Returns: `String` - -#### Usage - -```js -import { normalizePath } from '@rollup/pluginutils'; - -normalizePath('foo\\bar'); // 'foo/bar' -normalizePath('foo/bar'); // 'foo/bar' -``` - -## Meta - -[CONTRIBUTING](/.github/CONTRIBUTING.md) - -[LICENSE (MIT)](/LICENSE) diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/cjs/index.js b/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/cjs/index.js deleted file mode 100644 index f1f0bfd52..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/cjs/index.js +++ /dev/null @@ -1,467 +0,0 @@ -'use strict'; - -Object.defineProperty(exports, '__esModule', { value: true }); - -var path = require('path'); -var pm = require('picomatch'); - -function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; } - -var pm__default = /*#__PURE__*/_interopDefaultLegacy(pm); - -const addExtension = function addExtension(filename, ext = '.js') { - let result = `${filename}`; - if (!path.extname(filename)) - result += ext; - return result; -}; - -class WalkerBase {constructor() { WalkerBase.prototype.__init.call(this);WalkerBase.prototype.__init2.call(this);WalkerBase.prototype.__init3.call(this);WalkerBase.prototype.__init4.call(this); } - __init() {this.should_skip = false;} - __init2() {this.should_remove = false;} - __init3() {this.replacement = null;} - - __init4() {this.context = { - skip: () => (this.should_skip = true), - remove: () => (this.should_remove = true), - replace: (node) => (this.replacement = node) - };} - - replace(parent, prop, index, node) { - if (parent) { - if (index !== null) { - parent[prop][index] = node; - } else { - parent[prop] = node; - } - } - } - - remove(parent, prop, index) { - if (parent) { - if (index !== null) { - parent[prop].splice(index, 1); - } else { - delete parent[prop]; - } - } - } -} - -class SyncWalkerClass extends WalkerBase { - - - - constructor(walker) { - super(); - this.enter = walker.enter; - this.leave = walker.leave; - } - - visit( - node, - parent, - enter, - leave, - prop, - index - ) { - if (node) { - if (enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = (node )[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!this.visit(value[i], node, enter, leave, key, i)) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - this.visit(value, node, enter, leave, key, null); - } - } - - if (leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} - -function walk(ast, walker) { - const instance = new SyncWalkerClass(walker); - return instance.visit(ast, null, walker.enter, walker.leave); -} - -const extractors = { - ArrayPattern(names, param) { - for (const element of param.elements) { - if (element) - extractors[element.type](names, element); - } - }, - AssignmentPattern(names, param) { - extractors[param.left.type](names, param.left); - }, - Identifier(names, param) { - names.push(param.name); - }, - MemberExpression() { }, - ObjectPattern(names, param) { - for (const prop of param.properties) { - // @ts-ignore Typescript reports that this is not a valid type - if (prop.type === 'RestElement') { - extractors.RestElement(names, prop); - } - else { - extractors[prop.value.type](names, prop.value); - } - } - }, - RestElement(names, param) { - extractors[param.argument.type](names, param.argument); - } -}; -const extractAssignedNames = function extractAssignedNames(param) { - const names = []; - extractors[param.type](names, param); - return names; -}; - -const blockDeclarations = { - const: true, - let: true -}; -class Scope { - constructor(options = {}) { - this.parent = options.parent; - this.isBlockScope = !!options.block; - this.declarations = Object.create(null); - if (options.params) { - options.params.forEach((param) => { - extractAssignedNames(param).forEach((name) => { - this.declarations[name] = true; - }); - }); - } - } - addDeclaration(node, isBlockDeclaration, isVar) { - if (!isBlockDeclaration && this.isBlockScope) { - // it's a `var` or function node, and this - // is a block scope, so we need to go up - this.parent.addDeclaration(node, isBlockDeclaration, isVar); - } - else if (node.id) { - extractAssignedNames(node.id).forEach((name) => { - this.declarations[name] = true; - }); - } - } - contains(name) { - return this.declarations[name] || (this.parent ? this.parent.contains(name) : false); - } -} -const attachScopes = function attachScopes(ast, propertyName = 'scope') { - let scope = new Scope(); - walk(ast, { - enter(n, parent) { - const node = n; - // function foo () {...} - // class Foo {...} - if (/(Function|Class)Declaration/.test(node.type)) { - scope.addDeclaration(node, false, false); - } - // var foo = 1 - if (node.type === 'VariableDeclaration') { - const { kind } = node; - const isBlockDeclaration = blockDeclarations[kind]; - node.declarations.forEach((declaration) => { - scope.addDeclaration(declaration, isBlockDeclaration, true); - }); - } - let newScope; - // create new function scope - if (/Function/.test(node.type)) { - const func = node; - newScope = new Scope({ - parent: scope, - block: false, - params: func.params - }); - // named function expressions - the name is considered - // part of the function's scope - if (func.type === 'FunctionExpression' && func.id) { - newScope.addDeclaration(func, false, false); - } - } - // create new for scope - if (/For(In|Of)?Statement/.test(node.type)) { - newScope = new Scope({ - parent: scope, - block: true - }); - } - // create new block scope - if (node.type === 'BlockStatement' && !/Function/.test(parent.type)) { - newScope = new Scope({ - parent: scope, - block: true - }); - } - // catch clause has its own block scope - if (node.type === 'CatchClause') { - newScope = new Scope({ - parent: scope, - params: node.param ? [node.param] : [], - block: true - }); - } - if (newScope) { - Object.defineProperty(node, propertyName, { - value: newScope, - configurable: true - }); - scope = newScope; - } - }, - leave(n) { - const node = n; - if (node[propertyName]) - scope = scope.parent; - } - }); - return scope; -}; - -// Helper since Typescript can't detect readonly arrays with Array.isArray -function isArray(arg) { - return Array.isArray(arg); -} -function ensureArray(thing) { - if (isArray(thing)) - return thing; - if (thing == null) - return []; - return [thing]; -} - -const normalizePath = function normalizePath(filename) { - return filename.split(path.win32.sep).join(path.posix.sep); -}; - -function getMatcherString(id, resolutionBase) { - if (resolutionBase === false || path.isAbsolute(id) || id.startsWith('*')) { - return id; - } - // resolve('') is valid and will default to process.cwd() - const basePath = normalizePath(path.resolve(resolutionBase || '')) - // escape all possible (posix + win) path characters that might interfere with regex - .replace(/[-^$*+?.()|[\]{}]/g, '\\$&'); - // Note that we use posix.join because: - // 1. the basePath has been normalized to use / - // 2. the incoming glob (id) matcher, also uses / - // otherwise Node will force backslash (\) on windows - return path.posix.join(basePath, id); -} -const createFilter = function createFilter(include, exclude, options) { - const resolutionBase = options && options.resolve; - const getMatcher = (id) => id instanceof RegExp - ? id - : { - test: (what) => { - // this refactor is a tad overly verbose but makes for easy debugging - const pattern = getMatcherString(id, resolutionBase); - const fn = pm__default['default'](pattern, { dot: true }); - const result = fn(what); - return result; - } - }; - const includeMatchers = ensureArray(include).map(getMatcher); - const excludeMatchers = ensureArray(exclude).map(getMatcher); - return function result(id) { - if (typeof id !== 'string') - return false; - if (/\0/.test(id)) - return false; - const pathId = normalizePath(id); - for (let i = 0; i < excludeMatchers.length; ++i) { - const matcher = excludeMatchers[i]; - if (matcher.test(pathId)) - return false; - } - for (let i = 0; i < includeMatchers.length; ++i) { - const matcher = includeMatchers[i]; - if (matcher.test(pathId)) - return true; - } - return !includeMatchers.length; - }; -}; - -const reservedWords = 'break case class catch const continue debugger default delete do else export extends finally for function if import in instanceof let new return super switch this throw try typeof var void while with yield enum await implements package protected static interface private public'; -const builtins = 'arguments Infinity NaN undefined null true false eval uneval isFinite isNaN parseFloat parseInt decodeURI decodeURIComponent encodeURI encodeURIComponent escape unescape Object Function Boolean Symbol Error EvalError InternalError RangeError ReferenceError SyntaxError TypeError URIError Number Math Date String RegExp Array Int8Array Uint8Array Uint8ClampedArray Int16Array Uint16Array Int32Array Uint32Array Float32Array Float64Array Map Set WeakMap WeakSet SIMD ArrayBuffer DataView JSON Promise Generator GeneratorFunction Reflect Proxy Intl'; -const forbiddenIdentifiers = new Set(`${reservedWords} ${builtins}`.split(' ')); -forbiddenIdentifiers.add(''); -const makeLegalIdentifier = function makeLegalIdentifier(str) { - let identifier = str - .replace(/-(\w)/g, (_, letter) => letter.toUpperCase()) - .replace(/[^$_a-zA-Z0-9]/g, '_'); - if (/\d/.test(identifier[0]) || forbiddenIdentifiers.has(identifier)) { - identifier = `_${identifier}`; - } - return identifier || '_'; -}; - -function stringify(obj) { - return (JSON.stringify(obj) || 'undefined').replace(/[\u2028\u2029]/g, (char) => `\\u${`000${char.charCodeAt(0).toString(16)}`.slice(-4)}`); -} -function serializeArray(arr, indent, baseIndent) { - let output = '['; - const separator = indent ? `\n${baseIndent}${indent}` : ''; - for (let i = 0; i < arr.length; i++) { - const key = arr[i]; - output += `${i > 0 ? ',' : ''}${separator}${serialize(key, indent, baseIndent + indent)}`; - } - return `${output}${indent ? `\n${baseIndent}` : ''}]`; -} -function serializeObject(obj, indent, baseIndent) { - let output = '{'; - const separator = indent ? `\n${baseIndent}${indent}` : ''; - const entries = Object.entries(obj); - for (let i = 0; i < entries.length; i++) { - const [key, value] = entries[i]; - const stringKey = makeLegalIdentifier(key) === key ? key : stringify(key); - output += `${i > 0 ? ',' : ''}${separator}${stringKey}:${indent ? ' ' : ''}${serialize(value, indent, baseIndent + indent)}`; - } - return `${output}${indent ? `\n${baseIndent}` : ''}}`; -} -function serialize(obj, indent, baseIndent) { - if (obj === Infinity) - return 'Infinity'; - if (obj === -Infinity) - return '-Infinity'; - if (obj === 0 && 1 / obj === -Infinity) - return '-0'; - if (obj instanceof Date) - return `new Date(${obj.getTime()})`; - if (obj instanceof RegExp) - return obj.toString(); - if (obj !== obj) - return 'NaN'; // eslint-disable-line no-self-compare - if (Array.isArray(obj)) - return serializeArray(obj, indent, baseIndent); - if (obj === null) - return 'null'; - if (typeof obj === 'object') - return serializeObject(obj, indent, baseIndent); - return stringify(obj); -} -const dataToEsm = function dataToEsm(data, options = {}) { - const t = options.compact ? '' : 'indent' in options ? options.indent : '\t'; - const _ = options.compact ? '' : ' '; - const n = options.compact ? '' : '\n'; - const declarationType = options.preferConst ? 'const' : 'var'; - if (options.namedExports === false || - typeof data !== 'object' || - Array.isArray(data) || - data instanceof Date || - data instanceof RegExp || - data === null) { - const code = serialize(data, options.compact ? null : t, ''); - const magic = _ || (/^[{[\-\/]/.test(code) ? '' : ' '); // eslint-disable-line no-useless-escape - return `export default${magic}${code};`; - } - let namedExportCode = ''; - const defaultExportRows = []; - for (const [key, value] of Object.entries(data)) { - if (key === makeLegalIdentifier(key)) { - if (options.objectShorthand) - defaultExportRows.push(key); - else - defaultExportRows.push(`${key}:${_}${key}`); - namedExportCode += `export ${declarationType} ${key}${_}=${_}${serialize(value, options.compact ? null : t, '')};${n}`; - } - else { - defaultExportRows.push(`${stringify(key)}:${_}${serialize(value, options.compact ? null : t, '')}`); - } - } - return `${namedExportCode}export default${_}{${n}${t}${defaultExportRows.join(`,${n}${t}`)}${n}};${n}`; -}; - -// TODO: remove this in next major -var index = { - addExtension, - attachScopes, - createFilter, - dataToEsm, - extractAssignedNames, - makeLegalIdentifier, - normalizePath -}; - -exports.addExtension = addExtension; -exports.attachScopes = attachScopes; -exports.createFilter = createFilter; -exports.dataToEsm = dataToEsm; -exports.default = index; -exports.extractAssignedNames = extractAssignedNames; -exports.makeLegalIdentifier = makeLegalIdentifier; -exports.normalizePath = normalizePath; diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/index.js b/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/index.js deleted file mode 100644 index a67f9f0c3..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/index.js +++ /dev/null @@ -1,453 +0,0 @@ -import { extname, win32, posix, isAbsolute, resolve } from 'path'; -import pm from 'picomatch'; - -const addExtension = function addExtension(filename, ext = '.js') { - let result = `${filename}`; - if (!extname(filename)) - result += ext; - return result; -}; - -class WalkerBase {constructor() { WalkerBase.prototype.__init.call(this);WalkerBase.prototype.__init2.call(this);WalkerBase.prototype.__init3.call(this);WalkerBase.prototype.__init4.call(this); } - __init() {this.should_skip = false;} - __init2() {this.should_remove = false;} - __init3() {this.replacement = null;} - - __init4() {this.context = { - skip: () => (this.should_skip = true), - remove: () => (this.should_remove = true), - replace: (node) => (this.replacement = node) - };} - - replace(parent, prop, index, node) { - if (parent) { - if (index !== null) { - parent[prop][index] = node; - } else { - parent[prop] = node; - } - } - } - - remove(parent, prop, index) { - if (parent) { - if (index !== null) { - parent[prop].splice(index, 1); - } else { - delete parent[prop]; - } - } - } -} - -class SyncWalkerClass extends WalkerBase { - - - - constructor(walker) { - super(); - this.enter = walker.enter; - this.leave = walker.leave; - } - - visit( - node, - parent, - enter, - leave, - prop, - index - ) { - if (node) { - if (enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = (node )[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!this.visit(value[i], node, enter, leave, key, i)) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - this.visit(value, node, enter, leave, key, null); - } - } - - if (leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} - -function walk(ast, walker) { - const instance = new SyncWalkerClass(walker); - return instance.visit(ast, null, walker.enter, walker.leave); -} - -const extractors = { - ArrayPattern(names, param) { - for (const element of param.elements) { - if (element) - extractors[element.type](names, element); - } - }, - AssignmentPattern(names, param) { - extractors[param.left.type](names, param.left); - }, - Identifier(names, param) { - names.push(param.name); - }, - MemberExpression() { }, - ObjectPattern(names, param) { - for (const prop of param.properties) { - // @ts-ignore Typescript reports that this is not a valid type - if (prop.type === 'RestElement') { - extractors.RestElement(names, prop); - } - else { - extractors[prop.value.type](names, prop.value); - } - } - }, - RestElement(names, param) { - extractors[param.argument.type](names, param.argument); - } -}; -const extractAssignedNames = function extractAssignedNames(param) { - const names = []; - extractors[param.type](names, param); - return names; -}; - -const blockDeclarations = { - const: true, - let: true -}; -class Scope { - constructor(options = {}) { - this.parent = options.parent; - this.isBlockScope = !!options.block; - this.declarations = Object.create(null); - if (options.params) { - options.params.forEach((param) => { - extractAssignedNames(param).forEach((name) => { - this.declarations[name] = true; - }); - }); - } - } - addDeclaration(node, isBlockDeclaration, isVar) { - if (!isBlockDeclaration && this.isBlockScope) { - // it's a `var` or function node, and this - // is a block scope, so we need to go up - this.parent.addDeclaration(node, isBlockDeclaration, isVar); - } - else if (node.id) { - extractAssignedNames(node.id).forEach((name) => { - this.declarations[name] = true; - }); - } - } - contains(name) { - return this.declarations[name] || (this.parent ? this.parent.contains(name) : false); - } -} -const attachScopes = function attachScopes(ast, propertyName = 'scope') { - let scope = new Scope(); - walk(ast, { - enter(n, parent) { - const node = n; - // function foo () {...} - // class Foo {...} - if (/(Function|Class)Declaration/.test(node.type)) { - scope.addDeclaration(node, false, false); - } - // var foo = 1 - if (node.type === 'VariableDeclaration') { - const { kind } = node; - const isBlockDeclaration = blockDeclarations[kind]; - node.declarations.forEach((declaration) => { - scope.addDeclaration(declaration, isBlockDeclaration, true); - }); - } - let newScope; - // create new function scope - if (/Function/.test(node.type)) { - const func = node; - newScope = new Scope({ - parent: scope, - block: false, - params: func.params - }); - // named function expressions - the name is considered - // part of the function's scope - if (func.type === 'FunctionExpression' && func.id) { - newScope.addDeclaration(func, false, false); - } - } - // create new for scope - if (/For(In|Of)?Statement/.test(node.type)) { - newScope = new Scope({ - parent: scope, - block: true - }); - } - // create new block scope - if (node.type === 'BlockStatement' && !/Function/.test(parent.type)) { - newScope = new Scope({ - parent: scope, - block: true - }); - } - // catch clause has its own block scope - if (node.type === 'CatchClause') { - newScope = new Scope({ - parent: scope, - params: node.param ? [node.param] : [], - block: true - }); - } - if (newScope) { - Object.defineProperty(node, propertyName, { - value: newScope, - configurable: true - }); - scope = newScope; - } - }, - leave(n) { - const node = n; - if (node[propertyName]) - scope = scope.parent; - } - }); - return scope; -}; - -// Helper since Typescript can't detect readonly arrays with Array.isArray -function isArray(arg) { - return Array.isArray(arg); -} -function ensureArray(thing) { - if (isArray(thing)) - return thing; - if (thing == null) - return []; - return [thing]; -} - -const normalizePath = function normalizePath(filename) { - return filename.split(win32.sep).join(posix.sep); -}; - -function getMatcherString(id, resolutionBase) { - if (resolutionBase === false || isAbsolute(id) || id.startsWith('*')) { - return id; - } - // resolve('') is valid and will default to process.cwd() - const basePath = normalizePath(resolve(resolutionBase || '')) - // escape all possible (posix + win) path characters that might interfere with regex - .replace(/[-^$*+?.()|[\]{}]/g, '\\$&'); - // Note that we use posix.join because: - // 1. the basePath has been normalized to use / - // 2. the incoming glob (id) matcher, also uses / - // otherwise Node will force backslash (\) on windows - return posix.join(basePath, id); -} -const createFilter = function createFilter(include, exclude, options) { - const resolutionBase = options && options.resolve; - const getMatcher = (id) => id instanceof RegExp - ? id - : { - test: (what) => { - // this refactor is a tad overly verbose but makes for easy debugging - const pattern = getMatcherString(id, resolutionBase); - const fn = pm(pattern, { dot: true }); - const result = fn(what); - return result; - } - }; - const includeMatchers = ensureArray(include).map(getMatcher); - const excludeMatchers = ensureArray(exclude).map(getMatcher); - return function result(id) { - if (typeof id !== 'string') - return false; - if (/\0/.test(id)) - return false; - const pathId = normalizePath(id); - for (let i = 0; i < excludeMatchers.length; ++i) { - const matcher = excludeMatchers[i]; - if (matcher.test(pathId)) - return false; - } - for (let i = 0; i < includeMatchers.length; ++i) { - const matcher = includeMatchers[i]; - if (matcher.test(pathId)) - return true; - } - return !includeMatchers.length; - }; -}; - -const reservedWords = 'break case class catch const continue debugger default delete do else export extends finally for function if import in instanceof let new return super switch this throw try typeof var void while with yield enum await implements package protected static interface private public'; -const builtins = 'arguments Infinity NaN undefined null true false eval uneval isFinite isNaN parseFloat parseInt decodeURI decodeURIComponent encodeURI encodeURIComponent escape unescape Object Function Boolean Symbol Error EvalError InternalError RangeError ReferenceError SyntaxError TypeError URIError Number Math Date String RegExp Array Int8Array Uint8Array Uint8ClampedArray Int16Array Uint16Array Int32Array Uint32Array Float32Array Float64Array Map Set WeakMap WeakSet SIMD ArrayBuffer DataView JSON Promise Generator GeneratorFunction Reflect Proxy Intl'; -const forbiddenIdentifiers = new Set(`${reservedWords} ${builtins}`.split(' ')); -forbiddenIdentifiers.add(''); -const makeLegalIdentifier = function makeLegalIdentifier(str) { - let identifier = str - .replace(/-(\w)/g, (_, letter) => letter.toUpperCase()) - .replace(/[^$_a-zA-Z0-9]/g, '_'); - if (/\d/.test(identifier[0]) || forbiddenIdentifiers.has(identifier)) { - identifier = `_${identifier}`; - } - return identifier || '_'; -}; - -function stringify(obj) { - return (JSON.stringify(obj) || 'undefined').replace(/[\u2028\u2029]/g, (char) => `\\u${`000${char.charCodeAt(0).toString(16)}`.slice(-4)}`); -} -function serializeArray(arr, indent, baseIndent) { - let output = '['; - const separator = indent ? `\n${baseIndent}${indent}` : ''; - for (let i = 0; i < arr.length; i++) { - const key = arr[i]; - output += `${i > 0 ? ',' : ''}${separator}${serialize(key, indent, baseIndent + indent)}`; - } - return `${output}${indent ? `\n${baseIndent}` : ''}]`; -} -function serializeObject(obj, indent, baseIndent) { - let output = '{'; - const separator = indent ? `\n${baseIndent}${indent}` : ''; - const entries = Object.entries(obj); - for (let i = 0; i < entries.length; i++) { - const [key, value] = entries[i]; - const stringKey = makeLegalIdentifier(key) === key ? key : stringify(key); - output += `${i > 0 ? ',' : ''}${separator}${stringKey}:${indent ? ' ' : ''}${serialize(value, indent, baseIndent + indent)}`; - } - return `${output}${indent ? `\n${baseIndent}` : ''}}`; -} -function serialize(obj, indent, baseIndent) { - if (obj === Infinity) - return 'Infinity'; - if (obj === -Infinity) - return '-Infinity'; - if (obj === 0 && 1 / obj === -Infinity) - return '-0'; - if (obj instanceof Date) - return `new Date(${obj.getTime()})`; - if (obj instanceof RegExp) - return obj.toString(); - if (obj !== obj) - return 'NaN'; // eslint-disable-line no-self-compare - if (Array.isArray(obj)) - return serializeArray(obj, indent, baseIndent); - if (obj === null) - return 'null'; - if (typeof obj === 'object') - return serializeObject(obj, indent, baseIndent); - return stringify(obj); -} -const dataToEsm = function dataToEsm(data, options = {}) { - const t = options.compact ? '' : 'indent' in options ? options.indent : '\t'; - const _ = options.compact ? '' : ' '; - const n = options.compact ? '' : '\n'; - const declarationType = options.preferConst ? 'const' : 'var'; - if (options.namedExports === false || - typeof data !== 'object' || - Array.isArray(data) || - data instanceof Date || - data instanceof RegExp || - data === null) { - const code = serialize(data, options.compact ? null : t, ''); - const magic = _ || (/^[{[\-\/]/.test(code) ? '' : ' '); // eslint-disable-line no-useless-escape - return `export default${magic}${code};`; - } - let namedExportCode = ''; - const defaultExportRows = []; - for (const [key, value] of Object.entries(data)) { - if (key === makeLegalIdentifier(key)) { - if (options.objectShorthand) - defaultExportRows.push(key); - else - defaultExportRows.push(`${key}:${_}${key}`); - namedExportCode += `export ${declarationType} ${key}${_}=${_}${serialize(value, options.compact ? null : t, '')};${n}`; - } - else { - defaultExportRows.push(`${stringify(key)}:${_}${serialize(value, options.compact ? null : t, '')}`); - } - } - return `${namedExportCode}export default${_}{${n}${t}${defaultExportRows.join(`,${n}${t}`)}${n}};${n}`; -}; - -// TODO: remove this in next major -var index = { - addExtension, - attachScopes, - createFilter, - dataToEsm, - extractAssignedNames, - makeLegalIdentifier, - normalizePath -}; - -export default index; -export { addExtension, attachScopes, createFilter, dataToEsm, extractAssignedNames, makeLegalIdentifier, normalizePath }; diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/package.json b/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/package.json deleted file mode 100644 index 7c34deb58..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/dist/es/package.json +++ /dev/null @@ -1 +0,0 @@ -{"type":"module"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/package.json b/packages/taro-runtime/node_modules/@rollup/pluginutils/package.json deleted file mode 100644 index c08bde8b8..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/package.json +++ /dev/null @@ -1,92 +0,0 @@ -{ - "name": "@rollup/pluginutils", - "version": "4.1.1", - "publishConfig": { - "access": "public" - }, - "description": "A set of utility functions commonly used by Rollup plugins", - "license": "MIT", - "repository": { - "url": "rollup/plugins", - "directory": "packages/pluginutils" - }, - "author": "Rich Harris ", - "homepage": "https://github.com/rollup/plugins/tree/master/packages/pluginutils#readme", - "bugs": { - "url": "https://github.com/rollup/plugins/issues" - }, - "main": "./dist/cjs/index.js", - "module": "./dist/es/index.js", - "type": "commonjs", - "exports": { - "require": "./dist/cjs/index.js", - "import": "./dist/es/index.js" - }, - "engines": { - "node": ">= 8.0.0" - }, - "scripts": { - "build": "rollup -c", - "ci:coverage": "nyc pnpm test && nyc report --reporter=text-lcov > coverage.lcov", - "ci:lint": "pnpm build && pnpm lint", - "ci:lint:commits": "commitlint --from=${CIRCLE_BRANCH} --to=${CIRCLE_SHA1}", - "ci:test": "pnpm test -- --verbose", - "prebuild": "del-cli dist", - "prepare": "if [ ! -d 'dist' ]; then pnpm build; fi", - "prerelease": "pnpm build", - "pretest": "pnpm build -- --sourcemap", - "release": "pnpm plugin:release --workspace-root -- --pkg $npm_package_name", - "test": "ava", - "test:ts": "tsc --noEmit" - }, - "files": [ - "dist", - "types", - "README.md", - "LICENSE" - ], - "keywords": [ - "rollup", - "plugin", - "utils" - ], - "dependencies": { - "estree-walker": "^2.0.1", - "picomatch": "^2.2.2" - }, - "devDependencies": { - "@rollup/plugin-commonjs": "^14.0.0", - "@rollup/plugin-node-resolve": "^8.4.0", - "@rollup/plugin-typescript": "^5.0.2", - "@types/estree": "0.0.45", - "@types/node": "^14.0.26", - "@types/picomatch": "^2.2.1", - "acorn": "^8.0.4", - "rollup": "^2.23.0", - "typescript": "^4.1.2" - }, - "types": "types/index.d.ts", - "ava": { - "babel": { - "compileEnhancements": false - }, - "extensions": [ - "ts" - ], - "require": [ - "ts-node/register" - ], - "files": [ - "!**/fixtures/**", - "!**/helpers/**", - "!**/recipes/**", - "!**/types.ts" - ] - }, - "nyc": { - "extension": [ - ".js", - ".ts" - ] - } -} diff --git a/packages/taro-runtime/node_modules/@rollup/pluginutils/types/index.d.ts b/packages/taro-runtime/node_modules/@rollup/pluginutils/types/index.d.ts deleted file mode 100755 index 39f7ab87a..000000000 --- a/packages/taro-runtime/node_modules/@rollup/pluginutils/types/index.d.ts +++ /dev/null @@ -1,93 +0,0 @@ -// eslint-disable-next-line import/no-unresolved -import { BaseNode } from 'estree'; - -export interface AttachedScope { - parent?: AttachedScope; - isBlockScope: boolean; - declarations: { [key: string]: boolean }; - addDeclaration(node: BaseNode, isBlockDeclaration: boolean, isVar: boolean): void; - contains(name: string): boolean; -} - -export interface DataToEsmOptions { - compact?: boolean; - indent?: string; - namedExports?: boolean; - objectShorthand?: boolean; - preferConst?: boolean; -} - -/** - * A valid `minimatch` pattern, or array of patterns. - */ -export type FilterPattern = ReadonlyArray | string | RegExp | null; - -/** - * Adds an extension to a module ID if one does not exist. - */ -export function addExtension(filename: string, ext?: string): string; - -/** - * Attaches `Scope` objects to the relevant nodes of an AST. - * Each `Scope` object has a `scope.contains(name)` method that returns `true` - * if a given name is defined in the current scope or a parent scope. - */ -export function attachScopes(ast: BaseNode, propertyName?: string): AttachedScope; - -/** - * Constructs a filter function which can be used to determine whether or not - * certain modules should be operated upon. - * @param include If `include` is omitted or has zero length, filter will return `true` by default. - * @param exclude ID must not match any of the `exclude` patterns. - * @param options Optionally resolves the patterns against a directory other than `process.cwd()`. - * If a `string` is specified, then the value will be used as the base directory. - * Relative paths will be resolved against `process.cwd()` first. - * If `false`, then the patterns will not be resolved against any directory. - * This can be useful if you want to create a filter for virtual module names. - */ -export function createFilter( - include?: FilterPattern, - exclude?: FilterPattern, - options?: { resolve?: string | false | null } -): (id: string | unknown) => boolean; - -/** - * Transforms objects into tree-shakable ES Module imports. - * @param data An object to transform into an ES module. - */ -export function dataToEsm(data: unknown, options?: DataToEsmOptions): string; - -/** - * Extracts the names of all assignment targets based upon specified patterns. - * @param param An `acorn` AST Node. - */ -export function extractAssignedNames(param: BaseNode): string[]; - -/** - * Constructs a bundle-safe identifier from a `string`. - */ -export function makeLegalIdentifier(str: string): string; - -/** - * Converts path separators to forward slash. - */ -export function normalizePath(filename: string): string; - -export type AddExtension = typeof addExtension; -export type AttachScopes = typeof attachScopes; -export type CreateFilter = typeof createFilter; -export type ExtractAssignedNames = typeof extractAssignedNames; -export type MakeLegalIdentifier = typeof makeLegalIdentifier; -export type NormalizePath = typeof normalizePath; -export type DataToEsm = typeof dataToEsm; - -declare const defaultExport: { - addExtension: AddExtension; - attachScopes: AttachScopes; - createFilter: CreateFilter; - dataToEsm: DataToEsm; - extractAssignedNames: ExtractAssignedNames; - makeLegalIdentifier: MakeLegalIdentifier; - normalizePath: NormalizePath; -}; -export default defaultExport; diff --git a/packages/taro-runtime/node_modules/estree-walker/CHANGELOG.md b/packages/taro-runtime/node_modules/estree-walker/CHANGELOG.md deleted file mode 100644 index 20e8c7eac..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/CHANGELOG.md +++ /dev/null @@ -1,92 +0,0 @@ -# changelog - -## 2.0.2 - -* Internal tidying up (change test runner, convert to JS) - -## 2.0.1 - -* Robustify `this.remove()`, pass current index to walker functions ([#18](https://github.com/Rich-Harris/estree-walker/pull/18)) - -## 2.0.0 - -* Add an `asyncWalk` export ([#20](https://github.com/Rich-Harris/estree-walker/pull/20)) -* Internal rewrite - -## 1.0.1 - -* Relax node type to `BaseNode` ([#17](https://github.com/Rich-Harris/estree-walker/pull/17)) - -## 1.0.0 - -* Don't cache child keys - -## 0.9.0 - -* Add `this.remove()` method - -## 0.8.1 - -* Fix pkg.files - -## 0.8.0 - -* Adopt `estree` types - -## 0.7.0 - -* Add a `this.replace(node)` method - -## 0.6.1 - -* Only traverse nodes that exist and have a type ([#9](https://github.com/Rich-Harris/estree-walker/pull/9)) -* Only cache keys for nodes with a type ([#8](https://github.com/Rich-Harris/estree-walker/pull/8)) - -## 0.6.0 - -* Fix walker context type -* Update deps, remove unncessary Bublé transformation - -## 0.5.2 - -* Add types to package - -## 0.5.1 - -* Prevent context corruption when `walk()` is called during a walk - -## 0.5.0 - -* Export `childKeys`, for manually fixing in case of malformed ASTs - -## 0.4.0 - -* Add TypeScript typings ([#3](https://github.com/Rich-Harris/estree-walker/pull/3)) - -## 0.3.1 - -* Include `pkg.repository` ([#2](https://github.com/Rich-Harris/estree-walker/pull/2)) - -## 0.3.0 - -* More predictable ordering - -## 0.2.1 - -* Keep `context` shape - -## 0.2.0 - -* Add ES6 build - -## 0.1.3 - -* npm snafu - -## 0.1.2 - -* Pass current prop and index to `enter`/`leave` callbacks - -## 0.1.1 - -* First release diff --git a/packages/taro-runtime/node_modules/estree-walker/LICENSE b/packages/taro-runtime/node_modules/estree-walker/LICENSE deleted file mode 100644 index 63b62098e..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/LICENSE +++ /dev/null @@ -1,7 +0,0 @@ -Copyright (c) 2015-20 [these people](https://github.com/Rich-Harris/estree-walker/graphs/contributors) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/estree-walker/README.md b/packages/taro-runtime/node_modules/estree-walker/README.md deleted file mode 100644 index d877af36d..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/README.md +++ /dev/null @@ -1,48 +0,0 @@ -# estree-walker - -Simple utility for walking an [ESTree](https://github.com/estree/estree)-compliant AST, such as one generated by [acorn](https://github.com/marijnh/acorn). - - -## Installation - -```bash -npm i estree-walker -``` - - -## Usage - -```js -var walk = require( 'estree-walker' ).walk; -var acorn = require( 'acorn' ); - -ast = acorn.parse( sourceCode, options ); // https://github.com/acornjs/acorn - -walk( ast, { - enter: function ( node, parent, prop, index ) { - // some code happens - }, - leave: function ( node, parent, prop, index ) { - // some code happens - } -}); -``` - -Inside the `enter` function, calling `this.skip()` will prevent the node's children being walked, or the `leave` function (which is optional) being called. - -Call `this.replace(new_node)` in either `enter` or `leave` to replace the current node with a new one. - -Call `this.remove()` in either `enter` or `leave` to remove the current node. - -## Why not use estraverse? - -The ESTree spec is evolving to accommodate ES6/7. I've had a couple of experiences where [estraverse](https://github.com/estools/estraverse) was unable to handle an AST generated by recent versions of acorn, because it hard-codes visitor keys. - -estree-walker, by contrast, simply enumerates a node's properties to find child nodes (and child lists of nodes), and is therefore resistant to spec changes. It's also much smaller. (The performance, if you're wondering, is basically identical.) - -None of which should be taken as criticism of estraverse, which has more features and has been battle-tested in many more situations, and for which I'm very grateful. - - -## License - -MIT diff --git a/packages/taro-runtime/node_modules/estree-walker/dist/esm/estree-walker.js b/packages/taro-runtime/node_modules/estree-walker/dist/esm/estree-walker.js deleted file mode 100644 index a0beeeb42..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/dist/esm/estree-walker.js +++ /dev/null @@ -1,333 +0,0 @@ -// @ts-check -/** @typedef { import('estree').BaseNode} BaseNode */ - -/** @typedef {{ - skip: () => void; - remove: () => void; - replace: (node: BaseNode) => void; -}} WalkerContext */ - -class WalkerBase { - constructor() { - /** @type {boolean} */ - this.should_skip = false; - - /** @type {boolean} */ - this.should_remove = false; - - /** @type {BaseNode | null} */ - this.replacement = null; - - /** @type {WalkerContext} */ - this.context = { - skip: () => (this.should_skip = true), - remove: () => (this.should_remove = true), - replace: (node) => (this.replacement = node) - }; - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - * @param {BaseNode} node - */ - replace(parent, prop, index, node) { - if (parent) { - if (index !== null) { - parent[prop][index] = node; - } else { - parent[prop] = node; - } - } - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - */ - remove(parent, prop, index) { - if (parent) { - if (index !== null) { - parent[prop].splice(index, 1); - } else { - delete parent[prop]; - } - } - } -} - -// @ts-check - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker.js').WalkerContext} WalkerContext */ - -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => void} SyncHandler */ - -class SyncWalker extends WalkerBase { - /** - * - * @param {SyncHandler} enter - * @param {SyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {SyncHandler} */ - this.enter = enter; - - /** @type {SyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {BaseNode} - */ - visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!this.visit(value[i], node, key, i)) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} - -// @ts-check - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker').WalkerContext} WalkerContext */ - -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => Promise} AsyncHandler */ - -class AsyncWalker extends WalkerBase { - /** - * - * @param {AsyncHandler} enter - * @param {AsyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {AsyncHandler} */ - this.enter = enter; - - /** @type {AsyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {Promise} - */ - async visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - await this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!(await this.visit(value[i], node, key, i))) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - await this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - await this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} - -// @ts-check - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./sync.js').SyncHandler} SyncHandler */ -/** @typedef { import('./async.js').AsyncHandler} AsyncHandler */ - -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: SyncHandler - * leave?: SyncHandler - * }} walker - * @returns {BaseNode} - */ -function walk(ast, { enter, leave }) { - const instance = new SyncWalker(enter, leave); - return instance.visit(ast, null); -} - -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: AsyncHandler - * leave?: AsyncHandler - * }} walker - * @returns {Promise} - */ -async function asyncWalk(ast, { enter, leave }) { - const instance = new AsyncWalker(enter, leave); - return await instance.visit(ast, null); -} - -export { asyncWalk, walk }; diff --git a/packages/taro-runtime/node_modules/estree-walker/dist/esm/package.json b/packages/taro-runtime/node_modules/estree-walker/dist/esm/package.json deleted file mode 100644 index 7c34deb58..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/dist/esm/package.json +++ /dev/null @@ -1 +0,0 @@ -{"type":"module"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/estree-walker/dist/umd/estree-walker.js b/packages/taro-runtime/node_modules/estree-walker/dist/umd/estree-walker.js deleted file mode 100644 index 46fed0f99..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/dist/umd/estree-walker.js +++ /dev/null @@ -1,344 +0,0 @@ -(function (global, factory) { - typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : - typeof define === 'function' && define.amd ? define(['exports'], factory) : - (global = global || self, factory(global.estreeWalker = {})); -}(this, (function (exports) { 'use strict'; - - // @ts-check - /** @typedef { import('estree').BaseNode} BaseNode */ - - /** @typedef {{ - skip: () => void; - remove: () => void; - replace: (node: BaseNode) => void; - }} WalkerContext */ - - class WalkerBase { - constructor() { - /** @type {boolean} */ - this.should_skip = false; - - /** @type {boolean} */ - this.should_remove = false; - - /** @type {BaseNode | null} */ - this.replacement = null; - - /** @type {WalkerContext} */ - this.context = { - skip: () => (this.should_skip = true), - remove: () => (this.should_remove = true), - replace: (node) => (this.replacement = node) - }; - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - * @param {BaseNode} node - */ - replace(parent, prop, index, node) { - if (parent) { - if (index !== null) { - parent[prop][index] = node; - } else { - parent[prop] = node; - } - } - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - */ - remove(parent, prop, index) { - if (parent) { - if (index !== null) { - parent[prop].splice(index, 1); - } else { - delete parent[prop]; - } - } - } - } - - // @ts-check - - /** @typedef { import('estree').BaseNode} BaseNode */ - /** @typedef { import('./walker.js').WalkerContext} WalkerContext */ - - /** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => void} SyncHandler */ - - class SyncWalker extends WalkerBase { - /** - * - * @param {SyncHandler} enter - * @param {SyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {SyncHandler} */ - this.enter = enter; - - /** @type {SyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {BaseNode} - */ - visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!this.visit(value[i], node, key, i)) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } - } - - // @ts-check - - /** @typedef { import('estree').BaseNode} BaseNode */ - /** @typedef { import('./walker').WalkerContext} WalkerContext */ - - /** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => Promise} AsyncHandler */ - - class AsyncWalker extends WalkerBase { - /** - * - * @param {AsyncHandler} enter - * @param {AsyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {AsyncHandler} */ - this.enter = enter; - - /** @type {AsyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {Promise} - */ - async visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - await this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!(await this.visit(value[i], node, key, i))) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - await this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - await this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } - } - - // @ts-check - - /** @typedef { import('estree').BaseNode} BaseNode */ - /** @typedef { import('./sync.js').SyncHandler} SyncHandler */ - /** @typedef { import('./async.js').AsyncHandler} AsyncHandler */ - - /** - * - * @param {BaseNode} ast - * @param {{ - * enter?: SyncHandler - * leave?: SyncHandler - * }} walker - * @returns {BaseNode} - */ - function walk(ast, { enter, leave }) { - const instance = new SyncWalker(enter, leave); - return instance.visit(ast, null); - } - - /** - * - * @param {BaseNode} ast - * @param {{ - * enter?: AsyncHandler - * leave?: AsyncHandler - * }} walker - * @returns {Promise} - */ - async function asyncWalk(ast, { enter, leave }) { - const instance = new AsyncWalker(enter, leave); - return await instance.visit(ast, null); - } - - exports.asyncWalk = asyncWalk; - exports.walk = walk; - - Object.defineProperty(exports, '__esModule', { value: true }); - -}))); diff --git a/packages/taro-runtime/node_modules/estree-walker/package.json b/packages/taro-runtime/node_modules/estree-walker/package.json deleted file mode 100644 index f646eb546..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/package.json +++ /dev/null @@ -1,37 +0,0 @@ -{ - "name": "estree-walker", - "description": "Traverse an ESTree-compliant AST", - "version": "2.0.2", - "private": false, - "author": "Rich Harris", - "license": "MIT", - "repository": { - "type": "git", - "url": "https://github.com/Rich-Harris/estree-walker" - }, - "type": "commonjs", - "main": "./dist/umd/estree-walker.js", - "module": "./dist/esm/estree-walker.js", - "exports": { - "require": "./dist/umd/estree-walker.js", - "import": "./dist/esm/estree-walker.js" - }, - "types": "types/index.d.ts", - "scripts": { - "prepublishOnly": "npm run build && npm test", - "build": "tsc && rollup -c", - "test": "uvu test" - }, - "devDependencies": { - "@types/estree": "0.0.42", - "rollup": "^2.10.9", - "typescript": "^3.7.5", - "uvu": "^0.5.1" - }, - "files": [ - "src", - "dist", - "types", - "README.md" - ] -} diff --git a/packages/taro-runtime/node_modules/estree-walker/src/async.js b/packages/taro-runtime/node_modules/estree-walker/src/async.js deleted file mode 100644 index 54276b51f..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/src/async.js +++ /dev/null @@ -1,118 +0,0 @@ -// @ts-check -import { WalkerBase } from './walker.js'; - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker').WalkerContext} WalkerContext */ - -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => Promise} AsyncHandler */ - -export class AsyncWalker extends WalkerBase { - /** - * - * @param {AsyncHandler} enter - * @param {AsyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {AsyncHandler} */ - this.enter = enter; - - /** @type {AsyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {Promise} - */ - async visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - await this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!(await this.visit(value[i], node, key, i))) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - await this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - await this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} diff --git a/packages/taro-runtime/node_modules/estree-walker/src/index.js b/packages/taro-runtime/node_modules/estree-walker/src/index.js deleted file mode 100644 index dcf4c7205..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/src/index.js +++ /dev/null @@ -1,35 +0,0 @@ -// @ts-check -import { SyncWalker } from './sync.js'; -import { AsyncWalker } from './async.js'; - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./sync.js').SyncHandler} SyncHandler */ -/** @typedef { import('./async.js').AsyncHandler} AsyncHandler */ - -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: SyncHandler - * leave?: SyncHandler - * }} walker - * @returns {BaseNode} - */ -export function walk(ast, { enter, leave }) { - const instance = new SyncWalker(enter, leave); - return instance.visit(ast, null); -} - -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: AsyncHandler - * leave?: AsyncHandler - * }} walker - * @returns {Promise} - */ -export async function asyncWalk(ast, { enter, leave }) { - const instance = new AsyncWalker(enter, leave); - return await instance.visit(ast, null); -} diff --git a/packages/taro-runtime/node_modules/estree-walker/src/package.json b/packages/taro-runtime/node_modules/estree-walker/src/package.json deleted file mode 100644 index 1632c2c4d..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/src/package.json +++ /dev/null @@ -1 +0,0 @@ -{"type": "module"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/estree-walker/src/sync.js b/packages/taro-runtime/node_modules/estree-walker/src/sync.js deleted file mode 100644 index b3cea40ae..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/src/sync.js +++ /dev/null @@ -1,118 +0,0 @@ -// @ts-check -import { WalkerBase } from './walker.js'; - -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker.js').WalkerContext} WalkerContext */ - -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => void} SyncHandler */ - -export class SyncWalker extends WalkerBase { - /** - * - * @param {SyncHandler} enter - * @param {SyncHandler} leave - */ - constructor(enter, leave) { - super(); - - /** @type {SyncHandler} */ - this.enter = enter; - - /** @type {SyncHandler} */ - this.leave = leave; - } - - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {BaseNode} - */ - visit(node, parent, prop, index) { - if (node) { - if (this.enter) { - const _should_skip = this.should_skip; - const _should_remove = this.should_remove; - const _replacement = this.replacement; - this.should_skip = false; - this.should_remove = false; - this.replacement = null; - - this.enter.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const skipped = this.should_skip; - const removed = this.should_remove; - - this.should_skip = _should_skip; - this.should_remove = _should_remove; - this.replacement = _replacement; - - if (skipped) return node; - if (removed) return null; - } - - for (const key in node) { - const value = node[key]; - - if (typeof value !== "object") { - continue; - } else if (Array.isArray(value)) { - for (let i = 0; i < value.length; i += 1) { - if (value[i] !== null && typeof value[i].type === 'string') { - if (!this.visit(value[i], node, key, i)) { - // removed - i--; - } - } - } - } else if (value !== null && typeof value.type === "string") { - this.visit(value, node, key, null); - } - } - - if (this.leave) { - const _replacement = this.replacement; - const _should_remove = this.should_remove; - this.replacement = null; - this.should_remove = false; - - this.leave.call(this.context, node, parent, prop, index); - - if (this.replacement) { - node = this.replacement; - this.replace(parent, prop, index, node); - } - - if (this.should_remove) { - this.remove(parent, prop, index); - } - - const removed = this.should_remove; - - this.replacement = _replacement; - this.should_remove = _should_remove; - - if (removed) return null; - } - } - - return node; - } -} diff --git a/packages/taro-runtime/node_modules/estree-walker/src/walker.js b/packages/taro-runtime/node_modules/estree-walker/src/walker.js deleted file mode 100644 index 3555d88a4..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/src/walker.js +++ /dev/null @@ -1,61 +0,0 @@ -// @ts-check -/** @typedef { import('estree').BaseNode} BaseNode */ - -/** @typedef {{ - skip: () => void; - remove: () => void; - replace: (node: BaseNode) => void; -}} WalkerContext */ - -export class WalkerBase { - constructor() { - /** @type {boolean} */ - this.should_skip = false; - - /** @type {boolean} */ - this.should_remove = false; - - /** @type {BaseNode | null} */ - this.replacement = null; - - /** @type {WalkerContext} */ - this.context = { - skip: () => (this.should_skip = true), - remove: () => (this.should_remove = true), - replace: (node) => (this.replacement = node) - }; - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - * @param {BaseNode} node - */ - replace(parent, prop, index, node) { - if (parent) { - if (index !== null) { - parent[prop][index] = node; - } else { - parent[prop] = node; - } - } - } - - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - */ - remove(parent, prop, index) { - if (parent) { - if (index !== null) { - parent[prop].splice(index, 1); - } else { - delete parent[prop]; - } - } - } -} diff --git a/packages/taro-runtime/node_modules/estree-walker/types/async.d.ts b/packages/taro-runtime/node_modules/estree-walker/types/async.d.ts deleted file mode 100644 index c85bfdc5f..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/types/async.d.ts +++ /dev/null @@ -1,53 +0,0 @@ -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker').WalkerContext} WalkerContext */ -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => Promise} AsyncHandler */ -export class AsyncWalker extends WalkerBase { - /** - * - * @param {AsyncHandler} enter - * @param {AsyncHandler} leave - */ - constructor(enter: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise, leave: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise); - /** @type {AsyncHandler} */ - enter: AsyncHandler; - /** @type {AsyncHandler} */ - leave: AsyncHandler; - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {Promise} - */ - visit(node: import("estree").BaseNode, parent: import("estree").BaseNode, prop?: string, index?: number): Promise; - should_skip: any; - should_remove: any; - replacement: any; -} -export type BaseNode = import("estree").BaseNode; -export type WalkerContext = { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}; -export type AsyncHandler = (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise; -import { WalkerBase } from "./walker.js"; diff --git a/packages/taro-runtime/node_modules/estree-walker/types/index.d.ts b/packages/taro-runtime/node_modules/estree-walker/types/index.d.ts deleted file mode 100644 index dfc3277d5..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/types/index.d.ts +++ /dev/null @@ -1,56 +0,0 @@ -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./sync.js').SyncHandler} SyncHandler */ -/** @typedef { import('./async.js').AsyncHandler} AsyncHandler */ -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: SyncHandler - * leave?: SyncHandler - * }} walker - * @returns {BaseNode} - */ -export function walk(ast: import("estree").BaseNode, { enter, leave }: { - enter?: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void; - leave?: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void; -}): import("estree").BaseNode; -/** - * - * @param {BaseNode} ast - * @param {{ - * enter?: AsyncHandler - * leave?: AsyncHandler - * }} walker - * @returns {Promise} - */ -export function asyncWalk(ast: import("estree").BaseNode, { enter, leave }: { - enter?: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise; - leave?: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise; -}): Promise; -export type BaseNode = import("estree").BaseNode; -export type SyncHandler = (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void; -export type AsyncHandler = (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => Promise; diff --git a/packages/taro-runtime/node_modules/estree-walker/types/sync.d.ts b/packages/taro-runtime/node_modules/estree-walker/types/sync.d.ts deleted file mode 100644 index e9e4cc1ec..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/types/sync.d.ts +++ /dev/null @@ -1,53 +0,0 @@ -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef { import('./walker.js').WalkerContext} WalkerContext */ -/** @typedef {( - * this: WalkerContext, - * node: BaseNode, - * parent: BaseNode, - * key: string, - * index: number - * ) => void} SyncHandler */ -export class SyncWalker extends WalkerBase { - /** - * - * @param {SyncHandler} enter - * @param {SyncHandler} leave - */ - constructor(enter: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void, leave: (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; - }, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void); - /** @type {SyncHandler} */ - enter: SyncHandler; - /** @type {SyncHandler} */ - leave: SyncHandler; - /** - * - * @param {BaseNode} node - * @param {BaseNode} parent - * @param {string} [prop] - * @param {number} [index] - * @returns {BaseNode} - */ - visit(node: import("estree").BaseNode, parent: import("estree").BaseNode, prop?: string, index?: number): import("estree").BaseNode; - should_skip: any; - should_remove: any; - replacement: any; -} -export type BaseNode = import("estree").BaseNode; -export type WalkerContext = { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}; -export type SyncHandler = (this: { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}, node: import("estree").BaseNode, parent: import("estree").BaseNode, key: string, index: number) => void; -import { WalkerBase } from "./walker.js"; diff --git a/packages/taro-runtime/node_modules/estree-walker/types/tsconfig.tsbuildinfo b/packages/taro-runtime/node_modules/estree-walker/types/tsconfig.tsbuildinfo deleted file mode 100644 index 799022fa1..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/types/tsconfig.tsbuildinfo +++ /dev/null @@ -1,345 +0,0 @@ -{ - "program": { - "fileInfos": { - "../node_modules/typescript/lib/lib.es5.d.ts": { - "version": "fc43680ad3a1a4ec8c7b8d908af1ec9ddff87845346de5f02c735c9171fa98ea", - "signature": "fc43680ad3a1a4ec8c7b8d908af1ec9ddff87845346de5f02c735c9171fa98ea" - }, - "../node_modules/typescript/lib/lib.es2015.d.ts": { - "version": "7994d44005046d1413ea31d046577cdda33b8b2470f30281fd9c8b3c99fe2d96", - "signature": "7994d44005046d1413ea31d046577cdda33b8b2470f30281fd9c8b3c99fe2d96" - }, - "../node_modules/typescript/lib/lib.es2016.d.ts": { - "version": "5f217838d25704474d9ef93774f04164889169ca31475fe423a9de6758f058d1", - "signature": "5f217838d25704474d9ef93774f04164889169ca31475fe423a9de6758f058d1" - }, - "../node_modules/typescript/lib/lib.es2017.d.ts": { - "version": "459097c7bdd88fc5731367e56591e4f465f2c9de81a35427a7bd473165c34743", - "signature": "459097c7bdd88fc5731367e56591e4f465f2c9de81a35427a7bd473165c34743" - }, - "../node_modules/typescript/lib/lib.dom.d.ts": { - "version": "d93de5e8a7275cb9d47481410e13b3b1debb997e216490954b5d106e37e086de", - "signature": "d93de5e8a7275cb9d47481410e13b3b1debb997e216490954b5d106e37e086de" - }, - "../node_modules/typescript/lib/lib.dom.iterable.d.ts": { - "version": "8329c3401aa8708426c7760f14219170f69a2cb77e4519758cec6f5027270faf", - "signature": "8329c3401aa8708426c7760f14219170f69a2cb77e4519758cec6f5027270faf" - }, - "../node_modules/typescript/lib/lib.webworker.importscripts.d.ts": { - "version": "fe4e59403e34c7ff747abe4ff6abbc7718229556d7c1a5b93473fb53156c913b", - "signature": "fe4e59403e34c7ff747abe4ff6abbc7718229556d7c1a5b93473fb53156c913b" - }, - "../node_modules/typescript/lib/lib.scripthost.d.ts": { - "version": "b9faa17292f17d2ad75e34fac77dd63a6403af1dba02d39cd0cbb9ffdf3de8b9", - "signature": "b9faa17292f17d2ad75e34fac77dd63a6403af1dba02d39cd0cbb9ffdf3de8b9" - }, - "../node_modules/typescript/lib/lib.es2015.core.d.ts": { - "version": "734ddc145e147fbcd55f07d034f50ccff1086f5a880107665ec326fb368876f6", - "signature": "734ddc145e147fbcd55f07d034f50ccff1086f5a880107665ec326fb368876f6" - }, - "../node_modules/typescript/lib/lib.es2015.collection.d.ts": { - "version": "4a0862a21f4700de873db3b916f70e41570e2f558da77d2087c9490f5a0615d8", - "signature": "4a0862a21f4700de873db3b916f70e41570e2f558da77d2087c9490f5a0615d8" - }, - "../node_modules/typescript/lib/lib.es2015.generator.d.ts": { - "version": "765e0e9c9d74cf4d031ca8b0bdb269a853e7d81eda6354c8510218d03db12122", - "signature": "765e0e9c9d74cf4d031ca8b0bdb269a853e7d81eda6354c8510218d03db12122" - }, - "../node_modules/typescript/lib/lib.es2015.iterable.d.ts": { - "version": "285958e7699f1babd76d595830207f18d719662a0c30fac7baca7df7162a9210", - "signature": "285958e7699f1babd76d595830207f18d719662a0c30fac7baca7df7162a9210" - }, - "../node_modules/typescript/lib/lib.es2015.promise.d.ts": { - "version": "d4deaafbb18680e3143e8b471acd650ed6f72a408a33137f0a0dd104fbe7f8ca", - "signature": "d4deaafbb18680e3143e8b471acd650ed6f72a408a33137f0a0dd104fbe7f8ca" - }, - "../node_modules/typescript/lib/lib.es2015.proxy.d.ts": { - "version": "5e72f949a89717db444e3bd9433468890068bb21a5638d8ab15a1359e05e54fe", - "signature": "5e72f949a89717db444e3bd9433468890068bb21a5638d8ab15a1359e05e54fe" - }, - "../node_modules/typescript/lib/lib.es2015.reflect.d.ts": { - "version": "f5b242136ae9bfb1cc99a5971cccc44e99947ae6b5ef6fd8aa54b5ade553b976", - "signature": "f5b242136ae9bfb1cc99a5971cccc44e99947ae6b5ef6fd8aa54b5ade553b976" - }, - "../node_modules/typescript/lib/lib.es2015.symbol.d.ts": { - "version": "9ae2860252d6b5f16e2026d8a2c2069db7b2a3295e98b6031d01337b96437230", - "signature": "9ae2860252d6b5f16e2026d8a2c2069db7b2a3295e98b6031d01337b96437230" - }, - "../node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts": { - "version": "3e0a459888f32b42138d5a39f706ff2d55d500ab1031e0988b5568b0f67c2303", - "signature": "3e0a459888f32b42138d5a39f706ff2d55d500ab1031e0988b5568b0f67c2303" - }, - "../node_modules/typescript/lib/lib.es2016.array.include.d.ts": { - "version": "3f96f1e570aedbd97bf818c246727151e873125d0512e4ae904330286c721bc0", - "signature": "3f96f1e570aedbd97bf818c246727151e873125d0512e4ae904330286c721bc0" - }, - "../node_modules/typescript/lib/lib.es2017.object.d.ts": { - "version": "c2d60b2e558d44384e4704b00e6b3d154334721a911f094d3133c35f0917b408", - "signature": "c2d60b2e558d44384e4704b00e6b3d154334721a911f094d3133c35f0917b408" - }, - "../node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts": { - "version": "b8667586a618c5cf64523d4e500ae39e781428abfb28f3de441fc66b56144b6f", - "signature": "b8667586a618c5cf64523d4e500ae39e781428abfb28f3de441fc66b56144b6f" - }, - "../node_modules/typescript/lib/lib.es2017.string.d.ts": { - "version": "21df2e0059f14dcb4c3a0e125859f6b6ff01332ee24b0065a741d121250bc71c", - "signature": "21df2e0059f14dcb4c3a0e125859f6b6ff01332ee24b0065a741d121250bc71c" - }, - "../node_modules/typescript/lib/lib.es2017.intl.d.ts": { - "version": "c1759cb171c7619af0d2234f2f8fb2a871ee88e956e2ed91bb61778e41f272c6", - "signature": "c1759cb171c7619af0d2234f2f8fb2a871ee88e956e2ed91bb61778e41f272c6" - }, - "../node_modules/typescript/lib/lib.es2017.typedarrays.d.ts": { - "version": "28569d59e07d4378cb3d54979c4c60f9f06305c9bb6999ffe6cab758957adc46", - "signature": "28569d59e07d4378cb3d54979c4c60f9f06305c9bb6999ffe6cab758957adc46" - }, - "../node_modules/typescript/lib/lib.es2017.full.d.ts": { - "version": "873c09f1c309389742d98b7b67419a8e0a5fa6f10ce59fd5149ecd31a2818594", - "signature": "873c09f1c309389742d98b7b67419a8e0a5fa6f10ce59fd5149ecd31a2818594" - }, - "../node_modules/@types/estree/index.d.ts": { - "version": "c2efad8a2f2d7fb931ff15c7959fb45340e74684cd665ddf0cbf9b3977be1644", - "signature": "c2efad8a2f2d7fb931ff15c7959fb45340e74684cd665ddf0cbf9b3977be1644" - }, - "../src/walker.js": { - "version": "4cc9d0e334d83a4cebeeac502de37a1aeeb953f6d4145a886d9eecea1f2142a7", - "signature": "075872468ccc19c83b03fd717fc9305b5f8ec09592210cf60279cb13eca2bd70" - }, - "../src/async.js": { - "version": "904efd145090ac40c3c98f29cc928332898a62ab642dd5921db2ae249bfe014a", - "signature": "da428f781d6dc6dfd4f4afd0dd5f25a780897dc8b57e5b30462491b7d08f32c0" - }, - "../src/sync.js": { - "version": "85bb22b85042f0a3717d8fac2fc8f62af16894652be34d1e08eb3e63785535f5", - "signature": "5b131a727db18c956611a5e33d08217df96d0f2e0f26d98b804d1ec2407e59ae" - }, - "../src/index.js": { - "version": "99128f4c6cb79cb1e3abf3f2ba96faedd2b820aab4fd7f743aab0b8d710a73af", - "signature": "c52be5c79280bfcfcf359c084c6f2f70f405b0ad14dde96b6703dbc5ef2261f5" - } - }, - "options": { - "allowJs": true, - "target": 4, - "module": 99, - "types": [ - "estree" - ], - "declaration": true, - "declarationDir": "./", - "emitDeclarationOnly": true, - "outDir": "./", - "newLine": 1, - "noImplicitAny": true, - "noImplicitThis": true, - "incremental": true, - "configFilePath": "../tsconfig.json" - }, - "referencedMap": { - "../src/walker.js": [ - "../node_modules/@types/estree/index.d.ts" - ], - "../src/async.js": [ - "../src/walker.js", - "../node_modules/@types/estree/index.d.ts" - ], - "../src/sync.js": [ - "../src/walker.js", - "../node_modules/@types/estree/index.d.ts" - ], - "../src/index.js": [ - "../src/sync.js", - "../src/async.js", - "../node_modules/@types/estree/index.d.ts" - ] - }, - "exportedModulesMap": { - "../src/walker.js": [ - "../node_modules/@types/estree/index.d.ts" - ], - "../src/async.js": [ - "../node_modules/@types/estree/index.d.ts" - ], - "../src/sync.js": [ - "../node_modules/@types/estree/index.d.ts" - ], - "../src/index.js": [ - "../node_modules/@types/estree/index.d.ts" - ] - }, - "semanticDiagnosticsPerFile": [ - "../node_modules/typescript/lib/lib.es5.d.ts", - "../node_modules/typescript/lib/lib.es2015.d.ts", - "../node_modules/typescript/lib/lib.es2016.d.ts", - "../node_modules/typescript/lib/lib.es2017.d.ts", - "../node_modules/typescript/lib/lib.dom.d.ts", - "../node_modules/typescript/lib/lib.dom.iterable.d.ts", - "../node_modules/typescript/lib/lib.webworker.importscripts.d.ts", - "../node_modules/typescript/lib/lib.scripthost.d.ts", - "../node_modules/typescript/lib/lib.es2015.core.d.ts", - "../node_modules/typescript/lib/lib.es2015.collection.d.ts", - "../node_modules/typescript/lib/lib.es2015.generator.d.ts", - "../node_modules/typescript/lib/lib.es2015.iterable.d.ts", - "../node_modules/typescript/lib/lib.es2015.promise.d.ts", - "../node_modules/typescript/lib/lib.es2015.proxy.d.ts", - "../node_modules/typescript/lib/lib.es2015.reflect.d.ts", - "../node_modules/typescript/lib/lib.es2015.symbol.d.ts", - "../node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts", - "../node_modules/typescript/lib/lib.es2016.array.include.d.ts", - "../node_modules/typescript/lib/lib.es2017.object.d.ts", - "../node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts", - "../node_modules/typescript/lib/lib.es2017.string.d.ts", - "../node_modules/typescript/lib/lib.es2017.intl.d.ts", - "../node_modules/typescript/lib/lib.es2017.typedarrays.d.ts", - "../node_modules/typescript/lib/lib.es2017.full.d.ts", - "../node_modules/@types/estree/index.d.ts", - "../src/walker.js", - [ - "../src/async.js", - [ - { - "file": "../src/async.js", - "start": 864, - "length": 12, - "messageText": "'_should_skip' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 907, - "length": 14, - "messageText": "'_should_remove' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 954, - "length": 12, - "messageText": "'_replacement' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 991, - "length": 24, - "messageText": "'should_skip' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 1021, - "length": 26, - "messageText": "'should_remove' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 1053, - "length": 23, - "messageText": "'replacement' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/async.js", - "start": 1643, - "length": 9, - "code": 7053, - "category": 1, - "messageText": { - "messageText": "Element implicitly has an 'any' type because expression of type 'string' can't be used to index type 'BaseNode'.", - "category": 1, - "code": 7053, - "next": [ - { - "messageText": "No index signature with a parameter of type 'string' was found on type 'BaseNode'.", - "category": 1, - "code": 7054 - } - ] - } - } - ] - ], - [ - "../src/sync.js", - [ - { - "file": "../src/sync.js", - "start": 837, - "length": 12, - "messageText": "'_should_skip' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 880, - "length": 14, - "messageText": "'_should_remove' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 927, - "length": 12, - "messageText": "'_replacement' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 964, - "length": 24, - "messageText": "'should_skip' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 994, - "length": 26, - "messageText": "'should_remove' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 1026, - "length": 23, - "messageText": "'replacement' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer.", - "category": 1, - "code": 7022 - }, - { - "file": "../src/sync.js", - "start": 1610, - "length": 9, - "code": 7053, - "category": 1, - "messageText": { - "messageText": "Element implicitly has an 'any' type because expression of type 'string' can't be used to index type 'BaseNode'.", - "category": 1, - "code": 7053, - "next": [ - { - "messageText": "No index signature with a parameter of type 'string' was found on type 'BaseNode'.", - "category": 1, - "code": 7054 - } - ] - } - } - ] - ], - "../src/index.js" - ] - }, - "version": "3.7.5" -} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/estree-walker/types/walker.d.ts b/packages/taro-runtime/node_modules/estree-walker/types/walker.d.ts deleted file mode 100644 index 49d84416c..000000000 --- a/packages/taro-runtime/node_modules/estree-walker/types/walker.d.ts +++ /dev/null @@ -1,37 +0,0 @@ -/** @typedef { import('estree').BaseNode} BaseNode */ -/** @typedef {{ - skip: () => void; - remove: () => void; - replace: (node: BaseNode) => void; -}} WalkerContext */ -export class WalkerBase { - /** @type {boolean} */ - should_skip: boolean; - /** @type {boolean} */ - should_remove: boolean; - /** @type {BaseNode | null} */ - replacement: BaseNode | null; - /** @type {WalkerContext} */ - context: WalkerContext; - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - * @param {BaseNode} node - */ - replace(parent: any, prop: string, index: number, node: import("estree").BaseNode): void; - /** - * - * @param {any} parent - * @param {string} prop - * @param {number} index - */ - remove(parent: any, prop: string, index: number): void; -} -export type BaseNode = import("estree").BaseNode; -export type WalkerContext = { - skip: () => void; - remove: () => void; - replace: (node: import("estree").BaseNode) => void; -}; diff --git a/packages/taro-runtime/node_modules/find-cache-dir/index.js b/packages/taro-runtime/node_modules/find-cache-dir/index.js index e0a65353e..47865908a 100644 --- a/packages/taro-runtime/node_modules/find-cache-dir/index.js +++ b/packages/taro-runtime/node_modules/find-cache-dir/index.js @@ -43,7 +43,7 @@ function getNodeModuleDirectory(directory) { module.exports = (options = {}) => { if (env.CACHE_DIR && !['true', 'false', '1', '0'].includes(env.CACHE_DIR)) { - return useDirectory(path.join(env.CACHE_DIR, 'find-cache-dir'), options); + return useDirectory(path.join(env.CACHE_DIR, options.name), options); } let {cwd: directory = cwd()} = options; diff --git a/packages/taro-runtime/node_modules/find-cache-dir/package.json b/packages/taro-runtime/node_modules/find-cache-dir/package.json index f5ecd413f..4ca187a80 100644 --- a/packages/taro-runtime/node_modules/find-cache-dir/package.json +++ b/packages/taro-runtime/node_modules/find-cache-dir/package.json @@ -1,6 +1,6 @@ { "name": "find-cache-dir", - "version": "3.3.1", + "version": "3.3.2", "description": "Finds the common standard cache directory", "license": "MIT", "repository": "avajs/find-cache-dir", diff --git a/packages/taro-runtime/node_modules/find-cache-dir/readme.md b/packages/taro-runtime/node_modules/find-cache-dir/readme.md index a88d8dc2f..3bc03a815 100644 --- a/packages/taro-runtime/node_modules/find-cache-dir/readme.md +++ b/packages/taro-runtime/node_modules/find-cache-dir/readme.md @@ -1,4 +1,4 @@ -# find-cache-dir [![Build Status](https://travis-ci.org/avajs/find-cache-dir.svg?branch=master)](https://travis-ci.org/avajs/find-cache-dir) [![Coverage Status](https://coveralls.io/repos/github/avajs/find-cache-dir/badge.svg?branch=master)](https://coveralls.io/github/avajs/find-cache-dir?branch=master) +# find-cache-dir [![Coverage Status](https://codecov.io/gh/avajs/find-cache-dir/branch/master/graph/badge.svg)](https://codecov.io/gh/avajs/find-cache-dir/branch/master) > Finds the common standard cache directory @@ -103,13 +103,12 @@ This is helpful for actually putting actual files in the cache! ## Adopters -- [`AVA`](https://ava.li) +- [`ava`](https://avajs.dev) - [`nyc`](https://github.com/istanbuljs/nyc) -- [`Storybook`](https://storybook.js.org) +- [`storybook`](https://github.com/storybookjs/storybook) - [`babel-loader`](https://github.com/babel/babel-loader) - [`eslint-loader`](https://github.com/MoOx/eslint-loader) -- [`Phenomic`](https://phenomic.io) -- [`javascripthon-loader`](https://github.com/Beg-in/javascripthon-loader) +- [More…](https://www.npmjs.com/browse/depended/find-cache-dir) --- diff --git a/packages/taro-runtime/node_modules/find-up/index.d.ts b/packages/taro-runtime/node_modules/find-up/index.d.ts deleted file mode 100644 index 41e3192ae..000000000 --- a/packages/taro-runtime/node_modules/find-up/index.d.ts +++ /dev/null @@ -1,137 +0,0 @@ -import {Options as LocatePathOptions} from 'locate-path'; - -declare const stop: unique symbol; - -declare namespace findUp { - interface Options extends LocatePathOptions {} - - type StopSymbol = typeof stop; - - type Match = string | StopSymbol | undefined; -} - -declare const findUp: { - /** - Find a file or directory by walking up parent directories. - - @param name - Name of the file or directory to find. Can be multiple. - @returns The first path found (by respecting the order of `name`s) or `undefined` if none could be found. - - @example - ``` - // / - // └── Users - // └── sindresorhus - // ├── unicorn.png - // └── foo - // └── bar - // ├── baz - // └── example.js - - // example.js - import findUp = require('find-up'); - - (async () => { - console.log(await findUp('unicorn.png')); - //=> '/Users/sindresorhus/unicorn.png' - - console.log(await findUp(['rainbow.png', 'unicorn.png'])); - //=> '/Users/sindresorhus/unicorn.png' - })(); - ``` - */ - (name: string | string[], options?: findUp.Options): Promise; - - /** - Find a file or directory by walking up parent directories. - - @param matcher - Called for each directory in the search. Return a path or `findUp.stop` to stop the search. - @returns The first path found or `undefined` if none could be found. - - @example - ``` - import path = require('path'); - import findUp = require('find-up'); - - (async () => { - console.log(await findUp(async directory => { - const hasUnicorns = await findUp.exists(path.join(directory, 'unicorn.png')); - return hasUnicorns && directory; - }, {type: 'directory'})); - //=> '/Users/sindresorhus' - })(); - ``` - */ - (matcher: (directory: string) => (findUp.Match | Promise), options?: findUp.Options): Promise; - - sync: { - /** - Synchronously find a file or directory by walking up parent directories. - - @param name - Name of the file or directory to find. Can be multiple. - @returns The first path found (by respecting the order of `name`s) or `undefined` if none could be found. - */ - (name: string | string[], options?: findUp.Options): string | undefined; - - /** - Synchronously find a file or directory by walking up parent directories. - - @param matcher - Called for each directory in the search. Return a path or `findUp.stop` to stop the search. - @returns The first path found or `undefined` if none could be found. - - @example - ``` - import path = require('path'); - import findUp = require('find-up'); - - console.log(findUp.sync(directory => { - const hasUnicorns = findUp.sync.exists(path.join(directory, 'unicorn.png')); - return hasUnicorns && directory; - }, {type: 'directory'})); - //=> '/Users/sindresorhus' - ``` - */ - (matcher: (directory: string) => findUp.Match, options?: findUp.Options): string | undefined; - - /** - Synchronously check if a path exists. - - @param path - Path to the file or directory. - @returns Whether the path exists. - - @example - ``` - import findUp = require('find-up'); - - console.log(findUp.sync.exists('/Users/sindresorhus/unicorn.png')); - //=> true - ``` - */ - exists(path: string): boolean; - } - - /** - Check if a path exists. - - @param path - Path to a file or directory. - @returns Whether the path exists. - - @example - ``` - import findUp = require('find-up'); - - (async () => { - console.log(await findUp.exists('/Users/sindresorhus/unicorn.png')); - //=> true - })(); - ``` - */ - exists(path: string): Promise; - - /** - Return this in a `matcher` function to stop the search and force `findUp` to immediately return `undefined`. - */ - readonly stop: findUp.StopSymbol; -}; - -export = findUp; diff --git a/packages/taro-runtime/node_modules/find-up/index.js b/packages/taro-runtime/node_modules/find-up/index.js deleted file mode 100644 index ce564e5d3..000000000 --- a/packages/taro-runtime/node_modules/find-up/index.js +++ /dev/null @@ -1,89 +0,0 @@ -'use strict'; -const path = require('path'); -const locatePath = require('locate-path'); -const pathExists = require('path-exists'); - -const stop = Symbol('findUp.stop'); - -module.exports = async (name, options = {}) => { - let directory = path.resolve(options.cwd || ''); - const {root} = path.parse(directory); - const paths = [].concat(name); - - const runMatcher = async locateOptions => { - if (typeof name !== 'function') { - return locatePath(paths, locateOptions); - } - - const foundPath = await name(locateOptions.cwd); - if (typeof foundPath === 'string') { - return locatePath([foundPath], locateOptions); - } - - return foundPath; - }; - - // eslint-disable-next-line no-constant-condition - while (true) { - // eslint-disable-next-line no-await-in-loop - const foundPath = await runMatcher({...options, cwd: directory}); - - if (foundPath === stop) { - return; - } - - if (foundPath) { - return path.resolve(directory, foundPath); - } - - if (directory === root) { - return; - } - - directory = path.dirname(directory); - } -}; - -module.exports.sync = (name, options = {}) => { - let directory = path.resolve(options.cwd || ''); - const {root} = path.parse(directory); - const paths = [].concat(name); - - const runMatcher = locateOptions => { - if (typeof name !== 'function') { - return locatePath.sync(paths, locateOptions); - } - - const foundPath = name(locateOptions.cwd); - if (typeof foundPath === 'string') { - return locatePath.sync([foundPath], locateOptions); - } - - return foundPath; - }; - - // eslint-disable-next-line no-constant-condition - while (true) { - const foundPath = runMatcher({...options, cwd: directory}); - - if (foundPath === stop) { - return; - } - - if (foundPath) { - return path.resolve(directory, foundPath); - } - - if (directory === root) { - return; - } - - directory = path.dirname(directory); - } -}; - -module.exports.exists = pathExists; - -module.exports.sync.exists = pathExists.sync; - -module.exports.stop = stop; diff --git a/packages/taro-runtime/node_modules/find-up/license b/packages/taro-runtime/node_modules/find-up/license deleted file mode 100644 index e7af2f771..000000000 --- a/packages/taro-runtime/node_modules/find-up/license +++ /dev/null @@ -1,9 +0,0 @@ -MIT License - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/packages/taro-runtime/node_modules/find-up/package.json b/packages/taro-runtime/node_modules/find-up/package.json deleted file mode 100644 index cd50281eb..000000000 --- a/packages/taro-runtime/node_modules/find-up/package.json +++ /dev/null @@ -1,53 +0,0 @@ -{ - "name": "find-up", - "version": "4.1.0", - "description": "Find a file or directory by walking up parent directories", - "license": "MIT", - "repository": "sindresorhus/find-up", - "author": { - "name": "Sindre Sorhus", - "email": "sindresorhus@gmail.com", - "url": "sindresorhus.com" - }, - "engines": { - "node": ">=8" - }, - "scripts": { - "test": "xo && ava && tsd" - }, - "files": [ - "index.js", - "index.d.ts" - ], - "keywords": [ - "find", - "up", - "find-up", - "findup", - "look-up", - "look", - "file", - "search", - "match", - "package", - "resolve", - "parent", - "parents", - "folder", - "directory", - "walk", - "walking", - "path" - ], - "dependencies": { - "locate-path": "^5.0.0", - "path-exists": "^4.0.0" - }, - "devDependencies": { - "ava": "^2.1.0", - "is-path-inside": "^2.1.0", - "tempy": "^0.3.0", - "tsd": "^0.7.3", - "xo": "^0.24.0" - } -} diff --git a/packages/taro-runtime/node_modules/find-up/readme.md b/packages/taro-runtime/node_modules/find-up/readme.md deleted file mode 100644 index d6a21e525..000000000 --- a/packages/taro-runtime/node_modules/find-up/readme.md +++ /dev/null @@ -1,156 +0,0 @@ -# find-up [![Build Status](https://travis-ci.org/sindresorhus/find-up.svg?branch=master)](https://travis-ci.org/sindresorhus/find-up) - -> Find a file or directory by walking up parent directories - - -## Install - -``` -$ npm install find-up -``` - - -## Usage - -``` -/ -└── Users - └── sindresorhus - ├── unicorn.png - └── foo - └── bar - ├── baz - └── example.js -``` - -`example.js` - -```js -const path = require('path'); -const findUp = require('find-up'); - -(async () => { - console.log(await findUp('unicorn.png')); - //=> '/Users/sindresorhus/unicorn.png' - - console.log(await findUp(['rainbow.png', 'unicorn.png'])); - //=> '/Users/sindresorhus/unicorn.png' - - console.log(await findUp(async directory => { - const hasUnicorns = await findUp.exists(path.join(directory, 'unicorn.png')); - return hasUnicorns && directory; - }, {type: 'directory'})); - //=> '/Users/sindresorhus' -})(); -``` - - -## API - -### findUp(name, options?) -### findUp(matcher, options?) - -Returns a `Promise` for either the path or `undefined` if it couldn't be found. - -### findUp([...name], options?) - -Returns a `Promise` for either the first path found (by respecting the order of the array) or `undefined` if none could be found. - -### findUp.sync(name, options?) -### findUp.sync(matcher, options?) - -Returns a path or `undefined` if it couldn't be found. - -### findUp.sync([...name], options?) - -Returns the first path found (by respecting the order of the array) or `undefined` if none could be found. - -#### name - -Type: `string` - -Name of the file or directory to find. - -#### matcher - -Type: `Function` - -A function that will be called with each directory until it returns a `string` with the path, which stops the search, or the root directory has been reached and nothing was found. Useful if you want to match files with certain patterns, set of permissions, or other advanced use-cases. - -When using async mode, the `matcher` may optionally be an async or promise-returning function that returns the path. - -#### options - -Type: `object` - -##### cwd - -Type: `string`
-Default: `process.cwd()` - -Directory to start from. - -##### type - -Type: `string`
-Default: `'file'`
-Values: `'file'` `'directory'` - -The type of paths that can match. - -##### allowSymlinks - -Type: `boolean`
-Default: `true` - -Allow symbolic links to match if they point to the chosen path type. - -### findUp.exists(path) - -Returns a `Promise` of whether the path exists. - -### findUp.sync.exists(path) - -Returns a `boolean` of whether the path exists. - -#### path - -Type: `string` - -Path to a file or directory. - -### findUp.stop - -A [`Symbol`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol) that can be returned by a `matcher` function to stop the search and cause `findUp` to immediately return `undefined`. Useful as a performance optimization in case the current working directory is deeply nested in the filesystem. - -```js -const path = require('path'); -const findUp = require('find-up'); - -(async () => { - await findUp(directory => { - return path.basename(directory) === 'work' ? findUp.stop : 'logo.png'; - }); -})(); -``` - - -## Related - -- [find-up-cli](https://github.com/sindresorhus/find-up-cli) - CLI for this module -- [pkg-up](https://github.com/sindresorhus/pkg-up) - Find the closest package.json file -- [pkg-dir](https://github.com/sindresorhus/pkg-dir) - Find the root directory of an npm package -- [resolve-from](https://github.com/sindresorhus/resolve-from) - Resolve the path of a module like `require.resolve()` but from a given path - - ---- - -
- - Get professional support for 'find-up' with a Tidelift subscription - -
- - Tidelift helps make open source sustainable for maintainers while giving companies
assurances about security, maintenance, and licensing for their dependencies. - -
diff --git a/packages/taro-runtime/node_modules/locate-path/index.d.ts b/packages/taro-runtime/node_modules/locate-path/index.d.ts deleted file mode 100644 index fbde526c0..000000000 --- a/packages/taro-runtime/node_modules/locate-path/index.d.ts +++ /dev/null @@ -1,83 +0,0 @@ -declare namespace locatePath { - interface Options { - /** - Current working directory. - - @default process.cwd() - */ - readonly cwd?: string; - - /** - Type of path to match. - - @default 'file' - */ - readonly type?: 'file' | 'directory'; - - /** - Allow symbolic links to match if they point to the requested path type. - - @default true - */ - readonly allowSymlinks?: boolean; - } - - interface AsyncOptions extends Options { - /** - Number of concurrently pending promises. Minimum: `1`. - - @default Infinity - */ - readonly concurrency?: number; - - /** - Preserve `paths` order when searching. - - Disable this to improve performance if you don't care about the order. - - @default true - */ - readonly preserveOrder?: boolean; - } -} - -declare const locatePath: { - /** - Get the first path that exists on disk of multiple paths. - - @param paths - Paths to check. - @returns The first path that exists or `undefined` if none exists. - - @example - ``` - import locatePath = require('locate-path'); - - const files = [ - 'unicorn.png', - 'rainbow.png', // Only this one actually exists on disk - 'pony.png' - ]; - - (async () => { - console(await locatePath(files)); - //=> 'rainbow' - })(); - ``` - */ - (paths: Iterable, options?: locatePath.AsyncOptions): Promise< - string | undefined - >; - - /** - Synchronously get the first path that exists on disk of multiple paths. - - @param paths - Paths to check. - @returns The first path that exists or `undefined` if none exists. - */ - sync( - paths: Iterable, - options?: locatePath.Options - ): string | undefined; -}; - -export = locatePath; diff --git a/packages/taro-runtime/node_modules/locate-path/index.js b/packages/taro-runtime/node_modules/locate-path/index.js deleted file mode 100644 index 4604bbf40..000000000 --- a/packages/taro-runtime/node_modules/locate-path/index.js +++ /dev/null @@ -1,65 +0,0 @@ -'use strict'; -const path = require('path'); -const fs = require('fs'); -const {promisify} = require('util'); -const pLocate = require('p-locate'); - -const fsStat = promisify(fs.stat); -const fsLStat = promisify(fs.lstat); - -const typeMappings = { - directory: 'isDirectory', - file: 'isFile' -}; - -function checkType({type}) { - if (type in typeMappings) { - return; - } - - throw new Error(`Invalid type specified: ${type}`); -} - -const matchType = (type, stat) => type === undefined || stat[typeMappings[type]](); - -module.exports = async (paths, options) => { - options = { - cwd: process.cwd(), - type: 'file', - allowSymlinks: true, - ...options - }; - checkType(options); - const statFn = options.allowSymlinks ? fsStat : fsLStat; - - return pLocate(paths, async path_ => { - try { - const stat = await statFn(path.resolve(options.cwd, path_)); - return matchType(options.type, stat); - } catch (_) { - return false; - } - }, options); -}; - -module.exports.sync = (paths, options) => { - options = { - cwd: process.cwd(), - allowSymlinks: true, - type: 'file', - ...options - }; - checkType(options); - const statFn = options.allowSymlinks ? fs.statSync : fs.lstatSync; - - for (const path_ of paths) { - try { - const stat = statFn(path.resolve(options.cwd, path_)); - - if (matchType(options.type, stat)) { - return path_; - } - } catch (_) { - } - } -}; diff --git a/packages/taro-runtime/node_modules/locate-path/license b/packages/taro-runtime/node_modules/locate-path/license deleted file mode 100644 index e7af2f771..000000000 --- a/packages/taro-runtime/node_modules/locate-path/license +++ /dev/null @@ -1,9 +0,0 @@ -MIT License - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/packages/taro-runtime/node_modules/locate-path/package.json b/packages/taro-runtime/node_modules/locate-path/package.json deleted file mode 100644 index 063b29025..000000000 --- a/packages/taro-runtime/node_modules/locate-path/package.json +++ /dev/null @@ -1,45 +0,0 @@ -{ - "name": "locate-path", - "version": "5.0.0", - "description": "Get the first path that exists on disk of multiple paths", - "license": "MIT", - "repository": "sindresorhus/locate-path", - "author": { - "name": "Sindre Sorhus", - "email": "sindresorhus@gmail.com", - "url": "sindresorhus.com" - }, - "engines": { - "node": ">=8" - }, - "scripts": { - "test": "xo && ava && tsd" - }, - "files": [ - "index.js", - "index.d.ts" - ], - "keywords": [ - "locate", - "path", - "paths", - "file", - "files", - "exists", - "find", - "finder", - "search", - "searcher", - "array", - "iterable", - "iterator" - ], - "dependencies": { - "p-locate": "^4.1.0" - }, - "devDependencies": { - "ava": "^1.4.1", - "tsd": "^0.7.2", - "xo": "^0.24.0" - } -} diff --git a/packages/taro-runtime/node_modules/locate-path/readme.md b/packages/taro-runtime/node_modules/locate-path/readme.md deleted file mode 100644 index 2184c6f30..000000000 --- a/packages/taro-runtime/node_modules/locate-path/readme.md +++ /dev/null @@ -1,122 +0,0 @@ -# locate-path [![Build Status](https://travis-ci.org/sindresorhus/locate-path.svg?branch=master)](https://travis-ci.org/sindresorhus/locate-path) - -> Get the first path that exists on disk of multiple paths - - -## Install - -``` -$ npm install locate-path -``` - - -## Usage - -Here we find the first file that exists on disk, in array order. - -```js -const locatePath = require('locate-path'); - -const files = [ - 'unicorn.png', - 'rainbow.png', // Only this one actually exists on disk - 'pony.png' -]; - -(async () => { - console(await locatePath(files)); - //=> 'rainbow' -})(); -``` - - -## API - -### locatePath(paths, [options]) - -Returns a `Promise` for the first path that exists or `undefined` if none exists. - -#### paths - -Type: `Iterable` - -Paths to check. - -#### options - -Type: `Object` - -##### concurrency - -Type: `number`
-Default: `Infinity`
-Minimum: `1` - -Number of concurrently pending promises. - -##### preserveOrder - -Type: `boolean`
-Default: `true` - -Preserve `paths` order when searching. - -Disable this to improve performance if you don't care about the order. - -##### cwd - -Type: `string`
-Default: `process.cwd()` - -Current working directory. - -##### type - -Type: `string`
-Default: `file`
-Values: `file` `directory` - -The type of paths that can match. - -##### allowSymlinks - -Type: `boolean`
-Default: `true` - -Allow symbolic links to match if they point to the chosen path type. - -### locatePath.sync(paths, [options]) - -Returns the first path that exists or `undefined` if none exists. - -#### paths - -Type: `Iterable` - -Paths to check. - -#### options - -Type: `Object` - -##### cwd - -Same as above. - -##### type - -Same as above. - -##### allowSymlinks - -Same as above. - - -## Related - -- [path-exists](https://github.com/sindresorhus/path-exists) - Check if a path exists - - -## License - -MIT © [Sindre Sorhus](https://sindresorhus.com) diff --git a/packages/taro-runtime/node_modules/p-locate/index.d.ts b/packages/taro-runtime/node_modules/p-locate/index.d.ts deleted file mode 100644 index 14115e16b..000000000 --- a/packages/taro-runtime/node_modules/p-locate/index.d.ts +++ /dev/null @@ -1,64 +0,0 @@ -declare namespace pLocate { - interface Options { - /** - Number of concurrently pending promises returned by `tester`. Minimum: `1`. - - @default Infinity - */ - readonly concurrency?: number; - - /** - Preserve `input` order when searching. - - Disable this to improve performance if you don't care about the order. - - @default true - */ - readonly preserveOrder?: boolean; - } -} - -declare const pLocate: { - /** - Get the first fulfilled promise that satisfies the provided testing function. - - @param input - An iterable of promises/values to test. - @param tester - This function will receive resolved values from `input` and is expected to return a `Promise` or `boolean`. - @returns A `Promise` that is fulfilled when `tester` resolves to `true` or the iterable is done, or rejects if any of the promises reject. The fulfilled value is the current iterable value or `undefined` if `tester` never resolved to `true`. - - @example - ``` - import pathExists = require('path-exists'); - import pLocate = require('p-locate'); - - const files = [ - 'unicorn.png', - 'rainbow.png', // Only this one actually exists on disk - 'pony.png' - ]; - - (async () => { - const foundPath = await pLocate(files, file => pathExists(file)); - - console.log(foundPath); - //=> 'rainbow' - })(); - ``` - */ - ( - input: Iterable | ValueType>, - tester: (element: ValueType) => PromiseLike | boolean, - options?: pLocate.Options - ): Promise; - - // TODO: Remove this for the next major release, refactor the whole definition to: - // declare function pLocate( - // input: Iterable | ValueType>, - // tester: (element: ValueType) => PromiseLike | boolean, - // options?: pLocate.Options - // ): Promise; - // export = pLocate; - default: typeof pLocate; -}; - -export = pLocate; diff --git a/packages/taro-runtime/node_modules/p-locate/index.js b/packages/taro-runtime/node_modules/p-locate/index.js deleted file mode 100644 index e13ce1531..000000000 --- a/packages/taro-runtime/node_modules/p-locate/index.js +++ /dev/null @@ -1,52 +0,0 @@ -'use strict'; -const pLimit = require('p-limit'); - -class EndError extends Error { - constructor(value) { - super(); - this.value = value; - } -} - -// The input can also be a promise, so we await it -const testElement = async (element, tester) => tester(await element); - -// The input can also be a promise, so we `Promise.all()` them both -const finder = async element => { - const values = await Promise.all(element); - if (values[1] === true) { - throw new EndError(values[0]); - } - - return false; -}; - -const pLocate = async (iterable, tester, options) => { - options = { - concurrency: Infinity, - preserveOrder: true, - ...options - }; - - const limit = pLimit(options.concurrency); - - // Start all the promises concurrently with optional limit - const items = [...iterable].map(element => [element, limit(testElement, element, tester)]); - - // Check the promises either serially or concurrently - const checkLimit = pLimit(options.preserveOrder ? 1 : Infinity); - - try { - await Promise.all(items.map(element => checkLimit(finder, element))); - } catch (error) { - if (error instanceof EndError) { - return error.value; - } - - throw error; - } -}; - -module.exports = pLocate; -// TODO: Remove this for the next major release -module.exports.default = pLocate; diff --git a/packages/taro-runtime/node_modules/p-locate/license b/packages/taro-runtime/node_modules/p-locate/license deleted file mode 100644 index e7af2f771..000000000 --- a/packages/taro-runtime/node_modules/p-locate/license +++ /dev/null @@ -1,9 +0,0 @@ -MIT License - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/packages/taro-runtime/node_modules/p-locate/package.json b/packages/taro-runtime/node_modules/p-locate/package.json deleted file mode 100644 index e3de27562..000000000 --- a/packages/taro-runtime/node_modules/p-locate/package.json +++ /dev/null @@ -1,53 +0,0 @@ -{ - "name": "p-locate", - "version": "4.1.0", - "description": "Get the first fulfilled promise that satisfies the provided testing function", - "license": "MIT", - "repository": "sindresorhus/p-locate", - "author": { - "name": "Sindre Sorhus", - "email": "sindresorhus@gmail.com", - "url": "sindresorhus.com" - }, - "engines": { - "node": ">=8" - }, - "scripts": { - "test": "xo && ava && tsd" - }, - "files": [ - "index.js", - "index.d.ts" - ], - "keywords": [ - "promise", - "locate", - "find", - "finder", - "search", - "searcher", - "test", - "array", - "collection", - "iterable", - "iterator", - "race", - "fulfilled", - "fastest", - "async", - "await", - "promises", - "bluebird" - ], - "dependencies": { - "p-limit": "^2.2.0" - }, - "devDependencies": { - "ava": "^1.4.1", - "delay": "^4.1.0", - "in-range": "^1.0.0", - "time-span": "^3.0.0", - "tsd": "^0.7.2", - "xo": "^0.24.0" - } -} diff --git a/packages/taro-runtime/node_modules/p-locate/readme.md b/packages/taro-runtime/node_modules/p-locate/readme.md deleted file mode 100644 index f8e2c2eaf..000000000 --- a/packages/taro-runtime/node_modules/p-locate/readme.md +++ /dev/null @@ -1,90 +0,0 @@ -# p-locate [![Build Status](https://travis-ci.org/sindresorhus/p-locate.svg?branch=master)](https://travis-ci.org/sindresorhus/p-locate) - -> Get the first fulfilled promise that satisfies the provided testing function - -Think of it like an async version of [`Array#find`](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Array/find). - - -## Install - -``` -$ npm install p-locate -``` - - -## Usage - -Here we find the first file that exists on disk, in array order. - -```js -const pathExists = require('path-exists'); -const pLocate = require('p-locate'); - -const files = [ - 'unicorn.png', - 'rainbow.png', // Only this one actually exists on disk - 'pony.png' -]; - -(async () => { - const foundPath = await pLocate(files, file => pathExists(file)); - - console.log(foundPath); - //=> 'rainbow' -})(); -``` - -*The above is just an example. Use [`locate-path`](https://github.com/sindresorhus/locate-path) if you need this.* - - -## API - -### pLocate(input, tester, [options]) - -Returns a `Promise` that is fulfilled when `tester` resolves to `true` or the iterable is done, or rejects if any of the promises reject. The fulfilled value is the current iterable value or `undefined` if `tester` never resolved to `true`. - -#### input - -Type: `Iterable` - -An iterable of promises/values to test. - -#### tester(element) - -Type: `Function` - -This function will receive resolved values from `input` and is expected to return a `Promise` or `boolean`. - -#### options - -Type: `Object` - -##### concurrency - -Type: `number`
-Default: `Infinity`
-Minimum: `1` - -Number of concurrently pending promises returned by `tester`. - -##### preserveOrder - -Type: `boolean`
-Default: `true` - -Preserve `input` order when searching. - -Disable this to improve performance if you don't care about the order. - - -## Related - -- [p-map](https://github.com/sindresorhus/p-map) - Map over promises concurrently -- [p-filter](https://github.com/sindresorhus/p-filter) - Filter promises concurrently -- [p-any](https://github.com/sindresorhus/p-any) - Wait for any promise to be fulfilled -- [More…](https://github.com/sindresorhus/promise-fun) - - -## License - -MIT © [Sindre Sorhus](https://sindresorhus.com) diff --git a/packages/taro-runtime/node_modules/path-exists/index.d.ts b/packages/taro-runtime/node_modules/path-exists/index.d.ts deleted file mode 100644 index 54b7ab8f4..000000000 --- a/packages/taro-runtime/node_modules/path-exists/index.d.ts +++ /dev/null @@ -1,28 +0,0 @@ -declare const pathExists: { - /** - Check if a path exists. - - @returns Whether the path exists. - - @example - ``` - // foo.ts - import pathExists = require('path-exists'); - - (async () => { - console.log(await pathExists('foo.ts')); - //=> true - })(); - ``` - */ - (path: string): Promise; - - /** - Synchronously check if a path exists. - - @returns Whether the path exists. - */ - sync(path: string): boolean; -}; - -export = pathExists; diff --git a/packages/taro-runtime/node_modules/path-exists/index.js b/packages/taro-runtime/node_modules/path-exists/index.js deleted file mode 100644 index 1943921b7..000000000 --- a/packages/taro-runtime/node_modules/path-exists/index.js +++ /dev/null @@ -1,23 +0,0 @@ -'use strict'; -const fs = require('fs'); -const {promisify} = require('util'); - -const pAccess = promisify(fs.access); - -module.exports = async path => { - try { - await pAccess(path); - return true; - } catch (_) { - return false; - } -}; - -module.exports.sync = path => { - try { - fs.accessSync(path); - return true; - } catch (_) { - return false; - } -}; diff --git a/packages/taro-runtime/node_modules/path-exists/license b/packages/taro-runtime/node_modules/path-exists/license deleted file mode 100644 index e7af2f771..000000000 --- a/packages/taro-runtime/node_modules/path-exists/license +++ /dev/null @@ -1,9 +0,0 @@ -MIT License - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/packages/taro-runtime/node_modules/path-exists/package.json b/packages/taro-runtime/node_modules/path-exists/package.json deleted file mode 100644 index 0755256a2..000000000 --- a/packages/taro-runtime/node_modules/path-exists/package.json +++ /dev/null @@ -1,39 +0,0 @@ -{ - "name": "path-exists", - "version": "4.0.0", - "description": "Check if a path exists", - "license": "MIT", - "repository": "sindresorhus/path-exists", - "author": { - "name": "Sindre Sorhus", - "email": "sindresorhus@gmail.com", - "url": "sindresorhus.com" - }, - "engines": { - "node": ">=8" - }, - "scripts": { - "test": "xo && ava && tsd" - }, - "files": [ - "index.js", - "index.d.ts" - ], - "keywords": [ - "path", - "exists", - "exist", - "file", - "filepath", - "fs", - "filesystem", - "file-system", - "access", - "stat" - ], - "devDependencies": { - "ava": "^1.4.1", - "tsd": "^0.7.2", - "xo": "^0.24.0" - } -} diff --git a/packages/taro-runtime/node_modules/path-exists/readme.md b/packages/taro-runtime/node_modules/path-exists/readme.md deleted file mode 100644 index 81f984545..000000000 --- a/packages/taro-runtime/node_modules/path-exists/readme.md +++ /dev/null @@ -1,52 +0,0 @@ -# path-exists [![Build Status](https://travis-ci.org/sindresorhus/path-exists.svg?branch=master)](https://travis-ci.org/sindresorhus/path-exists) - -> Check if a path exists - -NOTE: `fs.existsSync` has been un-deprecated in Node.js since 6.8.0. If you only need to check synchronously, this module is not needed. - -While [`fs.exists()`](https://nodejs.org/api/fs.html#fs_fs_exists_path_callback) is being [deprecated](https://github.com/iojs/io.js/issues/103), there's still a genuine use-case of being able to check if a path exists for other purposes than doing IO with it. - -Never use this before handling a file though: - -> In particular, checking if a file exists before opening it is an anti-pattern that leaves you vulnerable to race conditions: another process may remove the file between the calls to `fs.exists()` and `fs.open()`. Just open the file and handle the error when it's not there. - - -## Install - -``` -$ npm install path-exists -``` - - -## Usage - -```js -// foo.js -const pathExists = require('path-exists'); - -(async () => { - console.log(await pathExists('foo.js')); - //=> true -})(); -``` - - -## API - -### pathExists(path) - -Returns a `Promise` of whether the path exists. - -### pathExists.sync(path) - -Returns a `boolean` of whether the path exists. - - -## Related - -- [path-exists-cli](https://github.com/sindresorhus/path-exists-cli) - CLI for this module - - -## License - -MIT © [Sindre Sorhus](https://sindresorhus.com) diff --git a/packages/taro-runtime/node_modules/pkg-dir/index.d.ts b/packages/taro-runtime/node_modules/pkg-dir/index.d.ts deleted file mode 100644 index e339404e5..000000000 --- a/packages/taro-runtime/node_modules/pkg-dir/index.d.ts +++ /dev/null @@ -1,44 +0,0 @@ -declare const pkgDir: { - /** - Find the root directory of a Node.js project or npm package. - - @param cwd - Directory to start from. Default: `process.cwd()`. - @returns The project root path or `undefined` if it couldn't be found. - - @example - ``` - // / - // └── Users - // └── sindresorhus - // └── foo - // ├── package.json - // └── bar - // ├── baz - // └── example.js - - // example.js - import pkgDir = require('pkg-dir'); - - (async () => { - const rootDir = await pkgDir(__dirname); - - console.log(rootDir); - //=> '/Users/sindresorhus/foo' - })(); - ``` - */ - (cwd?: string): Promise; - - /** - Synchronously find the root directory of a Node.js project or npm package. - - @param cwd - Directory to start from. Default: `process.cwd()`. - @returns The project root path or `undefined` if it couldn't be found. - */ - sync(cwd?: string): string | undefined; - - // TODO: Remove this for the next major release - default: typeof pkgDir; -}; - -export = pkgDir; diff --git a/packages/taro-runtime/node_modules/pkg-dir/index.js b/packages/taro-runtime/node_modules/pkg-dir/index.js deleted file mode 100644 index 83e683d82..000000000 --- a/packages/taro-runtime/node_modules/pkg-dir/index.js +++ /dev/null @@ -1,17 +0,0 @@ -'use strict'; -const path = require('path'); -const findUp = require('find-up'); - -const pkgDir = async cwd => { - const filePath = await findUp('package.json', {cwd}); - return filePath && path.dirname(filePath); -}; - -module.exports = pkgDir; -// TODO: Remove this for the next major release -module.exports.default = pkgDir; - -module.exports.sync = cwd => { - const filePath = findUp.sync('package.json', {cwd}); - return filePath && path.dirname(filePath); -}; diff --git a/packages/taro-runtime/node_modules/pkg-dir/license b/packages/taro-runtime/node_modules/pkg-dir/license deleted file mode 100644 index e7af2f771..000000000 --- a/packages/taro-runtime/node_modules/pkg-dir/license +++ /dev/null @@ -1,9 +0,0 @@ -MIT License - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/packages/taro-runtime/node_modules/pkg-dir/package.json b/packages/taro-runtime/node_modules/pkg-dir/package.json deleted file mode 100644 index aad11e824..000000000 --- a/packages/taro-runtime/node_modules/pkg-dir/package.json +++ /dev/null @@ -1,56 +0,0 @@ -{ - "name": "pkg-dir", - "version": "4.2.0", - "description": "Find the root directory of a Node.js project or npm package", - "license": "MIT", - "repository": "sindresorhus/pkg-dir", - "author": { - "name": "Sindre Sorhus", - "email": "sindresorhus@gmail.com", - "url": "sindresorhus.com" - }, - "engines": { - "node": ">=8" - }, - "scripts": { - "test": "xo && ava && tsd" - }, - "files": [ - "index.js", - "index.d.ts" - ], - "keywords": [ - "package", - "json", - "root", - "npm", - "entry", - "find", - "up", - "find-up", - "findup", - "look-up", - "look", - "file", - "search", - "match", - "resolve", - "parent", - "parents", - "folder", - "directory", - "dir", - "walk", - "walking", - "path" - ], - "dependencies": { - "find-up": "^4.0.0" - }, - "devDependencies": { - "ava": "^1.4.1", - "tempy": "^0.3.0", - "tsd": "^0.7.2", - "xo": "^0.24.0" - } -} diff --git a/packages/taro-runtime/node_modules/pkg-dir/readme.md b/packages/taro-runtime/node_modules/pkg-dir/readme.md deleted file mode 100644 index 92a77f45f..000000000 --- a/packages/taro-runtime/node_modules/pkg-dir/readme.md +++ /dev/null @@ -1,66 +0,0 @@ -# pkg-dir [![Build Status](https://travis-ci.org/sindresorhus/pkg-dir.svg?branch=master)](https://travis-ci.org/sindresorhus/pkg-dir) - -> Find the root directory of a Node.js project or npm package - - -## Install - -``` -$ npm install pkg-dir -``` - - -## Usage - -``` -/ -└── Users - └── sindresorhus - └── foo - ├── package.json - └── bar - ├── baz - └── example.js -``` - -```js -// example.js -const pkgDir = require('pkg-dir'); - -(async () => { - const rootDir = await pkgDir(__dirname); - - console.log(rootDir); - //=> '/Users/sindresorhus/foo' -})(); -``` - - -## API - -### pkgDir([cwd]) - -Returns a `Promise` for either the project root path or `undefined` if it couldn't be found. - -### pkgDir.sync([cwd]) - -Returns the project root path or `undefined` if it couldn't be found. - -#### cwd - -Type: `string`
-Default: `process.cwd()` - -Directory to start from. - - -## Related - -- [pkg-dir-cli](https://github.com/sindresorhus/pkg-dir-cli) - CLI for this module -- [pkg-up](https://github.com/sindresorhus/pkg-up) - Find the closest package.json file -- [find-up](https://github.com/sindresorhus/find-up) - Find a file by walking up parent directories - - -## License - -MIT © [Sindre Sorhus](https://sindresorhus.com) diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/README.md b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/README.md index 97334e94c..e9f8bcc8e 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/README.md +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/README.md @@ -4,7 +4,6 @@ ![npm-monthly-downloads](https://img.shields.io/npm/dm/rollup-plugin-typescript2.svg?maxAge=259200) [![Codeship Status](https://app.codeship.com/projects/fe9cf8f0-e8d4-0134-ec88-4e3d33dcd7ed/status?branch=master)](https://app.codeship.com/projects/207445) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/e19b72ab9658405bbfb32dd6d65d1856)](https://www.codacy.com/app/zolenkoe/rollup-plugin-typescript2?utm_source=github.com&utm_medium=referral&utm_content=ezolenko/rollup-plugin-typescript2&utm_campaign=Badge_Grade) -[![Node.js CI](https://github.com/ezolenko/rollup-plugin-typescript2/workflows/Node.js%20CI/badge.svg)](https://github.com/ezolenko/rollup-plugin-typescript2/actions?query=workflow%3A"Node.js+CI") Rollup plugin for typescript with compiler errors. @@ -16,9 +15,9 @@ This version is somewhat slower than original, but it will print out typescript ```bash # with npm -npm install rollup-plugin-typescript2 typescript tslib --save-dev +npm install rollup-plugin-typescript2 typescript --save-dev # with yarn -yarn add rollup-plugin-typescript2 typescript tslib --dev +yarn add rollup-plugin-typescript2 typescript --dev ``` ## Usage @@ -46,7 +45,7 @@ The plugin inherits all compiler options and file lists from your `tsconfig.json * `noEmit`: false * `inlineSourceMap`: false (see [#71](https://github.com/ezolenko/rollup-plugin-typescript2/issues/71)) * `outDir`: `./placeholder` in cache root, see [83](https://github.com/ezolenko/rollup-plugin-typescript2/issues/83) and [Microsoft/TypeScript/issues/24715](https://github.com/Microsoft/TypeScript/issues/24715) -* `declarationDir`: Rollup's `output.file` or `output.dir` (*only if `useTsconfigDeclarationDir` is false in the plugin options*) +* `declarationDir`: `process.cwd()` (*only if `useTsconfigDeclarationDir` is false in the plugin options*) * `moduleResolution`: `node` (*`classic` is [deprecated](https://www.typescriptlang.org/docs/handbook/module-resolution.html). It also breaks this plugin, see [#12](https://github.com/ezolenko/rollup-plugin-typescript2/issues/12) and [#14](https://github.com/ezolenko/rollup-plugin-typescript2/issues/14)*) * `allowNonTsExtensions`: true to let other plugins on the chain generate typescript, update plugin's include filter to pick them up (see [#111](https://github.com/ezolenko/rollup-plugin-typescript2/issues/111)) @@ -54,10 +53,6 @@ The plugin inherits all compiler options and file lists from your `tsconfig.json * `module`: defaults to `ES2015`, other valid value is `ESNext` (required for dynamic imports, see [#54](https://github.com/ezolenko/rollup-plugin-typescript2/issues/54)). -#### Some options need additional configuration on plugin side - -* `allowJs`: lets typescript process js files as well, if you use it, modify plugin's `include` option to add `"*.js+(|x)", "**/*.js+(|x)"` (might want to exclude node_modules, it will slow down the build significantly). - ### Compatibility #### rollup-plugin-node-resolve @@ -68,6 +63,10 @@ Must be before rollup-plugin-typescript2 in the plugin list, especially when `br See explanation for `rollupCommonJSResolveHack` option below. +#### plugins using async/await + +See `objectHashIgnoreUnknownHack` below. + #### rollup-plugin-babel This plugin transpiles code, but doesn't change file extension. Babel plugin, even though it claims it processes all files, only looks at code with those extensions by default: `.js,.jsx,.es6,.es,.mjs`. To workaround add `ts` and `tsx` to the list of babel extensions. @@ -90,10 +89,6 @@ See [#108](https://github.com/ezolenko/rollup-plugin-typescript2/issues/108) ### Plugin options -* `cwd`: `string` - - The current work directory, default `process.cwd()`. - * `tsconfigDefaults`: `{}` The object passed as `tsconfigDefaults` will be merged with loaded `tsconfig.json`. Final config passed to typescript will be the result of values in `tsconfigDefaults` replaced by values in loaded `tsconfig.json`, replaced by values in `tsconfigOverride` and then replaced by hard `compilerOptions` overrides on top of that (see above). @@ -165,17 +160,15 @@ See [#108](https://github.com/ezolenko/rollup-plugin-typescript2/issues/108) * `objectHashIgnoreUnknownHack`: false - The plugin uses rollup config as part of cache key. `object-hash` is used to generate a hash, but it can have trouble with some uncommon types of elements. Setting this option to true will make `object-hash` ignore unknowns, at the cost of not invalidating the cache if ignored elements are changed. Only enable this if you need it (`Error: Unknown object type "xxx"` for example) and make sure to run with `clean: true` once in a while and definitely before a release. (See [#105](https://github.com/ezolenko/rollup-plugin-typescript2/issues/105) and [#203](https://github.com/ezolenko/rollup-plugin-typescript2/pull/203)) + The plugin uses rollup config as part of cache key. `object-hash` is used to generate a hash, but it can't hash certain elements at the moment. Setting this option to true will make `object-hash` ignore unknowns, at the cost of not invalidating the cache if ignored elements are changed. Only enable this if you need it (`Error: Unknown object type "asyncfunction"` for example) and make sure to run with `clean: true` once in a while and definitely before a release. (See [#105](https://github.com/ezolenko/rollup-plugin-typescript2/issues/105)) * `useTsconfigDeclarationDir`: false If true, declaration files will be emitted in the directory given in the tsconfig. If false, the declaration files will be placed inside the destination directory given in the Rollup configuration. - - Set to false if any other rollup plugins need access to declaration files. * `typescript`: typescript module installed with the plugin - When typescript version installed by the plugin (latest 2.x) is unacceptable, you can import your own typescript module and pass it in as `typescript: require("path/to/other/typescript")`. Must be 2.0+, things might break if transpiler interfaces changed enough from what the plugin was built against. + When typescript version installed by the plugin (latest 2.x) is unacceptable, you can import your own typescript module and pass it in as `typescript: require("typescript")`. Must be 2.0+, things might break if transpiler interfaces changed enough from what the plugin was built against. * `transformers`: `undefined` @@ -187,10 +180,11 @@ See [#108](https://github.com/ezolenko/rollup-plugin-typescript2/issues/108) ```js const keysTransformer = require('ts-transformer-keys/transformer').default; - const transformer = (service) => ({ + const transformer = (service) => + { before: [ keysTransformer(service.getProgram()) ], after: [] - }); + }; // ... plugins: [ @@ -212,7 +206,7 @@ Otherwise the plugin should work in watch mode. Make sure to run a normal build ### Requirements TypeScript `2.4+` -Rollup `1.26.3+` +Rollup `0.68+` Node `6.4.0+` (basic es6 support) ### Reporting bugs diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/check-tsconfig.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/check-tsconfig.d.ts.map index 1959738b4..19c257882 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/check-tsconfig.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/check-tsconfig.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"check-tsconfig.d.ts","sourceRoot":"","sources":["../src/check-tsconfig.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAEtC,wBAAgB,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAM3E"} \ No newline at end of file +{"version":3,"file":"check-tsconfig.d.ts","sourceRoot":"","sources":["src/check-tsconfig.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAEtC,wBAAgB,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAM3E"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/context.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/context.d.ts.map index 015c81fde..75034b46c 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/context.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/context.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../src/context.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,QAAQ;IAExB,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC9C,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;CAC9C;AAED,oBAAY,cAAc;IAEzB,KAAK,IAAI;IACT,OAAO,IAAA;IACP,IAAI,IAAA;IACJ,KAAK,IAAA;CACL;AAED,qBAAa,cAAe,YAAW,QAAQ;IAElC,OAAO,CAAC,SAAS;IAAkB,OAAO,CAAC,MAAM;gBAAzC,SAAS,EAAE,cAAc,EAAU,MAAM,GAAE,MAAW;IAInE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO5C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO7C,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO5C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;CAMpD"} \ No newline at end of file +{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["src/context.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,QAAQ;IAExB,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC9C,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC;CAC9C;AAED,oBAAY,cAAc;IAEzB,KAAK,IAAI;IACT,OAAO,IAAA;IACP,IAAI,IAAA;IACJ,KAAK,IAAA;CACL;AAED,qBAAa,cAAe,YAAW,QAAQ;IAElC,OAAO,CAAC,SAAS;IAAkB,OAAO,CAAC,MAAM;gBAAzC,SAAS,EAAE,cAAc,EAAU,MAAM,GAAE,MAAW;IAInE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO5C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO7C,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;IAO5C,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,IAAI;CAMpD"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/diagnostics-format-host.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/diagnostics-format-host.d.ts.map index e21a388e4..3c01cbe31 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/diagnostics-format-host.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/diagnostics-format-host.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"diagnostics-format-host.d.ts","sourceRoot":"","sources":["../src/diagnostics-format-host.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAGtC,qBAAa,UAAW,YAAW,OAAO,CAAC,qBAAqB;IAExD,mBAAmB,IAAI,MAAM;IAK7B,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAK9C,UAAU,IAAI,MAAM;CAI3B;AAED,eAAO,MAAM,UAAU,YAAmB,CAAC"} \ No newline at end of file +{"version":3,"file":"diagnostics-format-host.d.ts","sourceRoot":"","sources":["src/diagnostics-format-host.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAGtC,qBAAa,UAAW,YAAW,OAAO,CAAC,qBAAqB;IAExD,mBAAmB,IAAI,MAAM;IAK7B,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAK9C,UAAU,IAAI,MAAM;CAI3B;AAED,eAAO,MAAM,UAAU,YAAmB,CAAC"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts index bacfe13f4..5635aa698 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts @@ -2,5 +2,5 @@ import * as tsTypes from "typescript"; import { IOptions } from "./ioptions"; import { IContext } from "./context"; export declare function getOptionsOverrides({ useTsconfigDeclarationDir, cacheRoot }: IOptions, preParsedTsconfig?: tsTypes.ParsedCommandLine): tsTypes.CompilerOptions; -export declare function createFilter(context: IContext, pluginOptions: IOptions, parsedConfig: tsTypes.ParsedCommandLine): (id: unknown) => boolean; +export declare function createFilter(context: IContext, pluginOptions: IOptions, parsedConfig: tsTypes.ParsedCommandLine): any; //# sourceMappingURL=get-options-overrides.d.ts.map \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts.map index 7c20c5b1d..88faa6314 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/get-options-overrides.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"get-options-overrides.d.ts","sourceRoot":"","sources":["../src/get-options-overrides.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,wBAAgB,mBAAmB,CAAC,EAAE,yBAAyB,EAAE,SAAS,EAAE,EAAE,QAAQ,EAAE,iBAAiB,CAAC,EAAE,OAAO,CAAC,iBAAiB,GAAG,OAAO,CAAC,eAAe,CA6B9J;AAiBD,wBAAgB,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,iBAAiB,4BAoB/G"} \ No newline at end of file +{"version":3,"file":"get-options-overrides.d.ts","sourceRoot":"","sources":["src/get-options-overrides.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAKrC,wBAAgB,mBAAmB,CAAC,EAAE,yBAAyB,EAAE,SAAS,EAAE,EAAE,QAAQ,EAAE,iBAAiB,CAAC,EAAE,OAAO,CAAC,iBAAiB,GAAG,OAAO,CAAC,eAAe,CA+B9J;AAiBD,wBAAgB,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,iBAAiB,OAoB/G"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts index 5712ef260..acd3300da 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts @@ -8,7 +8,7 @@ export declare class LanguageServiceHost implements tsTypes.LanguageServiceHost private versions; private service?; private fileNames; - constructor(parsedConfig: tsTypes.ParsedCommandLine, transformers: TransformerFactoryCreator[], cwd: string); + constructor(parsedConfig: tsTypes.ParsedCommandLine, transformers: TransformerFactoryCreator[]); reset(): void; setLanguageService(service: tsTypes.LanguageService): void; setSnapshot(fileName: string, data: string): tsTypes.IScriptSnapshot; diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts.map index c1f64dc36..becf17d0e 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/host.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"host.d.ts","sourceRoot":"","sources":["../src/host.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAGtC,OAAO,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAC;AAEvD,qBAAa,mBAAoB,YAAW,OAAO,CAAC,mBAAmB;IAQ1D,OAAO,CAAC,YAAY;IAA6B,OAAO,CAAC,YAAY;IANjF,OAAO,CAAC,GAAG,CAAS;IACpB,OAAO,CAAC,SAAS,CAAuD;IACxE,OAAO,CAAC,QAAQ,CAAsC;IACtD,OAAO,CAAC,OAAO,CAAC,CAA0B;IAC1C,OAAO,CAAC,SAAS,CAAc;gBAEX,YAAY,EAAE,OAAO,CAAC,iBAAiB,EAAU,YAAY,EAAE,yBAAyB,EAAE,EAAE,GAAG,EAAE,MAAM;IAMpH,KAAK;IAML,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,eAAe;IAKnD,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe;IAWpE,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,SAAS;IAkBxE,mBAAmB;IAKnB,gBAAgB,CAAC,QAAQ,EAAE,MAAM;IAOjC,kBAAkB;IAKlB,sBAAsB,IAAI,OAAO,CAAC,eAAe;IAKjD,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,eAAe;IAKnD,yBAAyB,IAAI,OAAO;IAKpC,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAKpG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAK7D,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAKjC,mBAAmB,IAAI,MAAM;IAK7B,eAAe,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO;IAK/C,cAAc,CAAC,aAAa,EAAE,MAAM,GAAG,MAAM,EAAE;IAK/C,qBAAqB,IAAI,OAAO,CAAC,kBAAkB,GAAG,SAAS;CAyBtE"} \ No newline at end of file +{"version":3,"file":"host.d.ts","sourceRoot":"","sources":["src/host.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAGtC,OAAO,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAC;AAEvD,qBAAa,mBAAoB,YAAW,OAAO,CAAC,mBAAmB;IAQ1D,OAAO,CAAC,YAAY;IAA6B,OAAO,CAAC,YAAY;IANjF,OAAO,CAAC,GAAG,CAAiB;IAC5B,OAAO,CAAC,SAAS,CAAuD;IACxE,OAAO,CAAC,QAAQ,CAAsC;IACtD,OAAO,CAAC,OAAO,CAAC,CAA0B;IAC1C,OAAO,CAAC,SAAS,CAAc;gBAEX,YAAY,EAAE,OAAO,CAAC,iBAAiB,EAAU,YAAY,EAAE,yBAAyB,EAAE;IAKvG,KAAK;IAML,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,eAAe;IAKnD,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe;IAWpE,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,SAAS;IAkBxE,mBAAmB;IAKnB,gBAAgB,CAAC,QAAQ,EAAE,MAAM;IAOjC,kBAAkB;IAKlB,sBAAsB,IAAI,OAAO,CAAC,eAAe;IAKjD,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,eAAe;IAKnD,yBAAyB,IAAI,OAAO;IAKpC,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAKpG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAK7D,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAKjC,mBAAmB,IAAI,MAAM;IAK7B,eAAe,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO;IAK/C,cAAc,CAAC,aAAa,EAAE,MAAM,GAAG,MAAM,EAAE;IAK/C,qBAAqB,IAAI,OAAO,CAAC,kBAAkB,GAAG,SAAS;CAyBtE"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/icache.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/icache.d.ts.map index ae72e1170..cc4ce0165 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/icache.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/icache.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"icache.d.ts","sourceRoot":"","sources":["../src/icache.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,MAAM,CAAE,QAAQ;IAEhC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAE3B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAEhC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;IAEhD,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IAE1C,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAE1B,IAAI,IAAI,IAAI,CAAC;CACb"} \ No newline at end of file +{"version":3,"file":"icache.d.ts","sourceRoot":"","sources":["src/icache.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,MAAM,CAAE,QAAQ;IAEhC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAE9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAE3B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAEhC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;IAEhD,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IAE1C,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAE1B,IAAI,IAAI,IAAI,CAAC;CACb"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts index 553c965d4..5fdb39e6d 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts @@ -1,8 +1,6 @@ import { IOptions } from "./ioptions"; import { Partial } from "./partial"; import { PluginImpl } from "rollup"; -declare type RPT2Options = Partial; -export { RPT2Options }; -declare const typescript: PluginImpl; +declare const typescript: PluginImpl>; export default typescript; //# sourceMappingURL=index.d.ts.map \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts.map index c56da85d8..a216f1d91 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/index.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAUpC,OAAO,EAAE,UAAU,EAAkF,MAAM,QAAQ,CAAC;AAIpH,aAAK,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AAErC,OAAO,EAAE,WAAW,EAAE,CAAA;AAEtB,QAAA,MAAM,UAAU,EAAE,UAAU,CAAC,WAAW,CA2XvC,CAAC;AAEF,eAAe,UAAU,CAAC"} \ No newline at end of file +{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["src/index.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AASpC,OAAO,EAAE,UAAU,EAAgG,MAAM,QAAQ,CAAC;AAGlI,QAAA,MAAM,UAAU,EAAE,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAwW7C,CAAC;AAEF,eAAe,UAAU,CAAC"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts index f18dcadea..1d59b4721 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts @@ -7,7 +7,6 @@ export interface ICustomTransformer { } export declare type TransformerFactoryCreator = (ls: tsTypes.LanguageService) => tsTypes.CustomTransformers | ICustomTransformer; export interface IOptions { - cwd: string; include: string | string[]; exclude: string | string[]; check: boolean; diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts.map index ef74136e0..f354015d4 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/ioptions.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"ioptions.d.ts","sourceRoot":"","sources":["../src/ioptions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAEtC,MAAM,WAAW,kBAAkB;IAElC,MAAM,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACxD,KAAK,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACvD,iBAAiB,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CACpF;AAED,oBAAY,yBAAyB,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,eAAe,KAAK,OAAO,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;AAEzH,MAAM,WAAW,QAAQ;IAExB,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,GAAC,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,MAAM,GAAC,MAAM,EAAE,CAAC;IACzB,KAAK,EAAE,OAAO,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,OAAO,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,OAAO,CAAC;IACtB,yBAAyB,EAAE,OAAO,CAAC;IACnC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,yBAAyB,EAAE,OAAO,CAAC;IACnC,UAAU,EAAE,OAAO,QAAQ,CAAC;IAC5B,gBAAgB,EAAE,GAAG,CAAC;IACtB,YAAY,EAAE,yBAAyB,EAAE,CAAC;IAC1C,gBAAgB,EAAE,GAAG,CAAC;IACtB,iBAAiB,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IACrD,2BAA2B,EAAE,OAAO,CAAC;CACrC"} \ No newline at end of file +{"version":3,"file":"ioptions.d.ts","sourceRoot":"","sources":["src/ioptions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAEtC,MAAM,WAAW,kBAAkB;IAElC,MAAM,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACxD,KAAK,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACvD,iBAAiB,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CACpF;AAED,oBAAY,yBAAyB,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,eAAe,KAAK,OAAO,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;AAEzH,MAAM,WAAW,QAAQ;IAExB,OAAO,EAAE,MAAM,GAAC,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,MAAM,GAAC,MAAM,EAAE,CAAC;IACzB,KAAK,EAAE,OAAO,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,OAAO,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,OAAO,CAAC;IACtB,yBAAyB,EAAE,OAAO,CAAC;IACnC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,yBAAyB,EAAE,OAAO,CAAC;IACnC,UAAU,EAAE,OAAO,QAAQ,CAAC;IAC5B,gBAAgB,EAAE,GAAG,CAAC;IACtB,YAAY,EAAE,yBAAyB,EAAE,CAAC;IAC1C,gBAAgB,EAAE,GAAG,CAAC;IACtB,iBAAiB,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IACrD,2BAA2B,EAAE,OAAO,CAAC;CACrC"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/nocache.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/nocache.d.ts.map index f512487f5..682a82e15 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/nocache.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/nocache.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"nocache.d.ts","sourceRoot":"","sources":["../src/nocache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,qBAAa,OAAO,CAAC,QAAQ,CAAE,YAAW,MAAM,CAAC,QAAQ,CAAC;IAElD,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAK9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAK1B,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO;IAKhC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS;IAKhD,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,IAAI;IAK3C,KAAK,CAAC,KAAK,EAAE,MAAM;IAKnB,IAAI;CAIX"} \ No newline at end of file +{"version":3,"file":"nocache.d.ts","sourceRoot":"","sources":["src/nocache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,qBAAa,OAAO,CAAC,QAAQ,CAAE,YAAW,MAAM,CAAC,QAAQ,CAAC;IAElD,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAK9B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAK1B,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO;IAKhC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS;IAKhD,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,IAAI;IAK3C,KAAK,CAAC,KAAK,EAAE,MAAM;IAKnB,IAAI;CAIX"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/normalize.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/normalize.d.ts.map index f3859f10c..517c158b0 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/normalize.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/normalize.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../src/normalize.ts"],"names":[],"mappings":"AAAA,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,UAGzC"} \ No newline at end of file +{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["src/normalize.ts"],"names":[],"mappings":"AAAA,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,UAGzC"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/parse-tsconfig.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/parse-tsconfig.d.ts.map index aba001ec3..0493170ec 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/parse-tsconfig.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/parse-tsconfig.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"parse-tsconfig.d.ts","sourceRoot":"","sources":["../src/parse-tsconfig.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAKrC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAItC,wBAAgB,aAAa,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ;;;EA8CvE"} \ No newline at end of file +{"version":3,"file":"parse-tsconfig.d.ts","sourceRoot":"","sources":["src/parse-tsconfig.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAKrC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAItC,wBAAgB,aAAa,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ;;;EA8CvE"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/partial.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/partial.d.ts.map index 58913bab1..4163ed6ff 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/partial.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/partial.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"partial.d.ts","sourceRoot":"","sources":["../src/partial.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,IAAI;KAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAAG,CAAC"} \ No newline at end of file +{"version":3,"file":"partial.d.ts","sourceRoot":"","sources":["src/partial.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,IAAI;KAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAAG,CAAC"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/print-diagnostics.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/print-diagnostics.d.ts.map index ab5d25b11..00d334ba6 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/print-diagnostics.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/print-diagnostics.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"print-diagnostics.d.ts","sourceRoot":"","sources":["../src/print-diagnostics.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAGzC,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAuCtG"} \ No newline at end of file +{"version":3,"file":"print-diagnostics.d.ts","sourceRoot":"","sources":["src/print-diagnostics.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAGzC,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAuCtG"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollingcache.d.ts.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollingcache.d.ts.map index d825ffcfc..63cd25931 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollingcache.d.ts.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollingcache.d.ts.map @@ -1 +1 @@ -{"version":3,"file":"rollingcache.d.ts","sourceRoot":"","sources":["../src/rollingcache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAKlC;;;GAGG;AACH,qBAAa,YAAY,CAAC,QAAQ,CAAE,YAAW,MAAM,CAAC,QAAQ,CAAC;IAWlD,OAAO,CAAC,SAAS;IAAU,OAAO,CAAC,aAAa;IAT5D,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,YAAY,CAAS;IAE7B,OAAO,CAAC,MAAM,CAAkB;IAEhC;;;OAGG;gBACiB,SAAS,EAAE,MAAM,EAAU,aAAa,EAAE,OAAO;IAQrE;;OAEG;IACI,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAW7B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAKjC;;OAEG;IACI,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO;IAWtC;;OAEG;IACI,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS;IAQ/C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI;IAWzC,KAAK,CAAC,IAAI,EAAE,MAAM;IAOzB;;OAEG;IACI,IAAI;CAWX"} \ No newline at end of file +{"version":3,"file":"rollingcache.d.ts","sourceRoot":"","sources":["src/rollingcache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAKlC;;;GAGG;AACH,qBAAa,YAAY,CAAC,QAAQ,CAAE,YAAW,MAAM,CAAC,QAAQ,CAAC;IAWlD,OAAO,CAAC,SAAS;IAAU,OAAO,CAAC,aAAa;IAT5D,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,YAAY,CAAS;IAE7B,OAAO,CAAC,MAAM,CAAkB;IAEhC;;;OAGG;gBACiB,SAAS,EAAE,MAAM,EAAU,aAAa,EAAE,OAAO;IAQrE;;OAEG;IACI,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAW7B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAKjC;;OAEG;IACI,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO;IAWtC;;OAEG;IACI,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,GAAG,SAAS;IAQ/C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI;IAWzC,KAAK,CAAC,IAAI,EAAE,MAAM;IAOzB;;OAEG;IACI,IAAI;CASX"} \ No newline at end of file diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js index 8da3e8113..ca714cb43 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js @@ -1,43 +1,28 @@ /* eslint-disable */ 'use strict'; -var crypto = require('crypto'); +function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; } + +var crypto = _interopDefault(require('crypto')); var fsExtra = require('fs-extra'); var fs = require('fs'); -var require$$0 = require('util'); -var os = require('os'); +var fs__default = _interopDefault(fs); +var util = _interopDefault(require('util')); +var os = _interopDefault(require('os')); var path = require('path'); +var path__default = _interopDefault(path); var resolve = require('resolve'); -var pluginutils = require('@rollup/pluginutils'); - -function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; } - -var crypto__default = /*#__PURE__*/_interopDefaultLegacy(crypto); -var fs__default = /*#__PURE__*/_interopDefaultLegacy(fs); -var require$$0__default = /*#__PURE__*/_interopDefaultLegacy(require$$0); -var os__default = /*#__PURE__*/_interopDefaultLegacy(os); -var path__default = /*#__PURE__*/_interopDefaultLegacy(path); var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {}; -function createCommonjsModule(fn) { - var module = { exports: {} }; - return fn(module, module.exports), module.exports; +function commonjsRequire () { + throw new Error('Dynamic requires are not currently supported by rollup-plugin-commonjs'); } -function commonjsRequire (target) { - throw new Error('Could not dynamically require "' + target + '". Please configure the dynamicRequireTargets option of @rollup/plugin-commonjs appropriately for this require call to behave properly.'); +function createCommonjsModule(fn, module) { + return module = { exports: {} }, fn(module, module.exports), module.exports; } -/** - * @license - * Lodash - * Copyright OpenJS Foundation and other contributors - * Released under MIT license - * Based on Underscore.js 1.8.3 - * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors - */ - var lodash = createCommonjsModule(function (module, exports) { (function() { @@ -45,7 +30,7 @@ var lodash = createCommonjsModule(function (module, exports) { var undefined$1; /** Used as the semantic version number. */ - var VERSION = '4.17.20'; + var VERSION = '4.17.15'; /** Used as the size to enable large array optimizations. */ var LARGE_ARRAY_SIZE = 200; @@ -455,7 +440,7 @@ var lodash = createCommonjsModule(function (module, exports) { var root = freeGlobal || freeSelf || Function('return this')(); /** Detect free variable `exports`. */ - var freeExports = exports && !exports.nodeType && exports; + var freeExports = exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module; @@ -3752,21 +3737,8 @@ var lodash = createCommonjsModule(function (module, exports) { * @returns {Array} Returns the new sorted array. */ function baseOrderBy(collection, iteratees, orders) { - if (iteratees.length) { - iteratees = arrayMap(iteratees, function(iteratee) { - if (isArray(iteratee)) { - return function(value) { - return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee); - } - } - return iteratee; - }); - } else { - iteratees = [identity]; - } - var index = -1; - iteratees = arrayMap(iteratees, baseUnary(getIteratee())); + iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee())); var result = baseMap(collection, function(value, key, collection) { var criteria = arrayMap(iteratees, function(iteratee) { @@ -4023,10 +3995,6 @@ var lodash = createCommonjsModule(function (module, exports) { var key = toKey(path[index]), newValue = value; - if (key === '__proto__' || key === 'constructor' || key === 'prototype') { - return object; - } - if (index != lastIndex) { var objValue = nested[key]; newValue = customizer ? customizer(objValue, key, nested) : undefined$1; @@ -4179,14 +4147,11 @@ var lodash = createCommonjsModule(function (module, exports) { * into `array`. */ function baseSortedIndexBy(array, value, iteratee, retHighest) { - var low = 0, - high = array == null ? 0 : array.length; - if (high === 0) { - return 0; - } - value = iteratee(value); - var valIsNaN = value !== value, + + var low = 0, + high = array == null ? 0 : array.length, + valIsNaN = value !== value, valIsNull = value === null, valIsSymbol = isSymbol(value), valIsUndefined = value === undefined$1; @@ -5671,11 +5636,10 @@ var lodash = createCommonjsModule(function (module, exports) { if (arrLength != othLength && !(isPartial && othLength > arrLength)) { return false; } - // Check that cyclic values are equal. - var arrStacked = stack.get(array); - var othStacked = stack.get(other); - if (arrStacked && othStacked) { - return arrStacked == other && othStacked == array; + // Assume cyclic values are equal. + var stacked = stack.get(array); + if (stacked && stack.get(other)) { + return stacked == other; } var index = -1, result = true, @@ -5837,11 +5801,10 @@ var lodash = createCommonjsModule(function (module, exports) { return false; } } - // Check that cyclic values are equal. - var objStacked = stack.get(object); - var othStacked = stack.get(other); - if (objStacked && othStacked) { - return objStacked == other && othStacked == object; + // Assume cyclic values are equal. + var stacked = stack.get(object); + if (stacked && stack.get(other)) { + return stacked == other; } var result = true; stack.set(object, other); @@ -9222,10 +9185,6 @@ var lodash = createCommonjsModule(function (module, exports) { * // The `_.property` iteratee shorthand. * _.filter(users, 'active'); * // => objects for ['barney'] - * - * // Combining several predicates using `_.overEvery` or `_.overSome`. - * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]])); - * // => objects for ['fred', 'barney'] */ function filter(collection, predicate) { var func = isArray(collection) ? arrayFilter : baseFilter; @@ -9975,15 +9934,15 @@ var lodash = createCommonjsModule(function (module, exports) { * var users = [ * { 'user': 'fred', 'age': 48 }, * { 'user': 'barney', 'age': 36 }, - * { 'user': 'fred', 'age': 30 }, + * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 34 } * ]; * * _.sortBy(users, [function(o) { return o.user; }]); - * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]] + * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] * * _.sortBy(users, ['user', 'age']); - * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]] + * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]] */ var sortBy = baseRest(function(collection, iteratees) { if (collection == null) { @@ -14858,11 +14817,11 @@ var lodash = createCommonjsModule(function (module, exports) { // Use a sourceURL for easier debugging. // The sourceURL gets injected into the source that's eval-ed, so be careful - // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in - // and escape the comment, thus injecting code that gets evaled. + // with lookup (in case of e.g. prototype pollution), and strip newlines if any. + // A newline wouldn't be a valid sourceURL anyway, and it'd enable code injection. var sourceURL = '//# sourceURL=' + (hasOwnProperty.call(options, 'sourceURL') - ? (options.sourceURL + '').replace(/\s/g, ' ') + ? (options.sourceURL + '').replace(/[\r\n]/g, ' ') : ('lodash.templateSources[' + (++templateCounter) + ']') ) + '\n'; @@ -14895,6 +14854,8 @@ var lodash = createCommonjsModule(function (module, exports) { // If `variable` is not specified wrap a with-statement around the generated // code to add the data object to the top of the scope chain. + // Like with sourceURL, we take care to not check the option's prototype, + // as this configuration is a code injection vector. var variable = hasOwnProperty.call(options, 'variable') && options.variable; if (!variable) { source = 'with (obj) {\n' + source + '\n}\n'; @@ -15601,9 +15562,6 @@ var lodash = createCommonjsModule(function (module, exports) { * values against any array or object value, respectively. See `_.isEqual` * for a list of supported value comparisons. * - * **Note:** Multiple values can be checked by combining several matchers - * using `_.overSome` - * * @static * @memberOf _ * @since 3.0.0 @@ -15619,10 +15577,6 @@ var lodash = createCommonjsModule(function (module, exports) { * * _.filter(objects, _.matches({ 'a': 4, 'c': 6 })); * // => [{ 'a': 4, 'b': 5, 'c': 6 }] - * - * // Checking for several possible values - * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })])); - * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }] */ function matches(source) { return baseMatches(baseClone(source, CLONE_DEEP_FLAG)); @@ -15637,9 +15591,6 @@ var lodash = createCommonjsModule(function (module, exports) { * `srcValue` values against any array or object value, respectively. See * `_.isEqual` for a list of supported value comparisons. * - * **Note:** Multiple values can be checked by combining several matchers - * using `_.overSome` - * * @static * @memberOf _ * @since 3.2.0 @@ -15656,10 +15607,6 @@ var lodash = createCommonjsModule(function (module, exports) { * * _.find(objects, _.matchesProperty('a', 4)); * // => { 'a': 4, 'b': 5, 'c': 6 } - * - * // Checking for several possible values - * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)])); - * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }] */ function matchesProperty(path, srcValue) { return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG)); @@ -15883,10 +15830,6 @@ var lodash = createCommonjsModule(function (module, exports) { * Creates a function that checks if **all** of the `predicates` return * truthy when invoked with the arguments it receives. * - * Following shorthands are possible for providing predicates. - * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate. - * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them. - * * @static * @memberOf _ * @since 4.0.0 @@ -15913,10 +15856,6 @@ var lodash = createCommonjsModule(function (module, exports) { * Creates a function that checks if **any** of the `predicates` return * truthy when invoked with the arguments it receives. * - * Following shorthands are possible for providing predicates. - * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate. - * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them. - * * @static * @memberOf _ * @since 4.0.0 @@ -15936,9 +15875,6 @@ var lodash = createCommonjsModule(function (module, exports) { * * func(NaN); * // => false - * - * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }]) - * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]]) */ var overSome = createOver(arraySome); @@ -17179,6 +17115,23 @@ var lodash = createCommonjsModule(function (module, exports) { } }.call(commonjsGlobal)); }); +var lodash_1 = lodash.compact; +var lodash_2 = lodash.get; +var lodash_3 = lodash.each; +var lodash_4 = lodash.isEqual; +var lodash_5 = lodash.some; +var lodash_6 = lodash.filter; +var lodash_7 = lodash.endsWith; +var lodash_8 = lodash.map; +var lodash_9 = lodash.has; +var lodash_10 = lodash.isFunction; +var lodash_11 = lodash.concat; +var lodash_12 = lodash.find; +var lodash_13 = lodash.defaults; +var lodash_14 = lodash.assign; +var lodash_15 = lodash.merge; +var lodash_16 = lodash.flatMap; +var lodash_17 = lodash.chain; var VerbosityLevel; (function (VerbosityLevel) { @@ -17195,22 +17148,22 @@ class ConsoleContext { warn(message) { if (this.verbosity < VerbosityLevel.Warning) return; - console.log(`${this.prefix}${lodash.isFunction(message) ? message() : message}`); + console.log(`${this.prefix}${lodash_10(message) ? message() : message}`); } error(message) { if (this.verbosity < VerbosityLevel.Error) return; - console.log(`${this.prefix}${lodash.isFunction(message) ? message() : message}`); + console.log(`${this.prefix}${lodash_10(message) ? message() : message}`); } info(message) { if (this.verbosity < VerbosityLevel.Info) return; - console.log(`${this.prefix}${lodash.isFunction(message) ? message() : message}`); + console.log(`${this.prefix}${lodash_10(message) ? message() : message}`); } debug(message) { if (this.verbosity < VerbosityLevel.Debug) return; - console.log(`${this.prefix}${lodash.isFunction(message) ? message() : message}`); + console.log(`${this.prefix}${lodash_10(message) ? message() : message}`); } } @@ -17221,12 +17174,12 @@ class RollupContext { this.context = context; this.prefix = prefix; this.hasContext = true; - this.hasContext = lodash.isFunction(this.context.warn) && lodash.isFunction(this.context.error); + this.hasContext = lodash_10(this.context.warn) && lodash_10(this.context.error); } warn(message) { if (this.verbosity < VerbosityLevel.Warning) return; - const text = lodash.isFunction(message) ? message() : message; + const text = lodash_10(message) ? message() : message; if (this.hasContext) this.context.warn(`${text}`); else @@ -17235,7 +17188,7 @@ class RollupContext { error(message) { if (this.verbosity < VerbosityLevel.Error) return; - const text = lodash.isFunction(message) ? message() : message; + const text = lodash_10(message) ? message() : message; if (this.hasContext) { if (this.bail) this.context.error(`${text}`); @@ -17248,13 +17201,13 @@ class RollupContext { info(message) { if (this.verbosity < VerbosityLevel.Info) return; - const text = lodash.isFunction(message) ? message() : message; + const text = lodash_10(message) ? message() : message; console.log(`${this.prefix}${text}`); } debug(message) { if (this.verbosity < VerbosityLevel.Debug) return; - const text = lodash.isFunction(message) ? message() : message; + const text = lodash_10(message) ? message() : message; console.log(`${this.prefix}${text}`); } } @@ -17269,13 +17222,13 @@ function normalize(fileName) { } class LanguageServiceHost { - constructor(parsedConfig, transformers, cwd) { + constructor(parsedConfig, transformers) { this.parsedConfig = parsedConfig; this.transformers = transformers; + this.cwd = process.cwd(); this.snapshots = {}; this.versions = {}; this.fileNames = new Set(parsedConfig.fileNames); - this.cwd = cwd; } reset() { this.snapshots = {}; @@ -17294,7 +17247,7 @@ class LanguageServiceHost { } getScriptSnapshot(fileName) { fileName = normalize(fileName); - if (lodash.has(this.snapshots, fileName)) + if (lodash_9(this.snapshots, fileName)) return this.snapshots[fileName]; const source = tsModule.sys.readFile(fileName); if (source) { @@ -17352,11 +17305,11 @@ class LanguageServiceHost { for (const creator of this.transformers) { const factory = creator(this.service); if (factory.before) - transformer.before = lodash.concat(transformer.before, factory.before); + transformer.before = lodash_11(transformer.before, factory.before); if (factory.after) - transformer.after = lodash.concat(transformer.after, factory.after); + transformer.after = lodash_11(transformer.after, factory.after); if (factory.afterDeclarations) - transformer.afterDeclarations = lodash.concat(transformer.afterDeclarations, factory.afterDeclarations); + transformer.afterDeclarations = lodash_11(transformer.afterDeclarations, factory.afterDeclarations); } return transformer; } @@ -17617,7 +17570,6 @@ function stackHas(key) { var _stackHas = stackHas; /** Detect free variable `global` from Node.js. */ - var freeGlobal = typeof commonjsGlobal == 'object' && commonjsGlobal && commonjsGlobal.Object === Object && commonjsGlobal; var _freeGlobal = freeGlobal; @@ -17919,9 +17871,9 @@ function getNative(object, key) { var _getNative = getNative; /* Built-in method references that are verified to be native. */ -var Map$1 = _getNative(_root, 'Map'); +var Map = _getNative(_root, 'Map'); -var _Map = Map$1; +var _Map = Map; /* Built-in method references that are verified to be native. */ var nativeCreate = _getNative(Object, 'create'); @@ -18528,7 +18480,7 @@ var stubFalse_1 = stubFalse; var isBuffer_1 = createCommonjsModule(function (module, exports) { /** Detect free variable `exports`. */ -var freeExports = exports && !exports.nodeType && exports; +var freeExports = exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module; @@ -18700,7 +18652,7 @@ var _baseUnary = baseUnary; var _nodeUtil = createCommonjsModule(function (module, exports) { /** Detect free variable `exports`. */ -var freeExports = exports && !exports.nodeType && exports; +var freeExports = exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module; @@ -19018,11 +18970,11 @@ var _baseKeysIn = baseKeysIn; * _.keysIn(new Foo); * // => ['a', 'b', 'c'] (iteration order is not guaranteed) */ -function keysIn(object) { +function keysIn$1(object) { return isArrayLike_1(object) ? _arrayLikeKeys(object, true) : _baseKeysIn(object); } -var keysIn_1 = keysIn; +var keysIn_1 = keysIn$1; /** * The base implementation of `_.assignIn` without support for multiple sources @@ -19041,7 +18993,7 @@ var _baseAssignIn = baseAssignIn; var _cloneBuffer = createCommonjsModule(function (module, exports) { /** Detect free variable `exports`. */ -var freeExports = exports && !exports.nodeType && exports; +var freeExports = exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module; @@ -19801,7 +19753,7 @@ function baseClone(value, bitmask, customizer, key, object, stack) { var keysFunc = isFull ? (isFlat ? _getAllKeysIn : _getAllKeys) - : (isFlat ? keysIn_1 : keys_1); + : (isFlat ? keysIn : keys_1); var props = isArr ? undefined : keysFunc(value); _arrayEach(props || value, function(subValue, key) { @@ -20193,11 +20145,10 @@ function equalArrays(array, other, bitmask, customizer, equalFunc, stack) { if (arrLength != othLength && !(isPartial && othLength > arrLength)) { return false; } - // Check that cyclic values are equal. - var arrStacked = stack.get(array); - var othStacked = stack.get(other); - if (arrStacked && othStacked) { - return arrStacked == other && othStacked == array; + // Assume cyclic values are equal. + var stacked = stack.get(array); + if (stacked && stack.get(other)) { + return stacked == other; } var index = -1, result = true, @@ -20432,11 +20383,10 @@ function equalObjects(object, other, bitmask, customizer, equalFunc, stack) { return false; } } - // Check that cyclic values are equal. - var objStacked = stack.get(object); - var othStacked = stack.get(other); - if (objStacked && othStacked) { - return objStacked == other && othStacked == object; + // Assume cyclic values are equal. + var stacked = stack.get(object); + if (stacked && stack.get(other)) { + return stacked == other; } var result = true; stack.set(object, other); @@ -21294,10 +21244,6 @@ var _baseIteratee = baseIteratee; * // The `_.property` iteratee shorthand. * _.filter(users, 'active'); * // => objects for ['barney'] - * - * // Combining several predicates using `_.overEvery` or `_.overSome`. - * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]])); - * // => objects for ['fred', 'barney'] */ function filter(collection, predicate) { var func = isArray_1(collection) ? _arrayFilter : _baseFilter; @@ -22376,22 +22322,20 @@ if (typeof commonjsRequire === "function") { union: union_1, values: values_1 }; - } catch (e) { - // continue regardless of error - } + } catch (e) {} } if (!lodash$1) { lodash$1 = window._; } -var lodash_1 = lodash$1; +var lodash_1$1 = lodash$1; var graph = Graph; -var DEFAULT_EDGE_NAME = "\x00"; -var GRAPH_NODE = "\x00"; -var EDGE_KEY_DELIM = "\x01"; +var DEFAULT_EDGE_NAME = "\x00", + GRAPH_NODE = "\x00", + EDGE_KEY_DELIM = "\x01"; // Implementation notes: // @@ -22404,18 +22348,18 @@ var EDGE_KEY_DELIM = "\x01"; // we're going to get to a performant hashtable in JavaScript. function Graph(opts) { - this._isDirected = lodash_1.has(opts, "directed") ? opts.directed : true; - this._isMultigraph = lodash_1.has(opts, "multigraph") ? opts.multigraph : false; - this._isCompound = lodash_1.has(opts, "compound") ? opts.compound : false; + this._isDirected = lodash_1$1.has(opts, "directed") ? opts.directed : true; + this._isMultigraph = lodash_1$1.has(opts, "multigraph") ? opts.multigraph : false; + this._isCompound = lodash_1$1.has(opts, "compound") ? opts.compound : false; // Label for the graph itself this._label = undefined; // Defaults to be set when creating a new node - this._defaultNodeLabelFn = lodash_1.constant(undefined); + this._defaultNodeLabelFn = lodash_1$1.constant(undefined); // Defaults to be set when creating a new edge - this._defaultEdgeLabelFn = lodash_1.constant(undefined); + this._defaultEdgeLabelFn = lodash_1$1.constant(undefined); // v -> label this._nodes = {}; @@ -22482,8 +22426,8 @@ Graph.prototype.graph = function() { /* === Node functions ========== */ Graph.prototype.setDefaultNodeLabel = function(newDefault) { - if (!lodash_1.isFunction(newDefault)) { - newDefault = lodash_1.constant(newDefault); + if (!lodash_1$1.isFunction(newDefault)) { + newDefault = lodash_1$1.constant(newDefault); } this._defaultNodeLabelFn = newDefault; return this; @@ -22494,27 +22438,27 @@ Graph.prototype.nodeCount = function() { }; Graph.prototype.nodes = function() { - return lodash_1.keys(this._nodes); + return lodash_1$1.keys(this._nodes); }; Graph.prototype.sources = function() { var self = this; - return lodash_1.filter(this.nodes(), function(v) { - return lodash_1.isEmpty(self._in[v]); + return lodash_1$1.filter(this.nodes(), function(v) { + return lodash_1$1.isEmpty(self._in[v]); }); }; Graph.prototype.sinks = function() { var self = this; - return lodash_1.filter(this.nodes(), function(v) { - return lodash_1.isEmpty(self._out[v]); + return lodash_1$1.filter(this.nodes(), function(v) { + return lodash_1$1.isEmpty(self._out[v]); }); }; Graph.prototype.setNodes = function(vs, value) { var args = arguments; var self = this; - lodash_1.each(vs, function(v) { + lodash_1$1.each(vs, function(v) { if (args.length > 1) { self.setNode(v, value); } else { @@ -22525,7 +22469,7 @@ Graph.prototype.setNodes = function(vs, value) { }; Graph.prototype.setNode = function(v, value) { - if (lodash_1.has(this._nodes, v)) { + if (lodash_1$1.has(this._nodes, v)) { if (arguments.length > 1) { this._nodes[v] = value; } @@ -22551,26 +22495,26 @@ Graph.prototype.node = function(v) { }; Graph.prototype.hasNode = function(v) { - return lodash_1.has(this._nodes, v); + return lodash_1$1.has(this._nodes, v); }; Graph.prototype.removeNode = function(v) { var self = this; - if (lodash_1.has(this._nodes, v)) { + if (lodash_1$1.has(this._nodes, v)) { var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); }; delete this._nodes[v]; if (this._isCompound) { this._removeFromParentsChildList(v); delete this._parent[v]; - lodash_1.each(this.children(v), function(child) { + lodash_1$1.each(this.children(v), function(child) { self.setParent(child); }); delete this._children[v]; } - lodash_1.each(lodash_1.keys(this._in[v]), removeEdge); + lodash_1$1.each(lodash_1$1.keys(this._in[v]), removeEdge); delete this._in[v]; delete this._preds[v]; - lodash_1.each(lodash_1.keys(this._out[v]), removeEdge); + lodash_1$1.each(lodash_1$1.keys(this._out[v]), removeEdge); delete this._out[v]; delete this._sucs[v]; --this._nodeCount; @@ -22583,14 +22527,14 @@ Graph.prototype.setParent = function(v, parent) { throw new Error("Cannot set parent in a non-compound graph"); } - if (lodash_1.isUndefined(parent)) { + if (lodash_1$1.isUndefined(parent)) { parent = GRAPH_NODE; } else { // Coerce parent to string parent += ""; for (var ancestor = parent; - !lodash_1.isUndefined(ancestor); - ancestor = this.parent(ancestor)) { + !lodash_1$1.isUndefined(ancestor); + ancestor = this.parent(ancestor)) { if (ancestor === v) { throw new Error("Setting " + parent+ " as parent of " + v + " would create a cycle"); @@ -22621,14 +22565,14 @@ Graph.prototype.parent = function(v) { }; Graph.prototype.children = function(v) { - if (lodash_1.isUndefined(v)) { + if (lodash_1$1.isUndefined(v)) { v = GRAPH_NODE; } if (this._isCompound) { var children = this._children[v]; if (children) { - return lodash_1.keys(children); + return lodash_1$1.keys(children); } } else if (v === GRAPH_NODE) { return this.nodes(); @@ -22640,21 +22584,21 @@ Graph.prototype.children = function(v) { Graph.prototype.predecessors = function(v) { var predsV = this._preds[v]; if (predsV) { - return lodash_1.keys(predsV); + return lodash_1$1.keys(predsV); } }; Graph.prototype.successors = function(v) { var sucsV = this._sucs[v]; if (sucsV) { - return lodash_1.keys(sucsV); + return lodash_1$1.keys(sucsV); } }; Graph.prototype.neighbors = function(v) { var preds = this.predecessors(v); if (preds) { - return lodash_1.union(preds, this.successors(v)); + return lodash_1$1.union(preds, this.successors(v)); } }; @@ -22678,13 +22622,13 @@ Graph.prototype.filterNodes = function(filter) { copy.setGraph(this.graph()); var self = this; - lodash_1.each(this._nodes, function(value, v) { + lodash_1$1.each(this._nodes, function(value, v) { if (filter(v)) { copy.setNode(v, value); } }); - lodash_1.each(this._edgeObjs, function(e) { + lodash_1$1.each(this._edgeObjs, function(e) { if (copy.hasNode(e.v) && copy.hasNode(e.w)) { copy.setEdge(e, self.edge(e)); } @@ -22704,7 +22648,7 @@ Graph.prototype.filterNodes = function(filter) { } if (this._isCompound) { - lodash_1.each(copy.nodes(), function(v) { + lodash_1$1.each(copy.nodes(), function(v) { copy.setParent(v, findParent(v)); }); } @@ -22715,8 +22659,8 @@ Graph.prototype.filterNodes = function(filter) { /* === Edge functions ========== */ Graph.prototype.setDefaultEdgeLabel = function(newDefault) { - if (!lodash_1.isFunction(newDefault)) { - newDefault = lodash_1.constant(newDefault); + if (!lodash_1$1.isFunction(newDefault)) { + newDefault = lodash_1$1.constant(newDefault); } this._defaultEdgeLabelFn = newDefault; return this; @@ -22727,13 +22671,13 @@ Graph.prototype.edgeCount = function() { }; Graph.prototype.edges = function() { - return lodash_1.values(this._edgeObjs); + return lodash_1$1.values(this._edgeObjs); }; Graph.prototype.setPath = function(vs, value) { - var self = this; - var args = arguments; - lodash_1.reduce(vs, function(v, w) { + var self = this, + args = arguments; + lodash_1$1.reduce(vs, function(v, w) { if (args.length > 1) { self.setEdge(v, w, value); } else { @@ -22749,9 +22693,9 @@ Graph.prototype.setPath = function(vs, value) { * setEdge({ v, w, [name] }, [value]) */ Graph.prototype.setEdge = function() { - var v, w, name, value; - var valueSpecified = false; - var arg0 = arguments[0]; + var v, w, name, value, + valueSpecified = false, + arg0 = arguments[0]; if (typeof arg0 === "object" && arg0 !== null && "v" in arg0) { v = arg0.v; @@ -22773,19 +22717,19 @@ Graph.prototype.setEdge = function() { v = "" + v; w = "" + w; - if (!lodash_1.isUndefined(name)) { + if (!lodash_1$1.isUndefined(name)) { name = "" + name; } var e = edgeArgsToId(this._isDirected, v, w, name); - if (lodash_1.has(this._edgeLabels, e)) { + if (lodash_1$1.has(this._edgeLabels, e)) { if (valueSpecified) { this._edgeLabels[e] = value; } return this; } - if (!lodash_1.isUndefined(name) && !this._isMultigraph) { + if (!lodash_1$1.isUndefined(name) && !this._isMultigraph) { throw new Error("Cannot set a named edge when isMultigraph = false"); } @@ -22813,23 +22757,23 @@ Graph.prototype.setEdge = function() { Graph.prototype.edge = function(v, w, name) { var e = (arguments.length === 1 - ? edgeObjToId(this._isDirected, arguments[0]) - : edgeArgsToId(this._isDirected, v, w, name)); + ? edgeObjToId(this._isDirected, arguments[0]) + : edgeArgsToId(this._isDirected, v, w, name)); return this._edgeLabels[e]; }; Graph.prototype.hasEdge = function(v, w, name) { var e = (arguments.length === 1 - ? edgeObjToId(this._isDirected, arguments[0]) - : edgeArgsToId(this._isDirected, v, w, name)); - return lodash_1.has(this._edgeLabels, e); + ? edgeObjToId(this._isDirected, arguments[0]) + : edgeArgsToId(this._isDirected, v, w, name)); + return lodash_1$1.has(this._edgeLabels, e); }; Graph.prototype.removeEdge = function(v, w, name) { var e = (arguments.length === 1 - ? edgeObjToId(this._isDirected, arguments[0]) - : edgeArgsToId(this._isDirected, v, w, name)); - var edge = this._edgeObjs[e]; + ? edgeObjToId(this._isDirected, arguments[0]) + : edgeArgsToId(this._isDirected, v, w, name)), + edge = this._edgeObjs[e]; if (edge) { v = edge.v; w = edge.w; @@ -22847,22 +22791,22 @@ Graph.prototype.removeEdge = function(v, w, name) { Graph.prototype.inEdges = function(v, u) { var inV = this._in[v]; if (inV) { - var edges = lodash_1.values(inV); + var edges = lodash_1$1.values(inV); if (!u) { return edges; } - return lodash_1.filter(edges, function(edge) { return edge.v === u; }); + return lodash_1$1.filter(edges, function(edge) { return edge.v === u; }); } }; Graph.prototype.outEdges = function(v, w) { var outV = this._out[v]; if (outV) { - var edges = lodash_1.values(outV); + var edges = lodash_1$1.values(outV); if (!w) { return edges; } - return lodash_1.filter(edges, function(edge) { return edge.w === w; }); + return lodash_1$1.filter(edges, function(edge) { return edge.w === w; }); } }; @@ -22894,7 +22838,7 @@ function edgeArgsToId(isDirected, v_, w_, name) { w = tmp; } return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM + - (lodash_1.isUndefined(name) ? DEFAULT_EDGE_NAME : name); + (lodash_1$1.isUndefined(name) ? DEFAULT_EDGE_NAME : name); } function edgeArgsToObj(isDirected, v_, w_, name) { @@ -22916,7 +22860,7 @@ function edgeObjToId(isDirected, edgeObj) { return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name); } -var version = '2.1.8'; +var version = '2.1.7'; // Includes only the "core" of graphlib var lib = { @@ -22939,21 +22883,21 @@ function write(g) { nodes: writeNodes(g), edges: writeEdges(g) }; - if (!lodash_1.isUndefined(g.graph())) { - json.value = lodash_1.clone(g.graph()); + if (!lodash_1$1.isUndefined(g.graph())) { + json.value = lodash_1$1.clone(g.graph()); } return json; } function writeNodes(g) { - return lodash_1.map(g.nodes(), function(v) { - var nodeValue = g.node(v); - var parent = g.parent(v); - var node = { v: v }; - if (!lodash_1.isUndefined(nodeValue)) { + return lodash_1$1.map(g.nodes(), function(v) { + var nodeValue = g.node(v), + parent = g.parent(v), + node = { v: v }; + if (!lodash_1$1.isUndefined(nodeValue)) { node.value = nodeValue; } - if (!lodash_1.isUndefined(parent)) { + if (!lodash_1$1.isUndefined(parent)) { node.parent = parent; } return node; @@ -22961,13 +22905,13 @@ function writeNodes(g) { } function writeEdges(g) { - return lodash_1.map(g.edges(), function(e) { - var edgeValue = g.edge(e); - var edge = { v: e.v, w: e.w }; - if (!lodash_1.isUndefined(e.name)) { + return lodash_1$1.map(g.edges(), function(e) { + var edgeValue = g.edge(e), + edge = { v: e.v, w: e.w }; + if (!lodash_1$1.isUndefined(e.name)) { edge.name = e.name; } - if (!lodash_1.isUndefined(edgeValue)) { + if (!lodash_1$1.isUndefined(edgeValue)) { edge.value = edgeValue; } return edge; @@ -22976,13 +22920,13 @@ function writeEdges(g) { function read(json) { var g = new graph(json.options).setGraph(json.value); - lodash_1.each(json.nodes, function(entry) { + lodash_1$1.each(json.nodes, function(entry) { g.setNode(entry.v, entry.value); if (entry.parent) { g.setParent(entry.v, entry.parent); } }); - lodash_1.each(json.edges, function(entry) { + lodash_1$1.each(json.edges, function(entry) { g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value); }); return g; @@ -22991,19 +22935,19 @@ function read(json) { var components_1 = components; function components(g) { - var visited = {}; - var cmpts = []; - var cmpt; + var visited = {}, + cmpts = [], + cmpt; function dfs(v) { - if (lodash_1.has(visited, v)) return; + if (lodash_1$1.has(visited, v)) return; visited[v] = true; cmpt.push(v); - lodash_1.each(g.successors(v), dfs); - lodash_1.each(g.predecessors(v), dfs); + lodash_1$1.each(g.successors(v), dfs); + lodash_1$1.each(g.predecessors(v), dfs); } - lodash_1.each(g.nodes(), function(v) { + lodash_1$1.each(g.nodes(), function(v) { cmpt = []; dfs(v); if (cmpt.length) { @@ -23046,7 +22990,7 @@ PriorityQueue.prototype.keys = function() { * Returns `true` if **key** is in the queue and `false` if not. */ PriorityQueue.prototype.has = function(key) { - return lodash_1.has(this._keyIndices, key); + return lodash_1$1.has(this._keyIndices, key); }; /** @@ -23084,7 +23028,7 @@ PriorityQueue.prototype.min = function() { PriorityQueue.prototype.add = function(key, priority) { var keyIndices = this._keyIndices; key = String(key); - if (!lodash_1.has(keyIndices, key)) { + if (!lodash_1$1.has(keyIndices, key)) { var arr = this._arr; var index = arr.length; keyIndices[key] = index; @@ -23125,9 +23069,9 @@ PriorityQueue.prototype.decrease = function(key, priority) { PriorityQueue.prototype._heapify = function(i) { var arr = this._arr; - var l = 2 * i; - var r = l + 1; - var largest = i; + var l = 2 * i, + r = l + 1, + largest = i; if (l < arr.length) { largest = arr[l].priority < arr[largest].priority ? l : largest; if (r < arr.length) { @@ -23167,24 +23111,24 @@ PriorityQueue.prototype._swap = function(i, j) { var dijkstra_1 = dijkstra; -var DEFAULT_WEIGHT_FUNC = lodash_1.constant(1); +var DEFAULT_WEIGHT_FUNC = lodash_1$1.constant(1); function dijkstra(g, source, weightFn, edgeFn) { return runDijkstra(g, String(source), - weightFn || DEFAULT_WEIGHT_FUNC, - edgeFn || function(v) { return g.outEdges(v); }); + weightFn || DEFAULT_WEIGHT_FUNC, + edgeFn || function(v) { return g.outEdges(v); }); } function runDijkstra(g, source, weightFn, edgeFn) { - var results = {}; - var pq = new priorityQueue(); - var v, vEntry; + var results = {}, + pq = new priorityQueue(), + v, vEntry; var updateNeighbors = function(edge) { - var w = edge.v !== v ? edge.v : edge.w; - var wEntry = results[w]; - var weight = weightFn(edge); - var distance = vEntry.distance + weight; + var w = edge.v !== v ? edge.v : edge.w, + wEntry = results[w], + weight = weightFn(edge), + distance = vEntry.distance + weight; if (weight < 0) { throw new Error("dijkstra does not allow negative edge weights. " + @@ -23220,7 +23164,7 @@ function runDijkstra(g, source, weightFn, edgeFn) { var dijkstraAll_1 = dijkstraAll; function dijkstraAll(g, weightFunc, edgeFunc) { - return lodash_1.transform(g.nodes(), function(acc, v) { + return lodash_1$1.transform(g.nodes(), function(acc, v) { acc[v] = dijkstra_1(g, v, weightFunc, edgeFunc); }, {}); } @@ -23228,10 +23172,10 @@ function dijkstraAll(g, weightFunc, edgeFunc) { var tarjan_1 = tarjan; function tarjan(g) { - var index = 0; - var stack = []; - var visited = {}; // node id -> { onStack, lowlink, index } - var results = []; + var index = 0, + stack = [], + visited = {}, // node id -> { onStack, lowlink, index } + results = []; function dfs(v) { var entry = visited[v] = { @@ -23242,7 +23186,7 @@ function tarjan(g) { stack.push(v); g.successors(v).forEach(function(w) { - if (!lodash_1.has(visited, w)) { + if (!lodash_1$1.has(visited, w)) { dfs(w); entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink); } else if (visited[w].onStack) { @@ -23251,8 +23195,8 @@ function tarjan(g) { }); if (entry.lowlink === entry.index) { - var cmpt = []; - var w; + var cmpt = [], + w; do { w = stack.pop(); visited[w].onStack = false; @@ -23263,7 +23207,7 @@ function tarjan(g) { } g.nodes().forEach(function(v) { - if (!lodash_1.has(visited, v)) { + if (!lodash_1$1.has(visited, v)) { dfs(v); } }); @@ -23274,24 +23218,24 @@ function tarjan(g) { var findCycles_1 = findCycles; function findCycles(g) { - return lodash_1.filter(tarjan_1(g), function(cmpt) { + return lodash_1$1.filter(tarjan_1(g), function(cmpt) { return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0])); }); } var floydWarshall_1 = floydWarshall; -var DEFAULT_WEIGHT_FUNC$1 = lodash_1.constant(1); +var DEFAULT_WEIGHT_FUNC$1 = lodash_1$1.constant(1); function floydWarshall(g, weightFn, edgeFn) { return runFloydWarshall(g, - weightFn || DEFAULT_WEIGHT_FUNC$1, - edgeFn || function(v) { return g.outEdges(v); }); + weightFn || DEFAULT_WEIGHT_FUNC$1, + edgeFn || function(v) { return g.outEdges(v); }); } function runFloydWarshall(g, weightFn, edgeFn) { - var results = {}; - var nodes = g.nodes(); + var results = {}, + nodes = g.nodes(); nodes.forEach(function(v) { results[v] = {}; @@ -23302,8 +23246,8 @@ function runFloydWarshall(g, weightFn, edgeFn) { } }); edgeFn(v).forEach(function(edge) { - var w = edge.v === v ? edge.w : edge.v; - var d = weightFn(edge); + var w = edge.v === v ? edge.w : edge.v, + d = weightFn(edge); results[v][w] = { distance: d, predecessor: v }; }); }); @@ -23332,27 +23276,27 @@ var topsort_1 = topsort; topsort.CycleException = CycleException; function topsort(g) { - var visited = {}; - var stack = {}; - var results = []; + var visited = {}, + stack = {}, + results = []; function visit(node) { - if (lodash_1.has(stack, node)) { + if (lodash_1$1.has(stack, node)) { throw new CycleException(); } - if (!lodash_1.has(visited, node)) { + if (!lodash_1$1.has(visited, node)) { stack[node] = true; visited[node] = true; - lodash_1.each(g.predecessors(node), visit); + lodash_1$1.each(g.predecessors(node), visit); delete stack[node]; results.push(node); } } - lodash_1.each(g.sinks(), visit); + lodash_1$1.each(g.sinks(), visit); - if (lodash_1.size(visited) !== g.nodeCount()) { + if (lodash_1$1.size(visited) !== g.nodeCount()) { throw new CycleException(); } @@ -23387,15 +23331,15 @@ var dfs_1 = dfs; * Order must be one of "pre" or "post". */ function dfs(g, vs, order) { - if (!lodash_1.isArray(vs)) { + if (!lodash_1$1.isArray(vs)) { vs = [vs]; } var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g); - var acc = []; - var visited = {}; - lodash_1.each(vs, function(v) { + var acc = [], + visited = {}; + lodash_1$1.each(vs, function(v) { if (!g.hasNode(v)) { throw new Error("Graph does not have node: " + v); } @@ -23406,11 +23350,11 @@ function dfs(g, vs, order) { } function doDfs(g, v, postorder, visited, navigation, acc) { - if (!lodash_1.has(visited, v)) { + if (!lodash_1$1.has(visited, v)) { visited[v] = true; if (!postorder) { acc.push(v); } - lodash_1.each(navigation(v), function(w) { + lodash_1$1.each(navigation(v), function(w) { doDfs(g, w, postorder, visited, navigation, acc); }); if (postorder) { acc.push(v); } @@ -23432,14 +23376,14 @@ function preorder(g, vs) { var prim_1 = prim; function prim(g, weightFunc) { - var result = new graph(); - var parents = {}; - var pq = new priorityQueue(); - var v; + var result = new graph(), + parents = {}, + pq = new priorityQueue(), + v; function updateNeighbors(edge) { - var w = edge.v === v ? edge.w : edge.v; - var pri = pq.priority(w); + var w = edge.v === v ? edge.w : edge.v, + pri = pq.priority(w); if (pri !== undefined) { var edgeWeight = weightFunc(edge); if (edgeWeight < pri) { @@ -23453,7 +23397,7 @@ function prim(g, weightFunc) { return result; } - lodash_1.each(g.nodes(), function(v) { + lodash_1$1.each(g.nodes(), function(v) { pq.add(v, Number.POSITIVE_INFINITY); result.setNode(v); }); @@ -23464,7 +23408,7 @@ function prim(g, weightFunc) { var init = false; while (pq.size() > 0) { v = pq.removeMin(); - if (lodash_1.has(parents, v)) { + if (lodash_1$1.has(parents, v)) { result.setEdge(v, parents[v]); } else if (init) { throw new Error("Input graph is not connected: " + g); @@ -23522,12 +23466,16 @@ var alg = { * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ + + var graphlib = { Graph: lib.Graph, json: json, alg: alg, version: lib.version }; +var graphlib_1 = graphlib.Graph; +var graphlib_3 = graphlib.alg; var objectHash_1 = createCommonjsModule(function (module, exports) { @@ -23585,29 +23533,26 @@ exports.keysMD5 = function(object){ }; // Internals -var hashes = crypto__default['default'].getHashes ? crypto__default['default'].getHashes().slice() : ['sha1', 'md5']; +var hashes = crypto.getHashes ? crypto.getHashes().slice() : ['sha1', 'md5']; hashes.push('passthrough'); var encodings = ['buffer', 'hex', 'binary', 'base64']; -function applyDefaults(object, sourceOptions){ - sourceOptions = sourceOptions || {}; - - // create a copy rather than mutating - var options = {}; - options.algorithm = sourceOptions.algorithm || 'sha1'; - options.encoding = sourceOptions.encoding || 'hex'; - options.excludeValues = sourceOptions.excludeValues ? true : false; +function applyDefaults(object, options){ + options = options || {}; + options.algorithm = options.algorithm || 'sha1'; + options.encoding = options.encoding || 'hex'; + options.excludeValues = options.excludeValues ? true : false; options.algorithm = options.algorithm.toLowerCase(); options.encoding = options.encoding.toLowerCase(); - options.ignoreUnknown = sourceOptions.ignoreUnknown !== true ? false : true; // default to false - options.respectType = sourceOptions.respectType === false ? false : true; // default to true - options.respectFunctionNames = sourceOptions.respectFunctionNames === false ? false : true; - options.respectFunctionProperties = sourceOptions.respectFunctionProperties === false ? false : true; - options.unorderedArrays = sourceOptions.unorderedArrays !== true ? false : true; // default to false - options.unorderedSets = sourceOptions.unorderedSets === false ? false : true; // default to false - options.unorderedObjects = sourceOptions.unorderedObjects === false ? false : true; // default to true - options.replacer = sourceOptions.replacer || undefined; - options.excludeKeys = sourceOptions.excludeKeys || undefined; + options.ignoreUnknown = options.ignoreUnknown !== true ? false : true; // default to false + options.respectType = options.respectType === false ? false : true; // default to true + options.respectFunctionNames = options.respectFunctionNames === false ? false : true; + options.respectFunctionProperties = options.respectFunctionProperties === false ? false : true; + options.unorderedArrays = options.unorderedArrays !== true ? false : true; // default to false + options.unorderedSets = options.unorderedSets === false ? false : true; // default to false + options.unorderedObjects = options.unorderedObjects === false ? false : true; // default to true + options.replacer = options.replacer || undefined; + options.excludeKeys = options.excludeKeys || undefined; if(typeof object === 'undefined') { throw new Error('Object argument required.'); @@ -23648,7 +23593,7 @@ function hash(object, options) { var hashingStream; if (options.algorithm !== 'passthrough') { - hashingStream = crypto__default['default'].createHash(options.algorithm); + hashingStream = crypto.createHash(options.algorithm); } else { hashingStream = new PassThrough(); } @@ -23660,9 +23605,8 @@ function hash(object, options) { var hasher = typeHasher(options, hashingStream); hasher.dispatch(object); - if (!hashingStream.update) { + if (!hashingStream.update) hashingStream.end(''); - } if (hashingStream.digest) { return hashingStream.digest(options.encoding === 'buffer' ? undefined : options.encoding); @@ -23698,11 +23642,10 @@ exports.writeToStream = function(object, options, stream) { function typeHasher(options, writeTo, context){ context = context || []; var write = function(str) { - if (writeTo.update) { + if (writeTo.update) return writeTo.update(str, 'utf8'); - } else { + else return writeTo.write(str, 'utf8'); - } }; return { @@ -23745,7 +23688,7 @@ function typeHasher(options, writeTo, context){ return write(object); } - if(objType !== 'object' && objType !== 'function' && objType !== 'asyncfunction') { + if(objType !== 'object' && objType !== 'function') { if(this['_' + objType]) { this['_' + objType](object); } else if (options.ignoreUnknown) { @@ -23753,7 +23696,7 @@ function typeHasher(options, writeTo, context){ } else { throw new Error('Unknown object type "' + objType + '"'); } - }else { + }else{ var keys = Object.keys(object); if (options.unorderedObjects) { keys = keys.sort(); @@ -23976,6 +23919,11 @@ function PassThrough() { }; } }); +var objectHash_2 = objectHash_1.sha1; +var objectHash_3 = objectHash_1.keys; +var objectHash_4 = objectHash_1.MD5; +var objectHash_5 = objectHash_1.keysMD5; +var objectHash_6 = objectHash_1.writeToStream; /** * Saves data in new cache folder or reads it from old one. @@ -24015,7 +23963,7 @@ class RollingCache { return false; if (!fs.existsSync(this.oldCacheRoot)) return names.length === 0; // empty folder matches - return lodash.isEqual(fs.readdirSync(this.oldCacheRoot).sort(), names.sort()); + return lodash_4(fs.readdirSync(this.oldCacheRoot).sort(), names.sort()); } /** * @returns data for name, must exist in old cache (or either old of new cache if checkNewCache is true) @@ -24045,12 +23993,11 @@ class RollingCache { return; this.rolled = true; fsExtra.removeSync(this.oldCacheRoot); - if (fs.existsSync(this.newCacheRoot)) { - fs.renameSync(this.newCacheRoot, this.oldCacheRoot); - } + fs.renameSync(this.newCacheRoot, this.oldCacheRoot); } } +var styles_1 = createCommonjsModule(function (module) { /* The MIT License (MIT) @@ -24076,7 +24023,6 @@ THE SOFTWARE. */ -var styles_1 = createCommonjsModule(function (module) { var styles = {}; module['exports'] = styles; @@ -24102,14 +24048,6 @@ var codes = { gray: [90, 39], grey: [90, 39], - brightRed: [91, 39], - brightGreen: [92, 39], - brightYellow: [93, 39], - brightBlue: [94, 39], - brightMagenta: [95, 39], - brightCyan: [96, 39], - brightWhite: [97, 39], - bgBlack: [40, 49], bgRed: [41, 49], bgGreen: [42, 49], @@ -24118,16 +24056,6 @@ var codes = { bgMagenta: [45, 49], bgCyan: [46, 49], bgWhite: [47, 49], - bgGray: [100, 49], - bgGrey: [100, 49], - - bgBrightRed: [101, 49], - bgBrightGreen: [102, 49], - bgBrightYellow: [103, 49], - bgBrightBlue: [104, 49], - bgBrightMagenta: [105, 49], - bgBrightCyan: [106, 49], - bgBrightWhite: [107, 49], // legacy styles for colors pre v1.0.0 blackBG: [40, 49], @@ -24183,34 +24111,6 @@ var hasFlag = function(flag, argv) { return pos !== -1 && (terminatorPos === -1 ? true : pos < terminatorPos); }; -/* -The MIT License (MIT) - -Copyright (c) Sindre Sorhus (sindresorhus.com) - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in -all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -THE SOFTWARE. - -*/ - - - - var env = process.env; var forceColor = void 0; @@ -24265,7 +24165,7 @@ function supportsColor(stream) { // release, and Node.js 7 is not. Windows 10 build 10586 is the first // Windows release that supports 256 colors. Windows 10 build 14931 is the // first release that supports 16m/TrueColor. - var osRelease = os__default['default'].release().split('.'); + var osRelease = os.release().split('.'); if (Number(process.versions.node.split('.')[0]) >= 8 && Number(osRelease[0]) >= 10 && Number(osRelease[2]) >= 10586) { return Number(osRelease[2]) >= 14931 ? 3 : 2; @@ -24532,8 +24432,7 @@ module['exports'] = function(colors) { var random = createCommonjsModule(function (module) { module['exports'] = function(colors) { var available = ['underline', 'inverse', 'grey', 'yellow', 'red', 'green', - 'blue', 'white', 'cyan', 'magenta', 'brightYellow', 'brightRed', - 'brightGreen', 'brightBlue', 'brightWhite', 'brightCyan', 'brightMagenta']; + 'blue', 'white', 'cyan', 'magenta']; return function(letter, i, exploded) { return letter === ' ' ? letter : colors[ @@ -24543,6 +24442,7 @@ module['exports'] = function(colors) { }; }); +var colors_1 = createCommonjsModule(function (module) { /* The MIT License (MIT) @@ -24573,7 +24473,6 @@ THE SOFTWARE. */ -var colors_1 = createCommonjsModule(function (module) { var colors = {}; module['exports'] = colors; @@ -24603,21 +24502,12 @@ colors.stripColors = colors.strip = function(str) { }; // eslint-disable-next-line no-unused-vars -colors.stylize = function stylize(str, style) { +var stylize = colors.stylize = function stylize(str, style) { if (!colors.enabled) { return str+''; } - var styleMap = ansiStyles[style]; - - // Stylize should work for non-ANSI styles, too - if(!styleMap && style in colors){ - // Style maps like trap operate as functions on strings; - // they don't have properties like open or close. - return colors[style](str); - } - - return styleMap.open + str + styleMap.close; + return ansiStyles[style].open + str + ansiStyles[style].close; }; var matchOperatorsRe = /[|\\{}()[\]^$+*?.]/g; @@ -24660,11 +24550,10 @@ function applyStyle() { var args = Array.prototype.slice.call(arguments); var str = args.map(function(arg) { - // Use weak equality check so we can colorize null/undefined in safe mode - if (arg != null && arg.constructor === String) { + if (arg !== undefined && arg.constructor === String) { return arg; } else { - return require$$0__default['default'].inspect(arg); + return util.inspect(arg); } }).join(' '); @@ -24769,6 +24658,11 @@ var safe = createCommonjsModule(function (module) { module['exports'] = colors_1; }); +var safe_1 = safe.green; +var safe_2 = safe.white; +var safe_3 = safe.red; +var safe_4 = safe.yellow; +var safe_5 = safe.blue; class FormatHost { getCurrentDirectory() { @@ -24810,11 +24704,11 @@ class NoCache { function convertEmitOutput(output, references) { const out = { code: "", references }; output.outputFiles.forEach((e) => { - if (lodash.endsWith(e.name, ".d.ts")) + if (lodash_7(e.name, ".d.ts")) out.dts = e; - else if (lodash.endsWith(e.name, ".d.ts.map")) + else if (lodash_7(e.name, ".d.ts.map")) out.dtsmap = e; - else if (lodash.endsWith(e.name, ".map")) + else if (lodash_7(e.name, ".map")) out.map = e.text; else out.code = e.text; @@ -24825,13 +24719,13 @@ function getAllReferences(importer, snapshot, options) { if (!snapshot) return []; const info = tsModule.preProcessFile(snapshot.getText(0, snapshot.getLength()), true, true); - return lodash.compact(lodash.concat(info.referencedFiles, info.importedFiles).map((reference) => { + return lodash_1(lodash_11(info.referencedFiles, info.importedFiles).map((reference) => { const resolved = tsModule.nodeModuleNameResolver(reference.fileName, importer, options, tsModule.sys); return resolved.resolvedModule ? resolved.resolvedModule.resolvedFileName : undefined; })); } function convertDiagnostic(type, data) { - return lodash.map(data, (diagnostic) => { + return lodash_8(data, (diagnostic) => { const entry = { flatMessage: tsModule.flattenDiagnosticMessageText(diagnostic.messageText, "\n"), formatted: tsModule.formatDiagnosticsWithColorAndContext(data, formatHost), @@ -24868,12 +24762,12 @@ class TsCache { tsVersion: tsModule.version, }, this.hashOptions)}`; } - this.dependencyTree = new graphlib.Graph({ directed: true }); + this.dependencyTree = new graphlib_1({ directed: true }); this.dependencyTree.setDefaultNodeLabel((_node) => ({ dirty: false })); - const automaticTypes = lodash.map(tsModule.getAutomaticTypeDirectiveNames(options, tsModule.sys), (entry) => tsModule.resolveTypeReferenceDirective(entry, undefined, options, tsModule.sys)) + const automaticTypes = lodash_8(tsModule.getAutomaticTypeDirectiveNames(options, tsModule.sys), (entry) => tsModule.resolveTypeReferenceDirective(entry, undefined, options, tsModule.sys)) .filter((entry) => entry.resolvedTypeReferenceDirective && entry.resolvedTypeReferenceDirective.resolvedFileName) .map((entry) => entry.resolvedTypeReferenceDirective.resolvedFileName); - this.ambientTypes = lodash.filter(rootFilenames, (file) => lodash.endsWith(file, ".d.ts")) + this.ambientTypes = lodash_6(rootFilenames, (file) => lodash_7(file, ".d.ts")) .concat(automaticTypes) .map((id) => ({ id, snapshot: this.host.getScriptSnapshot(id) })); this.init(); @@ -24885,7 +24779,7 @@ class TsCache { entries.forEach((e) => { const dir = `${this.cacheRoot}/${e}`; if (e.startsWith(this.cachePrefix) && fsExtra.statSync(dir).isDirectory) { - this.context.info(safe.blue(`cleaning cache: ${dir}`)); + this.context.info(safe_5(`cleaning cache: ${dir}`)); fsExtra.emptyDirSync(`${dir}`); fsExtra.removeSync(`${dir}`); } @@ -24897,21 +24791,21 @@ class TsCache { } setDependency(importee, importer) { // importee -> importer - this.context.debug(`${safe.blue("dependency")} '${importee}'`); + this.context.debug(`${safe_5("dependency")} '${importee}'`); this.context.debug(` imported by '${importer}'`); this.dependencyTree.setEdge(importer, importee); } walkTree(cb) { - const acyclic = graphlib.alg.isAcyclic(this.dependencyTree); + const acyclic = graphlib_3.isAcyclic(this.dependencyTree); if (acyclic) { - lodash.each(graphlib.alg.topsort(this.dependencyTree), (id) => cb(id)); + lodash_3(graphlib_3.topsort(this.dependencyTree), (id) => cb(id)); return; } - this.context.info(safe.yellow("import tree has cycles")); - lodash.each(this.dependencyTree.nodes(), (id) => cb(id)); + this.context.info(safe_4("import tree has cycles")); + lodash_3(this.dependencyTree.nodes(), (id) => cb(id)); } done() { - this.context.info(safe.blue("rolling caches")); + this.context.info(safe_5("rolling caches")); this.codeCache.roll(); this.semanticDiagnosticsCache.roll(); this.syntacticDiagnosticsCache.roll(); @@ -24919,24 +24813,24 @@ class TsCache { } getCompiled(id, snapshot, transform) { if (this.noCache) { - this.context.info(`${safe.blue("transpiling")} '${id}'`); + this.context.info(`${safe_5("transpiling")} '${id}'`); this.markAsDirty(id); return transform(); } const name = this.makeName(id, snapshot); - this.context.info(`${safe.blue("transpiling")} '${id}'`); + this.context.info(`${safe_5("transpiling")} '${id}'`); this.context.debug(` cache: '${this.codeCache.path(name)}'`); if (this.codeCache.exists(name) && !this.isDirty(id, false)) { - this.context.debug(safe.green(" cache hit")); + this.context.debug(safe_1(" cache hit")); const data = this.codeCache.read(name); if (data) { this.codeCache.write(name, data); return data; } else - this.context.warn(safe.yellow(" cache broken, discarding")); + this.context.warn(safe_4(" cache broken, discarding")); } - this.context.debug(safe.yellow(" cache miss")); + this.context.debug(safe_4(" cache miss")); const transformedData = transform(); this.codeCache.write(name, transformedData); this.markAsDirty(id); @@ -24953,8 +24847,8 @@ class TsCache { this.ambientTypesDirty = true; return; } - this.context.debug(safe.blue("Ambient types:")); - const typeNames = lodash.filter(this.ambientTypes, (snapshot) => snapshot.snapshot !== undefined) + this.context.debug(safe_5("Ambient types:")); + const typeNames = lodash_6(this.ambientTypes, (snapshot) => snapshot.snapshot !== undefined) .map((snapshot) => { this.context.debug(` ${snapshot.id}`); return this.makeName(snapshot.id, snapshot.snapshot); @@ -24962,8 +24856,8 @@ class TsCache { // types dirty if any d.ts changed, added or removed this.ambientTypesDirty = !this.typesCache.match(typeNames); if (this.ambientTypesDirty) - this.context.info(safe.yellow("ambient types changed, redoing all semantic diagnostics")); - lodash.each(typeNames, (name) => this.typesCache.touch(name)); + this.context.info(safe_4("ambient types changed, redoing all semantic diagnostics")); + lodash_3(typeNames, (name) => this.typesCache.touch(name)); } getDiagnostics(type, cache, id, snapshot, check) { if (this.noCache) { @@ -24973,16 +24867,16 @@ class TsCache { const name = this.makeName(id, snapshot); this.context.debug(` cache: '${cache.path(name)}'`); if (cache.exists(name) && !this.isDirty(id, true)) { - this.context.debug(safe.green(" cache hit")); + this.context.debug(safe_1(" cache hit")); const data = cache.read(name); if (data) { cache.write(name, data); return data; } else - this.context.warn(safe.yellow(" cache broken, discarding")); + this.context.warn(safe_4(" cache broken, discarding")); } - this.context.debug(safe.yellow(" cache miss")); + this.context.debug(safe_4(" cache miss")); const convertedData = convertDiagnostic(type, check()); cache.write(name, convertedData); this.markAsDirty(id); @@ -25016,8 +24910,8 @@ class TsCache { return label.dirty; if (this.ambientTypesDirty) return true; - const dependencies = graphlib.alg.dijkstra(this.dependencyTree, id); - return lodash.some(dependencies, (dependency, node) => { + const dependencies = graphlib_3.dijkstra(this.dependencyTree, id); + return lodash_5(dependencies, (dependency, node) => { if (!node || dependency.distance === Infinity) return false; const l = this.dependencyTree.node(node); @@ -25034,25 +24928,25 @@ class TsCache { } function printDiagnostics(context, diagnostics, pretty) { - lodash.each(diagnostics, (diagnostic) => { + lodash_3(diagnostics, (diagnostic) => { let print; let color; let category; switch (diagnostic.category) { case tsModule.DiagnosticCategory.Message: print = context.info; - color = safe.white; + color = safe_2; category = ""; break; case tsModule.DiagnosticCategory.Error: print = context.error; - color = safe.red; + color = safe_3; category = "error"; break; case tsModule.DiagnosticCategory.Warning: default: print = context.warn; - color = safe.yellow; + color = safe_4; category = "warning"; break; } @@ -25068,6 +24962,8 @@ function printDiagnostics(context, diagnostics, pretty) { }); } +// tslint:disable-next-line:no-var-requires +const createRollupFilter = require("rollup-pluginutils").createFilter; function getOptionsOverrides({ useTsconfigDeclarationDir, cacheRoot }, preParsedTsconfig) { const overrides = { noEmitHelpers: false, @@ -25082,9 +24978,11 @@ function getOptionsOverrides({ useTsconfigDeclarationDir, cacheRoot }, preParsed if (preParsedTsconfig) { if (preParsedTsconfig.options.module === undefined) overrides.module = tsModule.ModuleKind.ES2015; - // only set declarationDir if useTsconfigDeclarationDir is enabled - if (!useTsconfigDeclarationDir) + const declaration = preParsedTsconfig.options.declaration; + if (!declaration) overrides.declarationDir = undefined; + if (declaration && !useTsconfigDeclarationDir) + overrides.declarationDir = process.cwd(); // unsetting sourceRoot if sourceMap is not enabled (in case original tsconfig had inlineSourceMap set that is being unset and would cause TS5051) const sourceMap = preParsedTsconfig.options.sourceMap; if (!sourceMap) @@ -25093,7 +24991,7 @@ function getOptionsOverrides({ useTsconfigDeclarationDir, cacheRoot }, preParsed return overrides; } function expandIncludeWithDirs(include, dirs) { - return lodash.chain(dirs) + return lodash_17(dirs) .flatMap((root) => { if (include instanceof Array) return include.map((x) => path.join(root, x)); @@ -25111,27 +25009,27 @@ function createFilter(context, pluginOptions, parsedConfig) { excluded = expandIncludeWithDirs(excluded, parsedConfig.options.rootDirs); } if (parsedConfig.projectReferences) { - included = lodash.concat(included, expandIncludeWithDirs(included, parsedConfig.projectReferences.map((x) => x.path))); - excluded = lodash.concat(excluded, expandIncludeWithDirs(excluded, parsedConfig.projectReferences.map((x) => x.path))); + included = lodash_11(included, expandIncludeWithDirs(included, parsedConfig.projectReferences.map((x) => x.path))); + excluded = lodash_11(excluded, expandIncludeWithDirs(excluded, parsedConfig.projectReferences.map((x) => x.path))); } context.debug(() => `included:\n${JSON.stringify(included, undefined, 4)}`); context.debug(() => `excluded:\n${JSON.stringify(excluded, undefined, 4)}`); - return pluginutils.createFilter(included, excluded, { resolve: parsedConfig.options.rootDir }); + return createRollupFilter(included, excluded); } function checkTsConfig(parsedConfig) { const module = parsedConfig.options.module; - if (module !== tsModule.ModuleKind.ES2015 && module !== tsModule.ModuleKind.ESNext && module !== tsModule.ModuleKind.ES2020) + if (module !== tsModule.ModuleKind.ES2015 && module !== tsModule.ModuleKind.ESNext) throw new Error(`Incompatible tsconfig option. Module resolves to '${tsModule.ModuleKind[module]}'. This is incompatible with rollup, please use 'module: "ES2015"' or 'module: "ESNext"'.`); } function parseTsConfig(context, pluginOptions) { - const fileName = tsModule.findConfigFile(pluginOptions.cwd, tsModule.sys.fileExists, pluginOptions.tsconfig); + const fileName = tsModule.findConfigFile(process.cwd(), tsModule.sys.fileExists, pluginOptions.tsconfig); // if the value was provided, but no file, fail hard if (pluginOptions.tsconfig !== undefined && !fileName) throw new Error(`failed to open '${fileName}'`); let loadedConfig = {}; - let baseDir = pluginOptions.cwd; + let baseDir = process.cwd(); let configFileName; let pretty = false; if (fileName) { @@ -25139,7 +25037,7 @@ function parseTsConfig(context, pluginOptions) { if (text === undefined) throw new Error(`failed to read '${fileName}'`); const result = tsModule.parseConfigFileTextToJson(fileName, text); - pretty = lodash.get(result.config, "pretty", pretty); + pretty = lodash_2(result.config, "pretty", pretty); if (result.error !== undefined) { printDiagnostics(context, convertDiagnostic("config", [result.error]), pretty); throw new Error(`failed to parse '${fileName}'`); @@ -25149,7 +25047,7 @@ function parseTsConfig(context, pluginOptions) { configFileName = fileName; } const mergedConfig = {}; - lodash.merge(mergedConfig, pluginOptions.tsconfigDefaults, loadedConfig, pluginOptions.tsconfigOverride); + lodash_15(mergedConfig, pluginOptions.tsconfigDefaults, loadedConfig, pluginOptions.tsconfigOverride); const preParsedTsConfig = tsModule.parseJsonConfigFileContent(mergedConfig, tsModule.sys, baseDir, getOptionsOverrides(pluginOptions), configFileName); const compilerOptionsOverride = getOptionsOverrides(pluginOptions, preParsedTsConfig); const parsedTsConfig = tsModule.parseJsonConfigFileContent(mergedConfig, tsModule.sys, baseDir, compilerOptionsOverride, configFileName); @@ -25177,52 +25075,44 @@ catch (e) { throw e; } +var semver = createCommonjsModule(function (module, exports) { +exports = module.exports = SemVer; + +var debug; +/* istanbul ignore next */ +if (typeof process === 'object' && + process.env && + process.env.NODE_DEBUG && + /\bsemver\b/i.test(process.env.NODE_DEBUG)) { + debug = function () { + var args = Array.prototype.slice.call(arguments, 0); + args.unshift('SEMVER'); + console.log.apply(console, args); + }; +} else { + debug = function () {}; +} + // Note: this is the semver.org version of the spec that it implements // Not necessarily the package version of this code. -const SEMVER_SPEC_VERSION = '2.0.0'; +exports.SEMVER_SPEC_VERSION = '2.0.0'; -const MAX_LENGTH = 256; -const MAX_SAFE_INTEGER$2 = Number.MAX_SAFE_INTEGER || +var MAX_LENGTH = 256; +var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */ 9007199254740991; // Max safe segment length for coercion. -const MAX_SAFE_COMPONENT_LENGTH = 16; - -var constants = { - SEMVER_SPEC_VERSION, - MAX_LENGTH, - MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$2, - MAX_SAFE_COMPONENT_LENGTH -}; - -const debug = ( - typeof process === 'object' && - process.env && - process.env.NODE_DEBUG && - /\bsemver\b/i.test(process.env.NODE_DEBUG) -) ? (...args) => console.error('SEMVER', ...args) - : () => {}; - -var debug_1 = debug; - -var re_1 = createCommonjsModule(function (module, exports) { -const { MAX_SAFE_COMPONENT_LENGTH } = constants; - -exports = module.exports = {}; +var MAX_SAFE_COMPONENT_LENGTH = 16; // The actual regexps go on exports.re -const re = exports.re = []; -const src = exports.src = []; -const t = exports.t = {}; -let R = 0; - -const createToken = (name, value, isGlobal) => { - const index = R++; - debug_1(index, value); - t[name] = index; - src[index] = value; - re[index] = new RegExp(value, isGlobal ? 'g' : undefined); -}; +var re = exports.re = []; +var src = exports.src = []; +var t = exports.tokens = {}; +var R = 0; + +function tok (n) { + t[n] = R++; +} // The following Regular Expressions can be used for tokenizing, // validating, and parsing SemVer version strings. @@ -25230,56 +25120,67 @@ const createToken = (name, value, isGlobal) => { // ## Numeric Identifier // A single `0`, or a non-zero digit followed by zero or more digits. -createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*'); -createToken('NUMERICIDENTIFIERLOOSE', '[0-9]+'); +tok('NUMERICIDENTIFIER'); +src[t.NUMERICIDENTIFIER] = '0|[1-9]\\d*'; +tok('NUMERICIDENTIFIERLOOSE'); +src[t.NUMERICIDENTIFIERLOOSE] = '[0-9]+'; // ## Non-numeric Identifier // Zero or more digits, followed by a letter or hyphen, and then zero or // more letters, digits, or hyphens. -createToken('NONNUMERICIDENTIFIER', '\\d*[a-zA-Z-][a-zA-Z0-9-]*'); +tok('NONNUMERICIDENTIFIER'); +src[t.NONNUMERICIDENTIFIER] = '\\d*[a-zA-Z-][a-zA-Z0-9-]*'; // ## Main Version // Three dot-separated numeric identifiers. -createToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\.` + - `(${src[t.NUMERICIDENTIFIER]})\\.` + - `(${src[t.NUMERICIDENTIFIER]})`); +tok('MAINVERSION'); +src[t.MAINVERSION] = '(' + src[t.NUMERICIDENTIFIER] + ')\\.' + + '(' + src[t.NUMERICIDENTIFIER] + ')\\.' + + '(' + src[t.NUMERICIDENTIFIER] + ')'; -createToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` + - `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` + - `(${src[t.NUMERICIDENTIFIERLOOSE]})`); +tok('MAINVERSIONLOOSE'); +src[t.MAINVERSIONLOOSE] = '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' + + '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' + + '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')'; // ## Pre-release Version Identifier // A numeric identifier, or a non-numeric identifier. -createToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER] -}|${src[t.NONNUMERICIDENTIFIER]})`); +tok('PRERELEASEIDENTIFIER'); +src[t.PRERELEASEIDENTIFIER] = '(?:' + src[t.NUMERICIDENTIFIER] + + '|' + src[t.NONNUMERICIDENTIFIER] + ')'; -createToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE] -}|${src[t.NONNUMERICIDENTIFIER]})`); +tok('PRERELEASEIDENTIFIERLOOSE'); +src[t.PRERELEASEIDENTIFIERLOOSE] = '(?:' + src[t.NUMERICIDENTIFIERLOOSE] + + '|' + src[t.NONNUMERICIDENTIFIER] + ')'; // ## Pre-release Version // Hyphen, followed by one or more dot-separated pre-release version // identifiers. -createToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER] -}(?:\\.${src[t.PRERELEASEIDENTIFIER]})*))`); +tok('PRERELEASE'); +src[t.PRERELEASE] = '(?:-(' + src[t.PRERELEASEIDENTIFIER] + + '(?:\\.' + src[t.PRERELEASEIDENTIFIER] + ')*))'; -createToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE] -}(?:\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`); +tok('PRERELEASELOOSE'); +src[t.PRERELEASELOOSE] = '(?:-?(' + src[t.PRERELEASEIDENTIFIERLOOSE] + + '(?:\\.' + src[t.PRERELEASEIDENTIFIERLOOSE] + ')*))'; // ## Build Metadata Identifier // Any combination of digits, letters, or hyphens. -createToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+'); +tok('BUILDIDENTIFIER'); +src[t.BUILDIDENTIFIER] = '[0-9A-Za-z-]+'; // ## Build Metadata // Plus sign, followed by one or more period-separated build metadata // identifiers. -createToken('BUILD', `(?:\\+(${src[t.BUILDIDENTIFIER] -}(?:\\.${src[t.BUILDIDENTIFIER]})*))`); +tok('BUILD'); +src[t.BUILD] = '(?:\\+(' + src[t.BUILDIDENTIFIER] + + '(?:\\.' + src[t.BUILDIDENTIFIER] + ')*))'; // ## Full Version String // A main version, followed optionally by a pre-release version and @@ -25290,438 +25191,153 @@ createToken('BUILD', `(?:\\+(${src[t.BUILDIDENTIFIER] // capturing group, because it should not ever be used in version // comparison. -createToken('FULLPLAIN', `v?${src[t.MAINVERSION] -}${src[t.PRERELEASE]}?${ - src[t.BUILD]}?`); +tok('FULL'); +tok('FULLPLAIN'); +src[t.FULLPLAIN] = 'v?' + src[t.MAINVERSION] + + src[t.PRERELEASE] + '?' + + src[t.BUILD] + '?'; -createToken('FULL', `^${src[t.FULLPLAIN]}$`); +src[t.FULL] = '^' + src[t.FULLPLAIN] + '$'; // like full, but allows v1.2.3 and =1.2.3, which people do sometimes. // also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty // common in the npm registry. -createToken('LOOSEPLAIN', `[v=\\s]*${src[t.MAINVERSIONLOOSE] -}${src[t.PRERELEASELOOSE]}?${ - src[t.BUILD]}?`); +tok('LOOSEPLAIN'); +src[t.LOOSEPLAIN] = '[v=\\s]*' + src[t.MAINVERSIONLOOSE] + + src[t.PRERELEASELOOSE] + '?' + + src[t.BUILD] + '?'; -createToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`); +tok('LOOSE'); +src[t.LOOSE] = '^' + src[t.LOOSEPLAIN] + '$'; -createToken('GTLT', '((?:<|>)?=?)'); +tok('GTLT'); +src[t.GTLT] = '((?:<|>)?=?)'; // Something like "2.*" or "1.2.x". // Note that "x.x" is a valid xRange identifer, meaning "any version" // Only the first item is strictly required. -createToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`); -createToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\*`); - -createToken('XRANGEPLAIN', `[v=\\s]*(${src[t.XRANGEIDENTIFIER]})` + - `(?:\\.(${src[t.XRANGEIDENTIFIER]})` + - `(?:\\.(${src[t.XRANGEIDENTIFIER]})` + - `(?:${src[t.PRERELEASE]})?${ - src[t.BUILD]}?` + - `)?)?`); - -createToken('XRANGEPLAINLOOSE', `[v=\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` + - `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` + - `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` + - `(?:${src[t.PRERELEASELOOSE]})?${ - src[t.BUILD]}?` + - `)?)?`); - -createToken('XRANGE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAIN]}$`); -createToken('XRANGELOOSE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAINLOOSE]}$`); +tok('XRANGEIDENTIFIERLOOSE'); +src[t.XRANGEIDENTIFIERLOOSE] = src[t.NUMERICIDENTIFIERLOOSE] + '|x|X|\\*'; +tok('XRANGEIDENTIFIER'); +src[t.XRANGEIDENTIFIER] = src[t.NUMERICIDENTIFIER] + '|x|X|\\*'; + +tok('XRANGEPLAIN'); +src[t.XRANGEPLAIN] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIER] + ')' + + '(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' + + '(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' + + '(?:' + src[t.PRERELEASE] + ')?' + + src[t.BUILD] + '?' + + ')?)?'; + +tok('XRANGEPLAINLOOSE'); +src[t.XRANGEPLAINLOOSE] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + + '(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + + '(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + + '(?:' + src[t.PRERELEASELOOSE] + ')?' + + src[t.BUILD] + '?' + + ')?)?'; + +tok('XRANGE'); +src[t.XRANGE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAIN] + '$'; +tok('XRANGELOOSE'); +src[t.XRANGELOOSE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAINLOOSE] + '$'; // Coercion. // Extract anything that could conceivably be a part of a valid semver -createToken('COERCE', `${'(^|[^\\d])' + - '(\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` + - `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` + - `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` + - `(?:$|[^\\d])`); -createToken('COERCERTL', src[t.COERCE], true); +tok('COERCE'); +src[t.COERCE] = '(^|[^\\d])' + + '(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '})' + + '(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' + + '(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' + + '(?:$|[^\\d])'; +tok('COERCERTL'); +re[t.COERCERTL] = new RegExp(src[t.COERCE], 'g'); // Tilde ranges. // Meaning is "reasonably at or greater than" -createToken('LONETILDE', '(?:~>?)'); +tok('LONETILDE'); +src[t.LONETILDE] = '(?:~>?)'; -createToken('TILDETRIM', `(\\s*)${src[t.LONETILDE]}\\s+`, true); -exports.tildeTrimReplace = '$1~'; +tok('TILDETRIM'); +src[t.TILDETRIM] = '(\\s*)' + src[t.LONETILDE] + '\\s+'; +re[t.TILDETRIM] = new RegExp(src[t.TILDETRIM], 'g'); +var tildeTrimReplace = '$1~'; -createToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`); -createToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`); +tok('TILDE'); +src[t.TILDE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAIN] + '$'; +tok('TILDELOOSE'); +src[t.TILDELOOSE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAINLOOSE] + '$'; // Caret ranges. // Meaning is "at least and backwards compatible with" -createToken('LONECARET', '(?:\\^)'); +tok('LONECARET'); +src[t.LONECARET] = '(?:\\^)'; -createToken('CARETTRIM', `(\\s*)${src[t.LONECARET]}\\s+`, true); -exports.caretTrimReplace = '$1^'; +tok('CARETTRIM'); +src[t.CARETTRIM] = '(\\s*)' + src[t.LONECARET] + '\\s+'; +re[t.CARETTRIM] = new RegExp(src[t.CARETTRIM], 'g'); +var caretTrimReplace = '$1^'; -createToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`); -createToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`); +tok('CARET'); +src[t.CARET] = '^' + src[t.LONECARET] + src[t.XRANGEPLAIN] + '$'; +tok('CARETLOOSE'); +src[t.CARETLOOSE] = '^' + src[t.LONECARET] + src[t.XRANGEPLAINLOOSE] + '$'; // A simple gt/lt/eq thing, or just "" to indicate "any version" -createToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\s*(${src[t.LOOSEPLAIN]})$|^$`); -createToken('COMPARATOR', `^${src[t.GTLT]}\\s*(${src[t.FULLPLAIN]})$|^$`); +tok('COMPARATORLOOSE'); +src[t.COMPARATORLOOSE] = '^' + src[t.GTLT] + '\\s*(' + src[t.LOOSEPLAIN] + ')$|^$'; +tok('COMPARATOR'); +src[t.COMPARATOR] = '^' + src[t.GTLT] + '\\s*(' + src[t.FULLPLAIN] + ')$|^$'; // An expression to strip any whitespace between the gtlt and the thing // it modifies, so that `> 1.2.3` ==> `>1.2.3` -createToken('COMPARATORTRIM', `(\\s*)${src[t.GTLT] -}\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true); -exports.comparatorTrimReplace = '$1$2$3'; +tok('COMPARATORTRIM'); +src[t.COMPARATORTRIM] = '(\\s*)' + src[t.GTLT] + + '\\s*(' + src[t.LOOSEPLAIN] + '|' + src[t.XRANGEPLAIN] + ')'; + +// this one has to use the /g flag +re[t.COMPARATORTRIM] = new RegExp(src[t.COMPARATORTRIM], 'g'); +var comparatorTrimReplace = '$1$2$3'; // Something like `1.2.3 - 1.2.4` // Note that these all use the loose form, because they'll be // checked against either the strict or loose comparator form // later. -createToken('HYPHENRANGE', `^\\s*(${src[t.XRANGEPLAIN]})` + - `\\s+-\\s+` + - `(${src[t.XRANGEPLAIN]})` + - `\\s*$`); +tok('HYPHENRANGE'); +src[t.HYPHENRANGE] = '^\\s*(' + src[t.XRANGEPLAIN] + ')' + + '\\s+-\\s+' + + '(' + src[t.XRANGEPLAIN] + ')' + + '\\s*$'; -createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` + - `\\s+-\\s+` + - `(${src[t.XRANGEPLAINLOOSE]})` + - `\\s*$`); +tok('HYPHENRANGELOOSE'); +src[t.HYPHENRANGELOOSE] = '^\\s*(' + src[t.XRANGEPLAINLOOSE] + ')' + + '\\s+-\\s+' + + '(' + src[t.XRANGEPLAINLOOSE] + ')' + + '\\s*$'; // Star ranges basically just allow anything at all. -createToken('STAR', '(<|>)?=?\\s*\\*'); -// >=0.0.0 is like a star -createToken('GTE0', '^\\s*>=\\s*0\.0\.0\\s*$'); -createToken('GTE0PRE', '^\\s*>=\\s*0\.0\.0-0\\s*$'); -}); - -// parse out just the options we care about so we always get a consistent -// obj with keys in a consistent order. -const opts = ['includePrerelease', 'loose', 'rtl']; -const parseOptions = options => - !options ? {} - : typeof options !== 'object' ? { loose: true } - : opts.filter(k => options[k]).reduce((options, k) => { - options[k] = true; - return options - }, {}); -var parseOptions_1 = parseOptions; - -const numeric = /^[0-9]+$/; -const compareIdentifiers = (a, b) => { - const anum = numeric.test(a); - const bnum = numeric.test(b); - - if (anum && bnum) { - a = +a; - b = +b; - } +tok('STAR'); +src[t.STAR] = '(<|>)?=?\\s*\\*'; - return a === b ? 0 - : (anum && !bnum) ? -1 - : (bnum && !anum) ? 1 - : a < b ? -1 - : 1 -}; - -const rcompareIdentifiers = (a, b) => compareIdentifiers(b, a); - -var identifiers = { - compareIdentifiers, - rcompareIdentifiers -}; - -const { MAX_LENGTH: MAX_LENGTH$1, MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$3 } = constants; -const { re, t } = re_1; - - -const { compareIdentifiers: compareIdentifiers$1 } = identifiers; -class SemVer { - constructor (version, options) { - options = parseOptions_1(options); - - if (version instanceof SemVer) { - if (version.loose === !!options.loose && - version.includePrerelease === !!options.includePrerelease) { - return version - } else { - version = version.version; - } - } else if (typeof version !== 'string') { - throw new TypeError(`Invalid Version: ${version}`) - } - - if (version.length > MAX_LENGTH$1) { - throw new TypeError( - `version is longer than ${MAX_LENGTH$1} characters` - ) - } - - debug_1('SemVer', version, options); - this.options = options; - this.loose = !!options.loose; - // this isn't actually relevant for versions, but keep it so that we - // don't run into trouble passing this.options around. - this.includePrerelease = !!options.includePrerelease; - - const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL]); - - if (!m) { - throw new TypeError(`Invalid Version: ${version}`) - } - - this.raw = version; - - // these are actually numbers - this.major = +m[1]; - this.minor = +m[2]; - this.patch = +m[3]; - - if (this.major > MAX_SAFE_INTEGER$3 || this.major < 0) { - throw new TypeError('Invalid major version') - } - - if (this.minor > MAX_SAFE_INTEGER$3 || this.minor < 0) { - throw new TypeError('Invalid minor version') - } - - if (this.patch > MAX_SAFE_INTEGER$3 || this.patch < 0) { - throw new TypeError('Invalid patch version') - } - - // numberify any prerelease numeric ids - if (!m[4]) { - this.prerelease = []; - } else { - this.prerelease = m[4].split('.').map((id) => { - if (/^[0-9]+$/.test(id)) { - const num = +id; - if (num >= 0 && num < MAX_SAFE_INTEGER$3) { - return num - } - } - return id - }); - } - - this.build = m[5] ? m[5].split('.') : []; - this.format(); - } - - format () { - this.version = `${this.major}.${this.minor}.${this.patch}`; - if (this.prerelease.length) { - this.version += `-${this.prerelease.join('.')}`; - } - return this.version - } - - toString () { - return this.version - } - - compare (other) { - debug_1('SemVer.compare', this.version, this.options, other); - if (!(other instanceof SemVer)) { - if (typeof other === 'string' && other === this.version) { - return 0 - } - other = new SemVer(other, this.options); - } - - if (other.version === this.version) { - return 0 - } - - return this.compareMain(other) || this.comparePre(other) - } - - compareMain (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - return ( - compareIdentifiers$1(this.major, other.major) || - compareIdentifiers$1(this.minor, other.minor) || - compareIdentifiers$1(this.patch, other.patch) - ) - } - - comparePre (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - // NOT having a prerelease is > having one - if (this.prerelease.length && !other.prerelease.length) { - return -1 - } else if (!this.prerelease.length && other.prerelease.length) { - return 1 - } else if (!this.prerelease.length && !other.prerelease.length) { - return 0 - } - - let i = 0; - do { - const a = this.prerelease[i]; - const b = other.prerelease[i]; - debug_1('prerelease compare', i, a, b); - if (a === undefined && b === undefined) { - return 0 - } else if (b === undefined) { - return 1 - } else if (a === undefined) { - return -1 - } else if (a === b) { - continue - } else { - return compareIdentifiers$1(a, b) - } - } while (++i) - } - - compareBuild (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - let i = 0; - do { - const a = this.build[i]; - const b = other.build[i]; - debug_1('prerelease compare', i, a, b); - if (a === undefined && b === undefined) { - return 0 - } else if (b === undefined) { - return 1 - } else if (a === undefined) { - return -1 - } else if (a === b) { - continue - } else { - return compareIdentifiers$1(a, b) - } - } while (++i) - } - - // preminor will bump the version up to the next minor release, and immediately - // down to pre-release. premajor and prepatch work the same way. - inc (release, identifier) { - switch (release) { - case 'premajor': - this.prerelease.length = 0; - this.patch = 0; - this.minor = 0; - this.major++; - this.inc('pre', identifier); - break - case 'preminor': - this.prerelease.length = 0; - this.patch = 0; - this.minor++; - this.inc('pre', identifier); - break - case 'prepatch': - // If this is already a prerelease, it will bump to the next version - // drop any prereleases that might already exist, since they are not - // relevant at this point. - this.prerelease.length = 0; - this.inc('patch', identifier); - this.inc('pre', identifier); - break - // If the input is a non-prerelease version, this acts the same as - // prepatch. - case 'prerelease': - if (this.prerelease.length === 0) { - this.inc('patch', identifier); - } - this.inc('pre', identifier); - break - - case 'major': - // If this is a pre-major version, bump up to the same major version. - // Otherwise increment major. - // 1.0.0-5 bumps to 1.0.0 - // 1.1.0 bumps to 2.0.0 - if ( - this.minor !== 0 || - this.patch !== 0 || - this.prerelease.length === 0 - ) { - this.major++; - } - this.minor = 0; - this.patch = 0; - this.prerelease = []; - break - case 'minor': - // If this is a pre-minor version, bump up to the same minor version. - // Otherwise increment minor. - // 1.2.0-5 bumps to 1.2.0 - // 1.2.1 bumps to 1.3.0 - if (this.patch !== 0 || this.prerelease.length === 0) { - this.minor++; - } - this.patch = 0; - this.prerelease = []; - break - case 'patch': - // If this is not a pre-release version, it will increment the patch. - // If it is a pre-release it will bump up to the same patch version. - // 1.2.0-5 patches to 1.2.0 - // 1.2.0 patches to 1.2.1 - if (this.prerelease.length === 0) { - this.patch++; - } - this.prerelease = []; - break - // This probably shouldn't be used publicly. - // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction. - case 'pre': - if (this.prerelease.length === 0) { - this.prerelease = [0]; - } else { - let i = this.prerelease.length; - while (--i >= 0) { - if (typeof this.prerelease[i] === 'number') { - this.prerelease[i]++; - i = -2; - } - } - if (i === -1) { - // didn't increment anything - this.prerelease.push(0); - } - } - if (identifier) { - // 1.2.0-beta.1 bumps to 1.2.0-beta.2, - // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0 - if (this.prerelease[0] === identifier) { - if (isNaN(this.prerelease[1])) { - this.prerelease = [identifier, 0]; - } - } else { - this.prerelease = [identifier, 0]; - } - } - break - - default: - throw new Error(`invalid increment argument: ${release}`) - } - this.format(); - this.raw = this.version; - return this +// Compile to actual regexp objects. +// All are flag-free, unless they were created above with a flag. +for (var i = 0; i < R; i++) { + debug(i, src[i]); + if (!re[i]) { + re[i] = new RegExp(src[i]); } } -var semver = SemVer; - -const {MAX_LENGTH: MAX_LENGTH$2} = constants; -const { re: re$1, t: t$1 } = re_1; - - - -const parse = (version, options) => { - options = parseOptions_1(options); +exports.parse = parse; +function parse (version, options) { + if (!options || typeof options !== 'object') { + options = { + loose: !!options, + includePrerelease: false + }; + } - if (version instanceof semver) { + if (version instanceof SemVer) { return version } @@ -25729,1200 +25345,748 @@ const parse = (version, options) => { return null } - if (version.length > MAX_LENGTH$2) { + if (version.length > MAX_LENGTH) { return null } - const r = options.loose ? re$1[t$1.LOOSE] : re$1[t$1.FULL]; + var r = options.loose ? re[t.LOOSE] : re[t.FULL]; if (!r.test(version)) { return null } try { - return new semver(version, options) + return new SemVer(version, options) } catch (er) { return null } -}; - -var parse_1 = parse; +} -const valid = (version, options) => { - const v = parse_1(version, options); +exports.valid = valid; +function valid (version, options) { + var v = parse(version, options); return v ? v.version : null -}; -var valid_1 = valid; +} -const clean = (version, options) => { - const s = parse_1(version.trim().replace(/^[=v]+/, ''), options); +exports.clean = clean; +function clean (version, options) { + var s = parse(version.trim().replace(/^[=v]+/, ''), options); return s ? s.version : null -}; -var clean_1 = clean; +} + +exports.SemVer = SemVer; -const inc = (version, release, options, identifier) => { - if (typeof (options) === 'string') { - identifier = options; - options = undefined; +function SemVer (version, options) { + if (!options || typeof options !== 'object') { + options = { + loose: !!options, + includePrerelease: false + }; + } + if (version instanceof SemVer) { + if (version.loose === options.loose) { + return version + } else { + version = version.version; + } + } else if (typeof version !== 'string') { + throw new TypeError('Invalid Version: ' + version) } - try { - return new semver(version, options).inc(release, identifier).version - } catch (er) { - return null + if (version.length > MAX_LENGTH) { + throw new TypeError('version is longer than ' + MAX_LENGTH + ' characters') } -}; -var inc_1 = inc; -const compare = (a, b, loose) => - new semver(a, loose).compare(new semver(b, loose)); + if (!(this instanceof SemVer)) { + return new SemVer(version, options) + } -var compare_1 = compare; + debug('SemVer', version, options); + this.options = options; + this.loose = !!options.loose; -const eq$1 = (a, b, loose) => compare_1(a, b, loose) === 0; -var eq_1$1 = eq$1; + var m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL]); -const diff = (version1, version2) => { - if (eq_1$1(version1, version2)) { - return null - } else { - const v1 = parse_1(version1); - const v2 = parse_1(version2); - const hasPre = v1.prerelease.length || v2.prerelease.length; - const prefix = hasPre ? 'pre' : ''; - const defaultResult = hasPre ? 'prerelease' : ''; - for (const key in v1) { - if (key === 'major' || key === 'minor' || key === 'patch') { - if (v1[key] !== v2[key]) { - return prefix + key - } - } - } - return defaultResult // may be undefined + if (!m) { + throw new TypeError('Invalid Version: ' + version) } -}; -var diff_1 = diff; -const major = (a, loose) => new semver(a, loose).major; -var major_1 = major; + this.raw = version; + + // these are actually numbers + this.major = +m[1]; + this.minor = +m[2]; + this.patch = +m[3]; -const minor = (a, loose) => new semver(a, loose).minor; -var minor_1 = minor; + if (this.major > MAX_SAFE_INTEGER || this.major < 0) { + throw new TypeError('Invalid major version') + } -const patch = (a, loose) => new semver(a, loose).patch; -var patch_1 = patch; + if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) { + throw new TypeError('Invalid minor version') + } -const prerelease = (version, options) => { - const parsed = parse_1(version, options); - return (parsed && parsed.prerelease.length) ? parsed.prerelease : null -}; -var prerelease_1 = prerelease; + if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) { + throw new TypeError('Invalid patch version') + } -const rcompare = (a, b, loose) => compare_1(b, a, loose); -var rcompare_1 = rcompare; + // numberify any prerelease numeric ids + if (!m[4]) { + this.prerelease = []; + } else { + this.prerelease = m[4].split('.').map(function (id) { + if (/^[0-9]+$/.test(id)) { + var num = +id; + if (num >= 0 && num < MAX_SAFE_INTEGER) { + return num + } + } + return id + }); + } -const compareLoose = (a, b) => compare_1(a, b, true); -var compareLoose_1 = compareLoose; + this.build = m[5] ? m[5].split('.') : []; + this.format(); +} -const compareBuild = (a, b, loose) => { - const versionA = new semver(a, loose); - const versionB = new semver(b, loose); - return versionA.compare(versionB) || versionA.compareBuild(versionB) +SemVer.prototype.format = function () { + this.version = this.major + '.' + this.minor + '.' + this.patch; + if (this.prerelease.length) { + this.version += '-' + this.prerelease.join('.'); + } + return this.version }; -var compareBuild_1 = compareBuild; - -const sort = (list, loose) => list.sort((a, b) => compareBuild_1(a, b, loose)); -var sort_1 = sort; -const rsort = (list, loose) => list.sort((a, b) => compareBuild_1(b, a, loose)); -var rsort_1 = rsort; +SemVer.prototype.toString = function () { + return this.version +}; -const gt = (a, b, loose) => compare_1(a, b, loose) > 0; -var gt_1 = gt; +SemVer.prototype.compare = function (other) { + debug('SemVer.compare', this.version, this.options, other); + if (!(other instanceof SemVer)) { + other = new SemVer(other, this.options); + } -const lt = (a, b, loose) => compare_1(a, b, loose) < 0; -var lt_1 = lt; + return this.compareMain(other) || this.comparePre(other) +}; -const neq = (a, b, loose) => compare_1(a, b, loose) !== 0; -var neq_1 = neq; +SemVer.prototype.compareMain = function (other) { + if (!(other instanceof SemVer)) { + other = new SemVer(other, this.options); + } -const gte = (a, b, loose) => compare_1(a, b, loose) >= 0; -var gte_1 = gte; + return compareIdentifiers(this.major, other.major) || + compareIdentifiers(this.minor, other.minor) || + compareIdentifiers(this.patch, other.patch) +}; -const lte = (a, b, loose) => compare_1(a, b, loose) <= 0; -var lte_1 = lte; +SemVer.prototype.comparePre = function (other) { + if (!(other instanceof SemVer)) { + other = new SemVer(other, this.options); + } -const cmp = (a, op, b, loose) => { - switch (op) { - case '===': - if (typeof a === 'object') - a = a.version; - if (typeof b === 'object') - b = b.version; - return a === b + // NOT having a prerelease is > having one + if (this.prerelease.length && !other.prerelease.length) { + return -1 + } else if (!this.prerelease.length && other.prerelease.length) { + return 1 + } else if (!this.prerelease.length && !other.prerelease.length) { + return 0 + } - case '!==': - if (typeof a === 'object') - a = a.version; - if (typeof b === 'object') - b = b.version; - return a !== b - - case '': - case '=': - case '==': - return eq_1$1(a, b, loose) - - case '!=': - return neq_1(a, b, loose) + var i = 0; + do { + var a = this.prerelease[i]; + var b = other.prerelease[i]; + debug('prerelease compare', i, a, b); + if (a === undefined && b === undefined) { + return 0 + } else if (b === undefined) { + return 1 + } else if (a === undefined) { + return -1 + } else if (a === b) { + continue + } else { + return compareIdentifiers(a, b) + } + } while (++i) +}; - case '>': - return gt_1(a, b, loose) +SemVer.prototype.compareBuild = function (other) { + if (!(other instanceof SemVer)) { + other = new SemVer(other, this.options); + } - case '>=': - return gte_1(a, b, loose) + var i = 0; + do { + var a = this.build[i]; + var b = other.build[i]; + debug('prerelease compare', i, a, b); + if (a === undefined && b === undefined) { + return 0 + } else if (b === undefined) { + return 1 + } else if (a === undefined) { + return -1 + } else if (a === b) { + continue + } else { + return compareIdentifiers(a, b) + } + } while (++i) +}; - case '<': - return lt_1(a, b, loose) +// preminor will bump the version up to the next minor release, and immediately +// down to pre-release. premajor and prepatch work the same way. +SemVer.prototype.inc = function (release, identifier) { + switch (release) { + case 'premajor': + this.prerelease.length = 0; + this.patch = 0; + this.minor = 0; + this.major++; + this.inc('pre', identifier); + break + case 'preminor': + this.prerelease.length = 0; + this.patch = 0; + this.minor++; + this.inc('pre', identifier); + break + case 'prepatch': + // If this is already a prerelease, it will bump to the next version + // drop any prereleases that might already exist, since they are not + // relevant at this point. + this.prerelease.length = 0; + this.inc('patch', identifier); + this.inc('pre', identifier); + break + // If the input is a non-prerelease version, this acts the same as + // prepatch. + case 'prerelease': + if (this.prerelease.length === 0) { + this.inc('patch', identifier); + } + this.inc('pre', identifier); + break - case '<=': - return lte_1(a, b, loose) + case 'major': + // If this is a pre-major version, bump up to the same major version. + // Otherwise increment major. + // 1.0.0-5 bumps to 1.0.0 + // 1.1.0 bumps to 2.0.0 + if (this.minor !== 0 || + this.patch !== 0 || + this.prerelease.length === 0) { + this.major++; + } + this.minor = 0; + this.patch = 0; + this.prerelease = []; + break + case 'minor': + // If this is a pre-minor version, bump up to the same minor version. + // Otherwise increment minor. + // 1.2.0-5 bumps to 1.2.0 + // 1.2.1 bumps to 1.3.0 + if (this.patch !== 0 || this.prerelease.length === 0) { + this.minor++; + } + this.patch = 0; + this.prerelease = []; + break + case 'patch': + // If this is not a pre-release version, it will increment the patch. + // If it is a pre-release it will bump up to the same patch version. + // 1.2.0-5 patches to 1.2.0 + // 1.2.0 patches to 1.2.1 + if (this.prerelease.length === 0) { + this.patch++; + } + this.prerelease = []; + break + // This probably shouldn't be used publicly. + // 1.0.0 "pre" would become 1.0.0-0 which is the wrong direction. + case 'pre': + if (this.prerelease.length === 0) { + this.prerelease = [0]; + } else { + var i = this.prerelease.length; + while (--i >= 0) { + if (typeof this.prerelease[i] === 'number') { + this.prerelease[i]++; + i = -2; + } + } + if (i === -1) { + // didn't increment anything + this.prerelease.push(0); + } + } + if (identifier) { + // 1.2.0-beta.1 bumps to 1.2.0-beta.2, + // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0 + if (this.prerelease[0] === identifier) { + if (isNaN(this.prerelease[1])) { + this.prerelease = [identifier, 0]; + } + } else { + this.prerelease = [identifier, 0]; + } + } + break default: - throw new TypeError(`Invalid operator: ${op}`) + throw new Error('invalid increment argument: ' + release) } + this.format(); + this.raw = this.version; + return this }; -var cmp_1 = cmp; - -const {re: re$2, t: t$2} = re_1; - -const coerce = (version, options) => { - if (version instanceof semver) { - return version - } - if (typeof version === 'number') { - version = String(version); +exports.inc = inc; +function inc (version, release, loose, identifier) { + if (typeof (loose) === 'string') { + identifier = loose; + loose = undefined; } - if (typeof version !== 'string') { + try { + return new SemVer(version, loose).inc(release, identifier).version + } catch (er) { return null } +} - options = options || {}; - - let match = null; - if (!options.rtl) { - match = version.match(re$2[t$2.COERCE]); +exports.diff = diff; +function diff (version1, version2) { + if (eq(version1, version2)) { + return null } else { - // Find the right-most coercible string that does not share - // a terminus with a more left-ward coercible string. - // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4' - // - // Walk through the string checking with a /g regexp - // Manually set the index so as to pick up overlapping matches. - // Stop when we get a match that ends at the string end, since no - // coercible string can be more right-ward without the same terminus. - let next; - while ((next = re$2[t$2.COERCERTL].exec(version)) && - (!match || match.index + match[0].length !== version.length) - ) { - if (!match || - next.index + next[0].length !== match.index + match[0].length) { - match = next; + var v1 = parse(version1); + var v2 = parse(version2); + var prefix = ''; + if (v1.prerelease.length || v2.prerelease.length) { + prefix = 'pre'; + var defaultResult = 'prerelease'; + } + for (var key in v1) { + if (key === 'major' || key === 'minor' || key === 'patch') { + if (v1[key] !== v2[key]) { + return prefix + key + } } - re$2[t$2.COERCERTL].lastIndex = next.index + next[1].length + next[2].length; } - // leave it in a clean state - re$2[t$2.COERCERTL].lastIndex = -1; + return defaultResult // may be undefined } +} - if (match === null) - return null - - return parse_1(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options) -}; -var coerce_1 = coerce; - -var iterator = function (Yallist) { - Yallist.prototype[Symbol.iterator] = function* () { - for (let walker = this.head; walker; walker = walker.next) { - yield walker.value; - } - }; -}; - -var yallist = Yallist; +exports.compareIdentifiers = compareIdentifiers; -Yallist.Node = Node; -Yallist.create = Yallist; +var numeric = /^[0-9]+$/; +function compareIdentifiers (a, b) { + var anum = numeric.test(a); + var bnum = numeric.test(b); -function Yallist (list) { - var self = this; - if (!(self instanceof Yallist)) { - self = new Yallist(); + if (anum && bnum) { + a = +a; + b = +b; } - self.tail = null; - self.head = null; - self.length = 0; - - if (list && typeof list.forEach === 'function') { - list.forEach(function (item) { - self.push(item); - }); - } else if (arguments.length > 0) { - for (var i = 0, l = arguments.length; i < l; i++) { - self.push(arguments[i]); - } - } + return a === b ? 0 + : (anum && !bnum) ? -1 + : (bnum && !anum) ? 1 + : a < b ? -1 + : 1 +} - return self +exports.rcompareIdentifiers = rcompareIdentifiers; +function rcompareIdentifiers (a, b) { + return compareIdentifiers(b, a) } -Yallist.prototype.removeNode = function (node) { - if (node.list !== this) { - throw new Error('removing node which does not belong to this list') - } +exports.major = major; +function major (a, loose) { + return new SemVer(a, loose).major +} - var next = node.next; - var prev = node.prev; +exports.minor = minor; +function minor (a, loose) { + return new SemVer(a, loose).minor +} - if (next) { - next.prev = prev; - } +exports.patch = patch; +function patch (a, loose) { + return new SemVer(a, loose).patch +} - if (prev) { - prev.next = next; - } +exports.compare = compare; +function compare (a, b, loose) { + return new SemVer(a, loose).compare(new SemVer(b, loose)) +} - if (node === this.head) { - this.head = next; - } - if (node === this.tail) { - this.tail = prev; - } - - node.list.length--; - node.next = null; - node.prev = null; - node.list = null; - - return next -}; +exports.compareLoose = compareLoose; +function compareLoose (a, b) { + return compare(a, b, true) +} -Yallist.prototype.unshiftNode = function (node) { - if (node === this.head) { - return - } +exports.compareBuild = compareBuild; +function compareBuild (a, b, loose) { + var versionA = new SemVer(a, loose); + var versionB = new SemVer(b, loose); + return versionA.compare(versionB) || versionA.compareBuild(versionB) +} - if (node.list) { - node.list.removeNode(node); - } +exports.rcompare = rcompare; +function rcompare (a, b, loose) { + return compare(b, a, loose) +} - var head = this.head; - node.list = this; - node.next = head; - if (head) { - head.prev = node; - } +exports.sort = sort; +function sort (list, loose) { + return list.sort(function (a, b) { + return exports.compareBuild(a, b, loose) + }) +} - this.head = node; - if (!this.tail) { - this.tail = node; - } - this.length++; -}; +exports.rsort = rsort; +function rsort (list, loose) { + return list.sort(function (a, b) { + return exports.compareBuild(b, a, loose) + }) +} -Yallist.prototype.pushNode = function (node) { - if (node === this.tail) { - return - } +exports.gt = gt; +function gt (a, b, loose) { + return compare(a, b, loose) > 0 +} - if (node.list) { - node.list.removeNode(node); - } +exports.lt = lt; +function lt (a, b, loose) { + return compare(a, b, loose) < 0 +} - var tail = this.tail; - node.list = this; - node.prev = tail; - if (tail) { - tail.next = node; - } +exports.eq = eq; +function eq (a, b, loose) { + return compare(a, b, loose) === 0 +} - this.tail = node; - if (!this.head) { - this.head = node; - } - this.length++; -}; +exports.neq = neq; +function neq (a, b, loose) { + return compare(a, b, loose) !== 0 +} -Yallist.prototype.push = function () { - for (var i = 0, l = arguments.length; i < l; i++) { - push(this, arguments[i]); - } - return this.length -}; +exports.gte = gte; +function gte (a, b, loose) { + return compare(a, b, loose) >= 0 +} -Yallist.prototype.unshift = function () { - for (var i = 0, l = arguments.length; i < l; i++) { - unshift(this, arguments[i]); - } - return this.length -}; +exports.lte = lte; +function lte (a, b, loose) { + return compare(a, b, loose) <= 0 +} -Yallist.prototype.pop = function () { - if (!this.tail) { - return undefined - } +exports.cmp = cmp; +function cmp (a, op, b, loose) { + switch (op) { + case '===': + if (typeof a === 'object') + a = a.version; + if (typeof b === 'object') + b = b.version; + return a === b - var res = this.tail.value; - this.tail = this.tail.prev; - if (this.tail) { - this.tail.next = null; - } else { - this.head = null; - } - this.length--; - return res -}; + case '!==': + if (typeof a === 'object') + a = a.version; + if (typeof b === 'object') + b = b.version; + return a !== b -Yallist.prototype.shift = function () { - if (!this.head) { - return undefined - } + case '': + case '=': + case '==': + return eq(a, b, loose) - var res = this.head.value; - this.head = this.head.next; - if (this.head) { - this.head.prev = null; - } else { - this.tail = null; - } - this.length--; - return res -}; + case '!=': + return neq(a, b, loose) -Yallist.prototype.forEach = function (fn, thisp) { - thisp = thisp || this; - for (var walker = this.head, i = 0; walker !== null; i++) { - fn.call(thisp, walker.value, i, this); - walker = walker.next; - } -}; + case '>': + return gt(a, b, loose) -Yallist.prototype.forEachReverse = function (fn, thisp) { - thisp = thisp || this; - for (var walker = this.tail, i = this.length - 1; walker !== null; i--) { - fn.call(thisp, walker.value, i, this); - walker = walker.prev; - } -}; + case '>=': + return gte(a, b, loose) -Yallist.prototype.get = function (n) { - for (var i = 0, walker = this.head; walker !== null && i < n; i++) { - // abort out of the list early if we hit a cycle - walker = walker.next; - } - if (i === n && walker !== null) { - return walker.value - } -}; + case '<': + return lt(a, b, loose) -Yallist.prototype.getReverse = function (n) { - for (var i = 0, walker = this.tail; walker !== null && i < n; i++) { - // abort out of the list early if we hit a cycle - walker = walker.prev; - } - if (i === n && walker !== null) { - return walker.value - } -}; + case '<=': + return lte(a, b, loose) -Yallist.prototype.map = function (fn, thisp) { - thisp = thisp || this; - var res = new Yallist(); - for (var walker = this.head; walker !== null;) { - res.push(fn.call(thisp, walker.value, this)); - walker = walker.next; + default: + throw new TypeError('Invalid operator: ' + op) } - return res -}; +} -Yallist.prototype.mapReverse = function (fn, thisp) { - thisp = thisp || this; - var res = new Yallist(); - for (var walker = this.tail; walker !== null;) { - res.push(fn.call(thisp, walker.value, this)); - walker = walker.prev; +exports.Comparator = Comparator; +function Comparator (comp, options) { + if (!options || typeof options !== 'object') { + options = { + loose: !!options, + includePrerelease: false + }; } - return res -}; -Yallist.prototype.reduce = function (fn, initial) { - var acc; - var walker = this.head; - if (arguments.length > 1) { - acc = initial; - } else if (this.head) { - walker = this.head.next; - acc = this.head.value; - } else { - throw new TypeError('Reduce of empty list with no initial value') + if (comp instanceof Comparator) { + if (comp.loose === !!options.loose) { + return comp + } else { + comp = comp.value; + } } - for (var i = 0; walker !== null; i++) { - acc = fn(acc, walker.value, i); - walker = walker.next; + if (!(this instanceof Comparator)) { + return new Comparator(comp, options) } - return acc -}; + debug('comparator', comp, options); + this.options = options; + this.loose = !!options.loose; + this.parse(comp); -Yallist.prototype.reduceReverse = function (fn, initial) { - var acc; - var walker = this.tail; - if (arguments.length > 1) { - acc = initial; - } else if (this.tail) { - walker = this.tail.prev; - acc = this.tail.value; + if (this.semver === ANY) { + this.value = ''; } else { - throw new TypeError('Reduce of empty list with no initial value') + this.value = this.operator + this.semver.version; } - for (var i = this.length - 1; walker !== null; i--) { - acc = fn(acc, walker.value, i); - walker = walker.prev; - } + debug('comp', this); +} - return acc -}; +var ANY = {}; +Comparator.prototype.parse = function (comp) { + var r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]; + var m = comp.match(r); -Yallist.prototype.toArray = function () { - var arr = new Array(this.length); - for (var i = 0, walker = this.head; walker !== null; i++) { - arr[i] = walker.value; - walker = walker.next; + if (!m) { + throw new TypeError('Invalid comparator: ' + comp) } - return arr -}; -Yallist.prototype.toArrayReverse = function () { - var arr = new Array(this.length); - for (var i = 0, walker = this.tail; walker !== null; i++) { - arr[i] = walker.value; - walker = walker.prev; + this.operator = m[1] !== undefined ? m[1] : ''; + if (this.operator === '=') { + this.operator = ''; } - return arr -}; -Yallist.prototype.slice = function (from, to) { - to = to || this.length; - if (to < 0) { - to += this.length; - } - from = from || 0; - if (from < 0) { - from += this.length; - } - var ret = new Yallist(); - if (to < from || to < 0) { - return ret - } - if (from < 0) { - from = 0; - } - if (to > this.length) { - to = this.length; - } - for (var i = 0, walker = this.head; walker !== null && i < from; i++) { - walker = walker.next; - } - for (; walker !== null && i < to; i++, walker = walker.next) { - ret.push(walker.value); + // if it literally is just '>' or '' then allow anything. + if (!m[2]) { + this.semver = ANY; + } else { + this.semver = new SemVer(m[2], this.options.loose); } - return ret }; -Yallist.prototype.sliceReverse = function (from, to) { - to = to || this.length; - if (to < 0) { - to += this.length; - } - from = from || 0; - if (from < 0) { - from += this.length; - } - var ret = new Yallist(); - if (to < from || to < 0) { - return ret - } - if (from < 0) { - from = 0; - } - if (to > this.length) { - to = this.length; - } - for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) { - walker = walker.prev; - } - for (; walker !== null && i > from; i--, walker = walker.prev) { - ret.push(walker.value); - } - return ret +Comparator.prototype.toString = function () { + return this.value }; -Yallist.prototype.splice = function (start, deleteCount, ...nodes) { - if (start > this.length) { - start = this.length - 1; - } - if (start < 0) { - start = this.length + start; - } +Comparator.prototype.test = function (version) { + debug('Comparator.test', version, this.options.loose); - for (var i = 0, walker = this.head; walker !== null && i < start; i++) { - walker = walker.next; + if (this.semver === ANY || version === ANY) { + return true } - var ret = []; - for (var i = 0; walker && i < deleteCount; i++) { - ret.push(walker.value); - walker = this.removeNode(walker); - } - if (walker === null) { - walker = this.tail; + if (typeof version === 'string') { + try { + version = new SemVer(version, this.options); + } catch (er) { + return false + } } - if (walker !== this.head && walker !== this.tail) { - walker = walker.prev; - } + return cmp(version, this.operator, this.semver, this.options) +}; - for (var i = 0; i < nodes.length; i++) { - walker = insert(this, walker, nodes[i]); +Comparator.prototype.intersects = function (comp, options) { + if (!(comp instanceof Comparator)) { + throw new TypeError('a Comparator is required') } - return ret; -}; -Yallist.prototype.reverse = function () { - var head = this.head; - var tail = this.tail; - for (var walker = head; walker !== null; walker = walker.prev) { - var p = walker.prev; - walker.prev = walker.next; - walker.next = p; + if (!options || typeof options !== 'object') { + options = { + loose: !!options, + includePrerelease: false + }; } - this.head = tail; - this.tail = head; - return this -}; -function insert (self, node, value) { - var inserted = node === self.head ? - new Node(value, null, node, self) : - new Node(value, node, node.next, self); + var rangeTmp; - if (inserted.next === null) { - self.tail = inserted; - } - if (inserted.prev === null) { - self.head = inserted; + if (this.operator === '') { + if (this.value === '') { + return true + } + rangeTmp = new Range(comp.value, options); + return satisfies(this.value, rangeTmp, options) + } else if (comp.operator === '') { + if (comp.value === '') { + return true + } + rangeTmp = new Range(this.value, options); + return satisfies(comp.semver, rangeTmp, options) } - self.length++; + var sameDirectionIncreasing = + (this.operator === '>=' || this.operator === '>') && + (comp.operator === '>=' || comp.operator === '>'); + var sameDirectionDecreasing = + (this.operator === '<=' || this.operator === '<') && + (comp.operator === '<=' || comp.operator === '<'); + var sameSemVer = this.semver.version === comp.semver.version; + var differentDirectionsInclusive = + (this.operator === '>=' || this.operator === '<=') && + (comp.operator === '>=' || comp.operator === '<='); + var oppositeDirectionsLessThan = + cmp(this.semver, '<', comp.semver, options) && + ((this.operator === '>=' || this.operator === '>') && + (comp.operator === '<=' || comp.operator === '<')); + var oppositeDirectionsGreaterThan = + cmp(this.semver, '>', comp.semver, options) && + ((this.operator === '<=' || this.operator === '<') && + (comp.operator === '>=' || comp.operator === '>')); - return inserted -} + return sameDirectionIncreasing || sameDirectionDecreasing || + (sameSemVer && differentDirectionsInclusive) || + oppositeDirectionsLessThan || oppositeDirectionsGreaterThan +}; -function push (self, item) { - self.tail = new Node(item, self.tail, null, self); - if (!self.head) { - self.head = self.tail; +exports.Range = Range; +function Range (range, options) { + if (!options || typeof options !== 'object') { + options = { + loose: !!options, + includePrerelease: false + }; } - self.length++; -} -function unshift (self, item) { - self.head = new Node(item, null, self.head, self); - if (!self.tail) { - self.tail = self.head; - } - self.length++; -} - -function Node (value, prev, next, list) { - if (!(this instanceof Node)) { - return new Node(value, prev, next, list) - } - - this.list = list; - this.value = value; - - if (prev) { - prev.next = this; - this.prev = prev; - } else { - this.prev = null; - } - - if (next) { - next.prev = this; - this.next = next; - } else { - this.next = null; - } -} - -try { - // add if support for Symbol.iterator is present - iterator(Yallist); -} catch (er) {} - -// A linked list to keep track of recently-used-ness - - -const MAX = Symbol('max'); -const LENGTH = Symbol('length'); -const LENGTH_CALCULATOR = Symbol('lengthCalculator'); -const ALLOW_STALE = Symbol('allowStale'); -const MAX_AGE = Symbol('maxAge'); -const DISPOSE = Symbol('dispose'); -const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet'); -const LRU_LIST = Symbol('lruList'); -const CACHE = Symbol('cache'); -const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet'); - -const naiveLength = () => 1; - -// lruList is a yallist where the head is the youngest -// item, and the tail is the oldest. the list contains the Hit -// objects as the entries. -// Each Hit object has a reference to its Yallist.Node. This -// never changes. -// -// cache is a Map (or PseudoMap) that matches the keys to -// the Yallist.Node object. -class LRUCache { - constructor (options) { - if (typeof options === 'number') - options = { max: options }; - - if (!options) - options = {}; - - if (options.max && (typeof options.max !== 'number' || options.max < 0)) - throw new TypeError('max must be a non-negative number') - // Kind of weird to have a default max of Infinity, but oh well. - this[MAX] = options.max || Infinity; - - const lc = options.length || naiveLength; - this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc; - this[ALLOW_STALE] = options.stale || false; - if (options.maxAge && typeof options.maxAge !== 'number') - throw new TypeError('maxAge must be a number') - this[MAX_AGE] = options.maxAge || 0; - this[DISPOSE] = options.dispose; - this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false; - this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false; - this.reset(); - } - - // resize the cache when the max changes. - set max (mL) { - if (typeof mL !== 'number' || mL < 0) - throw new TypeError('max must be a non-negative number') - - this[MAX] = mL || Infinity; - trim(this); - } - get max () { - return this[MAX] - } - - set allowStale (allowStale) { - this[ALLOW_STALE] = !!allowStale; - } - get allowStale () { - return this[ALLOW_STALE] - } - - set maxAge (mA) { - if (typeof mA !== 'number') - throw new TypeError('maxAge must be a non-negative number') - - this[MAX_AGE] = mA; - trim(this); - } - get maxAge () { - return this[MAX_AGE] - } - - // resize the cache when the lengthCalculator changes. - set lengthCalculator (lC) { - if (typeof lC !== 'function') - lC = naiveLength; - - if (lC !== this[LENGTH_CALCULATOR]) { - this[LENGTH_CALCULATOR] = lC; - this[LENGTH] = 0; - this[LRU_LIST].forEach(hit => { - hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key); - this[LENGTH] += hit.length; - }); - } - trim(this); - } - get lengthCalculator () { return this[LENGTH_CALCULATOR] } - - get length () { return this[LENGTH] } - get itemCount () { return this[LRU_LIST].length } - - rforEach (fn, thisp) { - thisp = thisp || this; - for (let walker = this[LRU_LIST].tail; walker !== null;) { - const prev = walker.prev; - forEachStep(this, fn, walker, thisp); - walker = prev; - } - } - - forEach (fn, thisp) { - thisp = thisp || this; - for (let walker = this[LRU_LIST].head; walker !== null;) { - const next = walker.next; - forEachStep(this, fn, walker, thisp); - walker = next; - } - } - - keys () { - return this[LRU_LIST].toArray().map(k => k.key) - } - - values () { - return this[LRU_LIST].toArray().map(k => k.value) - } - - reset () { - if (this[DISPOSE] && - this[LRU_LIST] && - this[LRU_LIST].length) { - this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value)); - } - - this[CACHE] = new Map(); // hash of items by key - this[LRU_LIST] = new yallist(); // list of items in order of use recency - this[LENGTH] = 0; // length of items in the list - } - - dump () { - return this[LRU_LIST].map(hit => - isStale(this, hit) ? false : { - k: hit.key, - v: hit.value, - e: hit.now + (hit.maxAge || 0) - }).toArray().filter(h => h) - } - - dumpLru () { - return this[LRU_LIST] - } - - set (key, value, maxAge) { - maxAge = maxAge || this[MAX_AGE]; - - if (maxAge && typeof maxAge !== 'number') - throw new TypeError('maxAge must be a number') - - const now = maxAge ? Date.now() : 0; - const len = this[LENGTH_CALCULATOR](value, key); - - if (this[CACHE].has(key)) { - if (len > this[MAX]) { - del(this, this[CACHE].get(key)); - return false - } - - const node = this[CACHE].get(key); - const item = node.value; - - // dispose of the old one before overwriting - // split out into 2 ifs for better coverage tracking - if (this[DISPOSE]) { - if (!this[NO_DISPOSE_ON_SET]) - this[DISPOSE](key, item.value); - } - - item.now = now; - item.maxAge = maxAge; - item.value = value; - this[LENGTH] += len - item.length; - item.length = len; - this.get(key); - trim(this); - return true - } - - const hit = new Entry(key, value, len, now, maxAge); - - // oversized objects fall out of cache automatically. - if (hit.length > this[MAX]) { - if (this[DISPOSE]) - this[DISPOSE](key, value); - - return false + if (range instanceof Range) { + if (range.loose === !!options.loose && + range.includePrerelease === !!options.includePrerelease) { + return range + } else { + return new Range(range.raw, options) } - - this[LENGTH] += hit.length; - this[LRU_LIST].unshift(hit); - this[CACHE].set(key, this[LRU_LIST].head); - trim(this); - return true - } - - has (key) { - if (!this[CACHE].has(key)) return false - const hit = this[CACHE].get(key).value; - return !isStale(this, hit) - } - - get (key) { - return get$1(this, key, true) } - peek (key) { - return get$1(this, key, false) + if (range instanceof Comparator) { + return new Range(range.value, options) } - pop () { - const node = this[LRU_LIST].tail; - if (!node) - return null - - del(this, node); - return node.value + if (!(this instanceof Range)) { + return new Range(range, options) } - del (key) { - del(this, this[CACHE].get(key)); - } + this.options = options; + this.loose = !!options.loose; + this.includePrerelease = !!options.includePrerelease; - load (arr) { - // reset the cache - this.reset(); + // First, split based on boolean or || + this.raw = range; + this.set = range.split(/\s*\|\|\s*/).map(function (range) { + return this.parseRange(range.trim()) + }, this).filter(function (c) { + // throw out any that are not relevant for whatever reason + return c.length + }); - const now = Date.now(); - // A previous serialized cache has the most recent items first - for (let l = arr.length - 1; l >= 0; l--) { - const hit = arr[l]; - const expiresAt = hit.e || 0; - if (expiresAt === 0) - // the item was created without expiration in a non aged cache - this.set(hit.k, hit.v); - else { - const maxAge = expiresAt - now; - // dont add already expired items - if (maxAge > 0) { - this.set(hit.k, hit.v, maxAge); - } - } - } + if (!this.set.length) { + throw new TypeError('Invalid SemVer Range: ' + range) } - prune () { - this[CACHE].forEach((value, key) => get$1(this, key, false)); - } + this.format(); } -const get$1 = (self, key, doUse) => { - const node = self[CACHE].get(key); - if (node) { - const hit = node.value; - if (isStale(self, hit)) { - del(self, node); - if (!self[ALLOW_STALE]) - return undefined - } else { - if (doUse) { - if (self[UPDATE_AGE_ON_GET]) - node.value.now = Date.now(); - self[LRU_LIST].unshiftNode(node); - } - } - return hit.value - } -}; - -const isStale = (self, hit) => { - if (!hit || (!hit.maxAge && !self[MAX_AGE])) - return false - - const diff = Date.now() - hit.now; - return hit.maxAge ? diff > hit.maxAge - : self[MAX_AGE] && (diff > self[MAX_AGE]) -}; - -const trim = self => { - if (self[LENGTH] > self[MAX]) { - for (let walker = self[LRU_LIST].tail; - self[LENGTH] > self[MAX] && walker !== null;) { - // We know that we're about to delete this one, and also - // what the next least recently used key will be, so just - // go ahead and set it now. - const prev = walker.prev; - del(self, walker); - walker = prev; - } - } +Range.prototype.format = function () { + this.range = this.set.map(function (comps) { + return comps.join(' ').trim() + }).join('||').trim(); + return this.range }; -const del = (self, node) => { - if (node) { - const hit = node.value; - if (self[DISPOSE]) - self[DISPOSE](hit.key, hit.value); - - self[LENGTH] -= hit.length; - self[CACHE].delete(hit.key); - self[LRU_LIST].removeNode(node); - } +Range.prototype.toString = function () { + return this.range }; -class Entry { - constructor (key, value, length, now, maxAge) { - this.key = key; - this.value = value; - this.length = length; - this.now = now; - this.maxAge = maxAge || 0; - } -} - -const forEachStep = (self, fn, node, thisp) => { - let hit = node.value; - if (isStale(self, hit)) { - del(self, node); - if (!self[ALLOW_STALE]) - hit = undefined; - } - if (hit) - fn.call(thisp, hit.value, hit.key, self); -}; +Range.prototype.parseRange = function (range) { + var loose = this.options.loose; + range = range.trim(); + // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4` + var hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]; + range = range.replace(hr, hyphenReplace); + debug('hyphen replace', range); + // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5` + range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace); + debug('comparator trim', range, re[t.COMPARATORTRIM]); -var lruCache = LRUCache; + // `~ 1.2.3` => `~1.2.3` + range = range.replace(re[t.TILDETRIM], tildeTrimReplace); -// hoisted class for cyclic dependency -class Range { - constructor (range, options) { - options = parseOptions_1(options); + // `^ 1.2.3` => `^1.2.3` + range = range.replace(re[t.CARETTRIM], caretTrimReplace); - if (range instanceof Range) { - if ( - range.loose === !!options.loose && - range.includePrerelease === !!options.includePrerelease - ) { - return range - } else { - return new Range(range.raw, options) - } - } - - if (range instanceof comparator) { - // just put it in the set and return - this.raw = range.value; - this.set = [[range]]; - this.format(); - return this - } - - this.options = options; - this.loose = !!options.loose; - this.includePrerelease = !!options.includePrerelease; - - // First, split based on boolean or || - this.raw = range; - this.set = range - .split(/\s*\|\|\s*/) - // map the range to a 2d array of comparators - .map(range => this.parseRange(range.trim())) - // throw out any comparator lists that are empty - // this generally means that it was not a valid range, which is allowed - // in loose mode, but will still throw if the WHOLE range is invalid. - .filter(c => c.length); - - if (!this.set.length) { - throw new TypeError(`Invalid SemVer Range: ${range}`) - } - - // if we have any that are not the null set, throw out null sets. - if (this.set.length > 1) { - // keep the first one, in case they're all null sets - const first = this.set[0]; - this.set = this.set.filter(c => !isNullSet(c[0])); - if (this.set.length === 0) - this.set = [first]; - else if (this.set.length > 1) { - // if we have any that are *, then the range is just * - for (const c of this.set) { - if (c.length === 1 && isAny(c[0])) { - this.set = [c]; - break - } - } - } - } + // normalize spaces + range = range.split(/\s+/).join(' '); - this.format(); - } + // At this point, the range is completely trimmed and + // ready to be split into comparators. - format () { - this.range = this.set - .map((comps) => { - return comps.join(' ').trim() - }) - .join('||') - .trim(); - return this.range - } - - toString () { - return this.range - } - - parseRange (range) { - range = range.trim(); - - // memoize range parsing for performance. - // this is a very hot path, and fully deterministic. - const memoOpts = Object.keys(this.options).join(','); - const memoKey = `parseRange:${memoOpts}:${range}`; - const cached = cache.get(memoKey); - if (cached) - return cached - - const loose = this.options.loose; - // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4` - const hr = loose ? re$3[t$3.HYPHENRANGELOOSE] : re$3[t$3.HYPHENRANGE]; - range = range.replace(hr, hyphenReplace(this.options.includePrerelease)); - debug_1('hyphen replace', range); - // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5` - range = range.replace(re$3[t$3.COMPARATORTRIM], comparatorTrimReplace); - debug_1('comparator trim', range, re$3[t$3.COMPARATORTRIM]); - - // `~ 1.2.3` => `~1.2.3` - range = range.replace(re$3[t$3.TILDETRIM], tildeTrimReplace); - - // `^ 1.2.3` => `^1.2.3` - range = range.replace(re$3[t$3.CARETTRIM], caretTrimReplace); - - // normalize spaces - range = range.split(/\s+/).join(' '); - - // At this point, the range is completely trimmed and - // ready to be split into comparators. - - const compRe = loose ? re$3[t$3.COMPARATORLOOSE] : re$3[t$3.COMPARATOR]; - const rangeList = range - .split(' ') - .map(comp => parseComparator(comp, this.options)) - .join(' ') - .split(/\s+/) - // >=0.0.0 is equivalent to * - .map(comp => replaceGTE0(comp, this.options)) - // in loose mode, throw out any that are not valid comparators - .filter(this.options.loose ? comp => !!comp.match(compRe) : () => true) - .map(comp => new comparator(comp, this.options)); - - // if any comparators are the null set, then replace with JUST null set - // if more than one comparator, remove any * comparators - // also, don't include the same comparator more than once - rangeList.length; - const rangeMap = new Map(); - for (const comp of rangeList) { - if (isNullSet(comp)) - return [comp] - rangeMap.set(comp.value, comp); - } - if (rangeMap.size > 1 && rangeMap.has('')) - rangeMap.delete(''); - - const result = [...rangeMap.values()]; - cache.set(memoKey, result); - return result - } - - intersects (range, options) { - if (!(range instanceof Range)) { - throw new TypeError('a Range is required') - } - - return this.set.some((thisComparators) => { - return ( - isSatisfiable(thisComparators, options) && - range.set.some((rangeComparators) => { - return ( - isSatisfiable(rangeComparators, options) && - thisComparators.every((thisComparator) => { - return rangeComparators.every((rangeComparator) => { - return thisComparator.intersects(rangeComparator, options) - }) - }) - ) - }) - ) - }) + var compRe = loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]; + var set = range.split(' ').map(function (comp) { + return parseComparator(comp, this.options) + }, this).join(' ').split(/\s+/); + if (this.options.loose) { + // in loose mode, throw out any that are not valid comparators + set = set.filter(function (comp) { + return !!comp.match(compRe) + }); } + set = set.map(function (comp) { + return new Comparator(comp, this.options) + }, this); - // if ANY of the sets match ALL of its comparators, then pass - test (version) { - if (!version) { - return false - } - - if (typeof version === 'string') { - try { - version = new semver(version, this.options); - } catch (er) { - return false - } - } + return set +}; - for (let i = 0; i < this.set.length; i++) { - if (testSet(this.set[i], version, this.options)) { - return true - } - } - return false +Range.prototype.intersects = function (range, options) { + if (!(range instanceof Range)) { + throw new TypeError('a Range is required') } -} -var range = Range; - - -const cache = new lruCache({ max: 1000 }); - - - - -const { - re: re$3, - t: t$3, - comparatorTrimReplace, - tildeTrimReplace, - caretTrimReplace -} = re_1; - -const isNullSet = c => c.value === '<0.0.0-0'; -const isAny = c => c.value === ''; + return this.set.some(function (thisComparators) { + return ( + isSatisfiable(thisComparators, options) && + range.set.some(function (rangeComparators) { + return ( + isSatisfiable(rangeComparators, options) && + thisComparators.every(function (thisComparator) { + return rangeComparators.every(function (rangeComparator) { + return thisComparator.intersects(rangeComparator, options) + }) + }) + ) + }) + ) + }) +}; // take a set of comparators and determine whether there // exists a version which can satisfy it -const isSatisfiable = (comparators, options) => { - let result = true; - const remainingComparators = comparators.slice(); - let testComparator = remainingComparators.pop(); +function isSatisfiable (comparators, options) { + var result = true; + var remainingComparators = comparators.slice(); + var testComparator = remainingComparators.pop(); while (result && remainingComparators.length) { - result = remainingComparators.every((otherComparator) => { + result = remainingComparators.every(function (otherComparator) { return testComparator.intersects(otherComparator, options) }); @@ -26930,145 +26094,158 @@ const isSatisfiable = (comparators, options) => { } return result -}; +} + +// Mostly just for testing and legacy API reasons +exports.toComparators = toComparators; +function toComparators (range, options) { + return new Range(range, options).set.map(function (comp) { + return comp.map(function (c) { + return c.value + }).join(' ').trim().split(' ') + }) +} // comprised of xranges, tildes, stars, and gtlt's at this point. // already replaced the hyphen ranges // turn into a set of JUST comparators. -const parseComparator = (comp, options) => { - debug_1('comp', comp, options); +function parseComparator (comp, options) { + debug('comp', comp, options); comp = replaceCarets(comp, options); - debug_1('caret', comp); + debug('caret', comp); comp = replaceTildes(comp, options); - debug_1('tildes', comp); + debug('tildes', comp); comp = replaceXRanges(comp, options); - debug_1('xrange', comp); + debug('xrange', comp); comp = replaceStars(comp, options); - debug_1('stars', comp); + debug('stars', comp); return comp -}; +} -const isX = id => !id || id.toLowerCase() === 'x' || id === '*'; +function isX (id) { + return !id || id.toLowerCase() === 'x' || id === '*' +} // ~, ~> --> * (any, kinda silly) -// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0 -// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0 -// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0 -// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0 -// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0 -const replaceTildes = (comp, options) => - comp.trim().split(/\s+/).map((comp) => { +// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0 +// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0 +// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0 +// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0 +// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0 +function replaceTildes (comp, options) { + return comp.trim().split(/\s+/).map(function (comp) { return replaceTilde(comp, options) - }).join(' '); + }).join(' ') +} -const replaceTilde = (comp, options) => { - const r = options.loose ? re$3[t$3.TILDELOOSE] : re$3[t$3.TILDE]; - return comp.replace(r, (_, M, m, p, pr) => { - debug_1('tilde', comp, _, M, m, p, pr); - let ret; +function replaceTilde (comp, options) { + var r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]; + return comp.replace(r, function (_, M, m, p, pr) { + debug('tilde', comp, _, M, m, p, pr); + var ret; if (isX(M)) { ret = ''; } else if (isX(m)) { - ret = `>=${M}.0.0 <${+M + 1}.0.0-0`; + ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'; } else if (isX(p)) { - // ~1.2 == >=1.2.0 <1.3.0-0 - ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`; - } else if (pr) { - debug_1('replaceTilde pr', pr); - ret = `>=${M}.${m}.${p}-${pr - } <${M}.${+m + 1}.0-0`; + // ~1.2 == >=1.2.0 <1.3.0 + ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'; + } else if (pr) { + debug('replaceTilde pr', pr); + ret = '>=' + M + '.' + m + '.' + p + '-' + pr + + ' <' + M + '.' + (+m + 1) + '.0'; } else { - // ~1.2.3 == >=1.2.3 <1.3.0-0 - ret = `>=${M}.${m}.${p - } <${M}.${+m + 1}.0-0`; + // ~1.2.3 == >=1.2.3 <1.3.0 + ret = '>=' + M + '.' + m + '.' + p + + ' <' + M + '.' + (+m + 1) + '.0'; } - debug_1('tilde return', ret); + debug('tilde return', ret); return ret }) -}; +} // ^ --> * (any, kinda silly) -// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0 -// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0 -// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0 -// ^1.2.3 --> >=1.2.3 <2.0.0-0 -// ^1.2.0 --> >=1.2.0 <2.0.0-0 -const replaceCarets = (comp, options) => - comp.trim().split(/\s+/).map((comp) => { +// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0 +// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0 +// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0 +// ^1.2.3 --> >=1.2.3 <2.0.0 +// ^1.2.0 --> >=1.2.0 <2.0.0 +function replaceCarets (comp, options) { + return comp.trim().split(/\s+/).map(function (comp) { return replaceCaret(comp, options) - }).join(' '); + }).join(' ') +} -const replaceCaret = (comp, options) => { - debug_1('caret', comp, options); - const r = options.loose ? re$3[t$3.CARETLOOSE] : re$3[t$3.CARET]; - const z = options.includePrerelease ? '-0' : ''; - return comp.replace(r, (_, M, m, p, pr) => { - debug_1('caret', comp, _, M, m, p, pr); - let ret; +function replaceCaret (comp, options) { + debug('caret', comp, options); + var r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]; + return comp.replace(r, function (_, M, m, p, pr) { + debug('caret', comp, _, M, m, p, pr); + var ret; if (isX(M)) { ret = ''; } else if (isX(m)) { - ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`; + ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'; } else if (isX(p)) { if (M === '0') { - ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`; + ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'; } else { - ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`; + ret = '>=' + M + '.' + m + '.0 <' + (+M + 1) + '.0.0'; } } else if (pr) { - debug_1('replaceCaret pr', pr); + debug('replaceCaret pr', pr); if (M === '0') { if (m === '0') { - ret = `>=${M}.${m}.${p}-${pr - } <${M}.${m}.${+p + 1}-0`; + ret = '>=' + M + '.' + m + '.' + p + '-' + pr + + ' <' + M + '.' + m + '.' + (+p + 1); } else { - ret = `>=${M}.${m}.${p}-${pr - } <${M}.${+m + 1}.0-0`; + ret = '>=' + M + '.' + m + '.' + p + '-' + pr + + ' <' + M + '.' + (+m + 1) + '.0'; } } else { - ret = `>=${M}.${m}.${p}-${pr - } <${+M + 1}.0.0-0`; + ret = '>=' + M + '.' + m + '.' + p + '-' + pr + + ' <' + (+M + 1) + '.0.0'; } } else { - debug_1('no pr'); + debug('no pr'); if (M === '0') { if (m === '0') { - ret = `>=${M}.${m}.${p - }${z} <${M}.${m}.${+p + 1}-0`; + ret = '>=' + M + '.' + m + '.' + p + + ' <' + M + '.' + m + '.' + (+p + 1); } else { - ret = `>=${M}.${m}.${p - }${z} <${M}.${+m + 1}.0-0`; + ret = '>=' + M + '.' + m + '.' + p + + ' <' + M + '.' + (+m + 1) + '.0'; } } else { - ret = `>=${M}.${m}.${p - } <${+M + 1}.0.0-0`; + ret = '>=' + M + '.' + m + '.' + p + + ' <' + (+M + 1) + '.0.0'; } } - debug_1('caret return', ret); + debug('caret return', ret); return ret }) -}; +} -const replaceXRanges = (comp, options) => { - debug_1('replaceXRanges', comp, options); - return comp.split(/\s+/).map((comp) => { +function replaceXRanges (comp, options) { + debug('replaceXRanges', comp, options); + return comp.split(/\s+/).map(function (comp) { return replaceXRange(comp, options) }).join(' ') -}; +} -const replaceXRange = (comp, options) => { +function replaceXRange (comp, options) { comp = comp.trim(); - const r = options.loose ? re$3[t$3.XRANGELOOSE] : re$3[t$3.XRANGE]; - return comp.replace(r, (ret, gtlt, M, m, p, pr) => { - debug_1('xRange', comp, ret, gtlt, M, m, p, pr); - const xM = isX(M); - const xm = xM || isX(m); - const xp = xm || isX(p); - const anyX = xp; + var r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]; + return comp.replace(r, function (ret, gtlt, M, m, p, pr) { + debug('xRange', comp, ret, gtlt, M, m, p, pr); + var xM = isX(M); + var xm = xM || isX(m); + var xp = xm || isX(p); + var anyX = xp; if (gtlt === '=' && anyX) { gtlt = ''; @@ -27097,6 +26274,7 @@ const replaceXRange = (comp, options) => { if (gtlt === '>') { // >1 => >=2.0.0 // >1.2 => >=1.3.0 + // >1.2.3 => >= 1.2.4 gtlt = '>='; if (xm) { M = +M + 1; @@ -27117,76 +26295,85 @@ const replaceXRange = (comp, options) => { } } - if (gtlt === '<') - pr = '-0'; - - ret = `${gtlt + M}.${m}.${p}${pr}`; + ret = gtlt + M + '.' + m + '.' + p + pr; } else if (xm) { - ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`; + ret = '>=' + M + '.0.0' + pr + ' <' + (+M + 1) + '.0.0' + pr; } else if (xp) { - ret = `>=${M}.${m}.0${pr - } <${M}.${+m + 1}.0-0`; + ret = '>=' + M + '.' + m + '.0' + pr + + ' <' + M + '.' + (+m + 1) + '.0' + pr; } - debug_1('xRange return', ret); + debug('xRange return', ret); return ret }) -}; +} // Because * is AND-ed with everything else in the comparator, // and '' means "any version", just remove the *s entirely. -const replaceStars = (comp, options) => { - debug_1('replaceStars', comp, options); +function replaceStars (comp, options) { + debug('replaceStars', comp, options); // Looseness is ignored here. star is always as loose as it gets! - return comp.trim().replace(re$3[t$3.STAR], '') -}; - -const replaceGTE0 = (comp, options) => { - debug_1('replaceGTE0', comp, options); - return comp.trim() - .replace(re$3[options.includePrerelease ? t$3.GTE0PRE : t$3.GTE0], '') -}; + return comp.trim().replace(re[t.STAR], '') +} // This function is passed to string.replace(re[t.HYPHENRANGE]) // M, m, patch, prerelease, build // 1.2 - 3.4.5 => >=1.2.0 <=3.4.5 -// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do -// 1.2 - 3.4 => >=1.2.0 <3.5.0-0 -const hyphenReplace = incPr => ($0, +// 1.2.3 - 3.4 => >=1.2.0 <3.5.0 Any 3.4.x will do +// 1.2 - 3.4 => >=1.2.0 <3.5.0 +function hyphenReplace ($0, from, fM, fm, fp, fpr, fb, - to, tM, tm, tp, tpr, tb) => { + to, tM, tm, tp, tpr, tb) { if (isX(fM)) { from = ''; } else if (isX(fm)) { - from = `>=${fM}.0.0${incPr ? '-0' : ''}`; + from = '>=' + fM + '.0.0'; } else if (isX(fp)) { - from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`; - } else if (fpr) { - from = `>=${from}`; + from = '>=' + fM + '.' + fm + '.0'; } else { - from = `>=${from}${incPr ? '-0' : ''}`; + from = '>=' + from; } if (isX(tM)) { to = ''; } else if (isX(tm)) { - to = `<${+tM + 1}.0.0-0`; + to = '<' + (+tM + 1) + '.0.0'; } else if (isX(tp)) { - to = `<${tM}.${+tm + 1}.0-0`; + to = '<' + tM + '.' + (+tm + 1) + '.0'; } else if (tpr) { - to = `<=${tM}.${tm}.${tp}-${tpr}`; - } else if (incPr) { - to = `<${tM}.${tm}.${+tp + 1}-0`; + to = '<=' + tM + '.' + tm + '.' + tp + '-' + tpr; } else { - to = `<=${to}`; + to = '<=' + to; + } + + return (from + ' ' + to).trim() +} + +// if ANY of the sets match ALL of its comparators, then pass +Range.prototype.test = function (version) { + if (!version) { + return false + } + + if (typeof version === 'string') { + try { + version = new SemVer(version, this.options); + } catch (er) { + return false + } } - return (`${from} ${to}`).trim() + for (var i = 0; i < this.set.length; i++) { + if (testSet(this.set[i], version, this.options)) { + return true + } + } + return false }; -const testSet = (set, version, options) => { - for (let i = 0; i < set.length; i++) { +function testSet (set, version, options) { + for (var i = 0; i < set.length; i++) { if (!set[i].test(version)) { return false } @@ -27198,14 +26385,14 @@ const testSet = (set, version, options) => { // That should allow `1.2.3-pr.2` to pass. // However, `1.2.4-alpha.notready` should NOT be allowed, // even though it's within the range set by the comparators. - for (let i = 0; i < set.length; i++) { - debug_1(set[i].semver); - if (set[i].semver === comparator.ANY) { + for (i = 0; i < set.length; i++) { + debug(set[i].semver); + if (set[i].semver === ANY) { continue } if (set[i].semver.prerelease.length > 0) { - const allowed = set[i].semver; + var allowed = set[i].semver; if (allowed.major === version.major && allowed.minor === version.minor && allowed.patch === version.patch) { @@ -27219,224 +26406,83 @@ const testSet = (set, version, options) => { } return true -}; - -const ANY = Symbol('SemVer ANY'); -// hoisted class for cyclic dependency -class Comparator { - static get ANY () { - return ANY - } - constructor (comp, options) { - options = parseOptions_1(options); - - if (comp instanceof Comparator) { - if (comp.loose === !!options.loose) { - return comp - } else { - comp = comp.value; - } - } - - debug_1('comparator', comp, options); - this.options = options; - this.loose = !!options.loose; - this.parse(comp); - - if (this.semver === ANY) { - this.value = ''; - } else { - this.value = this.operator + this.semver.version; - } - - debug_1('comp', this); - } - - parse (comp) { - const r = this.options.loose ? re$4[t$4.COMPARATORLOOSE] : re$4[t$4.COMPARATOR]; - const m = comp.match(r); - - if (!m) { - throw new TypeError(`Invalid comparator: ${comp}`) - } - - this.operator = m[1] !== undefined ? m[1] : ''; - if (this.operator === '=') { - this.operator = ''; - } - - // if it literally is just '>' or '' then allow anything. - if (!m[2]) { - this.semver = ANY; - } else { - this.semver = new semver(m[2], this.options.loose); - } - } - - toString () { - return this.value - } - - test (version) { - debug_1('Comparator.test', version, this.options.loose); - - if (this.semver === ANY || version === ANY) { - return true - } - - if (typeof version === 'string') { - try { - version = new semver(version, this.options); - } catch (er) { - return false - } - } - - return cmp_1(version, this.operator, this.semver, this.options) - } - - intersects (comp, options) { - if (!(comp instanceof Comparator)) { - throw new TypeError('a Comparator is required') - } - - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - - if (this.operator === '') { - if (this.value === '') { - return true - } - return new range(comp.value, options).test(this.value) - } else if (comp.operator === '') { - if (comp.value === '') { - return true - } - return new range(this.value, options).test(comp.semver) - } - - const sameDirectionIncreasing = - (this.operator === '>=' || this.operator === '>') && - (comp.operator === '>=' || comp.operator === '>'); - const sameDirectionDecreasing = - (this.operator === '<=' || this.operator === '<') && - (comp.operator === '<=' || comp.operator === '<'); - const sameSemVer = this.semver.version === comp.semver.version; - const differentDirectionsInclusive = - (this.operator === '>=' || this.operator === '<=') && - (comp.operator === '>=' || comp.operator === '<='); - const oppositeDirectionsLessThan = - cmp_1(this.semver, '<', comp.semver, options) && - (this.operator === '>=' || this.operator === '>') && - (comp.operator === '<=' || comp.operator === '<'); - const oppositeDirectionsGreaterThan = - cmp_1(this.semver, '>', comp.semver, options) && - (this.operator === '<=' || this.operator === '<') && - (comp.operator === '>=' || comp.operator === '>'); - - return ( - sameDirectionIncreasing || - sameDirectionDecreasing || - (sameSemVer && differentDirectionsInclusive) || - oppositeDirectionsLessThan || - oppositeDirectionsGreaterThan - ) - } } -var comparator = Comparator; - - -const {re: re$4, t: t$4} = re_1; - -const satisfies = (version, range$1, options) => { +exports.satisfies = satisfies; +function satisfies (version, range, options) { try { - range$1 = new range(range$1, options); + range = new Range(range, options); } catch (er) { return false } - return range$1.test(version) -}; -var satisfies_1 = satisfies; - -// Mostly just for testing and legacy API reasons -const toComparators = (range$1, options) => - new range(range$1, options).set - .map(comp => comp.map(c => c.value).join(' ').trim().split(' ')); - -var toComparators_1 = toComparators; + return range.test(version) +} -const maxSatisfying = (versions, range$1, options) => { - let max = null; - let maxSV = null; - let rangeObj = null; +exports.maxSatisfying = maxSatisfying; +function maxSatisfying (versions, range, options) { + var max = null; + var maxSV = null; try { - rangeObj = new range(range$1, options); + var rangeObj = new Range(range, options); } catch (er) { return null } - versions.forEach((v) => { + versions.forEach(function (v) { if (rangeObj.test(v)) { // satisfies(v, range, options) if (!max || maxSV.compare(v) === -1) { // compare(max, v, true) max = v; - maxSV = new semver(max, options); + maxSV = new SemVer(max, options); } } }); return max -}; -var maxSatisfying_1 = maxSatisfying; +} -const minSatisfying = (versions, range$1, options) => { - let min = null; - let minSV = null; - let rangeObj = null; +exports.minSatisfying = minSatisfying; +function minSatisfying (versions, range, options) { + var min = null; + var minSV = null; try { - rangeObj = new range(range$1, options); + var rangeObj = new Range(range, options); } catch (er) { return null } - versions.forEach((v) => { + versions.forEach(function (v) { if (rangeObj.test(v)) { // satisfies(v, range, options) if (!min || minSV.compare(v) === 1) { // compare(min, v, true) min = v; - minSV = new semver(min, options); + minSV = new SemVer(min, options); } } }); return min -}; -var minSatisfying_1 = minSatisfying; +} -const minVersion = (range$1, loose) => { - range$1 = new range(range$1, loose); +exports.minVersion = minVersion; +function minVersion (range, loose) { + range = new Range(range, loose); - let minver = new semver('0.0.0'); - if (range$1.test(minver)) { + var minver = new SemVer('0.0.0'); + if (range.test(minver)) { return minver } - minver = new semver('0.0.0-0'); - if (range$1.test(minver)) { + minver = new SemVer('0.0.0-0'); + if (range.test(minver)) { return minver } minver = null; - for (let i = 0; i < range$1.set.length; ++i) { - const comparators = range$1.set[i]; + for (var i = 0; i < range.set.length; ++i) { + var comparators = range.set[i]; - let setMin = null; - comparators.forEach((comparator) => { + comparators.forEach(function (comparator) { // Clone to avoid manipulating the comparator's semver object. - const compver = new semver(comparator.semver.version); + var compver = new SemVer(comparator.semver.version); switch (comparator.operator) { case '>': if (compver.prerelease.length === 0) { @@ -27448,8 +26494,8 @@ const minVersion = (range$1, loose) => { /* fallthrough */ case '': case '>=': - if (!setMin || gt_1(compver, setMin)) { - setMin = compver; + if (!minver || gt(minver, compver)) { + minver = compver; } break case '<': @@ -27458,57 +26504,59 @@ const minVersion = (range$1, loose) => { break /* istanbul ignore next */ default: - throw new Error(`Unexpected operation: ${comparator.operator}`) + throw new Error('Unexpected operation: ' + comparator.operator) } }); - if (setMin && (!minver || gt_1(minver, setMin))) - minver = setMin; } - if (minver && range$1.test(minver)) { + if (minver && range.test(minver)) { return minver } return null -}; -var minVersion_1 = minVersion; +} -const validRange = (range$1, options) => { +exports.validRange = validRange; +function validRange (range, options) { try { // Return '*' instead of '' so that truthiness works. // This will throw if it's invalid anyway - return new range(range$1, options).range || '*' + return new Range(range, options).range || '*' } catch (er) { return null } -}; -var valid$1 = validRange; - -const {ANY: ANY$1} = comparator; - - - - +} +// Determine if version is less than all the versions possible in the range +exports.ltr = ltr; +function ltr (version, range, options) { + return outside(version, range, '<', options) +} +// Determine if version is greater than all the versions possible in the range. +exports.gtr = gtr; +function gtr (version, range, options) { + return outside(version, range, '>', options) +} -const outside = (version, range$1, hilo, options) => { - version = new semver(version, options); - range$1 = new range(range$1, options); +exports.outside = outside; +function outside (version, range, hilo, options) { + version = new SemVer(version, options); + range = new Range(range, options); - let gtfn, ltefn, ltfn, comp, ecomp; + var gtfn, ltefn, ltfn, comp, ecomp; switch (hilo) { case '>': - gtfn = gt_1; - ltefn = lte_1; - ltfn = lt_1; + gtfn = gt; + ltefn = lte; + ltfn = lt; comp = '>'; ecomp = '>='; break case '<': - gtfn = lt_1; - ltefn = gte_1; - ltfn = gt_1; + gtfn = lt; + ltefn = gte; + ltfn = gt; comp = '<'; ecomp = '<='; break @@ -27516,30 +26564,30 @@ const outside = (version, range$1, hilo, options) => { throw new TypeError('Must provide a hilo val of "<" or ">"') } - // If it satisfies the range it is not outside - if (satisfies_1(version, range$1, options)) { + // If it satisifes the range it is not outside + if (satisfies(version, range, options)) { return false } // From now on, variable terms are as if we're in "gtr" mode. // but note that everything is flipped for the "ltr" function. - for (let i = 0; i < range$1.set.length; ++i) { - const comparators = range$1.set[i]; + for (var i = 0; i < range.set.length; ++i) { + var comparators = range.set[i]; - let high = null; - let low = null; + var high = null; + var low = null; - comparators.forEach((comparator$1) => { - if (comparator$1.semver === ANY$1) { - comparator$1 = new comparator('>=0.0.0'); + comparators.forEach(function (comparator) { + if (comparator.semver === ANY) { + comparator = new Comparator('>=0.0.0'); } - high = high || comparator$1; - low = low || comparator$1; - if (gtfn(comparator$1.semver, high.semver, options)) { - high = comparator$1; - } else if (ltfn(comparator$1.semver, low.semver, options)) { - low = comparator$1; + high = high || comparator; + low = low || comparator; + if (gtfn(comparator.semver, high.semver, options)) { + high = comparator; + } else if (ltfn(comparator.semver, low.semver, options)) { + low = comparator; } }); @@ -27559,286 +26607,119 @@ const outside = (version, range$1, hilo, options) => { } } return true -}; +} -var outside_1 = outside; - -// Determine if version is greater than all the versions possible in the range. - -const gtr = (version, range, options) => outside_1(version, range, '>', options); -var gtr_1 = gtr; - -// Determine if version is less than all the versions possible in the range -const ltr = (version, range, options) => outside_1(version, range, '<', options); -var ltr_1 = ltr; +exports.prerelease = prerelease; +function prerelease (version, options) { + var parsed = parse(version, options); + return (parsed && parsed.prerelease.length) ? parsed.prerelease : null +} -const intersects = (r1, r2, options) => { - r1 = new range(r1, options); - r2 = new range(r2, options); +exports.intersects = intersects; +function intersects (r1, r2, options) { + r1 = new Range(r1, options); + r2 = new Range(r2, options); return r1.intersects(r2) -}; -var intersects_1 = intersects; - -// given a set of versions and a range, create a "simplified" range -// that includes the same versions that the original range does -// If the original range is shorter than the simplified one, return that. - - -var simplify = (versions, range, options) => { - const set = []; - let min = null; - let prev = null; - const v = versions.sort((a, b) => compare_1(a, b, options)); - for (const version of v) { - const included = satisfies_1(version, range, options); - if (included) { - prev = version; - if (!min) - min = version; - } else { - if (prev) { - set.push([min, prev]); - } - prev = null; - min = null; - } - } - if (min) - set.push([min, null]); - - const ranges = []; - for (const [min, max] of set) { - if (min === max) - ranges.push(min); - else if (!max && min === v[0]) - ranges.push('*'); - else if (!max) - ranges.push(`>=${min}`); - else if (min === v[0]) - ranges.push(`<=${max}`); - else - ranges.push(`${min} - ${max}`); - } - const simplified = ranges.join(' || '); - const original = typeof range.raw === 'string' ? range.raw : String(range); - return simplified.length < original.length ? simplified : range -}; - -const { ANY: ANY$2 } = comparator; - - - -// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff: -// - Every simple range `r1, r2, ...` is a subset of some `R1, R2, ...` -// -// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff: -// - If c is only the ANY comparator -// - If C is only the ANY comparator, return true -// - Else return false -// - Let EQ be the set of = comparators in c -// - If EQ is more than one, return true (null set) -// - Let GT be the highest > or >= comparator in c -// - Let LT be the lowest < or <= comparator in c -// - If GT and LT, and GT.semver > LT.semver, return true (null set) -// - If EQ -// - If GT, and EQ does not satisfy GT, return true (null set) -// - If LT, and EQ does not satisfy LT, return true (null set) -// - If EQ satisfies every C, return true -// - Else return false -// - If GT -// - If GT.semver is lower than any > or >= comp in C, return false -// - If GT is >=, and GT.semver does not satisfy every C, return false -// - If LT -// - If LT.semver is greater than any < or <= comp in C, return false -// - If LT is <=, and LT.semver does not satisfy every C, return false -// - If any C is a = range, and GT or LT are set, return false -// - Else return true - -const subset = (sub, dom, options) => { - if (sub === dom) - return true +} - sub = new range(sub, options); - dom = new range(dom, options); - let sawNonNull = false; - - OUTER: for (const simpleSub of sub.set) { - for (const simpleDom of dom.set) { - const isSub = simpleSubset(simpleSub, simpleDom, options); - sawNonNull = sawNonNull || isSub !== null; - if (isSub) - continue OUTER - } - // the null set is a subset of everything, but null simple ranges in - // a complex range should be ignored. so if we saw a non-null range, - // then we know this isn't a subset, but if EVERY simple range was null, - // then it is a subset. - if (sawNonNull) - return false +exports.coerce = coerce; +function coerce (version, options) { + if (version instanceof SemVer) { + return version } - return true -}; - -const simpleSubset = (sub, dom, options) => { - if (sub === dom) - return true - - if (sub.length === 1 && sub[0].semver === ANY$2) - return dom.length === 1 && dom[0].semver === ANY$2 - const eqSet = new Set(); - let gt, lt; - for (const c of sub) { - if (c.operator === '>' || c.operator === '>=') - gt = higherGT(gt, c, options); - else if (c.operator === '<' || c.operator === '<=') - lt = lowerLT(lt, c, options); - else - eqSet.add(c.semver); + if (typeof version === 'number') { + version = String(version); } - if (eqSet.size > 1) + if (typeof version !== 'string') { return null - - let gtltComp; - if (gt && lt) { - gtltComp = compare_1(gt.semver, lt.semver, options); - if (gtltComp > 0) - return null - else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) - return null } - // will iterate one or zero times - for (const eq of eqSet) { - if (gt && !satisfies_1(eq, String(gt), options)) - return null - - if (lt && !satisfies_1(eq, String(lt), options)) - return null + options = options || {}; - for (const c of dom) { - if (!satisfies_1(eq, String(c), options)) - return false + var match = null; + if (!options.rtl) { + match = version.match(re[t.COERCE]); + } else { + // Find the right-most coercible string that does not share + // a terminus with a more left-ward coercible string. + // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4' + // + // Walk through the string checking with a /g regexp + // Manually set the index so as to pick up overlapping matches. + // Stop when we get a match that ends at the string end, since no + // coercible string can be more right-ward without the same terminus. + var next; + while ((next = re[t.COERCERTL].exec(version)) && + (!match || match.index + match[0].length !== version.length) + ) { + if (!match || + next.index + next[0].length !== match.index + match[0].length) { + match = next; + } + re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length; } - - return true + // leave it in a clean state + re[t.COERCERTL].lastIndex = -1; } - let higher, lower; - let hasDomLT, hasDomGT; - for (const c of dom) { - hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='; - hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='; - if (gt) { - if (c.operator === '>' || c.operator === '>=') { - higher = higherGT(gt, c, options); - if (higher === c && higher !== gt) - return false - } else if (gt.operator === '>=' && !satisfies_1(gt.semver, String(c), options)) - return false - } - if (lt) { - if (c.operator === '<' || c.operator === '<=') { - lower = lowerLT(lt, c, options); - if (lower === c && lower !== lt) - return false - } else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options)) - return false - } - if (!c.operator && (lt || gt) && gtltComp !== 0) - return false + if (match === null) { + return null } - // if there was a < or >, and nothing in the dom, then must be false - // UNLESS it was limited by another range in the other direction. - // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0 - if (gt && hasDomLT && !lt && gtltComp !== 0) - return false - - if (lt && hasDomGT && !gt && gtltComp !== 0) - return false - - return true -}; - -// >=1.2.3 is lower than >1.2.3 -const higherGT = (a, b, options) => { - if (!a) - return b - const comp = compare_1(a.semver, b.semver, options); - return comp > 0 ? a - : comp < 0 ? b - : b.operator === '>' && a.operator === '>=' ? b - : a -}; - -// <=1.2.3 is higher than <1.2.3 -const lowerLT = (a, b, options) => { - if (!a) - return b - const comp = compare_1(a.semver, b.semver, options); - return comp < 0 ? a - : comp > 0 ? b - : b.operator === '<' && a.operator === '<=' ? b - : a -}; - -var subset_1 = subset; - -// just pre-load all the stuff that index.js lazily exports - -var semver$1 = { - re: re_1.re, - src: re_1.src, - tokens: re_1.t, - SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION, - SemVer: semver, - compareIdentifiers: identifiers.compareIdentifiers, - rcompareIdentifiers: identifiers.rcompareIdentifiers, - parse: parse_1, - valid: valid_1, - clean: clean_1, - inc: inc_1, - diff: diff_1, - major: major_1, - minor: minor_1, - patch: patch_1, - prerelease: prerelease_1, - compare: compare_1, - rcompare: rcompare_1, - compareLoose: compareLoose_1, - compareBuild: compareBuild_1, - sort: sort_1, - rsort: rsort_1, - gt: gt_1, - lt: lt_1, - eq: eq_1$1, - neq: neq_1, - gte: gte_1, - lte: lte_1, - cmp: cmp_1, - coerce: coerce_1, - Comparator: comparator, - Range: range, - satisfies: satisfies_1, - toComparators: toComparators_1, - maxSatisfying: maxSatisfying_1, - minSatisfying: minSatisfying_1, - minVersion: minVersion_1, - validRange: valid$1, - outside: outside_1, - gtr: gtr_1, - ltr: ltr_1, - intersects: intersects_1, - simplifyRange: simplify, - subset: subset_1, -}; + return parse(match[2] + + '.' + (match[3] || '0') + + '.' + (match[4] || '0'), options) +} +}); +var semver_1 = semver.SEMVER_SPEC_VERSION; +var semver_2 = semver.re; +var semver_3 = semver.src; +var semver_4 = semver.tokens; +var semver_5 = semver.parse; +var semver_6 = semver.valid; +var semver_7 = semver.clean; +var semver_8 = semver.SemVer; +var semver_9 = semver.inc; +var semver_10 = semver.diff; +var semver_11 = semver.compareIdentifiers; +var semver_12 = semver.rcompareIdentifiers; +var semver_13 = semver.major; +var semver_14 = semver.minor; +var semver_15 = semver.patch; +var semver_16 = semver.compare; +var semver_17 = semver.compareLoose; +var semver_18 = semver.compareBuild; +var semver_19 = semver.rcompare; +var semver_20 = semver.sort; +var semver_21 = semver.rsort; +var semver_22 = semver.gt; +var semver_23 = semver.lt; +var semver_24 = semver.eq; +var semver_25 = semver.neq; +var semver_26 = semver.gte; +var semver_27 = semver.lte; +var semver_28 = semver.cmp; +var semver_29 = semver.Comparator; +var semver_30 = semver.Range; +var semver_31 = semver.toComparators; +var semver_32 = semver.satisfies; +var semver_33 = semver.maxSatisfying; +var semver_34 = semver.minSatisfying; +var semver_35 = semver.minVersion; +var semver_36 = semver.validRange; +var semver_37 = semver.ltr; +var semver_38 = semver.gtr; +var semver_39 = semver.outside; +var semver_40 = semver.prerelease; +var semver_41 = semver.intersects; +var semver_42 = semver.coerce; var commondir = function (basedir, relfiles) { if (relfiles) { var files = relfiles.map(function (r) { - return path__default['default'].resolve(basedir, r); + return path__default.resolve(basedir, r); }); } else { @@ -27869,8 +26750,8 @@ const pTry = (fn, ...arguments_) => new Promise(resolve => { var pTry_1 = pTry; // TODO: remove this in the next major version -var _default = pTry; -pTry_1.default = _default; +var default_1 = pTry; +pTry_1.default = default_1; const pLimit = concurrency => { if (!((Number.isInteger(concurrency) || concurrency === Infinity) && concurrency > 0)) { @@ -27920,8 +26801,8 @@ const pLimit = concurrency => { }; var pLimit_1 = pLimit; -var _default$1 = pLimit; -pLimit_1.default = _default$1; +var default_1$1 = pLimit; +pLimit_1.default = default_1$1; class EndError extends Error { constructor(value) { @@ -27971,14 +26852,14 @@ const pLocate = async (iterable, tester, options) => { var pLocate_1 = pLocate; // TODO: Remove this for the next major release -var _default$2 = pLocate; -pLocate_1.default = _default$2; +var default_1$2 = pLocate; +pLocate_1.default = default_1$2; -const {promisify} = require$$0__default['default']; +const {promisify} = util; -const fsStat = promisify(fs__default['default'].stat); -const fsLStat = promisify(fs__default['default'].lstat); +const fsStat = promisify(fs__default.stat); +const fsLStat = promisify(fs__default.lstat); const typeMappings = { directory: 'isDirectory', @@ -28007,7 +26888,7 @@ var locatePath = async (paths, options) => { return pLocate_1(paths, async path_ => { try { - const stat = await statFn(path__default['default'].resolve(options.cwd, path_)); + const stat = await statFn(path__default.resolve(options.cwd, path_)); return matchType(options.type, stat); } catch (_) { return false; @@ -28023,11 +26904,11 @@ var sync = (paths, options) => { ...options }; checkType(options); - const statFn = options.allowSymlinks ? fs__default['default'].statSync : fs__default['default'].lstatSync; + const statFn = options.allowSymlinks ? fs__default.statSync : fs__default.lstatSync; for (const path_ of paths) { try { - const stat = statFn(path__default['default'].resolve(options.cwd, path_)); + const stat = statFn(path__default.resolve(options.cwd, path_)); if (matchType(options.type, stat)) { return path_; @@ -28038,9 +26919,9 @@ var sync = (paths, options) => { }; locatePath.sync = sync; -const {promisify: promisify$1} = require$$0__default['default']; +const {promisify: promisify$1} = util; -const pAccess = promisify$1(fs__default['default'].access); +const pAccess = promisify$1(fs__default.access); var pathExists = async path => { try { @@ -28053,7 +26934,7 @@ var pathExists = async path => { var sync$1 = path => { try { - fs__default['default'].accessSync(path); + fs__default.accessSync(path); return true; } catch (_) { return false; @@ -28069,1714 +26950,123 @@ var findUp = createCommonjsModule(function (module) { const stop = Symbol('findUp.stop'); module.exports = async (name, options = {}) => { - let directory = path__default['default'].resolve(options.cwd || ''); - const {root} = path__default['default'].parse(directory); - const paths = [].concat(name); - - const runMatcher = async locateOptions => { - if (typeof name !== 'function') { - return locatePath(paths, locateOptions); - } - - const foundPath = await name(locateOptions.cwd); - if (typeof foundPath === 'string') { - return locatePath([foundPath], locateOptions); - } - - return foundPath; - }; - - // eslint-disable-next-line no-constant-condition - while (true) { - // eslint-disable-next-line no-await-in-loop - const foundPath = await runMatcher({...options, cwd: directory}); - - if (foundPath === stop) { - return; - } - - if (foundPath) { - return path__default['default'].resolve(directory, foundPath); - } - - if (directory === root) { - return; - } - - directory = path__default['default'].dirname(directory); - } -}; - -module.exports.sync = (name, options = {}) => { - let directory = path__default['default'].resolve(options.cwd || ''); - const {root} = path__default['default'].parse(directory); + let directory = path__default.resolve(options.cwd || ''); + const {root} = path__default.parse(directory); const paths = [].concat(name); - const runMatcher = locateOptions => { - if (typeof name !== 'function') { - return locatePath.sync(paths, locateOptions); - } - - const foundPath = name(locateOptions.cwd); - if (typeof foundPath === 'string') { - return locatePath.sync([foundPath], locateOptions); - } - - return foundPath; - }; - - // eslint-disable-next-line no-constant-condition - while (true) { - const foundPath = runMatcher({...options, cwd: directory}); - - if (foundPath === stop) { - return; - } - - if (foundPath) { - return path__default['default'].resolve(directory, foundPath); - } - - if (directory === root) { - return; - } - - directory = path__default['default'].dirname(directory); - } -}; - -module.exports.exists = pathExists; - -module.exports.sync.exists = pathExists.sync; - -module.exports.stop = stop; -}); - -const pkgDir = async cwd => { - const filePath = await findUp('package.json', {cwd}); - return filePath && path__default['default'].dirname(filePath); -}; - -var pkgDir_1 = pkgDir; -// TODO: Remove this for the next major release -var _default$3 = pkgDir; - -var sync$2 = cwd => { - const filePath = findUp.sync('package.json', {cwd}); - return filePath && path__default['default'].dirname(filePath); -}; -pkgDir_1.default = _default$3; -pkgDir_1.sync = sync$2; - -var semver$2 = createCommonjsModule(function (module, exports) { -exports = module.exports = SemVer; - -var debug; -/* istanbul ignore next */ -if (typeof process === 'object' && - process.env && - process.env.NODE_DEBUG && - /\bsemver\b/i.test(process.env.NODE_DEBUG)) { - debug = function () { - var args = Array.prototype.slice.call(arguments, 0); - args.unshift('SEMVER'); - console.log.apply(console, args); - }; -} else { - debug = function () {}; -} - -// Note: this is the semver.org version of the spec that it implements -// Not necessarily the package version of this code. -exports.SEMVER_SPEC_VERSION = '2.0.0'; - -var MAX_LENGTH = 256; -var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || - /* istanbul ignore next */ 9007199254740991; - -// Max safe segment length for coercion. -var MAX_SAFE_COMPONENT_LENGTH = 16; - -// The actual regexps go on exports.re -var re = exports.re = []; -var src = exports.src = []; -var t = exports.tokens = {}; -var R = 0; - -function tok (n) { - t[n] = R++; -} - -// The following Regular Expressions can be used for tokenizing, -// validating, and parsing SemVer version strings. - -// ## Numeric Identifier -// A single `0`, or a non-zero digit followed by zero or more digits. - -tok('NUMERICIDENTIFIER'); -src[t.NUMERICIDENTIFIER] = '0|[1-9]\\d*'; -tok('NUMERICIDENTIFIERLOOSE'); -src[t.NUMERICIDENTIFIERLOOSE] = '[0-9]+'; - -// ## Non-numeric Identifier -// Zero or more digits, followed by a letter or hyphen, and then zero or -// more letters, digits, or hyphens. - -tok('NONNUMERICIDENTIFIER'); -src[t.NONNUMERICIDENTIFIER] = '\\d*[a-zA-Z-][a-zA-Z0-9-]*'; - -// ## Main Version -// Three dot-separated numeric identifiers. - -tok('MAINVERSION'); -src[t.MAINVERSION] = '(' + src[t.NUMERICIDENTIFIER] + ')\\.' + - '(' + src[t.NUMERICIDENTIFIER] + ')\\.' + - '(' + src[t.NUMERICIDENTIFIER] + ')'; - -tok('MAINVERSIONLOOSE'); -src[t.MAINVERSIONLOOSE] = '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' + - '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' + - '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')'; - -// ## Pre-release Version Identifier -// A numeric identifier, or a non-numeric identifier. - -tok('PRERELEASEIDENTIFIER'); -src[t.PRERELEASEIDENTIFIER] = '(?:' + src[t.NUMERICIDENTIFIER] + - '|' + src[t.NONNUMERICIDENTIFIER] + ')'; - -tok('PRERELEASEIDENTIFIERLOOSE'); -src[t.PRERELEASEIDENTIFIERLOOSE] = '(?:' + src[t.NUMERICIDENTIFIERLOOSE] + - '|' + src[t.NONNUMERICIDENTIFIER] + ')'; - -// ## Pre-release Version -// Hyphen, followed by one or more dot-separated pre-release version -// identifiers. - -tok('PRERELEASE'); -src[t.PRERELEASE] = '(?:-(' + src[t.PRERELEASEIDENTIFIER] + - '(?:\\.' + src[t.PRERELEASEIDENTIFIER] + ')*))'; - -tok('PRERELEASELOOSE'); -src[t.PRERELEASELOOSE] = '(?:-?(' + src[t.PRERELEASEIDENTIFIERLOOSE] + - '(?:\\.' + src[t.PRERELEASEIDENTIFIERLOOSE] + ')*))'; - -// ## Build Metadata Identifier -// Any combination of digits, letters, or hyphens. - -tok('BUILDIDENTIFIER'); -src[t.BUILDIDENTIFIER] = '[0-9A-Za-z-]+'; - -// ## Build Metadata -// Plus sign, followed by one or more period-separated build metadata -// identifiers. - -tok('BUILD'); -src[t.BUILD] = '(?:\\+(' + src[t.BUILDIDENTIFIER] + - '(?:\\.' + src[t.BUILDIDENTIFIER] + ')*))'; - -// ## Full Version String -// A main version, followed optionally by a pre-release version and -// build metadata. - -// Note that the only major, minor, patch, and pre-release sections of -// the version string are capturing groups. The build metadata is not a -// capturing group, because it should not ever be used in version -// comparison. - -tok('FULL'); -tok('FULLPLAIN'); -src[t.FULLPLAIN] = 'v?' + src[t.MAINVERSION] + - src[t.PRERELEASE] + '?' + - src[t.BUILD] + '?'; - -src[t.FULL] = '^' + src[t.FULLPLAIN] + '$'; - -// like full, but allows v1.2.3 and =1.2.3, which people do sometimes. -// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty -// common in the npm registry. -tok('LOOSEPLAIN'); -src[t.LOOSEPLAIN] = '[v=\\s]*' + src[t.MAINVERSIONLOOSE] + - src[t.PRERELEASELOOSE] + '?' + - src[t.BUILD] + '?'; - -tok('LOOSE'); -src[t.LOOSE] = '^' + src[t.LOOSEPLAIN] + '$'; - -tok('GTLT'); -src[t.GTLT] = '((?:<|>)?=?)'; - -// Something like "2.*" or "1.2.x". -// Note that "x.x" is a valid xRange identifer, meaning "any version" -// Only the first item is strictly required. -tok('XRANGEIDENTIFIERLOOSE'); -src[t.XRANGEIDENTIFIERLOOSE] = src[t.NUMERICIDENTIFIERLOOSE] + '|x|X|\\*'; -tok('XRANGEIDENTIFIER'); -src[t.XRANGEIDENTIFIER] = src[t.NUMERICIDENTIFIER] + '|x|X|\\*'; - -tok('XRANGEPLAIN'); -src[t.XRANGEPLAIN] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIER] + ')' + - '(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' + - '(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' + - '(?:' + src[t.PRERELEASE] + ')?' + - src[t.BUILD] + '?' + - ')?)?'; - -tok('XRANGEPLAINLOOSE'); -src[t.XRANGEPLAINLOOSE] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + - '(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + - '(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' + - '(?:' + src[t.PRERELEASELOOSE] + ')?' + - src[t.BUILD] + '?' + - ')?)?'; - -tok('XRANGE'); -src[t.XRANGE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAIN] + '$'; -tok('XRANGELOOSE'); -src[t.XRANGELOOSE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAINLOOSE] + '$'; - -// Coercion. -// Extract anything that could conceivably be a part of a valid semver -tok('COERCE'); -src[t.COERCE] = '(^|[^\\d])' + - '(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '})' + - '(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' + - '(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' + - '(?:$|[^\\d])'; -tok('COERCERTL'); -re[t.COERCERTL] = new RegExp(src[t.COERCE], 'g'); - -// Tilde ranges. -// Meaning is "reasonably at or greater than" -tok('LONETILDE'); -src[t.LONETILDE] = '(?:~>?)'; - -tok('TILDETRIM'); -src[t.TILDETRIM] = '(\\s*)' + src[t.LONETILDE] + '\\s+'; -re[t.TILDETRIM] = new RegExp(src[t.TILDETRIM], 'g'); -var tildeTrimReplace = '$1~'; - -tok('TILDE'); -src[t.TILDE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAIN] + '$'; -tok('TILDELOOSE'); -src[t.TILDELOOSE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAINLOOSE] + '$'; - -// Caret ranges. -// Meaning is "at least and backwards compatible with" -tok('LONECARET'); -src[t.LONECARET] = '(?:\\^)'; - -tok('CARETTRIM'); -src[t.CARETTRIM] = '(\\s*)' + src[t.LONECARET] + '\\s+'; -re[t.CARETTRIM] = new RegExp(src[t.CARETTRIM], 'g'); -var caretTrimReplace = '$1^'; - -tok('CARET'); -src[t.CARET] = '^' + src[t.LONECARET] + src[t.XRANGEPLAIN] + '$'; -tok('CARETLOOSE'); -src[t.CARETLOOSE] = '^' + src[t.LONECARET] + src[t.XRANGEPLAINLOOSE] + '$'; - -// A simple gt/lt/eq thing, or just "" to indicate "any version" -tok('COMPARATORLOOSE'); -src[t.COMPARATORLOOSE] = '^' + src[t.GTLT] + '\\s*(' + src[t.LOOSEPLAIN] + ')$|^$'; -tok('COMPARATOR'); -src[t.COMPARATOR] = '^' + src[t.GTLT] + '\\s*(' + src[t.FULLPLAIN] + ')$|^$'; - -// An expression to strip any whitespace between the gtlt and the thing -// it modifies, so that `> 1.2.3` ==> `>1.2.3` -tok('COMPARATORTRIM'); -src[t.COMPARATORTRIM] = '(\\s*)' + src[t.GTLT] + - '\\s*(' + src[t.LOOSEPLAIN] + '|' + src[t.XRANGEPLAIN] + ')'; - -// this one has to use the /g flag -re[t.COMPARATORTRIM] = new RegExp(src[t.COMPARATORTRIM], 'g'); -var comparatorTrimReplace = '$1$2$3'; - -// Something like `1.2.3 - 1.2.4` -// Note that these all use the loose form, because they'll be -// checked against either the strict or loose comparator form -// later. -tok('HYPHENRANGE'); -src[t.HYPHENRANGE] = '^\\s*(' + src[t.XRANGEPLAIN] + ')' + - '\\s+-\\s+' + - '(' + src[t.XRANGEPLAIN] + ')' + - '\\s*$'; - -tok('HYPHENRANGELOOSE'); -src[t.HYPHENRANGELOOSE] = '^\\s*(' + src[t.XRANGEPLAINLOOSE] + ')' + - '\\s+-\\s+' + - '(' + src[t.XRANGEPLAINLOOSE] + ')' + - '\\s*$'; - -// Star ranges basically just allow anything at all. -tok('STAR'); -src[t.STAR] = '(<|>)?=?\\s*\\*'; - -// Compile to actual regexp objects. -// All are flag-free, unless they were created above with a flag. -for (var i = 0; i < R; i++) { - debug(i, src[i]); - if (!re[i]) { - re[i] = new RegExp(src[i]); - } -} - -exports.parse = parse; -function parse (version, options) { - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - - if (version instanceof SemVer) { - return version - } - - if (typeof version !== 'string') { - return null - } - - if (version.length > MAX_LENGTH) { - return null - } - - var r = options.loose ? re[t.LOOSE] : re[t.FULL]; - if (!r.test(version)) { - return null - } - - try { - return new SemVer(version, options) - } catch (er) { - return null - } -} - -exports.valid = valid; -function valid (version, options) { - var v = parse(version, options); - return v ? v.version : null -} - -exports.clean = clean; -function clean (version, options) { - var s = parse(version.trim().replace(/^[=v]+/, ''), options); - return s ? s.version : null -} - -exports.SemVer = SemVer; - -function SemVer (version, options) { - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - if (version instanceof SemVer) { - if (version.loose === options.loose) { - return version - } else { - version = version.version; - } - } else if (typeof version !== 'string') { - throw new TypeError('Invalid Version: ' + version) - } - - if (version.length > MAX_LENGTH) { - throw new TypeError('version is longer than ' + MAX_LENGTH + ' characters') - } - - if (!(this instanceof SemVer)) { - return new SemVer(version, options) - } - - debug('SemVer', version, options); - this.options = options; - this.loose = !!options.loose; - - var m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL]); - - if (!m) { - throw new TypeError('Invalid Version: ' + version) - } - - this.raw = version; - - // these are actually numbers - this.major = +m[1]; - this.minor = +m[2]; - this.patch = +m[3]; - - if (this.major > MAX_SAFE_INTEGER || this.major < 0) { - throw new TypeError('Invalid major version') - } - - if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) { - throw new TypeError('Invalid minor version') - } - - if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) { - throw new TypeError('Invalid patch version') - } - - // numberify any prerelease numeric ids - if (!m[4]) { - this.prerelease = []; - } else { - this.prerelease = m[4].split('.').map(function (id) { - if (/^[0-9]+$/.test(id)) { - var num = +id; - if (num >= 0 && num < MAX_SAFE_INTEGER) { - return num - } - } - return id - }); - } - - this.build = m[5] ? m[5].split('.') : []; - this.format(); -} - -SemVer.prototype.format = function () { - this.version = this.major + '.' + this.minor + '.' + this.patch; - if (this.prerelease.length) { - this.version += '-' + this.prerelease.join('.'); - } - return this.version -}; - -SemVer.prototype.toString = function () { - return this.version -}; - -SemVer.prototype.compare = function (other) { - debug('SemVer.compare', this.version, this.options, other); - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - return this.compareMain(other) || this.comparePre(other) -}; - -SemVer.prototype.compareMain = function (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - return compareIdentifiers(this.major, other.major) || - compareIdentifiers(this.minor, other.minor) || - compareIdentifiers(this.patch, other.patch) -}; - -SemVer.prototype.comparePre = function (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - // NOT having a prerelease is > having one - if (this.prerelease.length && !other.prerelease.length) { - return -1 - } else if (!this.prerelease.length && other.prerelease.length) { - return 1 - } else if (!this.prerelease.length && !other.prerelease.length) { - return 0 - } - - var i = 0; - do { - var a = this.prerelease[i]; - var b = other.prerelease[i]; - debug('prerelease compare', i, a, b); - if (a === undefined && b === undefined) { - return 0 - } else if (b === undefined) { - return 1 - } else if (a === undefined) { - return -1 - } else if (a === b) { - continue - } else { - return compareIdentifiers(a, b) - } - } while (++i) -}; - -SemVer.prototype.compareBuild = function (other) { - if (!(other instanceof SemVer)) { - other = new SemVer(other, this.options); - } - - var i = 0; - do { - var a = this.build[i]; - var b = other.build[i]; - debug('prerelease compare', i, a, b); - if (a === undefined && b === undefined) { - return 0 - } else if (b === undefined) { - return 1 - } else if (a === undefined) { - return -1 - } else if (a === b) { - continue - } else { - return compareIdentifiers(a, b) - } - } while (++i) -}; - -// preminor will bump the version up to the next minor release, and immediately -// down to pre-release. premajor and prepatch work the same way. -SemVer.prototype.inc = function (release, identifier) { - switch (release) { - case 'premajor': - this.prerelease.length = 0; - this.patch = 0; - this.minor = 0; - this.major++; - this.inc('pre', identifier); - break - case 'preminor': - this.prerelease.length = 0; - this.patch = 0; - this.minor++; - this.inc('pre', identifier); - break - case 'prepatch': - // If this is already a prerelease, it will bump to the next version - // drop any prereleases that might already exist, since they are not - // relevant at this point. - this.prerelease.length = 0; - this.inc('patch', identifier); - this.inc('pre', identifier); - break - // If the input is a non-prerelease version, this acts the same as - // prepatch. - case 'prerelease': - if (this.prerelease.length === 0) { - this.inc('patch', identifier); - } - this.inc('pre', identifier); - break - - case 'major': - // If this is a pre-major version, bump up to the same major version. - // Otherwise increment major. - // 1.0.0-5 bumps to 1.0.0 - // 1.1.0 bumps to 2.0.0 - if (this.minor !== 0 || - this.patch !== 0 || - this.prerelease.length === 0) { - this.major++; - } - this.minor = 0; - this.patch = 0; - this.prerelease = []; - break - case 'minor': - // If this is a pre-minor version, bump up to the same minor version. - // Otherwise increment minor. - // 1.2.0-5 bumps to 1.2.0 - // 1.2.1 bumps to 1.3.0 - if (this.patch !== 0 || this.prerelease.length === 0) { - this.minor++; - } - this.patch = 0; - this.prerelease = []; - break - case 'patch': - // If this is not a pre-release version, it will increment the patch. - // If it is a pre-release it will bump up to the same patch version. - // 1.2.0-5 patches to 1.2.0 - // 1.2.0 patches to 1.2.1 - if (this.prerelease.length === 0) { - this.patch++; - } - this.prerelease = []; - break - // This probably shouldn't be used publicly. - // 1.0.0 "pre" would become 1.0.0-0 which is the wrong direction. - case 'pre': - if (this.prerelease.length === 0) { - this.prerelease = [0]; - } else { - var i = this.prerelease.length; - while (--i >= 0) { - if (typeof this.prerelease[i] === 'number') { - this.prerelease[i]++; - i = -2; - } - } - if (i === -1) { - // didn't increment anything - this.prerelease.push(0); - } - } - if (identifier) { - // 1.2.0-beta.1 bumps to 1.2.0-beta.2, - // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0 - if (this.prerelease[0] === identifier) { - if (isNaN(this.prerelease[1])) { - this.prerelease = [identifier, 0]; - } - } else { - this.prerelease = [identifier, 0]; - } - } - break - - default: - throw new Error('invalid increment argument: ' + release) - } - this.format(); - this.raw = this.version; - return this -}; - -exports.inc = inc; -function inc (version, release, loose, identifier) { - if (typeof (loose) === 'string') { - identifier = loose; - loose = undefined; - } - - try { - return new SemVer(version, loose).inc(release, identifier).version - } catch (er) { - return null - } -} - -exports.diff = diff; -function diff (version1, version2) { - if (eq(version1, version2)) { - return null - } else { - var v1 = parse(version1); - var v2 = parse(version2); - var prefix = ''; - if (v1.prerelease.length || v2.prerelease.length) { - prefix = 'pre'; - var defaultResult = 'prerelease'; - } - for (var key in v1) { - if (key === 'major' || key === 'minor' || key === 'patch') { - if (v1[key] !== v2[key]) { - return prefix + key - } - } - } - return defaultResult // may be undefined - } -} - -exports.compareIdentifiers = compareIdentifiers; - -var numeric = /^[0-9]+$/; -function compareIdentifiers (a, b) { - var anum = numeric.test(a); - var bnum = numeric.test(b); - - if (anum && bnum) { - a = +a; - b = +b; - } - - return a === b ? 0 - : (anum && !bnum) ? -1 - : (bnum && !anum) ? 1 - : a < b ? -1 - : 1 -} - -exports.rcompareIdentifiers = rcompareIdentifiers; -function rcompareIdentifiers (a, b) { - return compareIdentifiers(b, a) -} - -exports.major = major; -function major (a, loose) { - return new SemVer(a, loose).major -} - -exports.minor = minor; -function minor (a, loose) { - return new SemVer(a, loose).minor -} - -exports.patch = patch; -function patch (a, loose) { - return new SemVer(a, loose).patch -} - -exports.compare = compare; -function compare (a, b, loose) { - return new SemVer(a, loose).compare(new SemVer(b, loose)) -} - -exports.compareLoose = compareLoose; -function compareLoose (a, b) { - return compare(a, b, true) -} - -exports.compareBuild = compareBuild; -function compareBuild (a, b, loose) { - var versionA = new SemVer(a, loose); - var versionB = new SemVer(b, loose); - return versionA.compare(versionB) || versionA.compareBuild(versionB) -} - -exports.rcompare = rcompare; -function rcompare (a, b, loose) { - return compare(b, a, loose) -} - -exports.sort = sort; -function sort (list, loose) { - return list.sort(function (a, b) { - return exports.compareBuild(a, b, loose) - }) -} - -exports.rsort = rsort; -function rsort (list, loose) { - return list.sort(function (a, b) { - return exports.compareBuild(b, a, loose) - }) -} - -exports.gt = gt; -function gt (a, b, loose) { - return compare(a, b, loose) > 0 -} - -exports.lt = lt; -function lt (a, b, loose) { - return compare(a, b, loose) < 0 -} - -exports.eq = eq; -function eq (a, b, loose) { - return compare(a, b, loose) === 0 -} - -exports.neq = neq; -function neq (a, b, loose) { - return compare(a, b, loose) !== 0 -} - -exports.gte = gte; -function gte (a, b, loose) { - return compare(a, b, loose) >= 0 -} - -exports.lte = lte; -function lte (a, b, loose) { - return compare(a, b, loose) <= 0 -} - -exports.cmp = cmp; -function cmp (a, op, b, loose) { - switch (op) { - case '===': - if (typeof a === 'object') - a = a.version; - if (typeof b === 'object') - b = b.version; - return a === b - - case '!==': - if (typeof a === 'object') - a = a.version; - if (typeof b === 'object') - b = b.version; - return a !== b - - case '': - case '=': - case '==': - return eq(a, b, loose) - - case '!=': - return neq(a, b, loose) - - case '>': - return gt(a, b, loose) - - case '>=': - return gte(a, b, loose) - - case '<': - return lt(a, b, loose) - - case '<=': - return lte(a, b, loose) - - default: - throw new TypeError('Invalid operator: ' + op) - } -} - -exports.Comparator = Comparator; -function Comparator (comp, options) { - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - - if (comp instanceof Comparator) { - if (comp.loose === !!options.loose) { - return comp - } else { - comp = comp.value; - } - } - - if (!(this instanceof Comparator)) { - return new Comparator(comp, options) - } - - debug('comparator', comp, options); - this.options = options; - this.loose = !!options.loose; - this.parse(comp); - - if (this.semver === ANY) { - this.value = ''; - } else { - this.value = this.operator + this.semver.version; - } - - debug('comp', this); -} - -var ANY = {}; -Comparator.prototype.parse = function (comp) { - var r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]; - var m = comp.match(r); - - if (!m) { - throw new TypeError('Invalid comparator: ' + comp) - } - - this.operator = m[1] !== undefined ? m[1] : ''; - if (this.operator === '=') { - this.operator = ''; - } - - // if it literally is just '>' or '' then allow anything. - if (!m[2]) { - this.semver = ANY; - } else { - this.semver = new SemVer(m[2], this.options.loose); - } -}; - -Comparator.prototype.toString = function () { - return this.value -}; - -Comparator.prototype.test = function (version) { - debug('Comparator.test', version, this.options.loose); - - if (this.semver === ANY || version === ANY) { - return true - } - - if (typeof version === 'string') { - try { - version = new SemVer(version, this.options); - } catch (er) { - return false - } - } - - return cmp(version, this.operator, this.semver, this.options) -}; - -Comparator.prototype.intersects = function (comp, options) { - if (!(comp instanceof Comparator)) { - throw new TypeError('a Comparator is required') - } - - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - - var rangeTmp; - - if (this.operator === '') { - if (this.value === '') { - return true - } - rangeTmp = new Range(comp.value, options); - return satisfies(this.value, rangeTmp, options) - } else if (comp.operator === '') { - if (comp.value === '') { - return true - } - rangeTmp = new Range(this.value, options); - return satisfies(comp.semver, rangeTmp, options) - } - - var sameDirectionIncreasing = - (this.operator === '>=' || this.operator === '>') && - (comp.operator === '>=' || comp.operator === '>'); - var sameDirectionDecreasing = - (this.operator === '<=' || this.operator === '<') && - (comp.operator === '<=' || comp.operator === '<'); - var sameSemVer = this.semver.version === comp.semver.version; - var differentDirectionsInclusive = - (this.operator === '>=' || this.operator === '<=') && - (comp.operator === '>=' || comp.operator === '<='); - var oppositeDirectionsLessThan = - cmp(this.semver, '<', comp.semver, options) && - ((this.operator === '>=' || this.operator === '>') && - (comp.operator === '<=' || comp.operator === '<')); - var oppositeDirectionsGreaterThan = - cmp(this.semver, '>', comp.semver, options) && - ((this.operator === '<=' || this.operator === '<') && - (comp.operator === '>=' || comp.operator === '>')); - - return sameDirectionIncreasing || sameDirectionDecreasing || - (sameSemVer && differentDirectionsInclusive) || - oppositeDirectionsLessThan || oppositeDirectionsGreaterThan -}; - -exports.Range = Range; -function Range (range, options) { - if (!options || typeof options !== 'object') { - options = { - loose: !!options, - includePrerelease: false - }; - } - - if (range instanceof Range) { - if (range.loose === !!options.loose && - range.includePrerelease === !!options.includePrerelease) { - return range - } else { - return new Range(range.raw, options) - } - } - - if (range instanceof Comparator) { - return new Range(range.value, options) - } - - if (!(this instanceof Range)) { - return new Range(range, options) - } - - this.options = options; - this.loose = !!options.loose; - this.includePrerelease = !!options.includePrerelease; - - // First, split based on boolean or || - this.raw = range; - this.set = range.split(/\s*\|\|\s*/).map(function (range) { - return this.parseRange(range.trim()) - }, this).filter(function (c) { - // throw out any that are not relevant for whatever reason - return c.length - }); - - if (!this.set.length) { - throw new TypeError('Invalid SemVer Range: ' + range) - } - - this.format(); -} - -Range.prototype.format = function () { - this.range = this.set.map(function (comps) { - return comps.join(' ').trim() - }).join('||').trim(); - return this.range -}; - -Range.prototype.toString = function () { - return this.range -}; - -Range.prototype.parseRange = function (range) { - var loose = this.options.loose; - range = range.trim(); - // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4` - var hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]; - range = range.replace(hr, hyphenReplace); - debug('hyphen replace', range); - // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5` - range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace); - debug('comparator trim', range, re[t.COMPARATORTRIM]); - - // `~ 1.2.3` => `~1.2.3` - range = range.replace(re[t.TILDETRIM], tildeTrimReplace); - - // `^ 1.2.3` => `^1.2.3` - range = range.replace(re[t.CARETTRIM], caretTrimReplace); - - // normalize spaces - range = range.split(/\s+/).join(' '); - - // At this point, the range is completely trimmed and - // ready to be split into comparators. - - var compRe = loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]; - var set = range.split(' ').map(function (comp) { - return parseComparator(comp, this.options) - }, this).join(' ').split(/\s+/); - if (this.options.loose) { - // in loose mode, throw out any that are not valid comparators - set = set.filter(function (comp) { - return !!comp.match(compRe) - }); - } - set = set.map(function (comp) { - return new Comparator(comp, this.options) - }, this); - - return set -}; - -Range.prototype.intersects = function (range, options) { - if (!(range instanceof Range)) { - throw new TypeError('a Range is required') - } - - return this.set.some(function (thisComparators) { - return ( - isSatisfiable(thisComparators, options) && - range.set.some(function (rangeComparators) { - return ( - isSatisfiable(rangeComparators, options) && - thisComparators.every(function (thisComparator) { - return rangeComparators.every(function (rangeComparator) { - return thisComparator.intersects(rangeComparator, options) - }) - }) - ) - }) - ) - }) -}; - -// take a set of comparators and determine whether there -// exists a version which can satisfy it -function isSatisfiable (comparators, options) { - var result = true; - var remainingComparators = comparators.slice(); - var testComparator = remainingComparators.pop(); - - while (result && remainingComparators.length) { - result = remainingComparators.every(function (otherComparator) { - return testComparator.intersects(otherComparator, options) - }); - - testComparator = remainingComparators.pop(); - } - - return result -} - -// Mostly just for testing and legacy API reasons -exports.toComparators = toComparators; -function toComparators (range, options) { - return new Range(range, options).set.map(function (comp) { - return comp.map(function (c) { - return c.value - }).join(' ').trim().split(' ') - }) -} - -// comprised of xranges, tildes, stars, and gtlt's at this point. -// already replaced the hyphen ranges -// turn into a set of JUST comparators. -function parseComparator (comp, options) { - debug('comp', comp, options); - comp = replaceCarets(comp, options); - debug('caret', comp); - comp = replaceTildes(comp, options); - debug('tildes', comp); - comp = replaceXRanges(comp, options); - debug('xrange', comp); - comp = replaceStars(comp, options); - debug('stars', comp); - return comp -} - -function isX (id) { - return !id || id.toLowerCase() === 'x' || id === '*' -} - -// ~, ~> --> * (any, kinda silly) -// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0 -// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0 -// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0 -// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0 -// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0 -function replaceTildes (comp, options) { - return comp.trim().split(/\s+/).map(function (comp) { - return replaceTilde(comp, options) - }).join(' ') -} - -function replaceTilde (comp, options) { - var r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]; - return comp.replace(r, function (_, M, m, p, pr) { - debug('tilde', comp, _, M, m, p, pr); - var ret; - - if (isX(M)) { - ret = ''; - } else if (isX(m)) { - ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'; - } else if (isX(p)) { - // ~1.2 == >=1.2.0 <1.3.0 - ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'; - } else if (pr) { - debug('replaceTilde pr', pr); - ret = '>=' + M + '.' + m + '.' + p + '-' + pr + - ' <' + M + '.' + (+m + 1) + '.0'; - } else { - // ~1.2.3 == >=1.2.3 <1.3.0 - ret = '>=' + M + '.' + m + '.' + p + - ' <' + M + '.' + (+m + 1) + '.0'; - } - - debug('tilde return', ret); - return ret - }) -} - -// ^ --> * (any, kinda silly) -// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0 -// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0 -// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0 -// ^1.2.3 --> >=1.2.3 <2.0.0 -// ^1.2.0 --> >=1.2.0 <2.0.0 -function replaceCarets (comp, options) { - return comp.trim().split(/\s+/).map(function (comp) { - return replaceCaret(comp, options) - }).join(' ') -} - -function replaceCaret (comp, options) { - debug('caret', comp, options); - var r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]; - return comp.replace(r, function (_, M, m, p, pr) { - debug('caret', comp, _, M, m, p, pr); - var ret; - - if (isX(M)) { - ret = ''; - } else if (isX(m)) { - ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'; - } else if (isX(p)) { - if (M === '0') { - ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'; - } else { - ret = '>=' + M + '.' + m + '.0 <' + (+M + 1) + '.0.0'; - } - } else if (pr) { - debug('replaceCaret pr', pr); - if (M === '0') { - if (m === '0') { - ret = '>=' + M + '.' + m + '.' + p + '-' + pr + - ' <' + M + '.' + m + '.' + (+p + 1); - } else { - ret = '>=' + M + '.' + m + '.' + p + '-' + pr + - ' <' + M + '.' + (+m + 1) + '.0'; - } - } else { - ret = '>=' + M + '.' + m + '.' + p + '-' + pr + - ' <' + (+M + 1) + '.0.0'; - } - } else { - debug('no pr'); - if (M === '0') { - if (m === '0') { - ret = '>=' + M + '.' + m + '.' + p + - ' <' + M + '.' + m + '.' + (+p + 1); - } else { - ret = '>=' + M + '.' + m + '.' + p + - ' <' + M + '.' + (+m + 1) + '.0'; - } - } else { - ret = '>=' + M + '.' + m + '.' + p + - ' <' + (+M + 1) + '.0.0'; - } - } - - debug('caret return', ret); - return ret - }) -} - -function replaceXRanges (comp, options) { - debug('replaceXRanges', comp, options); - return comp.split(/\s+/).map(function (comp) { - return replaceXRange(comp, options) - }).join(' ') -} - -function replaceXRange (comp, options) { - comp = comp.trim(); - var r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]; - return comp.replace(r, function (ret, gtlt, M, m, p, pr) { - debug('xRange', comp, ret, gtlt, M, m, p, pr); - var xM = isX(M); - var xm = xM || isX(m); - var xp = xm || isX(p); - var anyX = xp; - - if (gtlt === '=' && anyX) { - gtlt = ''; - } - - // if we're including prereleases in the match, then we need - // to fix this to -0, the lowest possible prerelease value - pr = options.includePrerelease ? '-0' : ''; - - if (xM) { - if (gtlt === '>' || gtlt === '<') { - // nothing is allowed - ret = '<0.0.0-0'; - } else { - // nothing is forbidden - ret = '*'; - } - } else if (gtlt && anyX) { - // we know patch is an x, because we have any x at all. - // replace X with 0 - if (xm) { - m = 0; - } - p = 0; - - if (gtlt === '>') { - // >1 => >=2.0.0 - // >1.2 => >=1.3.0 - // >1.2.3 => >= 1.2.4 - gtlt = '>='; - if (xm) { - M = +M + 1; - m = 0; - p = 0; - } else { - m = +m + 1; - p = 0; - } - } else if (gtlt === '<=') { - // <=0.7.x is actually <0.8.0, since any 0.7.x should - // pass. Similarly, <=7.x is actually <8.0.0, etc. - gtlt = '<'; - if (xm) { - M = +M + 1; - } else { - m = +m + 1; - } - } - - ret = gtlt + M + '.' + m + '.' + p + pr; - } else if (xm) { - ret = '>=' + M + '.0.0' + pr + ' <' + (+M + 1) + '.0.0' + pr; - } else if (xp) { - ret = '>=' + M + '.' + m + '.0' + pr + - ' <' + M + '.' + (+m + 1) + '.0' + pr; - } - - debug('xRange return', ret); - - return ret - }) -} - -// Because * is AND-ed with everything else in the comparator, -// and '' means "any version", just remove the *s entirely. -function replaceStars (comp, options) { - debug('replaceStars', comp, options); - // Looseness is ignored here. star is always as loose as it gets! - return comp.trim().replace(re[t.STAR], '') -} - -// This function is passed to string.replace(re[t.HYPHENRANGE]) -// M, m, patch, prerelease, build -// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5 -// 1.2.3 - 3.4 => >=1.2.0 <3.5.0 Any 3.4.x will do -// 1.2 - 3.4 => >=1.2.0 <3.5.0 -function hyphenReplace ($0, - from, fM, fm, fp, fpr, fb, - to, tM, tm, tp, tpr, tb) { - if (isX(fM)) { - from = ''; - } else if (isX(fm)) { - from = '>=' + fM + '.0.0'; - } else if (isX(fp)) { - from = '>=' + fM + '.' + fm + '.0'; - } else { - from = '>=' + from; - } - - if (isX(tM)) { - to = ''; - } else if (isX(tm)) { - to = '<' + (+tM + 1) + '.0.0'; - } else if (isX(tp)) { - to = '<' + tM + '.' + (+tm + 1) + '.0'; - } else if (tpr) { - to = '<=' + tM + '.' + tm + '.' + tp + '-' + tpr; - } else { - to = '<=' + to; - } - - return (from + ' ' + to).trim() -} - -// if ANY of the sets match ALL of its comparators, then pass -Range.prototype.test = function (version) { - if (!version) { - return false - } - - if (typeof version === 'string') { - try { - version = new SemVer(version, this.options); - } catch (er) { - return false - } - } - - for (var i = 0; i < this.set.length; i++) { - if (testSet(this.set[i], version, this.options)) { - return true - } - } - return false -}; - -function testSet (set, version, options) { - for (var i = 0; i < set.length; i++) { - if (!set[i].test(version)) { - return false - } - } - - if (version.prerelease.length && !options.includePrerelease) { - // Find the set of versions that are allowed to have prereleases - // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0 - // That should allow `1.2.3-pr.2` to pass. - // However, `1.2.4-alpha.notready` should NOT be allowed, - // even though it's within the range set by the comparators. - for (i = 0; i < set.length; i++) { - debug(set[i].semver); - if (set[i].semver === ANY) { - continue - } - - if (set[i].semver.prerelease.length > 0) { - var allowed = set[i].semver; - if (allowed.major === version.major && - allowed.minor === version.minor && - allowed.patch === version.patch) { - return true - } - } - } - - // Version has a -pre, but it's not one of the ones we like. - return false - } - - return true -} - -exports.satisfies = satisfies; -function satisfies (version, range, options) { - try { - range = new Range(range, options); - } catch (er) { - return false - } - return range.test(version) -} - -exports.maxSatisfying = maxSatisfying; -function maxSatisfying (versions, range, options) { - var max = null; - var maxSV = null; - try { - var rangeObj = new Range(range, options); - } catch (er) { - return null - } - versions.forEach(function (v) { - if (rangeObj.test(v)) { - // satisfies(v, range, options) - if (!max || maxSV.compare(v) === -1) { - // compare(max, v, true) - max = v; - maxSV = new SemVer(max, options); - } - } - }); - return max -} - -exports.minSatisfying = minSatisfying; -function minSatisfying (versions, range, options) { - var min = null; - var minSV = null; - try { - var rangeObj = new Range(range, options); - } catch (er) { - return null - } - versions.forEach(function (v) { - if (rangeObj.test(v)) { - // satisfies(v, range, options) - if (!min || minSV.compare(v) === 1) { - // compare(min, v, true) - min = v; - minSV = new SemVer(min, options); - } - } - }); - return min -} - -exports.minVersion = minVersion; -function minVersion (range, loose) { - range = new Range(range, loose); - - var minver = new SemVer('0.0.0'); - if (range.test(minver)) { - return minver - } - - minver = new SemVer('0.0.0-0'); - if (range.test(minver)) { - return minver - } - - minver = null; - for (var i = 0; i < range.set.length; ++i) { - var comparators = range.set[i]; - - comparators.forEach(function (comparator) { - // Clone to avoid manipulating the comparator's semver object. - var compver = new SemVer(comparator.semver.version); - switch (comparator.operator) { - case '>': - if (compver.prerelease.length === 0) { - compver.patch++; - } else { - compver.prerelease.push(0); - } - compver.raw = compver.format(); - /* fallthrough */ - case '': - case '>=': - if (!minver || gt(minver, compver)) { - minver = compver; - } - break - case '<': - case '<=': - /* Ignore maximum versions */ - break - /* istanbul ignore next */ - default: - throw new Error('Unexpected operation: ' + comparator.operator) - } - }); - } - - if (minver && range.test(minver)) { - return minver - } + const runMatcher = async locateOptions => { + if (typeof name !== 'function') { + return locatePath(paths, locateOptions); + } - return null -} + const foundPath = await name(locateOptions.cwd); + if (typeof foundPath === 'string') { + return locatePath([foundPath], locateOptions); + } -exports.validRange = validRange; -function validRange (range, options) { - try { - // Return '*' instead of '' so that truthiness works. - // This will throw if it's invalid anyway - return new Range(range, options).range || '*' - } catch (er) { - return null - } -} + return foundPath; + }; -// Determine if version is less than all the versions possible in the range -exports.ltr = ltr; -function ltr (version, range, options) { - return outside(version, range, '<', options) -} + // eslint-disable-next-line no-constant-condition + while (true) { + // eslint-disable-next-line no-await-in-loop + const foundPath = await runMatcher({...options, cwd: directory}); -// Determine if version is greater than all the versions possible in the range. -exports.gtr = gtr; -function gtr (version, range, options) { - return outside(version, range, '>', options) -} + if (foundPath === stop) { + return; + } -exports.outside = outside; -function outside (version, range, hilo, options) { - version = new SemVer(version, options); - range = new Range(range, options); + if (foundPath) { + return path__default.resolve(directory, foundPath); + } - var gtfn, ltefn, ltfn, comp, ecomp; - switch (hilo) { - case '>': - gtfn = gt; - ltefn = lte; - ltfn = lt; - comp = '>'; - ecomp = '>='; - break - case '<': - gtfn = lt; - ltefn = gte; - ltfn = gt; - comp = '<'; - ecomp = '<='; - break - default: - throw new TypeError('Must provide a hilo val of "<" or ">"') - } + if (directory === root) { + return; + } - // If it satisifes the range it is not outside - if (satisfies(version, range, options)) { - return false - } + directory = path__default.dirname(directory); + } +}; - // From now on, variable terms are as if we're in "gtr" mode. - // but note that everything is flipped for the "ltr" function. +module.exports.sync = (name, options = {}) => { + let directory = path__default.resolve(options.cwd || ''); + const {root} = path__default.parse(directory); + const paths = [].concat(name); - for (var i = 0; i < range.set.length; ++i) { - var comparators = range.set[i]; + const runMatcher = locateOptions => { + if (typeof name !== 'function') { + return locatePath.sync(paths, locateOptions); + } - var high = null; - var low = null; + const foundPath = name(locateOptions.cwd); + if (typeof foundPath === 'string') { + return locatePath.sync([foundPath], locateOptions); + } - comparators.forEach(function (comparator) { - if (comparator.semver === ANY) { - comparator = new Comparator('>=0.0.0'); - } - high = high || comparator; - low = low || comparator; - if (gtfn(comparator.semver, high.semver, options)) { - high = comparator; - } else if (ltfn(comparator.semver, low.semver, options)) { - low = comparator; - } - }); + return foundPath; + }; - // If the edge version comparator has a operator then our version - // isn't outside it - if (high.operator === comp || high.operator === ecomp) { - return false - } + // eslint-disable-next-line no-constant-condition + while (true) { + const foundPath = runMatcher({...options, cwd: directory}); - // If the lowest version comparator has an operator and our version - // is less than it then it isn't higher than the range - if ((!low.operator || low.operator === comp) && - ltefn(version, low.semver)) { - return false - } else if (low.operator === ecomp && ltfn(version, low.semver)) { - return false - } - } - return true -} + if (foundPath === stop) { + return; + } -exports.prerelease = prerelease; -function prerelease (version, options) { - var parsed = parse(version, options); - return (parsed && parsed.prerelease.length) ? parsed.prerelease : null -} + if (foundPath) { + return path__default.resolve(directory, foundPath); + } -exports.intersects = intersects; -function intersects (r1, r2, options) { - r1 = new Range(r1, options); - r2 = new Range(r2, options); - return r1.intersects(r2) -} + if (directory === root) { + return; + } -exports.coerce = coerce; -function coerce (version, options) { - if (version instanceof SemVer) { - return version - } + directory = path__default.dirname(directory); + } +}; - if (typeof version === 'number') { - version = String(version); - } +module.exports.exists = pathExists; - if (typeof version !== 'string') { - return null - } +module.exports.sync.exists = pathExists.sync; - options = options || {}; +module.exports.stop = stop; +}); +var findUp_1 = findUp.sync; +var findUp_2 = findUp.exists; +var findUp_3 = findUp.stop; - var match = null; - if (!options.rtl) { - match = version.match(re[t.COERCE]); - } else { - // Find the right-most coercible string that does not share - // a terminus with a more left-ward coercible string. - // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4' - // - // Walk through the string checking with a /g regexp - // Manually set the index so as to pick up overlapping matches. - // Stop when we get a match that ends at the string end, since no - // coercible string can be more right-ward without the same terminus. - var next; - while ((next = re[t.COERCERTL].exec(version)) && - (!match || match.index + match[0].length !== version.length) - ) { - if (!match || - next.index + next[0].length !== match.index + match[0].length) { - match = next; - } - re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length; - } - // leave it in a clean state - re[t.COERCERTL].lastIndex = -1; - } +const pkgDir = async cwd => { + const filePath = await findUp('package.json', {cwd}); + return filePath && path__default.dirname(filePath); +}; - if (match === null) { - return null - } +var pkgDir_1 = pkgDir; +// TODO: Remove this for the next major release +var default_1$3 = pkgDir; - return parse(match[2] + - '.' + (match[3] || '0') + - '.' + (match[4] || '0'), options) -} -}); +var sync$2 = cwd => { + const filePath = findUp.sync('package.json', {cwd}); + return filePath && path__default.dirname(filePath); +}; +pkgDir_1.default = default_1$3; +pkgDir_1.sync = sync$2; -const {promisify: promisify$2} = require$$0__default['default']; +const {promisify: promisify$2} = util; -const useNativeRecursiveOption = semver$2.satisfies(process.version, '>=10.12.0'); +const defaults = { + mode: 0o777 & (~process.umask()), + fs: fs__default +}; + +const useNativeRecursiveOption = semver.satisfies(process.version, '>=10.12.0'); // https://github.com/nodejs/node/issues/8987 // https://github.com/libuv/libuv/pull/1088 const checkPath = pth => { if (process.platform === 'win32') { - const pathHasInvalidWinCharacters = /[<>:"|?*]/.test(pth.replace(path__default['default'].parse(pth).root, '')); + const pathHasInvalidWinCharacters = /[<>:"|?*]/.test(pth.replace(path__default.parse(pth).root, '')); if (pathHasInvalidWinCharacters) { const error = new Error(`Path contains invalid characters: ${pth}`); @@ -29786,19 +27076,6 @@ const checkPath = pth => { } }; -const processOptions = options => { - // https://github.com/sindresorhus/make-dir/issues/18 - const defaults = { - mode: 0o777 & (~process.umask()), - fs: fs__default['default'] - }; - - return { - ...defaults, - ...options - }; -}; - const permissionError = pth => { // This replicates the exception of `fs.mkdir` with native the // `recusive` option when run on an invalid drive under Windows. @@ -29812,13 +27089,16 @@ const permissionError = pth => { const makeDir = async (input, options) => { checkPath(input); - options = processOptions(options); + options = { + ...defaults, + ...options + }; const mkdir = promisify$2(options.fs.mkdir); const stat = promisify$2(options.fs.stat); - if (useNativeRecursiveOption && options.fs.mkdir === fs__default['default'].mkdir) { - const pth = path__default['default'].resolve(input); + if (useNativeRecursiveOption && options.fs.mkdir === fs__default.mkdir) { + const pth = path__default.resolve(input); await mkdir(pth, { mode: options.mode, @@ -29839,7 +27119,7 @@ const makeDir = async (input, options) => { } if (error.code === 'ENOENT') { - if (path__default['default'].dirname(pth) === pth) { + if (path__default.dirname(pth) === pth) { throw permissionError(pth); } @@ -29847,17 +27127,13 @@ const makeDir = async (input, options) => { throw error; } - await make(path__default['default'].dirname(pth)); + await make(path__default.dirname(pth)); return make(pth); } - try { - const stats = await stat(pth); - if (!stats.isDirectory()) { - throw new Error('The path is not a directory'); - } - } catch (_) { + const stats = await stat(pth); + if (!stats.isDirectory()) { throw error; } @@ -29865,19 +27141,22 @@ const makeDir = async (input, options) => { } }; - return make(path__default['default'].resolve(input)); + return make(path__default.resolve(input)); }; var makeDir_1 = makeDir; var sync$3 = (input, options) => { checkPath(input); - options = processOptions(options); + options = { + ...defaults, + ...options + }; - if (useNativeRecursiveOption && options.fs.mkdirSync === fs__default['default'].mkdirSync) { - const pth = path__default['default'].resolve(input); + if (useNativeRecursiveOption && options.fs.mkdirSync === fs__default.mkdirSync) { + const pth = path__default.resolve(input); - fs__default['default'].mkdirSync(pth, { + fs__default.mkdirSync(pth, { mode: options.mode, recursive: true }); @@ -29894,7 +27173,7 @@ var sync$3 = (input, options) => { } if (error.code === 'ENOENT') { - if (path__default['default'].dirname(pth) === pth) { + if (path__default.dirname(pth) === pth) { throw permissionError(pth); } @@ -29902,7 +27181,7 @@ var sync$3 = (input, options) => { throw error; } - make(path__default['default'].dirname(pth)); + make(path__default.dirname(pth)); return make(pth); } @@ -29918,69 +27197,35 @@ var sync$3 = (input, options) => { return pth; }; - return make(path__default['default'].resolve(input)); + return make(path__default.resolve(input)); }; makeDir_1.sync = sync$3; -const {env: env$1, cwd} = process; - -const isWritable = path => { - try { - fs__default['default'].accessSync(path, fs__default['default'].constants.W_OK); - return true; - } catch (_) { - return false; - } -}; - -function useDirectory(directory, options) { - if (options.create) { - makeDir_1.sync(directory); - } - - if (options.thunk) { - return (...arguments_) => path__default['default'].join(directory, ...arguments_); - } - - return directory; -} - -function getNodeModuleDirectory(directory) { - const nodeModules = path__default['default'].join(directory, 'node_modules'); - - if ( - !isWritable(nodeModules) && - (fs__default['default'].existsSync(nodeModules) || !isWritable(path__default['default'].join(directory))) - ) { - return; - } - - return nodeModules; -} - var findCacheDir = (options = {}) => { - if (env$1.CACHE_DIR && !['true', 'false', '1', '0'].includes(env$1.CACHE_DIR)) { - return useDirectory(path__default['default'].join(env$1.CACHE_DIR, 'find-cache-dir'), options); - } - - let {cwd: directory = cwd()} = options; + const {name} = options; + let directory = options.cwd; if (options.files) { directory = commondir(directory, options.files); + } else { + directory = directory || process.cwd(); } directory = pkgDir_1.sync(directory); - if (!directory) { - return; - } + if (directory) { + directory = path__default.join(directory, 'node_modules', '.cache', name); + + if (directory && options.create) { + makeDir_1.sync(directory); + } - const nodeModules = getNodeModuleDirectory(directory); - if (!nodeModules) { - return undefined; + if (options.thunk) { + return (...arguments_) => path__default.join(directory, ...arguments_); + } } - return useDirectory(path__default['default'].join(directory, 'node_modules', '.cache', options.name), options); + return directory; }; const typescript = (options) => { @@ -30003,7 +27248,7 @@ const typescript = (options) => { return _cache; }; const pluginOptions = Object.assign({}, options); - lodash.defaults(pluginOptions, { + lodash_13(pluginOptions, { check: true, verbosity: VerbosityLevel.Warning, clean: false, @@ -30018,7 +27263,6 @@ const typescript = (options) => { transformers: [], tsconfigDefaults: {}, objectHashIgnoreUnknownHack: false, - cwd: process.cwd(), }); if (!pluginOptions.typescript) { pluginOptions.typescript = require("typescript"); @@ -30037,19 +27281,17 @@ const typescript = (options) => { context.info(`tslib version: ${tslibVersion}`); if (this.meta) context.info(`rollup version: ${this.meta.rollupVersion}`); - if (!semver$1.satisfies(tsModule.version, ">=2.4.0", { includePrerelease: true })) + if (!semver_32(tsModule.version, ">=2.4.0", { includePrerelease: true })) throw new Error(`Installed typescript version '${tsModule.version}' is outside of supported range '>=2.4.0'`); - context.info(`rollup-plugin-typescript2 version: 0.30.0`); + context.info(`rollup-plugin-typescript2 version: 0.24.3`); context.debug(() => `plugin options:\n${JSON.stringify(pluginOptions, (key, value) => key === "typescript" ? `version ${value.version}` : value, 4)}`); context.debug(() => `rollup config:\n${JSON.stringify(rollupOptions, undefined, 4)}`); context.debug(() => `tsconfig path: ${tsConfigPath}`); - if (pluginOptions.objectHashIgnoreUnknownHack) - context.warn(() => `${safe.yellow("You are using 'objectHashIgnoreUnknownHack' option")}. If you enabled it because of async functions, try disabling it now.`); if (watchMode) context.info(`running in watch mode`); } filter = createFilter(context, pluginOptions, parsedConfig); - servicesHost = new LanguageServiceHost(parsedConfig, pluginOptions.transformers, pluginOptions.cwd); + servicesHost = new LanguageServiceHost(parsedConfig, pluginOptions.transformers); service = tsModule.createLanguageService(servicesHost, tsModule.createDocumentRegistry()); servicesHost.setLanguageService(service); // printing compiler option errors @@ -30077,14 +27319,14 @@ const typescript = (options) => { if (result.resolvedModule && result.resolvedModule.resolvedFileName) { if (filter(result.resolvedModule.resolvedFileName)) cache().setDependency(result.resolvedModule.resolvedFileName, importer); - if (lodash.endsWith(result.resolvedModule.resolvedFileName, ".d.ts")) + if (lodash_7(result.resolvedModule.resolvedFileName, ".d.ts")) return; const resolved = pluginOptions.rollupCommonJSResolveHack ? resolve.sync(result.resolvedModule.resolvedFileName) : result.resolvedModule.resolvedFileName; - context.debug(() => `${safe.blue("resolving")} '${importee}' imported by '${importer}'`); + context.debug(() => `${safe_5("resolving")} '${importee}' imported by '${importer}'`); context.debug(() => ` to '${resolved}'`); - return path.normalize(resolved); + return resolved; } return; }, @@ -30106,7 +27348,7 @@ const typescript = (options) => { if (output.emitSkipped) { noErrors = false; // always checking on fatal errors, even if options.check is set to false - const diagnostics = lodash.concat(cache().getSyntacticDiagnostics(id, snapshot, () => { + const diagnostics = lodash_11(cache().getSyntacticDiagnostics(id, snapshot, () => { return service.getSyntacticDiagnostics(id); }), cache().getSemanticDiagnostics(id, snapshot, () => { return service.getSemanticDiagnostics(id); @@ -30114,14 +27356,14 @@ const typescript = (options) => { printDiagnostics(contextWrapper, diagnostics, parsedConfig.options.pretty === true); // since no output was generated, aborting compilation cache().done(); - if (lodash.isFunction(this.error)) - this.error(safe.red(`failed to transpile '${id}'`)); + if (lodash_10(this.error)) + this.error(safe_3(`failed to transpile '${id}'`)); } const references = getAllReferences(id, servicesHost.getScriptSnapshot(id), parsedConfig.options); return convertEmitOutput(output, references); }); if (pluginOptions.check) { - const diagnostics = lodash.concat(cache().getSyntacticDiagnostics(id, snapshot, () => { + const diagnostics = lodash_11(cache().getSyntacticDiagnostics(id, snapshot, () => { return service.getSyntacticDiagnostics(id); }), cache().getSemanticDiagnostics(id, snapshot, () => { return service.getSemanticDiagnostics(id); @@ -30137,12 +27379,12 @@ const typescript = (options) => { if (tsConfigPath) this.addWatchFile(tsConfigPath); result.references.map(this.addWatchFile, this); - context.debug(() => `${safe.green(" watching")}: ${result.references.join("\nrpt2: ")}`); + context.debug(() => `${safe_1(" watching")}: ${result.references.join("\nrpt2: ")}`); } if (result.dts) { const key = normalize(id); declarations[key] = { type: result.dts, map: result.dtsmap }; - context.debug(() => `${safe.blue("generated declarations")} for '${key}'`); + context.debug(() => `${safe_5("generated declarations")} for '${key}'`); } const transformResult = { code: result.code, map: { mappings: "" } }; if (result.map) { @@ -30154,9 +27396,11 @@ const typescript = (options) => { } return undefined; }, - generateBundle(bundleOptions) { + generateBundle(bundleOptions, _bundle, isWrite) { self._ongenerate(); - self._onwrite.call(this, bundleOptions); + if (isWrite) { + self._onwrite(bundleOptions); + } }, _ongenerate() { context.debug(() => `generating target ${generateRound + 1}`); @@ -30167,7 +27411,7 @@ const typescript = (options) => { const snapshot = servicesHost.getScriptSnapshot(id); if (!snapshot) return; - const diagnostics = lodash.concat(cache().getSyntacticDiagnostics(id, snapshot, () => { + const diagnostics = lodash_11(cache().getSyntacticDiagnostics(id, snapshot, () => { return service.getSyntacticDiagnostics(id); }), cache().getSemanticDiagnostics(id, snapshot, () => { return service.getSemanticDiagnostics(id); @@ -30176,16 +27420,16 @@ const typescript = (options) => { }); } if (!watchMode && !noErrors) - context.info(safe.yellow("there were errors or warnings.")); + context.info(safe_4("there were errors or warnings.")); cache().done(); generateRound++; }, - _onwrite(_output) { + _onwrite({ file, dir }) { if (!parsedConfig.options.declaration) return; - lodash.each(parsedConfig.fileNames, (name) => { + lodash_3(parsedConfig.fileNames, (name) => { const key = normalize(name); - if (lodash.has(declarations, key)) + if (lodash_9(declarations, key)) return; if (!allImportedFiles.has(key)) { context.debug(() => `skipping declarations for unused '${key}'`); @@ -30197,48 +27441,32 @@ const typescript = (options) => { if (out.dts) declarations[key] = { type: out.dts, map: out.dtsmap }; }); - const emitDeclaration = (key, extension, entry) => { + const bundleFile = file; + const outputDir = dir; + const writeDeclaration = (key, extension, entry) => { if (!entry) return; let fileName = entry.name; if (fileName.includes("?")) // HACK for rollup-plugin-vue, it creates virtual modules in form 'file.vue?rollup-plugin-vue=script.ts' fileName = fileName.split("?", 1) + extension; - // If 'useTsconfigDeclarationDir' is given in the - // plugin options, directly write to the path provided - // by Typescript's LanguageService (which may not be - // under Rollup's output directory, and thus can't be - // emitted as an asset). - if (pluginOptions.useTsconfigDeclarationDir) { - context.debug(() => `${safe.blue("emitting declarations")} for '${key}' to '${fileName}'`); - tsModule.sys.writeFile(fileName, entry.text, entry.writeByteOrderMark); - } + let writeToPath; + // If for some reason no 'dest' property exists or if 'useTsconfigDeclarationDir' is given in the plugin options, + // use the path provided by Typescript's LanguageService. + if ((!bundleFile && !outputDir) || pluginOptions.useTsconfigDeclarationDir) + writeToPath = fileName; else { - // don't mutate the entry because generateBundle gets called multiple times - let entryText = entry.text; - const declarationDir = (_output.file ? path.dirname(_output.file) : _output.dir); - const cachePlaceholder = `${pluginOptions.cacheRoot}/placeholder`; - // modify declaration map sources to correct relative path - if (extension === ".d.ts.map") { - const parsedText = JSON.parse(entryText); - // invert back to absolute, then make relative to declarationDir - parsedText.sources = parsedText.sources.map(source => { - const absolutePath = path.resolve(cachePlaceholder, source); - return normalize(path.relative(declarationDir, absolutePath)); - }); - entryText = JSON.stringify(parsedText); - } - const relativePath = normalize(path.relative(cachePlaceholder, fileName)); - context.debug(() => `${safe.blue("emitting declarations")} for '${key}' to '${relativePath}'`); - this.emitFile({ - type: "asset", - source: entryText, - fileName: relativePath, - }); + // Otherwise, take the directory name from the path and make sure it is absolute. + const destDirname = bundleFile ? path.dirname(bundleFile) : outputDir; + const destDirectory = path.isAbsolute(destDirname) ? destDirname : path.join(process.cwd(), destDirname); + writeToPath = path.join(destDirectory, path.relative(process.cwd(), fileName)); } + context.debug(() => `${safe_5("writing declarations")} for '${key}' to '${writeToPath}'`); + // Write the declaration file to disk. + tsModule.sys.writeFile(writeToPath, entry.text, entry.writeByteOrderMark); }; - lodash.each(declarations, ({ type, map }, key) => { - emitDeclaration(key, ".d.ts", type); - emitDeclaration(key, ".d.ts.map", map); + lodash_3(declarations, ({ type, map }, key) => { + writeDeclaration(key, ".d.ts", type); + writeDeclaration(key, ".d.ts.map", map); }); }, }; diff --git a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js.map b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js.map index acc3a3a93..e1aba0cf7 100644 --- a/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js.map +++ b/packages/taro-runtime/node_modules/rollup-plugin-typescript2/dist/rollup-plugin-typescript2.cjs.js.map @@ -1 +1 @@ -{"version":3,"file":"rollup-plugin-typescript2.cjs.js","sources":["../node_modules/lodash/lodash.js","../src/context.ts","../src/rollupcontext.ts","../src/tsproxy.ts","../src/normalize.ts","../src/host.ts","../node_modules/lodash/_listCacheClear.js","../node_modules/lodash/eq.js","../node_modules/lodash/_assocIndexOf.js","../node_modules/lodash/_listCacheDelete.js","../node_modules/lodash/_listCacheGet.js","../node_modules/lodash/_listCacheHas.js","../node_modules/lodash/_listCacheSet.js","../node_modules/lodash/_ListCache.js","../node_modules/lodash/_stackClear.js","../node_modules/lodash/_stackDelete.js","../node_modules/lodash/_stackGet.js","../node_modules/lodash/_stackHas.js","../node_modules/lodash/_freeGlobal.js","../node_modules/lodash/_root.js","../node_modules/lodash/_Symbol.js","../node_modules/lodash/_getRawTag.js","../node_modules/lodash/_objectToString.js","../node_modules/lodash/_baseGetTag.js","../node_modules/lodash/isObject.js","../node_modules/lodash/isFunction.js","../node_modules/lodash/_coreJsData.js","../node_modules/lodash/_isMasked.js","../node_modules/lodash/_toSource.js","../node_modules/lodash/_baseIsNative.js","../node_modules/lodash/_getValue.js","../node_modules/lodash/_getNative.js","../node_modules/lodash/_Map.js","../node_modules/lodash/_nativeCreate.js","../node_modules/lodash/_hashClear.js","../node_modules/lodash/_hashDelete.js","../node_modules/lodash/_hashGet.js","../node_modules/lodash/_hashHas.js","../node_modules/lodash/_hashSet.js","../node_modules/lodash/_Hash.js","../node_modules/lodash/_mapCacheClear.js","../node_modules/lodash/_isKeyable.js","../node_modules/lodash/_getMapData.js","../node_modules/lodash/_mapCacheDelete.js","../node_modules/lodash/_mapCacheGet.js","../node_modules/lodash/_mapCacheHas.js","../node_modules/lodash/_mapCacheSet.js","../node_modules/lodash/_MapCache.js","../node_modules/lodash/_stackSet.js","../node_modules/lodash/_Stack.js","../node_modules/lodash/_arrayEach.js","../node_modules/lodash/_defineProperty.js","../node_modules/lodash/_baseAssignValue.js","../node_modules/lodash/_assignValue.js","../node_modules/lodash/_copyObject.js","../node_modules/lodash/_baseTimes.js","../node_modules/lodash/isObjectLike.js","../node_modules/lodash/_baseIsArguments.js","../node_modules/lodash/isArguments.js","../node_modules/lodash/isArray.js","../node_modules/lodash/stubFalse.js","../node_modules/lodash/isBuffer.js","../node_modules/lodash/_isIndex.js","../node_modules/lodash/isLength.js","../node_modules/lodash/_baseIsTypedArray.js","../node_modules/lodash/_baseUnary.js","../node_modules/lodash/_nodeUtil.js","../node_modules/lodash/isTypedArray.js","../node_modules/lodash/_arrayLikeKeys.js","../node_modules/lodash/_isPrototype.js","../node_modules/lodash/_overArg.js","../node_modules/lodash/_nativeKeys.js","../node_modules/lodash/_baseKeys.js","../node_modules/lodash/isArrayLike.js","../node_modules/lodash/keys.js","../node_modules/lodash/_baseAssign.js","../node_modules/lodash/_nativeKeysIn.js","../node_modules/lodash/_baseKeysIn.js","../node_modules/lodash/keysIn.js","../node_modules/lodash/_baseAssignIn.js","../node_modules/lodash/_cloneBuffer.js","../node_modules/lodash/_copyArray.js","../node_modules/lodash/_arrayFilter.js","../node_modules/lodash/stubArray.js","../node_modules/lodash/_getSymbols.js","../node_modules/lodash/_copySymbols.js","../node_modules/lodash/_arrayPush.js","../node_modules/lodash/_getPrototype.js","../node_modules/lodash/_getSymbolsIn.js","../node_modules/lodash/_copySymbolsIn.js","../node_modules/lodash/_baseGetAllKeys.js","../node_modules/lodash/_getAllKeys.js","../node_modules/lodash/_getAllKeysIn.js","../node_modules/lodash/_DataView.js","../node_modules/lodash/_Promise.js","../node_modules/lodash/_Set.js","../node_modules/lodash/_WeakMap.js","../node_modules/lodash/_getTag.js","../node_modules/lodash/_initCloneArray.js","../node_modules/lodash/_Uint8Array.js","../node_modules/lodash/_cloneArrayBuffer.js","../node_modules/lodash/_cloneDataView.js","../node_modules/lodash/_cloneRegExp.js","../node_modules/lodash/_cloneSymbol.js","../node_modules/lodash/_cloneTypedArray.js","../node_modules/lodash/_initCloneByTag.js","../node_modules/lodash/_baseCreate.js","../node_modules/lodash/_initCloneObject.js","../node_modules/lodash/_baseIsMap.js","../node_modules/lodash/isMap.js","../node_modules/lodash/_baseIsSet.js","../node_modules/lodash/isSet.js","../node_modules/lodash/_baseClone.js","../node_modules/lodash/clone.js","../node_modules/lodash/constant.js","../node_modules/lodash/_createBaseFor.js","../node_modules/lodash/_baseFor.js","../node_modules/lodash/_baseForOwn.js","../node_modules/lodash/_createBaseEach.js","../node_modules/lodash/_baseEach.js","../node_modules/lodash/identity.js","../node_modules/lodash/_castFunction.js","../node_modules/lodash/forEach.js","../node_modules/lodash/each.js","../node_modules/lodash/_baseFilter.js","../node_modules/lodash/_setCacheAdd.js","../node_modules/lodash/_setCacheHas.js","../node_modules/lodash/_SetCache.js","../node_modules/lodash/_arraySome.js","../node_modules/lodash/_cacheHas.js","../node_modules/lodash/_equalArrays.js","../node_modules/lodash/_mapToArray.js","../node_modules/lodash/_setToArray.js","../node_modules/lodash/_equalByTag.js","../node_modules/lodash/_equalObjects.js","../node_modules/lodash/_baseIsEqualDeep.js","../node_modules/lodash/_baseIsEqual.js","../node_modules/lodash/_baseIsMatch.js","../node_modules/lodash/_isStrictComparable.js","../node_modules/lodash/_getMatchData.js","../node_modules/lodash/_matchesStrictComparable.js","../node_modules/lodash/_baseMatches.js","../node_modules/lodash/isSymbol.js","../node_modules/lodash/_isKey.js","../node_modules/lodash/memoize.js","../node_modules/lodash/_memoizeCapped.js","../node_modules/lodash/_stringToPath.js","../node_modules/lodash/_arrayMap.js","../node_modules/lodash/_baseToString.js","../node_modules/lodash/toString.js","../node_modules/lodash/_castPath.js","../node_modules/lodash/_toKey.js","../node_modules/lodash/_baseGet.js","../node_modules/lodash/get.js","../node_modules/lodash/_baseHasIn.js","../node_modules/lodash/_hasPath.js","../node_modules/lodash/hasIn.js","../node_modules/lodash/_baseMatchesProperty.js","../node_modules/lodash/_baseProperty.js","../node_modules/lodash/_basePropertyDeep.js","../node_modules/lodash/property.js","../node_modules/lodash/_baseIteratee.js","../node_modules/lodash/filter.js","../node_modules/lodash/_baseHas.js","../node_modules/lodash/has.js","../node_modules/lodash/isEmpty.js","../node_modules/lodash/isUndefined.js","../node_modules/lodash/_baseMap.js","../node_modules/lodash/map.js","../node_modules/lodash/_arrayReduce.js","../node_modules/lodash/_baseReduce.js","../node_modules/lodash/reduce.js","../node_modules/lodash/isString.js","../node_modules/lodash/_asciiSize.js","../node_modules/lodash/_hasUnicode.js","../node_modules/lodash/_unicodeSize.js","../node_modules/lodash/_stringSize.js","../node_modules/lodash/size.js","../node_modules/lodash/transform.js","../node_modules/lodash/_isFlattenable.js","../node_modules/lodash/_baseFlatten.js","../node_modules/lodash/_apply.js","../node_modules/lodash/_overRest.js","../node_modules/lodash/_baseSetToString.js","../node_modules/lodash/_shortOut.js","../node_modules/lodash/_setToString.js","../node_modules/lodash/_baseRest.js","../node_modules/lodash/_baseFindIndex.js","../node_modules/lodash/_baseIsNaN.js","../node_modules/lodash/_strictIndexOf.js","../node_modules/lodash/_baseIndexOf.js","../node_modules/lodash/_arrayIncludes.js","../node_modules/lodash/_arrayIncludesWith.js","../node_modules/lodash/noop.js","../node_modules/lodash/_createSet.js","../node_modules/lodash/_baseUniq.js","../node_modules/lodash/isArrayLikeObject.js","../node_modules/lodash/union.js","../node_modules/lodash/_baseValues.js","../node_modules/lodash/values.js","../node_modules/graphlib/lib/lodash.js","../node_modules/graphlib/lib/graph.js","../node_modules/graphlib/lib/version.js","../node_modules/graphlib/lib/index.js","../node_modules/graphlib/lib/json.js","../node_modules/graphlib/lib/alg/components.js","../node_modules/graphlib/lib/data/priority-queue.js","../node_modules/graphlib/lib/alg/dijkstra.js","../node_modules/graphlib/lib/alg/dijkstra-all.js","../node_modules/graphlib/lib/alg/tarjan.js","../node_modules/graphlib/lib/alg/find-cycles.js","../node_modules/graphlib/lib/alg/floyd-warshall.js","../node_modules/graphlib/lib/alg/topsort.js","../node_modules/graphlib/lib/alg/is-acyclic.js","../node_modules/graphlib/lib/alg/dfs.js","../node_modules/graphlib/lib/alg/postorder.js","../node_modules/graphlib/lib/alg/preorder.js","../node_modules/graphlib/lib/alg/prim.js","../node_modules/graphlib/lib/alg/index.js","../node_modules/graphlib/index.js","../node_modules/object-hash/index.js","../src/rollingcache.ts","../node_modules/colors/lib/styles.js","../node_modules/colors/lib/system/has-flag.js","../node_modules/colors/lib/system/supports-colors.js","../node_modules/colors/lib/custom/trap.js","../node_modules/colors/lib/custom/zalgo.js","../node_modules/colors/lib/maps/america.js","../node_modules/colors/lib/maps/zebra.js","../node_modules/colors/lib/maps/rainbow.js","../node_modules/colors/lib/maps/random.js","../node_modules/colors/lib/colors.js","../node_modules/colors/safe.js","../src/diagnostics-format-host.ts","../src/nocache.ts","../src/tscache.ts","../src/print-diagnostics.ts","../src/get-options-overrides.ts","../src/check-tsconfig.ts","../src/parse-tsconfig.ts","../src/tslib.ts","../node_modules/semver/internal/constants.js","../node_modules/semver/internal/debug.js","../node_modules/semver/internal/re.js","../node_modules/semver/internal/parse-options.js","../node_modules/semver/internal/identifiers.js","../node_modules/semver/classes/semver.js","../node_modules/semver/functions/parse.js","../node_modules/semver/functions/valid.js","../node_modules/semver/functions/clean.js","../node_modules/semver/functions/inc.js","../node_modules/semver/functions/compare.js","../node_modules/semver/functions/eq.js","../node_modules/semver/functions/diff.js","../node_modules/semver/functions/major.js","../node_modules/semver/functions/minor.js","../node_modules/semver/functions/patch.js","../node_modules/semver/functions/prerelease.js","../node_modules/semver/functions/rcompare.js","../node_modules/semver/functions/compare-loose.js","../node_modules/semver/functions/compare-build.js","../node_modules/semver/functions/sort.js","../node_modules/semver/functions/rsort.js","../node_modules/semver/functions/gt.js","../node_modules/semver/functions/lt.js","../node_modules/semver/functions/neq.js","../node_modules/semver/functions/gte.js","../node_modules/semver/functions/lte.js","../node_modules/semver/functions/cmp.js","../node_modules/semver/functions/coerce.js","../node_modules/yallist/iterator.js","../node_modules/yallist/yallist.js","../node_modules/lru-cache/index.js","../node_modules/semver/classes/range.js","../node_modules/semver/classes/comparator.js","../node_modules/semver/functions/satisfies.js","../node_modules/semver/ranges/to-comparators.js","../node_modules/semver/ranges/max-satisfying.js","../node_modules/semver/ranges/min-satisfying.js","../node_modules/semver/ranges/min-version.js","../node_modules/semver/ranges/valid.js","../node_modules/semver/ranges/outside.js","../node_modules/semver/ranges/gtr.js","../node_modules/semver/ranges/ltr.js","../node_modules/semver/ranges/intersects.js","../node_modules/semver/ranges/simplify.js","../node_modules/semver/ranges/subset.js","../node_modules/semver/index.js","../node_modules/commondir/index.js","../node_modules/p-try/index.js","../node_modules/p-limit/index.js","../node_modules/p-locate/index.js","../node_modules/locate-path/index.js","../node_modules/path-exists/index.js","../node_modules/find-up/index.js","../node_modules/pkg-dir/index.js","../node_modules/make-dir/node_modules/semver/semver.js","../node_modules/make-dir/index.js","../node_modules/find-cache-dir/index.js","../src/index.ts"],"sourcesContent":["/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \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.20';\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\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 and trailing whitespace. */\n var reTrim = /^\\s+|\\s+$/g,\n reTrimStart = /^\\s+/,\n reTrimEnd = /\\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 /** 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 '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\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 `_.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 `_.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 '

' + func(text) + '

';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '

fred, barney, & pebbles

'\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('');\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 = value.replace(reTrim, '');\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, & 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('<%- value %>');\n * compiled({ 'value': '