data-structure-typed 2.1.0 → 2.1.1

package/dist/cjs/data-structures/graph/map-graph.js

@@ -1,108 +0,0 @@
-"use strict";
-/**
- * data-structure-typed
- *
- * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MapGraph = exports.MapEdge = exports.MapVertex = void 0;
-const directed_graph_1 = require("./directed-graph");
-class MapVertex extends directed_graph_1.DirectedVertex {
-    constructor(key, value, lat, long) {
-        super(key, value);
-        this.lat = lat;
-        this.long = long;
-    }
-}
-exports.MapVertex = MapVertex;
-class MapEdge extends directed_graph_1.DirectedEdge {
-    constructor(src, dest, weight, value) {
-        super(src, dest, weight, value);
-    }
-}
-exports.MapEdge = MapEdge;
-/**
- * Directed graph variant carrying geospatial coordinates.
- * @template V - Vertex value type.
- * @template E - Edge value type.
- * @template VO - Concrete vertex class (MapVertex<V>).
- * @template EO - Concrete edge class (MapEdge<E>).
- * @remarks Time O(1), Space O(1)
- * @example examples will be generated by unit test
- */
-class MapGraph extends directed_graph_1.DirectedGraph {
-    /**
-     * Construct a MapGraph.
-     * @param originCoord - Origin coordinate `[lat, long]` used as default.
-     * @param bottomRight - Optional bottom-right coordinate for bounding boxes.
-     * @remarks Time O(1), Space O(1)
-     */
-    constructor(originCoord, bottomRight) {
-        super();
-        this._originCoord = [0, 0];
-        this._originCoord = originCoord;
-        this._bottomRight = bottomRight;
-    }
-    get originCoord() {
-        return this._originCoord;
-    }
-    get bottomRight() {
-        return this._bottomRight;
-    }
-    /**
-     * Create a map vertex with optional coordinates.
-     * @param key - Vertex identifier.
-     * @param value - Optional payload.
-     * @param lat - Latitude (defaults to `originCoord[0]`).
-     * @param long - Longitude (defaults to `originCoord[1]`).
-     * @returns MapVertex instance.
-     * @remarks Time O(1), Space O(1)
-     */
-    createVertex(key, value, lat = this.originCoord[0], long = this.originCoord[1]) {
-        return new MapVertex(key, value, lat, long);
-    }
-    /**
-     * Create a map edge (directed) with optional weight/value.
-     * @param src - Source key.
-     * @param dest - Destination key.
-     * @param weight - Edge weight.
-     * @param value - Edge payload.
-     * @returns MapEdge instance.
-     * @remarks Time O(1), Space O(1)
-     */
-    createEdge(src, dest, weight, value) {
-        return new MapEdge(src, dest, weight, value);
-    }
-    /**
-     * Deep clone as the same concrete class.
-     * @returns A new graph of the same concrete class (`this` type).
-     * @remarks Time O(V + E), Space O(V + E)
-     */
-    clone() {
-        return super.clone();
-    }
-    /**
-     * Include `originCoord` and `bottomRight` so `clone()/filter()` preserve geospatial settings.
-     * @returns Options bag extending super snapshot.
-     * @remarks Time O(1), Space O(1)
-     */
-    _snapshotOptions() {
-        return Object.assign(Object.assign({}, super._snapshotOptions()), { originCoord: this.originCoord, bottomRight: this.bottomRight });
-    }
-    /**
-     * Re-create a same-species MapGraph instance from snapshot options.
-     * @param options - Snapshot options providing `originCoord`/`bottomRight`.
-     * @returns Empty MapGraph instance of `this` type.
-     * @remarks Time O(1), Space O(1)
-     */
-    _createInstance(options) {
-        const { originCoord, bottomRight } = (options || {});
-        const oc = (originCoord !== null && originCoord !== void 0 ? originCoord : this.originCoord);
-        const br = (bottomRight !== null && bottomRight !== void 0 ? bottomRight : this.bottomRight);
-        return new MapGraph(oc, br);
-    }
-}
-exports.MapGraph = MapGraph;
-//# sourceMappingURL=map-graph.js.map

package/dist/cjs/data-structures/graph/map-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"map-graph.js","sourceRoot":"","sources":["../../../../src/data-structures/graph/map-graph.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAGH,qDAA+E;AAE/E,MAAa,SAAmB,SAAQ,+BAAiB;IAIvD,YAAY,GAAc,EAAE,KAAQ,EAAE,GAAW,EAAE,IAAY;QAC7D,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AATD,8BASC;AAED,MAAa,OAAiB,SAAQ,6BAAe;IACnD,YAAY,GAAc,EAAE,IAAe,EAAE,MAAe,EAAE,KAAS;QACrE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;CACF;AAJD,0BAIC;AAED;;;;;;;;GAQG;AACH,MAAa,QAKX,SAAQ,8BAA2B;IACnC;;;;;OAKG;IACH,YAAY,WAA+B,EAAE,WAAgC;QAC3E,KAAK,EAAE,CAAC;QAKA,iBAAY,GAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAJlD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IAID,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAID,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACM,YAAY,CACnB,GAAc,EACd,KAAS,EACT,MAAc,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EACjC,OAAe,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAElC,OAAO,IAAI,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAO,CAAC;IACpD,CAAC;IAED;;;;;;;;OAQG;IACM,UAAU,CAAC,GAAc,EAAE,IAAe,EAAE,MAAe,EAAE,KAAS;QAC7E,OAAO,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAO,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACM,KAAK;QACZ,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACgB,gBAAgB;QACjC,uCAAa,KAAK,CAAC,gBAAgB,EAAU,KAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,IAAG;IAChH,CAAC;IAED;;;;;OAKG;IACgB,eAAe,CAAC,OAA0C;QAC3E,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAGlD,CAAC;QACF,MAAM,EAAE,GAAG,CAAC,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,IAAI,CAAC,WAAW,CAAqB,CAAC;QACjE,MAAM,EAAE,GAAG,CAAC,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,IAAI,CAAC,WAAW,CAAiC,CAAC;QAC7E,OAAO,IAAI,QAAQ,CAAe,EAAE,EAAE,EAAE,CAAS,CAAC;IACpD,CAAC;CACF;AA9FD,4BA8FC"}

package/dist/cjs/data-structures/graph/undirected-graph.js

@@ -1,425 +0,0 @@
-"use strict";
-/**
- * data-structure-typed
- *
- * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
-const abstract_graph_1 = require("./abstract-graph");
-const utils_1 = require("../../utils");
-class UndirectedVertex extends abstract_graph_1.AbstractVertex {
-    constructor(key, value) {
-        super(key, value);
-    }
-}
-exports.UndirectedVertex = UndirectedVertex;
-class UndirectedEdge extends abstract_graph_1.AbstractEdge {
-    constructor(v1, v2, weight, value) {
-        super(weight, value);
-        this.endpoints = [v1, v2];
-    }
-}
-exports.UndirectedEdge = UndirectedEdge;
-/**
- * Undirected graph implementation.
- * @template V - Vertex value type.
- * @template E - Edge value type.
- * @template VO - Concrete vertex class (extends AbstractVertex<V>).
- * @template EO - Concrete edge class (extends AbstractEdge<E>).
- * @remarks Time O(1), Space O(1)
- * @example examples will be generated by unit test
- */
-class UndirectedGraph extends abstract_graph_1.AbstractGraph {
-    /**
-     * Construct an undirected graph with runtime defaults.
-     * @param options - `GraphOptions<V>` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
-     * @remarks Time O(1), Space O(1)
-     */
-    constructor(options) {
-        super(options);
-        this._edgeMap = new Map();
-    }
-    get edgeMap() {
-        return this._edgeMap;
-    }
-    set edgeMap(v) {
-        this._edgeMap = v;
-    }
-    /**
-     * Construct an undirected graph from keys with value initializer `v => v`.
-     * @template K - Vertex key type.
-     * @param keys - Iterable of vertex keys.
-     * @returns UndirectedGraph with all keys added.
-     * @remarks Time O(V), Space O(V)
-     */
-    static fromKeys(keys) {
-        const g = new UndirectedGraph({
-            vertexValueInitializer: (k) => k
-        });
-        for (const k of keys)
-            g.addVertex(k);
-        return g;
-    }
-    /**
-     * Construct an undirected graph from `[key, value]` entries.
-     * @template V - Vertex value type.
-     * @param entries - Iterable of `[key, value]` pairs.
-     * @returns UndirectedGraph with all vertices added.
-     * @remarks Time O(V), Space O(V)
-     */
-    static fromEntries(entries) {
-        const g = new UndirectedGraph();
-        for (const [k, v] of entries)
-            g.addVertex(k, v);
-        return g;
-    }
-    /**
-     * Create an undirected vertex instance. Does not insert into the graph.
-     * @param key - Vertex identifier.
-     * @param value - Optional payload.
-     * @returns Concrete vertex instance.
-     * @remarks Time O(1), Space O(1)
-     */
-    createVertex(key, value) {
-        return new UndirectedVertex(key, value);
-    }
-    /**
-     * Create an undirected edge instance. Does not insert into the graph.
-     * @param v1 - One endpoint key.
-     * @param v2 - The other endpoint key.
-     * @param weight - Edge weight; defaults to `defaultEdgeWeight`.
-     * @param value - Edge payload.
-     * @returns Concrete edge instance.
-     * @remarks Time O(1), Space O(1)
-     */
-    createEdge(v1, v2, weight, value) {
-        var _a;
-        return new UndirectedEdge(v1, v2, (_a = weight !== null && weight !== void 0 ? weight : this.options.defaultEdgeWeight) !== null && _a !== void 0 ? _a : 1, value);
-    }
-    /**
-     * Get an undirected edge between two vertices, if present.
-     * @param v1 - One vertex or key.
-     * @param v2 - The other vertex or key.
-     * @returns Edge instance or `undefined`.
-     * @remarks Time O(1) avg, Space O(1)
-     */
-    getEdge(v1, v2) {
-        var _a;
-        let edgeMap = [];
-        if (v1 !== undefined && v2 !== undefined) {
-            const vertex1 = this._getVertex(v1);
-            const vertex2 = this._getVertex(v2);
-            if (vertex1 && vertex2) {
-                edgeMap = (_a = this._edgeMap.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(e => e.endpoints.includes(vertex2.key));
-            }
-        }
-        return edgeMap ? edgeMap[0] || undefined : undefined;
-    }
-    /**
-     * Delete a single undirected edge between two vertices.
-     * @param v1 - One vertex or key.
-     * @param v2 - The other vertex or key.
-     * @returns Removed edge or `undefined`.
-     * @remarks Time O(1) avg, Space O(1)
-     */
-    deleteEdgeBetween(v1, v2) {
-        const vertex1 = this._getVertex(v1);
-        const vertex2 = this._getVertex(v2);
-        if (!vertex1 || !vertex2) {
-            return undefined;
-        }
-        const v1Edges = this._edgeMap.get(vertex1);
-        let removed = undefined;
-        if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.endpoints.includes(vertex2.key))[0] || undefined;
-        }
-        const v2Edges = this._edgeMap.get(vertex2);
-        if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, (e) => e.endpoints.includes(vertex1.key));
-        }
-        return removed;
-    }
-    /**
-     * Delete an edge by instance or by a pair of keys.
-     * @param edgeOrOneSideVertexKey - Edge instance or one endpoint vertex/key.
-     * @param otherSideVertexKey - Required second endpoint when deleting by pair.
-     * @returns Removed edge or `undefined`.
-     * @remarks Time O(1) avg, Space O(1)
-     */
-    deleteEdge(edgeOrOneSideVertexKey, otherSideVertexKey) {
-        let oneSide, otherSide;
-        if (this.isVertexKey(edgeOrOneSideVertexKey)) {
-            if (this.isVertexKey(otherSideVertexKey)) {
-                oneSide = this._getVertex(edgeOrOneSideVertexKey);
-                otherSide = this._getVertex(otherSideVertexKey);
-            }
-            else {
-                return;
-            }
-        }
-        else {
-            oneSide = this._getVertex(edgeOrOneSideVertexKey.endpoints[0]);
-            otherSide = this._getVertex(edgeOrOneSideVertexKey.endpoints[1]);
-        }
-        if (oneSide && otherSide) {
-            return this.deleteEdgeBetween(oneSide, otherSide);
-        }
-        else {
-            return;
-        }
-    }
-    /**
-     * Delete a vertex and remove it from all neighbor lists.
-     * @param vertexOrKey - Vertex or key.
-     * @returns `true` if removed; otherwise `false`.
-     * @remarks Time O(deg), Space O(1)
-     */
-    deleteVertex(vertexOrKey) {
-        let vertexKey;
-        let vertex;
-        if (this.isVertexKey(vertexOrKey)) {
-            vertex = this.getVertex(vertexOrKey);
-            vertexKey = vertexOrKey;
-        }
-        else {
-            vertex = vertexOrKey;
-            vertexKey = this._getVertexKey(vertexOrKey);
-        }
-        /**
-         * All neighbors connected via undirected edges.
-         * @param vertexOrKey - Vertex or key.
-         * @returns Array of neighbor vertices.
-         * @remarks Time O(deg), Space O(deg)
-         */
-        const neighbors = this.getNeighbors(vertexOrKey);
-        if (vertex) {
-            neighbors.forEach(neighbor => {
-                const neighborEdges = this._edgeMap.get(neighbor);
-                if (neighborEdges) {
-                    const restEdges = neighborEdges.filter(edge => {
-                        return !edge.endpoints.includes(vertexKey);
-                    });
-                    this._edgeMap.set(neighbor, restEdges);
-                }
-            });
-            this._edgeMap.delete(vertex);
-        }
-        return this._vertexMap.delete(vertexKey);
-    }
-    /**
-     * Degree of a vertex (# of incident undirected edges).
-     * @param vertexOrKey - Vertex or key.
-     * @returns Non-negative integer.
-     * @remarks Time O(1) avg, Space O(1)
-     */
-    degreeOf(vertexOrKey) {
-        var _a;
-        const vertex = this._getVertex(vertexOrKey);
-        if (vertex) {
-            return ((_a = this._edgeMap.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
-        }
-        else {
-            return 0;
-        }
-    }
-    /**
-     * Incident undirected edges of a vertex.
-     * @param vertexOrKey - Vertex or key.
-     * @returns Array of incident edges.
-     * @remarks Time O(deg), Space O(deg)
-     */
-    edgesOf(vertexOrKey) {
-        const vertex = this._getVertex(vertexOrKey);
-        if (vertex) {
-            return this._edgeMap.get(vertex) || [];
-        }
-        else {
-            return [];
-        }
-    }
-    /**
-     * Unique set of undirected edges across endpoints.
-     * @returns Array of edges.
-     * @remarks Time O(E), Space O(E)
-     */
-    edgeSet() {
-        const edgeSet = new Set();
-        this._edgeMap.forEach(edgeMap => {
-            edgeMap.forEach(edge => {
-                edgeSet.add(edge);
-            });
-        });
-        return [...edgeSet];
-    }
-    getNeighbors(vertexOrKey) {
-        const neighbors = [];
-        const vertex = this._getVertex(vertexOrKey);
-        if (vertex) {
-            const neighborEdges = this.edgesOf(vertex);
-            for (const edge of neighborEdges) {
-                const neighbor = this._getVertex(edge.endpoints.filter(e => e !== vertex.key)[0]);
-                if (neighbor) {
-                    neighbors.push(neighbor);
-                }
-            }
-        }
-        return neighbors;
-    }
-    /**
-     * Resolve an edge's two endpoints to vertex instances.
-     * @param edge - Edge instance.
-     * @returns `[v1, v2]` or `undefined` if either endpoint is missing.
-     * @remarks Time O(1), Space O(1)
-     */
-    getEndsOfEdge(edge) {
-        if (!this.hasEdge(edge.endpoints[0], edge.endpoints[1])) {
-            return undefined;
-        }
-        const v1 = this._getVertex(edge.endpoints[0]);
-        const v2 = this._getVertex(edge.endpoints[1]);
-        if (v1 && v2) {
-            return [v1, v2];
-        }
-        else {
-            return undefined;
-        }
-    }
-    /**
-     * Whether the graph has no vertices and no edges.
-     * @remarks Time O(1), Space O(1)
-     */
-    isEmpty() {
-        return this.vertexMap.size === 0 && this.edgeMap.size === 0;
-    }
-    /**
-     * Remove all vertices and edges.
-     * @remarks Time O(V + E), Space O(1)
-     */
-    clear() {
-        this._vertexMap = new Map();
-        this._edgeMap = new Map();
-    }
-    /**
-     * Deep clone as the same concrete class.
-     * @returns A new graph of the same concrete class (`this` type).
-     * @remarks Time O(V + E), Space O(V + E)
-     */
-    clone() {
-        return super.clone();
-    }
-    /**
-     * Tarjan-based bridge and articulation point detection.
-     * @returns `{ dfnMap, lowMap, bridges, cutVertices }`.
-     * @remarks Time O(V + E), Space O(V + E)
-     */
-    tarjan() {
-        const dfnMap = new Map();
-        const lowMap = new Map();
-        const bridges = [];
-        const cutVertices = [];
-        let time = 0;
-        const dfs = (vertex, parent) => {
-            dfnMap.set(vertex, time);
-            lowMap.set(vertex, time);
-            time++;
-            const neighbors = this.getNeighbors(vertex);
-            let childCount = 0;
-            for (const neighbor of neighbors) {
-                if (!dfnMap.has(neighbor)) {
-                    childCount++;
-                    dfs(neighbor, vertex);
-                    lowMap.set(vertex, Math.min(lowMap.get(vertex), lowMap.get(neighbor)));
-                    if (lowMap.get(neighbor) > dfnMap.get(vertex)) {
-                        // Found a bridge
-                        const edge = this.getEdge(vertex, neighbor);
-                        if (edge) {
-                            bridges.push(edge);
-                        }
-                    }
-                    if (parent !== undefined && lowMap.get(neighbor) >= dfnMap.get(vertex)) {
-                        // Found an articulation point
-                        cutVertices.push(vertex);
-                    }
-                }
-                else if (neighbor !== parent) {
-                    lowMap.set(vertex, Math.min(lowMap.get(vertex), dfnMap.get(neighbor)));
-                }
-            }
-            if (parent === undefined && childCount > 1) {
-                // Special case for root in DFS tree
-                cutVertices.push(vertex);
-            }
-        };
-        for (const vertex of this.vertexMap.values()) {
-            if (!dfnMap.has(vertex)) {
-                dfs(vertex, undefined);
-            }
-        }
-        return {
-            dfnMap,
-            lowMap,
-            bridges,
-            cutVertices
-        };
-    }
-    /**
-     * Get bridges discovered by `tarjan()`.
-     * @returns Array of edges that are bridges.
-     * @remarks Time O(B), Space O(1)
-     */
-    getBridges() {
-        return this.tarjan().bridges;
-    }
-    /**
-     * Get articulation points discovered by `tarjan()`.
-     * @returns Array of cut vertices.
-     * @remarks Time O(C), Space O(1)
-     */
-    getCutVertices() {
-        return this.tarjan().cutVertices;
-    }
-    /**
-     * DFN index map computed by `tarjan()`.
-     * @returns Map from vertex to DFN index.
-     * @remarks Time O(V), Space O(V)
-     */
-    getDFNMap() {
-        return this.tarjan().dfnMap;
-    }
-    /**
-     * LOW link map computed by `tarjan()`.
-     * @returns Map from vertex to LOW value.
-     * @remarks Time O(V), Space O(V)
-     */
-    getLowMap() {
-        return this.tarjan().lowMap;
-    }
-    /**
-     * Internal hook to attach an undirected edge into adjacency maps.
-     * @param edge - Edge instance.
-     * @returns `true` if both endpoints exist; otherwise `false`.
-     * @remarks Time O(1) avg, Space O(1)
-     */
-    _addEdge(edge) {
-        for (const end of edge.endpoints) {
-            const endVertex = this._getVertex(end);
-            if (endVertex === undefined)
-                return false;
-            if (endVertex) {
-                const edgeMap = this._edgeMap.get(endVertex);
-                if (edgeMap) {
-                    edgeMap.push(edge);
-                }
-                else {
-                    this._edgeMap.set(endVertex, [edge]);
-                }
-            }
-        }
-        return true;
-    }
-}
-exports.UndirectedGraph = UndirectedGraph;
-//# sourceMappingURL=undirected-graph.js.map

package/dist/cjs/data-structures/graph/undirected-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"undirected-graph.js","sourceRoot":"","sources":["../../../../src/data-structures/graph/undirected-graph.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAIH,qDAA+E;AAC/E,uCAA0C;AAE1C,MAAa,gBAA0B,SAAQ,+BAAiB;IAC9D,YAAY,GAAc,EAAE,KAAS;QACnC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACpB,CAAC;CACF;AAJD,4CAIC;AAED,MAAa,cAA2B,SAAQ,6BAAe;IAG7D,YAAY,EAAa,EAAE,EAAa,EAAE,MAAe,EAAE,KAAS;QAClE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;CACF;AAPD,wCAOC;AAED;;;;;;;;GAQG;AACH,MAAa,eAMX,SAAQ,8BAA2B;IAGnC;;;;OAIG;IACH,YAAY,OAAkC;QAC5C,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAY,CAAC;IACtC,CAAC;IAID,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,OAAO,CAAC,CAAgB;QAC1B,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,QAAQ,CACb,IAAiB;QAEjB,MAAM,CAAC,GAAsE,IAAI,eAAe,CAAS;YACvG,sBAAsB,EAAE,CAAC,CAAY,EAAE,EAAE,CAAC,CAAM;SACjD,CAAC,CAAC;QACH,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,CAChB,OAAiC;QAEjC,MAAM,CAAC,GAAsE,IAAI,eAAe,EAAU,CAAC;QAC3G,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;YAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,GAAc,EAAE,KAAmB;QAC9C,OAAO,IAAI,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAO,CAAC;IAChD,CAAC;IAED;;;;;;;;OAQG;IACM,UAAU,CAAC,EAAa,EAAE,EAAa,EAAE,MAAe,EAAE,KAAmB;;QACpF,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,MAAA,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,IAAI,CAAC,OAAO,CAAC,iBAAiB,mCAAI,CAAC,EAAE,KAAK,CAAO,CAAC;IAChG,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,EAA8B,EAAE,EAA8B;;QACpE,IAAI,OAAO,GAAqB,EAAE,CAAC;QAEnC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACzC,MAAM,OAAO,GAAmB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpD,MAAM,OAAO,GAAmB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAEpD,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;gBACvB,OAAO,GAAG,MAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,0CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAkB,EAAE,EAAkB;QACtD,MAAM,OAAO,GAAmB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpD,MAAM,OAAO,GAAmB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAEpD,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,OAAO,GAAmB,SAAS,CAAC;QACxC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,GAAG,IAAA,mBAAW,EAAK,OAAO,EAAE,CAAC,CAAK,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;QACnG,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,OAAO,EAAE,CAAC;YACZ,IAAA,mBAAW,EAAK,OAAO,EAAE,CAAC,CAAK,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,sBAAsC,EAAE,kBAA8B;QAC/E,IAAI,OAAuB,EAAE,SAAyB,CAAC;QACvD,IAAI,IAAI,CAAC,WAAW,CAAC,sBAAsB,CAAC,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;gBAClD,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,OAAO;YACT,CAAC;QACH,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/D,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,OAAO;QACT,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,WAA2B;QACtC,IAAI,SAAoB,CAAC;QACzB,IAAI,MAAsB,CAAC;QAC3B,IAAI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YACrC,SAAS,GAAG,WAAW,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,WAAW,CAAC;YACrB,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAC9C,CAAC;QAED;;;;;WAKG;QACH,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QAEjD,IAAI,MAAM,EAAE,CAAC;YACX,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;gBAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClD,IAAI,aAAa,EAAE,CAAC;oBAClB,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;wBAC5C,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;oBAC7C,CAAC,CAAC,CAAC;oBACH,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,WAA2B;;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,CAAA,MAAA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,0CAAE,MAAM,KAAI,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,WAA2B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,MAAM,OAAO,GAAY,IAAI,GAAG,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC9B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;IACtB,CAAC;IAED,YAAY,CAAC,WAA2B;QACtC,MAAM,SAAS,GAAS,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC3C,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClF,IAAI,QAAQ,EAAE,CAAC;oBACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAQ;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;QAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAY,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACM,KAAK;QACZ,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,MAAM;QACJ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;QACrC,MAAM,OAAO,GAAS,EAAE,CAAC;QACzB,MAAM,WAAW,GAAS,EAAE,CAAC;QAE7B,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,MAAM,GAAG,GAAG,CAAC,MAAU,EAAE,MAAsB,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,EAAE,CAAC;YAEP,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC1B,UAAU,EAAE,CAAC;oBACb,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;oBAEzE,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;wBAChD,iBAAiB;wBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;wBAC5C,IAAI,IAAI,EAAE,CAAC;4BACT,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACrB,CAAC;oBACH,CAAC;oBAED,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;wBACzE,8BAA8B;wBAC9B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;qBAAM,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;YAED,IAAI,MAAM,KAAK,SAAS,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBAC3C,oCAAoC;gBACpC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,MAAM;YACN,OAAO;YACP,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,WAAW,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,IAAQ;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,SAAS,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC1C,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC7C,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA7aD,0CA6aC"}