@platforma-sdk/model 1.58.3 → 1.58.9

package/dist/render/util/label.d.ts

@@ -1,58 +1,57 @@
-import { type PObjectSpec } from "@milaboratories/pl-model-common";
+import { PObjectSpec } from "@milaboratories/pl-model-common";
 import { z } from "zod";
-export type RecordsWithLabel<T> = {
-    value: T;
-    label: string;
+
+//#region src/render/util/label.d.ts
+type RecordsWithLabel<T> = {
+  value: T;
+  label: string;
 };
-export type LabelDerivationOps = {
-    /** Force inclusion of native column label */
-    includeNativeLabel?: boolean;
-    /** Separator to use between label parts (" / " by default) */
-    separator?: string;
-    /** If true, label will be added as suffix (at the end of the generated label). By default label added as a prefix. */
-    addLabelAsSuffix?: boolean;
-    /** Trace elements list that will be forced to be included in the label. */
-    forceTraceElements?: string[];
+type LabelDerivationOps = {
+  /** Force inclusion of native column label */includeNativeLabel?: boolean; /** Separator to use between label parts (" / " by default) */
+  separator?: string; /** If true, label will be added as suffix (at the end of the generated label). By default label added as a prefix. */
+  addLabelAsSuffix?: boolean; /** Trace elements list that will be forced to be included in the label. */
+  forceTraceElements?: string[];
 };
-export declare const TraceEntry: z.ZodObject<{
-    type: z.ZodString;
-    importance: z.ZodOptional<z.ZodNumber>;
-    id: z.ZodOptional<z.ZodString>;
-    label: z.ZodString;
+declare const TraceEntry: z.ZodObject<{
+  type: z.ZodString;
+  importance: z.ZodOptional<z.ZodNumber>;
+  id: z.ZodOptional<z.ZodString>;
+  label: z.ZodString;
 }, "strip", z.ZodTypeAny, {
-    type: string;
-    label: string;
-    id?: string | undefined;
-    importance?: number | undefined;
+  label: string;
+  type: string;
+  importance?: number | undefined;
+  id?: string | undefined;
 }, {
-    type: string;
-    label: string;
-    id?: string | undefined;
-    importance?: number | undefined;
+  label: string;
+  type: string;
+  importance?: number | undefined;
+  id?: string | undefined;
 }>;
-export type TraceEntry = z.infer<typeof TraceEntry>;
-export declare const Trace: z.ZodArray<z.ZodObject<{
-    type: z.ZodString;
-    importance: z.ZodOptional<z.ZodNumber>;
-    id: z.ZodOptional<z.ZodString>;
-    label: z.ZodString;
+type TraceEntry = z.infer<typeof TraceEntry>;
+declare const Trace: z.ZodArray<z.ZodObject<{
+  type: z.ZodString;
+  importance: z.ZodOptional<z.ZodNumber>;
+  id: z.ZodOptional<z.ZodString>;
+  label: z.ZodString;
 }, "strip", z.ZodTypeAny, {
-    type: string;
-    label: string;
-    id?: string | undefined;
-    importance?: number | undefined;
+  label: string;
+  type: string;
+  importance?: number | undefined;
+  id?: string | undefined;
 }, {
-    type: string;
-    label: string;
-    id?: string | undefined;
-    importance?: number | undefined;
+  label: string;
+  type: string;
+  importance?: number | undefined;
+  id?: string | undefined;
 }>, "many">;
-export type Trace = z.infer<typeof Trace>;
+type Trace = z.infer<typeof Trace>;
 type SpecExtractorResult = PObjectSpec | {
-    spec: PObjectSpec;
-    prefixTrace?: TraceEntry[];
-    suffixTrace?: TraceEntry[];
+  spec: PObjectSpec;
+  prefixTrace?: TraceEntry[];
+  suffixTrace?: TraceEntry[];
 };
-export declare function deriveLabels<T>(values: T[], specExtractor: (obj: T) => SpecExtractorResult, ops?: LabelDerivationOps): RecordsWithLabel<T>[];
-export {};
+declare function deriveLabels<T>(values: T[], specExtractor: (obj: T) => SpecExtractorResult, ops?: LabelDerivationOps): RecordsWithLabel<T>[];
+//#endregion
+export { LabelDerivationOps, RecordsWithLabel, Trace, TraceEntry, deriveLabels };
 //# sourceMappingURL=label.d.ts.map

package/dist/render/util/label.js

@@ -1,171 +1,138 @@
-import { readAnnotation, Annotation, parseJson } from '@milaboratories/pl-model-common';
-import { z } from 'zod';
+import { Annotation, parseJson, readAnnotation } from "@milaboratories/pl-model-common";
+import { z } from "zod";
 
+//#region src/render/util/label.ts
 const TraceEntry = z.object({
-    type: z.string(),
-    importance: z.number().optional(),
-    id: z.string().optional(),
-    label: z.string(),
+	type: z.string(),
+	importance: z.number().optional(),
+	id: z.string().optional(),
+	label: z.string()
 });
 const Trace = z.array(TraceEntry);
-const DistancePenalty = 0.001;
+const DistancePenalty = .001;
 const LabelType = "__LABEL__";
 const LabelTypeFull = "__LABEL__@1";
 function deriveLabels(values, specExtractor, ops = {}) {
-    const importances = new Map();
-    const forceTraceElements = ops.forceTraceElements !== undefined && ops.forceTraceElements.length > 0
-        ? new Set(ops.forceTraceElements)
-        : undefined;
-    // number of times certain type occurred among all of the
-    const numberOfRecordsWithType = new Map();
-    const enrichedRecords = values.map((value) => {
-        const extractorResult = specExtractor(value);
-        let spec;
-        let prefixTrace;
-        let suffixTrace;
-        // Check if the result is the new structure or just PObjectSpec
-        if ("spec" in extractorResult && typeof extractorResult.spec === "object") {
-            // It's the new structure { spec, prefixTrace?, suffixTrace? }
-            spec = extractorResult.spec;
-            prefixTrace = extractorResult.prefixTrace;
-            suffixTrace = extractorResult.suffixTrace;
-        }
-        else {
-            // It's just PObjectSpec
-            spec = extractorResult;
-        }
-        const label = readAnnotation(spec, Annotation.Label);
-        const traceStr = readAnnotation(spec, Annotation.Trace);
-        const baseTrace = (traceStr ? Trace.safeParse(parseJson(traceStr)).data : undefined) ?? [];
-        const trace = [...(prefixTrace ?? []), ...baseTrace, ...(suffixTrace ?? [])];
-        if (label !== undefined) {
-            const labelEntry = { label, type: LabelType, importance: -2 };
-            if (ops.addLabelAsSuffix)
-                trace.push(labelEntry);
-            else
-                trace.splice(0, 0, labelEntry);
-        }
-        const fullTrace = [];
-        const occurrences = new Map();
-        for (let i = trace.length - 1; i >= 0; --i) {
-            const { type: typeName } = trace[i];
-            const importance = trace[i].importance ?? 0;
-            const occurrenceIndex = (occurrences.get(typeName) ?? 0) + 1;
-            occurrences.set(typeName, occurrenceIndex);
-            const fullType = `${typeName}@${occurrenceIndex}`;
-            numberOfRecordsWithType.set(fullType, (numberOfRecordsWithType.get(fullType) ?? 0) + 1);
-            importances.set(fullType, Math.max(importances.get(fullType) ?? Number.NEGATIVE_INFINITY, importance - (trace.length - i) * DistancePenalty));
-            fullTrace.push({ ...trace[i], fullType, occurrenceIndex: occurrenceIndex });
-        }
-        fullTrace.reverse();
-        return {
-            value,
-            spec,
-            label,
-            fullTrace,
-        };
-    });
-    // excluding repeated types (i.e. ..@2, ..@3, etc.) not found in some records
-    const mainTypes = [];
-    // repeated types (i.e. ..@2, ..@3, etc.) not found in some records
-    const secondaryTypes = [];
-    const allTypeRecords = [...importances];
-    // sorting: most important types go first
-    allTypeRecords.sort(([, i1], [, i2]) => i2 - i1);
-    for (const [typeName] of allTypeRecords) {
-        if (typeName.endsWith("@1") || numberOfRecordsWithType.get(typeName) === values.length)
-            mainTypes.push(typeName);
-        else
-            secondaryTypes.push(typeName);
-    }
-    const calculate = (includedTypes, force = false) => {
-        const result = [];
-        for (let i = 0; i < enrichedRecords.length; i++) {
-            const r = enrichedRecords[i];
-            const includedTrace = r.fullTrace.filter((fm) => includedTypes.has(fm.fullType) || (forceTraceElements && forceTraceElements.has(fm.type)));
-            if (includedTrace.length === 0) {
-                if (force)
-                    result.push({
-                        label: "Unlabeled",
-                        value: r.value,
-                    });
-                else
-                    return undefined;
-            }
-            const labelSet = includedTrace.map((fm) => fm.label);
-            const sep = ops.separator ?? " / ";
-            result.push({
-                label: labelSet.join(sep),
-                value: r.value,
-            });
-        }
-        return result;
-    };
-    const countUniqueLabels = (result) => result === undefined ? 0 : new Set(result.map((c) => c.label)).size;
-    // Post-processing: try removing types one by one (lowest importance first) to minimize the label set
-    // Accepts removal if it doesn't decrease the number of unique labels (cardinality)
-    const minimizeTypeSet = (typeSet) => {
-        const initialResult = calculate(typeSet);
-        if (initialResult === undefined) {
-            return typeSet;
-        }
-        const currentCardinality = countUniqueLabels(initialResult);
-        // Get types sorted by importance ascending (lowest first), excluding forced elements
-        const removableSorted = [...typeSet]
-            .filter((t) => !forceTraceElements?.has(t.split("@")[0]) &&
-            !(ops.includeNativeLabel && t === LabelTypeFull))
-            .sort((a, b) => (importances.get(a) ?? 0) - (importances.get(b) ?? 0));
-        for (const typeToRemove of removableSorted) {
-            const reducedSet = new Set(typeSet);
-            reducedSet.delete(typeToRemove);
-            const candidateResult = calculate(reducedSet);
-            if (candidateResult !== undefined &&
-                countUniqueLabels(candidateResult) >= currentCardinality) {
-                typeSet.delete(typeToRemove);
-            }
-        }
-        return typeSet;
-    };
-    if (mainTypes.length === 0) {
-        if (secondaryTypes.length !== 0)
-            throw new Error("Non-empty secondary types list while main types list is empty.");
-        return calculate(new Set(LabelTypeFull), true);
-    }
-    //
-    // includedTypes = 2
-    // *  *
-    // T0 T1 T2 T3 T4 T5
-    //          *
-    // additionalType = 3
-    //
-    // Resulting set: T0, T1, T3
-    //
-    let includedTypes = 0;
-    let additionalType = -1;
-    while (includedTypes < mainTypes.length) {
-        const currentSet = new Set();
-        if (ops.includeNativeLabel)
-            currentSet.add(LabelTypeFull);
-        for (let i = 0; i < includedTypes; ++i)
-            currentSet.add(mainTypes[i]);
-        if (additionalType >= 0)
-            currentSet.add(mainTypes[additionalType]);
-        const candidateResult = calculate(currentSet);
-        if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {
-            minimizeTypeSet(currentSet);
-            return calculate(currentSet);
-        }
-        additionalType++;
-        if (additionalType >= mainTypes.length) {
-            includedTypes++;
-            additionalType = includedTypes;
-        }
-    }
-    // Fallback: include all types, then try to minimize
-    const fallbackSet = new Set([...mainTypes, ...secondaryTypes]);
-    minimizeTypeSet(fallbackSet);
-    return calculate(fallbackSet, true);
+	const importances = /* @__PURE__ */ new Map();
+	const forceTraceElements = ops.forceTraceElements !== void 0 && ops.forceTraceElements.length > 0 ? new Set(ops.forceTraceElements) : void 0;
+	const numberOfRecordsWithType = /* @__PURE__ */ new Map();
+	const enrichedRecords = values.map((value) => {
+		const extractorResult = specExtractor(value);
+		let spec;
+		let prefixTrace;
+		let suffixTrace;
+		if ("spec" in extractorResult && typeof extractorResult.spec === "object") {
+			spec = extractorResult.spec;
+			prefixTrace = extractorResult.prefixTrace;
+			suffixTrace = extractorResult.suffixTrace;
+		} else spec = extractorResult;
+		const label = readAnnotation(spec, Annotation.Label);
+		const traceStr = readAnnotation(spec, Annotation.Trace);
+		const baseTrace = (traceStr ? Trace.safeParse(parseJson(traceStr)).data : void 0) ?? [];
+		const trace = [
+			...prefixTrace ?? [],
+			...baseTrace,
+			...suffixTrace ?? []
+		];
+		if (label !== void 0) {
+			const labelEntry = {
+				label,
+				type: LabelType,
+				importance: -2
+			};
+			if (ops.addLabelAsSuffix) trace.push(labelEntry);
+			else trace.splice(0, 0, labelEntry);
+		}
+		const fullTrace = [];
+		const occurrences = /* @__PURE__ */ new Map();
+		for (let i = trace.length - 1; i >= 0; --i) {
+			const { type: typeName } = trace[i];
+			const importance = trace[i].importance ?? 0;
+			const occurrenceIndex = (occurrences.get(typeName) ?? 0) + 1;
+			occurrences.set(typeName, occurrenceIndex);
+			const fullType = `${typeName}@${occurrenceIndex}`;
+			numberOfRecordsWithType.set(fullType, (numberOfRecordsWithType.get(fullType) ?? 0) + 1);
+			importances.set(fullType, Math.max(importances.get(fullType) ?? Number.NEGATIVE_INFINITY, importance - (trace.length - i) * DistancePenalty));
+			fullTrace.push({
+				...trace[i],
+				fullType,
+				occurrenceIndex
+			});
+		}
+		fullTrace.reverse();
+		return {
+			value,
+			spec,
+			label,
+			fullTrace
+		};
+	});
+	const mainTypes = [];
+	const secondaryTypes = [];
+	const allTypeRecords = [...importances];
+	allTypeRecords.sort(([, i1], [, i2]) => i2 - i1);
+	for (const [typeName] of allTypeRecords) if (typeName.endsWith("@1") || numberOfRecordsWithType.get(typeName) === values.length) mainTypes.push(typeName);
+	else secondaryTypes.push(typeName);
+	const calculate = (includedTypes, force = false) => {
+		const result = [];
+		for (let i = 0; i < enrichedRecords.length; i++) {
+			const r = enrichedRecords[i];
+			const includedTrace = r.fullTrace.filter((fm) => includedTypes.has(fm.fullType) || forceTraceElements && forceTraceElements.has(fm.type));
+			if (includedTrace.length === 0) if (force) result.push({
+				label: "Unlabeled",
+				value: r.value
+			});
+			else return void 0;
+			const labelSet = includedTrace.map((fm) => fm.label);
+			const sep = ops.separator ?? " / ";
+			result.push({
+				label: labelSet.join(sep),
+				value: r.value
+			});
+		}
+		return result;
+	};
+	const countUniqueLabels = (result) => result === void 0 ? 0 : new Set(result.map((c) => c.label)).size;
+	const minimizeTypeSet = (typeSet) => {
+		const initialResult = calculate(typeSet);
+		if (initialResult === void 0) return typeSet;
+		const currentCardinality = countUniqueLabels(initialResult);
+		const removableSorted = [...typeSet].filter((t) => !forceTraceElements?.has(t.split("@")[0]) && !(ops.includeNativeLabel && t === LabelTypeFull)).sort((a, b) => (importances.get(a) ?? 0) - (importances.get(b) ?? 0));
+		for (const typeToRemove of removableSorted) {
+			const reducedSet = new Set(typeSet);
+			reducedSet.delete(typeToRemove);
+			const candidateResult = calculate(reducedSet);
+			if (candidateResult !== void 0 && countUniqueLabels(candidateResult) >= currentCardinality) typeSet.delete(typeToRemove);
+		}
+		return typeSet;
+	};
+	if (mainTypes.length === 0) {
+		if (secondaryTypes.length !== 0) throw new Error("Non-empty secondary types list while main types list is empty.");
+		return calculate(new Set(LabelTypeFull), true);
+	}
+	let includedTypes = 0;
+	let additionalType = -1;
+	while (includedTypes < mainTypes.length) {
+		const currentSet = /* @__PURE__ */ new Set();
+		if (ops.includeNativeLabel) currentSet.add(LabelTypeFull);
+		for (let i = 0; i < includedTypes; ++i) currentSet.add(mainTypes[i]);
+		if (additionalType >= 0) currentSet.add(mainTypes[additionalType]);
+		const candidateResult = calculate(currentSet);
+		if (candidateResult !== void 0 && countUniqueLabels(candidateResult) === values.length) {
+			minimizeTypeSet(currentSet);
+			return calculate(currentSet);
+		}
+		additionalType++;
+		if (additionalType >= mainTypes.length) {
+			includedTypes++;
+			additionalType = includedTypes;
+		}
+	}
+	const fallbackSet = new Set([...mainTypes, ...secondaryTypes]);
+	minimizeTypeSet(fallbackSet);
+	return calculate(fallbackSet, true);
 }
 
+//#endregion
 export { Trace, TraceEntry, deriveLabels };
-//# sourceMappingURL=label.js.map
+//# sourceMappingURL=label.js.map

package/dist/render/util/label.js.map

@@ -1 +1 @@
-{"version":3,"file":"label.js","sources":["../../../src/render/util/label.ts"],"sourcesContent":["import {\n  Annotation,\n  parseJson,\n  readAnnotation,\n  type PObjectSpec,\n} from \"@milaboratories/pl-model-common\";\nimport { z } from \"zod\";\n\nexport type RecordsWithLabel<T> = {\n  value: T;\n  label: string;\n};\n\nexport type LabelDerivationOps = {\n  /** Force inclusion of native column label */\n  includeNativeLabel?: boolean;\n  /** Separator to use between label parts (\" / \" by default) */\n  separator?: string;\n  /** If true, label will be added as suffix (at the end of the generated label). By default label added as a prefix. */\n  addLabelAsSuffix?: boolean;\n  /** Trace elements list that will be forced to be included in the label. */\n  forceTraceElements?: string[];\n};\n\nexport const TraceEntry = z.object({\n  type: z.string(),\n  importance: z.number().optional(),\n  id: z.string().optional(),\n  label: z.string(),\n});\nexport type TraceEntry = z.infer<typeof TraceEntry>;\ntype FullTraceEntry = TraceEntry & { fullType: string; occurrenceIndex: number };\n\nexport const Trace = z.array(TraceEntry);\nexport type Trace = z.infer<typeof Trace>;\ntype FullTrace = FullTraceEntry[];\n\n// Define the possible return types for the specExtractor function\ntype SpecExtractorResult =\n  | PObjectSpec\n  | {\n      spec: PObjectSpec;\n      prefixTrace?: TraceEntry[];\n      suffixTrace?: TraceEntry[];\n    };\n\nconst DistancePenalty = 0.001;\n\nconst LabelType = \"__LABEL__\";\nconst LabelTypeFull = \"__LABEL__@1\";\n\nexport function deriveLabels<T>(\n  values: T[],\n  specExtractor: (obj: T) => SpecExtractorResult,\n  ops: LabelDerivationOps = {},\n): RecordsWithLabel<T>[] {\n  const importances = new Map<string, number>();\n\n  const forceTraceElements =\n    ops.forceTraceElements !== undefined && ops.forceTraceElements.length > 0\n      ? new Set(ops.forceTraceElements)\n      : undefined;\n\n  // number of times certain type occurred among all of the\n  const numberOfRecordsWithType = new Map<string, number>();\n\n  const enrichedRecords = values.map((value) => {\n    const extractorResult = specExtractor(value);\n    let spec: PObjectSpec;\n    let prefixTrace: TraceEntry[] | undefined;\n    let suffixTrace: TraceEntry[] | undefined;\n\n    // Check if the result is the new structure or just PObjectSpec\n    if (\"spec\" in extractorResult && typeof extractorResult.spec === \"object\") {\n      // It's the new structure { spec, prefixTrace?, suffixTrace? }\n      spec = extractorResult.spec;\n      prefixTrace = extractorResult.prefixTrace;\n      suffixTrace = extractorResult.suffixTrace;\n    } else {\n      // It's just PObjectSpec\n      spec = extractorResult as PObjectSpec;\n    }\n\n    const label = readAnnotation(spec, Annotation.Label);\n    const traceStr = readAnnotation(spec, Annotation.Trace);\n    const baseTrace = (traceStr ? Trace.safeParse(parseJson(traceStr)).data : undefined) ?? [];\n\n    const trace = [...(prefixTrace ?? []), ...baseTrace, ...(suffixTrace ?? [])];\n\n    if (label !== undefined) {\n      const labelEntry = { label, type: LabelType, importance: -2 };\n      if (ops.addLabelAsSuffix) trace.push(labelEntry);\n      else trace.splice(0, 0, labelEntry);\n    }\n\n    const fullTrace: FullTrace = [];\n\n    const occurrences = new Map<string, number>();\n    for (let i = trace.length - 1; i >= 0; --i) {\n      const { type: typeName } = trace[i];\n      const importance = trace[i].importance ?? 0;\n      const occurrenceIndex = (occurrences.get(typeName) ?? 0) + 1;\n      occurrences.set(typeName, occurrenceIndex);\n      const fullType = `${typeName}@${occurrenceIndex}`;\n      numberOfRecordsWithType.set(fullType, (numberOfRecordsWithType.get(fullType) ?? 0) + 1);\n      importances.set(\n        fullType,\n        Math.max(\n          importances.get(fullType) ?? Number.NEGATIVE_INFINITY,\n          importance - (trace.length - i) * DistancePenalty,\n        ),\n      );\n      fullTrace.push({ ...trace[i], fullType, occurrenceIndex: occurrenceIndex });\n    }\n    fullTrace.reverse();\n    return {\n      value,\n      spec,\n      label,\n      fullTrace,\n    };\n  });\n\n  // excluding repeated types (i.e. ..@2, ..@3, etc.) not found in some records\n  const mainTypes: string[] = [];\n  // repeated types (i.e. ..@2, ..@3, etc.) not found in some records\n  const secondaryTypes: string[] = [];\n\n  const allTypeRecords = [...importances];\n  // sorting: most important types go first\n  allTypeRecords.sort(([, i1], [, i2]) => i2 - i1);\n\n  for (const [typeName] of allTypeRecords) {\n    if (typeName.endsWith(\"@1\") || numberOfRecordsWithType.get(typeName) === values.length)\n      mainTypes.push(typeName);\n    else secondaryTypes.push(typeName);\n  }\n\n  const calculate = (includedTypes: Set<string>, force: boolean = false) => {\n    const result: RecordsWithLabel<T>[] = [];\n    for (let i = 0; i < enrichedRecords.length; i++) {\n      const r = enrichedRecords[i];\n      const includedTrace = r.fullTrace.filter(\n        (fm) =>\n          includedTypes.has(fm.fullType) || (forceTraceElements && forceTraceElements.has(fm.type)),\n      );\n      if (includedTrace.length === 0) {\n        if (force)\n          result.push({\n            label: \"Unlabeled\",\n            value: r.value,\n          } satisfies RecordsWithLabel<T>);\n        else return undefined;\n      }\n      const labelSet = includedTrace.map((fm) => fm.label);\n      const sep = ops.separator ?? \" / \";\n      result.push({\n        label: labelSet.join(sep),\n        value: r.value,\n      } satisfies RecordsWithLabel<T>);\n    }\n    return result;\n  };\n\n  const countUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): number =>\n    result === undefined ? 0 : new Set(result.map((c) => c.label)).size;\n\n  // Post-processing: try removing types one by one (lowest importance first) to minimize the label set\n  // Accepts removal if it doesn't decrease the number of unique labels (cardinality)\n  const minimizeTypeSet = (typeSet: Set<string>): Set<string> => {\n    const initialResult = calculate(typeSet);\n    if (initialResult === undefined) {\n      return typeSet;\n    }\n    const currentCardinality = countUniqueLabels(initialResult);\n\n    // Get types sorted by importance ascending (lowest first), excluding forced elements\n    const removableSorted = [...typeSet]\n      .filter(\n        (t) =>\n          !forceTraceElements?.has(t.split(\"@\")[0]) &&\n          !(ops.includeNativeLabel && t === LabelTypeFull),\n      )\n      .sort((a, b) => (importances.get(a) ?? 0) - (importances.get(b) ?? 0));\n\n    for (const typeToRemove of removableSorted) {\n      const reducedSet = new Set(typeSet);\n      reducedSet.delete(typeToRemove);\n      const candidateResult = calculate(reducedSet);\n      if (\n        candidateResult !== undefined &&\n        countUniqueLabels(candidateResult) >= currentCardinality\n      ) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0)\n      throw new Error(\"Non-empty secondary types list while main types list is empty.\");\n    return calculate(new Set(LabelTypeFull), true)!;\n  }\n\n  //\n  // includedTypes = 2\n  // *  *\n  // T0 T1 T2 T3 T4 T5\n  //          *\n  // additionalType = 3\n  //\n  // Resulting set: T0, T1, T3\n  //\n  let includedTypes = 0;\n  let additionalType = -1;\n  while (includedTypes < mainTypes.length) {\n    const currentSet = new Set<string>();\n    if (ops.includeNativeLabel) currentSet.add(LabelTypeFull);\n    for (let i = 0; i < includedTypes; ++i) currentSet.add(mainTypes[i]);\n    if (additionalType >= 0) currentSet.add(mainTypes[additionalType]);\n\n    const candidateResult = calculate(currentSet);\n\n    if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {\n      minimizeTypeSet(currentSet);\n      return calculate(currentSet)!;\n    }\n\n    additionalType++;\n    if (additionalType >= mainTypes.length) {\n      includedTypes++;\n      additionalType = includedTypes;\n    }\n  }\n\n  // Fallback: include all types, then try to minimize\n  const fallbackSet = new Set([...mainTypes, ...secondaryTypes]);\n  minimizeTypeSet(fallbackSet);\n  return calculate(fallbackSet, true)!;\n}\n"],"names":[],"mappings":";;;AAwBO,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;AACjC,IAAA,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;AAChB,IAAA,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACjC,IAAA,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACzB,IAAA,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;AAClB,CAAA;AAIM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU;AAavC,MAAM,eAAe,GAAG,KAAK;AAE7B,MAAM,SAAS,GAAG,WAAW;AAC7B,MAAM,aAAa,GAAG,aAAa;AAE7B,SAAU,YAAY,CAC1B,MAAW,EACX,aAA8C,EAC9C,MAA0B,EAAE,EAAA;AAE5B,IAAA,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB;AAE7C,IAAA,MAAM,kBAAkB,GACtB,GAAG,CAAC,kBAAkB,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG;AACtE,UAAE,IAAI,GAAG,CAAC,GAAG,CAAC,kBAAkB;UAC9B,SAAS;;AAGf,IAAA,MAAM,uBAAuB,GAAG,IAAI,GAAG,EAAkB;IAEzD,MAAM,eAAe,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,KAAI;AAC3C,QAAA,MAAM,eAAe,GAAG,aAAa,CAAC,KAAK,CAAC;AAC5C,QAAA,IAAI,IAAiB;AACrB,QAAA,IAAI,WAAqC;AACzC,QAAA,IAAI,WAAqC;;QAGzC,IAAI,MAAM,IAAI,eAAe,IAAI,OAAO,eAAe,CAAC,IAAI,KAAK,QAAQ,EAAE;;AAEzE,YAAA,IAAI,GAAG,eAAe,CAAC,IAAI;AAC3B,YAAA,WAAW,GAAG,eAAe,CAAC,WAAW;AACzC,YAAA,WAAW,GAAG,eAAe,CAAC,WAAW;QAC3C;aAAO;;YAEL,IAAI,GAAG,eAA8B;QACvC;QAEA,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC;QACpD,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC;QACvD,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,KAAK,EAAE;QAE1F,MAAM,KAAK,GAAG,CAAC,IAAI,WAAW,IAAI,EAAE,CAAC,EAAE,GAAG,SAAS,EAAE,IAAI,WAAW,IAAI,EAAE,CAAC,CAAC;AAE5E,QAAA,IAAI,KAAK,KAAK,SAAS,EAAE;AACvB,YAAA,MAAM,UAAU,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE;YAC7D,IAAI,GAAG,CAAC,gBAAgB;AAAE,gBAAA,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;;gBAC3C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC;QACrC;QAEA,MAAM,SAAS,GAAc,EAAE;AAE/B,QAAA,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB;AAC7C,QAAA,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC;AAC3C,YAAA,MAAM,eAAe,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AAC5D,YAAA,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,CAAC;AAC1C,YAAA,MAAM,QAAQ,GAAG,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,eAAe,EAAE;AACjD,YAAA,uBAAuB,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,uBAAuB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvF,YAAA,WAAW,CAAC,GAAG,CACb,QAAQ,EACR,IAAI,CAAC,GAAG,CACN,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,iBAAiB,EACrD,UAAU,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAClD,CACF;AACD,YAAA,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,EAAE,CAAC;QAC7E;QACA,SAAS,CAAC,OAAO,EAAE;QACnB,OAAO;YACL,KAAK;YACL,IAAI;YACJ,KAAK;YACL,SAAS;SACV;AACH,IAAA,CAAC,CAAC;;IAGF,MAAM,SAAS,GAAa,EAAE;;IAE9B,MAAM,cAAc,GAAa,EAAE;AAEnC,IAAA,MAAM,cAAc,GAAG,CAAC,GAAG,WAAW,CAAC;;IAEvC,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC;AAEhD,IAAA,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,cAAc,EAAE;AACvC,QAAA,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,uBAAuB,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,MAAM,CAAC,MAAM;AACpF,YAAA,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC;;AACrB,YAAA,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC;IACpC;IAEA,MAAM,SAAS,GAAG,CAAC,aAA0B,EAAE,KAAA,GAAiB,KAAK,KAAI;QACvE,MAAM,MAAM,GAA0B,EAAE;AACxC,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,YAAA,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC;AAC5B,YAAA,MAAM,aAAa,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CACtC,CAAC,EAAE,KACD,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,kBAAkB,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAC5F;AACD,YAAA,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE;AAC9B,gBAAA,IAAI,KAAK;oBACP,MAAM,CAAC,IAAI,CAAC;AACV,wBAAA,KAAK,EAAE,WAAW;wBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;AACe,qBAAA,CAAC;;AAC7B,oBAAA,OAAO,SAAS;YACvB;AACA,YAAA,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC;AACpD,YAAA,MAAM,GAAG,GAAG,GAAG,CAAC,SAAS,IAAI,KAAK;YAClC,MAAM,CAAC,IAAI,CAAC;AACV,gBAAA,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;gBACzB,KAAK,EAAE,CAAC,CAAC,KAAK;AACe,aAAA,CAAC;QAClC;AACA,QAAA,OAAO,MAAM;AACf,IAAA,CAAC;AAED,IAAA,MAAM,iBAAiB,GAAG,CAAC,MAAyC,KAClE,MAAM,KAAK,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;;;AAIrE,IAAA,MAAM,eAAe,GAAG,CAAC,OAAoB,KAAiB;AAC5D,QAAA,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC;AACxC,QAAA,IAAI,aAAa,KAAK,SAAS,EAAE;AAC/B,YAAA,OAAO,OAAO;QAChB;AACA,QAAA,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,aAAa,CAAC;;AAG3D,QAAA,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO;aAChC,MAAM,CACL,CAAC,CAAC,KACA,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,EAAE,GAAG,CAAC,kBAAkB,IAAI,CAAC,KAAK,aAAa,CAAC;AAEnD,aAAA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAExE,QAAA,KAAK,MAAM,YAAY,IAAI,eAAe,EAAE;AAC1C,YAAA,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC;AACnC,YAAA,UAAU,CAAC,MAAM,CAAC,YAAY,CAAC;AAC/B,YAAA,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;YAC7C,IACE,eAAe,KAAK,SAAS;AAC7B,gBAAA,iBAAiB,CAAC,eAAe,CAAC,IAAI,kBAAkB,EACxD;AACA,gBAAA,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC;YAC9B;QACF;AACA,QAAA,OAAO,OAAO;AAChB,IAAA,CAAC;AAED,IAAA,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AAC1B,QAAA,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;AAC7B,YAAA,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC;QACnF,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,aAAa,CAAC,EAAE,IAAI,CAAE;IACjD;;;;;;;;;;IAWA,IAAI,aAAa,GAAG,CAAC;AACrB,IAAA,IAAI,cAAc,GAAG,EAAE;AACvB,IAAA,OAAO,aAAa,GAAG,SAAS,CAAC,MAAM,EAAE;AACvC,QAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU;QACpC,IAAI,GAAG,CAAC,kBAAkB;AAAE,YAAA,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,EAAE,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,cAAc,IAAI,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAElE,QAAA,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;AAE7C,QAAA,IAAI,eAAe,KAAK,SAAS,IAAI,iBAAiB,CAAC,eAAe,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;YACzF,eAAe,CAAC,UAAU,CAAC;AAC3B,YAAA,OAAO,SAAS,CAAC,UAAU,CAAE;QAC/B;AAEA,QAAA,cAAc,EAAE;AAChB,QAAA,IAAI,cAAc,IAAI,SAAS,CAAC,MAAM,EAAE;AACtC,YAAA,aAAa,EAAE;YACf,cAAc,GAAG,aAAa;QAChC;IACF;;AAGA,IAAA,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,cAAc,CAAC,CAAC;IAC9D,eAAe,CAAC,WAAW,CAAC;AAC5B,IAAA,OAAO,SAAS,CAAC,WAAW,EAAE,IAAI,CAAE;AACtC;;;;"}
+{"version":3,"file":"label.js","names":[],"sources":["../../../src/render/util/label.ts"],"sourcesContent":["import {\n  Annotation,\n  parseJson,\n  readAnnotation,\n  type PObjectSpec,\n} from \"@milaboratories/pl-model-common\";\nimport { z } from \"zod\";\n\nexport type RecordsWithLabel<T> = {\n  value: T;\n  label: string;\n};\n\nexport type LabelDerivationOps = {\n  /** Force inclusion of native column label */\n  includeNativeLabel?: boolean;\n  /** Separator to use between label parts (\" / \" by default) */\n  separator?: string;\n  /** If true, label will be added as suffix (at the end of the generated label). By default label added as a prefix. */\n  addLabelAsSuffix?: boolean;\n  /** Trace elements list that will be forced to be included in the label. */\n  forceTraceElements?: string[];\n};\n\nexport const TraceEntry = z.object({\n  type: z.string(),\n  importance: z.number().optional(),\n  id: z.string().optional(),\n  label: z.string(),\n});\nexport type TraceEntry = z.infer<typeof TraceEntry>;\ntype FullTraceEntry = TraceEntry & { fullType: string; occurrenceIndex: number };\n\nexport const Trace = z.array(TraceEntry);\nexport type Trace = z.infer<typeof Trace>;\ntype FullTrace = FullTraceEntry[];\n\n// Define the possible return types for the specExtractor function\ntype SpecExtractorResult =\n  | PObjectSpec\n  | {\n      spec: PObjectSpec;\n      prefixTrace?: TraceEntry[];\n      suffixTrace?: TraceEntry[];\n    };\n\nconst DistancePenalty = 0.001;\n\nconst LabelType = \"__LABEL__\";\nconst LabelTypeFull = \"__LABEL__@1\";\n\nexport function deriveLabels<T>(\n  values: T[],\n  specExtractor: (obj: T) => SpecExtractorResult,\n  ops: LabelDerivationOps = {},\n): RecordsWithLabel<T>[] {\n  const importances = new Map<string, number>();\n\n  const forceTraceElements =\n    ops.forceTraceElements !== undefined && ops.forceTraceElements.length > 0\n      ? new Set(ops.forceTraceElements)\n      : undefined;\n\n  // number of times certain type occurred among all of the\n  const numberOfRecordsWithType = new Map<string, number>();\n\n  const enrichedRecords = values.map((value) => {\n    const extractorResult = specExtractor(value);\n    let spec: PObjectSpec;\n    let prefixTrace: TraceEntry[] | undefined;\n    let suffixTrace: TraceEntry[] | undefined;\n\n    // Check if the result is the new structure or just PObjectSpec\n    if (\"spec\" in extractorResult && typeof extractorResult.spec === \"object\") {\n      // It's the new structure { spec, prefixTrace?, suffixTrace? }\n      spec = extractorResult.spec;\n      prefixTrace = extractorResult.prefixTrace;\n      suffixTrace = extractorResult.suffixTrace;\n    } else {\n      // It's just PObjectSpec\n      spec = extractorResult as PObjectSpec;\n    }\n\n    const label = readAnnotation(spec, Annotation.Label);\n    const traceStr = readAnnotation(spec, Annotation.Trace);\n    const baseTrace = (traceStr ? Trace.safeParse(parseJson(traceStr)).data : undefined) ?? [];\n\n    const trace = [...(prefixTrace ?? []), ...baseTrace, ...(suffixTrace ?? [])];\n\n    if (label !== undefined) {\n      const labelEntry = { label, type: LabelType, importance: -2 };\n      if (ops.addLabelAsSuffix) trace.push(labelEntry);\n      else trace.splice(0, 0, labelEntry);\n    }\n\n    const fullTrace: FullTrace = [];\n\n    const occurrences = new Map<string, number>();\n    for (let i = trace.length - 1; i >= 0; --i) {\n      const { type: typeName } = trace[i];\n      const importance = trace[i].importance ?? 0;\n      const occurrenceIndex = (occurrences.get(typeName) ?? 0) + 1;\n      occurrences.set(typeName, occurrenceIndex);\n      const fullType = `${typeName}@${occurrenceIndex}`;\n      numberOfRecordsWithType.set(fullType, (numberOfRecordsWithType.get(fullType) ?? 0) + 1);\n      importances.set(\n        fullType,\n        Math.max(\n          importances.get(fullType) ?? Number.NEGATIVE_INFINITY,\n          importance - (trace.length - i) * DistancePenalty,\n        ),\n      );\n      fullTrace.push({ ...trace[i], fullType, occurrenceIndex: occurrenceIndex });\n    }\n    fullTrace.reverse();\n    return {\n      value,\n      spec,\n      label,\n      fullTrace,\n    };\n  });\n\n  // excluding repeated types (i.e. ..@2, ..@3, etc.) not found in some records\n  const mainTypes: string[] = [];\n  // repeated types (i.e. ..@2, ..@3, etc.) not found in some records\n  const secondaryTypes: string[] = [];\n\n  const allTypeRecords = [...importances];\n  // sorting: most important types go first\n  allTypeRecords.sort(([, i1], [, i2]) => i2 - i1);\n\n  for (const [typeName] of allTypeRecords) {\n    if (typeName.endsWith(\"@1\") || numberOfRecordsWithType.get(typeName) === values.length)\n      mainTypes.push(typeName);\n    else secondaryTypes.push(typeName);\n  }\n\n  const calculate = (includedTypes: Set<string>, force: boolean = false) => {\n    const result: RecordsWithLabel<T>[] = [];\n    for (let i = 0; i < enrichedRecords.length; i++) {\n      const r = enrichedRecords[i];\n      const includedTrace = r.fullTrace.filter(\n        (fm) =>\n          includedTypes.has(fm.fullType) || (forceTraceElements && forceTraceElements.has(fm.type)),\n      );\n      if (includedTrace.length === 0) {\n        if (force)\n          result.push({\n            label: \"Unlabeled\",\n            value: r.value,\n          } satisfies RecordsWithLabel<T>);\n        else return undefined;\n      }\n      const labelSet = includedTrace.map((fm) => fm.label);\n      const sep = ops.separator ?? \" / \";\n      result.push({\n        label: labelSet.join(sep),\n        value: r.value,\n      } satisfies RecordsWithLabel<T>);\n    }\n    return result;\n  };\n\n  const countUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): number =>\n    result === undefined ? 0 : new Set(result.map((c) => c.label)).size;\n\n  // Post-processing: try removing types one by one (lowest importance first) to minimize the label set\n  // Accepts removal if it doesn't decrease the number of unique labels (cardinality)\n  const minimizeTypeSet = (typeSet: Set<string>): Set<string> => {\n    const initialResult = calculate(typeSet);\n    if (initialResult === undefined) {\n      return typeSet;\n    }\n    const currentCardinality = countUniqueLabels(initialResult);\n\n    // Get types sorted by importance ascending (lowest first), excluding forced elements\n    const removableSorted = [...typeSet]\n      .filter(\n        (t) =>\n          !forceTraceElements?.has(t.split(\"@\")[0]) &&\n          !(ops.includeNativeLabel && t === LabelTypeFull),\n      )\n      .sort((a, b) => (importances.get(a) ?? 0) - (importances.get(b) ?? 0));\n\n    for (const typeToRemove of removableSorted) {\n      const reducedSet = new Set(typeSet);\n      reducedSet.delete(typeToRemove);\n      const candidateResult = calculate(reducedSet);\n      if (\n        candidateResult !== undefined &&\n        countUniqueLabels(candidateResult) >= currentCardinality\n      ) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0)\n      throw new Error(\"Non-empty secondary types list while main types list is empty.\");\n    return calculate(new Set(LabelTypeFull), true)!;\n  }\n\n  //\n  // includedTypes = 2\n  // *  *\n  // T0 T1 T2 T3 T4 T5\n  //          *\n  // additionalType = 3\n  //\n  // Resulting set: T0, T1, T3\n  //\n  let includedTypes = 0;\n  let additionalType = -1;\n  while (includedTypes < mainTypes.length) {\n    const currentSet = new Set<string>();\n    if (ops.includeNativeLabel) currentSet.add(LabelTypeFull);\n    for (let i = 0; i < includedTypes; ++i) currentSet.add(mainTypes[i]);\n    if (additionalType >= 0) currentSet.add(mainTypes[additionalType]);\n\n    const candidateResult = calculate(currentSet);\n\n    if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {\n      minimizeTypeSet(currentSet);\n      return calculate(currentSet)!;\n    }\n\n    additionalType++;\n    if (additionalType >= mainTypes.length) {\n      includedTypes++;\n      additionalType = includedTypes;\n    }\n  }\n\n  // Fallback: include all types, then try to minimize\n  const fallbackSet = new Set([...mainTypes, ...secondaryTypes]);\n  minimizeTypeSet(fallbackSet);\n  return calculate(fallbackSet, true)!;\n}\n"],"mappings":";;;;AAwBA,MAAa,aAAa,EAAE,OAAO;CACjC,MAAM,EAAE,QAAQ;CAChB,YAAY,EAAE,QAAQ,CAAC,UAAU;CACjC,IAAI,EAAE,QAAQ,CAAC,UAAU;CACzB,OAAO,EAAE,QAAQ;CAClB,CAAC;AAIF,MAAa,QAAQ,EAAE,MAAM,WAAW;AAaxC,MAAM,kBAAkB;AAExB,MAAM,YAAY;AAClB,MAAM,gBAAgB;AAEtB,SAAgB,aACd,QACA,eACA,MAA0B,EAAE,EACL;CACvB,MAAM,8BAAc,IAAI,KAAqB;CAE7C,MAAM,qBACJ,IAAI,uBAAuB,UAAa,IAAI,mBAAmB,SAAS,IACpE,IAAI,IAAI,IAAI,mBAAmB,GAC/B;CAGN,MAAM,0CAA0B,IAAI,KAAqB;CAEzD,MAAM,kBAAkB,OAAO,KAAK,UAAU;EAC5C,MAAM,kBAAkB,cAAc,MAAM;EAC5C,IAAI;EACJ,IAAI;EACJ,IAAI;AAGJ,MAAI,UAAU,mBAAmB,OAAO,gBAAgB,SAAS,UAAU;AAEzE,UAAO,gBAAgB;AACvB,iBAAc,gBAAgB;AAC9B,iBAAc,gBAAgB;QAG9B,QAAO;EAGT,MAAM,QAAQ,eAAe,MAAM,WAAW,MAAM;EACpD,MAAM,WAAW,eAAe,MAAM,WAAW,MAAM;EACvD,MAAM,aAAa,WAAW,MAAM,UAAU,UAAU,SAAS,CAAC,CAAC,OAAO,WAAc,EAAE;EAE1F,MAAM,QAAQ;GAAC,GAAI,eAAe,EAAE;GAAG,GAAG;GAAW,GAAI,eAAe,EAAE;GAAE;AAE5E,MAAI,UAAU,QAAW;GACvB,MAAM,aAAa;IAAE;IAAO,MAAM;IAAW,YAAY;IAAI;AAC7D,OAAI,IAAI,iBAAkB,OAAM,KAAK,WAAW;OAC3C,OAAM,OAAO,GAAG,GAAG,WAAW;;EAGrC,MAAM,YAAuB,EAAE;EAE/B,MAAM,8BAAc,IAAI,KAAqB;AAC7C,OAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;GAC1C,MAAM,EAAE,MAAM,aAAa,MAAM;GACjC,MAAM,aAAa,MAAM,GAAG,cAAc;GAC1C,MAAM,mBAAmB,YAAY,IAAI,SAAS,IAAI,KAAK;AAC3D,eAAY,IAAI,UAAU,gBAAgB;GAC1C,MAAM,WAAW,GAAG,SAAS,GAAG;AAChC,2BAAwB,IAAI,WAAW,wBAAwB,IAAI,SAAS,IAAI,KAAK,EAAE;AACvF,eAAY,IACV,UACA,KAAK,IACH,YAAY,IAAI,SAAS,IAAI,OAAO,mBACpC,cAAc,MAAM,SAAS,KAAK,gBACnC,CACF;AACD,aAAU,KAAK;IAAE,GAAG,MAAM;IAAI;IAA2B;IAAiB,CAAC;;AAE7E,YAAU,SAAS;AACnB,SAAO;GACL;GACA;GACA;GACA;GACD;GACD;CAGF,MAAM,YAAsB,EAAE;CAE9B,MAAM,iBAA2B,EAAE;CAEnC,MAAM,iBAAiB,CAAC,GAAG,YAAY;AAEvC,gBAAe,MAAM,GAAG,KAAK,GAAG,QAAQ,KAAK,GAAG;AAEhD,MAAK,MAAM,CAAC,aAAa,eACvB,KAAI,SAAS,SAAS,KAAK,IAAI,wBAAwB,IAAI,SAAS,KAAK,OAAO,OAC9E,WAAU,KAAK,SAAS;KACrB,gBAAe,KAAK,SAAS;CAGpC,MAAM,aAAa,eAA4B,QAAiB,UAAU;EACxE,MAAM,SAAgC,EAAE;AACxC,OAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;GAC/C,MAAM,IAAI,gBAAgB;GAC1B,MAAM,gBAAgB,EAAE,UAAU,QAC/B,OACC,cAAc,IAAI,GAAG,SAAS,IAAK,sBAAsB,mBAAmB,IAAI,GAAG,KAAK,CAC3F;AACD,OAAI,cAAc,WAAW,EAC3B,KAAI,MACF,QAAO,KAAK;IACV,OAAO;IACP,OAAO,EAAE;IACV,CAA+B;OAC7B,QAAO;GAEd,MAAM,WAAW,cAAc,KAAK,OAAO,GAAG,MAAM;GACpD,MAAM,MAAM,IAAI,aAAa;AAC7B,UAAO,KAAK;IACV,OAAO,SAAS,KAAK,IAAI;IACzB,OAAO,EAAE;IACV,CAA+B;;AAElC,SAAO;;CAGT,MAAM,qBAAqB,WACzB,WAAW,SAAY,IAAI,IAAI,IAAI,OAAO,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;CAIjE,MAAM,mBAAmB,YAAsC;EAC7D,MAAM,gBAAgB,UAAU,QAAQ;AACxC,MAAI,kBAAkB,OACpB,QAAO;EAET,MAAM,qBAAqB,kBAAkB,cAAc;EAG3D,MAAM,kBAAkB,CAAC,GAAG,QAAQ,CACjC,QACE,MACC,CAAC,oBAAoB,IAAI,EAAE,MAAM,IAAI,CAAC,GAAG,IACzC,EAAE,IAAI,sBAAsB,MAAM,eACrC,CACA,MAAM,GAAG,OAAO,YAAY,IAAI,EAAE,IAAI,MAAM,YAAY,IAAI,EAAE,IAAI,GAAG;AAExE,OAAK,MAAM,gBAAgB,iBAAiB;GAC1C,MAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,cAAW,OAAO,aAAa;GAC/B,MAAM,kBAAkB,UAAU,WAAW;AAC7C,OACE,oBAAoB,UACpB,kBAAkB,gBAAgB,IAAI,mBAEtC,SAAQ,OAAO,aAAa;;AAGhC,SAAO;;AAGT,KAAI,UAAU,WAAW,GAAG;AAC1B,MAAI,eAAe,WAAW,EAC5B,OAAM,IAAI,MAAM,iEAAiE;AACnF,SAAO,UAAU,IAAI,IAAI,cAAc,EAAE,KAAK;;CAYhD,IAAI,gBAAgB;CACpB,IAAI,iBAAiB;AACrB,QAAO,gBAAgB,UAAU,QAAQ;EACvC,MAAM,6BAAa,IAAI,KAAa;AACpC,MAAI,IAAI,mBAAoB,YAAW,IAAI,cAAc;AACzD,OAAK,IAAI,IAAI,GAAG,IAAI,eAAe,EAAE,EAAG,YAAW,IAAI,UAAU,GAAG;AACpE,MAAI,kBAAkB,EAAG,YAAW,IAAI,UAAU,gBAAgB;EAElE,MAAM,kBAAkB,UAAU,WAAW;AAE7C,MAAI,oBAAoB,UAAa,kBAAkB,gBAAgB,KAAK,OAAO,QAAQ;AACzF,mBAAgB,WAAW;AAC3B,UAAO,UAAU,WAAW;;AAG9B;AACA,MAAI,kBAAkB,UAAU,QAAQ;AACtC;AACA,oBAAiB;;;CAKrB,MAAM,cAAc,IAAI,IAAI,CAAC,GAAG,WAAW,GAAG,eAAe,CAAC;AAC9D,iBAAgB,YAAY;AAC5B,QAAO,UAAU,aAAa,KAAK"}