@solid2-aria/components 0.0.0-stage → 0.0.1

package/dist/server/tree-drop-target-delegate.js

@@ -0,0 +1,178 @@
+/*
+ * Derived from Adobe React Spectrum: packages/react-aria-components/src/TreeDropTargetDelegate.ts.
+ * Modified for Solid Aria: adapted collection types and module imports for Solid 2.
+ * Licensed under Apache-2.0. See LICENSES/Apache-2.0.txt and NOTICE.txt at the repository root.
+ */
+import { requireValue } from "@solid2-aria/core/utils/require-value";
+import { isPresent } from "@solid2-aria/core/utils/is-present";
+// src/tree-drop-target-delegate.ts
+const X_SWITCH_THRESHOLD = 10;
+const Y_SWITCH_THRESHOLD = 5;
+var TreeDropTargetDelegate = class {
+	delegate = null;
+	state = null;
+	direction = "ltr";
+	pointerTracking = {
+		boundaryContext: null,
+		lastX: 0,
+		lastY: 0,
+		xDirection: null,
+		yDirection: null
+	};
+	setup(delegate, state, direction) {
+		this.delegate = delegate;
+		this.state = state;
+		this.direction = direction;
+	}
+	getDropTargetFromPoint(x, y, isValidDropTarget) {
+		const baseTarget = requireValue(this.delegate, "Expected this.delegate").getDropTargetFromPoint(x, y, isValidDropTarget);
+		if (!baseTarget || baseTarget.type === "root") return baseTarget;
+		return this.resolveDropTarget(baseTarget, x, y, isValidDropTarget);
+	}
+	resolveDropTarget(originalTarget, x, y, isValidDropTarget) {
+		let target = originalTarget;
+		const tracking = this.pointerTracking;
+		const deltaY = y - tracking.lastY;
+		const deltaX = x - tracking.lastX;
+		let currentYMovement = tracking.yDirection;
+		let currentXMovement = tracking.xDirection;
+		if (Math.abs(deltaY) > Y_SWITCH_THRESHOLD) {
+			currentYMovement = deltaY > 0 ? "down" : "up";
+			tracking.yDirection = currentYMovement;
+			tracking.lastY = y;
+		}
+		if (Math.abs(deltaX) > X_SWITCH_THRESHOLD) {
+			currentXMovement = deltaX > 0 ? "right" : "left";
+			tracking.xDirection = currentXMovement;
+			tracking.lastX = x;
+		}
+		if (target.dropPosition === "before") {
+			let keyBefore = requireValue(this.state, "Expected this.state").collection.getKeyBefore(target.key);
+			while (isPresent(keyBefore)) {
+				const node = requireValue(this.state, "Expected this.state").collection.getItem(keyBefore);
+				if (node?.type === "item") break;
+				keyBefore = node?.parentKey ?? null;
+			}
+			if (isPresent(keyBefore)) {
+				const convertedTarget = {
+					dropPosition: "after",
+					key: keyBefore,
+					type: "item"
+				};
+				if (isValidDropTarget(convertedTarget)) target = convertedTarget;
+			}
+		}
+		const potentialTargets = this.getPotentialTargets(target, isValidDropTarget);
+		if (potentialTargets.length === 0) return { type: "root" };
+		let resolvedItemTarget;
+		if (potentialTargets.length > 1) resolvedItemTarget = this.selectTarget(potentialTargets, target, x, y, currentYMovement, currentXMovement);
+		else {
+			resolvedItemTarget = requireValue(potentialTargets[0], "Expected potentialTargets[0]");
+			tracking.boundaryContext = null;
+		}
+		return resolvedItemTarget;
+	}
+	getPotentialTargets(originalTarget, isValidDropTarget) {
+		if (originalTarget.dropPosition === "on") return [originalTarget];
+		const target = originalTarget;
+		const { collection } = requireValue(this.state, "Expected this.state");
+		let currentItem = collection.getItem(target.key);
+		while (currentItem && currentItem?.type !== "item" && isPresent(currentItem.nextKey)) {
+			target.key = currentItem.nextKey;
+			currentItem = collection.getItem(currentItem.nextKey);
+		}
+		const potentialTargets = [target];
+		if (currentItem && currentItem.hasChildNodes && requireValue(this.state, "Expected this.state").expandedKeys.has(currentItem.key) && collection.getChildren && target.dropPosition === "after") {
+			const firstChildItemNode = this.firstChildItem(currentItem);
+			if (firstChildItemNode?.type === "item") {
+				const beforeFirstChildTarget = {
+					dropPosition: "before",
+					key: firstChildItemNode.key,
+					type: "item"
+				};
+				if (isValidDropTarget(beforeFirstChildTarget)) return [beforeFirstChildTarget];
+				return [];
+			}
+		}
+		if (isPresent(currentItem?.nextKey)) return [originalTarget];
+		potentialTargets.push(...this.ancestorTargets(currentItem, isValidDropTarget));
+		if (potentialTargets.length === 1) {
+			const beforeTarget = this.beforeDeeperSibling(target, currentItem);
+			if (beforeTarget && isValidDropTarget(beforeTarget)) return [beforeTarget];
+		}
+		return potentialTargets.filter(isValidDropTarget);
+	}
+	ancestorTargets(currentItem, isValidDropTarget) {
+		const { collection } = requireValue(this.state, "Expected initialized tree state");
+		let parentKey = currentItem?.parentKey;
+		const targets = [];
+		while (isPresent(parentKey)) {
+			const parent = collection.getItem(parentKey);
+			const next = isPresent(parent?.nextKey) ? collection.getItem(parent.nextKey) : null;
+			if (!next || next.parentKey !== parentKey) {
+				if (parent?.type === "item") {
+					const target = {
+						dropPosition: "after",
+						key: parentKey,
+						type: "item"
+					};
+					if (isValidDropTarget(target)) targets.push(target);
+				}
+				if (next) break;
+			}
+			parentKey = parent?.parentKey;
+		}
+		return targets;
+	}
+	beforeDeeperSibling(target, currentItem) {
+		const { collection } = requireValue(this.state, "Expected initialized tree state");
+		const nextKey = collection.getKeyAfter(target.key);
+		const next = isPresent(nextKey) ? collection.getItem(nextKey) : null;
+		if (next && currentItem && isPresent(next.level) && isPresent(currentItem.level) && next.level > currentItem.level) return {
+			dropPosition: "before",
+			key: next.key,
+			type: "item"
+		};
+		return null;
+	}
+	firstChildItem(parent) {
+		const { collection } = requireValue(this.state, "Expected initialized tree state");
+		let child = isPresent(parent.firstChildKey) ? collection.getItem(parent.firstChildKey) : null;
+		while (child && child.type !== "item") child = isPresent(child.nextKey) ? collection.getItem(child.nextKey) : null;
+		return child;
+	}
+	switchVerticalTarget(boundary, count, movement) {
+		const index = boundary.preferredTargetIndex ?? 0;
+		if (movement === "down" && index === 0) boundary.preferredTargetIndex = count - 1;
+		else if (movement === "up" && index === count - 1) boundary.preferredTargetIndex = 0;
+		this.pointerTracking.xDirection = null;
+	}
+	selectTarget(potentialTargets, originalTarget, x, y, currentYMovement, currentXMovement) {
+		if (potentialTargets.length < 2) return requireValue(potentialTargets[0], "Expected potentialTargets[0]");
+		const tracking = this.pointerTracking;
+		const parentKey = requireValue(this.state, "Expected this.state").collection.getItem(originalTarget.key)?.parentKey;
+		if (!isPresent(parentKey)) return requireValue(potentialTargets[0], "Expected potentialTargets[0]");
+		if (!tracking.boundaryContext || tracking.boundaryContext.parentKey !== parentKey) tracking.boundaryContext = {
+			lastSwitchX: x,
+			lastSwitchY: y,
+			parentKey,
+			preferredTargetIndex: tracking.yDirection === "up" ? potentialTargets.length - 1 : 0
+		};
+		const { boundaryContext } = tracking;
+		const distanceFromLastXSwitch = Math.abs(x - boundaryContext.lastSwitchX);
+		if (Math.abs(y - boundaryContext.lastSwitchY) > Y_SWITCH_THRESHOLD && currentYMovement) this.switchVerticalTarget(boundaryContext, potentialTargets.length, currentYMovement);
+		if (distanceFromLastXSwitch > X_SWITCH_THRESHOLD && currentXMovement) {
+			const nextIndex = (boundaryContext.preferredTargetIndex ?? 0) + (currentXMovement === "left" === (this.direction === "ltr") ? 1 : -1);
+			if (nextIndex >= 0 && nextIndex < potentialTargets.length) {
+				boundaryContext.preferredTargetIndex = nextIndex;
+				boundaryContext.lastSwitchX = x;
+			}
+			tracking.yDirection = null;
+		}
+		const targetIndex = Math.max(0, Math.min(boundaryContext.preferredTargetIndex ?? 0, potentialTargets.length - 1));
+		return requireValue(potentialTargets[targetIndex], "Expected potentialTargets[targetIndex]");
+	}
+};
+export { TreeDropTargetDelegate };
+
+//# sourceMappingURL=tree-drop-target-delegate.js.map

package/dist/server/tree-drop-target-delegate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-drop-target-delegate.js","names":[],"sources":["../../src/tree-drop-target-delegate.ts"],"sourcesContent":["/*\n * Derived from Adobe React Spectrum: packages/react-aria-components/src/TreeDropTargetDelegate.ts.\n * Modified for Solid Aria: adapted collection types and module imports for Solid 2.\n * Licensed under Apache-2.0. See LICENSES/Apache-2.0.txt and NOTICE.txt at the repository root.\n */\n\nimport { isPresent } from \"@solid2-aria/core/utils/is-present\";\nimport { requireValue } from \"@solid2-aria/core/utils/require-value\";\nimport type {\n  Direction,\n  DropTarget,\n  DropTargetDelegate,\n  ItemDropTarget,\n  Key,\n  Node,\n  RootDropTarget,\n} from \"@solid2-aria/types-shared\";\n\ninterface TreeCollection<T> extends Iterable<Node<T>> {\n  getItem: (key: Key) => Node<T> | null;\n  getChildren?: (key: Key) => Iterable<Node<T>>;\n  getKeyAfter: (key: Key) => Key | null;\n  getKeyBefore: (key: Key) => Key | null;\n}\n\ninterface TreeState<T> {\n  collection: TreeCollection<T>;\n  expandedKeys: Set<Key>;\n}\n\ninterface PointerTracking {\n  lastY: number;\n  lastX: number;\n  yDirection: \"up\" | \"down\" | null;\n  xDirection: \"left\" | \"right\" | null;\n  boundaryContext: {\n    parentKey: Key;\n    lastSwitchY: number;\n    lastSwitchX: number;\n    preferredTargetIndex?: number;\n  } | null;\n}\n\nconst X_SWITCH_THRESHOLD = 10;\nconst Y_SWITCH_THRESHOLD = 5;\n\nexport class TreeDropTargetDelegate<T> {\n  private delegate: DropTargetDelegate | null = null;\n  private state: TreeState<T> | null = null;\n  private direction: Direction = \"ltr\";\n  private readonly pointerTracking: PointerTracking = {\n    boundaryContext: null,\n    lastX: 0,\n    lastY: 0,\n    xDirection: null,\n    yDirection: null,\n  };\n\n  setup(\n    delegate: DropTargetDelegate,\n    state: TreeState<T>,\n    direction: Direction\n  ): void {\n    this.delegate = delegate;\n    this.state = state;\n    this.direction = direction;\n  }\n\n  getDropTargetFromPoint(\n    x: number,\n    y: number,\n    isValidDropTarget: (target: DropTarget) => boolean\n  ): DropTarget | null {\n    const baseTarget = requireValue(\n      this.delegate,\n      \"Expected this.delegate\"\n    ).getDropTargetFromPoint(x, y, isValidDropTarget);\n\n    if (!baseTarget || baseTarget.type === \"root\") {\n      return baseTarget;\n    }\n\n    return this.resolveDropTarget(baseTarget, x, y, isValidDropTarget);\n  }\n\n  private resolveDropTarget(\n    originalTarget: ItemDropTarget,\n    x: number,\n    y: number,\n    isValidDropTarget: (target: DropTarget) => boolean\n  ): RootDropTarget | ItemDropTarget | null {\n    let target = originalTarget;\n    const tracking = this.pointerTracking;\n\n    // Calculate movement directions\n    const deltaY = y - tracking.lastY;\n    const deltaX = x - tracking.lastX;\n    let currentYMovement: \"up\" | \"down\" | null = tracking.yDirection;\n    let currentXMovement: \"left\" | \"right\" | null = tracking.xDirection;\n\n    if (Math.abs(deltaY) > Y_SWITCH_THRESHOLD) {\n      currentYMovement = deltaY > 0 ? \"down\" : \"up\";\n      tracking.yDirection = currentYMovement;\n      tracking.lastY = y;\n    }\n\n    if (Math.abs(deltaX) > X_SWITCH_THRESHOLD) {\n      currentXMovement = deltaX > 0 ? \"right\" : \"left\";\n      tracking.xDirection = currentXMovement;\n      tracking.lastX = x;\n    }\n\n    // Normalize to 'after'\n    if (target.dropPosition === \"before\") {\n      let keyBefore = requireValue(\n        this.state,\n        \"Expected this.state\"\n      ).collection.getKeyBefore(target.key);\n\n      while (isPresent(keyBefore)) {\n        const node = requireValue(\n          this.state,\n          \"Expected this.state\"\n        ).collection.getItem(keyBefore);\n\n        if (node?.type === \"item\") {\n          break;\n        }\n\n        keyBefore = node?.parentKey ?? null;\n      }\n\n      if (isPresent(keyBefore)) {\n        const convertedTarget = {\n          dropPosition: \"after\",\n          key: keyBefore,\n          type: \"item\",\n        } as const;\n\n        if (isValidDropTarget(convertedTarget)) {\n          target = convertedTarget;\n        }\n      }\n    }\n\n    const potentialTargets = this.getPotentialTargets(\n      target,\n      isValidDropTarget\n    );\n\n    if (potentialTargets.length === 0) {\n      return { type: \"root\" };\n    }\n\n    let resolvedItemTarget: ItemDropTarget;\n\n    if (potentialTargets.length > 1) {\n      resolvedItemTarget = this.selectTarget(\n        potentialTargets,\n        target,\n        x,\n        y,\n        currentYMovement,\n        currentXMovement\n      );\n    } else {\n      resolvedItemTarget = requireValue(\n        potentialTargets[0],\n        \"Expected potentialTargets[0]\"\n      );\n      // Reset boundary context since we're not in a boundary case\n      tracking.boundaryContext = null;\n    }\n\n    return resolvedItemTarget;\n  }\n\n  // Returns potential targets for an ambiguous drop position (e.g. after the last child of a parent, or after the parent itself)\n  // Ordered by level, from innermost to outermost.\n  private getPotentialTargets(\n    originalTarget: ItemDropTarget,\n    isValidDropTarget: (target: DropTarget) => boolean\n  ): ItemDropTarget[] {\n    if (originalTarget.dropPosition === \"on\") {\n      return [originalTarget];\n    }\n\n    const target = originalTarget;\n    const { collection } = requireValue(this.state, \"Expected this.state\");\n\n    let currentItem = collection.getItem(target.key);\n\n    while (\n      currentItem &&\n      currentItem?.type !== \"item\" &&\n      isPresent(currentItem.nextKey)\n    ) {\n      target.key = currentItem.nextKey;\n      currentItem = collection.getItem(currentItem.nextKey);\n    }\n\n    const potentialTargets = [target];\n\n    // If target has children and is expanded, use \"before first child\"\n    if (\n      currentItem &&\n      currentItem.hasChildNodes &&\n      requireValue(this.state, \"Expected this.state\").expandedKeys.has(\n        currentItem.key\n      ) &&\n      collection.getChildren &&\n      target.dropPosition === \"after\"\n    ) {\n      const firstChildItemNode = this.firstChildItem(currentItem);\n\n      if (firstChildItemNode?.type === \"item\") {\n        const beforeFirstChildTarget = {\n          dropPosition: \"before\",\n          key: firstChildItemNode.key,\n          type: \"item\",\n        } as const;\n\n        if (isValidDropTarget(beforeFirstChildTarget)) {\n          return [beforeFirstChildTarget];\n        }\n\n        return [];\n      }\n    }\n\n    if (isPresent(currentItem?.nextKey)) {\n      return [originalTarget];\n    }\n\n    potentialTargets.push(\n      ...this.ancestorTargets(currentItem, isValidDropTarget)\n    );\n\n    if (potentialTargets.length === 1) {\n      const beforeTarget = this.beforeDeeperSibling(target, currentItem);\n\n      if (beforeTarget && isValidDropTarget(beforeTarget)) {\n        return [beforeTarget];\n      }\n    }\n\n    return potentialTargets.filter(isValidDropTarget);\n  }\n\n  private ancestorTargets(\n    currentItem: Node<T> | null,\n    isValidDropTarget: (target: DropTarget) => boolean\n  ): ItemDropTarget[] {\n    const { collection } = requireValue(\n      this.state,\n      \"Expected initialized tree state\"\n    );\n\n    let parentKey = currentItem?.parentKey;\n    const targets: ItemDropTarget[] = [];\n\n    while (isPresent(parentKey)) {\n      const parent = collection.getItem(parentKey);\n\n      const next = isPresent(parent?.nextKey)\n        ? collection.getItem(parent.nextKey)\n        : null;\n\n      const lastAtLevel = !next || next.parentKey !== parentKey;\n\n      if (lastAtLevel) {\n        if (parent?.type === \"item\") {\n          const target: ItemDropTarget = {\n            dropPosition: \"after\",\n            key: parentKey,\n            type: \"item\",\n          };\n\n          if (isValidDropTarget(target)) {\n            targets.push(target);\n          }\n        }\n\n        if (next) {\n          break;\n        }\n      }\n\n      parentKey = parent?.parentKey;\n    }\n\n    return targets;\n  }\n\n  private beforeDeeperSibling(\n    target: ItemDropTarget,\n    currentItem: Node<T> | null\n  ): ItemDropTarget | null {\n    const { collection } = requireValue(\n      this.state,\n      \"Expected initialized tree state\"\n    );\n\n    const nextKey = collection.getKeyAfter(target.key);\n    const next = isPresent(nextKey) ? collection.getItem(nextKey) : null;\n\n    if (\n      next &&\n      currentItem &&\n      isPresent(next.level) &&\n      isPresent(currentItem.level) &&\n      next.level > currentItem.level\n    ) {\n      return { dropPosition: \"before\", key: next.key, type: \"item\" };\n    }\n\n    return null;\n  }\n\n  private firstChildItem(parent: Node<T>): Node<T> | null {\n    const { collection } = requireValue(\n      this.state,\n      \"Expected initialized tree state\"\n    );\n\n    let child = isPresent(parent.firstChildKey)\n      ? collection.getItem(parent.firstChildKey)\n      : null;\n\n    while (child && child.type !== \"item\") {\n      child = isPresent(child.nextKey)\n        ? collection.getItem(child.nextKey)\n        : null;\n    }\n\n    return child;\n  }\n\n  private switchVerticalTarget(\n    boundary: NonNullable<PointerTracking[\"boundaryContext\"]>,\n    count: number,\n    movement: \"up\" | \"down\"\n  ): void {\n    const index = boundary.preferredTargetIndex ?? 0;\n\n    if (movement === \"down\" && index === 0) {\n      boundary.preferredTargetIndex = count - 1;\n    } else if (movement === \"up\" && index === count - 1) {\n      boundary.preferredTargetIndex = 0;\n    }\n\n    this.pointerTracking.xDirection = null;\n  }\n\n  private selectTarget(\n    potentialTargets: ItemDropTarget[],\n    originalTarget: ItemDropTarget,\n    x: number,\n    y: number,\n    currentYMovement: \"up\" | \"down\" | null,\n    currentXMovement: \"left\" | \"right\" | null\n  ): ItemDropTarget {\n    if (potentialTargets.length < 2) {\n      return requireValue(potentialTargets[0], \"Expected potentialTargets[0]\");\n    }\n\n    const tracking = this.pointerTracking;\n\n    const currentItem = requireValue(\n      this.state,\n      \"Expected this.state\"\n    ).collection.getItem(originalTarget.key);\n\n    const parentKey = currentItem?.parentKey;\n\n    if (!isPresent(parentKey)) {\n      return requireValue(potentialTargets[0], \"Expected potentialTargets[0]\");\n    }\n\n    // More than 1 potential target - use Y for initial target, then X for switching levels\n    // Initialize boundary context if needed\n    if (\n      !tracking.boundaryContext ||\n      tracking.boundaryContext.parentKey !== parentKey\n    ) {\n      // If entering from below, start with outer-most\n      const initialTargetIndex =\n        tracking.yDirection === \"up\" ? potentialTargets.length - 1 : 0;\n\n      tracking.boundaryContext = {\n        lastSwitchX: x,\n        lastSwitchY: y,\n        parentKey,\n        preferredTargetIndex: initialTargetIndex,\n      };\n    }\n\n    const { boundaryContext } = tracking;\n    const distanceFromLastXSwitch = Math.abs(x - boundaryContext.lastSwitchX);\n    const distanceFromLastYSwitch = Math.abs(y - boundaryContext.lastSwitchY);\n\n    // Switch between targets based on Y movement\n    if (distanceFromLastYSwitch > Y_SWITCH_THRESHOLD && currentYMovement) {\n      this.switchVerticalTarget(\n        boundaryContext,\n        potentialTargets.length,\n        currentYMovement\n      );\n    }\n\n    // X movement controls level selection\n    if (distanceFromLastXSwitch > X_SWITCH_THRESHOLD && currentXMovement) {\n      const currentTargetIndex = boundaryContext.preferredTargetIndex ?? 0;\n\n      const outward =\n        (currentXMovement === \"left\") === (this.direction === \"ltr\");\n\n      const nextIndex = currentTargetIndex + (outward ? 1 : -1);\n\n      if (nextIndex >= 0 && nextIndex < potentialTargets.length) {\n        boundaryContext.preferredTargetIndex = nextIndex;\n        boundaryContext.lastSwitchX = x;\n      }\n\n      // Reset y tracking so that moving diagonally doesn't cause flickering.\n      tracking.yDirection = null;\n    }\n\n    const targetIndex = Math.max(\n      0,\n      Math.min(\n        boundaryContext.preferredTargetIndex ?? 0,\n        potentialTargets.length - 1\n      )\n    );\n\n    return requireValue(\n      potentialTargets[targetIndex],\n      \"Expected potentialTargets[targetIndex]\"\n    );\n  }\n}\n"],"mappings":";;;;;;;;AA2CA,MAAM,qBAAqB;AAC3B,MAAM,qBAAqB;AAE3B,IAAa,yBAAb,MAAuC;CACrC,WAA8C;CAC9C,QAAqC;CACrC,YAA+B;CAC/B,kBAAoD;EAClD,iBAAiB;EACjB,OAAO;EACP,OAAO;EACP,YAAY;EACZ,YAAY;CACd;CAEA,MACE,UACA,OACA,WACM;EACN,KAAK,WAAW;EAChB,KAAK,QAAQ;EACb,KAAK,YAAY;CACnB;CAEA,uBACE,GACA,GACA,mBACmB;EACnB,MAAM,aAAa,aACjB,KAAK,UACL,wBACF,CAAC,CAAC,uBAAuB,GAAG,GAAG,iBAAiB;EAEhD,IAAI,CAAC,cAAc,WAAW,SAAS,QACrC,OAAO;EAGT,OAAO,KAAK,kBAAkB,YAAY,GAAG,GAAG,iBAAiB;CACnE;CAEA,kBACE,gBACA,GACA,GACA,mBACwC;EACxC,IAAI,SAAS;EACb,MAAM,WAAW,KAAK;EAGtB,MAAM,SAAS,IAAI,SAAS;EAC5B,MAAM,SAAS,IAAI,SAAS;EAC5B,IAAI,mBAAyC,SAAS;EACtD,IAAI,mBAA4C,SAAS;EAEzD,IAAI,KAAK,IAAI,MAAM,IAAI,oBAAoB;GACzC,mBAAmB,SAAS,IAAI,SAAS;GACzC,SAAS,aAAa;GACtB,SAAS,QAAQ;EACnB;EAEA,IAAI,KAAK,IAAI,MAAM,IAAI,oBAAoB;GACzC,mBAAmB,SAAS,IAAI,UAAU;GAC1C,SAAS,aAAa;GACtB,SAAS,QAAQ;EACnB;EAGA,IAAI,OAAO,iBAAiB,UAAU;GACpC,IAAI,YAAY,aACd,KAAK,OACL,qBACF,CAAC,CAAC,WAAW,aAAa,OAAO,GAAG;GAEpC,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,aACX,KAAK,OACL,qBACF,CAAC,CAAC,WAAW,QAAQ,SAAS;IAE9B,IAAI,MAAM,SAAS,QACjB;IAGF,YAAY,MAAM,aAAa;GACjC;GAEA,IAAI,UAAU,SAAS,GAAG;IACxB,MAAM,kBAAkB;KACtB,cAAc;KACd,KAAK;KACL,MAAM;IACR;IAEA,IAAI,kBAAkB,eAAe,GACnC,SAAS;GAEb;EACF;EAEA,MAAM,mBAAmB,KAAK,oBAC5B,QACA,iBACF;EAEA,IAAI,iBAAiB,WAAW,GAC9B,OAAO,EAAE,MAAM,OAAO;EAGxB,IAAI;EAEJ,IAAI,iBAAiB,SAAS,GAC5B,qBAAqB,KAAK,aACxB,kBACA,QACA,GACA,GACA,kBACA,gBACF;OACK;GACL,qBAAqB,aACnB,iBAAiB,IACjB,8BACF;GAEA,SAAS,kBAAkB;EAC7B;EAEA,OAAO;CACT;CAIA,oBACE,gBACA,mBACkB;EAClB,IAAI,eAAe,iBAAiB,MAClC,OAAO,CAAC,cAAc;EAGxB,MAAM,SAAS;EACf,MAAM,EAAE,eAAe,aAAa,KAAK,OAAO,qBAAqB;EAErE,IAAI,cAAc,WAAW,QAAQ,OAAO,GAAG;EAE/C,OACE,eACA,aAAa,SAAS,UACtB,UAAU,YAAY,OAAO,GAC7B;GACA,OAAO,MAAM,YAAY;GACzB,cAAc,WAAW,QAAQ,YAAY,OAAO;EACtD;EAEA,MAAM,mBAAmB,CAAC,MAAM;EAGhC,IACE,eACA,YAAY,iBACZ,aAAa,KAAK,OAAO,qBAAqB,CAAC,CAAC,aAAa,IAC3D,YAAY,GACd,KACA,WAAW,eACX,OAAO,iBAAiB,SACxB;GACA,MAAM,qBAAqB,KAAK,eAAe,WAAW;GAE1D,IAAI,oBAAoB,SAAS,QAAQ;IACvC,MAAM,yBAAyB;KAC7B,cAAc;KACd,KAAK,mBAAmB;KACxB,MAAM;IACR;IAEA,IAAI,kBAAkB,sBAAsB,GAC1C,OAAO,CAAC,sBAAsB;IAGhC,OAAO,CAAC;GACV;EACF;EAEA,IAAI,UAAU,aAAa,OAAO,GAChC,OAAO,CAAC,cAAc;EAGxB,iBAAiB,KACf,GAAG,KAAK,gBAAgB,aAAa,iBAAiB,CACxD;EAEA,IAAI,iBAAiB,WAAW,GAAG;GACjC,MAAM,eAAe,KAAK,oBAAoB,QAAQ,WAAW;GAEjE,IAAI,gBAAgB,kBAAkB,YAAY,GAChD,OAAO,CAAC,YAAY;EAExB;EAEA,OAAO,iBAAiB,OAAO,iBAAiB;CAClD;CAEA,gBACE,aACA,mBACkB;EAClB,MAAM,EAAE,eAAe,aACrB,KAAK,OACL,iCACF;EAEA,IAAI,YAAY,aAAa;EAC7B,MAAM,UAA4B,CAAC;EAEnC,OAAO,UAAU,SAAS,GAAG;GAC3B,MAAM,SAAS,WAAW,QAAQ,SAAS;GAE3C,MAAM,OAAO,UAAU,QAAQ,OAAO,IAClC,WAAW,QAAQ,OAAO,OAAO,IACjC;GAIJ,IAFoB,CAAC,QAAQ,KAAK,cAAc,WAE/B;IACf,IAAI,QAAQ,SAAS,QAAQ;KAC3B,MAAM,SAAyB;MAC7B,cAAc;MACd,KAAK;MACL,MAAM;KACR;KAEA,IAAI,kBAAkB,MAAM,GAC1B,QAAQ,KAAK,MAAM;IAEvB;IAEA,IAAI,MACF;GAEJ;GAEA,YAAY,QAAQ;EACtB;EAEA,OAAO;CACT;CAEA,oBACE,QACA,aACuB;EACvB,MAAM,EAAE,eAAe,aACrB,KAAK,OACL,iCACF;EAEA,MAAM,UAAU,WAAW,YAAY,OAAO,GAAG;EACjD,MAAM,OAAO,UAAU,OAAO,IAAI,WAAW,QAAQ,OAAO,IAAI;EAEhE,IACE,QACA,eACA,UAAU,KAAK,KAAK,KACpB,UAAU,YAAY,KAAK,KAC3B,KAAK,QAAQ,YAAY,OAEzB,OAAO;GAAE,cAAc;GAAU,KAAK,KAAK;GAAK,MAAM;EAAO;EAG/D,OAAO;CACT;CAEA,eAAuB,QAAiC;EACtD,MAAM,EAAE,eAAe,aACrB,KAAK,OACL,iCACF;EAEA,IAAI,QAAQ,UAAU,OAAO,aAAa,IACtC,WAAW,QAAQ,OAAO,aAAa,IACvC;EAEJ,OAAO,SAAS,MAAM,SAAS,QAC7B,QAAQ,UAAU,MAAM,OAAO,IAC3B,WAAW,QAAQ,MAAM,OAAO,IAChC;EAGN,OAAO;CACT;CAEA,qBACE,UACA,OACA,UACM;EACN,MAAM,QAAQ,SAAS,wBAAwB;EAE/C,IAAI,aAAa,UAAU,UAAU,GACnC,SAAS,uBAAuB,QAAQ;OACnC,IAAI,aAAa,QAAQ,UAAU,QAAQ,GAChD,SAAS,uBAAuB;EAGlC,KAAK,gBAAgB,aAAa;CACpC;CAEA,aACE,kBACA,gBACA,GACA,GACA,kBACA,kBACgB;EAChB,IAAI,iBAAiB,SAAS,GAC5B,OAAO,aAAa,iBAAiB,IAAI,8BAA8B;EAGzE,MAAM,WAAW,KAAK;EAOtB,MAAM,YALc,aAClB,KAAK,OACL,qBACF,CAAC,CAAC,WAAW,QAAQ,eAAe,GAER,CAAC,EAAE;EAE/B,IAAI,CAAC,UAAU,SAAS,GACtB,OAAO,aAAa,iBAAiB,IAAI,8BAA8B;EAKzE,IACE,CAAC,SAAS,mBACV,SAAS,gBAAgB,cAAc,WAMvC,SAAS,kBAAkB;GACzB,aAAa;GACb,aAAa;GACb;GACA,sBANA,SAAS,eAAe,OAAO,iBAAiB,SAAS,IAAI;EAO/D;EAGF,MAAM,EAAE,oBAAoB;EAC5B,MAAM,0BAA0B,KAAK,IAAI,IAAI,gBAAgB,WAAW;EAIxE,IAHgC,KAAK,IAAI,IAAI,gBAAgB,WAGnC,IAAI,sBAAsB,kBAClD,KAAK,qBACH,iBACA,iBAAiB,QACjB,gBACF;EAIF,IAAI,0BAA0B,sBAAsB,kBAAkB;GAMpE,MAAM,aALqB,gBAAgB,wBAAwB,MAGhE,qBAAqB,YAAa,KAAK,cAAc,SAEN,IAAI;GAEtD,IAAI,aAAa,KAAK,YAAY,iBAAiB,QAAQ;IACzD,gBAAgB,uBAAuB;IACvC,gBAAgB,cAAc;GAChC;GAGA,SAAS,aAAa;EACxB;EAEA,MAAM,cAAc,KAAK,IACvB,GACA,KAAK,IACH,gBAAgB,wBAAwB,GACxC,iBAAiB,SAAS,CAC5B,CACF;EAEA,OAAO,aACL,iBAAiB,cACjB,wCACF;CACF;AACF"}