@dxos/plugin-explorer 0.10.0 → 0.11.0

package/dist/lib/chunk-types2.mjs

@@ -0,0 +1,231 @@
+import * as Schema from "effect/Schema";
+import { DXN, Key, Obj, Ref, Type } from "@dxos/echo";
+import { TestSchema } from "@dxos/echo/testing";
+import { invariant } from "@dxos/invariant";
+//#region src/components/Tree/types/tree.ts
+var __dxlog_file = "/__w/dxos/dxos/packages/plugins/plugin-explorer/src/components/Tree/types/tree.ts";
+var TreeNodeType = Schema.Struct({
+	id: Key.EntityId,
+	children: Schema.mutable(Schema.Array(Key.EntityId)),
+	data: Schema.mutable(Schema.Record({
+		key: Schema.String,
+		value: Schema.Any
+	})),
+	ref: Schema.optional(Ref.Ref(TestSchema.Expando))
+}).pipe(Schema.mutable);
+var TreeType = class extends Type.makeObject(DXN.make("org.dxos.type.tree", "0.1.0"))(Schema.Struct({
+	root: Key.EntityId,
+	nodes: Schema.mutable(Schema.Record({
+		key: Key.EntityId,
+		value: TreeNodeType
+	}))
+})) {};
+/**
+* Wrapper object for tree.
+*/
+var Tree = class Tree {
+	static create = () => {
+		const id = Key.EntityId.random();
+		return Obj.make(TreeType, {
+			root: id,
+			nodes: { [id]: {
+				id,
+				children: [],
+				data: { text: "" }
+			} }
+		});
+	};
+	_tree;
+	constructor(tree) {
+		this._tree = tree ?? Tree.create();
+	}
+	get tree() {
+		return this._tree;
+	}
+	get size() {
+		return Object.keys(this._tree.nodes).length;
+	}
+	get root() {
+		return this.getNode(this._tree.root);
+	}
+	/**
+	* Recursively traverse the tree until the callback returns a value.
+	*/
+	tranverse(callback, root = this._tree.root, depth = 0) {
+		const node = this._tree.nodes[root];
+		const result = callback(node, depth);
+		if (result !== void 0) return result;
+		for (const childId of node.children) {
+			const result = this.tranverse(callback, childId, depth + 1);
+			if (result !== void 0) return result;
+		}
+	}
+	getNode(id) {
+		const node = this._tree.nodes[id];
+		invariant(node, void 0, {
+			"~LogMeta": "~LogMeta",
+			F: __dxlog_file,
+			L: 94,
+			S: this,
+			A: ["node", ""]
+		});
+		return node;
+	}
+	/**
+	* Get the children of a node.
+	*/
+	getChildNodes(node) {
+		return node.children.map((id) => this.getNode(id));
+	}
+	/**
+	* Get the parent of a node.
+	*/
+	getParent(node) {
+		return this.tranverse((n) => {
+			if (n.children.includes(node.id)) return n;
+		}) ?? null;
+	}
+	/**
+	* Get the next node in the tree.
+	*/
+	getNext(node, hierarchical = true) {
+		if (hierarchical && node.children.length) return this.getChildNodes(node)[0];
+		else {
+			const parent = this.getParent(node);
+			if (parent) {
+				const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
+				if (idx < parent.children.length - 1) return this.getNode(parent.children[idx + 1]);
+				else return this.getNext(parent, false);
+			}
+		}
+	}
+	/**
+	* Get the previous node in the tree.
+	*/
+	getPrevious(node, hierarchical = true) {
+		const parent = this.getParent(node);
+		const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
+		if (idx === 0) {
+			if (hierarchical) return parent;
+		} else {
+			const previous = this.getNode(parent.children[idx - 1]);
+			if (hierarchical && previous.children.length) return this.getLastDescendent(previous);
+			return previous;
+		}
+	}
+	/**
+	* Get the last descendent of a node.
+	*/
+	getLastDescendent(node) {
+		const children = this.getChildNodes(node);
+		const last = children.length ? children[children.length - 1] : void 0;
+		if (last) return this.getLastDescendent(last);
+		return node;
+	}
+	/**
+	* Clear tree.
+	*/
+	clear() {
+		const root = this._tree.nodes[this._tree.root];
+		root.children.length = 0;
+		Obj.update(this._tree, (obj) => {
+			obj.nodes = { [root.id]: root };
+		});
+	}
+	/**
+	* Add node.
+	*/
+	addNode(parent, node, index) {
+		if (!node) node = {
+			id: Key.EntityId.random(),
+			children: [],
+			data: { text: "" }
+		};
+		const nodeToAdd = node;
+		Obj.update(this._tree, (obj) => {
+			obj.nodes[nodeToAdd.id] = nodeToAdd;
+			parent.children.splice(index ?? parent.children.length, 0, nodeToAdd.id);
+		});
+		return node;
+	}
+	/**
+	* Delete node.
+	*/
+	deleteNode(parent, id) {
+		const node = this._tree.nodes[id];
+		if (!node) return;
+		Obj.update(this._tree, (obj) => {
+			delete obj.nodes[node.id];
+		});
+		const idx = parent.children.findIndex((child) => child === id);
+		if (idx !== -1) Obj.update(this._tree, () => {
+			parent.children.splice(idx, 1);
+		});
+		return node;
+	}
+	/**
+	* Move child node.
+	*/
+	moveNode(node, from, to) {
+		invariant(from >= 0 && from < node.children.length, void 0, {
+			"~LogMeta": "~LogMeta",
+			F: __dxlog_file,
+			L: 233,
+			S: this,
+			A: ["from >= 0 && from < node.children.length", ""]
+		});
+		invariant(to >= 0 && to < node.children.length, void 0, {
+			"~LogMeta": "~LogMeta",
+			F: __dxlog_file,
+			L: 234,
+			S: this,
+			A: ["to >= 0 && to < node.children.length", ""]
+		});
+		if (from === to) return null;
+		const child = node.children[from];
+		Obj.update(this._tree, () => {
+			node.children.splice(from, 1);
+			node.children.splice(to, 0, child);
+		});
+		return this.getNode(child);
+	}
+	/**
+	* Indent node.
+	*/
+	indentNode(node) {
+		const parent = this.getParent(node);
+		if (!parent) return;
+		const idx = parent.children.findIndex((child) => child === node.id);
+		if (idx < 1 || idx >= parent.children.length) return;
+		const previous = this.getNode(parent.children[idx - 1]);
+		Obj.update(this._tree, () => {
+			parent.children.splice(idx, 1);
+			previous.children.push(node.id);
+		});
+	}
+	/**
+	* Unindent node.
+	*/
+	unindentNode(node) {
+		const parent = this.getParent(node);
+		if (!parent) return;
+		const ancestor = this.getParent(parent);
+		if (!ancestor) return;
+		const nodeIdx = parent.children.findIndex((id) => id === node.id);
+		let rest = [];
+		Obj.update(this._tree, () => {
+			rest = parent.children.splice(nodeIdx, parent.children.length - nodeIdx).slice(1);
+		});
+		const parentIdx = this.getChildNodes(ancestor).findIndex((n) => n.id === parent.id);
+		Obj.update(this._tree, () => {
+			ancestor.children.splice(parentIdx + 1, 0, node.id);
+		});
+		Obj.update(this._tree, () => {
+			node.children.push(...rest);
+		});
+	}
+};
+//#endregion
+export { TreeNodeType as n, TreeType as r, Tree as t };
+
+//# sourceMappingURL=chunk-types2.mjs.map

package/dist/lib/chunk-types2.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk-types2.mjs","names":[],"sources":["../../src/components/Tree/types/tree.ts"],"sourcesContent":["//\n// Copyright 2023 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { DXN, Key, Obj, Ref, Type } from '@dxos/echo';\nimport { TestSchema } from '@dxos/echo/testing';\nimport { invariant } from '@dxos/invariant';\n\n// TODO(burdon): Reconcile with @dxos/graph (i.e., common types).\n\nexport const TreeNodeType = Schema.Struct({\n  id: Key.EntityId,\n  children: Schema.mutable(Schema.Array(Key.EntityId)),\n  data: Schema.mutable(Schema.Record({ key: Schema.String, value: Schema.Any })),\n  ref: Schema.optional(Ref.Ref(TestSchema.Expando)),\n}).pipe(Schema.mutable);\n\nexport type TreeNodeType = Schema.Schema.Type<typeof TreeNodeType>;\n\nexport class TreeType extends Type.makeObject<TreeType>(DXN.make('org.dxos.type.tree', '0.1.0'))(\n  Schema.Struct({\n    root: Key.EntityId,\n    nodes: Schema.mutable(Schema.Record({ key: Key.EntityId, value: TreeNodeType })),\n  }),\n) {}\n\n/**\n * Wrapper object for tree.\n */\nexport class Tree {\n  static create = (): TreeType => {\n    const id = Key.EntityId.random();\n    return Obj.make(TreeType, {\n      root: id,\n      nodes: {\n        [id]: {\n          id,\n          children: [],\n          data: { text: '' }, // TODO(burdon): Generic.\n        },\n      },\n    });\n  };\n\n  private _tree: TreeType;\n\n  constructor(tree?: TreeType) {\n    this._tree = tree ?? Tree.create();\n  }\n\n  get tree() {\n    return this._tree;\n  }\n\n  // TODO(burdon): Make reactive.\n  get size() {\n    return Object.keys(this._tree.nodes).length;\n  }\n\n  get root() {\n    return this.getNode(this._tree.root);\n  }\n\n  //\n  // Traversal\n  //\n\n  /**\n   * Recursively traverse the tree until the callback returns a value.\n   */\n  tranverse<T>(\n    callback: (node: TreeNodeType, depth: number) => T | void,\n    root: Key.EntityId = this._tree.root,\n    depth = 0,\n  ): T | void {\n    const node = this._tree.nodes[root];\n    const result = callback(node, depth);\n    if (result !== undefined) {\n      return result;\n    }\n\n    for (const childId of node.children) {\n      const result = this.tranverse(callback, childId, depth + 1);\n      if (result !== undefined) {\n        return result;\n      }\n    }\n  }\n\n  getNode(id: Key.EntityId): TreeNodeType {\n    const node = this._tree.nodes[id];\n    invariant(node);\n    return node;\n  }\n\n  /**\n   * Get the children of a node.\n   */\n  getChildNodes(node: TreeNodeType): Array<TreeNodeType> {\n    return node.children.map((id) => this.getNode(id));\n  }\n\n  /**\n   * Get the parent of a node.\n   */\n  getParent(node: TreeNodeType): TreeNodeType | null {\n    const parent = this.tranverse((n) => {\n      if (n.children.includes(node.id)) {\n        return n;\n      }\n    });\n\n    return parent ?? null;\n  }\n\n  /**\n   * Get the next node in the tree.\n   */\n  getNext(node: TreeNodeType, hierarchical = true): TreeNodeType | undefined {\n    if (hierarchical && node.children.length) {\n      // First child.\n      return this.getChildNodes(node)[0];\n    } else {\n      const parent = this.getParent(node);\n      if (parent) {\n        const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);\n        if (idx < parent.children.length - 1) {\n          // Next sibling.\n          return this.getNode(parent.children[idx + 1]);\n        } else {\n          // Get parent's next sibling.\n          return this.getNext(parent, false);\n        }\n      }\n    }\n  }\n\n  /**\n   * Get the previous node in the tree.\n   */\n  getPrevious(node: TreeNodeType, hierarchical = true): TreeNodeType | undefined {\n    const parent = this.getParent(node)!;\n    const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);\n    if (idx === 0) {\n      if (hierarchical) {\n        return parent;\n      }\n    } else {\n      const previous = this.getNode(parent.children[idx - 1]);\n      if (hierarchical && previous.children.length) {\n        return this.getLastDescendent(previous);\n      }\n\n      return previous;\n    }\n  }\n\n  /**\n   * Get the last descendent of a node.\n   */\n  getLastDescendent(node: TreeNodeType): TreeNodeType | undefined {\n    const children = this.getChildNodes(node);\n    const last = children.length ? children[children.length - 1] : undefined;\n    if (last) {\n      return this.getLastDescendent(last);\n    }\n\n    return node;\n  }\n\n  //\n  // Mutations\n  //\n\n  /**\n   * Clear tree.\n   */\n  clear(): void {\n    const root = this._tree.nodes[this._tree.root];\n    root.children.length = 0;\n    Obj.update(this._tree, (obj) => {\n      obj.nodes = {\n        [root.id]: root,\n      };\n    });\n  }\n\n  /**\n   * Add node.\n   */\n  addNode(parent: TreeNodeType, node?: TreeNodeType, index?: number): TreeNodeType {\n    if (!node) {\n      const id = Key.EntityId.random();\n      node = { id, children: [], data: { text: '' } }; // TODO(burdon): Generic.\n    }\n\n    const nodeToAdd = node;\n    Obj.update(this._tree, (obj) => {\n      obj.nodes[nodeToAdd.id] = nodeToAdd;\n      parent.children.splice(index ?? parent.children.length, 0, nodeToAdd.id);\n    });\n    return node;\n  }\n\n  /**\n   * Delete node.\n   */\n  deleteNode(parent: TreeNodeType, id: Key.EntityId): TreeNodeType | undefined {\n    const node = this._tree.nodes[id];\n    if (!node) {\n      return undefined;\n    }\n\n    Obj.update(this._tree, (obj) => {\n      delete obj.nodes[node.id];\n    });\n    const idx = parent.children.findIndex((child) => child === id);\n    if (idx !== -1) {\n      Obj.update(this._tree, () => {\n        parent.children.splice(idx, 1);\n      });\n    }\n\n    return node;\n  }\n\n  /**\n   * Move child node.\n   */\n  moveNode(node: TreeNodeType, from: number, to: number): TreeNodeType | null {\n    invariant(from >= 0 && from < node.children.length);\n    invariant(to >= 0 && to < node.children.length);\n    if (from === to) {\n      return null;\n    }\n\n    const child = node.children[from];\n    Obj.update(this._tree, () => {\n      node.children.splice(from, 1);\n      node.children.splice(to, 0, child);\n    });\n    return this.getNode(child);\n  }\n\n  /**\n   * Indent node.\n   */\n  indentNode(node: TreeNodeType): void {\n    const parent = this.getParent(node);\n    if (!parent) {\n      return;\n    }\n\n    const idx = parent.children.findIndex((child) => child === node.id);\n    if (idx < 1 || idx >= parent.children.length) {\n      return;\n    }\n\n    const previous = this.getNode(parent.children[idx - 1]);\n    Obj.update(this._tree, () => {\n      parent.children.splice(idx, 1);\n      previous.children.push(node.id);\n    });\n  }\n\n  /**\n   * Unindent node.\n   */\n  unindentNode(node: TreeNodeType): void {\n    const parent = this.getParent(node);\n    if (!parent) {\n      return;\n    }\n\n    const ancestor = this.getParent(parent);\n    if (!ancestor) {\n      return;\n    }\n\n    // Remove node from parent and get following siblings.\n    const nodeIdx = parent.children.findIndex((id) => id === node.id);\n    let rest: Key.EntityId[] = [];\n    Obj.update(this._tree, () => {\n      const removed = parent.children.splice(nodeIdx, parent.children.length - nodeIdx);\n      rest = removed.slice(1); // Skip the node itself.\n    });\n\n    // Add to ancestor.\n    const parentIdx = this.getChildNodes(ancestor).findIndex((n) => n.id === parent.id);\n    Obj.update(this._tree, () => {\n      ancestor.children.splice(parentIdx + 1, 0, node.id);\n    });\n\n    // Transplant following siblings to current node.\n    Obj.update(this._tree, () => {\n      node.children.push(...rest);\n    });\n  }\n}\n"],"mappings":";;;;;;AAYA,IAAa,eAAe,OAAO,OAAO;CACxC,IAAI,IAAI;CACR,UAAU,OAAO,QAAQ,OAAO,MAAM,IAAI,QAAQ,CAAC;CACnD,MAAM,OAAO,QAAQ,OAAO,OAAO;EAAE,KAAK,OAAO;EAAQ,OAAO,OAAO;CAAI,CAAC,CAAC;CAC7E,KAAK,OAAO,SAAS,IAAI,IAAI,WAAW,OAAO,CAAC;AAClD,CAAC,CAAC,CAAC,KAAK,OAAO,OAAO;AAItB,IAAa,WAAb,cAA8B,KAAK,WAAqB,IAAI,KAAK,sBAAsB,OAAO,CAAC,CAAC,CAC9F,OAAO,OAAO;CACZ,MAAM,IAAI;CACV,OAAO,OAAO,QAAQ,OAAO,OAAO;EAAE,KAAK,IAAI;EAAU,OAAO;CAAa,CAAC,CAAC;AACjF,CAAC,CACH,CAAC,CAAC,CAAC;;;;AAKH,IAAa,OAAb,MAAa,KAAK;CAChB,OAAO,eAAyB;EAC9B,MAAM,KAAK,IAAI,SAAS,OAAO;EAC/B,OAAO,IAAI,KAAK,UAAU;GACxB,MAAM;GACN,OAAO,GACJ,KAAK;IACJ;IACA,UAAU,CAAC;IACX,MAAM,EAAE,MAAM,GAAG;GACnB,EACF;EACF,CAAC;CACH;CAEA;CAEA,YAAY,MAAiB;EAC3B,KAAK,QAAQ,QAAQ,KAAK,OAAO;CACnC;CAEA,IAAI,OAAO;EACT,OAAO,KAAK;CACd;CAGA,IAAI,OAAO;EACT,OAAO,OAAO,KAAK,KAAK,MAAM,KAAK,CAAC,CAAC;CACvC;CAEA,IAAI,OAAO;EACT,OAAO,KAAK,QAAQ,KAAK,MAAM,IAAI;CACrC;;;;CASA,UACE,UACA,OAAqB,KAAK,MAAM,MAChC,QAAQ,GACE;EACV,MAAM,OAAO,KAAK,MAAM,MAAM;EAC9B,MAAM,SAAS,SAAS,MAAM,KAAK;EACnC,IAAI,WAAW,KAAA,GACb,OAAO;EAGT,KAAK,MAAM,WAAW,KAAK,UAAU;GACnC,MAAM,SAAS,KAAK,UAAU,UAAU,SAAS,QAAQ,CAAC;GAC1D,IAAI,WAAW,KAAA,GACb,OAAO;EAEX;CACF;CAEA,QAAQ,IAAgC;EACtC,MAAM,OAAO,KAAK,MAAM,MAAM;EAC9B,UAAU,MAAG,KAAA,GAAA;GAAA,YAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA,CAAA,QAAA,EAAA;EAAA,CAAC;EACd,OAAO;CACT;;;;CAKA,cAAc,MAAyC;EACrD,OAAO,KAAK,SAAS,KAAK,OAAO,KAAK,QAAQ,EAAE,CAAC;CACnD;;;;CAKA,UAAU,MAAyC;EAOjD,OANe,KAAK,WAAW,MAAM;GACnC,IAAI,EAAE,SAAS,SAAS,KAAK,EAAE,GAC7B,OAAO;EAEX,CAEO,KAAU;CACnB;;;;CAKA,QAAQ,MAAoB,eAAe,MAAgC;EACzE,IAAI,gBAAgB,KAAK,SAAS,QAEhC,OAAO,KAAK,cAAc,IAAI,CAAC,CAAC;OAC3B;GACL,MAAM,SAAS,KAAK,UAAU,IAAI;GAClC,IAAI,QAAQ;IACV,MAAM,MAAM,KAAK,cAAc,MAAM,CAAC,CAAC,WAAW,EAAE,SAAS,OAAO,KAAK,EAAE;IAC3E,IAAI,MAAM,OAAO,SAAS,SAAS,GAEjC,OAAO,KAAK,QAAQ,OAAO,SAAS,MAAM,EAAE;SAG5C,OAAO,KAAK,QAAQ,QAAQ,KAAK;GAErC;EACF;CACF;;;;CAKA,YAAY,MAAoB,eAAe,MAAgC;EAC7E,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,MAAM,MAAM,KAAK,cAAc,MAAM,CAAC,CAAC,WAAW,EAAE,SAAS,OAAO,KAAK,EAAE;EAC3E,IAAI,QAAQ;OACN,cACF,OAAO;EAAA,OAEJ;GACL,MAAM,WAAW,KAAK,QAAQ,OAAO,SAAS,MAAM,EAAE;GACtD,IAAI,gBAAgB,SAAS,SAAS,QACpC,OAAO,KAAK,kBAAkB,QAAQ;GAGxC,OAAO;EACT;CACF;;;;CAKA,kBAAkB,MAA8C;EAC9D,MAAM,WAAW,KAAK,cAAc,IAAI;EACxC,MAAM,OAAO,SAAS,SAAS,SAAS,SAAS,SAAS,KAAK,KAAA;EAC/D,IAAI,MACF,OAAO,KAAK,kBAAkB,IAAI;EAGpC,OAAO;CACT;;;;CASA,QAAc;EACZ,MAAM,OAAO,KAAK,MAAM,MAAM,KAAK,MAAM;EACzC,KAAK,SAAS,SAAS;EACvB,IAAI,OAAO,KAAK,QAAQ,QAAQ;GAC9B,IAAI,QAAQ,GACT,KAAK,KAAK,KACb;EACF,CAAC;CACH;;;;CAKA,QAAQ,QAAsB,MAAqB,OAA8B;EAC/E,IAAI,CAAC,MAEH,OAAO;GAAE,IADE,IAAI,SAAS,OACf;GAAI,UAAU,CAAC;GAAG,MAAM,EAAE,MAAM,GAAG;EAAE;EAGhD,MAAM,YAAY;EAClB,IAAI,OAAO,KAAK,QAAQ,QAAQ;GAC9B,IAAI,MAAM,UAAU,MAAM;GAC1B,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS,QAAQ,GAAG,UAAU,EAAE;EACzE,CAAC;EACD,OAAO;CACT;;;;CAKA,WAAW,QAAsB,IAA4C;EAC3E,MAAM,OAAO,KAAK,MAAM,MAAM;EAC9B,IAAI,CAAC,MACH;EAGF,IAAI,OAAO,KAAK,QAAQ,QAAQ;GAC9B,OAAO,IAAI,MAAM,KAAK;EACxB,CAAC;EACD,MAAM,MAAM,OAAO,SAAS,WAAW,UAAU,UAAU,EAAE;EAC7D,IAAI,QAAQ,IACV,IAAI,OAAO,KAAK,aAAa;GAC3B,OAAO,SAAS,OAAO,KAAK,CAAC;EAC/B,CAAC;EAGH,OAAO;CACT;;;;CAKA,SAAS,MAAoB,MAAc,IAAiC;EAC1E,UAAU,QAAQ,KAAK,OAAO,KAAK,SAAS,QAAK,KAAA,GAAA;GAAA,YAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA,CAAA,4CAAA,EAAA;EAAA,CAAC;EAClD,UAAU,MAAM,KAAK,KAAK,KAAK,SAAS,QAAK,KAAA,GAAA;GAAA,YAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA;GAAA,GAAA,CAAA,wCAAA,EAAA;EAAA,CAAC;EAC9C,IAAI,SAAS,IACX,OAAO;EAGT,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,OAAO,KAAK,aAAa;GAC3B,KAAK,SAAS,OAAO,MAAM,CAAC;GAC5B,KAAK,SAAS,OAAO,IAAI,GAAG,KAAK;EACnC,CAAC;EACD,OAAO,KAAK,QAAQ,KAAK;CAC3B;;;;CAKA,WAAW,MAA0B;EACnC,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,IAAI,CAAC,QACH;EAGF,MAAM,MAAM,OAAO,SAAS,WAAW,UAAU,UAAU,KAAK,EAAE;EAClE,IAAI,MAAM,KAAK,OAAO,OAAO,SAAS,QACpC;EAGF,MAAM,WAAW,KAAK,QAAQ,OAAO,SAAS,MAAM,EAAE;EACtD,IAAI,OAAO,KAAK,aAAa;GAC3B,OAAO,SAAS,OAAO,KAAK,CAAC;GAC7B,SAAS,SAAS,KAAK,KAAK,EAAE;EAChC,CAAC;CACH;;;;CAKA,aAAa,MAA0B;EACrC,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,IAAI,CAAC,QACH;EAGF,MAAM,WAAW,KAAK,UAAU,MAAM;EACtC,IAAI,CAAC,UACH;EAIF,MAAM,UAAU,OAAO,SAAS,WAAW,OAAO,OAAO,KAAK,EAAE;EAChE,IAAI,OAAuB,CAAC;EAC5B,IAAI,OAAO,KAAK,aAAa;GAE3B,OADgB,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS,SAAS,OAClE,CAAA,CAAQ,MAAM,CAAC;EACxB,CAAC;EAGD,MAAM,YAAY,KAAK,cAAc,QAAQ,CAAC,CAAC,WAAW,MAAM,EAAE,OAAO,OAAO,EAAE;EAClF,IAAI,OAAO,KAAK,aAAa;GAC3B,SAAS,SAAS,OAAO,YAAY,GAAG,GAAG,KAAK,EAAE;EACpD,CAAC;EAGD,IAAI,OAAO,KAAK,aAAa;GAC3B,KAAK,SAAS,KAAK,GAAG,IAAI;EAC5B,CAAC;CACH;AACF"}