@platforma-sdk/model 1.51.6 → 1.51.9

package/dist/package.json.cjs

@@ -1,6 +1,6 @@
 'use strict';
 
-var version = "1.51.6";
+var version = "1.51.9";
 
 exports.version = version;
 //# sourceMappingURL=package.json.cjs.map

package/dist/package.json.js

@@ -1,4 +1,4 @@
-var version = "1.51.6";
+var version = "1.51.9";
 
 export { version };
 //# sourceMappingURL=package.json.js.map

package/dist/render/util/label.cjs

@@ -110,10 +110,15 @@ function deriveLabels(values, specExtractor, ops = {}) {
         }
         return result;
     };
-    // Checks if a result has all unique labels
-    const hasUniqueLabels = (result) => result !== undefined && new Set(result.map((c) => c.label)).size === values.length;
+    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])
@@ -123,7 +128,7 @@ function deriveLabels(values, specExtractor, ops = {}) {
             const reducedSet = new Set(typeSet);
             reducedSet.delete(typeToRemove);
             const candidateResult = calculate(reducedSet);
-            if (hasUniqueLabels(candidateResult)) {
+            if (candidateResult !== undefined && countUniqueLabels(candidateResult) >= currentCardinality) {
                 typeSet.delete(typeToRemove);
             }
         }
@@ -154,7 +159,7 @@ function deriveLabels(values, specExtractor, ops = {}) {
         if (additionalType >= 0)
             currentSet.add(mainTypes[additionalType]);
         const candidateResult = calculate(currentSet);
-        if (hasUniqueLabels(candidateResult)) {
+        if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {
             minimizeTypeSet(currentSet);
             return calculate(currentSet);
         }

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

@@ -1 +1 @@
-{"version":3,"file":"label.cjs","sources":["../../../src/render/util/label.ts"],"sourcesContent":["import { Annotation, parseJson, readAnnotation, type PObjectSpec } 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 = PObjectSpec | {\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 = (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 = [\n      ...(prefixTrace ?? []),\n      ...baseTrace,\n      ...(suffixTrace ?? []),\n    ];\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\n        .filter((fm) => includedTypes.has(fm.fullType)\n          || (forceTraceElements && forceTraceElements.has(fm.type)));\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\n        .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  // Checks if a result has all unique labels\n  const hasUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): boolean =>\n    result !== undefined && new Set(result.map((c) => c.label)).size === values.length;\n\n  // Post-processing: try removing types one by one (lowest importance first) to minimize the label set\n  const minimizeTypeSet = (typeSet: Set<string>): Set<string> => {\n    // Get types sorted by importance ascending (lowest first), excluding forced elements\n    const removableSorted = [...typeSet]\n      .filter((t) =>\n        !forceTraceElements?.has(t.split('@')[0])\n        && !(ops.includeNativeLabel && t === LabelTypeFull))\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 (hasUniqueLabels(candidateResult)) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0) 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)\n      currentSet.add(mainTypes[additionalType]);\n\n    const candidateResult = calculate(currentSet);\n\n    if (hasUniqueLabels(candidateResult)) {\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":["z","readAnnotation","Annotation","parseJson"],"mappings":";;;;;AAmBO,MAAM,UAAU,GAAGA,KAAC,CAAC,MAAM,CAAC;AACjC,IAAA,IAAI,EAAEA,KAAC,CAAC,MAAM,EAAE;AAChB,IAAA,UAAU,EAAEA,KAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACjC,IAAA,EAAE,EAAEA,KAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACzB,IAAA,KAAK,EAAEA,KAAC,CAAC,MAAM,EAAE;AAClB,CAAA;AAIM,MAAM,KAAK,GAAGA,KAAC,CAAC,KAAK,CAAC,UAAU;AAWvC,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,GAAG,CAAC,GAAG,CAAC,kBAAkB,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;AACnG,UAAE,IAAI,GAAG,CAAC,GAAG,CAAC,kBAAkB;UAC9B,SAAS;;AAGb,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,GAAGC,4BAAc,CAAC,IAAI,EAAEC,wBAAU,CAAC,KAAK,CAAC;QACpD,MAAM,QAAQ,GAAGD,4BAAc,CAAC,IAAI,EAAEC,wBAAU,CAAC,KAAK,CAAC;QACvD,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,SAAS,CAACC,uBAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,KAAK,EAAE;AAE1F,QAAA,MAAM,KAAK,GAAG;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;AACtB,YAAA,GAAG,SAAS;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;SACvB;AAED,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;AACrB,iBAAA,MAAM,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ;AACxC,oBAAC,kBAAkB,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/D,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;YACA,MAAM,QAAQ,GAAG;iBACd,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC;AACxB,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;;AAGD,IAAA,MAAM,eAAe,GAAG,CAAC,MAAyC,KAChE,MAAM,KAAK,SAAS,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM;;AAGpF,IAAA,MAAM,eAAe,GAAG,CAAC,OAAoB,KAAiB;;AAE5D,QAAA,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO;aAChC,MAAM,CAAC,CAAC,CAAC,KACR,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;eACrC,EAAE,GAAG,CAAC,kBAAkB,IAAI,CAAC,KAAK,aAAa,CAAC;AACpD,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;AAC7C,YAAA,IAAI,eAAe,CAAC,eAAe,CAAC,EAAE;AACpC,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;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC;QAClH,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;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAE3C,QAAA,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;AAE7C,QAAA,IAAI,eAAe,CAAC,eAAe,CAAC,EAAE;YACpC,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.cjs","sources":["../../../src/render/util/label.ts"],"sourcesContent":["import { Annotation, parseJson, readAnnotation, type PObjectSpec } 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 = PObjectSpec | {\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 = (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 = [\n      ...(prefixTrace ?? []),\n      ...baseTrace,\n      ...(suffixTrace ?? []),\n    ];\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\n        .filter((fm) => includedTypes.has(fm.fullType)\n          || (forceTraceElements && forceTraceElements.has(fm.type)));\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\n        .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((t) =>\n        !forceTraceElements?.has(t.split('@')[0])\n        && !(ops.includeNativeLabel && t === LabelTypeFull))\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 (candidateResult !== undefined && countUniqueLabels(candidateResult) >= currentCardinality) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0) 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)\n      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":["z","readAnnotation","Annotation","parseJson"],"mappings":";;;;;AAmBO,MAAM,UAAU,GAAGA,KAAC,CAAC,MAAM,CAAC;AACjC,IAAA,IAAI,EAAEA,KAAC,CAAC,MAAM,EAAE;AAChB,IAAA,UAAU,EAAEA,KAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACjC,IAAA,EAAE,EAAEA,KAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;AACzB,IAAA,KAAK,EAAEA,KAAC,CAAC,MAAM,EAAE;AAClB,CAAA;AAIM,MAAM,KAAK,GAAGA,KAAC,CAAC,KAAK,CAAC,UAAU;AAWvC,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,GAAG,CAAC,GAAG,CAAC,kBAAkB,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;AACnG,UAAE,IAAI,GAAG,CAAC,GAAG,CAAC,kBAAkB;UAC9B,SAAS;;AAGb,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,GAAGC,4BAAc,CAAC,IAAI,EAAEC,wBAAU,CAAC,KAAK,CAAC;QACpD,MAAM,QAAQ,GAAGD,4BAAc,CAAC,IAAI,EAAEC,wBAAU,CAAC,KAAK,CAAC;QACvD,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,SAAS,CAACC,uBAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,KAAK,EAAE;AAE1F,QAAA,MAAM,KAAK,GAAG;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;AACtB,YAAA,GAAG,SAAS;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;SACvB;AAED,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;AACrB,iBAAA,MAAM,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ;AACxC,oBAAC,kBAAkB,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/D,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;YACA,MAAM,QAAQ,GAAG;iBACd,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC;AACxB,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,CAAC,CAAC,CAAC,KACR,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;eACrC,EAAE,GAAG,CAAC,kBAAkB,IAAI,CAAC,KAAK,aAAa,CAAC;AACpD,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,IAAI,eAAe,KAAK,SAAS,IAAI,iBAAiB,CAAC,eAAe,CAAC,IAAI,kBAAkB,EAAE;AAC7F,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;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC;QAClH,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;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAE3C,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;;;;;;"}

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

@@ -1 +1 @@
-{"version":3,"file":"label.d.ts","sourceRoot":"","sources":["../../../src/render/util/label.ts"],"names":[],"mappings":"AAAA,OAAO,EAAyC,KAAK,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC1G,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI;IAChC,KAAK,EAAE,CAAC,CAAC;IACT,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,6CAA6C;IAC7C,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sHAAsH;IACtH,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,2EAA2E;IAC3E,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC/B,CAAC;AAEF,eAAO,MAAM,UAAU;;;;;;;;;;;;;;;EAKrB,CAAC;AACH,MAAM,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,CAAC;AAGpD,eAAO,MAAM,KAAK;;;;;;;;;;;;;;;WAAsB,CAAC;AACzC,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,CAAC,CAAC;AAI1C,KAAK,mBAAmB,GAAG,WAAW,GAAG;IACvC,IAAI,EAAE,WAAW,CAAC;IAClB,WAAW,CAAC,EAAE,UAAU,EAAE,CAAC;IAC3B,WAAW,CAAC,EAAE,UAAU,EAAE,CAAC;CAC5B,CAAC;AAOF,wBAAgB,YAAY,CAAC,CAAC,EAC5B,MAAM,EAAE,CAAC,EAAE,EACX,aAAa,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,mBAAmB,EAC9C,GAAG,GAAE,kBAAuB,GAC3B,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAiLvB"}
+{"version":3,"file":"label.d.ts","sourceRoot":"","sources":["../../../src/render/util/label.ts"],"names":[],"mappings":"AAAA,OAAO,EAAyC,KAAK,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC1G,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI;IAChC,KAAK,EAAE,CAAC,CAAC;IACT,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,6CAA6C;IAC7C,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sHAAsH;IACtH,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,2EAA2E;IAC3E,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC/B,CAAC;AAEF,eAAO,MAAM,UAAU;;;;;;;;;;;;;;;EAKrB,CAAC;AACH,MAAM,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,CAAC;AAGpD,eAAO,MAAM,KAAK;;;;;;;;;;;;;;;WAAsB,CAAC;AACzC,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,CAAC,CAAC;AAI1C,KAAK,mBAAmB,GAAG,WAAW,GAAG;IACvC,IAAI,EAAE,WAAW,CAAC;IAClB,WAAW,CAAC,EAAE,UAAU,EAAE,CAAC;IAC3B,WAAW,CAAC,EAAE,UAAU,EAAE,CAAC;CAC5B,CAAC;AAOF,wBAAgB,YAAY,CAAC,CAAC,EAC5B,MAAM,EAAE,CAAC,EAAE,EACX,aAAa,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,mBAAmB,EAC9C,GAAG,GAAE,kBAAuB,GAC3B,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAuLvB"}

package/dist/render/util/label.js

@@ -108,10 +108,15 @@ function deriveLabels(values, specExtractor, ops = {}) {
         }
         return result;
     };
-    // Checks if a result has all unique labels
-    const hasUniqueLabels = (result) => result !== undefined && new Set(result.map((c) => c.label)).size === values.length;
+    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])
@@ -121,7 +126,7 @@ function deriveLabels(values, specExtractor, ops = {}) {
             const reducedSet = new Set(typeSet);
             reducedSet.delete(typeToRemove);
             const candidateResult = calculate(reducedSet);
-            if (hasUniqueLabels(candidateResult)) {
+            if (candidateResult !== undefined && countUniqueLabels(candidateResult) >= currentCardinality) {
                 typeSet.delete(typeToRemove);
             }
         }
@@ -152,7 +157,7 @@ function deriveLabels(values, specExtractor, ops = {}) {
         if (additionalType >= 0)
             currentSet.add(mainTypes[additionalType]);
         const candidateResult = calculate(currentSet);
-        if (hasUniqueLabels(candidateResult)) {
+        if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {
             minimizeTypeSet(currentSet);
             return calculate(currentSet);
         }

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

@@ -1 +1 @@
-{"version":3,"file":"label.js","sources":["../../../src/render/util/label.ts"],"sourcesContent":["import { Annotation, parseJson, readAnnotation, type PObjectSpec } 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 = PObjectSpec | {\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 = (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 = [\n      ...(prefixTrace ?? []),\n      ...baseTrace,\n      ...(suffixTrace ?? []),\n    ];\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\n        .filter((fm) => includedTypes.has(fm.fullType)\n          || (forceTraceElements && forceTraceElements.has(fm.type)));\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\n        .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  // Checks if a result has all unique labels\n  const hasUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): boolean =>\n    result !== undefined && new Set(result.map((c) => c.label)).size === values.length;\n\n  // Post-processing: try removing types one by one (lowest importance first) to minimize the label set\n  const minimizeTypeSet = (typeSet: Set<string>): Set<string> => {\n    // Get types sorted by importance ascending (lowest first), excluding forced elements\n    const removableSorted = [...typeSet]\n      .filter((t) =>\n        !forceTraceElements?.has(t.split('@')[0])\n        && !(ops.includeNativeLabel && t === LabelTypeFull))\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 (hasUniqueLabels(candidateResult)) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0) 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)\n      currentSet.add(mainTypes[additionalType]);\n\n    const candidateResult = calculate(currentSet);\n\n    if (hasUniqueLabels(candidateResult)) {\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":";;;AAmBO,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;AAWvC,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,GAAG,CAAC,GAAG,CAAC,kBAAkB,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;AACnG,UAAE,IAAI,GAAG,CAAC,GAAG,CAAC,kBAAkB;UAC9B,SAAS;;AAGb,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;AAE1F,QAAA,MAAM,KAAK,GAAG;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;AACtB,YAAA,GAAG,SAAS;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;SACvB;AAED,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;AACrB,iBAAA,MAAM,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ;AACxC,oBAAC,kBAAkB,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/D,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;YACA,MAAM,QAAQ,GAAG;iBACd,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC;AACxB,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;;AAGD,IAAA,MAAM,eAAe,GAAG,CAAC,MAAyC,KAChE,MAAM,KAAK,SAAS,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM;;AAGpF,IAAA,MAAM,eAAe,GAAG,CAAC,OAAoB,KAAiB;;AAE5D,QAAA,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO;aAChC,MAAM,CAAC,CAAC,CAAC,KACR,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;eACrC,EAAE,GAAG,CAAC,kBAAkB,IAAI,CAAC,KAAK,aAAa,CAAC;AACpD,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;AAC7C,YAAA,IAAI,eAAe,CAAC,eAAe,CAAC,EAAE;AACpC,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;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC;QAClH,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;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAE3C,QAAA,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;AAE7C,QAAA,IAAI,eAAe,CAAC,eAAe,CAAC,EAAE;YACpC,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","sources":["../../../src/render/util/label.ts"],"sourcesContent":["import { Annotation, parseJson, readAnnotation, type PObjectSpec } 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 = PObjectSpec | {\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 = (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 = [\n      ...(prefixTrace ?? []),\n      ...baseTrace,\n      ...(suffixTrace ?? []),\n    ];\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\n        .filter((fm) => includedTypes.has(fm.fullType)\n          || (forceTraceElements && forceTraceElements.has(fm.type)));\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\n        .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((t) =>\n        !forceTraceElements?.has(t.split('@')[0])\n        && !(ops.includeNativeLabel && t === LabelTypeFull))\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 (candidateResult !== undefined && countUniqueLabels(candidateResult) >= currentCardinality) {\n        typeSet.delete(typeToRemove);\n      }\n    }\n    return typeSet;\n  };\n\n  if (mainTypes.length === 0) {\n    if (secondaryTypes.length !== 0) 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)\n      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":";;;AAmBO,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;AAWvC,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,GAAG,CAAC,GAAG,CAAC,kBAAkB,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;AACnG,UAAE,IAAI,GAAG,CAAC,GAAG,CAAC,kBAAkB;UAC9B,SAAS;;AAGb,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;AAE1F,QAAA,MAAM,KAAK,GAAG;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;AACtB,YAAA,GAAG,SAAS;AACZ,YAAA,IAAI,WAAW,IAAI,EAAE,CAAC;SACvB;AAED,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;AACrB,iBAAA,MAAM,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ;AACxC,oBAAC,kBAAkB,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/D,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;YACA,MAAM,QAAQ,GAAG;iBACd,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC;AACxB,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,CAAC,CAAC,CAAC,KACR,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;eACrC,EAAE,GAAG,CAAC,kBAAkB,IAAI,CAAC,KAAK,aAAa,CAAC;AACpD,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,IAAI,eAAe,KAAK,SAAS,IAAI,iBAAiB,CAAC,eAAe,CAAC,IAAI,kBAAkB,EAAE;AAC7F,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;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC;QAClH,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;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAE3C,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;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@platforma-sdk/model",
-  "version": "1.51.6",
+  "version": "1.51.9",
   "description": "Platforma.bio SDK / Block Model",
   "type": "module",
   "types": "./dist/index.d.ts",
@@ -23,8 +23,8 @@
     "canonicalize": "~2.1.0",
     "es-toolkit": "^1.39.10",
     "zod": "~3.23.8",
-    "@milaboratories/ptabler-expression-js": "1.1.9",
     "@milaboratories/pl-model-common": "1.23.0",
+    "@milaboratories/ptabler-expression-js": "1.1.9",
     "@milaboratories/pl-error-like": "1.12.5"
   },
   "devDependencies": {
@@ -32,11 +32,11 @@
     "vitest": "^4.0.16",
     "@vitest/coverage-istanbul": "^4.0.16",
     "fast-json-patch": "^3.1.1",
-    "@milaboratories/eslint-config": "1.0.5",
     "@milaboratories/build-configs": "1.2.2",
+    "@milaboratories/eslint-config": "1.0.5",
     "@milaboratories/ts-builder": "1.2.2",
-    "@milaboratories/ts-configs": "1.2.0",
-    "@milaboratories/helpers": "1.13.0"
+    "@milaboratories/helpers": "1.13.0",
+    "@milaboratories/ts-configs": "1.2.0"
   },
   "scripts": {
     "type-check": "ts-builder types --target node",

package/src/render/util/label.test.ts

@@ -170,6 +170,31 @@ test.each<{ name: string; traces: Trace[]; labels: string[] }>([
     ],
     // t1 alone distinguishes; t2 and t3 are redundant and should be removed
     labels: ['Unique1', 'Unique2']
+  },
+  {
+    name: 'fallback case: removes types that do not reduce cardinality',
+    traces: [
+      // Two columns with identical traces - cannot be distinguished
+      [
+        { type: 't1', importance: 100, label: 'A' },
+        { type: 't2', importance: 10, label: 'X' },
+        { type: 't3', importance: 1, label: 'Same' }
+      ],
+      [
+        { type: 't1', importance: 100, label: 'A' },
+        { type: 't2', importance: 10, label: 'X' },
+        { type: 't3', importance: 1, label: 'Same' }
+      ],
+      // Third column is different
+      [
+        { type: 't1', importance: 100, label: 'B' },
+        { type: 't2', importance: 10, label: 'Y' },
+        { type: 't3', importance: 1, label: 'Same' }
+      ]
+    ],
+    // Cannot achieve full uniqueness (2 columns are identical), but t3 (Same) can be removed
+    // since it doesn't help distinguish anything. t1 alone gives cardinality 2.
+    labels: ['A', 'A', 'B']
   }
 ])('test label minimization: $name', ({ traces, labels }) => {
   expect(deriveLabels(tracesToSpecs(traces), (s) => s).map((r) => r.label)).toEqual(labels);

package/src/render/util/label.ts

@@ -158,12 +158,18 @@ export function deriveLabels<T>(
     return result;
   };
 
-  // Checks if a result has all unique labels
-  const hasUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): boolean =>
-    result !== undefined && new Set(result.map((c) => c.label)).size === values.length;
+  const countUniqueLabels = (result: RecordsWithLabel<T>[] | undefined): number =>
+    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: Set<string>): Set<string> => {
+    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) =>
@@ -175,7 +181,7 @@ export function deriveLabels<T>(
       const reducedSet = new Set(typeSet);
       reducedSet.delete(typeToRemove);
       const candidateResult = calculate(reducedSet);
-      if (hasUniqueLabels(candidateResult)) {
+      if (candidateResult !== undefined && countUniqueLabels(candidateResult) >= currentCardinality) {
         typeSet.delete(typeToRemove);
       }
     }
@@ -207,7 +213,7 @@ export function deriveLabels<T>(
 
     const candidateResult = calculate(currentSet);
 
-    if (hasUniqueLabels(candidateResult)) {
+    if (candidateResult !== undefined && countUniqueLabels(candidateResult) === values.length) {
       minimizeTypeSet(currentSet);
       return calculate(currentSet)!;
     }