@milaboratories/pl-model-common 1.19.7 → 1.19.9

package/dist/drivers/pframe/linker_columns.cjs

@@ -0,0 +1,218 @@
+'use strict';
+
+var json = require('../../json.cjs');
+var spec = require('./spec/spec.cjs');
+
+class LinkerMap {
+    /** Graph of linkers connected by axes (single or grouped by parents) */
+    data;
+    constructor(linkerMap) {
+        this.data = linkerMap;
+    }
+    get keys() {
+        return this.data.keys();
+    }
+    get keyAxesIds() {
+        return [...this.data.keys()].map(json.parseJson);
+    }
+    static fromColumns(columns) {
+        const result = new Map();
+        for (const linker of columns.filter((l) => !!spec.readAnnotationJson(l.spec, spec.Annotation.IsLinkerColumn))) {
+            const groups = LinkerMap.getAxesGroups(spec.getNormalizedAxesList(linker.spec.axesSpec)); // split input axes into groups by parent links from annotation
+            if (groups.length !== 2) {
+                continue; // not a valid linker column
+            }
+            const [left, right] = groups;
+            // In case of group:
+            // A - C
+            //  \_ B _ D
+            // E/
+            // put 2 variants as keys:
+            // A - C
+            //  \_ B _ D
+            // and
+            // E - B - D
+            const leftKeyVariants = LinkerMap.getAxesRoots(left).map((axis) => {
+                const axes = spec.getArrayFromAxisTree(spec.getAxesTree(axis));
+                const key = json.canonicalizeJson(axes.map(spec.getAxisId));
+                return [key, axes];
+            });
+            const rightKeyVariants = LinkerMap.getAxesRoots(right).map((axis) => {
+                const axes = spec.getArrayFromAxisTree(spec.getAxesTree(axis));
+                const key = json.canonicalizeJson(axes.map(spec.getAxisId));
+                return [key, axes];
+            });
+            for (const [keyLeft, spec] of leftKeyVariants) {
+                if (!result.has(keyLeft)) {
+                    result.set(keyLeft, { keyAxesSpec: spec, linkWith: new Map() });
+                }
+            }
+            for (const [keyRight, spec] of rightKeyVariants) {
+                if (!result.has(keyRight)) {
+                    result.set(keyRight, { keyAxesSpec: spec, linkWith: new Map() });
+                }
+            }
+            for (const [keyLeft] of leftKeyVariants) {
+                for (const [keyRight] of rightKeyVariants) {
+                    result.get(keyLeft)?.linkWith.set(keyRight, linker);
+                    result.get(keyRight)?.linkWith.set(keyLeft, linker);
+                }
+            }
+        }
+        return new this(result);
+    }
+    /** Get all available nodes of linker graphs if start from sourceAxesKeys */
+    searchAvailableAxesKeys(sourceAxesKeys) {
+        const startKeys = new Set(sourceAxesKeys);
+        const allAvailableKeys = new Set();
+        let nextKeys = sourceAxesKeys;
+        while (nextKeys.length) {
+            const next = [];
+            for (const key of nextKeys) {
+                const node = this.data.get(key);
+                if (!node)
+                    continue;
+                for (const availableKey of node.linkWith.keys()) {
+                    if (!allAvailableKeys.has(availableKey) && !startKeys.has(availableKey)) {
+                        next.push(availableKey);
+                        allAvailableKeys.add(availableKey);
+                    }
+                }
+            }
+            nextKeys = next;
+        }
+        return allAvailableKeys;
+    }
+    /** Get all linker columns that are necessary to reach endKey from startKey */
+    searchLinkerPath(startKey, endKey) {
+        const previous = {};
+        let nextIds = new Set([startKey]);
+        const visited = new Set([startKey]);
+        while (nextIds.size) {
+            const next = new Set();
+            for (const nextId of nextIds) {
+                const node = this.data.get(nextId);
+                if (!node)
+                    continue;
+                for (const availableId of node.linkWith.keys()) {
+                    previous[availableId] = nextId;
+                    if (availableId === endKey) {
+                        const ids = [];
+                        let current = endKey;
+                        while (previous[current] !== startKey) {
+                            ids.push(current);
+                            current = previous[current];
+                        }
+                        ids.push(current);
+                        return ids.map((id) => this.data.get(id).linkWith.get(previous[id]));
+                    }
+                    else if (!visited.has(availableId)) {
+                        next.add(availableId);
+                        visited.add(availableId);
+                    }
+                }
+            }
+            nextIds = next;
+        }
+        return [];
+    }
+    getLinkerColumnsForAxes({ from: sourceAxes, to: targetAxes, throwWhenNoLinkExists = true, }) {
+        // start keys - all possible keys in linker map using sourceAxes (for example, all axes of block's columns or all axes of columns in data-inputs)
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        return Array.from(new Map(LinkerMap.getAxesRoots(targetAxes)
+            .map(LinkerMap.getLinkerKeyFromAxisSpec) // target keys contain all axes to be linked; if some of target axes has parents they must be in the key
+            .flatMap((targetKey) => {
+            const linkers = startKeys
+                .map((startKey) => this.searchLinkerPath(startKey, targetKey))
+                .reduce((shortestPath, path) => (shortestPath.length && shortestPath.length < path.length) || !path.length ? shortestPath : path, [])
+                .map((linker) => [linker.columnId, linker]);
+            if (!linkers.length && throwWhenNoLinkExists) {
+                throw Error(`Unable to find linker column for ${targetKey}`);
+            }
+            return linkers;
+        })).values());
+    }
+    /** Get list of axisSpecs from keys of linker columns map  */
+    getAxesListFromKeysList(keys) {
+        return Array.from(new Map(keys.flatMap((key) => this.data.get(key)?.keyAxesSpec ?? [])
+            .map((axis) => [json.canonicalizeJson(spec.getAxisId(axis)), axis])).values());
+    }
+    /** Get axes of target axes that are impossible to be linked to source axes with current linker map */
+    getNonLinkableAxes(sourceAxes, targetAxes) {
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        // target keys contain all axes to be linked; if some of target axes has parents they must be in the key
+        const targetKeys = targetAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        const axes = Array.from(new Map(targetAxes
+            .filter((_targetAxis, idx) => {
+            const targetKey = targetKeys[idx];
+            return !startKeys.some((startKey) => this.searchLinkerPath(startKey, targetKey).length);
+        })
+            .flatMap((axis) => spec.getArrayFromAxisTree(spec.getAxesTree(axis)).map((axis) => [json.canonicalizeJson(spec.getAxisId(axis)), axis]))).values());
+        return axes;
+    }
+    /** Get all axes that can be connected to sourceAxes by linkers */
+    getReachableByLinkersAxesFromAxes(sourceAxes) {
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        const availableKeys = this.searchAvailableAxesKeys(startKeys);
+        return this.getAxesListFromKeysList([...availableKeys]);
+    }
+    static getLinkerKeyFromAxisSpec(axis) {
+        return json.canonicalizeJson(spec.getArrayFromAxisTree(spec.getAxesTree(axis)).map(spec.getAxisId));
+    }
+    /**  Split array of axes into several arrays by parents: axes of one group are parents for each other.
+       There are no order inside every group. */
+    static getAxesGroups(axesSpec) {
+        switch (axesSpec.length) {
+            case 0: return [];
+            case 1: return [[axesSpec[0]]];
+        }
+        const axisKeys = axesSpec.map((spec$1) => json.canonicalizeJson(spec.getAxisId(spec$1)));
+        const axisParentsIdxs = axesSpec.map((spec$1) => new Set(spec$1.parentAxesSpec
+            .map((spec$1) => json.canonicalizeJson(spec.getAxisId(spec$1)))
+            .map((el) => {
+            const idx = axisKeys.indexOf(el);
+            if (idx === -1) {
+                throw new Error(`malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`);
+            }
+            return idx;
+        })));
+        const allIdxs = [...axesSpec.keys()];
+        const groups = []; // groups of axis indexes
+        const usedIdxs = new Set();
+        let nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));
+        while (nextFreeEl !== undefined) {
+            const currentGroup = [nextFreeEl];
+            usedIdxs.add(nextFreeEl);
+            let nextElsOfCurrentGroup = [nextFreeEl];
+            while (nextElsOfCurrentGroup.length) {
+                const next = new Set();
+                for (const groupIdx of nextElsOfCurrentGroup) {
+                    const groupElementParents = axisParentsIdxs[groupIdx];
+                    allIdxs.forEach((idx) => {
+                        if (idx === groupIdx || usedIdxs.has(idx)) {
+                            return;
+                        }
+                        const parents = axisParentsIdxs[idx];
+                        if (parents.has(groupIdx) || groupElementParents.has(idx)) {
+                            currentGroup.push(idx);
+                            next.add(idx);
+                            usedIdxs.add(idx);
+                        }
+                    });
+                }
+                nextElsOfCurrentGroup = [...next];
+            }
+            groups.push([...currentGroup]);
+            nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));
+        }
+        return groups.map((group) => group.map((idx) => axesSpec[idx]));
+    }
+    /** Get all axes that are not parents of any other axis */
+    static getAxesRoots(axes) {
+        const parentsSet = new Set(axes.flatMap((axis) => axis.parentAxesSpec).map((spec$1) => json.canonicalizeJson(spec.getAxisId(spec$1))));
+        return axes.filter((axis) => !parentsSet.has(json.canonicalizeJson(spec.getAxisId(axis))));
+    }
+}
+
+exports.LinkerMap = LinkerMap;
+//# sourceMappingURL=linker_columns.cjs.map

package/dist/drivers/pframe/linker_columns.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"linker_columns.cjs","sources":["../../../src/drivers/pframe/linker_columns.ts"],"sourcesContent":["import {\n  canonicalizeJson,\n  parseJson,\n  type CanonicalizedJson,\n} from '../../json';\nimport {\n  Annotation,\n  readAnnotationJson,\n  type AxisSpec,\n  type PColumnIdAndSpec,\n  type AxisSpecNormalized,\n  type AxisId,\n  getAxisId,\n  getNormalizedAxesList,\n  getArrayFromAxisTree,\n  getAxesTree,\n} from './spec/spec';\n\ntype LinkerKey = CanonicalizedJson<AxisId[]>;\nexport type CompositeLinkerMap = Map<\n  LinkerKey,\n  {\n    keyAxesSpec: AxisSpecNormalized[]; // axis specs - source for the key\n    linkWith: Map<LinkerKey, PColumnIdAndSpec>; // for every axis (possibly in group with parents - available by linkers another axes and corresponding linkers)\n  }\n>;\n\ninterface LinkersData {\n  data: CompositeLinkerMap;\n}\nexport class LinkerMap implements LinkersData {\n  /** Graph of linkers connected by axes (single or grouped by parents) */\n  readonly data: CompositeLinkerMap;\n\n  constructor(linkerMap: CompositeLinkerMap) {\n    this.data = linkerMap;\n  }\n\n  get keys() {\n    return this.data.keys();\n  }\n\n  get keyAxesIds() {\n    return [...this.data.keys()].map(parseJson);\n  }\n\n  static fromColumns(columns: PColumnIdAndSpec[]) {\n    const result: CompositeLinkerMap = new Map();\n    for (const linker of columns.filter((l) => !!readAnnotationJson(l.spec, Annotation.IsLinkerColumn))) {\n      const groups = LinkerMap.getAxesGroups(getNormalizedAxesList(linker.spec.axesSpec)); // split input axes into groups by parent links from annotation\n\n      if (groups.length !== 2) {\n        continue; // not a valid linker column\n      }\n      const [left, right] = groups;\n\n      // In case of group:\n      // A - C\n      //  \\_ B _ D\n      // E/\n      // put 2 variants as keys:\n      // A - C\n      //  \\_ B _ D\n      // and\n      // E - B - D\n      const leftKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(left).map((axis) => {\n        const axes = getArrayFromAxisTree(getAxesTree(axis));\n        const key = canonicalizeJson(axes.map(getAxisId));\n        return [key, axes];\n      });\n      const rightKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(right).map((axis) => {\n        const axes = getArrayFromAxisTree(getAxesTree(axis));\n        const key = canonicalizeJson(axes.map(getAxisId));\n        return [key, axes];\n      });\n\n      for (const [keyLeft, spec] of leftKeyVariants) {\n        if (!result.has(keyLeft)) {\n          result.set(keyLeft, { keyAxesSpec: spec, linkWith: new Map() });\n        }\n      }\n      for (const [keyRight, spec] of rightKeyVariants) {\n        if (!result.has(keyRight)) {\n          result.set(keyRight, { keyAxesSpec: spec, linkWith: new Map() });\n        }\n      }\n      for (const [keyLeft] of leftKeyVariants) {\n        for (const [keyRight] of rightKeyVariants) {\n          result.get(keyLeft)?.linkWith.set(keyRight, linker);\n          result.get(keyRight)?.linkWith.set(keyLeft, linker);\n        }\n      }\n    }\n    return new this(result);\n  }\n\n  /** Get all available nodes of linker graphs if start from sourceAxesKeys */\n  searchAvailableAxesKeys(sourceAxesKeys: LinkerKey[]): Set<LinkerKey> {\n    const startKeys = new Set(sourceAxesKeys);\n    const allAvailableKeys = new Set<LinkerKey>();\n    let nextKeys = sourceAxesKeys;\n    while (nextKeys.length) {\n      const next: LinkerKey[] = [];\n      for (const key of nextKeys) {\n        const node = this.data.get(key);\n        if (!node) continue;\n        for (const availableKey of node.linkWith.keys()) {\n          if (!allAvailableKeys.has(availableKey) && !startKeys.has(availableKey)) {\n            next.push(availableKey);\n            allAvailableKeys.add(availableKey);\n          }\n        }\n      }\n      nextKeys = next;\n    }\n    return allAvailableKeys;\n  }\n\n  /** Get all linker columns that are necessary to reach endKey from startKey */\n  searchLinkerPath(startKey: LinkerKey, endKey: LinkerKey): PColumnIdAndSpec[] {\n    const previous: Record<LinkerKey, LinkerKey> = {};\n    let nextIds = new Set([startKey]);\n    const visited = new Set([startKey]);\n    while (nextIds.size) {\n      const next = new Set<LinkerKey>();\n      for (const nextId of nextIds) {\n        const node = this.data.get(nextId);\n        if (!node) continue;\n        for (const availableId of node.linkWith.keys()) {\n          previous[availableId] = nextId;\n          if (availableId === endKey) {\n            const ids: LinkerKey[] = [];\n            let current = endKey;\n            while (previous[current] !== startKey) {\n              ids.push(current);\n              current = previous[current];\n            }\n            ids.push(current);\n            return ids.map((id: LinkerKey) => this.data.get(id)!.linkWith.get(previous[id])!);\n          } else if (!visited.has(availableId)) {\n            next.add(availableId);\n            visited.add(availableId);\n          }\n        }\n      }\n      nextIds = next;\n    }\n    return [];\n  }\n\n  getLinkerColumnsForAxes({\n    from: sourceAxes,\n    to: targetAxes,\n    throwWhenNoLinkExists = true,\n  }: {\n    from: AxisSpecNormalized[];\n    to: AxisSpecNormalized[];\n    throwWhenNoLinkExists?: boolean;\n  }): PColumnIdAndSpec[] {\n  // start keys - all possible keys in linker map using sourceAxes (for example, all axes of block's columns or all axes of columns in data-inputs)\n    const startKeys: LinkerKey[] = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n\n    return Array.from(\n      new Map(\n        LinkerMap.getAxesRoots(targetAxes)\n          .map(LinkerMap.getLinkerKeyFromAxisSpec) // target keys contain all axes to be linked; if some of target axes has parents they must be in the key\n          .flatMap((targetKey) => {\n            const linkers = startKeys\n              .map((startKey) => this.searchLinkerPath(startKey, targetKey))\n              .reduce((shortestPath, path) => (shortestPath.length && shortestPath.length < path.length) || !path.length ? shortestPath : path,\n                [] as PColumnIdAndSpec[])\n              .map((linker) => [linker.columnId, linker] as const);\n            if (!linkers.length && throwWhenNoLinkExists) {\n              throw Error(`Unable to find linker column for ${targetKey}`);\n            }\n            return linkers;\n          }),\n      ).values(),\n    );\n  }\n\n  /** Get list of axisSpecs from keys of linker columns map  */\n  getAxesListFromKeysList(keys: LinkerKey[]): AxisSpecNormalized[] {\n    return Array.from(\n      new Map(\n        keys.flatMap((key) => this.data.get(key)?.keyAxesSpec ?? [])\n          .map((axis) => [canonicalizeJson(getAxisId(axis)), axis]),\n      ).values(),\n    );\n  }\n\n  /** Get axes of target axes that are impossible to be linked to source axes with current linker map */\n  getNonLinkableAxes(\n    sourceAxes: AxisSpecNormalized[],\n    targetAxes: AxisSpecNormalized[],\n  ): AxisSpecNormalized[] {\n    const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    // target keys contain all axes to be linked; if some of target axes has parents they must be in the key\n    const targetKeys = targetAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n\n    const axes = Array.from(\n      new Map(\n        targetAxes\n          .filter((_targetAxis, idx) => {\n            const targetKey = targetKeys[idx];\n            return !startKeys.some((startKey) => this.searchLinkerPath(startKey, targetKey).length);\n          })\n          .flatMap((axis) => getArrayFromAxisTree(getAxesTree(axis)).map((axis) => [canonicalizeJson(getAxisId(axis)), axis])),\n      ).values(),\n    );\n    return axes;\n  }\n\n  /** Get all axes that can be connected to sourceAxes by linkers */\n  getReachableByLinkersAxesFromAxes(sourceAxes: AxisSpecNormalized[]): AxisSpec[] {\n    const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    const availableKeys = this.searchAvailableAxesKeys(startKeys);\n    return this.getAxesListFromKeysList([...availableKeys]);\n  }\n\n  static getLinkerKeyFromAxisSpec(axis: AxisSpecNormalized): LinkerKey {\n    return canonicalizeJson(getArrayFromAxisTree(getAxesTree(axis)).map(getAxisId));\n  }\n\n  /**  Split array of axes into several arrays by parents: axes of one group are parents for each other.\n     There are no order inside every group. */\n  static getAxesGroups(axesSpec: AxisSpecNormalized[]): AxisSpecNormalized[][] {\n    switch (axesSpec.length) {\n      case 0: return [];\n      case 1: return [[axesSpec[0]]];\n      default: break;\n    }\n\n    const axisKeys = axesSpec.map((spec) => canonicalizeJson(getAxisId(spec)));\n    const axisParentsIdxs = axesSpec.map(\n      (spec) => new Set(\n        spec.parentAxesSpec\n          .map((spec) => canonicalizeJson(getAxisId(spec)))\n          .map((el) => {\n            const idx = axisKeys.indexOf(el);\n            if (idx === -1) {\n              throw new Error(`malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`);\n            }\n            return idx;\n          }),\n      ),\n    );\n\n    const allIdxs = [...axesSpec.keys()];\n    const groups: number[][] = []; // groups of axis indexes\n\n    const usedIdxs = new Set<number>();\n    let nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));\n    while (nextFreeEl !== undefined) {\n      const currentGroup = [nextFreeEl];\n      usedIdxs.add(nextFreeEl);\n\n      let nextElsOfCurrentGroup = [nextFreeEl];\n      while (nextElsOfCurrentGroup.length) {\n        const next = new Set<number>();\n        for (const groupIdx of nextElsOfCurrentGroup) {\n          const groupElementParents = axisParentsIdxs[groupIdx];\n          allIdxs.forEach((idx) => {\n            if (idx === groupIdx || usedIdxs.has(idx)) {\n              return;\n            }\n            const parents = axisParentsIdxs[idx];\n            if (parents.has(groupIdx) || groupElementParents.has(idx)) {\n              currentGroup.push(idx);\n              next.add(idx);\n              usedIdxs.add(idx);\n            }\n          });\n        }\n        nextElsOfCurrentGroup = [...next];\n      }\n\n      groups.push([...currentGroup]);\n      nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));\n    };\n\n    return groups.map((group) => group.map((idx) => axesSpec[idx]));\n  }\n\n  /** Get all axes that are not parents of any other axis */\n  static getAxesRoots(axes: AxisSpecNormalized[]): AxisSpecNormalized[] {\n    const parentsSet = new Set(axes.flatMap((axis) => axis.parentAxesSpec).map((spec) => canonicalizeJson(getAxisId(spec))));\n    return axes.filter((axis) => !parentsSet.has(canonicalizeJson(getAxisId(axis))));\n  }\n}\n"],"names":["parseJson","readAnnotationJson","Annotation","getNormalizedAxesList","getArrayFromAxisTree","getAxesTree","canonicalizeJson","getAxisId","spec"],"mappings":";;;;;MA8Ba,SAAS,CAAA;;AAEX,IAAA,IAAI;AAEb,IAAA,WAAA,CAAY,SAA6B,EAAA;AACvC,QAAA,IAAI,CAAC,IAAI,GAAG,SAAS;IACvB;AAEA,IAAA,IAAI,IAAI,GAAA;AACN,QAAA,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;IACzB;AAEA,IAAA,IAAI,UAAU,GAAA;AACZ,QAAA,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAACA,cAAS,CAAC;IAC7C;IAEA,OAAO,WAAW,CAAC,OAA2B,EAAA;AAC5C,QAAA,MAAM,MAAM,GAAuB,IAAI,GAAG,EAAE;QAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAACC,uBAAkB,CAAC,CAAC,CAAC,IAAI,EAAEC,eAAU,CAAC,cAAc,CAAC,CAAC,EAAE;AACnG,YAAA,MAAM,MAAM,GAAG,SAAS,CAAC,aAAa,CAACC,0BAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AAEpF,YAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;AACvB,gBAAA,SAAS;YACX;AACA,YAAA,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM;;;;;;;;;;AAW5B,YAAA,MAAM,eAAe,GAAwC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;gBACrG,MAAM,IAAI,GAAGC,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC;gBACpD,MAAM,GAAG,GAAGC,qBAAgB,CAAC,IAAI,CAAC,GAAG,CAACC,cAAS,CAAC,CAAC;AACjD,gBAAA,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC;AACpB,YAAA,CAAC,CAAC;AACF,YAAA,MAAM,gBAAgB,GAAwC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;gBACvG,MAAM,IAAI,GAAGH,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC;gBACpD,MAAM,GAAG,GAAGC,qBAAgB,CAAC,IAAI,CAAC,GAAG,CAACC,cAAS,CAAC,CAAC;AACjD,gBAAA,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC;AACpB,YAAA,CAAC,CAAC;YAEF,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,eAAe,EAAE;gBAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;AACxB,oBAAA,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;gBACjE;YACF;YACA,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,gBAAgB,EAAE;gBAC/C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;AACzB,oBAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;gBAClE;YACF;AACA,YAAA,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,eAAe,EAAE;AACvC,gBAAA,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,EAAE;AACzC,oBAAA,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnD,oBAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC;gBACrD;YACF;QACF;AACA,QAAA,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC;IACzB;;AAGA,IAAA,uBAAuB,CAAC,cAA2B,EAAA;AACjD,QAAA,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC;AACzC,QAAA,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAa;QAC7C,IAAI,QAAQ,GAAG,cAAc;AAC7B,QAAA,OAAO,QAAQ,CAAC,MAAM,EAAE;YACtB,MAAM,IAAI,GAAgB,EAAE;AAC5B,YAAA,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;gBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC/B,gBAAA,IAAI,CAAC,IAAI;oBAAE;gBACX,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE;AAC/C,oBAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;AACvE,wBAAA,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;AACvB,wBAAA,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC;oBACpC;gBACF;YACF;YACA,QAAQ,GAAG,IAAI;QACjB;AACA,QAAA,OAAO,gBAAgB;IACzB;;IAGA,gBAAgB,CAAC,QAAmB,EAAE,MAAiB,EAAA;QACrD,MAAM,QAAQ,GAAiC,EAAE;QACjD,IAAI,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAA,OAAO,OAAO,CAAC,IAAI,EAAE;AACnB,YAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa;AACjC,YAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;AAClC,gBAAA,IAAI,CAAC,IAAI;oBAAE;gBACX,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE;AAC9C,oBAAA,QAAQ,CAAC,WAAW,CAAC,GAAG,MAAM;AAC9B,oBAAA,IAAI,WAAW,KAAK,MAAM,EAAE;wBAC1B,MAAM,GAAG,GAAgB,EAAE;wBAC3B,IAAI,OAAO,GAAG,MAAM;AACpB,wBAAA,OAAO,QAAQ,CAAC,OAAO,CAAC,KAAK,QAAQ,EAAE;AACrC,4BAAA,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;AACjB,4BAAA,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;wBAC7B;AACA,wBAAA,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;AACjB,wBAAA,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAa,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAE,CAAC;oBACnF;yBAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;AACpC,wBAAA,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;AACrB,wBAAA,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC;oBAC1B;gBACF;YACF;YACA,OAAO,GAAG,IAAI;QAChB;AACA,QAAA,OAAO,EAAE;IACX;AAEA,IAAA,uBAAuB,CAAC,EACtB,IAAI,EAAE,UAAU,EAChB,EAAE,EAAE,UAAU,EACd,qBAAqB,GAAG,IAAI,GAK7B,EAAA;;QAEC,MAAM,SAAS,GAAgB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;AAEjF,QAAA,OAAO,KAAK,CAAC,IAAI,CACf,IAAI,GAAG,CACL,SAAS,CAAC,YAAY,CAAC,UAAU;AAC9B,aAAA,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;AACvC,aAAA,OAAO,CAAC,CAAC,SAAS,KAAI;YACrB,MAAM,OAAO,GAAG;AACb,iBAAA,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC5D,iBAAA,MAAM,CAAC,CAAC,YAAY,EAAE,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,EAC9H,EAAwB;AACzB,iBAAA,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAU,CAAC;AACtD,YAAA,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,qBAAqB,EAAE;AAC5C,gBAAA,MAAM,KAAK,CAAC,CAAA,iCAAA,EAAoC,SAAS,CAAA,CAAE,CAAC;YAC9D;AACA,YAAA,OAAO,OAAO;AAChB,QAAA,CAAC,CAAC,CACL,CAAC,MAAM,EAAE,CACX;IACH;;AAGA,IAAA,uBAAuB,CAAC,IAAiB,EAAA;AACvC,QAAA,OAAO,KAAK,CAAC,IAAI,CACf,IAAI,GAAG,CACL,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,IAAI,EAAE;aACxD,GAAG,CAAC,CAAC,IAAI,KAAK,CAACD,qBAAgB,CAACC,cAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAC5D,CAAC,MAAM,EAAE,CACX;IACH;;IAGA,kBAAkB,CAChB,UAAgC,EAChC,UAAgC,EAAA;QAEhC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;;QAEpE,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;QAErE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CACrB,IAAI,GAAG,CACL;AACG,aAAA,MAAM,CAAC,CAAC,WAAW,EAAE,GAAG,KAAI;AAC3B,YAAA,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC;YACjC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,MAAM,CAAC;AACzF,QAAA,CAAC;AACA,aAAA,OAAO,CAAC,CAAC,IAAI,KAAKH,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAACC,qBAAgB,CAACC,cAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CACvH,CAAC,MAAM,EAAE,CACX;AACD,QAAA,OAAO,IAAI;IACb;;AAGA,IAAA,iCAAiC,CAAC,UAAgC,EAAA;QAChE,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;QACpE,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC;QAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IACzD;IAEA,OAAO,wBAAwB,CAAC,IAAwB,EAAA;AACtD,QAAA,OAAOD,qBAAgB,CAACF,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAACE,cAAS,CAAC,CAAC;IACjF;AAEA;AAC4C;IAC5C,OAAO,aAAa,CAAC,QAA8B,EAAA;AACjD,QAAA,QAAQ,QAAQ,CAAC,MAAM;AACrB,YAAA,KAAK,CAAC,EAAE,OAAO,EAAE;AACjB,YAAA,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;;AAIhC,QAAA,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAACC,MAAI,KAAKF,qBAAgB,CAACC,cAAS,CAACC,MAAI,CAAC,CAAC,CAAC;AAC1E,QAAA,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAClC,CAACA,MAAI,KAAK,IAAI,GAAG,CACfA,MAAI,CAAC;AACF,aAAA,GAAG,CAAC,CAACA,MAAI,KAAKF,qBAAgB,CAACC,cAAS,CAACC,MAAI,CAAC,CAAC;AAC/C,aAAA,GAAG,CAAC,CAAC,EAAE,KAAI;YACV,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;AAChC,YAAA,IAAI,GAAG,KAAK,EAAE,EAAE;AACd,gBAAA,MAAM,IAAI,KAAK,CAAC,CAAA,oBAAA,EAAuB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA,0BAAA,EAA6B,EAAE,CAAA,CAAE,CAAC;YACnG;AACA,YAAA,OAAO,GAAG;QACZ,CAAC,CAAC,CACL,CACF;QAED,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;AACpC,QAAA,MAAM,MAAM,GAAe,EAAE,CAAC;AAE9B,QAAA,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU;AAClC,QAAA,IAAI,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC1D,QAAA,OAAO,UAAU,KAAK,SAAS,EAAE;AAC/B,YAAA,MAAM,YAAY,GAAG,CAAC,UAAU,CAAC;AACjC,YAAA,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC;AAExB,YAAA,IAAI,qBAAqB,GAAG,CAAC,UAAU,CAAC;AACxC,YAAA,OAAO,qBAAqB,CAAC,MAAM,EAAE;AACnC,gBAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU;AAC9B,gBAAA,KAAK,MAAM,QAAQ,IAAI,qBAAqB,EAAE;AAC5C,oBAAA,MAAM,mBAAmB,GAAG,eAAe,CAAC,QAAQ,CAAC;AACrD,oBAAA,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,KAAI;wBACtB,IAAI,GAAG,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;4BACzC;wBACF;AACA,wBAAA,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC;AACpC,wBAAA,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AACzD,4BAAA,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;AACtB,4BAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACb,4BAAA,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;wBACnB;AACF,oBAAA,CAAC,CAAC;gBACJ;AACA,gBAAA,qBAAqB,GAAG,CAAC,GAAG,IAAI,CAAC;YACnC;YAEA,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;AAC9B,YAAA,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxD;QAEA,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE;;IAGA,OAAO,YAAY,CAAC,IAA0B,EAAA;AAC5C,QAAA,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAACA,MAAI,KAAKF,qBAAgB,CAACC,cAAS,CAACC,MAAI,CAAC,CAAC,CAAC,CAAC;QACxH,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAACF,qBAAgB,CAACC,cAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF;AACD;;;;"}

package/dist/drivers/pframe/linker_columns.d.ts

@@ -40,4 +40,3 @@ export declare class LinkerMap implements LinkersData {
     static getAxesRoots(axes: AxisSpecNormalized[]): AxisSpecNormalized[];
 }
 export {};
-//# sourceMappingURL=linker_columns.d.ts.map

package/dist/drivers/pframe/linker_columns.js

@@ -0,0 +1,216 @@
+import { parseJson, canonicalizeJson } from '../../json.js';
+import { readAnnotationJson, Annotation, getNormalizedAxesList, getArrayFromAxisTree, getAxesTree, getAxisId } from './spec/spec.js';
+
+class LinkerMap {
+    /** Graph of linkers connected by axes (single or grouped by parents) */
+    data;
+    constructor(linkerMap) {
+        this.data = linkerMap;
+    }
+    get keys() {
+        return this.data.keys();
+    }
+    get keyAxesIds() {
+        return [...this.data.keys()].map(parseJson);
+    }
+    static fromColumns(columns) {
+        const result = new Map();
+        for (const linker of columns.filter((l) => !!readAnnotationJson(l.spec, Annotation.IsLinkerColumn))) {
+            const groups = LinkerMap.getAxesGroups(getNormalizedAxesList(linker.spec.axesSpec)); // split input axes into groups by parent links from annotation
+            if (groups.length !== 2) {
+                continue; // not a valid linker column
+            }
+            const [left, right] = groups;
+            // In case of group:
+            // A - C
+            //  \_ B _ D
+            // E/
+            // put 2 variants as keys:
+            // A - C
+            //  \_ B _ D
+            // and
+            // E - B - D
+            const leftKeyVariants = LinkerMap.getAxesRoots(left).map((axis) => {
+                const axes = getArrayFromAxisTree(getAxesTree(axis));
+                const key = canonicalizeJson(axes.map(getAxisId));
+                return [key, axes];
+            });
+            const rightKeyVariants = LinkerMap.getAxesRoots(right).map((axis) => {
+                const axes = getArrayFromAxisTree(getAxesTree(axis));
+                const key = canonicalizeJson(axes.map(getAxisId));
+                return [key, axes];
+            });
+            for (const [keyLeft, spec] of leftKeyVariants) {
+                if (!result.has(keyLeft)) {
+                    result.set(keyLeft, { keyAxesSpec: spec, linkWith: new Map() });
+                }
+            }
+            for (const [keyRight, spec] of rightKeyVariants) {
+                if (!result.has(keyRight)) {
+                    result.set(keyRight, { keyAxesSpec: spec, linkWith: new Map() });
+                }
+            }
+            for (const [keyLeft] of leftKeyVariants) {
+                for (const [keyRight] of rightKeyVariants) {
+                    result.get(keyLeft)?.linkWith.set(keyRight, linker);
+                    result.get(keyRight)?.linkWith.set(keyLeft, linker);
+                }
+            }
+        }
+        return new this(result);
+    }
+    /** Get all available nodes of linker graphs if start from sourceAxesKeys */
+    searchAvailableAxesKeys(sourceAxesKeys) {
+        const startKeys = new Set(sourceAxesKeys);
+        const allAvailableKeys = new Set();
+        let nextKeys = sourceAxesKeys;
+        while (nextKeys.length) {
+            const next = [];
+            for (const key of nextKeys) {
+                const node = this.data.get(key);
+                if (!node)
+                    continue;
+                for (const availableKey of node.linkWith.keys()) {
+                    if (!allAvailableKeys.has(availableKey) && !startKeys.has(availableKey)) {
+                        next.push(availableKey);
+                        allAvailableKeys.add(availableKey);
+                    }
+                }
+            }
+            nextKeys = next;
+        }
+        return allAvailableKeys;
+    }
+    /** Get all linker columns that are necessary to reach endKey from startKey */
+    searchLinkerPath(startKey, endKey) {
+        const previous = {};
+        let nextIds = new Set([startKey]);
+        const visited = new Set([startKey]);
+        while (nextIds.size) {
+            const next = new Set();
+            for (const nextId of nextIds) {
+                const node = this.data.get(nextId);
+                if (!node)
+                    continue;
+                for (const availableId of node.linkWith.keys()) {
+                    previous[availableId] = nextId;
+                    if (availableId === endKey) {
+                        const ids = [];
+                        let current = endKey;
+                        while (previous[current] !== startKey) {
+                            ids.push(current);
+                            current = previous[current];
+                        }
+                        ids.push(current);
+                        return ids.map((id) => this.data.get(id).linkWith.get(previous[id]));
+                    }
+                    else if (!visited.has(availableId)) {
+                        next.add(availableId);
+                        visited.add(availableId);
+                    }
+                }
+            }
+            nextIds = next;
+        }
+        return [];
+    }
+    getLinkerColumnsForAxes({ from: sourceAxes, to: targetAxes, throwWhenNoLinkExists = true, }) {
+        // start keys - all possible keys in linker map using sourceAxes (for example, all axes of block's columns or all axes of columns in data-inputs)
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        return Array.from(new Map(LinkerMap.getAxesRoots(targetAxes)
+            .map(LinkerMap.getLinkerKeyFromAxisSpec) // target keys contain all axes to be linked; if some of target axes has parents they must be in the key
+            .flatMap((targetKey) => {
+            const linkers = startKeys
+                .map((startKey) => this.searchLinkerPath(startKey, targetKey))
+                .reduce((shortestPath, path) => (shortestPath.length && shortestPath.length < path.length) || !path.length ? shortestPath : path, [])
+                .map((linker) => [linker.columnId, linker]);
+            if (!linkers.length && throwWhenNoLinkExists) {
+                throw Error(`Unable to find linker column for ${targetKey}`);
+            }
+            return linkers;
+        })).values());
+    }
+    /** Get list of axisSpecs from keys of linker columns map  */
+    getAxesListFromKeysList(keys) {
+        return Array.from(new Map(keys.flatMap((key) => this.data.get(key)?.keyAxesSpec ?? [])
+            .map((axis) => [canonicalizeJson(getAxisId(axis)), axis])).values());
+    }
+    /** Get axes of target axes that are impossible to be linked to source axes with current linker map */
+    getNonLinkableAxes(sourceAxes, targetAxes) {
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        // target keys contain all axes to be linked; if some of target axes has parents they must be in the key
+        const targetKeys = targetAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        const axes = Array.from(new Map(targetAxes
+            .filter((_targetAxis, idx) => {
+            const targetKey = targetKeys[idx];
+            return !startKeys.some((startKey) => this.searchLinkerPath(startKey, targetKey).length);
+        })
+            .flatMap((axis) => getArrayFromAxisTree(getAxesTree(axis)).map((axis) => [canonicalizeJson(getAxisId(axis)), axis]))).values());
+        return axes;
+    }
+    /** Get all axes that can be connected to sourceAxes by linkers */
+    getReachableByLinkersAxesFromAxes(sourceAxes) {
+        const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+        const availableKeys = this.searchAvailableAxesKeys(startKeys);
+        return this.getAxesListFromKeysList([...availableKeys]);
+    }
+    static getLinkerKeyFromAxisSpec(axis) {
+        return canonicalizeJson(getArrayFromAxisTree(getAxesTree(axis)).map(getAxisId));
+    }
+    /**  Split array of axes into several arrays by parents: axes of one group are parents for each other.
+       There are no order inside every group. */
+    static getAxesGroups(axesSpec) {
+        switch (axesSpec.length) {
+            case 0: return [];
+            case 1: return [[axesSpec[0]]];
+        }
+        const axisKeys = axesSpec.map((spec) => canonicalizeJson(getAxisId(spec)));
+        const axisParentsIdxs = axesSpec.map((spec) => new Set(spec.parentAxesSpec
+            .map((spec) => canonicalizeJson(getAxisId(spec)))
+            .map((el) => {
+            const idx = axisKeys.indexOf(el);
+            if (idx === -1) {
+                throw new Error(`malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`);
+            }
+            return idx;
+        })));
+        const allIdxs = [...axesSpec.keys()];
+        const groups = []; // groups of axis indexes
+        const usedIdxs = new Set();
+        let nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));
+        while (nextFreeEl !== undefined) {
+            const currentGroup = [nextFreeEl];
+            usedIdxs.add(nextFreeEl);
+            let nextElsOfCurrentGroup = [nextFreeEl];
+            while (nextElsOfCurrentGroup.length) {
+                const next = new Set();
+                for (const groupIdx of nextElsOfCurrentGroup) {
+                    const groupElementParents = axisParentsIdxs[groupIdx];
+                    allIdxs.forEach((idx) => {
+                        if (idx === groupIdx || usedIdxs.has(idx)) {
+                            return;
+                        }
+                        const parents = axisParentsIdxs[idx];
+                        if (parents.has(groupIdx) || groupElementParents.has(idx)) {
+                            currentGroup.push(idx);
+                            next.add(idx);
+                            usedIdxs.add(idx);
+                        }
+                    });
+                }
+                nextElsOfCurrentGroup = [...next];
+            }
+            groups.push([...currentGroup]);
+            nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));
+        }
+        return groups.map((group) => group.map((idx) => axesSpec[idx]));
+    }
+    /** Get all axes that are not parents of any other axis */
+    static getAxesRoots(axes) {
+        const parentsSet = new Set(axes.flatMap((axis) => axis.parentAxesSpec).map((spec) => canonicalizeJson(getAxisId(spec))));
+        return axes.filter((axis) => !parentsSet.has(canonicalizeJson(getAxisId(axis))));
+    }
+}
+
+export { LinkerMap };
+//# sourceMappingURL=linker_columns.js.map

package/dist/drivers/pframe/linker_columns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linker_columns.js","sources":["../../../src/drivers/pframe/linker_columns.ts"],"sourcesContent":["import {\n  canonicalizeJson,\n  parseJson,\n  type CanonicalizedJson,\n} from '../../json';\nimport {\n  Annotation,\n  readAnnotationJson,\n  type AxisSpec,\n  type PColumnIdAndSpec,\n  type AxisSpecNormalized,\n  type AxisId,\n  getAxisId,\n  getNormalizedAxesList,\n  getArrayFromAxisTree,\n  getAxesTree,\n} from './spec/spec';\n\ntype LinkerKey = CanonicalizedJson<AxisId[]>;\nexport type CompositeLinkerMap = Map<\n  LinkerKey,\n  {\n    keyAxesSpec: AxisSpecNormalized[]; // axis specs - source for the key\n    linkWith: Map<LinkerKey, PColumnIdAndSpec>; // for every axis (possibly in group with parents - available by linkers another axes and corresponding linkers)\n  }\n>;\n\ninterface LinkersData {\n  data: CompositeLinkerMap;\n}\nexport class LinkerMap implements LinkersData {\n  /** Graph of linkers connected by axes (single or grouped by parents) */\n  readonly data: CompositeLinkerMap;\n\n  constructor(linkerMap: CompositeLinkerMap) {\n    this.data = linkerMap;\n  }\n\n  get keys() {\n    return this.data.keys();\n  }\n\n  get keyAxesIds() {\n    return [...this.data.keys()].map(parseJson);\n  }\n\n  static fromColumns(columns: PColumnIdAndSpec[]) {\n    const result: CompositeLinkerMap = new Map();\n    for (const linker of columns.filter((l) => !!readAnnotationJson(l.spec, Annotation.IsLinkerColumn))) {\n      const groups = LinkerMap.getAxesGroups(getNormalizedAxesList(linker.spec.axesSpec)); // split input axes into groups by parent links from annotation\n\n      if (groups.length !== 2) {\n        continue; // not a valid linker column\n      }\n      const [left, right] = groups;\n\n      // In case of group:\n      // A - C\n      //  \\_ B _ D\n      // E/\n      // put 2 variants as keys:\n      // A - C\n      //  \\_ B _ D\n      // and\n      // E - B - D\n      const leftKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(left).map((axis) => {\n        const axes = getArrayFromAxisTree(getAxesTree(axis));\n        const key = canonicalizeJson(axes.map(getAxisId));\n        return [key, axes];\n      });\n      const rightKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(right).map((axis) => {\n        const axes = getArrayFromAxisTree(getAxesTree(axis));\n        const key = canonicalizeJson(axes.map(getAxisId));\n        return [key, axes];\n      });\n\n      for (const [keyLeft, spec] of leftKeyVariants) {\n        if (!result.has(keyLeft)) {\n          result.set(keyLeft, { keyAxesSpec: spec, linkWith: new Map() });\n        }\n      }\n      for (const [keyRight, spec] of rightKeyVariants) {\n        if (!result.has(keyRight)) {\n          result.set(keyRight, { keyAxesSpec: spec, linkWith: new Map() });\n        }\n      }\n      for (const [keyLeft] of leftKeyVariants) {\n        for (const [keyRight] of rightKeyVariants) {\n          result.get(keyLeft)?.linkWith.set(keyRight, linker);\n          result.get(keyRight)?.linkWith.set(keyLeft, linker);\n        }\n      }\n    }\n    return new this(result);\n  }\n\n  /** Get all available nodes of linker graphs if start from sourceAxesKeys */\n  searchAvailableAxesKeys(sourceAxesKeys: LinkerKey[]): Set<LinkerKey> {\n    const startKeys = new Set(sourceAxesKeys);\n    const allAvailableKeys = new Set<LinkerKey>();\n    let nextKeys = sourceAxesKeys;\n    while (nextKeys.length) {\n      const next: LinkerKey[] = [];\n      for (const key of nextKeys) {\n        const node = this.data.get(key);\n        if (!node) continue;\n        for (const availableKey of node.linkWith.keys()) {\n          if (!allAvailableKeys.has(availableKey) && !startKeys.has(availableKey)) {\n            next.push(availableKey);\n            allAvailableKeys.add(availableKey);\n          }\n        }\n      }\n      nextKeys = next;\n    }\n    return allAvailableKeys;\n  }\n\n  /** Get all linker columns that are necessary to reach endKey from startKey */\n  searchLinkerPath(startKey: LinkerKey, endKey: LinkerKey): PColumnIdAndSpec[] {\n    const previous: Record<LinkerKey, LinkerKey> = {};\n    let nextIds = new Set([startKey]);\n    const visited = new Set([startKey]);\n    while (nextIds.size) {\n      const next = new Set<LinkerKey>();\n      for (const nextId of nextIds) {\n        const node = this.data.get(nextId);\n        if (!node) continue;\n        for (const availableId of node.linkWith.keys()) {\n          previous[availableId] = nextId;\n          if (availableId === endKey) {\n            const ids: LinkerKey[] = [];\n            let current = endKey;\n            while (previous[current] !== startKey) {\n              ids.push(current);\n              current = previous[current];\n            }\n            ids.push(current);\n            return ids.map((id: LinkerKey) => this.data.get(id)!.linkWith.get(previous[id])!);\n          } else if (!visited.has(availableId)) {\n            next.add(availableId);\n            visited.add(availableId);\n          }\n        }\n      }\n      nextIds = next;\n    }\n    return [];\n  }\n\n  getLinkerColumnsForAxes({\n    from: sourceAxes,\n    to: targetAxes,\n    throwWhenNoLinkExists = true,\n  }: {\n    from: AxisSpecNormalized[];\n    to: AxisSpecNormalized[];\n    throwWhenNoLinkExists?: boolean;\n  }): PColumnIdAndSpec[] {\n  // start keys - all possible keys in linker map using sourceAxes (for example, all axes of block's columns or all axes of columns in data-inputs)\n    const startKeys: LinkerKey[] = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n\n    return Array.from(\n      new Map(\n        LinkerMap.getAxesRoots(targetAxes)\n          .map(LinkerMap.getLinkerKeyFromAxisSpec) // target keys contain all axes to be linked; if some of target axes has parents they must be in the key\n          .flatMap((targetKey) => {\n            const linkers = startKeys\n              .map((startKey) => this.searchLinkerPath(startKey, targetKey))\n              .reduce((shortestPath, path) => (shortestPath.length && shortestPath.length < path.length) || !path.length ? shortestPath : path,\n                [] as PColumnIdAndSpec[])\n              .map((linker) => [linker.columnId, linker] as const);\n            if (!linkers.length && throwWhenNoLinkExists) {\n              throw Error(`Unable to find linker column for ${targetKey}`);\n            }\n            return linkers;\n          }),\n      ).values(),\n    );\n  }\n\n  /** Get list of axisSpecs from keys of linker columns map  */\n  getAxesListFromKeysList(keys: LinkerKey[]): AxisSpecNormalized[] {\n    return Array.from(\n      new Map(\n        keys.flatMap((key) => this.data.get(key)?.keyAxesSpec ?? [])\n          .map((axis) => [canonicalizeJson(getAxisId(axis)), axis]),\n      ).values(),\n    );\n  }\n\n  /** Get axes of target axes that are impossible to be linked to source axes with current linker map */\n  getNonLinkableAxes(\n    sourceAxes: AxisSpecNormalized[],\n    targetAxes: AxisSpecNormalized[],\n  ): AxisSpecNormalized[] {\n    const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    // target keys contain all axes to be linked; if some of target axes has parents they must be in the key\n    const targetKeys = targetAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n\n    const axes = Array.from(\n      new Map(\n        targetAxes\n          .filter((_targetAxis, idx) => {\n            const targetKey = targetKeys[idx];\n            return !startKeys.some((startKey) => this.searchLinkerPath(startKey, targetKey).length);\n          })\n          .flatMap((axis) => getArrayFromAxisTree(getAxesTree(axis)).map((axis) => [canonicalizeJson(getAxisId(axis)), axis])),\n      ).values(),\n    );\n    return axes;\n  }\n\n  /** Get all axes that can be connected to sourceAxes by linkers */\n  getReachableByLinkersAxesFromAxes(sourceAxes: AxisSpecNormalized[]): AxisSpec[] {\n    const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    const availableKeys = this.searchAvailableAxesKeys(startKeys);\n    return this.getAxesListFromKeysList([...availableKeys]);\n  }\n\n  static getLinkerKeyFromAxisSpec(axis: AxisSpecNormalized): LinkerKey {\n    return canonicalizeJson(getArrayFromAxisTree(getAxesTree(axis)).map(getAxisId));\n  }\n\n  /**  Split array of axes into several arrays by parents: axes of one group are parents for each other.\n     There are no order inside every group. */\n  static getAxesGroups(axesSpec: AxisSpecNormalized[]): AxisSpecNormalized[][] {\n    switch (axesSpec.length) {\n      case 0: return [];\n      case 1: return [[axesSpec[0]]];\n      default: break;\n    }\n\n    const axisKeys = axesSpec.map((spec) => canonicalizeJson(getAxisId(spec)));\n    const axisParentsIdxs = axesSpec.map(\n      (spec) => new Set(\n        spec.parentAxesSpec\n          .map((spec) => canonicalizeJson(getAxisId(spec)))\n          .map((el) => {\n            const idx = axisKeys.indexOf(el);\n            if (idx === -1) {\n              throw new Error(`malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`);\n            }\n            return idx;\n          }),\n      ),\n    );\n\n    const allIdxs = [...axesSpec.keys()];\n    const groups: number[][] = []; // groups of axis indexes\n\n    const usedIdxs = new Set<number>();\n    let nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));\n    while (nextFreeEl !== undefined) {\n      const currentGroup = [nextFreeEl];\n      usedIdxs.add(nextFreeEl);\n\n      let nextElsOfCurrentGroup = [nextFreeEl];\n      while (nextElsOfCurrentGroup.length) {\n        const next = new Set<number>();\n        for (const groupIdx of nextElsOfCurrentGroup) {\n          const groupElementParents = axisParentsIdxs[groupIdx];\n          allIdxs.forEach((idx) => {\n            if (idx === groupIdx || usedIdxs.has(idx)) {\n              return;\n            }\n            const parents = axisParentsIdxs[idx];\n            if (parents.has(groupIdx) || groupElementParents.has(idx)) {\n              currentGroup.push(idx);\n              next.add(idx);\n              usedIdxs.add(idx);\n            }\n          });\n        }\n        nextElsOfCurrentGroup = [...next];\n      }\n\n      groups.push([...currentGroup]);\n      nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));\n    };\n\n    return groups.map((group) => group.map((idx) => axesSpec[idx]));\n  }\n\n  /** Get all axes that are not parents of any other axis */\n  static getAxesRoots(axes: AxisSpecNormalized[]): AxisSpecNormalized[] {\n    const parentsSet = new Set(axes.flatMap((axis) => axis.parentAxesSpec).map((spec) => canonicalizeJson(getAxisId(spec))));\n    return axes.filter((axis) => !parentsSet.has(canonicalizeJson(getAxisId(axis))));\n  }\n}\n"],"names":[],"mappings":";;;MA8Ba,SAAS,CAAA;;AAEX,IAAA,IAAI;AAEb,IAAA,WAAA,CAAY,SAA6B,EAAA;AACvC,QAAA,IAAI,CAAC,IAAI,GAAG,SAAS;IACvB;AAEA,IAAA,IAAI,IAAI,GAAA;AACN,QAAA,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;IACzB;AAEA,IAAA,IAAI,UAAU,GAAA;AACZ,QAAA,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;IAC7C;IAEA,OAAO,WAAW,CAAC,OAA2B,EAAA;AAC5C,QAAA,MAAM,MAAM,GAAuB,IAAI,GAAG,EAAE;QAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC,EAAE;AACnG,YAAA,MAAM,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,qBAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AAEpF,YAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;AACvB,gBAAA,SAAS;YACX;AACA,YAAA,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM;;;;;;;;;;AAW5B,YAAA,MAAM,eAAe,GAAwC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;gBACrG,MAAM,IAAI,GAAG,oBAAoB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACpD,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACjD,gBAAA,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC;AACpB,YAAA,CAAC,CAAC;AACF,YAAA,MAAM,gBAAgB,GAAwC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;gBACvG,MAAM,IAAI,GAAG,oBAAoB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACpD,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACjD,gBAAA,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC;AACpB,YAAA,CAAC,CAAC;YAEF,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,eAAe,EAAE;gBAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;AACxB,oBAAA,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;gBACjE;YACF;YACA,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,gBAAgB,EAAE;gBAC/C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;AACzB,oBAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;gBAClE;YACF;AACA,YAAA,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,eAAe,EAAE;AACvC,gBAAA,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,EAAE;AACzC,oBAAA,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC;AACnD,oBAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC;gBACrD;YACF;QACF;AACA,QAAA,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC;IACzB;;AAGA,IAAA,uBAAuB,CAAC,cAA2B,EAAA;AACjD,QAAA,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC;AACzC,QAAA,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAa;QAC7C,IAAI,QAAQ,GAAG,cAAc;AAC7B,QAAA,OAAO,QAAQ,CAAC,MAAM,EAAE;YACtB,MAAM,IAAI,GAAgB,EAAE;AAC5B,YAAA,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;gBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC/B,gBAAA,IAAI,CAAC,IAAI;oBAAE;gBACX,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE;AAC/C,oBAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;AACvE,wBAAA,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;AACvB,wBAAA,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC;oBACpC;gBACF;YACF;YACA,QAAQ,GAAG,IAAI;QACjB;AACA,QAAA,OAAO,gBAAgB;IACzB;;IAGA,gBAAgB,CAAC,QAAmB,EAAE,MAAiB,EAAA;QACrD,MAAM,QAAQ,GAAiC,EAAE;QACjD,IAAI,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAA,OAAO,OAAO,CAAC,IAAI,EAAE;AACnB,YAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa;AACjC,YAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;AAClC,gBAAA,IAAI,CAAC,IAAI;oBAAE;gBACX,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE;AAC9C,oBAAA,QAAQ,CAAC,WAAW,CAAC,GAAG,MAAM;AAC9B,oBAAA,IAAI,WAAW,KAAK,MAAM,EAAE;wBAC1B,MAAM,GAAG,GAAgB,EAAE;wBAC3B,IAAI,OAAO,GAAG,MAAM;AACpB,wBAAA,OAAO,QAAQ,CAAC,OAAO,CAAC,KAAK,QAAQ,EAAE;AACrC,4BAAA,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;AACjB,4BAAA,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;wBAC7B;AACA,wBAAA,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;AACjB,wBAAA,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAa,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAE,CAAC;oBACnF;yBAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;AACpC,wBAAA,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;AACrB,wBAAA,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC;oBAC1B;gBACF;YACF;YACA,OAAO,GAAG,IAAI;QAChB;AACA,QAAA,OAAO,EAAE;IACX;AAEA,IAAA,uBAAuB,CAAC,EACtB,IAAI,EAAE,UAAU,EAChB,EAAE,EAAE,UAAU,EACd,qBAAqB,GAAG,IAAI,GAK7B,EAAA;;QAEC,MAAM,SAAS,GAAgB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;AAEjF,QAAA,OAAO,KAAK,CAAC,IAAI,CACf,IAAI,GAAG,CACL,SAAS,CAAC,YAAY,CAAC,UAAU;AAC9B,aAAA,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;AACvC,aAAA,OAAO,CAAC,CAAC,SAAS,KAAI;YACrB,MAAM,OAAO,GAAG;AACb,iBAAA,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC5D,iBAAA,MAAM,CAAC,CAAC,YAAY,EAAE,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,EAC9H,EAAwB;AACzB,iBAAA,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAU,CAAC;AACtD,YAAA,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,qBAAqB,EAAE;AAC5C,gBAAA,MAAM,KAAK,CAAC,CAAA,iCAAA,EAAoC,SAAS,CAAA,CAAE,CAAC;YAC9D;AACA,YAAA,OAAO,OAAO;AAChB,QAAA,CAAC,CAAC,CACL,CAAC,MAAM,EAAE,CACX;IACH;;AAGA,IAAA,uBAAuB,CAAC,IAAiB,EAAA;AACvC,QAAA,OAAO,KAAK,CAAC,IAAI,CACf,IAAI,GAAG,CACL,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,IAAI,EAAE;aACxD,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAC5D,CAAC,MAAM,EAAE,CACX;IACH;;IAGA,kBAAkB,CAChB,UAAgC,EAChC,UAAgC,EAAA;QAEhC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;;QAEpE,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;QAErE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CACrB,IAAI,GAAG,CACL;AACG,aAAA,MAAM,CAAC,CAAC,WAAW,EAAE,GAAG,KAAI;AAC3B,YAAA,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC;YACjC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,MAAM,CAAC;AACzF,QAAA,CAAC;AACA,aAAA,OAAO,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CACvH,CAAC,MAAM,EAAE,CACX;AACD,QAAA,OAAO,IAAI;IACb;;AAGA,IAAA,iCAAiC,CAAC,UAAgC,EAAA;QAChE,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;QACpE,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC;QAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IACzD;IAEA,OAAO,wBAAwB,CAAC,IAAwB,EAAA;AACtD,QAAA,OAAO,gBAAgB,CAAC,oBAAoB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACjF;AAEA;AAC4C;IAC5C,OAAO,aAAa,CAAC,QAA8B,EAAA;AACjD,QAAA,QAAQ,QAAQ,CAAC,MAAM;AACrB,YAAA,KAAK,CAAC,EAAE,OAAO,EAAE;AACjB,YAAA,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;;AAIhC,QAAA,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1E,QAAA,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAClC,CAAC,IAAI,KAAK,IAAI,GAAG,CACf,IAAI,CAAC;AACF,aAAA,GAAG,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AAC/C,aAAA,GAAG,CAAC,CAAC,EAAE,KAAI;YACV,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;AAChC,YAAA,IAAI,GAAG,KAAK,EAAE,EAAE;AACd,gBAAA,MAAM,IAAI,KAAK,CAAC,CAAA,oBAAA,EAAuB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA,0BAAA,EAA6B,EAAE,CAAA,CAAE,CAAC;YACnG;AACA,YAAA,OAAO,GAAG;QACZ,CAAC,CAAC,CACL,CACF;QAED,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;AACpC,QAAA,MAAM,MAAM,GAAe,EAAE,CAAC;AAE9B,QAAA,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU;AAClC,QAAA,IAAI,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC1D,QAAA,OAAO,UAAU,KAAK,SAAS,EAAE;AAC/B,YAAA,MAAM,YAAY,GAAG,CAAC,UAAU,CAAC;AACjC,YAAA,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC;AAExB,YAAA,IAAI,qBAAqB,GAAG,CAAC,UAAU,CAAC;AACxC,YAAA,OAAO,qBAAqB,CAAC,MAAM,EAAE;AACnC,gBAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU;AAC9B,gBAAA,KAAK,MAAM,QAAQ,IAAI,qBAAqB,EAAE;AAC5C,oBAAA,MAAM,mBAAmB,GAAG,eAAe,CAAC,QAAQ,CAAC;AACrD,oBAAA,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,KAAI;wBACtB,IAAI,GAAG,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;4BACzC;wBACF;AACA,wBAAA,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC;AACpC,wBAAA,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AACzD,4BAAA,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;AACtB,4BAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACb,4BAAA,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;wBACnB;AACF,oBAAA,CAAC,CAAC;gBACJ;AACA,gBAAA,qBAAqB,GAAG,CAAC,GAAG,IAAI,CAAC;YACnC;YAEA,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;AAC9B,YAAA,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxD;QAEA,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE;;IAGA,OAAO,YAAY,CAAC,IAA0B,EAAA;AAC5C,QAAA,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxH,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF;AACD;;;;"}

package/dist/drivers/pframe/pframe.d.ts

@@ -22,4 +22,3 @@ export interface PFrame {
 }
 /** Information required to instantiate a PFrame. */
 export type PFrameDef<Data> = PColumn<Data>[];
-//# sourceMappingURL=pframe.d.ts.map