@milaboratories/pl-middle-layer 1.42.2 → 1.42.3

package/dist/model/project_model.cjs

@@ -0,0 +1,74 @@
+'use strict';
+
+const InitialBlockStructure = {
+    groups: [{ id: 'default', label: 'Default', blocks: [] }],
+};
+const InitialProjectRenderingState = {
+    stagingRefreshTimestamp: 0,
+    blocksInLimbo: [],
+};
+const InitialBlockMeta = {
+    label: 'New Project',
+};
+//
+// Pl Model
+//
+const ProjectResourceType = { name: 'UserProject', version: '2' };
+const SchemaVersionKey = 'SchemaVersion';
+const SchemaVersionCurrent = '2';
+const ProjectCreatedTimestamp = 'ProjectCreated';
+const ProjectLastModifiedTimestamp = 'ProjectLastModified';
+const ProjectMetaKey = 'ProjectMeta';
+const ProjectStructureKey = 'ProjectStructure';
+const BlockRenderingStateKey = 'BlockRenderingState';
+const BlockArgsAuthorKeyPrefix = 'BlockArgsAuthor/';
+function blockArgsAuthorKey(blockId) {
+    return `${BlockArgsAuthorKeyPrefix}${blockId}`;
+}
+const ProjectStructureAuthorKey = 'ProjectStructureAuthor';
+const ServiceTemplateCacheFieldPrefix = '__serviceTemplate_';
+function getServiceTemplateField(hash) {
+    return `${ServiceTemplateCacheFieldPrefix}${hash}`;
+}
+const FieldsToDuplicate = new Set([
+    'blockPack',
+    'blockSettings',
+    'uiState',
+    'prodArgs',
+    'currentArgs',
+    'prodCtx',
+    'prodUiCtx',
+    'prodOutput',
+]);
+function projectFieldName(blockId, fieldName) {
+    return `${blockId}-${fieldName}`;
+}
+const projectFieldPattern = /^(?<blockId>.*)-(?<fieldName>blockPack|blockSettings|uiState|prodArgs|currentArgs|prodCtx|prodUiCtx|prodOutput|prodCtxPrevious|prodUiCtxPrevious|prodOutputPrevious|stagingCtx|stagingUiCtx|stagingOutput|stagingCtxPrevious|stagingUiCtxPrevious|stagingOutputPrevious)$/;
+function parseProjectField(name) {
+    const match = name.match(projectFieldPattern);
+    if (match === null)
+        return undefined;
+    const { blockId, fieldName } = match.groups;
+    return { blockId, fieldName };
+}
+
+exports.BlockArgsAuthorKeyPrefix = BlockArgsAuthorKeyPrefix;
+exports.BlockRenderingStateKey = BlockRenderingStateKey;
+exports.FieldsToDuplicate = FieldsToDuplicate;
+exports.InitialBlockMeta = InitialBlockMeta;
+exports.InitialBlockStructure = InitialBlockStructure;
+exports.InitialProjectRenderingState = InitialProjectRenderingState;
+exports.ProjectCreatedTimestamp = ProjectCreatedTimestamp;
+exports.ProjectLastModifiedTimestamp = ProjectLastModifiedTimestamp;
+exports.ProjectMetaKey = ProjectMetaKey;
+exports.ProjectResourceType = ProjectResourceType;
+exports.ProjectStructureAuthorKey = ProjectStructureAuthorKey;
+exports.ProjectStructureKey = ProjectStructureKey;
+exports.SchemaVersionCurrent = SchemaVersionCurrent;
+exports.SchemaVersionKey = SchemaVersionKey;
+exports.ServiceTemplateCacheFieldPrefix = ServiceTemplateCacheFieldPrefix;
+exports.blockArgsAuthorKey = blockArgsAuthorKey;
+exports.getServiceTemplateField = getServiceTemplateField;
+exports.parseProjectField = parseProjectField;
+exports.projectFieldName = projectFieldName;
+//# sourceMappingURL=project_model.cjs.map

package/dist/model/project_model.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"project_model.cjs","sources":["../../src/model/project_model.ts"],"sourcesContent":["import type { ResourceId, ResourceType } from '@milaboratories/pl-client';\nimport type {\n  ProjectListEntry as ProjectListEntryFromModel,\n  ProjectMeta,\n} from '@milaboratories/pl-model-middle-layer';\nimport type { BlockRenderingMode } from '@platforma-sdk/model';\n\nexport interface ProjectListEntry extends ProjectListEntryFromModel {\n  /** Project resource ID. */\n  rid: ResourceId;\n}\n\n/** Entry representing a single block in block structure */\nexport interface Block {\n  /** Unique block id */\n  readonly id: string;\n\n  /**\n   * Label shown to the user\n   * @deprecated\n   * */\n  label: string;\n\n  /** How to approach block rendering */\n  renderingMode: BlockRenderingMode;\n}\n\n/** Block group in block structure */\nexport interface BlockGroup {\n  /** Unique group id */\n  readonly id: string;\n\n  /** Label shown to the user */\n  label: string;\n\n  /** Blocks */\n  blocks: Block[];\n}\n\n/** Root of block structure value */\nexport interface ProjectStructure {\n  /** The structure */\n  readonly groups: BlockGroup[];\n}\n\nexport const InitialBlockStructure: ProjectStructure = {\n  groups: [{ id: 'default', label: 'Default', blocks: [] }],\n};\n\n/** Root of project rendering state */\nexport interface ProjectRenderingState {\n  /** Timestamp of last staging rendering event */\n  stagingRefreshTimestamp: number;\n\n  /** Blocks with detached production state, i.e. some of the dependencies of\n   * such blocks were re-rendered, but their state was left \"as is\". */\n  blocksInLimbo: string[];\n}\n\nexport const InitialProjectRenderingState: ProjectRenderingState = {\n  stagingRefreshTimestamp: 0,\n  blocksInLimbo: [],\n};\n\nexport const InitialBlockMeta: ProjectMeta = {\n  label: 'New Project',\n};\n\n//\n// Pl Model\n//\n\nexport const ProjectResourceType: ResourceType = { name: 'UserProject', version: '2' };\n\nexport const SchemaVersionKey = 'SchemaVersion';\nexport const SchemaVersionCurrent = '2';\n\nexport const ProjectCreatedTimestamp = 'ProjectCreated';\nexport const ProjectLastModifiedTimestamp = 'ProjectLastModified';\nexport const ProjectMetaKey = 'ProjectMeta';\nexport const ProjectStructureKey = 'ProjectStructure';\nexport const BlockRenderingStateKey = 'BlockRenderingState';\n\nexport const BlockArgsAuthorKeyPrefix = 'BlockArgsAuthor/';\nexport const BlockArgsAuthorKeyPattern = /^BlockArgsAuthor\\/(?<blockid>.*)$/;\n\nexport function blockArgsAuthorKey(blockId: string): string {\n  return `${BlockArgsAuthorKeyPrefix}${blockId}`;\n}\n\nexport const ProjectStructureAuthorKey = 'ProjectStructureAuthor';\n\nexport const ServiceTemplateCacheFieldPrefix = '__serviceTemplate_';\n\nexport function getServiceTemplateField(hash: string): string {\n  return `${ServiceTemplateCacheFieldPrefix}${hash}`;\n}\n\nexport interface ProjectField {\n  blockId: string;\n  fieldName:\n    | 'blockPack'\n    | 'blockSettings'\n    | 'uiState'\n    | 'prodArgs'\n    | 'currentArgs'\n    | 'prodCtx'\n    | 'prodUiCtx'\n    | 'prodOutput'\n    | 'prodCtxPrevious'\n    | 'prodUiCtxPrevious'\n    | 'prodOutputPrevious'\n    | 'stagingCtx'\n    | 'stagingUiCtx'\n    | 'stagingOutput'\n    | 'stagingCtxPrevious'\n    | 'stagingUiCtxPrevious'\n    | 'stagingOutputPrevious';\n}\n\nexport const FieldsToDuplicate: Set<ProjectField['fieldName']> = new Set([\n  'blockPack',\n  'blockSettings',\n  'uiState',\n  'prodArgs',\n  'currentArgs',\n  'prodCtx',\n  'prodUiCtx',\n  'prodOutput',\n]);\n\nexport function projectFieldName(blockId: string, fieldName: ProjectField['fieldName']): string {\n  return `${blockId}-${fieldName}`;\n}\n\nconst projectFieldPattern\n  = /^(?<blockId>.*)-(?<fieldName>blockPack|blockSettings|uiState|prodArgs|currentArgs|prodCtx|prodUiCtx|prodOutput|prodCtxPrevious|prodUiCtxPrevious|prodOutputPrevious|stagingCtx|stagingUiCtx|stagingOutput|stagingCtxPrevious|stagingUiCtxPrevious|stagingOutputPrevious)$/;\n\nexport function parseProjectField(name: string): ProjectField | undefined {\n  const match = name.match(projectFieldPattern);\n  if (match === null) return undefined;\n  const { blockId, fieldName } = match.groups!;\n  return { blockId, fieldName } as ProjectField;\n}\n"],"names":[],"mappings":";;AA6CO,MAAM,qBAAqB,GAAqB;AACrD,IAAA,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;;AAapD,MAAM,4BAA4B,GAA0B;AACjE,IAAA,uBAAuB,EAAE,CAAC;AAC1B,IAAA,aAAa,EAAE,EAAE;;AAGZ,MAAM,gBAAgB,GAAgB;AAC3C,IAAA,KAAK,EAAE,aAAa;;AAGtB;AACA;AACA;AAEO,MAAM,mBAAmB,GAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG;AAE7E,MAAM,gBAAgB,GAAG;AACzB,MAAM,oBAAoB,GAAG;AAE7B,MAAM,uBAAuB,GAAG;AAChC,MAAM,4BAA4B,GAAG;AACrC,MAAM,cAAc,GAAG;AACvB,MAAM,mBAAmB,GAAG;AAC5B,MAAM,sBAAsB,GAAG;AAE/B,MAAM,wBAAwB,GAAG;AAGlC,SAAU,kBAAkB,CAAC,OAAe,EAAA;AAChD,IAAA,OAAO,CAAA,EAAG,wBAAwB,CAAA,EAAG,OAAO,EAAE;AAChD;AAEO,MAAM,yBAAyB,GAAG;AAElC,MAAM,+BAA+B,GAAG;AAEzC,SAAU,uBAAuB,CAAC,IAAY,EAAA;AAClD,IAAA,OAAO,CAAA,EAAG,+BAA+B,CAAA,EAAG,IAAI,EAAE;AACpD;AAwBO,MAAM,iBAAiB,GAAmC,IAAI,GAAG,CAAC;IACvE,WAAW;IACX,eAAe;IACf,SAAS;IACT,UAAU;IACV,aAAa;IACb,SAAS;IACT,WAAW;IACX,YAAY;AACb,CAAA;AAEK,SAAU,gBAAgB,CAAC,OAAe,EAAE,SAAoC,EAAA;AACpF,IAAA,OAAO,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,SAAS,EAAE;AAClC;AAEA,MAAM,mBAAmB,GACrB,2QAA2Q;AAEzQ,SAAU,iBAAiB,CAAC,IAAY,EAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC;IAC7C,IAAI,KAAK,KAAK,IAAI;AAAE,QAAA,OAAO,SAAS;IACpC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC,MAAO;AAC5C,IAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAkB;AAC/C;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/model/project_model.d.ts

@@ -63,4 +63,3 @@ export interface ProjectField {
 export declare const FieldsToDuplicate: Set<ProjectField['fieldName']>;
 export declare function projectFieldName(blockId: string, fieldName: ProjectField['fieldName']): string;
 export declare function parseProjectField(name: string): ProjectField | undefined;
-//# sourceMappingURL=project_model.d.ts.map

package/dist/model/project_model.js

@@ -0,0 +1,54 @@
+const InitialBlockStructure = {
+    groups: [{ id: 'default', label: 'Default', blocks: [] }],
+};
+const InitialProjectRenderingState = {
+    stagingRefreshTimestamp: 0,
+    blocksInLimbo: [],
+};
+const InitialBlockMeta = {
+    label: 'New Project',
+};
+//
+// Pl Model
+//
+const ProjectResourceType = { name: 'UserProject', version: '2' };
+const SchemaVersionKey = 'SchemaVersion';
+const SchemaVersionCurrent = '2';
+const ProjectCreatedTimestamp = 'ProjectCreated';
+const ProjectLastModifiedTimestamp = 'ProjectLastModified';
+const ProjectMetaKey = 'ProjectMeta';
+const ProjectStructureKey = 'ProjectStructure';
+const BlockRenderingStateKey = 'BlockRenderingState';
+const BlockArgsAuthorKeyPrefix = 'BlockArgsAuthor/';
+function blockArgsAuthorKey(blockId) {
+    return `${BlockArgsAuthorKeyPrefix}${blockId}`;
+}
+const ProjectStructureAuthorKey = 'ProjectStructureAuthor';
+const ServiceTemplateCacheFieldPrefix = '__serviceTemplate_';
+function getServiceTemplateField(hash) {
+    return `${ServiceTemplateCacheFieldPrefix}${hash}`;
+}
+const FieldsToDuplicate = new Set([
+    'blockPack',
+    'blockSettings',
+    'uiState',
+    'prodArgs',
+    'currentArgs',
+    'prodCtx',
+    'prodUiCtx',
+    'prodOutput',
+]);
+function projectFieldName(blockId, fieldName) {
+    return `${blockId}-${fieldName}`;
+}
+const projectFieldPattern = /^(?<blockId>.*)-(?<fieldName>blockPack|blockSettings|uiState|prodArgs|currentArgs|prodCtx|prodUiCtx|prodOutput|prodCtxPrevious|prodUiCtxPrevious|prodOutputPrevious|stagingCtx|stagingUiCtx|stagingOutput|stagingCtxPrevious|stagingUiCtxPrevious|stagingOutputPrevious)$/;
+function parseProjectField(name) {
+    const match = name.match(projectFieldPattern);
+    if (match === null)
+        return undefined;
+    const { blockId, fieldName } = match.groups;
+    return { blockId, fieldName };
+}
+
+export { BlockArgsAuthorKeyPrefix, BlockRenderingStateKey, FieldsToDuplicate, InitialBlockMeta, InitialBlockStructure, InitialProjectRenderingState, ProjectCreatedTimestamp, ProjectLastModifiedTimestamp, ProjectMetaKey, ProjectResourceType, ProjectStructureAuthorKey, ProjectStructureKey, SchemaVersionCurrent, SchemaVersionKey, ServiceTemplateCacheFieldPrefix, blockArgsAuthorKey, getServiceTemplateField, parseProjectField, projectFieldName };
+//# sourceMappingURL=project_model.js.map

package/dist/model/project_model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project_model.js","sources":["../../src/model/project_model.ts"],"sourcesContent":["import type { ResourceId, ResourceType } from '@milaboratories/pl-client';\nimport type {\n  ProjectListEntry as ProjectListEntryFromModel,\n  ProjectMeta,\n} from '@milaboratories/pl-model-middle-layer';\nimport type { BlockRenderingMode } from '@platforma-sdk/model';\n\nexport interface ProjectListEntry extends ProjectListEntryFromModel {\n  /** Project resource ID. */\n  rid: ResourceId;\n}\n\n/** Entry representing a single block in block structure */\nexport interface Block {\n  /** Unique block id */\n  readonly id: string;\n\n  /**\n   * Label shown to the user\n   * @deprecated\n   * */\n  label: string;\n\n  /** How to approach block rendering */\n  renderingMode: BlockRenderingMode;\n}\n\n/** Block group in block structure */\nexport interface BlockGroup {\n  /** Unique group id */\n  readonly id: string;\n\n  /** Label shown to the user */\n  label: string;\n\n  /** Blocks */\n  blocks: Block[];\n}\n\n/** Root of block structure value */\nexport interface ProjectStructure {\n  /** The structure */\n  readonly groups: BlockGroup[];\n}\n\nexport const InitialBlockStructure: ProjectStructure = {\n  groups: [{ id: 'default', label: 'Default', blocks: [] }],\n};\n\n/** Root of project rendering state */\nexport interface ProjectRenderingState {\n  /** Timestamp of last staging rendering event */\n  stagingRefreshTimestamp: number;\n\n  /** Blocks with detached production state, i.e. some of the dependencies of\n   * such blocks were re-rendered, but their state was left \"as is\". */\n  blocksInLimbo: string[];\n}\n\nexport const InitialProjectRenderingState: ProjectRenderingState = {\n  stagingRefreshTimestamp: 0,\n  blocksInLimbo: [],\n};\n\nexport const InitialBlockMeta: ProjectMeta = {\n  label: 'New Project',\n};\n\n//\n// Pl Model\n//\n\nexport const ProjectResourceType: ResourceType = { name: 'UserProject', version: '2' };\n\nexport const SchemaVersionKey = 'SchemaVersion';\nexport const SchemaVersionCurrent = '2';\n\nexport const ProjectCreatedTimestamp = 'ProjectCreated';\nexport const ProjectLastModifiedTimestamp = 'ProjectLastModified';\nexport const ProjectMetaKey = 'ProjectMeta';\nexport const ProjectStructureKey = 'ProjectStructure';\nexport const BlockRenderingStateKey = 'BlockRenderingState';\n\nexport const BlockArgsAuthorKeyPrefix = 'BlockArgsAuthor/';\nexport const BlockArgsAuthorKeyPattern = /^BlockArgsAuthor\\/(?<blockid>.*)$/;\n\nexport function blockArgsAuthorKey(blockId: string): string {\n  return `${BlockArgsAuthorKeyPrefix}${blockId}`;\n}\n\nexport const ProjectStructureAuthorKey = 'ProjectStructureAuthor';\n\nexport const ServiceTemplateCacheFieldPrefix = '__serviceTemplate_';\n\nexport function getServiceTemplateField(hash: string): string {\n  return `${ServiceTemplateCacheFieldPrefix}${hash}`;\n}\n\nexport interface ProjectField {\n  blockId: string;\n  fieldName:\n    | 'blockPack'\n    | 'blockSettings'\n    | 'uiState'\n    | 'prodArgs'\n    | 'currentArgs'\n    | 'prodCtx'\n    | 'prodUiCtx'\n    | 'prodOutput'\n    | 'prodCtxPrevious'\n    | 'prodUiCtxPrevious'\n    | 'prodOutputPrevious'\n    | 'stagingCtx'\n    | 'stagingUiCtx'\n    | 'stagingOutput'\n    | 'stagingCtxPrevious'\n    | 'stagingUiCtxPrevious'\n    | 'stagingOutputPrevious';\n}\n\nexport const FieldsToDuplicate: Set<ProjectField['fieldName']> = new Set([\n  'blockPack',\n  'blockSettings',\n  'uiState',\n  'prodArgs',\n  'currentArgs',\n  'prodCtx',\n  'prodUiCtx',\n  'prodOutput',\n]);\n\nexport function projectFieldName(blockId: string, fieldName: ProjectField['fieldName']): string {\n  return `${blockId}-${fieldName}`;\n}\n\nconst projectFieldPattern\n  = /^(?<blockId>.*)-(?<fieldName>blockPack|blockSettings|uiState|prodArgs|currentArgs|prodCtx|prodUiCtx|prodOutput|prodCtxPrevious|prodUiCtxPrevious|prodOutputPrevious|stagingCtx|stagingUiCtx|stagingOutput|stagingCtxPrevious|stagingUiCtxPrevious|stagingOutputPrevious)$/;\n\nexport function parseProjectField(name: string): ProjectField | undefined {\n  const match = name.match(projectFieldPattern);\n  if (match === null) return undefined;\n  const { blockId, fieldName } = match.groups!;\n  return { blockId, fieldName } as ProjectField;\n}\n"],"names":[],"mappings":"AA6CO,MAAM,qBAAqB,GAAqB;AACrD,IAAA,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;;AAapD,MAAM,4BAA4B,GAA0B;AACjE,IAAA,uBAAuB,EAAE,CAAC;AAC1B,IAAA,aAAa,EAAE,EAAE;;AAGZ,MAAM,gBAAgB,GAAgB;AAC3C,IAAA,KAAK,EAAE,aAAa;;AAGtB;AACA;AACA;AAEO,MAAM,mBAAmB,GAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG;AAE7E,MAAM,gBAAgB,GAAG;AACzB,MAAM,oBAAoB,GAAG;AAE7B,MAAM,uBAAuB,GAAG;AAChC,MAAM,4BAA4B,GAAG;AACrC,MAAM,cAAc,GAAG;AACvB,MAAM,mBAAmB,GAAG;AAC5B,MAAM,sBAAsB,GAAG;AAE/B,MAAM,wBAAwB,GAAG;AAGlC,SAAU,kBAAkB,CAAC,OAAe,EAAA;AAChD,IAAA,OAAO,CAAA,EAAG,wBAAwB,CAAA,EAAG,OAAO,EAAE;AAChD;AAEO,MAAM,yBAAyB,GAAG;AAElC,MAAM,+BAA+B,GAAG;AAEzC,SAAU,uBAAuB,CAAC,IAAY,EAAA;AAClD,IAAA,OAAO,CAAA,EAAG,+BAA+B,CAAA,EAAG,IAAI,EAAE;AACpD;AAwBO,MAAM,iBAAiB,GAAmC,IAAI,GAAG,CAAC;IACvE,WAAW;IACX,eAAe;IACf,SAAS;IACT,UAAU;IACV,aAAa;IACb,SAAS;IACT,WAAW;IACX,YAAY;AACb,CAAA;AAEK,SAAU,gBAAgB,CAAC,OAAe,EAAE,SAAoC,EAAA;AACpF,IAAA,OAAO,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,SAAS,EAAE;AAClC;AAEA,MAAM,mBAAmB,GACrB,2QAA2Q;AAEzQ,SAAU,iBAAiB,CAAC,IAAY,EAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC;IAC7C,IAAI,KAAK,KAAK,IAAI;AAAE,QAAA,OAAO,SAAS;IACpC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC,MAAO;AAC5C,IAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAkB;AAC/C;;;;"}

package/dist/model/project_model.test.d.ts

@@ -1,2 +1 @@
 export {};
-//# sourceMappingURL=project_model.test.d.ts.map

package/dist/model/project_model_util.cjs

@@ -0,0 +1,176 @@
+'use strict';
+
+var args = require('./args.cjs');
+
+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;
+        }
+    }
+}
+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);
+}
+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;
+}
+function setsEqual(a, b) {
+    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;
+}
+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 };
+}
+
+exports.BlockGraph = BlockGraph;
+exports.allBlocks = allBlocks;
+exports.graphDiff = graphDiff;
+exports.productionGraph = productionGraph;
+exports.stagingGraph = stagingGraph;
+//# sourceMappingURL=project_model_util.cjs.map

package/dist/model/project_model_util.cjs.map

@@ -0,0 +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 = 'upstream' | 'downstream' | 'directUpstream' | 'directDownstream' | 'enrichments' | '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(\n    direction: BlockGraphDirection,\n    ...rootBlockIds: string[]\n  ): 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 = 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;MAqBa,UAAU,CAAA;;AAEL,IAAA,KAAK;AAErB,IAAA,WAAA,CAAY,KAAkC,EAAA;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK;IACpB;AAEO,IAAA,WAAW,CAChB,SAA8B,EAC9B,GAAG,YAAsB,EAAA;AAEzB,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,GAAG,IAAI,CAAC,iBAAiB,KAAK;AACnD,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;AAEzD,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;;;;;;;;"}

package/dist/model/project_model_util.d.ts

@@ -40,4 +40,3 @@ export interface GraphDiff {
     onlyInB: Set<string>;
 }
 export declare function graphDiff(a: BlockGraph, b: BlockGraph): GraphDiff;
-//# sourceMappingURL=project_model_util.d.ts.map

package/dist/model/project_model_util.js

@@ -0,0 +1,170 @@
+import { inferAllReferencedBlocks } from './args.js';
+
+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;
+        }
+    }
+}
+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);
+}
+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 = 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;
+}
+function setsEqual(a, b) {
+    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;
+}
+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 };
+}
+
+export { BlockGraph, allBlocks, graphDiff, productionGraph, stagingGraph };
+//# sourceMappingURL=project_model_util.js.map

package/dist/model/project_model_util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project_model_util.js","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 = 'upstream' | 'downstream' | 'directUpstream' | 'directDownstream' | 'enrichments' | '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(\n    direction: BlockGraphDirection,\n    ...rootBlockIds: string[]\n  ): 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 = 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":[],"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;MAqBa,UAAU,CAAA;;AAEL,IAAA,KAAK;AAErB,IAAA,WAAA,CAAY,KAAkC,EAAA;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK;IACpB;AAEO,IAAA,WAAW,CAChB,SAA8B,EAC9B,GAAG,YAAsB,EAAA;AAEzB,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,GAAG,wBAAwB,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,GAAG,IAAI,CAAC,iBAAiB,KAAK;AACnD,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;AAEzD,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;;;;"}

package/dist/model/project_model_util.test.d.ts

@@ -1,2 +1 @@
 export {};
-//# sourceMappingURL=project_model_util.test.d.ts.map

package/dist/model/project_model_v1.cjs

@@ -0,0 +1,9 @@
+'use strict';
+
+/** Uses KV for uiState compared to V2 */
+const SchemaVersionV1 = '1';
+const BlockFrontendStateKeyPrefixV1 = 'BlockFrontendState/';
+
+exports.BlockFrontendStateKeyPrefixV1 = BlockFrontendStateKeyPrefixV1;
+exports.SchemaVersionV1 = SchemaVersionV1;
+//# sourceMappingURL=project_model_v1.cjs.map

package/dist/model/project_model_v1.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"project_model_v1.cjs","sources":["../../src/model/project_model_v1.ts"],"sourcesContent":["/** Uses KV for uiState compared to V2 */\nexport const SchemaVersionV1 = '1';\n\nexport const BlockFrontendStateKeyPrefixV1 = 'BlockFrontendState/';\nexport const BlockFrontendStateKeyPatternV1 = /^BlockFrontendState\\/(?<blockid>.*)$/;\n\nexport function blockFrontendStateKeyV1(blockId: string): string {\n  return `${BlockFrontendStateKeyPrefixV1}${blockId}`;\n}\n\n/** Returns block id, or undefined if key does not match the pattern. */\nexport function parseBlockFrontendStateKeyV1(key: string): string | undefined {\n  const match = key.match(BlockFrontendStateKeyPatternV1);\n  if (match === null) return undefined;\n  return match.groups!['blockid'];\n}\n"],"names":[],"mappings":";;AAAA;AACO,MAAM,eAAe,GAAG;AAExB,MAAM,6BAA6B,GAAG;;;;;"}

package/dist/model/project_model_v1.d.ts

@@ -5,4 +5,3 @@ export declare const BlockFrontendStateKeyPatternV1: RegExp;
 export declare function blockFrontendStateKeyV1(blockId: string): string;
 /** Returns block id, or undefined if key does not match the pattern. */
 export declare function parseBlockFrontendStateKeyV1(key: string): string | undefined;
-//# sourceMappingURL=project_model_v1.d.ts.map

package/dist/model/project_model_v1.js

@@ -0,0 +1,6 @@
+/** Uses KV for uiState compared to V2 */
+const SchemaVersionV1 = '1';
+const BlockFrontendStateKeyPrefixV1 = 'BlockFrontendState/';
+
+export { BlockFrontendStateKeyPrefixV1, SchemaVersionV1 };
+//# sourceMappingURL=project_model_v1.js.map

package/dist/model/project_model_v1.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project_model_v1.js","sources":["../../src/model/project_model_v1.ts"],"sourcesContent":["/** Uses KV for uiState compared to V2 */\nexport const SchemaVersionV1 = '1';\n\nexport const BlockFrontendStateKeyPrefixV1 = 'BlockFrontendState/';\nexport const BlockFrontendStateKeyPatternV1 = /^BlockFrontendState\\/(?<blockid>.*)$/;\n\nexport function blockFrontendStateKeyV1(blockId: string): string {\n  return `${BlockFrontendStateKeyPrefixV1}${blockId}`;\n}\n\n/** Returns block id, or undefined if key does not match the pattern. */\nexport function parseBlockFrontendStateKeyV1(key: string): string | undefined {\n  const match = key.match(BlockFrontendStateKeyPatternV1);\n  if (match === null) return undefined;\n  return match.groups!['blockid'];\n}\n"],"names":[],"mappings":"AAAA;AACO,MAAM,eAAe,GAAG;AAExB,MAAM,6BAA6B,GAAG;;;;"}

package/dist/model/template_spec.d.ts

@@ -18,4 +18,3 @@ export interface TemplateFromFile {
 }
 export type TemplateSpecPrepared = TemplateFromRegistry | ExplicitTemplate | PreparedTemplate;
 export type TemplateSpecAny = TemplateSpecPrepared | TemplateFromFile;
-//# sourceMappingURL=template_spec.d.ts.map