@milaboratories/pl-model-common 1.25.1 → 1.25.3

package/dist/drivers/pframe/linker_columns.cjs

@@ -1,241 +1,187 @@
-'use strict';
+const require_json = require('../../json.cjs');
+const require_spec = require('./spec/spec.cjs');
 
-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 */
-    getReachableByLinkersAxesFromAxesNormalized(sourceAxes, matchAxisIdFn) {
-        let startKeys = [];
-        if (matchAxisIdFn) {
-            const sourceAxisIdsGrouped = sourceAxes.map((axis) => spec.getArrayFromAxisTree(spec.getAxesTree(axis)).map(spec.getAxisId));
-            for (const sourceAxisIdsGroup of sourceAxisIdsGrouped) {
-                const matched = this.keyAxesIds.find((keyIds) => keyIds.every((linkerKeyAxisId) => sourceAxisIdsGroup.find((sourceAxisId) => matchAxisIdFn(linkerKeyAxisId, sourceAxisId))));
-                if (matched) {
-                    startKeys.push(json.canonicalizeJson(matched));
-                }
-            }
-        }
-        else {
-            startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
-        }
-        const availableKeys = this.searchAvailableAxesKeys(startKeys);
-        return this.getAxesListFromKeysList([...availableKeys]);
-    }
-    getReachableByLinkersAxesFromAxes(sourceAxes, matchAxisIdFn) {
-        return this.getReachableByLinkersAxesFromAxesNormalized(spec.getNormalizedAxesList(sourceAxes), matchAxisIdFn);
-    }
-    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))));
-    }
-}
+//#region src/drivers/pframe/linker_columns.ts
+var LinkerMap = 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(require_json.parseJson);
+	}
+	static fromColumns(columns) {
+		const result = /* @__PURE__ */ new Map();
+		for (const linker of columns.filter((l) => !!require_spec.readAnnotationJson(l.spec, require_spec.Annotation.IsLinkerColumn))) {
+			const groups = LinkerMap.getAxesGroups(require_spec.getNormalizedAxesList(linker.spec.axesSpec));
+			if (groups.length !== 2) continue;
+			const [left, right] = groups;
+			const leftKeyVariants = LinkerMap.getAxesRoots(left).map((axis) => {
+				const axes = require_spec.getArrayFromAxisTree(require_spec.getAxesTree(axis));
+				return [require_json.canonicalizeJson(axes.map(require_spec.getAxisId)), axes];
+			});
+			const rightKeyVariants = LinkerMap.getAxesRoots(right).map((axis) => {
+				const axes = require_spec.getArrayFromAxisTree(require_spec.getAxesTree(axis));
+				return [require_json.canonicalizeJson(axes.map(require_spec.getAxisId)), axes];
+			});
+			for (const [keyLeft, spec] of leftKeyVariants) if (!result.has(keyLeft)) result.set(keyLeft, {
+				keyAxesSpec: spec,
+				linkWith: /* @__PURE__ */ new Map()
+			});
+			for (const [keyRight, spec] of rightKeyVariants) if (!result.has(keyRight)) result.set(keyRight, {
+				keyAxesSpec: spec,
+				linkWith: /* @__PURE__ */ 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 = /* @__PURE__ */ 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 = /* @__PURE__ */ 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 }) {
+		const startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+		return Array.from(new Map(LinkerMap.getAxesRoots(targetAxes).map(LinkerMap.getLinkerKeyFromAxisSpec).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) => [require_json.canonicalizeJson(require_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);
+		const targetKeys = targetAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+		return Array.from(new Map(targetAxes.filter((_targetAxis, idx) => {
+			const targetKey = targetKeys[idx];
+			return !startKeys.some((startKey) => this.searchLinkerPath(startKey, targetKey).length);
+		}).flatMap((axis) => require_spec.getArrayFromAxisTree(require_spec.getAxesTree(axis)).map((axis) => [require_json.canonicalizeJson(require_spec.getAxisId(axis)), axis]))).values());
+	}
+	/** Get all axes that can be connected to sourceAxes by linkers */
+	getReachableByLinkersAxesFromAxesNormalized(sourceAxes, matchAxisIdFn) {
+		let startKeys = [];
+		if (matchAxisIdFn) {
+			const sourceAxisIdsGrouped = sourceAxes.map((axis) => require_spec.getArrayFromAxisTree(require_spec.getAxesTree(axis)).map(require_spec.getAxisId));
+			for (const sourceAxisIdsGroup of sourceAxisIdsGrouped) {
+				const matched = this.keyAxesIds.find((keyIds) => keyIds.every((linkerKeyAxisId) => sourceAxisIdsGroup.find((sourceAxisId) => matchAxisIdFn(linkerKeyAxisId, sourceAxisId))));
+				if (matched) startKeys.push(require_json.canonicalizeJson(matched));
+			}
+		} else startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);
+		const availableKeys = this.searchAvailableAxesKeys(startKeys);
+		return this.getAxesListFromKeysList([...availableKeys]);
+	}
+	getReachableByLinkersAxesFromAxes(sourceAxes, matchAxisIdFn) {
+		return this.getReachableByLinkersAxesFromAxesNormalized(require_spec.getNormalizedAxesList(sourceAxes), matchAxisIdFn);
+	}
+	static getLinkerKeyFromAxisSpec(axis) {
+		return require_json.canonicalizeJson(require_spec.getArrayFromAxisTree(require_spec.getAxesTree(axis)).map(require_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]]];
+			default: break;
+		}
+		const axisKeys = axesSpec.map((spec) => require_json.canonicalizeJson(require_spec.getAxisId(spec)));
+		const axisParentsIdxs = axesSpec.map((spec) => new Set(spec.parentAxesSpec.map((spec) => require_json.canonicalizeJson(require_spec.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 = [];
+		const usedIdxs = /* @__PURE__ */ new Set();
+		let nextFreeEl = allIdxs.find((idx) => !usedIdxs.has(idx));
+		while (nextFreeEl !== void 0) {
+			const currentGroup = [nextFreeEl];
+			usedIdxs.add(nextFreeEl);
+			let nextElsOfCurrentGroup = [nextFreeEl];
+			while (nextElsOfCurrentGroup.length) {
+				const next = /* @__PURE__ */ new Set();
+				for (const groupIdx of nextElsOfCurrentGroup) {
+					const groupElementParents = axisParentsIdxs[groupIdx];
+					allIdxs.forEach((idx) => {
+						if (idx === groupIdx || usedIdxs.has(idx)) return;
+						if (axisParentsIdxs[idx].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) => require_json.canonicalizeJson(require_spec.getAxisId(spec))));
+		return axes.filter((axis) => !parentsSet.has(require_json.canonicalizeJson(require_spec.getAxisId(axis))));
+	}
+};
 
+//#endregion
 exports.LinkerMap = LinkerMap;
-//# sourceMappingURL=linker_columns.cjs.map
+//# sourceMappingURL=linker_columns.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"linker_columns.cjs","sources":["../../../src/drivers/pframe/linker_columns.ts"],"sourcesContent":["import { canonicalizeJson, parseJson, type CanonicalizedJson } 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(\n      (l) => !!readAnnotationJson(l.spec, Annotation.IsLinkerColumn),\n    )) {\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(\n        (axis) => {\n          const axes = getArrayFromAxisTree(getAxesTree(axis));\n          const key = canonicalizeJson(axes.map(getAxisId));\n          return [key, axes];\n        },\n      );\n      const rightKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(\n        right,\n      ).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(\n                (shortestPath, path) =>\n                  (shortestPath.length && shortestPath.length < path.length) || !path.length\n                    ? shortestPath\n                    : path,\n                [] as PColumnIdAndSpec[],\n              )\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\n          .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) =>\n            getArrayFromAxisTree(getAxesTree(axis)).map((axis) => [\n              canonicalizeJson(getAxisId(axis)),\n              axis,\n            ]),\n          ),\n      ).values(),\n    );\n    return axes;\n  }\n\n  /** Get all axes that can be connected to sourceAxes by linkers */\n  getReachableByLinkersAxesFromAxesNormalized(\n    sourceAxes: AxisSpecNormalized[],\n    matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean,\n  ): AxisSpecNormalized[] {\n    let startKeys: CanonicalizedJson<AxisId[]>[] = [];\n\n    if (matchAxisIdFn) {\n      const sourceAxisIdsGrouped: AxisId[][] = sourceAxes.map((axis) =>\n        getArrayFromAxisTree(getAxesTree(axis)).map(getAxisId),\n      );\n      for (const sourceAxisIdsGroup of sourceAxisIdsGrouped) {\n        const matched = this.keyAxesIds.find((keyIds: AxisId[]) =>\n          keyIds.every((linkerKeyAxisId) =>\n            sourceAxisIdsGroup.find((sourceAxisId) => matchAxisIdFn(linkerKeyAxisId, sourceAxisId)),\n          ),\n        );\n        if (matched) {\n          startKeys.push(canonicalizeJson(matched));\n        }\n      }\n    } else {\n      startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    }\n\n    const availableKeys = this.searchAvailableAxesKeys(startKeys);\n    return this.getAxesListFromKeysList([...availableKeys]);\n  }\n\n  getReachableByLinkersAxesFromAxes(\n    sourceAxes: AxisSpec[],\n    matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean,\n  ): AxisSpecNormalized[] {\n    return this.getReachableByLinkersAxesFromAxesNormalized(\n      getNormalizedAxesList(sourceAxes),\n      matchAxisIdFn,\n    );\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:\n        return [];\n      case 1:\n        return [[axesSpec[0]]];\n      default:\n        break;\n    }\n\n    const axisKeys = axesSpec.map((spec) => canonicalizeJson(getAxisId(spec)));\n    const axisParentsIdxs = axesSpec.map(\n      (spec) =>\n        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(\n                  `malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`,\n                );\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(\n      axes.flatMap((axis) => axis.parentAxesSpec).map((spec) => canonicalizeJson(getAxisId(spec))),\n    );\n    return axes.filter((axis) => !parentsSet.has(canonicalizeJson(getAxisId(axis))));\n  }\n}\n"],"names":["parseJson","readAnnotationJson","Annotation","getNormalizedAxesList","getArrayFromAxisTree","getAxesTree","canonicalizeJson","getAxisId","spec"],"mappings":";;;;;MA0Ba,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,CACjC,CAAC,CAAC,KAAK,CAAC,CAACC,uBAAkB,CAAC,CAAC,CAAC,IAAI,EAAEC,eAAU,CAAC,cAAc,CAAC,CAC/D,EAAE;AACD,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,CAC3F,CAAC,IAAI,KAAI;gBACP,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,CACF;AACD,YAAA,MAAM,gBAAgB,GAAwC,SAAS,CAAC,YAAY,CAClF,KAAK,CACN,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;gBACb,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;iBAC5D,MAAM,CACL,CAAC,YAAY,EAAE,IAAI,KACjB,CAAC,YAAY,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC;AAClE,kBAAE;AACF,kBAAE,IAAI,EACV,EAAwB;AAEzB,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;AACG,aAAA,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,IAAI,EAAE;aACtD,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,OAAO,CAAC,CAAC,IAAI,KACZH,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK;AACpD,YAAAC,qBAAgB,CAACC,cAAS,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI;AACL,SAAA,CAAC,CACH,CACJ,CAAC,MAAM,EAAE,CACX;AACD,QAAA,OAAO,IAAI;IACb;;IAGA,2CAA2C,CACzC,UAAgC,EAChC,aAA2E,EAAA;QAE3E,IAAI,SAAS,GAAkC,EAAE;QAEjD,IAAI,aAAa,EAAE;YACjB,MAAM,oBAAoB,GAAe,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,KAC3DH,yBAAoB,CAACC,gBAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAACE,cAAS,CAAC,CACvD;AACD,YAAA,KAAK,MAAM,kBAAkB,IAAI,oBAAoB,EAAE;AACrD,gBAAA,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,MAAgB,KACpD,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,KAC3B,kBAAkB,CAAC,IAAI,CAAC,CAAC,YAAY,KAAK,aAAa,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC,CACxF,CACF;gBACD,IAAI,OAAO,EAAE;oBACX,SAAS,CAAC,IAAI,CAACD,qBAAgB,CAAC,OAAO,CAAC,CAAC;gBAC3C;YACF;QACF;aAAO;YACL,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,wBAAwB,CAAC;QAChE;QAEA,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC;QAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IACzD;IAEA,iCAAiC,CAC/B,UAAsB,EACtB,aAA2E,EAAA;QAE3E,OAAO,IAAI,CAAC,2CAA2C,CACrDH,0BAAqB,CAAC,UAAU,CAAC,EACjC,aAAa,CACd;IACH;IAEA,OAAO,wBAAwB,CAAC,IAAwB,EAAA;AACtD,QAAA,OAAOG,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;AACJ,gBAAA,OAAO,EAAE;AACX,YAAA,KAAK,CAAC;gBACJ,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;;AAK1B,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,KACH,IAAI,GAAG,CACLA,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,CACb,CAAA,oBAAA,EAAuB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA,0BAAA,EAA6B,EAAE,CAAA,CAAE,CACjF;YACH;AACA,YAAA,OAAO,GAAG;QACZ,CAAC,CAAC,CACL,CACJ;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,CACxB,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,CAC7F;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAACF,qBAAgB,CAACC,cAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF;AACD;;;;"}
+{"version":3,"file":"linker_columns.cjs","names":["parseJson","readAnnotationJson","Annotation","getNormalizedAxesList","getArrayFromAxisTree","getAxesTree","canonicalizeJson","getAxisId"],"sources":["../../../src/drivers/pframe/linker_columns.ts"],"sourcesContent":["import { canonicalizeJson, parseJson, type CanonicalizedJson } 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(\n      (l) => !!readAnnotationJson(l.spec, Annotation.IsLinkerColumn),\n    )) {\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(\n        (axis) => {\n          const axes = getArrayFromAxisTree(getAxesTree(axis));\n          const key = canonicalizeJson(axes.map(getAxisId));\n          return [key, axes];\n        },\n      );\n      const rightKeyVariants: [LinkerKey, AxisSpecNormalized[]][] = LinkerMap.getAxesRoots(\n        right,\n      ).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(\n                (shortestPath, path) =>\n                  (shortestPath.length && shortestPath.length < path.length) || !path.length\n                    ? shortestPath\n                    : path,\n                [] as PColumnIdAndSpec[],\n              )\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\n          .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) =>\n            getArrayFromAxisTree(getAxesTree(axis)).map((axis) => [\n              canonicalizeJson(getAxisId(axis)),\n              axis,\n            ]),\n          ),\n      ).values(),\n    );\n    return axes;\n  }\n\n  /** Get all axes that can be connected to sourceAxes by linkers */\n  getReachableByLinkersAxesFromAxesNormalized(\n    sourceAxes: AxisSpecNormalized[],\n    matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean,\n  ): AxisSpecNormalized[] {\n    let startKeys: CanonicalizedJson<AxisId[]>[] = [];\n\n    if (matchAxisIdFn) {\n      const sourceAxisIdsGrouped: AxisId[][] = sourceAxes.map((axis) =>\n        getArrayFromAxisTree(getAxesTree(axis)).map(getAxisId),\n      );\n      for (const sourceAxisIdsGroup of sourceAxisIdsGrouped) {\n        const matched = this.keyAxesIds.find((keyIds: AxisId[]) =>\n          keyIds.every((linkerKeyAxisId) =>\n            sourceAxisIdsGroup.find((sourceAxisId) => matchAxisIdFn(linkerKeyAxisId, sourceAxisId)),\n          ),\n        );\n        if (matched) {\n          startKeys.push(canonicalizeJson(matched));\n        }\n      }\n    } else {\n      startKeys = sourceAxes.map(LinkerMap.getLinkerKeyFromAxisSpec);\n    }\n\n    const availableKeys = this.searchAvailableAxesKeys(startKeys);\n    return this.getAxesListFromKeysList([...availableKeys]);\n  }\n\n  getReachableByLinkersAxesFromAxes(\n    sourceAxes: AxisSpec[],\n    matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean,\n  ): AxisSpecNormalized[] {\n    return this.getReachableByLinkersAxesFromAxesNormalized(\n      getNormalizedAxesList(sourceAxes),\n      matchAxisIdFn,\n    );\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:\n        return [];\n      case 1:\n        return [[axesSpec[0]]];\n      default:\n        break;\n    }\n\n    const axisKeys = axesSpec.map((spec) => canonicalizeJson(getAxisId(spec)));\n    const axisParentsIdxs = axesSpec.map(\n      (spec) =>\n        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(\n                  `malformed axesSpec: ${JSON.stringify(axesSpec)}, unable to locate parent ${el}`,\n                );\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(\n      axes.flatMap((axis) => axis.parentAxesSpec).map((spec) => canonicalizeJson(getAxisId(spec))),\n    );\n    return axes.filter((axis) => !parentsSet.has(canonicalizeJson(getAxisId(axis))));\n  }\n}\n"],"mappings":";;;;AA0BA,IAAa,YAAb,MAAa,UAAiC;;CAE5C,AAAS;CAET,YAAY,WAA+B;AACzC,OAAK,OAAO;;CAGd,IAAI,OAAO;AACT,SAAO,KAAK,KAAK,MAAM;;CAGzB,IAAI,aAAa;AACf,SAAO,CAAC,GAAG,KAAK,KAAK,MAAM,CAAC,CAAC,IAAIA,uBAAU;;CAG7C,OAAO,YAAY,SAA6B;EAC9C,MAAM,yBAA6B,IAAI,KAAK;AAC5C,OAAK,MAAM,UAAU,QAAQ,QAC1B,MAAM,CAAC,CAACC,gCAAmB,EAAE,MAAMC,wBAAW,eAAe,CAC/D,EAAE;GACD,MAAM,SAAS,UAAU,cAAcC,mCAAsB,OAAO,KAAK,SAAS,CAAC;AAEnF,OAAI,OAAO,WAAW,EACpB;GAEF,MAAM,CAAC,MAAM,SAAS;GAWtB,MAAM,kBAAuD,UAAU,aAAa,KAAK,CAAC,KACvF,SAAS;IACR,MAAM,OAAOC,kCAAqBC,yBAAY,KAAK,CAAC;AAEpD,WAAO,CADKC,8BAAiB,KAAK,IAAIC,uBAAU,CAAC,EACpC,KAAK;KAErB;GACD,MAAM,mBAAwD,UAAU,aACtE,MACD,CAAC,KAAK,SAAS;IACd,MAAM,OAAOH,kCAAqBC,yBAAY,KAAK,CAAC;AAEpD,WAAO,CADKC,8BAAiB,KAAK,IAAIC,uBAAU,CAAC,EACpC,KAAK;KAClB;AAEF,QAAK,MAAM,CAAC,SAAS,SAAS,gBAC5B,KAAI,CAAC,OAAO,IAAI,QAAQ,CACtB,QAAO,IAAI,SAAS;IAAE,aAAa;IAAM,0BAAU,IAAI,KAAK;IAAE,CAAC;AAGnE,QAAK,MAAM,CAAC,UAAU,SAAS,iBAC7B,KAAI,CAAC,OAAO,IAAI,SAAS,CACvB,QAAO,IAAI,UAAU;IAAE,aAAa;IAAM,0BAAU,IAAI,KAAK;IAAE,CAAC;AAGpE,QAAK,MAAM,CAAC,YAAY,gBACtB,MAAK,MAAM,CAAC,aAAa,kBAAkB;AACzC,WAAO,IAAI,QAAQ,EAAE,SAAS,IAAI,UAAU,OAAO;AACnD,WAAO,IAAI,SAAS,EAAE,SAAS,IAAI,SAAS,OAAO;;;AAIzD,SAAO,IAAI,KAAK,OAAO;;;CAIzB,wBAAwB,gBAA6C;EACnE,MAAM,YAAY,IAAI,IAAI,eAAe;EACzC,MAAM,mCAAmB,IAAI,KAAgB;EAC7C,IAAI,WAAW;AACf,SAAO,SAAS,QAAQ;GACtB,MAAM,OAAoB,EAAE;AAC5B,QAAK,MAAM,OAAO,UAAU;IAC1B,MAAM,OAAO,KAAK,KAAK,IAAI,IAAI;AAC/B,QAAI,CAAC,KAAM;AACX,SAAK,MAAM,gBAAgB,KAAK,SAAS,MAAM,CAC7C,KAAI,CAAC,iBAAiB,IAAI,aAAa,IAAI,CAAC,UAAU,IAAI,aAAa,EAAE;AACvE,UAAK,KAAK,aAAa;AACvB,sBAAiB,IAAI,aAAa;;;AAIxC,cAAW;;AAEb,SAAO;;;CAIT,iBAAiB,UAAqB,QAAuC;EAC3E,MAAM,WAAyC,EAAE;EACjD,IAAI,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC;EACjC,MAAM,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC;AACnC,SAAO,QAAQ,MAAM;GACnB,MAAM,uBAAO,IAAI,KAAgB;AACjC,QAAK,MAAM,UAAU,SAAS;IAC5B,MAAM,OAAO,KAAK,KAAK,IAAI,OAAO;AAClC,QAAI,CAAC,KAAM;AACX,SAAK,MAAM,eAAe,KAAK,SAAS,MAAM,EAAE;AAC9C,cAAS,eAAe;AACxB,SAAI,gBAAgB,QAAQ;MAC1B,MAAM,MAAmB,EAAE;MAC3B,IAAI,UAAU;AACd,aAAO,SAAS,aAAa,UAAU;AACrC,WAAI,KAAK,QAAQ;AACjB,iBAAU,SAAS;;AAErB,UAAI,KAAK,QAAQ;AACjB,aAAO,IAAI,KAAK,OAAkB,KAAK,KAAK,IAAI,GAAG,CAAE,SAAS,IAAI,SAAS,IAAI,CAAE;gBACxE,CAAC,QAAQ,IAAI,YAAY,EAAE;AACpC,WAAK,IAAI,YAAY;AACrB,cAAQ,IAAI,YAAY;;;;AAI9B,aAAU;;AAEZ,SAAO,EAAE;;CAGX,wBAAwB,EACtB,MAAM,YACN,IAAI,YACJ,wBAAwB,QAKH;EAErB,MAAM,YAAyB,WAAW,IAAI,UAAU,yBAAyB;AAEjF,SAAO,MAAM,KACX,IAAI,IACF,UAAU,aAAa,WAAW,CAC/B,IAAI,UAAU,yBAAyB,CACvC,SAAS,cAAc;GACtB,MAAM,UAAU,UACb,KAAK,aAAa,KAAK,iBAAiB,UAAU,UAAU,CAAC,CAC7D,QACE,cAAc,SACZ,aAAa,UAAU,aAAa,SAAS,KAAK,UAAW,CAAC,KAAK,SAChE,eACA,MACN,EAAE,CACH,CACA,KAAK,WAAW,CAAC,OAAO,UAAU,OAAO,CAAU;AACtD,OAAI,CAAC,QAAQ,UAAU,sBACrB,OAAM,MAAM,oCAAoC,YAAY;AAE9D,UAAO;IACP,CACL,CAAC,QAAQ,CACX;;;CAIH,wBAAwB,MAAyC;AAC/D,SAAO,MAAM,KACX,IAAI,IACF,KACG,SAAS,QAAQ,KAAK,KAAK,IAAI,IAAI,EAAE,eAAe,EAAE,CAAC,CACvD,KAAK,SAAS,CAACD,8BAAiBC,uBAAU,KAAK,CAAC,EAAE,KAAK,CAAC,CAC5D,CAAC,QAAQ,CACX;;;CAIH,mBACE,YACA,YACsB;EACtB,MAAM,YAAY,WAAW,IAAI,UAAU,yBAAyB;EAEpE,MAAM,aAAa,WAAW,IAAI,UAAU,yBAAyB;AAiBrE,SAfa,MAAM,KACjB,IAAI,IACF,WACG,QAAQ,aAAa,QAAQ;GAC5B,MAAM,YAAY,WAAW;AAC7B,UAAO,CAAC,UAAU,MAAM,aAAa,KAAK,iBAAiB,UAAU,UAAU,CAAC,OAAO;IACvF,CACD,SAAS,SACRH,kCAAqBC,yBAAY,KAAK,CAAC,CAAC,KAAK,SAAS,CACpDC,8BAAiBC,uBAAU,KAAK,CAAC,EACjC,KACD,CAAC,CACH,CACJ,CAAC,QAAQ,CACX;;;CAKH,4CACE,YACA,eACsB;EACtB,IAAI,YAA2C,EAAE;AAEjD,MAAI,eAAe;GACjB,MAAM,uBAAmC,WAAW,KAAK,SACvDH,kCAAqBC,yBAAY,KAAK,CAAC,CAAC,IAAIE,uBAAU,CACvD;AACD,QAAK,MAAM,sBAAsB,sBAAsB;IACrD,MAAM,UAAU,KAAK,WAAW,MAAM,WACpC,OAAO,OAAO,oBACZ,mBAAmB,MAAM,iBAAiB,cAAc,iBAAiB,aAAa,CAAC,CACxF,CACF;AACD,QAAI,QACF,WAAU,KAAKD,8BAAiB,QAAQ,CAAC;;QAI7C,aAAY,WAAW,IAAI,UAAU,yBAAyB;EAGhE,MAAM,gBAAgB,KAAK,wBAAwB,UAAU;AAC7D,SAAO,KAAK,wBAAwB,CAAC,GAAG,cAAc,CAAC;;CAGzD,kCACE,YACA,eACsB;AACtB,SAAO,KAAK,4CACVH,mCAAsB,WAAW,EACjC,cACD;;CAGH,OAAO,yBAAyB,MAAqC;AACnE,SAAOG,8BAAiBF,kCAAqBC,yBAAY,KAAK,CAAC,CAAC,IAAIE,uBAAU,CAAC;;;;CAKjF,OAAO,cAAc,UAAwD;AAC3E,UAAQ,SAAS,QAAjB;GACE,KAAK,EACH,QAAO,EAAE;GACX,KAAK,EACH,QAAO,CAAC,CAAC,SAAS,GAAG,CAAC;GACxB,QACE;;EAGJ,MAAM,WAAW,SAAS,KAAK,SAASD,8BAAiBC,uBAAU,KAAK,CAAC,CAAC;EAC1E,MAAM,kBAAkB,SAAS,KAC9B,SACC,IAAI,IACF,KAAK,eACF,KAAK,SAASD,8BAAiBC,uBAAU,KAAK,CAAC,CAAC,CAChD,KAAK,OAAO;GACX,MAAM,MAAM,SAAS,QAAQ,GAAG;AAChC,OAAI,QAAQ,GACV,OAAM,IAAI,MACR,uBAAuB,KAAK,UAAU,SAAS,CAAC,4BAA4B,KAC7E;AAEH,UAAO;IACP,CACL,CACJ;EAED,MAAM,UAAU,CAAC,GAAG,SAAS,MAAM,CAAC;EACpC,MAAM,SAAqB,EAAE;EAE7B,MAAM,2BAAW,IAAI,KAAa;EAClC,IAAI,aAAa,QAAQ,MAAM,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC;AAC1D,SAAO,eAAe,QAAW;GAC/B,MAAM,eAAe,CAAC,WAAW;AACjC,YAAS,IAAI,WAAW;GAExB,IAAI,wBAAwB,CAAC,WAAW;AACxC,UAAO,sBAAsB,QAAQ;IACnC,MAAM,uBAAO,IAAI,KAAa;AAC9B,SAAK,MAAM,YAAY,uBAAuB;KAC5C,MAAM,sBAAsB,gBAAgB;AAC5C,aAAQ,SAAS,QAAQ;AACvB,UAAI,QAAQ,YAAY,SAAS,IAAI,IAAI,CACvC;AAGF,UADgB,gBAAgB,KACpB,IAAI,SAAS,IAAI,oBAAoB,IAAI,IAAI,EAAE;AACzD,oBAAa,KAAK,IAAI;AACtB,YAAK,IAAI,IAAI;AACb,gBAAS,IAAI,IAAI;;OAEnB;;AAEJ,4BAAwB,CAAC,GAAG,KAAK;;AAGnC,UAAO,KAAK,CAAC,GAAG,aAAa,CAAC;AAC9B,gBAAa,QAAQ,MAAM,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC;;AAGxD,SAAO,OAAO,KAAK,UAAU,MAAM,KAAK,QAAQ,SAAS,KAAK,CAAC;;;CAIjE,OAAO,aAAa,MAAkD;EACpE,MAAM,aAAa,IAAI,IACrB,KAAK,SAAS,SAAS,KAAK,eAAe,CAAC,KAAK,SAASD,8BAAiBC,uBAAU,KAAK,CAAC,CAAC,CAC7F;AACD,SAAO,KAAK,QAAQ,SAAS,CAAC,WAAW,IAAID,8BAAiBC,uBAAU,KAAK,CAAC,CAAC,CAAC"}

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

@@ -1,44 +1,51 @@
-import { type CanonicalizedJson } from "../../json";
-import { type AxisSpec, type PColumnIdAndSpec, type AxisSpecNormalized, type AxisId } from "./spec/spec";
+import { CanonicalizedJson } from "../../json.js";
+import { AxisId, AxisSpec, AxisSpecNormalized, PColumnIdAndSpec } from "./spec/spec.js";
+
+//#region src/drivers/pframe/linker_columns.d.ts
 type LinkerKey = CanonicalizedJson<AxisId[]>;
-export type CompositeLinkerMap = Map<LinkerKey, {
-    keyAxesSpec: AxisSpecNormalized[];
-    linkWith: Map<LinkerKey, PColumnIdAndSpec>;
+type CompositeLinkerMap = Map<LinkerKey, {
+  keyAxesSpec: AxisSpecNormalized[];
+  linkWith: Map<LinkerKey, PColumnIdAndSpec>;
 }>;
 interface LinkersData {
-    data: CompositeLinkerMap;
+  data: CompositeLinkerMap;
 }
-export declare class LinkerMap implements LinkersData {
-    /** Graph of linkers connected by axes (single or grouped by parents) */
-    readonly data: CompositeLinkerMap;
-    constructor(linkerMap: CompositeLinkerMap);
-    get keys(): MapIterator<string & {
-        __json_canonicalized: AxisId[];
-    }>;
-    get keyAxesIds(): AxisId[][];
-    static fromColumns(columns: PColumnIdAndSpec[]): LinkerMap;
-    /** Get all available nodes of linker graphs if start from sourceAxesKeys */
-    searchAvailableAxesKeys(sourceAxesKeys: LinkerKey[]): Set<LinkerKey>;
-    /** Get all linker columns that are necessary to reach endKey from startKey */
-    searchLinkerPath(startKey: LinkerKey, endKey: LinkerKey): PColumnIdAndSpec[];
-    getLinkerColumnsForAxes({ from: sourceAxes, to: targetAxes, throwWhenNoLinkExists, }: {
-        from: AxisSpecNormalized[];
-        to: AxisSpecNormalized[];
-        throwWhenNoLinkExists?: boolean;
-    }): PColumnIdAndSpec[];
-    /** Get list of axisSpecs from keys of linker columns map  */
-    getAxesListFromKeysList(keys: LinkerKey[]): AxisSpecNormalized[];
-    /** Get axes of target axes that are impossible to be linked to source axes with current linker map */
-    getNonLinkableAxes(sourceAxes: AxisSpecNormalized[], targetAxes: AxisSpecNormalized[]): AxisSpecNormalized[];
-    /** Get all axes that can be connected to sourceAxes by linkers */
-    getReachableByLinkersAxesFromAxesNormalized(sourceAxes: AxisSpecNormalized[], matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean): AxisSpecNormalized[];
-    getReachableByLinkersAxesFromAxes(sourceAxes: AxisSpec[], matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean): AxisSpecNormalized[];
-    static getLinkerKeyFromAxisSpec(axis: AxisSpecNormalized): LinkerKey;
-    /**  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: AxisSpecNormalized[]): AxisSpecNormalized[][];
-    /** Get all axes that are not parents of any other axis */
-    static getAxesRoots(axes: AxisSpecNormalized[]): AxisSpecNormalized[];
+declare class LinkerMap implements LinkersData {
+  /** Graph of linkers connected by axes (single or grouped by parents) */
+  readonly data: CompositeLinkerMap;
+  constructor(linkerMap: CompositeLinkerMap);
+  get keys(): MapIterator<string & {
+    __json_canonicalized: AxisId[];
+  }>;
+  get keyAxesIds(): AxisId[][];
+  static fromColumns(columns: PColumnIdAndSpec[]): LinkerMap;
+  /** Get all available nodes of linker graphs if start from sourceAxesKeys */
+  searchAvailableAxesKeys(sourceAxesKeys: LinkerKey[]): Set<LinkerKey>;
+  /** Get all linker columns that are necessary to reach endKey from startKey */
+  searchLinkerPath(startKey: LinkerKey, endKey: LinkerKey): PColumnIdAndSpec[];
+  getLinkerColumnsForAxes({
+    from: sourceAxes,
+    to: targetAxes,
+    throwWhenNoLinkExists
+  }: {
+    from: AxisSpecNormalized[];
+    to: AxisSpecNormalized[];
+    throwWhenNoLinkExists?: boolean;
+  }): PColumnIdAndSpec[];
+  /** Get list of axisSpecs from keys of linker columns map  */
+  getAxesListFromKeysList(keys: LinkerKey[]): AxisSpecNormalized[];
+  /** Get axes of target axes that are impossible to be linked to source axes with current linker map */
+  getNonLinkableAxes(sourceAxes: AxisSpecNormalized[], targetAxes: AxisSpecNormalized[]): AxisSpecNormalized[];
+  /** Get all axes that can be connected to sourceAxes by linkers */
+  getReachableByLinkersAxesFromAxesNormalized(sourceAxes: AxisSpecNormalized[], matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean): AxisSpecNormalized[];
+  getReachableByLinkersAxesFromAxes(sourceAxes: AxisSpec[], matchAxisIdFn?: (axisIdOfLinker: AxisId, axisIdOfSource: AxisId) => boolean): AxisSpecNormalized[];
+  static getLinkerKeyFromAxisSpec(axis: AxisSpecNormalized): LinkerKey;
+  /**  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: AxisSpecNormalized[]): AxisSpecNormalized[][];
+  /** Get all axes that are not parents of any other axis */
+  static getAxesRoots(axes: AxisSpecNormalized[]): AxisSpecNormalized[];
 }
-export {};
+//#endregion
+export { CompositeLinkerMap, LinkerMap };
 //# sourceMappingURL=linker_columns.d.ts.map