@milaboratories/pl-middle-layer 1.48.11 → 1.48.13

package/dist/model/project_model_util.cjs

@@ -1,176 +1,137 @@
-'use strict';
-
-var args = require('./args.cjs');
+const require_args = require('./args.cjs');
 
+//#region src/model/project_model_util.ts
 function allBlocks(structure) {
-    return {
-        *[Symbol.iterator]() {
-            for (const g of structure.groups)
-                for (const b of g.blocks)
-                    yield b;
-        },
-    };
-}
-class BlockGraph {
-    /** Nodes are stored in the map in topological order */
-    nodes;
-    constructor(nodes) {
-        this.nodes = nodes;
-    }
-    traverseIds(direction, ...rootBlockIds) {
-        const all = new Set();
-        this.traverse(direction, rootBlockIds, (node) => all.add(node.id));
-        return all;
-    }
-    traverseIdsExcludingRoots(direction, ...rootBlockIds) {
-        const result = this.traverseIds(direction, ...rootBlockIds);
-        for (const r of rootBlockIds)
-            result.delete(r);
-        return result;
-    }
-    traverse(direction, rootBlockIds, cb) {
-        let unprocessed = [...rootBlockIds];
-        // used to deduplicate possible downstream / upstream blocks and process them only once
-        const queued = new Set(unprocessed);
-        while (unprocessed.length > 0) {
-            const nextUnprocessed = [];
-            for (const blockId of unprocessed) {
-                const info = this.nodes.get(blockId);
-                cb(info);
-                info[direction].forEach((v) => {
-                    if (!queued.has(v)) {
-                        queued.add(v);
-                        nextUnprocessed.push(v);
-                    }
-                });
-            }
-            unprocessed = nextUnprocessed;
-        }
-    }
+	return { *[Symbol.iterator]() {
+		for (const g of structure.groups) for (const b of g.blocks) yield b;
+	} };
 }
+var BlockGraph = class {
+	/** Nodes are stored in the map in topological order */
+	nodes;
+	constructor(nodes) {
+		this.nodes = nodes;
+	}
+	traverseIds(direction, ...rootBlockIds) {
+		const all = /* @__PURE__ */ new Set();
+		this.traverse(direction, rootBlockIds, (node) => all.add(node.id));
+		return all;
+	}
+	traverseIdsExcludingRoots(direction, ...rootBlockIds) {
+		const result = this.traverseIds(direction, ...rootBlockIds);
+		for (const r of rootBlockIds) result.delete(r);
+		return result;
+	}
+	traverse(direction, rootBlockIds, cb) {
+		let unprocessed = [...rootBlockIds];
+		const queued = new Set(unprocessed);
+		while (unprocessed.length > 0) {
+			const nextUnprocessed = [];
+			for (const blockId of unprocessed) {
+				const info = this.nodes.get(blockId);
+				cb(info);
+				info[direction].forEach((v) => {
+					if (!queued.has(v)) {
+						queued.add(v);
+						nextUnprocessed.push(v);
+					}
+				});
+			}
+			unprocessed = nextUnprocessed;
+		}
+	}
+};
 function stagingGraph(structure) {
-    const result = new Map();
-    // Simple dependency graph from previous to next
-    //
-    //   more complicated patterns to be implemented later
-    //   (i.e. groups with specific behaviours for total outputs and inputs)
-    //
-    let previous = undefined;
-    for (const { id } of allBlocks(structure)) {
-        const current = {
-            id: id,
-            missingReferences: false,
-        };
-        result.set(id, current);
-        if (previous === undefined) {
-            current.directUpstream = current.upstream = new Set();
-            current.enrichments = current.enrichmentTargets = new Set();
-        }
-        else {
-            current.directUpstream = current.upstream = new Set([previous.id]);
-            previous.directDownstream = previous.downstream = new Set([current.id]);
-            previous.enrichments = previous.enrichmentTargets = new Set();
-        }
-        previous = current;
-    }
-    if (previous !== undefined)
-        previous.directDownstream = previous.downstream = new Set();
-    return new BlockGraph(result);
+	const result = /* @__PURE__ */ new Map();
+	let previous = void 0;
+	for (const { id } of allBlocks(structure)) {
+		const current = {
+			id,
+			missingReferences: false
+		};
+		result.set(id, current);
+		if (previous === void 0) {
+			current.directUpstream = current.upstream = /* @__PURE__ */ new Set();
+			current.enrichments = current.enrichmentTargets = /* @__PURE__ */ new Set();
+		} else {
+			current.directUpstream = current.upstream = new Set([previous.id]);
+			previous.directDownstream = previous.downstream = new Set([current.id]);
+			previous.enrichments = previous.enrichmentTargets = /* @__PURE__ */ new Set();
+		}
+		previous = current;
+	}
+	if (previous !== void 0) previous.directDownstream = previous.downstream = /* @__PURE__ */ new Set();
+	return new BlockGraph(result);
 }
 function productionGraph(structure, infoProvider) {
-    const resultMap = new Map();
-    // result graph is constructed to be able to perform traversal on incomplete graph
-    // to calculate potentialUpstreams
-    const resultGraph = new BlockGraph(resultMap);
-    // traversing blocks in topological order defined by the project structure
-    // and keeping possibleUpstreams set on each step, to consider only
-    // those dependencies that are possible under current topology
-    const allAbove = new Set();
-    for (const { id } of allBlocks(structure)) {
-        const info = infoProvider(id);
-        // skipping those blocks for which we don't have args
-        if (info === undefined)
-            continue;
-        const references = args.inferAllReferencedBlocks(info.args, allAbove);
-        // The algorithm here adds all downstream blocks of direct upstreams as potential upstreams.
-        // They may produce additional columns, anchored in our direct upstream, those columns might be needed by the workflow.
-        const potentialUpstreams = new Set([
-            ...references.upstreams,
-            ...resultGraph.traverseIds("enrichments", ...references.upstreamsRequiringEnrichments),
-        ]);
-        // To minimize complexity of the graph, we leave only the closest upstreams, removing all their transitive dependencies,
-        // relying on the traversal mechanisms in BContexts and on UI level to connect our block with all upstreams
-        const upstreams = new Set();
-        for (const { id: pId } of allBlocks(structure)) {
-            if (pId === id)
-                break; // stopping on current block
-            if (potentialUpstreams.has(pId)) {
-                upstreams.add(pId);
-                for (const transitiveUpstream of resultGraph.traverseIdsExcludingRoots("upstream", pId))
-                    upstreams.delete(transitiveUpstream);
-            }
-        }
-        // default assumption is that all direct upstreams are enrichment targets
-        const enrichmentTargets = info.enrichmentTargets === undefined
-            ? new Set(references.upstreams)
-            : new Set(info.enrichmentTargets.map((t) => t.blockId));
-        const node = {
-            id,
-            missingReferences: references.missingReferences,
-            upstream: upstreams,
-            directUpstream: references.upstreams,
-            enrichmentTargets,
-            downstream: new Set(), // will be populated from downstream blocks
-            directDownstream: new Set(), // will be populated from downstream blocks
-            enrichments: new Set(), // will be populated from downstream blocks
-        };
-        resultMap.set(id, node);
-        references.upstreams.forEach((dep) => resultMap.get(dep).directDownstream.add(id));
-        upstreams.forEach((dep) => resultMap.get(dep).downstream.add(id));
-        enrichmentTargets.forEach((dep) => resultMap.get(dep)?.enrichments.add(id));
-        allAbove.add(id);
-    }
-    return resultGraph;
+	const resultMap = /* @__PURE__ */ new Map();
+	const resultGraph = new BlockGraph(resultMap);
+	const allAbove = /* @__PURE__ */ new Set();
+	for (const { id } of allBlocks(structure)) {
+		const info = infoProvider(id);
+		if (info === void 0) continue;
+		const references = require_args.inferAllReferencedBlocks(info.args, allAbove);
+		const potentialUpstreams = new Set([...references.upstreams, ...resultGraph.traverseIds("enrichments", ...references.upstreamsRequiringEnrichments)]);
+		const upstreams = /* @__PURE__ */ new Set();
+		for (const { id: pId } of allBlocks(structure)) {
+			if (pId === id) break;
+			if (potentialUpstreams.has(pId)) {
+				upstreams.add(pId);
+				for (const transitiveUpstream of resultGraph.traverseIdsExcludingRoots("upstream", pId)) upstreams.delete(transitiveUpstream);
+			}
+		}
+		const enrichmentTargets = info.enrichmentTargets === void 0 ? new Set(references.upstreams) : new Set(info.enrichmentTargets.map((t) => t.blockId));
+		const node = {
+			id,
+			missingReferences: references.missingReferences,
+			upstream: upstreams,
+			directUpstream: references.upstreams,
+			enrichmentTargets,
+			downstream: /* @__PURE__ */ new Set(),
+			directDownstream: /* @__PURE__ */ new Set(),
+			enrichments: /* @__PURE__ */ new Set()
+		};
+		resultMap.set(id, node);
+		references.upstreams.forEach((dep) => resultMap.get(dep).directDownstream.add(id));
+		upstreams.forEach((dep) => resultMap.get(dep).downstream.add(id));
+		enrichmentTargets.forEach((dep) => resultMap.get(dep)?.enrichments.add(id));
+		allAbove.add(id);
+	}
+	return resultGraph;
 }
 function setsEqual(a, b) {
-    if (a.size !== b.size)
-        return false;
-    for (const e of a)
-        if (!b.has(e))
-            return false;
-    return true;
+	if (a.size !== b.size) return false;
+	for (const e of a) if (!b.has(e)) return false;
+	return true;
 }
 function intersects(a, b) {
-    if (a.size > b.size)
-        return intersects(b, a);
-    for (const e of a)
-        if (b.has(e))
-            return true;
-    return false;
+	if (a.size > b.size) return intersects(b, a);
+	for (const e of a) if (b.has(e)) return true;
+	return false;
 }
 function graphDiff(a, b) {
-    const onlyInA = new Set();
-    const onlyInB = new Set();
-    const different = new Set();
-    a.nodes.forEach((fromA) => {
-        const fromB = b.nodes.get(fromA.id);
-        if (fromB === undefined)
-            onlyInA.add(fromA.id);
-        else if (!setsEqual(fromA.upstream, fromB.upstream) || intersects(fromA.upstream, different))
-            different.add(fromA.id);
-    });
-    b.nodes.forEach((fromB) => {
-        if (!a.nodes.has(fromB.id))
-            onlyInB.add(fromB.id);
-        else if (intersects(fromB.upstream, different))
-            different.add(fromB.id);
-    });
-    return { onlyInA, onlyInB, different };
+	const onlyInA = /* @__PURE__ */ new Set();
+	const onlyInB = /* @__PURE__ */ new Set();
+	const different = /* @__PURE__ */ new Set();
+	a.nodes.forEach((fromA) => {
+		const fromB = b.nodes.get(fromA.id);
+		if (fromB === void 0) onlyInA.add(fromA.id);
+		else if (!setsEqual(fromA.upstream, fromB.upstream) || intersects(fromA.upstream, different)) different.add(fromA.id);
+	});
+	b.nodes.forEach((fromB) => {
+		if (!a.nodes.has(fromB.id)) onlyInB.add(fromB.id);
+		else if (intersects(fromB.upstream, different)) different.add(fromB.id);
+	});
+	return {
+		onlyInA,
+		onlyInB,
+		different
+	};
 }
 
-exports.BlockGraph = BlockGraph;
+//#endregion
 exports.allBlocks = allBlocks;
 exports.graphDiff = graphDiff;
 exports.productionGraph = productionGraph;
 exports.stagingGraph = stagingGraph;
-//# sourceMappingURL=project_model_util.cjs.map
+//# sourceMappingURL=project_model_util.cjs.map

package/dist/model/project_model_util.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"project_model_util.cjs","sources":["../../src/model/project_model_util.ts"],"sourcesContent":["import type { Block, ProjectStructure } from \"./project_model\";\nimport type { Optional, Writable } from \"utility-types\";\nimport { inferAllReferencedBlocks } from \"./args\";\nimport type { PlRef } from \"@milaboratories/pl-model-common\";\n\nexport function allBlocks(structure: ProjectStructure): Iterable<Block> {\n  return {\n    *[Symbol.iterator]() {\n      for (const g of structure.groups) for (const b of g.blocks) yield b;\n    },\n  };\n}\n\nexport interface BlockGraphNode {\n  readonly id: string;\n  readonly missingReferences: boolean;\n  /** Upstreams, calculated accounting for potential indirect block dependencies  */\n  readonly upstream: Set<string>;\n  /** Direct upstream, listed in block args */\n  readonly directUpstream: Set<string>;\n  /** Downstreams, calculated accounting for potential indirect block dependencies  */\n  readonly downstream: Set<string>;\n  /** Downstream blocks enriching current block's outputs */\n  readonly enrichments: Set<string>;\n  /** Direct downstreams listing our block in it's args */\n  readonly directDownstream: Set<string>;\n  /** Upstream blocks that current block may enrich with its exports */\n  readonly enrichmentTargets: Set<string>;\n}\n\nexport type BlockGraphDirection =\n  | \"upstream\"\n  | \"downstream\"\n  | \"directUpstream\"\n  | \"directDownstream\"\n  | \"enrichments\"\n  | \"enrichmentTargets\";\n\nexport class BlockGraph {\n  /** Nodes are stored in the map in topological order */\n  public readonly nodes: Map<string, BlockGraphNode>;\n\n  constructor(nodes: Map<string, BlockGraphNode>) {\n    this.nodes = nodes;\n  }\n\n  public traverseIds(direction: BlockGraphDirection, ...rootBlockIds: string[]): Set<string> {\n    const all = new Set<string>();\n    this.traverse(direction, rootBlockIds, (node) => all.add(node.id));\n    return all;\n  }\n\n  public traverseIdsExcludingRoots(\n    direction: BlockGraphDirection,\n    ...rootBlockIds: string[]\n  ): Set<string> {\n    const result = this.traverseIds(direction, ...rootBlockIds);\n    for (const r of rootBlockIds) result.delete(r);\n    return result;\n  }\n\n  public traverse(\n    direction: BlockGraphDirection,\n    rootBlockIds: string[],\n    cb: (node: BlockGraphNode) => void,\n  ): void {\n    let unprocessed = [...rootBlockIds];\n    // used to deduplicate possible downstream / upstream blocks and process them only once\n    const queued = new Set<string>(unprocessed);\n    while (unprocessed.length > 0) {\n      const nextUnprocessed: string[] = [];\n      for (const blockId of unprocessed) {\n        const info = this.nodes.get(blockId)!;\n        cb(info);\n        info[direction].forEach((v) => {\n          if (!queued.has(v)) {\n            queued.add(v);\n            nextUnprocessed.push(v);\n          }\n        });\n      }\n      unprocessed = nextUnprocessed;\n    }\n  }\n}\n\nexport function stagingGraph(structure: ProjectStructure) {\n  type WNode = Optional<Writable<BlockGraphNode>, BlockGraphDirection>;\n  const result = new Map<string, WNode>();\n\n  // Simple dependency graph from previous to next\n  //\n  //   more complicated patterns to be implemented later\n  //   (i.e. groups with specific behaviours for total outputs and inputs)\n  //\n  let previous: WNode | undefined = undefined;\n  for (const { id } of allBlocks(structure)) {\n    const current: WNode = {\n      id: id,\n      missingReferences: false,\n    };\n    result.set(id, current);\n    if (previous === undefined) {\n      current.directUpstream = current.upstream = new Set<string>();\n      current.enrichments = current.enrichmentTargets = new Set<string>();\n    } else {\n      current.directUpstream = current.upstream = new Set<string>([previous.id]);\n      previous.directDownstream = previous.downstream = new Set<string>([current.id]);\n      previous.enrichments = previous.enrichmentTargets = new Set<string>();\n    }\n\n    previous = current;\n  }\n  if (previous !== undefined) previous.directDownstream = previous.downstream = new Set<string>();\n\n  return new BlockGraph(result as Map<string, BlockGraphNode>);\n}\n\nexport type ProductionGraphBlockInfo = {\n  args: unknown;\n  enrichmentTargets: PlRef[] | undefined;\n};\n\nexport function productionGraph(\n  structure: ProjectStructure,\n  infoProvider: (blockId: string) => ProductionGraphBlockInfo | undefined,\n): BlockGraph {\n  const resultMap = new Map<string, BlockGraphNode>();\n  // result graph is constructed to be able to perform traversal on incomplete graph\n  // to calculate potentialUpstreams\n  const resultGraph = new BlockGraph(resultMap);\n\n  // traversing blocks in topological order defined by the project structure\n  // and keeping possibleUpstreams set on each step, to consider only\n  // those dependencies that are possible under current topology\n  const allAbove = new Set<string>();\n  for (const { id } of allBlocks(structure)) {\n    const info = infoProvider(id);\n\n    // skipping those blocks for which we don't have args\n    if (info === undefined) continue;\n\n    const references = inferAllReferencedBlocks(info.args, allAbove);\n\n    // The algorithm here adds all downstream blocks of direct upstreams as potential upstreams.\n    // They may produce additional columns, anchored in our direct upstream, those columns might be needed by the workflow.\n    const potentialUpstreams = new Set([\n      ...references.upstreams,\n      ...resultGraph.traverseIds(\"enrichments\", ...references.upstreamsRequiringEnrichments),\n    ]);\n\n    // To minimize complexity of the graph, we leave only the closest upstreams, removing all their transitive dependencies,\n    // relying on the traversal mechanisms in BContexts and on UI level to connect our block with all upstreams\n    const upstreams = new Set<string>();\n    for (const { id: pId } of allBlocks(structure)) {\n      if (pId === id) break; // stopping on current block\n      if (potentialUpstreams.has(pId)) {\n        upstreams.add(pId);\n        for (const transitiveUpstream of resultGraph.traverseIdsExcludingRoots(\"upstream\", pId))\n          upstreams.delete(transitiveUpstream);\n      }\n    }\n\n    // default assumption is that all direct upstreams are enrichment targets\n    const enrichmentTargets =\n      info.enrichmentTargets === undefined\n        ? new Set(references.upstreams)\n        : new Set(info.enrichmentTargets.map((t) => t.blockId));\n\n    const node: BlockGraphNode = {\n      id,\n      missingReferences: references.missingReferences,\n      upstream: upstreams,\n      directUpstream: references.upstreams,\n      enrichmentTargets,\n      downstream: new Set<string>(), // will be populated from downstream blocks\n      directDownstream: new Set<string>(), // will be populated from downstream blocks\n      enrichments: new Set<string>(), // will be populated from downstream blocks\n    };\n    resultMap.set(id, node);\n    references.upstreams.forEach((dep) => resultMap.get(dep)!.directDownstream.add(id));\n    upstreams.forEach((dep) => resultMap.get(dep)!.downstream.add(id));\n    enrichmentTargets.forEach((dep) => resultMap.get(dep)?.enrichments.add(id));\n    allAbove.add(id);\n  }\n\n  return resultGraph;\n}\n\nfunction setsEqual<T>(a: Set<T>, b: Set<T>): boolean {\n  if (a.size !== b.size) return false;\n  for (const e of a) if (!b.has(e)) return false;\n  return true;\n}\n\nfunction intersects<T>(a: Set<T>, b: Set<T>): boolean {\n  if (a.size > b.size) return intersects(b, a);\n  for (const e of a) if (b.has(e)) return true;\n  return false;\n}\n\nexport interface GraphDiff {\n  onlyInA: Set<string>;\n  /** Nodes that changed the list of their upstreams,\n   * and all their downstreams */\n  different: Set<string>;\n  onlyInB: Set<string>;\n}\n\nexport function graphDiff(a: BlockGraph, b: BlockGraph): GraphDiff {\n  const onlyInA = new Set<string>();\n  const onlyInB = new Set<string>();\n  const different = new Set<string>();\n  a.nodes.forEach((fromA) => {\n    const fromB = b.nodes.get(fromA.id);\n    if (fromB === undefined) onlyInA.add(fromA.id);\n    else if (!setsEqual(fromA.upstream, fromB.upstream) || intersects(fromA.upstream, different))\n      different.add(fromA.id);\n  });\n\n  b.nodes.forEach((fromB) => {\n    if (!a.nodes.has(fromB.id)) onlyInB.add(fromB.id);\n    else if (intersects(fromB.upstream, different)) different.add(fromB.id);\n  });\n\n  return { onlyInA, onlyInB, different };\n}\n"],"names":["inferAllReferencedBlocks"],"mappings":";;;;AAKM,SAAU,SAAS,CAAC,SAA2B,EAAA;IACnD,OAAO;AACL,QAAA,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAA;AAChB,YAAA,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM;AAAE,gBAAA,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM;AAAE,oBAAA,MAAM,CAAC;QACrE,CAAC;KACF;AACH;MA2Ba,UAAU,CAAA;;AAEL,IAAA,KAAK;AAErB,IAAA,WAAA,CAAY,KAAkC,EAAA;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK;IACpB;AAEO,IAAA,WAAW,CAAC,SAA8B,EAAE,GAAG,YAAsB,EAAA;AAC1E,QAAA,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU;QAC7B,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAClE,QAAA,OAAO,GAAG;IACZ;AAEO,IAAA,yBAAyB,CAC9B,SAA8B,EAC9B,GAAG,YAAsB,EAAA;QAEzB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,GAAG,YAAY,CAAC;QAC3D,KAAK,MAAM,CAAC,IAAI,YAAY;AAAE,YAAA,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9C,QAAA,OAAO,MAAM;IACf;AAEO,IAAA,QAAQ,CACb,SAA8B,EAC9B,YAAsB,EACtB,EAAkC,EAAA;AAElC,QAAA,IAAI,WAAW,GAAG,CAAC,GAAG,YAAY,CAAC;;AAEnC,QAAA,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,WAAW,CAAC;AAC3C,QAAA,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,MAAM,eAAe,GAAa,EAAE;AACpC,YAAA,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE;gBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAE;gBACrC,EAAE,CAAC,IAAI,CAAC;gBACR,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;oBAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAClB,wBAAA,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACb,wBAAA,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;oBACzB;AACF,gBAAA,CAAC,CAAC;YACJ;YACA,WAAW,GAAG,eAAe;QAC/B;IACF;AACD;AAEK,SAAU,YAAY,CAAC,SAA2B,EAAA;AAEtD,IAAA,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB;;;;;;IAOvC,IAAI,QAAQ,GAAsB,SAAS;IAC3C,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE;AACzC,QAAA,MAAM,OAAO,GAAU;AACrB,YAAA,EAAE,EAAE,EAAE;AACN,YAAA,iBAAiB,EAAE,KAAK;SACzB;AACD,QAAA,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC;AACvB,QAAA,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC1B,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAU;YAC7D,OAAO,CAAC,WAAW,GAAG,OAAO,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAU;QACrE;aAAO;AACL,YAAA,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC1E,YAAA,QAAQ,CAAC,gBAAgB,GAAG,QAAQ,CAAC,UAAU,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC/E,QAAQ,CAAC,WAAW,GAAG,QAAQ,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAU;QACvE;QAEA,QAAQ,GAAG,OAAO;IACpB;IACA,IAAI,QAAQ,KAAK,SAAS;QAAE,QAAQ,CAAC,gBAAgB,GAAG,QAAQ,CAAC,UAAU,GAAG,IAAI,GAAG,EAAU;AAE/F,IAAA,OAAO,IAAI,UAAU,CAAC,MAAqC,CAAC;AAC9D;AAOM,SAAU,eAAe,CAC7B,SAA2B,EAC3B,YAAuE,EAAA;AAEvE,IAAA,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B;;;AAGnD,IAAA,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC;;;;AAK7C,IAAA,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU;IAClC,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE;AACzC,QAAA,MAAM,IAAI,GAAG,YAAY,CAAC,EAAE,CAAC;;QAG7B,IAAI,IAAI,KAAK,SAAS;YAAE;QAExB,MAAM,UAAU,GAAGA,6BAAwB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC;;;AAIhE,QAAA,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC;YACjC,GAAG,UAAU,CAAC,SAAS;YACvB,GAAG,WAAW,CAAC,WAAW,CAAC,aAAa,EAAE,GAAG,UAAU,CAAC,6BAA6B,CAAC;AACvF,SAAA,CAAC;;;AAIF,QAAA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU;AACnC,QAAA,KAAK,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE;YAC9C,IAAI,GAAG,KAAK,EAAE;AAAE,gBAAA,MAAM;AACtB,YAAA,IAAI,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AAC/B,gBAAA,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;gBAClB,KAAK,MAAM,kBAAkB,IAAI,WAAW,CAAC,yBAAyB,CAAC,UAAU,EAAE,GAAG,CAAC;AACrF,oBAAA,SAAS,CAAC,MAAM,CAAC,kBAAkB,CAAC;YACxC;QACF;;AAGA,QAAA,MAAM,iBAAiB,GACrB,IAAI,CAAC,iBAAiB,KAAK;AACzB,cAAE,IAAI,GAAG,CAAC,UAAU,CAAC,SAAS;cAC5B,IAAI,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;AAE3D,QAAA,MAAM,IAAI,GAAmB;YAC3B,EAAE;YACF,iBAAiB,EAAE,UAAU,CAAC,iBAAiB;AAC/C,YAAA,QAAQ,EAAE,SAAS;YACnB,cAAc,EAAE,UAAU,CAAC,SAAS;YACpC,iBAAiB;AACjB,YAAA,UAAU,EAAE,IAAI,GAAG,EAAU;AAC7B,YAAA,gBAAgB,EAAE,IAAI,GAAG,EAAU;AACnC,YAAA,WAAW,EAAE,IAAI,GAAG,EAAU;SAC/B;AACD,QAAA,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;QACvB,UAAU,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnF,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClE,iBAAiB,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC3E,QAAA,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;IAClB;AAEA,IAAA,OAAO,WAAW;AACpB;AAEA,SAAS,SAAS,CAAI,CAAS,EAAE,CAAS,EAAA;AACxC,IAAA,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;AAAE,QAAA,OAAO,KAAK;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC;AAAE,QAAA,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,KAAK;AAC9C,IAAA,OAAO,IAAI;AACb;AAEA,SAAS,UAAU,CAAI,CAAS,EAAE,CAAS,EAAA;AACzC,IAAA,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;AAAE,QAAA,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,CAAC;AAAE,QAAA,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;AAC5C,IAAA,OAAO,KAAK;AACd;AAUM,SAAU,SAAS,CAAC,CAAa,EAAE,CAAa,EAAA;AACpD,IAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;AACjC,IAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;AACjC,IAAA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU;IACnC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;AACxB,QAAA,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS;AAAE,YAAA,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACzC,aAAA,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC1F,YAAA,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC3B,IAAA,CAAC,CAAC;IAEF,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;QACxB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAAE,YAAA,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC5C,aAAA,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC;AAAE,YAAA,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACzE,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE;AACxC;;;;;;;;"}
+{"version":3,"file":"project_model_util.cjs","names":["inferAllReferencedBlocks"],"sources":["../../src/model/project_model_util.ts"],"sourcesContent":["import type { Block, ProjectStructure } from \"./project_model\";\nimport type { Optional, Writable } from \"utility-types\";\nimport { inferAllReferencedBlocks } from \"./args\";\nimport type { PlRef } from \"@milaboratories/pl-model-common\";\n\nexport function allBlocks(structure: ProjectStructure): Iterable<Block> {\n  return {\n    *[Symbol.iterator]() {\n      for (const g of structure.groups) for (const b of g.blocks) yield b;\n    },\n  };\n}\n\nexport interface BlockGraphNode {\n  readonly id: string;\n  readonly missingReferences: boolean;\n  /** Upstreams, calculated accounting for potential indirect block dependencies  */\n  readonly upstream: Set<string>;\n  /** Direct upstream, listed in block args */\n  readonly directUpstream: Set<string>;\n  /** Downstreams, calculated accounting for potential indirect block dependencies  */\n  readonly downstream: Set<string>;\n  /** Downstream blocks enriching current block's outputs */\n  readonly enrichments: Set<string>;\n  /** Direct downstreams listing our block in it's args */\n  readonly directDownstream: Set<string>;\n  /** Upstream blocks that current block may enrich with its exports */\n  readonly enrichmentTargets: Set<string>;\n}\n\nexport type BlockGraphDirection =\n  | \"upstream\"\n  | \"downstream\"\n  | \"directUpstream\"\n  | \"directDownstream\"\n  | \"enrichments\"\n  | \"enrichmentTargets\";\n\nexport class BlockGraph {\n  /** Nodes are stored in the map in topological order */\n  public readonly nodes: Map<string, BlockGraphNode>;\n\n  constructor(nodes: Map<string, BlockGraphNode>) {\n    this.nodes = nodes;\n  }\n\n  public traverseIds(direction: BlockGraphDirection, ...rootBlockIds: string[]): Set<string> {\n    const all = new Set<string>();\n    this.traverse(direction, rootBlockIds, (node) => all.add(node.id));\n    return all;\n  }\n\n  public traverseIdsExcludingRoots(\n    direction: BlockGraphDirection,\n    ...rootBlockIds: string[]\n  ): Set<string> {\n    const result = this.traverseIds(direction, ...rootBlockIds);\n    for (const r of rootBlockIds) result.delete(r);\n    return result;\n  }\n\n  public traverse(\n    direction: BlockGraphDirection,\n    rootBlockIds: string[],\n    cb: (node: BlockGraphNode) => void,\n  ): void {\n    let unprocessed = [...rootBlockIds];\n    // used to deduplicate possible downstream / upstream blocks and process them only once\n    const queued = new Set<string>(unprocessed);\n    while (unprocessed.length > 0) {\n      const nextUnprocessed: string[] = [];\n      for (const blockId of unprocessed) {\n        const info = this.nodes.get(blockId)!;\n        cb(info);\n        info[direction].forEach((v) => {\n          if (!queued.has(v)) {\n            queued.add(v);\n            nextUnprocessed.push(v);\n          }\n        });\n      }\n      unprocessed = nextUnprocessed;\n    }\n  }\n}\n\nexport function stagingGraph(structure: ProjectStructure) {\n  type WNode = Optional<Writable<BlockGraphNode>, BlockGraphDirection>;\n  const result = new Map<string, WNode>();\n\n  // Simple dependency graph from previous to next\n  //\n  //   more complicated patterns to be implemented later\n  //   (i.e. groups with specific behaviours for total outputs and inputs)\n  //\n  let previous: WNode | undefined = undefined;\n  for (const { id } of allBlocks(structure)) {\n    const current: WNode = {\n      id: id,\n      missingReferences: false,\n    };\n    result.set(id, current);\n    if (previous === undefined) {\n      current.directUpstream = current.upstream = new Set<string>();\n      current.enrichments = current.enrichmentTargets = new Set<string>();\n    } else {\n      current.directUpstream = current.upstream = new Set<string>([previous.id]);\n      previous.directDownstream = previous.downstream = new Set<string>([current.id]);\n      previous.enrichments = previous.enrichmentTargets = new Set<string>();\n    }\n\n    previous = current;\n  }\n  if (previous !== undefined) previous.directDownstream = previous.downstream = new Set<string>();\n\n  return new BlockGraph(result as Map<string, BlockGraphNode>);\n}\n\nexport type ProductionGraphBlockInfo = {\n  args: unknown;\n  enrichmentTargets: PlRef[] | undefined;\n};\n\nexport function productionGraph(\n  structure: ProjectStructure,\n  infoProvider: (blockId: string) => ProductionGraphBlockInfo | undefined,\n): BlockGraph {\n  const resultMap = new Map<string, BlockGraphNode>();\n  // result graph is constructed to be able to perform traversal on incomplete graph\n  // to calculate potentialUpstreams\n  const resultGraph = new BlockGraph(resultMap);\n\n  // traversing blocks in topological order defined by the project structure\n  // and keeping possibleUpstreams set on each step, to consider only\n  // those dependencies that are possible under current topology\n  const allAbove = new Set<string>();\n  for (const { id } of allBlocks(structure)) {\n    const info = infoProvider(id);\n\n    // skipping those blocks for which we don't have args\n    if (info === undefined) continue;\n\n    const references = inferAllReferencedBlocks(info.args, allAbove);\n\n    // The algorithm here adds all downstream blocks of direct upstreams as potential upstreams.\n    // They may produce additional columns, anchored in our direct upstream, those columns might be needed by the workflow.\n    const potentialUpstreams = new Set([\n      ...references.upstreams,\n      ...resultGraph.traverseIds(\"enrichments\", ...references.upstreamsRequiringEnrichments),\n    ]);\n\n    // To minimize complexity of the graph, we leave only the closest upstreams, removing all their transitive dependencies,\n    // relying on the traversal mechanisms in BContexts and on UI level to connect our block with all upstreams\n    const upstreams = new Set<string>();\n    for (const { id: pId } of allBlocks(structure)) {\n      if (pId === id) break; // stopping on current block\n      if (potentialUpstreams.has(pId)) {\n        upstreams.add(pId);\n        for (const transitiveUpstream of resultGraph.traverseIdsExcludingRoots(\"upstream\", pId))\n          upstreams.delete(transitiveUpstream);\n      }\n    }\n\n    // default assumption is that all direct upstreams are enrichment targets\n    const enrichmentTargets =\n      info.enrichmentTargets === undefined\n        ? new Set(references.upstreams)\n        : new Set(info.enrichmentTargets.map((t) => t.blockId));\n\n    const node: BlockGraphNode = {\n      id,\n      missingReferences: references.missingReferences,\n      upstream: upstreams,\n      directUpstream: references.upstreams,\n      enrichmentTargets,\n      downstream: new Set<string>(), // will be populated from downstream blocks\n      directDownstream: new Set<string>(), // will be populated from downstream blocks\n      enrichments: new Set<string>(), // will be populated from downstream blocks\n    };\n    resultMap.set(id, node);\n    references.upstreams.forEach((dep) => resultMap.get(dep)!.directDownstream.add(id));\n    upstreams.forEach((dep) => resultMap.get(dep)!.downstream.add(id));\n    enrichmentTargets.forEach((dep) => resultMap.get(dep)?.enrichments.add(id));\n    allAbove.add(id);\n  }\n\n  return resultGraph;\n}\n\nfunction setsEqual<T>(a: Set<T>, b: Set<T>): boolean {\n  if (a.size !== b.size) return false;\n  for (const e of a) if (!b.has(e)) return false;\n  return true;\n}\n\nfunction intersects<T>(a: Set<T>, b: Set<T>): boolean {\n  if (a.size > b.size) return intersects(b, a);\n  for (const e of a) if (b.has(e)) return true;\n  return false;\n}\n\nexport interface GraphDiff {\n  onlyInA: Set<string>;\n  /** Nodes that changed the list of their upstreams,\n   * and all their downstreams */\n  different: Set<string>;\n  onlyInB: Set<string>;\n}\n\nexport function graphDiff(a: BlockGraph, b: BlockGraph): GraphDiff {\n  const onlyInA = new Set<string>();\n  const onlyInB = new Set<string>();\n  const different = new Set<string>();\n  a.nodes.forEach((fromA) => {\n    const fromB = b.nodes.get(fromA.id);\n    if (fromB === undefined) onlyInA.add(fromA.id);\n    else if (!setsEqual(fromA.upstream, fromB.upstream) || intersects(fromA.upstream, different))\n      different.add(fromA.id);\n  });\n\n  b.nodes.forEach((fromB) => {\n    if (!a.nodes.has(fromB.id)) onlyInB.add(fromB.id);\n    else if (intersects(fromB.upstream, different)) different.add(fromB.id);\n  });\n\n  return { onlyInA, onlyInB, different };\n}\n"],"mappings":";;;AAKA,SAAgB,UAAU,WAA8C;AACtE,QAAO,EACL,EAAE,OAAO,YAAY;AACnB,OAAK,MAAM,KAAK,UAAU,OAAQ,MAAK,MAAM,KAAK,EAAE,OAAQ,OAAM;IAErE;;AA4BH,IAAa,aAAb,MAAwB;;CAEtB,AAAgB;CAEhB,YAAY,OAAoC;AAC9C,OAAK,QAAQ;;CAGf,AAAO,YAAY,WAAgC,GAAG,cAAqC;EACzF,MAAM,sBAAM,IAAI,KAAa;AAC7B,OAAK,SAAS,WAAW,eAAe,SAAS,IAAI,IAAI,KAAK,GAAG,CAAC;AAClE,SAAO;;CAGT,AAAO,0BACL,WACA,GAAG,cACU;EACb,MAAM,SAAS,KAAK,YAAY,WAAW,GAAG,aAAa;AAC3D,OAAK,MAAM,KAAK,aAAc,QAAO,OAAO,EAAE;AAC9C,SAAO;;CAGT,AAAO,SACL,WACA,cACA,IACM;EACN,IAAI,cAAc,CAAC,GAAG,aAAa;EAEnC,MAAM,SAAS,IAAI,IAAY,YAAY;AAC3C,SAAO,YAAY,SAAS,GAAG;GAC7B,MAAM,kBAA4B,EAAE;AACpC,QAAK,MAAM,WAAW,aAAa;IACjC,MAAM,OAAO,KAAK,MAAM,IAAI,QAAQ;AACpC,OAAG,KAAK;AACR,SAAK,WAAW,SAAS,MAAM;AAC7B,SAAI,CAAC,OAAO,IAAI,EAAE,EAAE;AAClB,aAAO,IAAI,EAAE;AACb,sBAAgB,KAAK,EAAE;;MAEzB;;AAEJ,iBAAc;;;;AAKpB,SAAgB,aAAa,WAA6B;CAExD,MAAM,yBAAS,IAAI,KAAoB;CAOvC,IAAI,WAA8B;AAClC,MAAK,MAAM,EAAE,QAAQ,UAAU,UAAU,EAAE;EACzC,MAAM,UAAiB;GACjB;GACJ,mBAAmB;GACpB;AACD,SAAO,IAAI,IAAI,QAAQ;AACvB,MAAI,aAAa,QAAW;AAC1B,WAAQ,iBAAiB,QAAQ,2BAAW,IAAI,KAAa;AAC7D,WAAQ,cAAc,QAAQ,oCAAoB,IAAI,KAAa;SAC9D;AACL,WAAQ,iBAAiB,QAAQ,WAAW,IAAI,IAAY,CAAC,SAAS,GAAG,CAAC;AAC1E,YAAS,mBAAmB,SAAS,aAAa,IAAI,IAAY,CAAC,QAAQ,GAAG,CAAC;AAC/E,YAAS,cAAc,SAAS,oCAAoB,IAAI,KAAa;;AAGvE,aAAW;;AAEb,KAAI,aAAa,OAAW,UAAS,mBAAmB,SAAS,6BAAa,IAAI,KAAa;AAE/F,QAAO,IAAI,WAAW,OAAsC;;AAQ9D,SAAgB,gBACd,WACA,cACY;CACZ,MAAM,4BAAY,IAAI,KAA6B;CAGnD,MAAM,cAAc,IAAI,WAAW,UAAU;CAK7C,MAAM,2BAAW,IAAI,KAAa;AAClC,MAAK,MAAM,EAAE,QAAQ,UAAU,UAAU,EAAE;EACzC,MAAM,OAAO,aAAa,GAAG;AAG7B,MAAI,SAAS,OAAW;EAExB,MAAM,aAAaA,sCAAyB,KAAK,MAAM,SAAS;EAIhE,MAAM,qBAAqB,IAAI,IAAI,CACjC,GAAG,WAAW,WACd,GAAG,YAAY,YAAY,eAAe,GAAG,WAAW,8BAA8B,CACvF,CAAC;EAIF,MAAM,4BAAY,IAAI,KAAa;AACnC,OAAK,MAAM,EAAE,IAAI,SAAS,UAAU,UAAU,EAAE;AAC9C,OAAI,QAAQ,GAAI;AAChB,OAAI,mBAAmB,IAAI,IAAI,EAAE;AAC/B,cAAU,IAAI,IAAI;AAClB,SAAK,MAAM,sBAAsB,YAAY,0BAA0B,YAAY,IAAI,CACrF,WAAU,OAAO,mBAAmB;;;EAK1C,MAAM,oBACJ,KAAK,sBAAsB,SACvB,IAAI,IAAI,WAAW,UAAU,GAC7B,IAAI,IAAI,KAAK,kBAAkB,KAAK,MAAM,EAAE,QAAQ,CAAC;EAE3D,MAAM,OAAuB;GAC3B;GACA,mBAAmB,WAAW;GAC9B,UAAU;GACV,gBAAgB,WAAW;GAC3B;GACA,4BAAY,IAAI,KAAa;GAC7B,kCAAkB,IAAI,KAAa;GACnC,6BAAa,IAAI,KAAa;GAC/B;AACD,YAAU,IAAI,IAAI,KAAK;AACvB,aAAW,UAAU,SAAS,QAAQ,UAAU,IAAI,IAAI,CAAE,iBAAiB,IAAI,GAAG,CAAC;AACnF,YAAU,SAAS,QAAQ,UAAU,IAAI,IAAI,CAAE,WAAW,IAAI,GAAG,CAAC;AAClE,oBAAkB,SAAS,QAAQ,UAAU,IAAI,IAAI,EAAE,YAAY,IAAI,GAAG,CAAC;AAC3E,WAAS,IAAI,GAAG;;AAGlB,QAAO;;AAGT,SAAS,UAAa,GAAW,GAAoB;AACnD,KAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,MAAK,MAAM,KAAK,EAAG,KAAI,CAAC,EAAE,IAAI,EAAE,CAAE,QAAO;AACzC,QAAO;;AAGT,SAAS,WAAc,GAAW,GAAoB;AACpD,KAAI,EAAE,OAAO,EAAE,KAAM,QAAO,WAAW,GAAG,EAAE;AAC5C,MAAK,MAAM,KAAK,EAAG,KAAI,EAAE,IAAI,EAAE,CAAE,QAAO;AACxC,QAAO;;AAWT,SAAgB,UAAU,GAAe,GAA0B;CACjE,MAAM,0BAAU,IAAI,KAAa;CACjC,MAAM,0BAAU,IAAI,KAAa;CACjC,MAAM,4BAAY,IAAI,KAAa;AACnC,GAAE,MAAM,SAAS,UAAU;EACzB,MAAM,QAAQ,EAAE,MAAM,IAAI,MAAM,GAAG;AACnC,MAAI,UAAU,OAAW,SAAQ,IAAI,MAAM,GAAG;WACrC,CAAC,UAAU,MAAM,UAAU,MAAM,SAAS,IAAI,WAAW,MAAM,UAAU,UAAU,CAC1F,WAAU,IAAI,MAAM,GAAG;GACzB;AAEF,GAAE,MAAM,SAAS,UAAU;AACzB,MAAI,CAAC,EAAE,MAAM,IAAI,MAAM,GAAG,CAAE,SAAQ,IAAI,MAAM,GAAG;WACxC,WAAW,MAAM,UAAU,UAAU,CAAE,WAAU,IAAI,MAAM,GAAG;GACvE;AAEF,QAAO;EAAE;EAAS;EAAS;EAAW"}