{"version":3,"file":"pcolumn_data.cjs","names":["isDataInfoEntries","isDataInfo","dataInfoToEntries","TreeNodeAccessor"],"sources":["../../../src/render/util/pcolumn_data.ts"],"sourcesContent":["import type {\n  DataInfo,\n  ParquetChunkMetadata,\n  PartitionedDataInfoEntries,\n  PColumn,\n  PColumnValues,\n} from \"@milaboratories/pl-model-common\";\nimport {\n  assertNever,\n  dataInfoToEntries,\n  isDataInfo,\n  isDataInfoEntries,\n  visitDataInfo,\n  type BinaryChunk,\n  type DataInfoEntries,\n  type PColumnDataEntry,\n  type PColumnKey,\n} from \"@milaboratories/pl-model-common\";\nimport { TreeNodeAccessor } from \"../accessor\";\nimport type { PColumnDataUniversal } from \"../internal\";\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\";\nexport const RT_PARQUET_PARTITIONED = PCD_PREFIX + \"ParquetPartitioned\";\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\";\nexport const RT_PARQUET_SUPER_PARTITIONED = PCD_SUP_PREFIX + \"ParquetPartitioned\";\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    case RT_PARQUET_PARTITIONED:\n      keyLength = meta[\"partitionKeyLength\"];\n      break;\n\n    case RT_BINARY_SUPER_PARTITIONED:\n    case RT_JSON_SUPER_PARTITIONED:\n    case RT_PARQUET_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    case RT_PARQUET_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    case RT_PARQUET_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(\n  list: DataInfoEntries<unknown>,\n): (string | number)[][] {\n  if (\n    list.type !== \"JsonPartitioned\" &&\n    list.type !== \"BinaryPartitioned\" &&\n    list.type !== \"ParquetPartitioned\"\n  )\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(\n  acc: DataInfoEntries<unknown> | TreeNodeAccessor | undefined,\n): (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)) 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): PartitionedDataInfoEntries<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 (\n    keyPrefix.length > 0 &&\n    (resourceType === RT_JSON_SUPER_PARTITIONED ||\n      resourceType === RT_BINARY_SUPER_PARTITIONED ||\n      resourceType === RT_PARQUET_SUPER_PARTITIONED)\n  ) {\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_PARQUET_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: \"ParquetPartitioned\",\n        partitionKeyLength: meta.partitionKeyLength,\n        parts,\n      };\n    }\n\n    case RT_JSON_SUPER_PARTITIONED: {\n      if (\n        typeof meta?.superPartitionKeyLength !== \"number\" ||\n        typeof meta?.partitionKeyLength !== \"number\"\n      ) {\n        throw new Error(\n          `Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`,\n        );\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(\n            `Expected ${RT_JSON_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`,\n          );\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 (\n        typeof meta?.superPartitionKeyLength !== \"number\" ||\n        typeof meta?.partitionKeyLength !== \"number\"\n      ) {\n        throw new Error(\n          `Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`,\n        );\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(\n            `Expected ${RT_BINARY_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`,\n          );\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    case RT_PARQUET_SUPER_PARTITIONED: {\n      if (\n        typeof meta?.superPartitionKeyLength !== \"number\" ||\n        typeof meta?.partitionKeyLength !== \"number\"\n      ) {\n        throw new Error(\n          `Missing superPartitionKeyLength or partitionKeyLength in metadata for ${resourceType}`,\n        );\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_PARQUET_PARTITIONED) {\n          throw new Error(\n            `Expected ${RT_PARQUET_PARTITIONED} inside ${resourceType}, but got ${superPartition.resourceType.name}`,\n          );\n        }\n\n        const innerResult = parsePColumnData(superPartition, JSON.parse(supKeyStr) as PColumnKey);\n\n        if (innerResult === undefined) return undefined;\n\n        if (innerResult.type !== \"ParquetPartitioned\")\n          throw new Error(`Unexpected inner result type for ${resourceType}: ${innerResult.type}`);\n\n        parts.push(...innerResult.parts);\n      }\n\n      return {\n        type: \"ParquetPartitioned\",\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(\n  acc:\n    | TreeNodeAccessor\n    | DataInfoEntries<TreeNodeAccessor>\n    | DataInfo<TreeNodeAccessor>\n    | undefined,\n): DataInfoEntries<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\n/**\n * Returns the total number of rows in a PColumn, or `undefined` when the count\n * cannot be determined without downloading data blobs.\n *\n * Derivable cases:\n * - Inline values ({@link PColumnValues}): one entry per row.\n * - Inline `Json` {@link DataInfo}: one entry per row.\n * - Parquet (`ParquetPartitioned` / `ParquetSuperPartitioned`): summed from\n *   each chunk's precomputed {@link ParquetChunkMetadata.stats} `numberOfRows`,\n *   read from the chunk resource metadata without downloading the parquet files.\n *\n * Returns `undefined` when:\n * - the data is `undefined` or still computing / not ready,\n * - the data is `JsonPartitioned` or `BinaryPartitioned` (per-part row counts\n *   live inside opaque blobs and are not readable here),\n * - any parquet chunk is missing `stats.numberOfRows`.\n *\n * Note: do not confuse row count with `keyLength` / `partitionKeyLength`, which\n * are axis-tuple lengths, not row counts.\n */\nexport function getNumberOfRows(data: PColumnDataUniversal | undefined): number | undefined {\n  if (data === undefined) return undefined;\n\n  // Inline explicit values: one entry per row.\n  if (Array.isArray(data)) return data.length;\n\n  const entries = convertOrParsePColumnData(data);\n  if (entries === undefined) return undefined;\n\n  switch (entries.type) {\n    case \"Json\":\n      // Inline Json: one entry per row.\n      return entries.data.length;\n\n    case \"JsonPartitioned\":\n    case \"BinaryPartitioned\":\n      // Per-part row counts live inside opaque blobs; not knowable without download.\n      return undefined;\n\n    case \"ParquetPartitioned\": {\n      let total = 0;\n      for (const { value } of entries.parts) {\n        // The part accessor points at a ParquetChunk resource whose JSON payload\n        // is ParquetChunkMetadata. Reading it does not download the parquet file\n        // (the file lives in a separate `blob` sub-field of the chunk resource).\n        const rows = value.getDataAsJsonOrUndefined<ParquetChunkMetadata>()?.stats?.numberOfRows;\n        // stats / numberOfRows are Partial: if any chunk lacks it, the total is unknowable.\n        if (typeof rows !== \"number\") return undefined;\n        total += rows;\n      }\n      return total;\n    }\n\n    default:\n      assertNever(entries);\n  }\n}\n\nexport function isPColumnReady(\n  c: PColumn<undefined | PColumnDataUniversal>,\n): c is PColumn<PColumnDataUniversal> {\n  const isValues = (d: PColumnDataUniversal): d is PColumnValues => Array.isArray(d);\n  const isAccessor = (d: PColumnDataUniversal): d is TreeNodeAccessor =>\n    d instanceof TreeNodeAccessor;\n\n  let ready = true;\n  const data = c.data;\n  if (data == null) {\n    return false;\n  } else if (isAccessor(data)) {\n    ready &&= data.getIsReadyOrError();\n  } else if (isDataInfo(data)) {\n    visitDataInfo(data, (v) => (ready &&= v.getIsReadyOrError()));\n  } else if (!isValues(data)) {\n    throw Error(`unsupported column data type: ${data satisfies never}`);\n  }\n  return ready;\n}\n\nexport function allPColumnsReady(\n  columns: PColumn<undefined | PColumnDataUniversal>[],\n): columns is PColumn<PColumnDataUniversal>[] {\n  return columns.every(isPColumnReady);\n}\n"],"mappings":";;;AAqBA,MAAM,aAAa;AAEnB,MAAa,kBAAkB,aAAa;AAC5C,MAAa,8BAA8B,aAAa;AAExD,MAAa,sBAAsB,aAAa;AAChD,MAAa,wBAAwB,aAAa;AAClD,MAAa,yBAAyB,aAAa;AAEnD,MAAM,iBAAiB,aAAa;AACpC,MAAa,4BAA4B,iBAAiB;AAC1D,MAAa,8BAA8B,iBAAiB;AAC5D,MAAa,+BAA+B,iBAAiB;AAY7D,SAAS,wBACP,KACA,gBACA,MACA,YAAwB,CAAC,GACzB,sBACS;CACT,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,QAAQ,IAAI,aAAa,MAAzB;EACE,KAAK,iBAAiB;GACpB,IAAI,aAAa,IAAI,gBAAgB;GACrC,KAAK,MAAM,UAAU,IAAI,gBAAgB,GAAG;IAC1C,MAAM,QAAQ,IAAI,QAAQ;KAAE,OAAO;KAAQ,iBAAiB;IAAQ,CAAC;IACrE,MAAM,MAAM,CAAC,GAAG,WAAW,GAAG,KAAK,MAAM,MAAM,CAAC;IAChD,MAAM,YAAY,UAAU,KAAA,IAAY,KAAA,IAAY,eAAe,KAAK;IACxE,IAAI,cAAc,KAAA,GAAW,aAAa;IAC1C,IAAI,cAAc,KAAA,KAAa,sBAAsB,KAAK,KAAK;KAAE;KAAK,OAAO;IAAU,CAAC;GAC1F;GACA,OAAO;EACT;EACA,KAAK,6BAA6B;GAChC,IAAI,aAAa,IAAI,gBAAgB;GACrC,KAAK,MAAM,UAAU,IAAI,gBAAgB,GAAG;IAC1C,MAAM,QAAQ,IAAI,QAAQ;KAAE,OAAO;KAAQ,iBAAiB;IAAQ,CAAC;IACrE,IAAI,UAAU,KAAA,GAAW,aAAa;SACjC;KAEH,MAAM,iBAAiB,wBACrB,OACA,gBACA,MACA,CALW,GAAG,WAAW,GAAG,KAAK,MAAM,MAAM,CAK3C,GACF,oBACF;KACA,aAAa,cAAc;IAC7B;GACF;GACA,OAAO;EACT;EACA,SACE,MAAM,IAAI,MAAM,0BAA0B,IAAI,aAAa,MAAM;CACrE;AACF;AAYA,SAAgB,iBACd,KACA,gBACA,uBAAgC,OACO;CACvC,MAAM,OAAiD,CAAC;CAExD,OAAO;EAAE,YADU,wBAAwB,KAAK,gBAAgB,MAAM,CAAC,GAAG,oBACxD;EAAG;CAAK;AAC5B;AASA,MAAM,qBAAqB,WAAkE;CAC3F,IAAI,OAAO,SAAS,QAAQ,GAC1B,OAAO;EAAE,SAAS,OAAO,UAAU,GAAG,OAAO,SAAS,CAAC;EAAG,MAAM;CAAQ;MACnE,IAAI,OAAO,SAAS,SAAS,GAClC,OAAO;EAAE,SAAS,OAAO,UAAU,GAAG,OAAO,SAAS,CAAC;EAAG,MAAM;CAAS;MAEzE,MAAM,IAAI,MAAM,6DAA6D,QAAQ;AAEzF;;AAIA,SAAgB,qBACd,KAC4B;CAC5B,IAAI,CAAC,KAAK,OAAO,KAAA;CAEjB,MAAM,KAAK,IAAI,aAAa;CAC5B,MAAM,OAAO,IAAI,cAAsC;CACvD,MAAM,OAAqB,CAAC;CAE5B,IAAI,YAAY;CAEhB,QAAQ,IAAR;EACE,KAAK;GACH,YAAY,KAAK;GACjB;EAEF,KAAK;GACH,YAAY,KAAK,wBAAwB,KAAK;GAC9C;EAEF,KAAK;EACL,KAAK;EACL,KAAK;GACH,YAAY,KAAK;GACjB;EAEF,KAAK;EACL,KAAK;EACL,KAAK,8BACH,YAAY,KAAK,6BAA6B,KAAK;CAEvD;CAEA,QAAQ,IAAR;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,KAAK,IAAI,UAAU,IAAI,gBAAgB,GAAG;IACxC,IAAI,OAAA,iCACF,SAAS,kBAAkB,MAAM,CAAC,CAAC;IAErC,MAAM,MAAM,CAAC,GAAG,KAAK,MAAM,MAAM,CAAC;IAClC,KAAK,KAAK,GAAG;GACf;GAEA;EAEF,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,8BACH,KAAK,MAAM,aAAa,IAAI,gBAAgB,GAAG;GAC7C,MAAM,YAAY,CAAC,GAAG,KAAK,MAAM,SAAS,CAAC;GAE3C,MAAM,QAAQ,IAAI,QAAQ;IAAE,OAAO;IAAW,iBAAiB;GAAQ,CAAC;GACxE,IAAI,UAAU,KAAA,GACZ,KAAK,IAAI,UAAU,MAAM,gBAAgB,GAAG;IAC1C,IAAI,OAAA,6CACF,SAAS,kBAAkB,MAAM,CAAC,CAAC;IAErC,MAAM,MAAM,CAAC,GAAG,WAAW,GAAG,KAAK,MAAM,MAAM,CAAC;IAChD,KAAK,KAAK,GAAG;GACf;EAEJ;CAEJ;CAEA,OAAO;EAAE;EAAM;CAAU;AAC3B;AAEA,SAAS,qCACP,MACuB;CACvB,IACE,KAAK,SAAS,qBACd,KAAK,SAAS,uBACd,KAAK,SAAS,sBAEd,MAAM,IAAI,MAAM,uDAAuD,KAAK,MAAM;CAEpF,MAAM,EAAE,OAAO,uBAAuB;CAEtC,MAAM,SAAiC,CAAC;CACxC,KAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,EAAE,GACxC,OAAO,qBAAK,IAAI,IAAI,CAAC;CAGvB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,WAAW,oBACjB,MAAM,IAAI,MACR,eAAe,IAAI,OAAO,qCAAqC,mBAAmB,aAAa,KAAK,UAClG,GACF,GACF;EAEF,KAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,EAAE,GACxC,OAAO,EAAE,CAAC,IAAI,IAAI,EAAE;CAExB;CAEA,OAAO,OAAO,KAAK,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,CAAC;AACjD;AAOA,SAAgB,uBACd,KACmC;CACnC,IAAI,QAAQ,KAAA,GAAW,OAAO,KAAA;CAE9B,KAAA,GAAIA,gCAAAA,kBAAAA,CAAkB,GAAG,GAAG,OAAO,qCAAqC,GAAG;CAE3E,MAAM,OAAO,qBAAqB,GAAG;CACrC,IAAI,CAAC,MAAM,OAAO,KAAA;CAElB,MAAM,EAAE,MAAM,cAAc;CAE5B,MAAM,SAAiC,CAAC;CAExC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,EAAE,GAC/B,OAAO,qBAAK,IAAI,IAAI,CAAC;CAGvB,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,EAAE,WAAW,WACf,MAAM,IAAI,MAAM,4CAA4C;EAE9D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,EAAE,GAC/B,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE;CAEtB;CAEA,OAAO,OAAO,KAAK,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,CAAC;AACjD;;;;;;;;;;AAWA,SAAgB,iBACd,KACA,YAAwB,CAAC,GACiC;CAC1D,IAAI,QAAQ,KAAA,GAAW,OAAO,KAAA;CAE9B,IAAI,CAAC,IAAI,kBAAkB,GAAG,OAAO,KAAA;CAErC,MAAM,eAAe,IAAI,aAAa;CACtC,MAAM,OAAO,IAAI,cAAsC;CAGvD,IACE,UAAU,SAAS,MAClB,iBAAA,6CACC,iBAAA,+CACA,iBAAA,+CAEF,MAAM,IAAI,MAAM,iDAAiD,cAAc;CAGjF,QAAQ,cAAR;EACE,KAAK;EACL,KAAK,6BACH,MAAM,IAAI,MAAM,yCAAyC,cAAc;EAEzE,KAAK,qBAAqB;GACxB,IAAI,OAAO,MAAM,uBAAuB,UACtC,MAAM,IAAI,MAAM,8CAA8C,cAAc;GAG9E,MAAM,QAA8C,CAAC;GACrD,KAAK,MAAM,UAAU,IAAI,gBAAgB,GAAG;IAC1C,MAAM,QAAQ,IAAI,QAAQ;KAAE,OAAO;KAAQ,iBAAiB;IAAQ,CAAC;IACrE,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;IAEhC,MAAM,MAAM,CAAC,GAAG,WAAW,GAAG,KAAK,MAAM,MAAM,CAAC;IAChD,MAAM,KAAK;KAAE;KAAK;IAAM,CAAC;GAC3B;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB,KAAK;IACzB;GACF;EACF;EAEA,KAAK,uBAAuB;GAC1B,IAAI,OAAO,MAAM,uBAAuB,UACtC,MAAM,IAAI,MAAM,8CAA8C,cAAc;GAG9E,MAAM,QAA2D,CAAC;GAClE,MAAM,2BAAW,IAAI,IAAqE;GAG1F,KAAK,MAAM,UAAU,IAAI,gBAAgB,GAAG;IAC1C,MAAM,SAAS,kBAAkB,MAAM;IAEvC,MAAM,QAAQ,IAAI,QAAQ;KAAE,OAAO;KAAQ,iBAAiB;IAAQ,CAAC;IACrE,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;IAEhC,IAAI,QAAQ,SAAS,IAAI,OAAO,OAAO;IACvC,IAAI,CAAC,OAAO;KACV,QAAQ,CAAC;KACT,SAAS,IAAI,OAAO,SAAS,KAAK;IACpC;IAEA,IAAI,OAAO,SAAS,SAClB,MAAM,QAAQ;SAEd,MAAM,SAAS;GAEnB;GAGA,KAAK,MAAM,CAAC,YAAY,UAAU,SAAS,QAAQ,GAAG;IACpD,IAAI,CAAC,MAAM,SAAS,CAAC,MAAM,QAAQ,OAAO,KAAA;IAE1C,MAAM,MAAM,CAAC,GAAG,WAAW,GAAG,KAAK,MAAM,UAAU,CAAC;IACpD,MAAM,KAAK;KACT;KACA,OAAO;MACL,OAAO,MAAM;MACb,QAAQ,MAAM;KAChB;IACF,CAAC;GACH;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB,KAAK;IACzB;GACF;EACF;EAEA,KAAK,wBAAwB;GAC3B,IAAI,OAAO,MAAM,uBAAuB,UACtC,MAAM,IAAI,MAAM,8CAA8C,cAAc;GAG9E,MAAM,QAA8C,CAAC;GACrD,KAAK,MAAM,UAAU,IAAI,gBAAgB,GAAG;IAC1C,MAAM,QAAQ,IAAI,QAAQ;KAAE,OAAO;KAAQ,iBAAiB;IAAQ,CAAC;IACrE,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;IAEhC,MAAM,MAAM,CAAC,GAAG,WAAW,GAAG,KAAK,MAAM,MAAM,CAAC;IAChD,MAAM,KAAK;KAAE;KAAK;IAAM,CAAC;GAC3B;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB,KAAK;IACzB;GACF;EACF;EAEA,KAAK,2BAA2B;GAC9B,IACE,OAAO,MAAM,4BAA4B,YACzC,OAAO,MAAM,uBAAuB,UAEpC,MAAM,IAAI,MACR,yEAAyE,cAC3E;GAGF,MAAM,iBAAiB,KAAK,0BAA0B,KAAK;GAC3D,MAAM,QAA8C,CAAC;GAGrD,KAAK,MAAM,aAAa,IAAI,gBAAgB,GAAG;IAC7C,MAAM,iBAAiB,IAAI,QAAQ;KAAE,OAAO;KAAW,iBAAiB;IAAQ,CAAC;IACjF,IAAI,mBAAmB,KAAA,GAAW,OAAO,KAAA;IAGzC,IAAI,eAAe,aAAa,SAAA,+BAC9B,MAAM,IAAI,MACR,YAAY,oBAAoB,UAAU,aAAa,YAAY,eAAe,aAAa,MACjG;IAGF,MAAM,cAAc,iBAAiB,gBAAgB,KAAK,MAAM,SAAS,CAAe;IAExF,IAAI,gBAAgB,KAAA,GAAW,OAAO,KAAA;IAEtC,IAAI,YAAY,SAAS,mBACvB,MAAM,IAAI,MAAM,oCAAoC,aAAa,IAAI,YAAY,MAAM;IAEzF,MAAM,KAAK,GAAG,YAAY,KAAK;GACjC;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB;IACpB;GACF;EACF;EAEA,KAAK,6BAA6B;GAChC,IACE,OAAO,MAAM,4BAA4B,YACzC,OAAO,MAAM,uBAAuB,UAEpC,MAAM,IAAI,MACR,yEAAyE,cAC3E;GAGF,MAAM,iBAAiB,KAAK,0BAA0B,KAAK;GAC3D,MAAM,QAA2D,CAAC;GAGlE,KAAK,MAAM,aAAa,IAAI,gBAAgB,GAAG;IAC7C,MAAM,iBAAiB,IAAI,QAAQ;KAAE,OAAO;KAAW,iBAAiB;IAAQ,CAAC;IACjF,IAAI,mBAAmB,KAAA,GAAW,OAAO,KAAA;IAGzC,IAAI,eAAe,aAAa,SAAA,iCAC9B,MAAM,IAAI,MACR,YAAY,sBAAsB,UAAU,aAAa,YAAY,eAAe,aAAa,MACnG;IAGF,MAAM,cAAc,iBAAiB,gBAAgB,KAAK,MAAM,SAAS,CAAe;IAExF,IAAI,gBAAgB,KAAA,GAAW,OAAO,KAAA;IAEtC,IAAI,YAAY,SAAS,qBACvB,MAAM,IAAI,MAAM,oCAAoC,aAAa,IAAI,YAAY,MAAM;IAEzF,MAAM,KAAK,GAAG,YAAY,KAAK;GACjC;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB;IACpB;GACF;EACF;EAEA,KAAK,8BAA8B;GACjC,IACE,OAAO,MAAM,4BAA4B,YACzC,OAAO,MAAM,uBAAuB,UAEpC,MAAM,IAAI,MACR,yEAAyE,cAC3E;GAGF,MAAM,iBAAiB,KAAK,0BAA0B,KAAK;GAC3D,MAAM,QAA8C,CAAC;GAGrD,KAAK,MAAM,aAAa,IAAI,gBAAgB,GAAG;IAC7C,MAAM,iBAAiB,IAAI,QAAQ;KAAE,OAAO;KAAW,iBAAiB;IAAQ,CAAC;IACjF,IAAI,mBAAmB,KAAA,GAAW,OAAO,KAAA;IAGzC,IAAI,eAAe,aAAa,SAAA,kCAC9B,MAAM,IAAI,MACR,YAAY,uBAAuB,UAAU,aAAa,YAAY,eAAe,aAAa,MACpG;IAGF,MAAM,cAAc,iBAAiB,gBAAgB,KAAK,MAAM,SAAS,CAAe;IAExF,IAAI,gBAAgB,KAAA,GAAW,OAAO,KAAA;IAEtC,IAAI,YAAY,SAAS,sBACvB,MAAM,IAAI,MAAM,oCAAoC,aAAa,IAAI,YAAY,MAAM;IAEzF,MAAM,KAAK,GAAG,YAAY,KAAK;GACjC;GAEA,OAAO;IACL,MAAM;IACN,oBAAoB;IACpB;GACF;EACF;EAEA,SACE,MAAM,IAAI,MAAM,0BAA0B,cAAc;CAC5D;AACF;;;;;;;AAQA,SAAgB,0BACd,KAK+C;CAC/C,IAAI,QAAQ,KAAA,GAAW,OAAO,KAAA;CAE9B,KAAA,GAAIA,gCAAAA,kBAAAA,CAAkB,GAAG,GAAG,OAAO;CACnC,KAAA,GAAIC,gCAAAA,WAAAA,CAAW,GAAG,GAAG,QAAA,GAAOC,gCAAAA,kBAAAA,CAAkB,GAAG;CACjD,IAAI,eAAeC,iBAAAA,kBAAkB,OAAO,iBAAiB,GAAG;CAEhE,MAAM,IAAI,MAAM,0BAA0B,OAAO,KAAK;AACxD;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,gBAAgB,MAA4D;CAC1F,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAG/B,IAAI,MAAM,QAAQ,IAAI,GAAG,OAAO,KAAK;CAErC,MAAM,UAAU,0BAA0B,IAAI;CAC9C,IAAI,YAAY,KAAA,GAAW,OAAO,KAAA;CAElC,QAAQ,QAAQ,MAAhB;EACE,KAAK,QAEH,OAAO,QAAQ,KAAK;EAEtB,KAAK;EACL,KAAK,qBAEH;EAEF,KAAK,sBAAsB;GACzB,IAAI,QAAQ;GACZ,KAAK,MAAM,EAAE,WAAW,QAAQ,OAAO;IAIrC,MAAM,OAAO,MAAM,yBAA+C,CAAC,EAAE,OAAO;IAE5E,IAAI,OAAO,SAAS,UAAU,OAAO,KAAA;IACrC,SAAS;GACX;GACA,OAAO;EACT;EAEA,SACE,CAAA,GAAA,gCAAA,YAAA,CAAY,OAAO;CACvB;AACF;AAEA,SAAgB,eACd,GACoC;CACpC,MAAM,YAAY,MAAgD,MAAM,QAAQ,CAAC;CACjF,MAAM,cAAc,MAClB,aAAaA,iBAAAA;CAEf,IAAI,QAAQ;CACZ,MAAM,OAAO,EAAE;CACf,IAAI,QAAQ,MACV,OAAO;MACF,IAAI,WAAW,IAAI,GACxB,UAAU,KAAK,kBAAkB;MAC5B,KAAA,GAAIF,gCAAAA,WAAAA,CAAW,IAAI,GACxB,CAAA,GAAA,gCAAA,cAAA,CAAc,OAAO,MAAO,UAAU,EAAE,kBAAkB,CAAE;MACvD,IAAI,CAAC,SAAS,IAAI,GACvB,MAAM,MAAM,iCAAiC,MAAsB;CAErE,OAAO;AACT;AAEA,SAAgB,iBACd,SAC4C;CAC5C,OAAO,QAAQ,MAAM,cAAc;AACrC"}