@platforma-sdk/model 1.42.15 → 1.42.20

package/dist/render/util/label.js

@@ -0,0 +1,149 @@
+import { readAnnotation, Annotation, parseJson } from '@milaboratories/pl-model-common';
+import { z } from 'zod';
+
+const TraceEntry = z.object({
+    type: z.string(),
+    importance: z.number().optional(),
+    id: z.string().optional(),
+    label: z.string(),
+});
+const Trace = z.array(TraceEntry);
+const DistancePenalty = 0.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;
+    };
+    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);
+        // checking if labels uniquely separate our records
+        if (candidateResult !== undefined && new Set(candidateResult.map((c) => c.label)).size === values.length)
+            return candidateResult;
+        additionalType++;
+        if (additionalType >= mainTypes.length) {
+            includedTypes++;
+            additionalType = includedTypes;
+        }
+    }
+    return calculate(new Set([...mainTypes, ...secondaryTypes]), true);
+}
+
+export { Trace, TraceEntry, deriveLabels };
+//# sourceMappingURL=label.js.map

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

@@ -0,0 +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  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    // checking if labels uniquely separate our records\n    if (candidateResult !== undefined && new Set(candidateResult.map((c) => c.label)).size === values.length) return candidateResult;\n\n    additionalType++;\n    if (additionalType >= mainTypes.length) {\n      includedTypes++;\n      additionalType = includedTypes;\n    }\n  }\n\n  return calculate(new Set([...mainTypes, ...secondaryTypes]), 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,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;;QAG7C,IAAI,eAAe,KAAK,SAAS,IAAI,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM;AAAE,YAAA,OAAO,eAAe;AAEhI,QAAA,cAAc,EAAE;AAChB,QAAA,IAAI,cAAc,IAAI,SAAS,CAAC,MAAM,EAAE;AACtC,YAAA,aAAa,EAAE;YACf,cAAc,GAAG,aAAa;QAChC;IACF;AAEA,IAAA,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,CAAE;AACrE;;;;"}

package/dist/render/util/pcolumn_data.cjs

@@ -0,0 +1,342 @@
+'use strict';
+
+var plModelCommon = require('@milaboratories/pl-model-common');
+var accessor = require('../accessor.cjs');
+
+const PCD_PREFIX = 'PColumnData/';
+const RT_RESOURCE_MAP = PCD_PREFIX + 'ResourceMap';
+const RT_RESOURCE_MAP_PARTITIONED = PCD_PREFIX + 'Partitioned/ResourceMap';
+const RT_JSON_PARTITIONED = PCD_PREFIX + 'JsonPartitioned';
+const RT_BINARY_PARTITIONED = PCD_PREFIX + 'BinaryPartitioned';
+const PCD_SUP_PREFIX = PCD_PREFIX + 'Partitioned/';
+const RT_JSON_SUPER_PARTITIONED = PCD_SUP_PREFIX + 'JsonPartitioned';
+const RT_BINARY_SUPER_PARTITIONED = PCD_SUP_PREFIX + 'BinaryPartitioned';
+function populateResourceMapData(acc, resourceParser, data, keyPrefix = [], addEntriesWithNoData) {
+    if (acc === undefined)
+        return false;
+    switch (acc.resourceType.name) {
+        case RT_RESOURCE_MAP: {
+            let isComplete = acc.getInputsLocked();
+            for (const keyStr of acc.listInputFields()) {
+                const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });
+                const key = [...keyPrefix, ...JSON.parse(keyStr)];
+                const converted = value === undefined ? undefined : resourceParser(value);
+                if (converted === undefined)
+                    isComplete = false;
+                if (converted !== undefined || addEntriesWithNoData)
+                    data.push({ key, value: converted });
+            }
+            return isComplete;
+        }
+        case RT_RESOURCE_MAP_PARTITIONED: {
+            let isComplete = acc.getInputsLocked();
+            for (const keyStr of acc.listInputFields()) {
+                const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });
+                if (value === undefined)
+                    isComplete = false;
+                else {
+                    const key = [...keyPrefix, ...JSON.parse(keyStr)];
+                    const populateResult = populateResourceMapData(value, resourceParser, data, key, addEntriesWithNoData);
+                    isComplete = isComplete && populateResult;
+                }
+            }
+            return isComplete;
+        }
+        default:
+            throw new Error(`Unknown resource type: ${acc.resourceType.name}`);
+    }
+}
+function parseResourceMap(acc, resourceParser, addEntriesWithNoData = false) {
+    const data = [];
+    const isComplete = populateResourceMapData(acc, resourceParser, data, [], addEntriesWithNoData);
+    return { isComplete, data };
+}
+const removeIndexSuffix = (keyStr) => {
+    if (keyStr.endsWith('.index')) {
+        return { baseKey: keyStr.substring(0, keyStr.length - 6), type: 'index' };
+    }
+    else if (keyStr.endsWith('.values')) {
+        return { baseKey: keyStr.substring(0, keyStr.length - 7), type: 'values' };
+    }
+    else {
+        throw new Error(`key must ends on .index/.values for binary p-column, got: ${keyStr}`);
+    }
+};
+// @TODO define a class with various resource map operations
+/** Returns a list of all partition keys appeared in the p-column */
+function getPartitionKeysList(acc) {
+    if (!acc)
+        return undefined;
+    const rt = acc.resourceType.name;
+    const meta = acc.getDataAsJson();
+    const data = [];
+    let keyLength = 0;
+    // @TODO validate meta shape
+    switch (rt) {
+        case RT_RESOURCE_MAP:
+            keyLength = meta['keyLength'];
+            break;
+        case RT_RESOURCE_MAP_PARTITIONED:
+            keyLength = meta['partitionKeyLength'] + meta['keyLength'];
+            break;
+        case RT_JSON_PARTITIONED:
+        case RT_BINARY_PARTITIONED:
+            keyLength = meta['partitionKeyLength'];
+            break;
+        case RT_BINARY_SUPER_PARTITIONED:
+        case RT_JSON_SUPER_PARTITIONED:
+            keyLength = meta['superPartitionKeyLength'] + meta['partitionKeyLength'];
+            break;
+    }
+    switch (rt) {
+        case RT_RESOURCE_MAP:
+        case RT_JSON_PARTITIONED:
+        case RT_BINARY_PARTITIONED:
+            for (let keyStr of acc.listInputFields()) {
+                if (rt === RT_BINARY_PARTITIONED) {
+                    keyStr = removeIndexSuffix(keyStr).baseKey;
+                }
+                const key = [...JSON.parse(keyStr)];
+                data.push(key);
+            }
+            break;
+        case RT_RESOURCE_MAP_PARTITIONED:
+        case RT_BINARY_SUPER_PARTITIONED:
+        case RT_JSON_SUPER_PARTITIONED:
+            for (const supKeyStr of acc.listInputFields()) {
+                const keyPrefix = [...JSON.parse(supKeyStr)];
+                const value = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });
+                if (value !== undefined) {
+                    for (let keyStr of value.listInputFields()) {
+                        if (rt === RT_BINARY_SUPER_PARTITIONED) {
+                            keyStr = removeIndexSuffix(keyStr).baseKey;
+                        }
+                        const key = [...keyPrefix, ...JSON.parse(keyStr)];
+                        data.push(key);
+                    }
+                }
+            }
+            break;
+    }
+    return { data, keyLength };
+}
+function getUniquePartitionKeysForDataEntries(list) {
+    if (list.type !== 'JsonPartitioned' && list.type !== 'BinaryPartitioned')
+        throw new Error(`Splitting requires Partitioned DataInfoEntries, got ${list.type}`);
+    const { parts, partitionKeyLength } = list;
+    const result = [];
+    for (let i = 0; i < partitionKeyLength; ++i) {
+        result.push(new Set());
+    }
+    for (const part of parts) {
+        const key = part.key;
+        if (key.length !== partitionKeyLength) {
+            throw new Error(`Key length (${key.length}) does not match partition length (${partitionKeyLength}) for key: ${JSON.stringify(key)}`);
+        }
+        for (let i = 0; i < partitionKeyLength; ++i) {
+            result[i].add(key[i]);
+        }
+    }
+    return result.map((s) => Array.from(s.values()));
+}
+function getUniquePartitionKeys(acc) {
+    if (acc === undefined)
+        return undefined;
+    if (plModelCommon.isDataInfoEntries(acc))
+        return getUniquePartitionKeysForDataEntries(acc);
+    const list = getPartitionKeysList(acc);
+    if (!list)
+        return undefined;
+    const { data, keyLength } = list;
+    const result = [];
+    for (let i = 0; i < keyLength; ++i) {
+        result.push(new Set());
+    }
+    for (const l of data) {
+        if (l.length !== keyLength) {
+            throw new Error('key length does not match partition length');
+        }
+        for (let i = 0; i < keyLength; ++i) {
+            result[i].add(l[i]);
+        }
+    }
+    return result.map((s) => Array.from(s.values()));
+}
+/**
+ * Parses the PColumn data from a TreeNodeAccessor into a DataInfoEntries structure.
+ * Returns undefined if any required data is missing.
+ * Throws error on validation failures.
+ *
+ * @param acc - The TreeNodeAccessor containing PColumn data
+ * @param keyPrefix - Optional key prefix for recursive calls
+ * @returns DataInfoEntries representation of the PColumn data, or undefined if incomplete
+ */
+function parsePColumnData(acc, keyPrefix = []) {
+    if (acc === undefined)
+        return undefined;
+    if (!acc.getIsReadyOrError())
+        return undefined;
+    const resourceType = acc.resourceType.name;
+    const meta = acc.getDataAsJson();
+    // Prevent recursive super-partitioned resources
+    if (keyPrefix.length > 0
+        && (resourceType === RT_JSON_SUPER_PARTITIONED || resourceType === RT_BINARY_SUPER_PARTITIONED)) {
+        throw new Error(`Unexpected nested super-partitioned resource: ${resourceType}`);
+    }
+    switch (resourceType) {
+        case RT_RESOURCE_MAP:
+        case RT_RESOURCE_MAP_PARTITIONED:
+            throw new Error(`Only data columns are supported, got: ${resourceType}`);
+        case RT_JSON_PARTITIONED: {
+            if (typeof meta?.partitionKeyLength !== 'number') {
+                throw new Error(`Missing partitionKeyLength in metadata for ${resourceType}`);
+            }
+            const parts = [];
+            for (const keyStr of acc.listInputFields()) {
+                const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });
+                if (value === undefined)
+                    return undefined;
+                const key = [...keyPrefix, ...JSON.parse(keyStr)];
+                parts.push({ key, value });
+            }
+            return {
+                type: 'JsonPartitioned',
+                partitionKeyLength: meta.partitionKeyLength,
+                parts,
+            };
+        }
+        case RT_BINARY_PARTITIONED: {
+            if (typeof meta?.partitionKeyLength !== 'number') {
+                throw new Error(`Missing partitionKeyLength in metadata for ${resourceType}`);
+            }
+            const parts = [];
+            const baseKeys = new Map();
+            // Group fields by base key (without .index/.values suffix)
+            for (const keyStr of acc.listInputFields()) {
+                const suffix = removeIndexSuffix(keyStr);
+                const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });
+                if (value === undefined)
+                    return undefined;
+                let entry = baseKeys.get(suffix.baseKey);
+                if (!entry) {
+                    entry = {};
+                    baseKeys.set(suffix.baseKey, entry);
+                }
+                if (suffix.type === 'index') {
+                    entry.index = value;
+                }
+                else {
+                    entry.values = value;
+                }
+            }
+            // Process complete binary chunks only
+            for (const [baseKeyStr, entry] of baseKeys.entries()) {
+                if (!entry.index || !entry.values)
+                    return undefined;
+                const key = [...keyPrefix, ...JSON.parse(baseKeyStr)];
+                parts.push({
+                    key,
+                    value: {
+                        index: entry.index,
+                        values: entry.values,
+                    },
+                });
+            }
+            return {
+                type: 'BinaryPartitioned',
+                partitionKeyLength: meta.partitionKeyLength,
+                parts,
+            };
+        }
+        case RT_JSON_SUPER_PARTITIONED: {
+            if (typeof meta?.superPartitionKeyLength !== 'number'
+                || typeof meta?.partitionKeyLength !== 'number') {
+                throw new Error(`Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`);
+            }
+            const totalKeyLength = meta.superPartitionKeyLength + meta.partitionKeyLength;
+            const parts = [];
+            // Process all super partitions
+            for (const supKeyStr of acc.listInputFields()) {
+                const superPartition = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });
+                if (superPartition === undefined)
+                    return undefined;
+                // Validate inner type
+                if (superPartition.resourceType.name !== RT_JSON_PARTITIONED) {
+                    throw new Error(`Expected ${RT_JSON_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`);
+                }
+                const innerResult = parsePColumnData(superPartition, JSON.parse(supKeyStr));
+                if (innerResult === undefined)
+                    return undefined;
+                if (innerResult.type !== 'JsonPartitioned')
+                    throw new Error(`Unexpected inner result type for ${resourceType}: ${innerResult.type}`);
+                parts.push(...innerResult.parts);
+            }
+            return {
+                type: 'JsonPartitioned',
+                partitionKeyLength: totalKeyLength,
+                parts,
+            };
+        }
+        case RT_BINARY_SUPER_PARTITIONED: {
+            if (typeof meta?.superPartitionKeyLength !== 'number'
+                || typeof meta?.partitionKeyLength !== 'number') {
+                throw new Error(`Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`);
+            }
+            const totalKeyLength = meta.superPartitionKeyLength + meta.partitionKeyLength;
+            const parts = [];
+            // Process all super partitions
+            for (const supKeyStr of acc.listInputFields()) {
+                const superPartition = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });
+                if (superPartition === undefined)
+                    return undefined;
+                // Validate inner type
+                if (superPartition.resourceType.name !== RT_BINARY_PARTITIONED) {
+                    throw new Error(`Expected ${RT_BINARY_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`);
+                }
+                const innerResult = parsePColumnData(superPartition, JSON.parse(supKeyStr));
+                if (innerResult === undefined)
+                    return undefined;
+                if (innerResult.type !== 'BinaryPartitioned')
+                    throw new Error(`Unexpected inner result type for ${resourceType}: ${innerResult.type}`);
+                parts.push(...innerResult.parts);
+            }
+            return {
+                type: 'BinaryPartitioned',
+                partitionKeyLength: totalKeyLength,
+                parts,
+            };
+        }
+        default:
+            throw new Error(`Unknown resource type: ${resourceType}`);
+    }
+}
+/**
+ * Converts or parses the input into DataInfoEntries format.
+
+ * @param acc - The input data, which can be TreeNodeAccessor, DataInfoEntries, DataInfo, or undefined.
+ * @returns The data in DataInfoEntries format, or undefined if the input was undefined or data is not ready.
+ */
+function convertOrParsePColumnData(acc) {
+    if (acc === undefined)
+        return undefined;
+    if (plModelCommon.isDataInfoEntries(acc))
+        return acc;
+    if (plModelCommon.isDataInfo(acc))
+        return plModelCommon.dataInfoToEntries(acc);
+    if (acc instanceof accessor.TreeNodeAccessor)
+        return parsePColumnData(acc);
+    throw new Error(`Unexpected input type: ${typeof acc}`);
+}
+
+exports.RT_BINARY_PARTITIONED = RT_BINARY_PARTITIONED;
+exports.RT_BINARY_SUPER_PARTITIONED = RT_BINARY_SUPER_PARTITIONED;
+exports.RT_JSON_PARTITIONED = RT_JSON_PARTITIONED;
+exports.RT_JSON_SUPER_PARTITIONED = RT_JSON_SUPER_PARTITIONED;
+exports.RT_RESOURCE_MAP = RT_RESOURCE_MAP;
+exports.RT_RESOURCE_MAP_PARTITIONED = RT_RESOURCE_MAP_PARTITIONED;
+exports.convertOrParsePColumnData = convertOrParsePColumnData;
+exports.getPartitionKeysList = getPartitionKeysList;
+exports.getUniquePartitionKeys = getUniquePartitionKeys;
+exports.parsePColumnData = parsePColumnData;
+exports.parseResourceMap = parseResourceMap;
+//# sourceMappingURL=pcolumn_data.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pcolumn_data.cjs","sources":["../../../src/render/util/pcolumn_data.ts"],"sourcesContent":["import type {\n  DataInfo } from '@milaboratories/pl-model-common';\nimport {\n  dataInfoToEntries,\n  isDataInfo,\n  isDataInfoEntries,\n  type BinaryChunk,\n  type BinaryPartitionedDataInfoEntries,\n  type DataInfoEntries,\n  type JsonPartitionedDataInfoEntries,\n  type PColumnDataEntry,\n  type PColumnKey,\n} from '@milaboratories/pl-model-common';\nimport { TreeNodeAccessor } from '../accessor';\n\nconst PCD_PREFIX = 'PColumnData/';\n\nexport const RT_RESOURCE_MAP = PCD_PREFIX + 'ResourceMap';\nexport const RT_RESOURCE_MAP_PARTITIONED = PCD_PREFIX + 'Partitioned/ResourceMap';\n\nexport const RT_JSON_PARTITIONED = PCD_PREFIX + 'JsonPartitioned';\nexport const RT_BINARY_PARTITIONED = PCD_PREFIX + 'BinaryPartitioned';\n\nconst PCD_SUP_PREFIX = PCD_PREFIX + 'Partitioned/';\nexport const RT_JSON_SUPER_PARTITIONED = PCD_SUP_PREFIX + 'JsonPartitioned';\nexport const RT_BINARY_SUPER_PARTITIONED = PCD_SUP_PREFIX + 'BinaryPartitioned';\n\nexport type PColumnResourceMapEntry<T> = {\n  key: PColumnKey;\n  value: T;\n};\n\nexport type PColumnResourceMapData<T> = {\n  isComplete: boolean;\n  data: PColumnResourceMapEntry<T>[];\n};\n\nfunction populateResourceMapData<T>(\n  acc: TreeNodeAccessor | undefined,\n  resourceParser: (acc: TreeNodeAccessor) => T | undefined,\n  data: PColumnResourceMapEntry<T | undefined>[],\n  keyPrefix: PColumnKey = [],\n  addEntriesWithNoData: boolean,\n): boolean {\n  if (acc === undefined) return false;\n  switch (acc.resourceType.name) {\n    case RT_RESOURCE_MAP: {\n      let isComplete = acc.getInputsLocked();\n      for (const keyStr of acc.listInputFields()) {\n        const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });\n        const key = [...keyPrefix, ...JSON.parse(keyStr)] as PColumnKey;\n        const converted = value === undefined ? undefined : resourceParser(value);\n        if (converted === undefined) isComplete = false;\n        if (converted !== undefined || addEntriesWithNoData) data.push({ key, value: converted });\n      }\n      return isComplete;\n    }\n    case RT_RESOURCE_MAP_PARTITIONED: {\n      let isComplete = acc.getInputsLocked();\n      for (const keyStr of acc.listInputFields()) {\n        const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });\n        if (value === undefined) isComplete = false;\n        else {\n          const key = [...keyPrefix, ...JSON.parse(keyStr)] as PColumnKey;\n          const populateResult = populateResourceMapData(\n            value,\n            resourceParser,\n            data,\n            key,\n            addEntriesWithNoData,\n          );\n          isComplete = isComplete && populateResult;\n        }\n      }\n      return isComplete;\n    }\n    default:\n      throw new Error(`Unknown resource type: ${acc.resourceType.name}`);\n  }\n}\n\nexport function parseResourceMap<T>(\n  acc: TreeNodeAccessor | undefined,\n  resourceParser: (acc: TreeNodeAccessor) => T | undefined,\n  addEntriesWithNoData: false\n): PColumnResourceMapData<NonNullable<T>>;\nexport function parseResourceMap<T>(\n  acc: TreeNodeAccessor | undefined,\n  resourceParser: (acc: TreeNodeAccessor) => T | undefined,\n  addEntriesWithNoData: true\n): PColumnResourceMapData<T | undefined>;\nexport function parseResourceMap<T>(\n  acc: TreeNodeAccessor | undefined,\n  resourceParser: (acc: TreeNodeAccessor) => T | undefined,\n  addEntriesWithNoData: boolean = false,\n): PColumnResourceMapData<T | undefined> {\n  const data: PColumnResourceMapEntry<T | undefined>[] = [];\n  const isComplete = populateResourceMapData(acc, resourceParser, data, [], addEntriesWithNoData);\n  return { isComplete, data };\n}\n\nexport type PColumnKeyList = {\n  /** array of keys */\n  data: PColumnKey[];\n  /** length of partition key */\n  keyLength: number;\n};\n\nconst removeIndexSuffix = (keyStr: string): { baseKey: string; type: 'index' | 'values' } => {\n  if (keyStr.endsWith('.index')) {\n    return { baseKey: keyStr.substring(0, keyStr.length - 6), type: 'index' };\n  } else if (keyStr.endsWith('.values')) {\n    return { baseKey: keyStr.substring(0, keyStr.length - 7), type: 'values' };\n  } else {\n    throw new Error(`key must ends on .index/.values for binary p-column, got: ${keyStr}`);\n  }\n};\n\n// @TODO define a class with various resource map operations\n/** Returns a list of all partition keys appeared in the p-column */\nexport function getPartitionKeysList(\n  acc: TreeNodeAccessor | undefined,\n): PColumnKeyList | undefined {\n  if (!acc) return undefined;\n\n  const rt = acc.resourceType.name;\n  const meta = acc.getDataAsJson<Record<string, number>>();\n  const data: PColumnKey[] = [];\n\n  let keyLength = 0;\n  // @TODO validate meta shape\n  switch (rt) {\n    case RT_RESOURCE_MAP:\n      keyLength = meta['keyLength'];\n      break;\n\n    case RT_RESOURCE_MAP_PARTITIONED:\n      keyLength = meta['partitionKeyLength'] + meta['keyLength'];\n      break;\n\n    case RT_JSON_PARTITIONED:\n    case RT_BINARY_PARTITIONED:\n      keyLength = meta['partitionKeyLength'];\n      break;\n\n    case RT_BINARY_SUPER_PARTITIONED:\n    case RT_JSON_SUPER_PARTITIONED:\n      keyLength = meta['superPartitionKeyLength'] + meta['partitionKeyLength'];\n      break;\n  }\n\n  switch (rt) {\n    case RT_RESOURCE_MAP:\n    case RT_JSON_PARTITIONED:\n    case RT_BINARY_PARTITIONED:\n      for (let keyStr of acc.listInputFields()) {\n        if (rt === RT_BINARY_PARTITIONED) {\n          keyStr = removeIndexSuffix(keyStr).baseKey;\n        }\n        const key = [...JSON.parse(keyStr)] as PColumnKey;\n        data.push(key);\n      }\n\n      break;\n\n    case RT_RESOURCE_MAP_PARTITIONED:\n    case RT_BINARY_SUPER_PARTITIONED:\n    case RT_JSON_SUPER_PARTITIONED:\n      for (const supKeyStr of acc.listInputFields()) {\n        const keyPrefix = [...JSON.parse(supKeyStr)] as PColumnKey;\n\n        const value = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });\n        if (value !== undefined) {\n          for (let keyStr of value.listInputFields()) {\n            if (rt === RT_BINARY_SUPER_PARTITIONED) {\n              keyStr = removeIndexSuffix(keyStr).baseKey;\n            }\n            const key = [...keyPrefix, ...JSON.parse(keyStr)] as PColumnKey;\n            data.push(key);\n          }\n        }\n      }\n      break;\n  }\n\n  return { data, keyLength };\n}\n\nfunction getUniquePartitionKeysForDataEntries(list: DataInfoEntries<unknown>): (string | number)[][] {\n  if (list.type !== 'JsonPartitioned' && list.type !== 'BinaryPartitioned')\n    throw new Error(`Splitting requires Partitioned DataInfoEntries, got ${list.type}`);\n\n  const { parts, partitionKeyLength } = list;\n\n  const result: Set<string | number>[] = [];\n  for (let i = 0; i < partitionKeyLength; ++i) {\n    result.push(new Set());\n  }\n\n  for (const part of parts) {\n    const key = part.key;\n    if (key.length !== partitionKeyLength) {\n      throw new Error(\n        `Key length (${key.length}) does not match partition length (${partitionKeyLength}) for key: ${JSON.stringify(\n          key,\n        )}`,\n      );\n    }\n    for (let i = 0; i < partitionKeyLength; ++i) {\n      result[i].add(key[i]);\n    }\n  }\n\n  return result.map((s) => Array.from(s.values()));\n}\n\n/** Returns an array of unique partition keys for each column: the i-th element in the resulting 2d array contains all unique values of i-th partition axis. */\nexport function getUniquePartitionKeys(acc: DataInfoEntries<unknown>): (string | number)[][];\nexport function getUniquePartitionKeys(acc: DataInfoEntries<unknown> | TreeNodeAccessor | undefined): (string | number)[][] | undefined;\nexport function getUniquePartitionKeys(\n  acc: TreeNodeAccessor | DataInfoEntries<unknown> | undefined,\n): (string | number)[][] | undefined {\n  if (acc === undefined) return undefined;\n\n  if (isDataInfoEntries(acc))\n    return getUniquePartitionKeysForDataEntries(acc);\n\n  const list = getPartitionKeysList(acc);\n  if (!list) return undefined;\n\n  const { data, keyLength } = list;\n\n  const result: Set<string | number>[] = [];\n\n  for (let i = 0; i < keyLength; ++i) {\n    result.push(new Set());\n  }\n\n  for (const l of data) {\n    if (l.length !== keyLength) {\n      throw new Error('key length does not match partition length');\n    }\n    for (let i = 0; i < keyLength; ++i) {\n      result[i].add(l[i]);\n    }\n  }\n\n  return result.map((s) => Array.from(s.values()));\n}\n\n/**\n * Parses the PColumn data from a TreeNodeAccessor into a DataInfoEntries structure.\n * Returns undefined if any required data is missing.\n * Throws error on validation failures.\n *\n * @param acc - The TreeNodeAccessor containing PColumn data\n * @param keyPrefix - Optional key prefix for recursive calls\n * @returns DataInfoEntries representation of the PColumn data, or undefined if incomplete\n */\nexport function parsePColumnData(\n  acc: TreeNodeAccessor | undefined,\n  keyPrefix: PColumnKey = [],\n): JsonPartitionedDataInfoEntries<TreeNodeAccessor> | BinaryPartitionedDataInfoEntries<TreeNodeAccessor> | undefined {\n  if (acc === undefined) return undefined;\n\n  if (!acc.getIsReadyOrError()) return undefined;\n\n  const resourceType = acc.resourceType.name;\n  const meta = acc.getDataAsJson<Record<string, number>>();\n\n  // Prevent recursive super-partitioned resources\n  if (keyPrefix.length > 0\n    && (resourceType === RT_JSON_SUPER_PARTITIONED || resourceType === RT_BINARY_SUPER_PARTITIONED)) {\n    throw new Error(`Unexpected nested super-partitioned resource: ${resourceType}`);\n  }\n\n  switch (resourceType) {\n    case RT_RESOURCE_MAP:\n    case RT_RESOURCE_MAP_PARTITIONED:\n      throw new Error(`Only data columns are supported, got: ${resourceType}`);\n\n    case RT_JSON_PARTITIONED: {\n      if (typeof meta?.partitionKeyLength !== 'number') {\n        throw new Error(`Missing partitionKeyLength in metadata for ${resourceType}`);\n      }\n\n      const parts: PColumnDataEntry<TreeNodeAccessor>[] = [];\n      for (const keyStr of acc.listInputFields()) {\n        const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });\n        if (value === undefined) return undefined;\n\n        const key = [...keyPrefix, ...JSON.parse(keyStr)];\n        parts.push({ key, value });\n      }\n\n      return {\n        type: 'JsonPartitioned',\n        partitionKeyLength: meta.partitionKeyLength,\n        parts,\n      };\n    }\n\n    case RT_BINARY_PARTITIONED: {\n      if (typeof meta?.partitionKeyLength !== 'number') {\n        throw new Error(`Missing partitionKeyLength in metadata for ${resourceType}`);\n      }\n\n      const parts: PColumnDataEntry<BinaryChunk<TreeNodeAccessor>>[] = [];\n      const baseKeys = new Map<string, { index?: TreeNodeAccessor; values?: TreeNodeAccessor }>();\n\n      // Group fields by base key (without .index/.values suffix)\n      for (const keyStr of acc.listInputFields()) {\n        const suffix = removeIndexSuffix(keyStr);\n\n        const value = acc.resolve({ field: keyStr, assertFieldType: 'Input' });\n        if (value === undefined) return undefined;\n\n        let entry = baseKeys.get(suffix.baseKey);\n        if (!entry) {\n          entry = {};\n          baseKeys.set(suffix.baseKey, entry);\n        }\n\n        if (suffix.type === 'index') {\n          entry.index = value;\n        } else {\n          entry.values = value;\n        }\n      }\n\n      // Process complete binary chunks only\n      for (const [baseKeyStr, entry] of baseKeys.entries()) {\n        if (!entry.index || !entry.values) return undefined;\n\n        const key = [...keyPrefix, ...JSON.parse(baseKeyStr)];\n        parts.push({\n          key,\n          value: {\n            index: entry.index,\n            values: entry.values,\n          },\n        });\n      }\n\n      return {\n        type: 'BinaryPartitioned',\n        partitionKeyLength: meta.partitionKeyLength,\n        parts,\n      };\n    }\n\n    case RT_JSON_SUPER_PARTITIONED: {\n      if (typeof meta?.superPartitionKeyLength !== 'number'\n        || typeof meta?.partitionKeyLength !== 'number') {\n        throw new Error(`Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`);\n      }\n\n      const totalKeyLength = meta.superPartitionKeyLength + meta.partitionKeyLength;\n      const parts: PColumnDataEntry<TreeNodeAccessor>[] = [];\n\n      // Process all super partitions\n      for (const supKeyStr of acc.listInputFields()) {\n        const superPartition = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });\n        if (superPartition === undefined) return undefined;\n\n        // Validate inner type\n        if (superPartition.resourceType.name !== RT_JSON_PARTITIONED) {\n          throw new Error(`Expected ${RT_JSON_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`);\n        }\n\n        const innerResult = parsePColumnData(superPartition, JSON.parse(supKeyStr) as PColumnKey);\n\n        if (innerResult === undefined) return undefined;\n\n        if (innerResult.type !== 'JsonPartitioned')\n          throw new Error(`Unexpected inner result type for ${resourceType}: ${innerResult.type}`);\n\n        parts.push(...innerResult.parts);\n      }\n\n      return {\n        type: 'JsonPartitioned',\n        partitionKeyLength: totalKeyLength,\n        parts,\n      };\n    }\n\n    case RT_BINARY_SUPER_PARTITIONED: {\n      if (typeof meta?.superPartitionKeyLength !== 'number'\n        || typeof meta?.partitionKeyLength !== 'number') {\n        throw new Error(`Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`);\n      }\n\n      const totalKeyLength = meta.superPartitionKeyLength + meta.partitionKeyLength;\n      const parts: PColumnDataEntry<BinaryChunk<TreeNodeAccessor>>[] = [];\n\n      // Process all super partitions\n      for (const supKeyStr of acc.listInputFields()) {\n        const superPartition = acc.resolve({ field: supKeyStr, assertFieldType: 'Input' });\n        if (superPartition === undefined) return undefined;\n\n        // Validate inner type\n        if (superPartition.resourceType.name !== RT_BINARY_PARTITIONED) {\n          throw new Error(`Expected ${RT_BINARY_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`);\n        }\n\n        const innerResult = parsePColumnData(superPartition, JSON.parse(supKeyStr) as PColumnKey);\n\n        if (innerResult === undefined) return undefined;\n\n        if (innerResult.type !== 'BinaryPartitioned')\n          throw new Error(`Unexpected inner result type for ${resourceType}: ${innerResult.type}`);\n\n        parts.push(...innerResult.parts);\n      }\n\n      return {\n        type: 'BinaryPartitioned',\n        partitionKeyLength: totalKeyLength,\n        parts,\n      };\n    }\n\n    default:\n      throw new Error(`Unknown resource type: ${resourceType}`);\n  }\n}\n\n/**\n * Converts or parses the input into DataInfoEntries format.\n\n * @param acc - The input data, which can be TreeNodeAccessor, DataInfoEntries, DataInfo, or undefined.\n * @returns The data in DataInfoEntries format, or undefined if the input was undefined or data is not ready.\n */\nexport function convertOrParsePColumnData(acc: TreeNodeAccessor | DataInfoEntries<TreeNodeAccessor> | DataInfo<TreeNodeAccessor> | undefined):\nDataInfoEntries<TreeNodeAccessor> | undefined {\n  if (acc === undefined) return undefined;\n\n  if (isDataInfoEntries(acc)) return acc;\n  if (isDataInfo(acc)) return dataInfoToEntries(acc);\n  if (acc instanceof TreeNodeAccessor) return parsePColumnData(acc);\n\n  throw new Error(`Unexpected input type: ${typeof acc}`);\n}\n"],"names":["isDataInfoEntries","isDataInfo","dataInfoToEntries","TreeNodeAccessor"],"mappings":";;;;;AAeA,MAAM,UAAU,GAAG,cAAc;AAE1B,MAAM,eAAe,GAAG,UAAU,GAAG;AACrC,MAAM,2BAA2B,GAAG,UAAU,GAAG;AAEjD,MAAM,mBAAmB,GAAG,UAAU,GAAG;AACzC,MAAM,qBAAqB,GAAG,UAAU,GAAG;AAElD,MAAM,cAAc,GAAG,UAAU,GAAG,cAAc;AAC3C,MAAM,yBAAyB,GAAG,cAAc,GAAG;AACnD,MAAM,2BAA2B,GAAG,cAAc,GAAG;AAY5D,SAAS,uBAAuB,CAC9B,GAAiC,EACjC,cAAwD,EACxD,IAA8C,EAC9C,SAAA,GAAwB,EAAE,EAC1B,oBAA6B,EAAA;IAE7B,IAAI,GAAG,KAAK,SAAS;AAAE,QAAA,OAAO,KAAK;AACnC,IAAA,QAAQ,GAAG,CAAC,YAAY,CAAC,IAAI;QAC3B,KAAK,eAAe,EAAE;AACpB,YAAA,IAAI,UAAU,GAAG,GAAG,CAAC,eAAe,EAAE;YACtC,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC1C,gBAAA,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;AACtE,gBAAA,MAAM,GAAG,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAe;AAC/D,gBAAA,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC;gBACzE,IAAI,SAAS,KAAK,SAAS;oBAAE,UAAU,GAAG,KAAK;AAC/C,gBAAA,IAAI,SAAS,KAAK,SAAS,IAAI,oBAAoB;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YAC3F;AACA,YAAA,OAAO,UAAU;QACnB;QACA,KAAK,2BAA2B,EAAE;AAChC,YAAA,IAAI,UAAU,GAAG,GAAG,CAAC,eAAe,EAAE;YACtC,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC1C,gBAAA,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;gBACtE,IAAI,KAAK,KAAK,SAAS;oBAAE,UAAU,GAAG,KAAK;qBACtC;AACH,oBAAA,MAAM,GAAG,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAe;AAC/D,oBAAA,MAAM,cAAc,GAAG,uBAAuB,CAC5C,KAAK,EACL,cAAc,EACd,IAAI,EACJ,GAAG,EACH,oBAAoB,CACrB;AACD,oBAAA,UAAU,GAAG,UAAU,IAAI,cAAc;gBAC3C;YACF;AACA,YAAA,OAAO,UAAU;QACnB;AACA,QAAA;YACE,MAAM,IAAI,KAAK,CAAC,CAAA,uBAAA,EAA0B,GAAG,CAAC,YAAY,CAAC,IAAI,CAAA,CAAE,CAAC;;AAExE;AAYM,SAAU,gBAAgB,CAC9B,GAAiC,EACjC,cAAwD,EACxD,uBAAgC,KAAK,EAAA;IAErC,MAAM,IAAI,GAA6C,EAAE;AACzD,IAAA,MAAM,UAAU,GAAG,uBAAuB,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,EAAE,EAAE,oBAAoB,CAAC;AAC/F,IAAA,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE;AAC7B;AASA,MAAM,iBAAiB,GAAG,CAAC,MAAc,KAAmD;AAC1F,IAAA,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;QAC7B,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE;IAC3E;AAAO,SAAA,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;QACrC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE;IAC5E;SAAO;AACL,QAAA,MAAM,IAAI,KAAK,CAAC,6DAA6D,MAAM,CAAA,CAAE,CAAC;IACxF;AACF,CAAC;AAED;AACA;AACM,SAAU,oBAAoB,CAClC,GAAiC,EAAA;AAEjC,IAAA,IAAI,CAAC,GAAG;AAAE,QAAA,OAAO,SAAS;AAE1B,IAAA,MAAM,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI;AAChC,IAAA,MAAM,IAAI,GAAG,GAAG,CAAC,aAAa,EAA0B;IACxD,MAAM,IAAI,GAAiB,EAAE;IAE7B,IAAI,SAAS,GAAG,CAAC;;IAEjB,QAAQ,EAAE;AACR,QAAA,KAAK,eAAe;AAClB,YAAA,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC;YAC7B;AAEF,QAAA,KAAK,2BAA2B;YAC9B,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YAC1D;AAEF,QAAA,KAAK,mBAAmB;AACxB,QAAA,KAAK,qBAAqB;AACxB,YAAA,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC;YACtC;AAEF,QAAA,KAAK,2BAA2B;AAChC,QAAA,KAAK,yBAAyB;YAC5B,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;YACxE;;IAGJ,QAAQ,EAAE;AACR,QAAA,KAAK,eAAe;AACpB,QAAA,KAAK,mBAAmB;AACxB,QAAA,KAAK,qBAAqB;YACxB,KAAK,IAAI,MAAM,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AACxC,gBAAA,IAAI,EAAE,KAAK,qBAAqB,EAAE;AAChC,oBAAA,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,OAAO;gBAC5C;gBACA,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAe;AACjD,gBAAA,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAChB;YAEA;AAEF,QAAA,KAAK,2BAA2B;AAChC,QAAA,KAAK,2BAA2B;AAChC,QAAA,KAAK,yBAAyB;YAC5B,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;gBAC7C,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAe;AAE1D,gBAAA,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;AACzE,gBAAA,IAAI,KAAK,KAAK,SAAS,EAAE;oBACvB,KAAK,IAAI,MAAM,IAAI,KAAK,CAAC,eAAe,EAAE,EAAE;AAC1C,wBAAA,IAAI,EAAE,KAAK,2BAA2B,EAAE;AACtC,4BAAA,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,OAAO;wBAC5C;AACA,wBAAA,MAAM,GAAG,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAe;AAC/D,wBAAA,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;oBAChB;gBACF;YACF;YACA;;AAGJ,IAAA,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE;AAC5B;AAEA,SAAS,oCAAoC,CAAC,IAA8B,EAAA;IAC1E,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB;QACtE,MAAM,IAAI,KAAK,CAAC,CAAA,oDAAA,EAAuD,IAAI,CAAC,IAAI,CAAA,CAAE,CAAC;AAErF,IAAA,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,GAAG,IAAI;IAE1C,MAAM,MAAM,GAA2B,EAAE;AACzC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,EAAE,CAAC,EAAE;AAC3C,QAAA,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACxB;AAEA,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG;AACpB,QAAA,IAAI,GAAG,CAAC,MAAM,KAAK,kBAAkB,EAAE;AACrC,YAAA,MAAM,IAAI,KAAK,CACb,eAAe,GAAG,CAAC,MAAM,CAAA,mCAAA,EAAsC,kBAAkB,CAAA,WAAA,EAAc,IAAI,CAAC,SAAS,CAC3G,GAAG,CACJ,CAAA,CAAE,CACJ;QACH;AACA,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,EAAE,CAAC,EAAE;YAC3C,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB;IACF;AAEA,IAAA,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;AAClD;AAKM,SAAU,sBAAsB,CACpC,GAA4D,EAAA;IAE5D,IAAI,GAAG,KAAK,SAAS;AAAE,QAAA,OAAO,SAAS;IAEvC,IAAIA,+BAAiB,CAAC,GAAG,CAAC;AACxB,QAAA,OAAO,oCAAoC,CAAC,GAAG,CAAC;AAElD,IAAA,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC;AACtC,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,SAAS;AAE3B,IAAA,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI;IAEhC,MAAM,MAAM,GAA2B,EAAE;AAEzC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,EAAE,CAAC,EAAE;AAClC,QAAA,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACxB;AAEA,IAAA,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;AACpB,QAAA,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE;AAC1B,YAAA,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC;QAC/D;AACA,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,EAAE,CAAC,EAAE;YAClC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB;IACF;AAEA,IAAA,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;AAClD;AAEA;;;;;;;;AAQG;SACa,gBAAgB,CAC9B,GAAiC,EACjC,YAAwB,EAAE,EAAA;IAE1B,IAAI,GAAG,KAAK,SAAS;AAAE,QAAA,OAAO,SAAS;AAEvC,IAAA,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE;AAAE,QAAA,OAAO,SAAS;AAE9C,IAAA,MAAM,YAAY,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI;AAC1C,IAAA,MAAM,IAAI,GAAG,GAAG,CAAC,aAAa,EAA0B;;AAGxD,IAAA,IAAI,SAAS,CAAC,MAAM,GAAG;YACjB,YAAY,KAAK,yBAAyB,IAAI,YAAY,KAAK,2BAA2B,CAAC,EAAE;AACjG,QAAA,MAAM,IAAI,KAAK,CAAC,iDAAiD,YAAY,CAAA,CAAE,CAAC;IAClF;IAEA,QAAQ,YAAY;AAClB,QAAA,KAAK,eAAe;AACpB,QAAA,KAAK,2BAA2B;AAC9B,YAAA,MAAM,IAAI,KAAK,CAAC,yCAAyC,YAAY,CAAA,CAAE,CAAC;QAE1E,KAAK,mBAAmB,EAAE;AACxB,YAAA,IAAI,OAAO,IAAI,EAAE,kBAAkB,KAAK,QAAQ,EAAE;AAChD,gBAAA,MAAM,IAAI,KAAK,CAAC,8CAA8C,YAAY,CAAA,CAAE,CAAC;YAC/E;YAEA,MAAM,KAAK,GAAyC,EAAE;YACtD,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC1C,gBAAA,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;gBACtE,IAAI,KAAK,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;AAEzC,gBAAA,MAAM,GAAG,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;YAC5B;YAEA,OAAO;AACL,gBAAA,IAAI,EAAE,iBAAiB;gBACvB,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;gBAC3C,KAAK;aACN;QACH;QAEA,KAAK,qBAAqB,EAAE;AAC1B,YAAA,IAAI,OAAO,IAAI,EAAE,kBAAkB,KAAK,QAAQ,EAAE;AAChD,gBAAA,MAAM,IAAI,KAAK,CAAC,8CAA8C,YAAY,CAAA,CAAE,CAAC;YAC/E;YAEA,MAAM,KAAK,GAAsD,EAAE;AACnE,YAAA,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmE;;YAG3F,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC1C,gBAAA,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC;AAExC,gBAAA,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;gBACtE,IAAI,KAAK,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;gBAEzC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC;gBACxC,IAAI,CAAC,KAAK,EAAE;oBACV,KAAK,GAAG,EAAE;oBACV,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC;gBACrC;AAEA,gBAAA,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,oBAAA,KAAK,CAAC,KAAK,GAAG,KAAK;gBACrB;qBAAO;AACL,oBAAA,KAAK,CAAC,MAAM,GAAG,KAAK;gBACtB;YACF;;AAGA,YAAA,KAAK,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE;gBACpD,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM;AAAE,oBAAA,OAAO,SAAS;AAEnD,gBAAA,MAAM,GAAG,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC;oBACT,GAAG;AACH,oBAAA,KAAK,EAAE;wBACL,KAAK,EAAE,KAAK,CAAC,KAAK;wBAClB,MAAM,EAAE,KAAK,CAAC,MAAM;AACrB,qBAAA;AACF,iBAAA,CAAC;YACJ;YAEA,OAAO;AACL,gBAAA,IAAI,EAAE,mBAAmB;gBACzB,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;gBAC3C,KAAK;aACN;QACH;QAEA,KAAK,yBAAyB,EAAE;AAC9B,YAAA,IAAI,OAAO,IAAI,EAAE,uBAAuB,KAAK;AACxC,mBAAA,OAAO,IAAI,EAAE,kBAAkB,KAAK,QAAQ,EAAE;AACjD,gBAAA,MAAM,IAAI,KAAK,CAAC,yEAAyE,YAAY,CAAA,CAAE,CAAC;YAC1G;YAEA,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,kBAAkB;YAC7E,MAAM,KAAK,GAAyC,EAAE;;YAGtD,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC7C,gBAAA,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;gBAClF,IAAI,cAAc,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;;gBAGlD,IAAI,cAAc,CAAC,YAAY,CAAC,IAAI,KAAK,mBAAmB,EAAE;AAC5D,oBAAA,MAAM,IAAI,KAAK,CAAC,CAAA,SAAA,EAAY,mBAAmB,CAAA,QAAA,EAAW,YAAY,CAAA,UAAA,EAAa,cAAc,CAAC,YAAY,CAAC,IAAI,CAAA,CAAE,CAAC;gBACxH;AAEA,gBAAA,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAe,CAAC;gBAEzF,IAAI,WAAW,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;AAE/C,gBAAA,IAAI,WAAW,CAAC,IAAI,KAAK,iBAAiB;oBACxC,MAAM,IAAI,KAAK,CAAC,CAAA,iCAAA,EAAoC,YAAY,CAAA,EAAA,EAAK,WAAW,CAAC,IAAI,CAAA,CAAE,CAAC;gBAE1F,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC;YAClC;YAEA,OAAO;AACL,gBAAA,IAAI,EAAE,iBAAiB;AACvB,gBAAA,kBAAkB,EAAE,cAAc;gBAClC,KAAK;aACN;QACH;QAEA,KAAK,2BAA2B,EAAE;AAChC,YAAA,IAAI,OAAO,IAAI,EAAE,uBAAuB,KAAK;AACxC,mBAAA,OAAO,IAAI,EAAE,kBAAkB,KAAK,QAAQ,EAAE;AACjD,gBAAA,MAAM,IAAI,KAAK,CAAC,yEAAyE,YAAY,CAAA,CAAE,CAAC;YAC1G;YAEA,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,kBAAkB;YAC7E,MAAM,KAAK,GAAsD,EAAE;;YAGnE,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,eAAe,EAAE,EAAE;AAC7C,gBAAA,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;gBAClF,IAAI,cAAc,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;;gBAGlD,IAAI,cAAc,CAAC,YAAY,CAAC,IAAI,KAAK,qBAAqB,EAAE;AAC9D,oBAAA,MAAM,IAAI,KAAK,CAAC,CAAA,SAAA,EAAY,qBAAqB,CAAA,QAAA,EAAW,YAAY,CAAA,UAAA,EAAa,cAAc,CAAC,YAAY,CAAC,IAAI,CAAA,CAAE,CAAC;gBAC1H;AAEA,gBAAA,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAe,CAAC;gBAEzF,IAAI,WAAW,KAAK,SAAS;AAAE,oBAAA,OAAO,SAAS;AAE/C,gBAAA,IAAI,WAAW,CAAC,IAAI,KAAK,mBAAmB;oBAC1C,MAAM,IAAI,KAAK,CAAC,CAAA,iCAAA,EAAoC,YAAY,CAAA,EAAA,EAAK,WAAW,CAAC,IAAI,CAAA,CAAE,CAAC;gBAE1F,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC;YAClC;YAEA,OAAO;AACL,gBAAA,IAAI,EAAE,mBAAmB;AACzB,gBAAA,kBAAkB,EAAE,cAAc;gBAClC,KAAK;aACN;QACH;AAEA,QAAA;AACE,YAAA,MAAM,IAAI,KAAK,CAAC,0BAA0B,YAAY,CAAA,CAAE,CAAC;;AAE/D;AAEA;;;;;AAKG;AACG,SAAU,yBAAyB,CAAC,GAAkG,EAAA;IAE1I,IAAI,GAAG,KAAK,SAAS;AAAE,QAAA,OAAO,SAAS;IAEvC,IAAIA,+BAAiB,CAAC,GAAG,CAAC;AAAE,QAAA,OAAO,GAAG;IACtC,IAAIC,wBAAU,CAAC,GAAG,CAAC;AAAE,QAAA,OAAOC,+BAAiB,CAAC,GAAG,CAAC;IAClD,IAAI,GAAG,YAAYC,yBAAgB;AAAE,QAAA,OAAO,gBAAgB,CAAC,GAAG,CAAC;IAEjE,MAAM,IAAI,KAAK,CAAC,CAAA,uBAAA,EAA0B,OAAO,GAAG,CAAA,CAAE,CAAC;AACzD;;;;;;;;;;;;;;"}

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

@@ -44,4 +44,3 @@ export declare function parsePColumnData(acc: TreeNodeAccessor | undefined, keyP
  * @returns The data in DataInfoEntries format, or undefined if the input was undefined or data is not ready.
  */
 export declare function convertOrParsePColumnData(acc: TreeNodeAccessor | DataInfoEntries<TreeNodeAccessor> | DataInfo<TreeNodeAccessor> | undefined): DataInfoEntries<TreeNodeAccessor> | undefined;
-//# sourceMappingURL=pcolumn_data.d.ts.map