@openclaw/feishu 2026.7.1 → 2026.7.2-beta.1

package/node_modules/unist-util-visit/readme.md

@@ -0,0 +1,313 @@
+# unist-util-visit
+
+[![Build][badge-build-image]][badge-build-url]
+[![Coverage][badge-coverage-image]][badge-coverage-url]
+[![Downloads][badge-downloads-image]][badge-downloads-url]
+[![Size][badge-size-image]][badge-size-url]
+
+[unist][github-unist] utility to walk the tree.
+
+## Contents
+
+* [What is this?](#what-is-this)
+* [When should I use this?](#when-should-i-use-this)
+* [Install](#install)
+* [Use](#use)
+* [API](#api)
+  * [`visit(tree[, test], visitor[, reverse])`](#visittree-test-visitor-reverse)
+  * [`CONTINUE`](#continue)
+  * [`EXIT`](#exit)
+  * [`SKIP`](#skip)
+  * [`Action`](#action)
+  * [`ActionTuple`](#actiontuple)
+  * [`BuildVisitor`](#buildvisitor)
+  * [`Index`](#index)
+  * [`Test`](#test)
+  * [`Visitor`](#visitor)
+  * [`VisitorResult`](#visitorresult)
+* [Compatibility](#compatibility)
+* [Related](#related)
+* [Contribute](#contribute)
+* [License](#license)
+
+## What is this?
+
+This is a very important utility for working with unist as it lets you walk the
+tree.
+
+## When should I use this?
+
+You can use this utility when you want to walk the tree.
+You can use [`unist-util-visit-parents`][github-vp] if you care about the
+entire stack of parents.
+
+## Install
+
+This package is [ESM only][github-gist-esm].
+In Node.js (version 16+),
+install with [npm][npmjs-install]:
+
+```sh
+npm install unist-util-visit
+```
+
+In Deno with [`esm.sh`][esmsh]:
+
+```js
+import {CONTINUE, EXIT, SKIP, visit} from 'https://esm.sh/unist-util-visit@5'
+```
+
+In browsers with [`esm.sh`][esmsh]:
+
+```html
+<script type="module">
+  import {CONTINUE, EXIT, SKIP, visit} from 'https://esm.sh/unist-util-visit@5?bundle'
+</script>
+```
+
+## Use
+
+```js
+import {fromMarkdown} from 'mdast-util-from-markdown'
+import {visit} from 'unist-util-visit'
+
+const tree = fromMarkdown('Some *emphasis*, **strong**, and `code`.')
+
+visit(tree, 'text', function (node, index, parent) {
+  console.log([node.value, parent ? parent.type : index])
+})
+```
+
+Yields:
+
+```js
+[ 'Some ', 'paragraph' ]
+[ 'emphasis', 'emphasis' ]
+[ ', ', 'paragraph' ]
+[ 'strong', 'strong' ]
+[ ', and ', 'paragraph' ]
+[ '.', 'paragraph' ]
+```
+
+## API
+
+This package exports the identifiers
+[`CONTINUE`][api-continue],
+[`EXIT`][api-exit],
+[`SKIP`][api-skip], and
+[`visit`][api-visit].
+It exports the [TypeScript][] types
+[`ActionTuple`][api-action-tuple],
+[`Action`][api-action],
+[`BuildVisitor`][api-build-visitor],
+[`Index`][api-index],
+[`Test`][api-test],
+[`VisitorResult`][api-visitor-result], and
+[`Visitor`][api-visitor].
+There is no default export.
+
+### `visit(tree[, test], visitor[, reverse])`
+
+This function works exactly the same as
+[`unist-util-visit-parents`][github-vp],
+but [`Visitor`][api-visitor] has a different signature.
+
+### `CONTINUE`
+
+Continue traversing as normal (`true`).
+
+### `EXIT`
+
+Stop traversing immediately (`false`).
+
+### `SKIP`
+
+Do not traverse this node’s children (`'skip'`).
+
+### `Action`
+
+Union of the action types (TypeScript type).
+See [`Action` in `unist-util-visit-parents`][github-vp-action].
+
+### `ActionTuple`
+
+List with an action and an index (TypeScript type).
+See [`ActionTuple` in `unist-util-visit-parents`][github-vp-action-tuple].
+
+### `BuildVisitor`
+
+Build a typed `Visitor` function from a tree and a test (TypeScript type).
+See [`BuildVisitor` in `unist-util-visit-parents`][github-vp-build-visitor].
+
+### `Index`
+
+Move to the sibling at `index` next (TypeScript type).
+See [`Index` in `unist-util-visit-parents`][github-vp-index].
+
+### `Test`
+
+[`unist-util-is`][github-unist-util-is] compatible test
+(TypeScript type).
+
+### `Visitor`
+
+Handle a node (matching `test`, if given) (TypeScript type).
+
+Visitors are free to transform `node`.
+They can also transform `parent`.
+
+Replacing `node` itself, if `SKIP` is not returned, still causes its
+descendants to be walked (which is a bug).
+
+When adding or removing previous siblings of `node` (or next siblings, in
+case of reverse), the `Visitor` should return a new `Index` to specify the
+sibling to traverse after `node` is traversed.
+Adding or removing next siblings of `node` (or previous siblings, in case
+of reverse) is handled as expected without needing to return a new `Index`.
+
+Removing the children property of `parent` still results in them being
+traversed.
+
+###### Parameters
+
+* `node` ([`Node`][github-unist-node])
+  — found node
+* `index` (`number` or `undefined`)
+  — index of `node` in `parent`
+* `parent` ([`Node`][github-unist-node] or `undefined`)
+  — parent of `node`
+
+###### Returns
+
+What to do next.
+
+An `Index` is treated as a tuple of `[CONTINUE, Index]`.
+An `Action` is treated as a tuple of `[Action]`.
+
+Passing a tuple back only makes sense if the `Action` is `SKIP`.
+When the `Action` is `EXIT`, that action can be returned.
+When the `Action` is `CONTINUE`, `Index` can be returned.
+
+### `VisitorResult`
+
+Any value that can be returned from a visitor (TypeScript type).
+See [`VisitorResult` in
+`unist-util-visit-parents`][github-vp-visitor-result].
+
+## Compatibility
+
+Projects maintained by the unified collective are compatible with maintained
+versions of Node.js.
+
+When we cut a new major release, we drop support for unmaintained versions of
+Node.
+This means we try to keep the current release line, `unist-util-visit@^5`,
+compatible with Node.js 16.
+
+## Related
+
+* [`unist-util-visit-parents`][github-vp]
+  — walk the tree with a stack of parents
+* [`unist-util-filter`](https://github.com/syntax-tree/unist-util-filter)
+  — create a new tree with all nodes that pass a test
+* [`unist-util-map`](https://github.com/syntax-tree/unist-util-map)
+  — create a new tree with all nodes mapped by a given function
+* [`unist-util-flatmap`](https://gitlab.com/staltz/unist-util-flatmap)
+  — create a new tree by mapping (to an array) with the given function
+* [`unist-util-remove`](https://github.com/syntax-tree/unist-util-remove)
+  — remove nodes from a tree that pass a test
+* [`unist-util-select`](https://github.com/syntax-tree/unist-util-select)
+  — select nodes with CSS-like selectors
+
+## Contribute
+
+See [`contributing.md`][health-contributing] in [`syntax-tree/.github`][health]
+for ways to get started.
+See [`support.md`][health-support] for ways to get help.
+
+This project has a [code of conduct][health-coc].
+By interacting with this repository,
+organization,
+or community you agree to abide by its terms.
+
+## License
+
+[MIT][file-license] © [Titus Wormer][wooorm]
+
+<!-- Definition -->
+
+[api-action]: #action
+
+[api-action-tuple]: #actiontuple
+
+[api-build-visitor]: #buildvisitor
+
+[api-continue]: #continue
+
+[api-exit]: #exit
+
+[api-index]: #index
+
+[api-skip]: #skip
+
+[api-test]: #test
+
+[api-visit]: #visittree-test-visitor-reverse
+
+[api-visitor]: #visitor
+
+[api-visitor-result]: #visitorresult
+
+[badge-build-image]: https://github.com/syntax-tree/unist-util-visit/workflows/main/badge.svg
+
+[badge-build-url]: https://github.com/syntax-tree/unist-util-visit/actions
+
+[badge-coverage-image]: https://img.shields.io/codecov/c/github/syntax-tree/unist-util-visit.svg
+
+[badge-coverage-url]: https://codecov.io/github/syntax-tree/unist-util-visit
+
+[badge-downloads-image]: https://img.shields.io/npm/dm/unist-util-visit.svg
+
+[badge-downloads-url]: https://www.npmjs.com/package/unist-util-visit
+
+[badge-size-image]: https://img.shields.io/bundlejs/size/unist-util-visit
+
+[badge-size-url]: https://bundlejs.com/?q=unist-util-visit
+
+[esmsh]: https://esm.sh
+
+[file-license]: license
+
+[github-gist-esm]: https://gist.github.com/sindresorhus/a39789f98801d908bbc7ff3ecc99d99c
+
+[github-unist]: https://github.com/syntax-tree/unist
+
+[github-unist-node]: https://github.com/syntax-tree/unist#nodes
+
+[github-unist-util-is]: https://github.com/syntax-tree/unist-util-is
+
+[github-vp]: https://github.com/syntax-tree/unist-util-visit-parents
+
+[github-vp-action]: https://github.com/syntax-tree/unist-util-visit-parents#action
+
+[github-vp-action-tuple]: https://github.com/syntax-tree/unist-util-visit-parents#actiontuple
+
+[github-vp-build-visitor]: https://github.com/syntax-tree/unist-util-visit-parents#buildvisitor
+
+[github-vp-index]: https://github.com/syntax-tree/unist-util-visit-parents#index
+
+[github-vp-visitor-result]: https://github.com/syntax-tree/unist-util-visit-parents#visitorresult
+
+[health]: https://github.com/syntax-tree/.github
+
+[health-coc]: https://github.com/syntax-tree/.github/blob/main/code-of-conduct.md
+
+[health-contributing]: https://github.com/syntax-tree/.github/blob/main/contributing.md
+
+[health-support]: https://github.com/syntax-tree/.github/blob/main/support.md
+
+[npmjs-install]: https://docs.npmjs.com/cli/install
+
+[typescript]: https://www.typescriptlang.org
+
+[wooorm]: https://wooorm.com

package/node_modules/unist-util-visit-parents/index.d.ts

@@ -0,0 +1,14 @@
+export type {Test} from 'unist-util-is'
+export type {
+  Action,
+  ActionTuple,
+  BuildVisitor,
+  // Undocumented: used in `unist-util-visit`:
+  InclusiveDescendant,
+  Index,
+  // Undocumented: used in `unist-util-visit`:
+  Matches,
+  Visitor,
+  VisitorResult
+} from './lib/index.js'
+export {CONTINUE, EXIT, SKIP, visitParents} from './lib/index.js'

package/node_modules/unist-util-visit-parents/index.js

@@ -0,0 +1,2 @@
+// Note: types exported from `index.d.ts`
+export {CONTINUE, EXIT, SKIP, visitParents} from './lib/index.js'

package/node_modules/unist-util-visit-parents/lib/color.d.ts

@@ -0,0 +1,6 @@
+/**
+ * @param {string} d
+ * @returns {string}
+ */
+export function color(d: string): string;
+//# sourceMappingURL=color.d.ts.map

package/node_modules/unist-util-visit-parents/lib/color.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.d.ts","sourceRoot":"","sources":["color.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH,yBAHW,MAAM,GACJ,MAAM,CAIlB"}

package/node_modules/unist-util-visit-parents/lib/color.js

@@ -0,0 +1,7 @@
+/**
+ * @param {string} d
+ * @returns {string}
+ */
+export function color(d) {
+  return d
+}

package/node_modules/unist-util-visit-parents/lib/color.node.d.ts

@@ -0,0 +1,6 @@
+/**
+ * @param {string} d
+ * @returns {string}
+ */
+export function color(d: string): string;
+//# sourceMappingURL=color.node.d.ts.map

package/node_modules/unist-util-visit-parents/lib/color.node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.node.d.ts","sourceRoot":"","sources":["color.node.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH,yBAHW,MAAM,GACJ,MAAM,CAIlB"}

package/node_modules/unist-util-visit-parents/lib/color.node.js

@@ -0,0 +1,7 @@
+/**
+ * @param {string} d
+ * @returns {string}
+ */
+export function color(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}

package/node_modules/unist-util-visit-parents/lib/index.d.ts

@@ -0,0 +1,219 @@
+/**
+ * Visit nodes, with ancestral information.
+ *
+ * This algorithm performs *depth-first* *tree traversal* in *preorder*
+ * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
+ *
+ * You can choose for which nodes `visitor` is called by passing a `test`.
+ * For complex tests, you should test yourself in `visitor`, as it will be
+ * faster and will have improved type information.
+ *
+ * Walking the tree is an intensive task.
+ * Make use of the return values of the visitor when possible.
+ * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
+ * to check if a node matches, and then perform different operations.
+ *
+ * You can change the tree.
+ * See `Visitor` for more info.
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} check
+ * @param {BuildVisitor<Tree, Check>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {BuildVisitor<Tree>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @param {UnistNode} tree
+ *   Tree to traverse.
+ * @param {Visitor | Test} test
+ *   `unist-util-is`-compatible test
+ * @param {Visitor | boolean | null | undefined} [visitor]
+ *   Handle each node.
+ * @param {boolean | null | undefined} [reverse]
+ *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
+ * @returns {undefined}
+ *   Nothing.
+ *
+ * @template {UnistNode} Tree
+ *   Node type.
+ * @template {Test} Check
+ *   `unist-util-is`-compatible test.
+ */
+export function visitParents<Tree extends UnistNode, Check extends Test>(tree: Tree, check: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined): undefined;
+/**
+ * Visit nodes, with ancestral information.
+ *
+ * This algorithm performs *depth-first* *tree traversal* in *preorder*
+ * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
+ *
+ * You can choose for which nodes `visitor` is called by passing a `test`.
+ * For complex tests, you should test yourself in `visitor`, as it will be
+ * faster and will have improved type information.
+ *
+ * Walking the tree is an intensive task.
+ * Make use of the return values of the visitor when possible.
+ * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
+ * to check if a node matches, and then perform different operations.
+ *
+ * You can change the tree.
+ * See `Visitor` for more info.
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} check
+ * @param {BuildVisitor<Tree, Check>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {BuildVisitor<Tree>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @param {UnistNode} tree
+ *   Tree to traverse.
+ * @param {Visitor | Test} test
+ *   `unist-util-is`-compatible test
+ * @param {Visitor | boolean | null | undefined} [visitor]
+ *   Handle each node.
+ * @param {boolean | null | undefined} [reverse]
+ *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
+ * @returns {undefined}
+ *   Nothing.
+ *
+ * @template {UnistNode} Tree
+ *   Node type.
+ * @template {Test} Check
+ *   `unist-util-is`-compatible test.
+ */
+export function visitParents<Tree extends UnistNode, Check extends Test>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined): undefined;
+/**
+ * Continue traversing as normal.
+ */
+export const CONTINUE: true;
+/**
+ * Stop traversing immediately.
+ */
+export const EXIT: false;
+/**
+ * Do not traverse this node’s children.
+ */
+export const SKIP: "skip";
+/**
+ * Test from `unist-util-is`.
+ *
+ * Note: we have remove and add `undefined`, because otherwise when generating
+ * automatic `.d.ts` files, TS tries to flatten paths from a local perspective,
+ * which doesn’t work when publishing on npm.
+ */
+export type Test = Exclude<import("unist-util-is").Test, undefined> | undefined;
+/**
+ * Get the value of a type guard `Fn`.
+ */
+export type Predicate<Fn, Fallback> = (Fn extends (value: any) => value is infer Thing ? Thing : Fallback);
+/**
+ * Check whether a node matches a primitive check in the type system.
+ */
+export type MatchesOne<Value, Check> = (Check extends null | undefined ? Value : Value extends {
+    type: Check;
+} ? Value : Value extends Check ? Value : Check extends Function ? Predicate<Check, Value> extends Value ? Predicate<Check, Value> : never : never);
+/**
+ * Check whether a node matches a check in the type system.
+ */
+export type Matches<Value, Check> = (Check extends ReadonlyArray<infer T> ? MatchesOne<Value, T> : Check extends Array<infer T> ? MatchesOne<Value, T> : MatchesOne<Value, Check>);
+/**
+ * Number; capped reasonably.
+ */
+export type Uint = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10;
+/**
+ * Increment a number in the type system.
+ */
+export type Increment<I extends Uint = 0> = I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10;
+/**
+ * Collect nodes that can be parents of `Child`.
+ */
+export type InternalParent<Node extends UnistNode, Child extends UnistNode> = (Node extends UnistParent ? Node extends {
+    children: Array<infer Children>;
+} ? Child extends Children ? Node : never : never : never);
+/**
+ * Collect nodes in `Tree` that can be parents of `Child`.
+ */
+export type Parent<Tree extends UnistNode, Child extends UnistNode> = InternalParent<InclusiveDescendant<Tree>, Child>;
+/**
+ * Collect nodes in `Tree` that can be ancestors of `Child`.
+ */
+export type InternalAncestor<Node extends UnistNode, Child extends UnistNode, Max extends Uint = 10, Depth extends Uint = 0> = (Depth extends Max ? never : InternalParent<Node, Child> | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>);
+/**
+ * Collect nodes in `Tree` that can be ancestors of `Child`.
+ */
+export type Ancestor<Tree extends UnistNode, Child extends UnistNode> = InternalAncestor<InclusiveDescendant<Tree>, Child>;
+/**
+ * Collect all (inclusive) descendants of `Tree`.
+ *
+ * > 👉 **Note**: for performance reasons, this seems to be the fastest way to
+ * > recurse without actually running into an infinite loop, which the
+ * > previous version did.
+ * >
+ * > Practically, a max of `2` is typically enough assuming a `Root` is
+ * > passed, but it doesn’t improve performance.
+ * > It gets higher with `List > ListItem > Table > TableRow > TableCell`.
+ * > Using up to `10` doesn’t hurt or help either.
+ */
+export type InclusiveDescendant<Tree extends UnistNode, Max extends Uint = 10, Depth extends Uint = 0> = (Tree extends UnistParent ? Depth extends Max ? Tree : Tree | InclusiveDescendant<Tree["children"][number], Max, Increment<Depth>> : Tree);
+/**
+ * Union of the action types.
+ */
+export type Action = "skip" | boolean;
+/**
+ * Move to the sibling at `index` next (after node itself is completely
+ * traversed).
+ *
+ * Useful if mutating the tree, such as removing the node the visitor is
+ * currently on, or any of its previous siblings.
+ * Results less than 0 or greater than or equal to `children.length` stop
+ * traversing the parent.
+ */
+export type Index = number;
+/**
+ * List with one or two values, the first an action, the second an index.
+ */
+export type ActionTuple = [(Action | null | undefined | void)?, (Index | null | undefined)?];
+/**
+ * Any value that can be returned from a visitor.
+ */
+export type VisitorResult = Action | ActionTuple | Index | null | undefined | void;
+/**
+ * Handle a node (matching `test`, if given).
+ *
+ * Visitors are free to transform `node`.
+ * They can also transform the parent of node (the last of `ancestors`).
+ *
+ * Replacing `node` itself, if `SKIP` is not returned, still causes its
+ * descendants to be walked (which is a bug).
+ *
+ * When adding or removing previous siblings of `node` (or next siblings, in
+ * case of reverse), the `Visitor` should return a new `Index` to specify the
+ * sibling to traverse after `node` is traversed.
+ * Adding or removing next siblings of `node` (or previous siblings, in case
+ * of reverse) is handled as expected without needing to return a new `Index`.
+ *
+ * Removing the children property of an ancestor still results in them being
+ * traversed.
+ */
+export type Visitor<Visited extends UnistNode = UnistNode, VisitedParents extends UnistParent = UnistParent> = (node: Visited, ancestors: Array<VisitedParents>) => VisitorResult;
+/**
+ * Build a typed `Visitor` function from a tree and a test.
+ *
+ * It will infer which values are passed as `node` and which as `parents`.
+ */
+export type BuildVisitor<Tree extends UnistNode = UnistNode, Check extends Test = Test> = Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>;
+import type { Node as UnistNode } from 'unist';
+import type { Parent as UnistParent } from 'unist';
+//# sourceMappingURL=index.d.ts.map

package/node_modules/unist-util-visit-parents/lib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmQG,6BAwBsB,IAAI,SAAhB,SAAW,EAEJ,KAAK,SAAX,IAAK,QAzBR,IAAI,SACJ,KAAK,WACL,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,YACzB,OAAO,GAAG,IAAI,GAAG,SAAS,GACxB,SAAS,CAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,6BAiBsB,IAAI,SAAhB,SAAW,EAEJ,KAAK,SAAX,IAAK,QAlBR,IAAI,WACJ,YAAY,CAAC,IAAI,CAAC,YAClB,OAAO,GAAG,IAAI,GAAG,SAAS,GACxB,SAAS,CAEnB;AA9CH;;GAEG;AACH,uBAAwB,IAAI,CAAA;AAE5B;;GAEG;AACH,mBAAoB,KAAK,CAAA;AAEzB;;GAEG;AACH,mBAAoB,MAAM,CAAA;;;;;;;;mBA1Ob,OAAO,CAAC,OAAO,eAAe,EAAE,IAAI,EAAE,SAAS,CAAC,GAAG,SAAS;;;;sBAe5D,EAAE,EAEF,QAAQ,IARR,CACR,EAAE,SAAS,CAAC,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,MAAM,KAAK,GAC7C,KAAK,GACL,QAAQ,CACX;;;;uBAuBS,KAAK,EAEL,KAAK,IAhBL,CACR,KAAK,SAAS,IAAI,GAAG,SAAS,GAC5B,KAAK,GACL,KAAK,SAAS;IAAC,IAAI,EAAE,KAAK,CAAA;CAAC,GAC3B,KAAK,GACL,KAAK,SAAS,KAAK,GACnB,KAAK,GACL,KAAK,oBACL,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,KAAK,GACnC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,GACvB,KAAK,GACP,KAAK,CACR;;;;oBAiBS,KAAK,EAEL,KAAK,IAVL,CACR,KAAK,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAClC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,GACpB,KAAK,SAAS,KAAK,CAAC,MAAM,CAAC,CAAC,GAC5B,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,GACpB,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAC3B;;;;mBASS,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;;;;sBAOlC,CAAC,SAAR,IAAK,QAFN,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE;;;;2BAexJ,IAAI,SAAhB,SAAW,EAEC,KAAK,SAAjB,SAAW,IAVX,CACR,IAAI,SAAS,WAAW,GACtB,IAAI,SAAS;IAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAA;CAAC,GAC5C,KAAK,SAAS,QAAQ,GAAG,IAAI,GAAG,KAAK,GACrC,KAAK,GACP,KAAK,CACR;;;;mBAWqB,IAAI,SAAhB,SAAW,EAEC,KAAK,SAAjB,SAAW,IAJX,cAAc,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;;;;6BAiBpC,IAAI,SAAhB,SAAW,EAEC,KAAK,SAAjB,SAAW,EAEH,GAAG,SAAV,IAAK,OAEE,KAAK,SAAZ,IAAK,QAdN,CACR,KAAK,SAAS,GAAG,GACf,KAAK,GAEH,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,GAC3B,gBAAgB,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAC/E;;;;qBAeqB,IAAI,SAAhB,SAAW,EAEC,KAAK,SAAjB,SAAW,IAJX,gBAAgB,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;;;;;;;;;;;;;gCA0BtC,IAAI,SAAhB,SAAW,EAEH,GAAG,SAAV,IAAK,OAEE,KAAK,SAAZ,IAAK,QArBN,CACR,IAAI,SAAS,WAAW,GACpB,KAAK,SAAS,GAAG,GACf,IAAI,GACJ,IAAI,GAAG,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,GAC7E,IAAI,CACT;;;;qBAoBS,MAAM,GAAG,OAAO;;;;;;;;;;oBAGhB,MAAM;;;;0BASN,CAAC,CAAC,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;;;;4BAGlE,MAAM,GAAG,WAAW,GAAG,KAAK,GAAG,IAAI,GAAG,SAAS,GAAG,IAAI;;;;;;;;;;;;;;;;;;;oBAmCzC,OAAO,SAApB,SAAW,cAEI,cAAc,SAA7B,WAAa,yBAff,OAAO,aAEP,KAAK,CAAC,cAAc,CAAC,KAEnB,aAAa;;;;;;yBAoBA,IAAI,SAAjB,SAAW,cAEH,KAAK,SAAZ,IAAK,WANN,OAAO,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;uCAjN/D,OAAO;2CAAP,OAAO"}