@nshiab/simple-data-analysis-core 2.0.8 → 2.1.0

package/script/methods/degree.js

@@ -0,0 +1,141 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = degree;
+const getGraphEndpointColumns_js_1 = __importDefault(require("../helpers/getGraphEndpointColumns.js"));
+const getGraphWeightColumn_js_1 = __importDefault(require("../helpers/getGraphWeightColumn.js"));
+const prepareGraphTraversal_js_1 = require("../helpers/prepareGraphTraversal.js");
+const queueGraphResult_js_1 = __importDefault(require("../helpers/queueGraphResult.js"));
+const quoteIdentifier_js_1 = __importDefault(require("../helpers/quoteIdentifier.js"));
+function degree(simpleTable, sourceColumn, targetColumn, options = {}) {
+    if (typeof sourceColumn !== "string") {
+        throw new TypeError("degree() sourceColumn must be a string.");
+    }
+    if (typeof targetColumn !== "string") {
+        throw new TypeError("degree() targetColumn must be a string.");
+    }
+    if (options === null || typeof options !== "object" || Array.isArray(options)) {
+        throw new TypeError("degree() options must be an object.");
+    }
+    if (options.count !== undefined &&
+        !["edges", "neighbors"].includes(options.count)) {
+        throw new TypeError('degree() options.count must be "edges" or "neighbors".');
+    }
+    if (options.weight !== undefined && typeof options.weight !== "string") {
+        throw new TypeError("degree() options.weight must be a string.");
+    }
+    if (options.outputTable !== undefined &&
+        typeof options.outputTable !== "string" &&
+        typeof options.outputTable !== "boolean") {
+        throw new TypeError("degree() options.outputTable must be a string or boolean.");
+    }
+    if (options.weight !== undefined && options.count === "neighbors") {
+        throw new TypeError('degree() options.weight cannot be combined with count: "neighbors" because weighted sums operate on edges, not distinct neighbors.');
+    }
+    options = structuredClone(options);
+    const count = options.count ?? "edges";
+    const weight = options.weight;
+    const parameters = { sourceColumn, targetColumn, options };
+    return (0, queueGraphResult_js_1.default)(simpleTable, {
+        method: "degree()",
+        parameters,
+        outputTable: options.outputTable,
+        values: (schema) => {
+            validateInputs(schema, sourceColumn, targetColumn, weight);
+            return [];
+        },
+        buildSelect: (input, schema) => degreeSelect(input, schema, sourceColumn, targetColumn, count, weight),
+        outputSchema: (schema) => {
+            const validated = validateInputs(schema, sourceColumn, targetColumn, weight);
+            return {
+                node: validated.idType,
+                incoming: validated.degreeType,
+                outgoing: validated.degreeType,
+                total: validated.degreeType,
+            };
+        },
+    });
+}
+function validateInputs(schema, source, target, weight) {
+    const endpoints = (0, getGraphEndpointColumns_js_1.default)(schema, source, target, "degree()");
+    const degreeType = weight === undefined
+        ? "BIGINT"
+        : sumType((0, getGraphWeightColumn_js_1.default)(schema, weight, "degree()").distanceType);
+    return { idType: endpoints.idType, degreeType };
+}
+function sumType(type) {
+    // DuckDB SUM widens FLOAT to DOUBLE; retain that aggregate precision.
+    return type === "FLOAT" ? "DOUBLE" : type;
+}
+function degreeSelect(input, schema, source, target, count, weight) {
+    const prepared = (0, prepareGraphTraversal_js_1.prepareGraphSql)(input, schema, source, target, "degree()");
+    const weightColumn = weight === undefined
+        ? undefined
+        : (0, getGraphWeightColumn_js_1.default)(schema, weight, "degree()");
+    const degreeType = sumType(weightColumn?.distanceType ?? "BIGINT");
+    const relations = prepared.relationNames([
+        "graph_edges",
+        "graph_node_candidates",
+        "graph_nodes",
+        "graph_incoming",
+        "graph_outgoing",
+    ]);
+    const edges = relations.graph_edges;
+    const candidates = relations.graph_node_candidates;
+    const nodes = relations.graph_nodes;
+    const incoming = relations.graph_incoming;
+    const outgoing = relations.graph_outgoing;
+    const q = quoteIdentifier_js_1.default;
+    const edgeWeight = weightColumn === undefined
+        ? undefined
+        : `CAST(${q("edges")}.${q(weightColumn.column)} AS ${degreeType}) AS ${q("__weight")}`;
+    const aggregate = (direction) => {
+        const neighborKey = direction === "incoming" ? "__from_key" : "__to_key";
+        if (edgeWeight !== undefined) {
+            return `CAST(SUM(${q("__weight")}) AS ${degreeType})`;
+        }
+        return count === "neighbors"
+            ? `COUNT(DISTINCT ${q(neighborKey)})`
+            : "COUNT(*)";
+    };
+    const zero = `CAST(0 AS ${degreeType})`;
+    const incomingDegree = `COALESCE(${q("incoming")}.${q("incoming")}, ${zero})`;
+    const outgoingDegree = `COALESCE(${q("outgoing")}.${q("outgoing")}, ${zero})`;
+    return `WITH ${edges} AS (
+      ${prepared.edges("outgoing", edgeWeight === undefined ? [] : [edgeWeight])}
+    ), ${candidates} AS (
+      SELECT ${q("__from")} AS ${q("node")},
+        ${q("__from_key")} AS ${q("__key")}
+      FROM ${edges}
+      UNION ALL
+      SELECT ${q("__to")} AS ${q("node")},
+        ${q("__to_key")} AS ${q("__key")}
+      FROM ${edges}
+    ), ${nodes} AS (
+      SELECT MIN(${q("node")}) AS ${q("node")}, ${q("__key")}
+      FROM ${candidates}
+      GROUP BY ${q("__key")}
+    ), ${incoming} AS (
+      SELECT ${q("__to_key")} AS ${q("__key")},
+        ${aggregate("incoming")} AS ${q("incoming")}
+      FROM ${edges}
+      GROUP BY ${q("__to_key")}
+    ), ${outgoing} AS (
+      SELECT ${q("__from_key")} AS ${q("__key")},
+        ${aggregate("outgoing")} AS ${q("outgoing")}
+      FROM ${edges}
+      GROUP BY ${q("__from_key")}
+    )
+    SELECT ${q("nodes")}.${q("node")},
+      ${incomingDegree} AS ${q("incoming")},
+      ${outgoingDegree} AS ${q("outgoing")},
+      CAST(${incomingDegree} + ${outgoingDegree} AS ${degreeType}) AS ${q("total")}
+    FROM ${nodes} AS ${q("nodes")}
+    LEFT JOIN ${incoming} AS ${q("incoming")}
+      ON ${q("nodes")}.${q("__key")} = ${q("incoming")}.${q("__key")}
+    LEFT JOIN ${outgoing} AS ${q("outgoing")}
+      ON ${q("nodes")}.${q("__key")} = ${q("outgoing")}.${q("__key")}
+    ORDER BY ${q("total")} DESC, ${q("nodes")}.${q("__key")}`;
+}

package/script/methods/distances.d.ts

@@ -0,0 +1,12 @@
+import type SimpleTable from "../class/SimpleTable.js";
+import { type GraphTemporalOptions } from "../helpers/prepareGraphTemporalSql.js";
+import { type GraphId } from "../helpers/prepareGraphStarts.js";
+import { type GraphDirection } from "../helpers/prepareGraphTraversal.js";
+type DistancesOptions = GraphTemporalOptions & {
+    direction?: GraphDirection;
+    outputTable?: string | boolean;
+    weight?: string;
+};
+export default function distances(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, startNodes: GraphId | GraphId[], options?: DistancesOptions): SimpleTable;
+export {};
+//# sourceMappingURL=distances.d.ts.map

package/script/methods/distances.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distances.d.ts","sourceRoot":"","sources":["../../src/methods/distances.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAIvD,OAAgC,EAC9B,KAAK,oBAAoB,EAG1B,MAAM,uCAAuC,CAAC;AAC/C,OAA2B,EACzB,KAAK,OAAO,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAA8B,EAC5B,KAAK,cAAc,EAEpB,MAAM,qCAAqC,CAAC;AAK7C,KAAK,gBAAgB,GAAG,oBAAoB,GAAG;IAC7C,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,SAAS,CAC/B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,OAAO,GAAG,OAAO,EAAE,EAC/B,OAAO,GAAE,gBAAqB,GAC7B,WAAW,CAyGb"}

package/script/methods/distances.js

@@ -0,0 +1,203 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = distances;
+const buildGraphTemporalCostStateSql_js_1 = __importDefault(require("../helpers/buildGraphTemporalCostStateSql.js"));
+const getGraphWeightColumn_js_1 = __importDefault(require("../helpers/getGraphWeightColumn.js"));
+const prepareGraphTemporalSql_js_1 = __importStar(require("../helpers/prepareGraphTemporalSql.js"));
+const prepareGraphStarts_js_1 = __importDefault(require("../helpers/prepareGraphStarts.js"));
+const prepareGraphTraversal_js_1 = __importStar(require("../helpers/prepareGraphTraversal.js"));
+const queueGraphResult_js_1 = __importDefault(require("../helpers/queueGraphResult.js"));
+const quoteIdentifier_js_1 = __importDefault(require("../helpers/quoteIdentifier.js"));
+const validateGraphTemporalEvents_js_1 = __importDefault(require("../helpers/validateGraphTemporalEvents.js"));
+function distances(simpleTable, sourceColumn, targetColumn, startNodes, options = {}) {
+    if (typeof sourceColumn !== "string") {
+        throw new TypeError("distances() sourceColumn must be a string.");
+    }
+    if (typeof targetColumn !== "string") {
+        throw new TypeError("distances() targetColumn must be a string.");
+    }
+    if (options === null || typeof options !== "object" || Array.isArray(options)) {
+        throw new TypeError("distances() options must be an object.");
+    }
+    if (options.direction !== undefined &&
+        !["outgoing", "incoming", "both"].includes(options.direction)) {
+        throw new TypeError('distances() options.direction must be "outgoing", "incoming", or "both".');
+    }
+    if (options.weight !== undefined && typeof options.weight !== "string") {
+        throw new TypeError("distances() options.weight must be a string.");
+    }
+    if (options.outputTable !== undefined &&
+        typeof options.outputTable !== "string" &&
+        typeof options.outputTable !== "boolean") {
+        throw new TypeError("distances() options.outputTable must be a string or boolean.");
+    }
+    const preparedStarts = (0, prepareGraphStarts_js_1.default)(startNodes, "distances()", "startNodes");
+    const direction = options.direction ?? "outgoing";
+    const temporalOptions = (0, prepareGraphTemporalSql_js_1.prepareGraphTemporalOptions)(options, direction, "distances()");
+    options = structuredClone(options);
+    const parameters = {
+        sourceColumn,
+        targetColumn,
+        startNodes: structuredClone(startNodes),
+        options,
+    };
+    return (0, queueGraphResult_js_1.default)(simpleTable, {
+        method: "distances()",
+        parameters,
+        outputTable: options.outputTable,
+        preflight: temporalOptions === undefined
+            ? undefined
+            : (input) => (0, validateGraphTemporalEvents_js_1.default)(input, temporalOptions, "distances()", parameters),
+        values: (schema) => {
+            const { temporal } = validateDistanceInputs(schema, sourceColumn, targetColumn, preparedStarts, options.weight, temporalOptions);
+            return temporal === undefined
+                ? preparedStarts.values
+                : [temporal.gapParameter, ...preparedStarts.values];
+        },
+        buildSelect: (input, schema) => distancesSelect(input, schema, sourceColumn, targetColumn, preparedStarts, direction, options.weight, temporalOptions),
+        outputSchema: (schema) => {
+            const validated = validateDistanceInputs(schema, sourceColumn, targetColumn, preparedStarts, options.weight, temporalOptions);
+            return {
+                start: validated.idType,
+                node: validated.idType,
+                distance: validated.distanceType,
+            };
+        },
+    });
+}
+function validateDistanceInputs(schema, source, target, starts, weight, temporalOptions) {
+    const endpoints = (0, prepareGraphTraversal_js_1.validateGraphStarts)(schema, source, target, starts, "distances()", "startNodes");
+    const distanceType = weight === undefined
+        ? "BIGINT"
+        : (0, getGraphWeightColumn_js_1.default)(schema, weight, "distances()").distanceType;
+    const temporal = temporalOptions === undefined
+        ? undefined
+        : (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "distances()");
+    return { idType: endpoints.idType, distanceType, temporal };
+}
+function distancesSelect(input, schema, source, target, starts, direction, weight, temporalOptions) {
+    const prepared = (0, prepareGraphTraversal_js_1.default)(input, schema, source, target, starts, "distances()", "startNodes");
+    const weightColumn = weight === undefined
+        ? undefined
+        : (0, getGraphWeightColumn_js_1.default)(schema, weight, "distances()");
+    const distanceType = weightColumn?.distanceType ?? "BIGINT";
+    const edgeWeight = weightColumn === undefined
+        ? `CAST(1 AS ${distanceType})`
+        : `CAST(${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)(weightColumn.column)} AS ${distanceType})`;
+    if (temporalOptions !== undefined) {
+        const temporal = (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "distances()");
+        return temporalDistancesSelect(prepared, direction, temporal, distanceType, edgeWeight);
+    }
+    const relations = prepared.relationNames([
+        "graph_start_values",
+        "graph_starts",
+        "graph_edges",
+        "graph_distances",
+    ]);
+    const startValuesRelation = relations.graph_start_values;
+    const startsRelation = relations.graph_starts;
+    const edgesRelation = relations.graph_edges;
+    const distancesRelation = relations.graph_distances;
+    const start = `${(0, quoteIdentifier_js_1.default)("starts")}.${(0, quoteIdentifier_js_1.default)("start")}`;
+    const startKey = `${(0, quoteIdentifier_js_1.default)("starts")}.${(0, quoteIdentifier_js_1.default)("__key")}`;
+    const reachedStart = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("start")}`;
+    const reachedStartKey = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("__start_key")}`;
+    const reachedNodeKey = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("__node_key")}`;
+    const reachedDistance = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("distance")}`;
+    const edgeTo = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__to")}`;
+    const edgeToKey = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__to_key")}`;
+    const edgeFromKey = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__from_key")}`;
+    const edgeCost = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__weight")}`;
+    const bestDistance = `${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("distance")}`;
+    const candidateDistance = `CAST(${reachedDistance} + ${edgeCost} AS ${distanceType})`;
+    return `WITH RECURSIVE ${startValuesRelation}(${(0, quoteIdentifier_js_1.default)("start")}) AS (
+      VALUES ${prepared.startValues}
+    ), ${startsRelation} AS (
+      SELECT ${(0, quoteIdentifier_js_1.default)("start")},
+        ${prepared.key((0, quoteIdentifier_js_1.default)("start"))} AS ${(0, quoteIdentifier_js_1.default)("__key")}
+      FROM ${startValuesRelation}
+    ), ${edgesRelation} AS (
+      ${prepared.edges(direction, [
+        `${edgeWeight} AS ${(0, quoteIdentifier_js_1.default)("__weight")}`,
+    ])}
+    ), ${distancesRelation}(
+      ${(0, quoteIdentifier_js_1.default)("start")}, ${(0, quoteIdentifier_js_1.default)("node")},
+      ${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("__node_key")},
+      ${(0, quoteIdentifier_js_1.default)("distance")}
+    ) USING KEY(
+      ${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("__node_key")}
+    ) AS (
+      SELECT ${start}, ${edgeTo}, ${startKey}, ${edgeToKey},
+        MIN(${edgeCost}) AS ${(0, quoteIdentifier_js_1.default)("distance")}
+      FROM ${startsRelation} AS ${(0, quoteIdentifier_js_1.default)("starts")}
+      INNER JOIN ${edgesRelation} AS ${(0, quoteIdentifier_js_1.default)("edges")}
+        ON ${startKey} = ${edgeFromKey}
+      GROUP BY ${start}, ${edgeTo}, ${startKey}, ${edgeToKey}
+      UNION
+      SELECT ${reachedStart}, ${edgeTo}, ${reachedStartKey}, ${edgeToKey},
+        MIN(${candidateDistance}) AS ${(0, quoteIdentifier_js_1.default)("distance")}
+      FROM ${distancesRelation} AS ${(0, quoteIdentifier_js_1.default)("reached")}
+      INNER JOIN ${edgesRelation} AS ${(0, quoteIdentifier_js_1.default)("edges")}
+        ON ${reachedNodeKey} = ${edgeFromKey}
+      LEFT JOIN recurring.${distancesRelation} AS ${(0, quoteIdentifier_js_1.default)("best")}
+        ON ${reachedStartKey} = ${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("__start_key")}
+        AND ${edgeToKey} = ${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("__node_key")}
+      GROUP BY ${reachedStart}, ${edgeTo}, ${reachedStartKey}, ${edgeToKey},
+        ${bestDistance}
+      HAVING ${bestDistance} IS NULL OR MIN(${candidateDistance}) < ${bestDistance}
+    )
+    SELECT ${(0, quoteIdentifier_js_1.default)("start")}, ${(0, quoteIdentifier_js_1.default)("node")},
+      ${(0, quoteIdentifier_js_1.default)("distance")}
+    FROM ${distancesRelation}
+    ORDER BY ${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("distance")}, ${(0, quoteIdentifier_js_1.default)("__node_key")}`;
+}
+function temporalDistancesSelect(prepared, direction, temporal, distanceType, edgeWeight) {
+    const q = quoteIdentifier_js_1.default;
+    const startsSelect = `SELECT ${q("start")},
+        ${prepared.key(q("start"))} AS ${q("__key")}
+      FROM (VALUES ${prepared.startValues}) AS ${q("start_values")}(${q("start")})`;
+    const costStates = (0, buildGraphTemporalCostStateSql_js_1.default)(prepared, startsSelect, direction, temporal, distanceType, edgeWeight);
+    return `${costStates.withClause}
+    SELECT ${q("start")}, ${q("node")},
+      MIN(${q("distance")}) AS ${q("distance")}
+    FROM ${costStates.costRelation}
+    GROUP BY ${q("start")}, ${q("node")}, ${q("__start_key")},
+      ${q("__node_key")}
+    ORDER BY ${q("__start_key")}, ${q("distance")}, ${q("__node_key")}`;
+}

package/script/methods/findCycles.d.ts

@@ -0,0 +1,12 @@
+import type SimpleTable from "../class/SimpleTable.js";
+import { type GraphTemporalOptions } from "../helpers/prepareGraphTemporalSql.js";
+import { type GraphId } from "../helpers/prepareGraphStarts.js";
+import { type GraphDirection } from "../helpers/prepareGraphTraversal.js";
+type FindCyclesOptions = GraphTemporalOptions & {
+    direction?: GraphDirection;
+    outputTable?: string | boolean;
+    weight?: string;
+};
+export default function findCycles(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, edgeId: string, startNodes: GraphId | GraphId[], options?: FindCyclesOptions): SimpleTable;
+export {};
+//# sourceMappingURL=findCycles.d.ts.map

package/script/methods/findCycles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findCycles.d.ts","sourceRoot":"","sources":["../../src/methods/findCycles.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAMvD,OAAgC,EAC9B,KAAK,oBAAoB,EAG1B,MAAM,uCAAuC,CAAC;AAC/C,OAA2B,EACzB,KAAK,OAAO,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAA8B,EAC5B,KAAK,cAAc,EAEpB,MAAM,qCAAqC,CAAC;AAM7C,KAAK,iBAAiB,GAAG,oBAAoB,GAAG;IAC9C,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,UAAU,CAChC,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,OAAO,GAAG,OAAO,EAAE,EAC/B,OAAO,GAAE,iBAAsB,GAC9B,WAAW,CAuHb"}