@dxos/graph 0.8.4-main.66e292d → 0.8.4-main.69d29f4

package/src/GraphModel.ts

@@ -0,0 +1,452 @@
+//
+// Copyright 2024 DXOS.org
+//
+
+import { Atom, type Registry } from '@effect-atom/atom-react';
+
+import { inspectCustom } from '@dxos/debug';
+import { failedInvariant, invariant } from '@dxos/invariant';
+import { type MakeOptional, isTruthy, removeBy } from '@dxos/util';
+
+import * as Graph from './Graph';
+
+/**
+ * Optional function to wrap mutations (e.g., for ECHO objects that require Obj.change).
+ */
+export type GraphChangeFunction = (fn: () => void) => void;
+
+/**
+ * Readonly Graph wrapper.
+ */
+export class ReadonlyGraphModel<
+  Node extends Graph.Node.Any = Graph.Node.Any,
+  Edge extends Graph.Edge.Any = Graph.Edge.Any,
+> {
+  protected readonly _graph: Graph.Graph<Node, Edge>;
+  /**
+   * Optional function to wrap mutations.
+   * When set, all graph mutations are wrapped in this function.
+   */
+  protected readonly _change?: GraphChangeFunction;
+
+  /**
+   * NOTE: Pass in simple Graph or Live.
+   * @param graph - The graph data.
+   * @param change - Optional function to wrap mutations (e.g., Obj.change for ECHO objects).
+   */
+  constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction) {
+    this._graph = graph ?? {
+      nodes: [],
+      edges: [],
+    };
+    this._change = change;
+  }
+
+  [inspectCustom]() {
+    return this.toJSON();
+  }
+
+  /**
+   * Return stable sorted JSON representation of graph.
+   */
+  toJSON() {
+    return {
+      nodes: this.nodes.length,
+      edges: this.edges.length,
+    };
+  }
+
+  get graph(): Graph.Graph<Node, Edge> {
+    return this._graph;
+  }
+
+  get nodes(): Node[] {
+    return this._graph.nodes;
+  }
+
+  get edges(): Edge[] {
+    return this._graph.edges;
+  }
+
+  //
+  // Nodes
+  //
+
+  findNode(id: string): Node | undefined {
+    return this.nodes.find((node) => node.id === id);
+  }
+
+  getNode(id: string): Node {
+    return this.findNode(id) ?? failedInvariant();
+  }
+
+  filterNodes({ type }: Partial<Graph.Node.Any> = {}): Node[] {
+    return this.nodes.filter((node) => !type || type === node.type);
+  }
+
+  //
+  // Edges
+  //
+
+  findEdge(id: string): Edge | undefined {
+    return this.edges.find((edge) => edge.id === id);
+  }
+
+  getEdge(id: string): Edge {
+    return this.findEdge(id) ?? failedInvariant();
+  }
+
+  filterEdges({ type, source, target }: Partial<Graph.Edge.Any> = {}): Edge[] {
+    return this.edges.filter(
+      (edge) =>
+        (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),
+    );
+  }
+
+  //
+  // Traverse
+  //
+
+  traverse(root: Node): Node[] {
+    return this._traverse(root);
+  }
+
+  private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {
+    if (visited.has(root.id)) {
+      return [];
+    }
+
+    visited.add(root.id);
+    const targets = this.filterEdges({ source: root.id })
+      .map((edge) => this.getNode(edge.target))
+      .filter(isTruthy);
+
+    return [root, ...targets.flatMap((target) => this._traverse(target, visited))];
+  }
+}
+
+/**
+ * Mutable Graph wrapper.
+ */
+export abstract class AbstractGraphModel<
+  Node extends Graph.Node.Any = Graph.Node.Any,
+  Edge extends Graph.Edge.Any = Graph.Edge.Any,
+  Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,
+  Builder extends AbstractBuilder<Node, Edge, Model> = AbstractBuilder<Node, Edge, Model>,
+> extends ReadonlyGraphModel<Node, Edge> {
+  /**
+   * Allows chaining.
+   */
+  abstract get builder(): Builder;
+
+  /**
+   * Shallow copy of provided graph.
+   */
+  abstract copy(graph?: Partial<Graph.Graph<Node, Edge>>): Model;
+
+  /**
+   * Execute a mutation on the graph.
+   * If a change function is set, wraps the mutation in it.
+   */
+  protected _mutate(fn: (graph: Graph.Graph<Node, Edge>) => void): void {
+    if (this._change != null) {
+      this._change(() => fn(this._graph));
+    } else {
+      fn(this._graph);
+    }
+  }
+
+  clear(): this {
+    this._mutate((graph) => {
+      graph.nodes.length = 0;
+      graph.edges.length = 0;
+    });
+    return this;
+  }
+
+  addGraph(graph: Model): this {
+    this.addNodes(graph.nodes);
+    this.addEdges(graph.edges);
+    return this;
+  }
+
+  addGraphs(graphs: Model[]): this {
+    graphs.forEach((graph) => {
+      this.addNodes(graph.nodes);
+      this.addEdges(graph.edges);
+    });
+    return this;
+  }
+
+  addNode(node: Node): Node {
+    invariant(node.id, 'ID is required');
+    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);
+    this._mutate((graph) => {
+      graph.nodes.push(node);
+    });
+    return node;
+  }
+
+  addNodes(nodes: Node[]): Node[] {
+    return nodes.map((node) => this.addNode(node));
+  }
+
+  addEdge(edge: MakeOptional<Edge, 'id'>): Edge {
+    invariant(edge.source);
+    invariant(edge.target);
+    if (!edge.id) {
+      // TODO(burdon): Generate random id.
+      edge = { id: Graph.createEdgeId(edge), ...edge };
+    }
+    invariant(!this.findNode(edge.id!));
+    this._mutate((graph) => {
+      graph.edges.push(edge as Edge);
+    });
+    return edge as Edge;
+  }
+
+  addEdges(edges: Edge[]): Edge[] {
+    return edges.map((edge) => this.addEdge(edge));
+  }
+
+  removeNode(id: string): Model {
+    let removedEdges: Edge[] = [];
+    let removedNodes: Node[] = [];
+    this._mutate((graph) => {
+      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);
+      removedNodes = removeBy<Node>(graph.nodes as Node[], (node) => node.id === id);
+    });
+    return this.copy({ nodes: removedNodes, edges: removedEdges });
+  }
+
+  removeNodes(ids: string[]): Model {
+    const graphs = ids.map((id) => this.removeNode(id));
+    return this.copy().addGraphs(graphs);
+  }
+
+  removeEdge(id: string): Model {
+    let removedEdges: Edge[] = [];
+    this._mutate((graph) => {
+      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.id === id);
+    });
+    return this.copy({ nodes: [], edges: removedEdges });
+  }
+
+  removeEdges(ids: string[]): Model {
+    const graphs = ids.map((id) => this.removeEdge(id));
+    return this.copy().addGraphs(graphs);
+  }
+}
+
+/**
+ * Chainable builder wrapper
+ */
+export abstract class AbstractBuilder<
+  Node extends Graph.Node.Any,
+  Edge extends Graph.Edge.Any,
+  Model extends GraphModel<Node, Edge>,
+> {
+  constructor(protected readonly _model: Model) {}
+
+  get model(): Model {
+    return this._model;
+  }
+
+  call(cb: (builder: this) => void): this {
+    cb(this);
+    return this;
+  }
+
+  getNode(id: string): Node {
+    return this.model.getNode(id);
+  }
+
+  addNode(node: Node): this {
+    this._model.addNode(node);
+    return this;
+  }
+
+  addEdge(edge: MakeOptional<Edge, 'id'>): this {
+    this._model.addEdge(edge);
+    return this;
+  }
+
+  addNodes(nodes: Node[]): this {
+    this._model.addNodes(nodes);
+    return this;
+  }
+
+  addEdges(edges: Edge[]): this {
+    this._model.addEdges(edges);
+    return this;
+  }
+}
+
+/**
+ * Basic model.
+ */
+export class GraphModel<
+  Node extends Graph.Node.Any = Graph.Node.Any,
+  Edge extends Graph.Edge.Any = Graph.Edge.Any,
+> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, Builder<Node, Edge>> {
+  override get builder() {
+    return new Builder<Node, Edge>(this);
+  }
+
+  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): GraphModel<Node, Edge> {
+    return new GraphModel<Node, Edge>(graph as Graph.Graph<Node, Edge>);
+  }
+}
+
+export type Subscription = <Node extends Graph.Node.Any = Graph.Node.Any, Edge extends Graph.Edge.Any = Graph.Edge.Any>(
+  model: ReactiveGraphModel<Node, Edge>,
+  graph: Graph.Graph<Node, Edge>,
+) => void;
+
+/**
+ * Basic reactive model using Effect Atoms.
+ */
+// NOTE: Unlike Preact Signals' `live()` which uses proxies for transparent reactivity,
+// Effect Atom requires explicit `registry.set()` calls. All mutation methods must be
+// overridden to update the atom immutably rather than mutating `_graph` directly.
+export class ReactiveGraphModel<
+  Node extends Graph.Node.Any = Graph.Node.Any,
+  Edge extends Graph.Edge.Any = Graph.Edge.Any,
+> extends GraphModel<Node, Edge> {
+  private readonly _graphAtom: Atom.Writable<Graph.Graph<Node, Edge>>;
+
+  constructor(
+    private readonly _registry: Registry.Registry,
+    graph?: Partial<Graph.Graph<Node, Edge>>,
+  ) {
+    const initialGraph: Graph.Graph<Node, Edge> = {
+      nodes: (graph?.nodes ?? []) as Node[],
+      edges: (graph?.edges ?? []) as Edge[],
+    };
+    super(initialGraph);
+    this._graphAtom = Atom.make<Graph.Graph<Node, Edge>>(initialGraph);
+  }
+
+  get registry(): Registry.Registry {
+    return this._registry;
+  }
+
+  /**
+   * Get the graph atom for reactive subscriptions.
+   */
+  get graphAtom(): Atom.Writable<Graph.Graph<Node, Edge>> {
+    return this._graphAtom;
+  }
+
+  override get graph(): Graph.Graph<Node, Edge> {
+    return this._registry.get(this._graphAtom);
+  }
+
+  override get nodes(): Node[] {
+    return this.graph.nodes;
+  }
+
+  override get edges(): Edge[] {
+    return this.graph.edges;
+  }
+
+  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): ReactiveGraphModel<Node, Edge> {
+    return new ReactiveGraphModel<Node, Edge>(this._registry, graph);
+  }
+
+  override clear(): this {
+    this._registry.set(this._graphAtom, {
+      nodes: [],
+      edges: [],
+    });
+    return this;
+  }
+
+  /**
+   * Set the entire graph at once, triggering a single notification.
+   */
+  setGraph(graph: Graph.Graph<Node, Edge>): this {
+    this._registry.set(this._graphAtom, graph);
+    return this;
+  }
+
+  override addNode(node: Node): Node {
+    invariant(node.id, 'ID is required');
+    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);
+    const current = this._registry.get(this._graphAtom);
+    this._registry.set(this._graphAtom, {
+      ...current,
+      nodes: [...current.nodes, node],
+    });
+    return node;
+  }
+
+  override addEdge(edge: MakeOptional<Edge, 'id'>): Edge {
+    invariant(edge.source);
+    invariant(edge.target);
+    if (!edge.id) {
+      edge = { id: Graph.createEdgeId(edge), ...edge };
+    }
+    invariant(!this.findNode(edge.id!));
+    const current = this._registry.get(this._graphAtom);
+    this._registry.set(this._graphAtom, {
+      ...current,
+      edges: [...current.edges, edge as Edge],
+    });
+    return edge as Edge;
+  }
+
+  override removeNode(id: string): ReactiveGraphModel<Node, Edge> {
+    const current = this._registry.get(this._graphAtom);
+    const removedEdges = current.edges.filter((edge) => edge.source === id || edge.target === id);
+    const removedNodes = current.nodes.filter((node) => node.id === id);
+
+    this._registry.set(this._graphAtom, {
+      nodes: current.nodes.filter((node) => node.id !== id),
+      edges: current.edges.filter((edge) => edge.source !== id && edge.target !== id),
+    });
+
+    return this.copy({ nodes: removedNodes, edges: removedEdges });
+  }
+
+  override removeEdge(id: string): ReactiveGraphModel<Node, Edge> {
+    const current = this._registry.get(this._graphAtom);
+    const removedEdges = current.edges.filter((edge) => edge.id === id);
+
+    this._registry.set(this._graphAtom, {
+      ...current,
+      edges: current.edges.filter((edge) => edge.id !== id),
+    });
+
+    return this.copy({ nodes: [], edges: removedEdges });
+  }
+
+  /**
+   * Subscribe to graph changes.
+   */
+  subscribe(cb: Subscription, fire = false): () => void {
+    if (fire) {
+      cb(this, this.graph);
+    }
+
+    // Prime the atom by reading before subscribing to avoid double-fire on first mutation.
+    this._registry.get(this._graphAtom);
+
+    return this._registry.subscribe(this._graphAtom, () => {
+      cb(this, this.graph);
+    });
+  }
+}
+
+/**
+ * Basic builder.
+ */
+export class Builder<
+  Node extends Graph.Node.Any = Graph.Node.Any,
+  Edge extends Graph.Edge.Any = Graph.Edge.Any,
+> extends AbstractBuilder<Node, Edge, GraphModel<Node, Edge>> {
+  override call(cb: (builder: this) => void): this {
+    cb(this);
+    return this;
+  }
+}

package/src/index.ts

@@ -2,7 +2,7 @@
 // Copyright 2023 DXOS.org
 //
 
-export * from './model';
 export * from './selection';
-export * from './types';
-export * from './util';
+
+export * as Graph from './Graph';
+export * as GraphModel from './GraphModel';

package/src/selection.ts

@@ -2,7 +2,7 @@
 // Copyright 2024 DXOS.org
 //
 
-import { type ReadonlySignal, type Signal, computed, signal } from '@preact/signals-core';
+import { Atom, Registry } from '@effect-atom/atom-react';
 
 import { invariant } from '@dxos/invariant';
 
@@ -10,61 +10,101 @@ import { invariant } from '@dxos/invariant';
  * Reactive selection model.
  */
 export class SelectionModel {
-  private readonly _selected: Signal<Set<string>> = signal(new Set<string>());
-  private readonly _selectedIds = computed(() => Array.from(this._selected.value.values()));
+  private readonly _registry: Registry.Registry;
+  private readonly _selected: Atom.Writable<Set<string>>;
 
-  constructor(private readonly _singleSelect: boolean = false) {}
+  constructor(private readonly _singleSelect: boolean = false) {
+    this._registry = Registry.make();
+    this._selected = Atom.make<Set<string>>(new Set<string>());
+  }
+
+  /**
+   * Returns the selected IDs atom for subscription.
+   */
+  get selected(): Atom.Atom<Set<string>> {
+    return this._selected;
+  }
+
+  /**
+   * Gets the current selected IDs as a Set.
+   */
+  getSelected(): Set<string> {
+    return this._registry.get(this._selected);
+  }
+
+  /**
+   * Gets the current selected IDs as an array.
+   */
+  getSelectedIds(): string[] {
+    return Array.from(this._registry.get(this._selected).values());
+  }
+
+  /**
+   * Subscribe to selection changes.
+   */
+  subscribe(cb: (selected: Set<string>) => void): () => void {
+    // Prime the atom by reading before subscribing.
+    this._registry.get(this._selected);
+
+    return this._registry.subscribe(this._selected, () => {
+      cb(this._registry.get(this._selected));
+    });
+  }
 
   toJSON(): { selected: string[] } {
     return {
-      selected: Array.from(this._selected.value.values()),
+      selected: this.getSelectedIds(),
     };
   }
 
-  get size(): number {
-    return this._selected.value.size;
-  }
-
-  get selected(): ReadonlySignal<string[]> {
-    return this._selectedIds;
+  /**
+   * Gets the current selection size.
+   */
+  getSize(): number {
+    return this._registry.get(this._selected).size;
   }
 
   contains(id: string): boolean {
-    return this._selected.value.has(id);
+    return this._registry.get(this._selected).has(id);
   }
 
   clear(): void {
-    this._selected.value = new Set();
+    this._registry.set(this._selected, new Set());
   }
 
   add(id: string): void {
     invariant(id);
-    this._selected.value = new Set<string>(
-      this._singleSelect ? [id] : [...Array.from(this._selected.value.values()), id],
+    const current = this._registry.get(this._selected);
+    this._registry.set(
+      this._selected,
+      new Set<string>(this._singleSelect ? [id] : [...Array.from(current.values()), id]),
     );
   }
 
   remove(id: string): void {
     invariant(id);
-    this._selected.value = new Set<string>(Array.from(this._selected.value.values()).filter((_id) => _id !== id));
+    const current = this._registry.get(this._selected);
+    this._registry.set(this._selected, new Set<string>(Array.from(current.values()).filter((_id) => _id !== id)));
   }
 
   // TODO(burdon): Handle single select.
 
-  setSelected(ids: string[], shift = false): void {
-    this._selected.value = new Set([...(shift ? Array.from(this._selected.value.values()) : []), ...ids]);
+  setSelected(ids: string[], subtract = false): void {
+    const current = this._registry.get(this._selected);
+    this._registry.set(this._selected, new Set([...(subtract ? Array.from(current.values()) : []), ...ids]));
   }
 
-  toggleSelected(ids: string[], shift = false): void {
-    const set = new Set<string>(shift ? Array.from(this._selected.value.values()) : undefined);
+  toggleSelected(ids: string[], subtract = false): void {
+    const current = this._registry.get(this._selected);
+    const set = new Set<string>(subtract ? Array.from(current.values()) : undefined);
     ids.forEach((id) => {
-      if (this._selected.value.has(id)) {
+      if (current.has(id)) {
         set.delete(id);
       } else {
         set.add(id);
       }
     });
 
-    this._selected.value = set;
+    this._registry.set(this._selected, set);
   }
 }

package/dist/types/src/model.d.ts

@@ -1,102 +0,0 @@
-import { inspectCustom } from '@dxos/debug';
-import { type Live } from '@dxos/live-object';
-import { type MakeOptional } from '@dxos/util';
-import { type BaseGraphEdge, type BaseGraphNode, type Graph, type GraphEdge, type GraphNode } from './types';
-/**
- * Readonly Graph wrapper.
- */
-export declare class ReadonlyGraphModel<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge> {
-    protected readonly _graph: Graph;
-    /**
-     * NOTE: Pass in simple Graph or Live.
-     */
-    constructor(graph?: Graph);
-    [inspectCustom](): {
-        nodes: number;
-        edges: number;
-    };
-    /**
-     * Return stable sorted JSON representation of graph.
-     */
-    toJSON(): {
-        nodes: number;
-        edges: number;
-    };
-    get graph(): Graph;
-    get nodes(): Node[];
-    get edges(): Edge[];
-    findNode(id: string): Node | undefined;
-    getNode(id: string): Node;
-    filterNodes({ type }?: Partial<GraphNode.Any>): Node[];
-    findEdge(id: string): Edge | undefined;
-    getEdge(id: string): Edge;
-    filterEdges({ type, source, target }?: Partial<GraphEdge>): Edge[];
-    traverse(root: Node): Node[];
-    private _traverse;
-}
-/**
- * Mutable Graph wrapper.
- */
-export declare abstract class AbstractGraphModel<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge, Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any, Builder extends AbstractGraphBuilder<Node, Edge, Model> = AbstractGraphBuilder<Node, Edge, Model>> extends ReadonlyGraphModel<Node, Edge> {
-    /**
-     * Allows chaining.
-     */
-    abstract get builder(): Builder;
-    /**
-     * Shallow copy of provided graph.
-     */
-    abstract copy(graph?: Partial<Graph>): Model;
-    clear(): this;
-    addGraph(graph: Model): this;
-    addGraphs(graphs: Model[]): this;
-    addNode(node: Node): Node;
-    addNodes(nodes: Node[]): Node[];
-    addEdge(edge: MakeOptional<Edge, 'id'>): Edge;
-    addEdges(edges: Edge[]): Edge[];
-    removeNode(id: string): Model;
-    removeNodes(ids: string[]): Model;
-    removeEdge(id: string): Model;
-    removeEdges(ids: string[]): Model;
-}
-/**
- * Chainable builder wrapper
- */
-export declare abstract class AbstractGraphBuilder<Node extends BaseGraphNode, Edge extends BaseGraphEdge, Model extends GraphModel<Node, Edge>> {
-    protected readonly _model: Model;
-    constructor(_model: Model);
-    get model(): Model;
-    call(cb: (builder: this) => void): this;
-    getNode(id: string): Node;
-    addNode(node: Node): this;
-    addEdge(edge: MakeOptional<Edge, 'id'>): this;
-    addNodes(nodes: Node[]): this;
-    addEdges(edges: Edge[]): this;
-}
-/**
- * Basic model.
- */
-export declare class GraphModel<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {
-    get builder(): GraphBuilder<Node, Edge>;
-    copy(graph?: Partial<Graph>): GraphModel<Node, Edge>;
-}
-export type GraphModelSubscription = (model: GraphModel, graph: Live<Graph>) => void;
-/**
- * Subscription.
- * NOTE: Requires `registerSignalsRuntime` to be called.
- */
-export declare const subscribe: (model: GraphModel, cb: GraphModelSubscription, fire?: boolean) => () => void;
-/**
- * Basic reactive model.
- */
-export declare class ReactiveGraphModel<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge> extends GraphModel<Node, Edge> {
-    constructor(graph?: Partial<Graph>);
-    copy(graph?: Partial<Graph>): ReactiveGraphModel<Node, Edge>;
-    subscribe(cb: GraphModelSubscription, fire?: boolean): () => void;
-}
-/**
- * Basic builder.
- */
-export declare class GraphBuilder<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {
-    call(cb: (builder: this) => void): this;
-}
-//# sourceMappingURL=model.d.ts.map

package/dist/types/src/model.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../../src/model.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,OAAO,EAAE,KAAK,IAAI,EAAQ,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,KAAK,YAAY,EAAsB,MAAM,YAAY,CAAC;AAEnE,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,aAAa,EAAE,KAAK,KAAK,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,SAAS,CAAC;AAG7G;;GAEG;AACH,qBAAa,kBAAkB,CAC7B,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,IAAI,SAAS,aAAa,GAAG,aAAa;IAE1C,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;IAEjC;;OAEG;gBACS,KAAK,CAAC,EAAE,KAAK;IAOzB,CAAC,aAAa,CAAC;;;;IAIf;;OAEG;IACH,MAAM;;;;IAON,IAAI,KAAK,IAAI,KAAK,CAEjB;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAMD,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAItC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAIzB,WAAW,CAAC,EAAE,IAAI,EAAE,GAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAM,GAAG,IAAI,EAAE;IAQ1D,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAItC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAIzB,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAE,OAAO,CAAC,SAAS,CAAM,GAAG,IAAI,EAAE;IAWtE,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE;IAI5B,OAAO,CAAC,SAAS;CAYlB;AAED;;GAEG;AACH,8BAAsB,kBAAkB,CACtC,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,KAAK,SAAS,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,GAAG,EAClE,OAAO,SAAS,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CACjG,SAAQ,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC;IACtC;;OAEG;IACH,QAAQ,KAAK,OAAO,IAAI,OAAO,CAAC;IAEhC;;OAEG;IACH,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK;IAE5C,KAAK,IAAI,IAAI;IAMb,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;IAM5B,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI;IAQhC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAOzB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE;IAI/B,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI;IAY7C,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE;IAI/B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK;IAM7B,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,KAAK;IAKjC,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK;IAK7B,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,KAAK;CAIlC;AAED;;GAEG;AACH,8BAAsB,oBAAoB,CACxC,IAAI,SAAS,aAAa,EAC1B,IAAI,SAAS,aAAa,EAC1B,KAAK,SAAS,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAExB,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK;gBAAb,MAAM,EAAE,KAAK;IAE5C,IAAI,KAAK,IAAI,KAAK,CAEjB;IAED,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAKvC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAIzB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAKzB,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI;IAK7C,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;IAK7B,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;CAI9B;AAED;;GAEG;AACH,qBAAa,UAAU,CACrB,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,IAAI,SAAS,aAAa,GAAG,aAAa,CAC1C,SAAQ,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxF,IAAa,OAAO,6BAEnB;IAEQ,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;CAG9D;AAED,MAAM,MAAM,sBAAsB,GAAG,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC;AAErF;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,OAAO,UAAU,EAAE,IAAI,sBAAsB,EAAE,cAAY,eAQpF,CAAC;AAEF;;GAEG;AACH,qBAAa,kBAAkB,CAC7B,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,IAAI,SAAS,aAAa,GAAG,aAAa,CAC1C,SAAQ,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;gBAClB,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC;IASzB,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC;IAIrE,SAAS,CAAC,EAAE,EAAE,sBAAsB,EAAE,IAAI,UAAQ,GAAG,MAAM,IAAI;CAGhE;AAED;;GAEG;AACH,qBAAa,YAAY,CACvB,IAAI,SAAS,aAAa,GAAG,aAAa,EAC1C,IAAI,SAAS,aAAa,GAAG,aAAa,CAC1C,SAAQ,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvD,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;CAIjD"}