@carlonicora/nextjs-jsonapi 1.5.0 → 1.7.0

package/dist/chunk-JGFWIT2E.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/cn.ts","../src/utils/compose-refs.ts","../src/utils/use-mobile.tsx","../src/utils/date-formatter.ts","../src/utils/exists.ts","../src/utils/table-options.ts","../src/utils/schemas/user.object.schema.ts","../src/utils/schemas/entity.object.schema.ts","../src/utils/blocknote-diff.util.ts","../src/utils/blocknote-word-diff-renderer.util.ts","../src/utils/icons.tsx"],"sourcesContent":["import { clsx, type ClassValue } from \"clsx\";\nimport { twMerge } from \"tailwind-merge\";\n\nexport function cn(...inputs: ClassValue[]) {\n  return twMerge(clsx(inputs));\n}\n","import * as React from \"react\";\n\ntype PossibleRef<T> = React.Ref<T> | undefined;\n\n/**\n * Set a given ref to a given value\n * This utility takes care of different types of refs: callback refs and RefObject(s)\n */\nfunction setRef<T>(ref: PossibleRef<T>, value: T) {\n  if (typeof ref === \"function\") {\n    return ref(value);\n  }\n\n  if (ref !== null && ref !== undefined) {\n    ref.current = value;\n  }\n}\n\n/**\n * A utility to compose multiple refs together\n * Accepts callback refs and RefObject(s)\n */\nfunction composeRefs<T>(...refs: PossibleRef<T>[]): React.RefCallback<T> {\n  return (node) => {\n    let hasCleanup = false;\n    const cleanups = refs.map((ref) => {\n      const cleanup = setRef(ref, node);\n      if (!hasCleanup && typeof cleanup === \"function\") {\n        hasCleanup = true;\n      }\n      return cleanup;\n    });\n\n    // React <19 will log an error to the console if a callback ref returns a\n    // value. We don't use ref cleanups internally so this will only happen if a\n    // user's ref callback returns a value, which we only expect if they are\n    // using the cleanup functionality added in React 19.\n    if (hasCleanup) {\n      return () => {\n        for (let i = 0; i < cleanups.length; i++) {\n          const cleanup = cleanups[i];\n          if (typeof cleanup === \"function\") {\n            cleanup();\n          } else {\n            setRef(refs[i], null);\n          }\n        }\n      };\n    }\n  };\n}\n\n/**\n * A custom hook that composes multiple refs\n * Accepts callback refs and RefObject(s)\n */\nfunction useComposedRefs<T>(...refs: PossibleRef<T>[]): React.RefCallback<T> {\n  return React.useCallback(composeRefs(...refs), refs);\n}\n\nexport { composeRefs, useComposedRefs };\n","\"use client\";\n\nimport * as React from \"react\";\n\nconst MOBILE_BREAKPOINT = 768;\n\nexport function useIsMobile() {\n  const [isMobile, setIsMobile] = React.useState<boolean | undefined>(undefined);\n\n  React.useEffect(() => {\n    const mql = window.matchMedia(`(max-width: ${MOBILE_BREAKPOINT - 1}px)`);\n    const onChange = () => {\n      setIsMobile(window.innerWidth < MOBILE_BREAKPOINT);\n    };\n    mql.addEventListener(\"change\", onChange);\n    setIsMobile(window.innerWidth < MOBILE_BREAKPOINT);\n    return () => mql.removeEventListener(\"change\", onChange);\n  }, []);\n\n  return !!isMobile;\n}\n","type FormatOption = \"date\" | \"time\" | \"dateTime\" | \"timeSince\" | \"default\";\n\nexport const formatDate = (eventDate: Date, formatOption: FormatOption): string => {\n  const browserLocale = navigator.language || \"en-US\";\n\n  const formatPart = (date: Date, options: Intl.DateTimeFormatOptions): string =>\n    new Intl.DateTimeFormat(browserLocale, options).format(date);\n\n  const now = new Date();\n  const diff = now.getTime() - eventDate.getTime();\n\n  if (formatOption === \"default\") {\n    if (diff < 24 * 60 * 60 * 1000) formatOption = \"timeSince\";\n    else formatOption = \"dateTime\";\n  }\n\n  if (formatOption === \"timeSince\") {\n    const seconds = Math.floor(diff / 1000);\n    const minutes = Math.floor(seconds / 60);\n    const hours = Math.floor(minutes / 60);\n    const days = Math.floor(hours / 24);\n\n    if (days > 0) return `${days} days ago`;\n    if (hours > 0) return `${hours} hours ago`;\n    if (minutes > 0) return `${minutes} minutes ago`;\n    return `${seconds} seconds ago`;\n  }\n\n  // Define formatting options\n  const dateOptions: Intl.DateTimeFormatOptions = {\n    year: \"numeric\",\n    month: \"2-digit\",\n    day: \"2-digit\",\n  };\n  const timeOptions: Intl.DateTimeFormatOptions = {\n    hour: \"2-digit\",\n    minute: \"2-digit\",\n  };\n\n  // Format based on the option\n  switch (formatOption) {\n    case \"date\":\n      return formatPart(eventDate, dateOptions);\n    case \"time\":\n      return formatPart(eventDate, timeOptions);\n    case \"dateTime\":\n      return `${formatPart(eventDate, dateOptions)} ${formatPart(eventDate, timeOptions)}`;\n    default:\n      throw new Error(\"Invalid format option\");\n  }\n};\n\nexport type { FormatOption };\n","export const exists = <T>(itemOrArray: T | T[] | null | undefined): boolean => {\n  if (!itemOrArray) return false;\n  if (Array.isArray(itemOrArray)) {\n    return itemOrArray.length > 0;\n  }\n  return true;\n};\n","import { Action, ModuleWithPermissions } from \"../permissions\";\nimport { cloneElement, createElement, Fragment, ReactElement } from \"react\";\n\nexport class TableOptions {\n  private _components: ReactElement<any>[];\n  private _hasPermissionToModule: <M extends ModuleWithPermissions>(params: {\n    module: M;\n    action: Action;\n    data?: any;\n  }) => boolean;\n\n  constructor(\n    hasPermissionToModule: <M extends ModuleWithPermissions>(params: {\n      module: M;\n      action: Action;\n      data?: any;\n    }) => boolean,\n  ) {\n    this._hasPermissionToModule = hasPermissionToModule;\n    this._components = [];\n  }\n\n  addOption<M extends ModuleWithPermissions>(component: ReactElement<any> | null, module?: M, action?: Action): void {\n    if (!component || (module && action && !this._hasPermissionToModule({ module, action }))) return;\n    this._components.push(component);\n  }\n\n  getComponents(): ReactElement<any>[] {\n    return this._components;\n  }\n\n  getOptions(): ReactElement<any> | null {\n    if (this._components.length === 0) return null;\n\n    const response: ReactElement<any>[] = this._components.map((option, index) =>\n      cloneElement(option, { key: option.key ?? index }),\n    );\n\n    return createElement(Fragment, {}, response);\n  }\n}\n\nexport function getTableOptions(params: {\n  hasPermissionToModule: <M extends ModuleWithPermissions>(params: {\n    module: M;\n    action: Action;\n    data?: any;\n  }) => boolean;\n  options: { component: ReactElement<any> | null; module?: ModuleWithPermissions; action?: Action }[];\n}): ReactElement<any> | null {\n  const tableOptions = new TableOptions(params.hasPermissionToModule);\n  params.options.forEach((option) => tableOptions.addOption(option.component, option.module, option.action));\n  return tableOptions.getOptions();\n}\n\nexport function getTableComponents(params: {\n  hasPermissionToModule: <M extends ModuleWithPermissions>(params: {\n    module: M;\n    action: Action;\n    data?: any;\n  }) => boolean;\n  options: { component: ReactElement<any> | null; module?: ModuleWithPermissions; action?: Action }[];\n}): ReactElement<any>[] {\n  const tableOptions = new TableOptions(params.hasPermissionToModule);\n  params.options.forEach((option) => tableOptions.addOption(option.component, option.module, option.action));\n  return tableOptions.getComponents();\n}\n","import { z } from \"zod\";\n\nexport const userObjectSchema = z.object({\n  id: z.string(),\n  name: z.string(),\n  avatar: z.string().optional(),\n});\n\nexport type UserObject = z.infer<typeof userObjectSchema>;\n","import { z } from \"zod\";\n\nexport const entityObjectSchema = z.object({\n  id: z.uuidv4(),\n  name: z.string(),\n});\n\nexport type EntityObject = z.infer<typeof entityObjectSchema>;\n","import { PartialBlock } from \"@blocknote/core\";\n\nexport interface WordDiff {\n  type: \"added\" | \"removed\" | \"unchanged\";\n  text: string;\n  diffId: string;\n  accepted?: boolean;\n  rejected?: boolean;\n}\n\nexport interface DiffBlock {\n  id?: string;\n  type?: string;\n  props?: any;\n  content?: any;\n  children?: DiffBlock[];\n  diffType?: \"added\" | \"removed\" | \"modified\" | \"unchanged\";\n  originalContent?: any;\n  diffId?: string;\n  wordDiffs?: WordDiff[];\n  accepted?: boolean;\n  rejected?: boolean;\n}\n\nexport interface DiffResult {\n  blocks: DiffBlock[];\n  hasChanges: boolean;\n}\n\nexport interface BlockDiffOptions {\n  ignoreIds?: boolean;\n  compareContent?: boolean;\n  similarityThreshold?: number;\n}\n\n/**\n * BlockNote Diff Utility\n * Implements a sophisticated diff algorithm for BlockNote document structures\n */\nexport class BlockNoteDiffUtil {\n  private static readonly DEFAULT_OPTIONS: BlockDiffOptions = {\n    ignoreIds: false,\n    compareContent: true,\n    similarityThreshold: 0.8,\n  };\n\n  /**\n   * Compare two BlockNote documents and return diff result\n   */\n  static diff(\n    originalBlocks: PartialBlock[] = [],\n    newBlocks: PartialBlock[] = [],\n    options: BlockDiffOptions = {},\n  ): DiffResult {\n    const opts = { ...this.DEFAULT_OPTIONS, ...options };\n\n    // Create a map for efficient lookups\n    const originalMap = new Map<string, PartialBlock>();\n    const newMap = new Map<string, PartialBlock>();\n\n    // Build maps based on block IDs\n    originalBlocks.forEach((block) => {\n      if (block.id) {\n        originalMap.set(block.id, block);\n      }\n    });\n\n    newBlocks.forEach((block) => {\n      if (block.id) {\n        newMap.set(block.id, block);\n      }\n    });\n\n    const diffBlocks: DiffBlock[] = [];\n    const processedNewIds = new Set<string>();\n\n    // Process original blocks to find removed and modified blocks\n    for (const originalBlock of originalBlocks) {\n      const blockId = originalBlock.id;\n\n      // Generate ID if missing\n      const processId = blockId || crypto.randomUUID();\n      const newBlock = blockId ? newMap.get(blockId) : null;\n\n      if (!newBlock) {\n        // Block was removed\n        const removedBlock: DiffBlock = {\n          ...originalBlock,\n          id: processId,\n          diffType: \"removed\",\n          diffId: `removed-${processId}`,\n        };\n        diffBlocks.push(removedBlock);\n      } else {\n        // Block exists in both, check for modifications\n        if (blockId) {\n          processedNewIds.add(blockId);\n        }\n\n        if (this.areBlocksEqual(originalBlock, newBlock, opts)) {\n          // Block is unchanged\n          const unchangedBlock: DiffBlock = {\n            ...newBlock,\n            diffType: \"unchanged\",\n          };\n          diffBlocks.push(unchangedBlock);\n        } else {\n          // Block was modified - perform word-level diff\n          const wordDiffs = this.generateWordDiffs(originalBlock.content, newBlock.content, processId);\n          const modifiedBlock: DiffBlock = {\n            ...newBlock,\n            diffType: \"modified\",\n            originalContent: originalBlock.content as any,\n            diffId: `modified-${processId}`,\n            wordDiffs: wordDiffs,\n          };\n          diffBlocks.push(modifiedBlock);\n        }\n      }\n    }\n\n    // Process new blocks to find added blocks\n    for (const newBlock of newBlocks) {\n      const blockId = newBlock.id;\n\n      // Skip if block was already processed (has ID and was found in original)\n      if (blockId && processedNewIds.has(blockId)) continue;\n\n      // This is a new block (either no ID or ID not found in original)\n      const generatedId = blockId || crypto.randomUUID();\n      const addedBlock: DiffBlock = {\n        ...newBlock,\n        id: generatedId,\n        diffType: \"added\",\n        diffId: `added-${generatedId}`,\n      };\n      diffBlocks.push(addedBlock);\n    }\n\n    // Sort blocks to maintain original order as much as possible\n    const sortedDiffBlocks = this.sortDiffBlocks(diffBlocks, originalBlocks, newBlocks);\n\n    return {\n      blocks: sortedDiffBlocks,\n      hasChanges: sortedDiffBlocks.some((block) => block.diffType !== \"unchanged\"),\n    };\n  }\n\n  /**\n   * Compare two blocks for equality\n   */\n  private static areBlocksEqual(block1: PartialBlock, block2: PartialBlock, options: BlockDiffOptions): boolean {\n    // Compare block type\n    if (block1.type !== block2.type) {\n      return false;\n    }\n\n    // Compare props (excluding diffType specific props)\n    if (!this.deepEqual(block1.props, block2.props)) {\n      return false;\n    }\n\n    // Compare content if enabled\n    if (options.compareContent) {\n      if (!this.deepEqual(block1.content, block2.content)) {\n        return false;\n      }\n    }\n\n    // Compare children recursively\n    const children1 = block1.children || [];\n    const children2 = block2.children || [];\n\n    if (children1.length !== children2.length) {\n      return false;\n    }\n\n    for (let i = 0; i < children1.length; i++) {\n      if (!this.areBlocksEqual(children1[i], children2[i], options)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Deep equality comparison for objects\n   */\n  private static deepEqual(obj1: any, obj2: any): boolean {\n    if (obj1 === obj2) return true;\n\n    if (obj1 == null || obj2 == null) return obj1 === obj2;\n\n    if (typeof obj1 !== typeof obj2) return false;\n\n    if (typeof obj1 !== \"object\") return obj1 === obj2;\n\n    if (Array.isArray(obj1) !== Array.isArray(obj2)) return false;\n\n    if (Array.isArray(obj1)) {\n      if (obj1.length !== obj2.length) return false;\n      for (let i = 0; i < obj1.length; i++) {\n        if (!this.deepEqual(obj1[i], obj2[i])) return false;\n      }\n      return true;\n    }\n\n    const keys1 = Object.keys(obj1);\n    const keys2 = Object.keys(obj2);\n\n    if (keys1.length !== keys2.length) return false;\n\n    for (const key of keys1) {\n      if (!keys2.includes(key)) return false;\n      if (!this.deepEqual(obj1[key], obj2[key])) return false;\n    }\n\n    return true;\n  }\n\n  /**\n   * Sort diff blocks to maintain logical order\n   */\n  private static sortDiffBlocks(\n    diffBlocks: DiffBlock[],\n    originalBlocks: PartialBlock[],\n    newBlocks: PartialBlock[],\n  ): DiffBlock[] {\n    // Create position maps\n    const originalPositions = new Map<string, number>();\n    const newPositions = new Map<string, number>();\n\n    originalBlocks.forEach((block, index) => {\n      if (block.id) {\n        originalPositions.set(block.id, index);\n      }\n    });\n\n    newBlocks.forEach((block, index) => {\n      if (block.id) {\n        newPositions.set(block.id, index);\n      }\n    });\n\n    return diffBlocks.sort((a, b) => {\n      const aId = a.id;\n      const bId = b.id;\n\n      if (!aId || !bId) return 0;\n\n      // Prioritize by new positions, fallback to original positions\n      const aPos = newPositions.get(aId) ?? originalPositions.get(aId) ?? Infinity;\n      const bPos = newPositions.get(bId) ?? originalPositions.get(bId) ?? Infinity;\n\n      return aPos - bPos;\n    });\n  }\n\n  /**\n   * Calculate similarity between two text contents\n   */\n  private static calculateSimilarity(content1: any[], content2: any[]): number {\n    if (!content1 || !content2) return 0;\n\n    const text1 = this.extractTextFromContent(content1);\n    const text2 = this.extractTextFromContent(content2);\n\n    if (text1 === text2) return 1;\n    if (!text1 || !text2) return 0;\n\n    // Simple Levenshtein distance-based similarity\n    const maxLength = Math.max(text1.length, text2.length);\n    const distance = this.levenshteinDistance(text1, text2);\n\n    return 1 - distance / maxLength;\n  }\n\n  /**\n   * Extract plain text from BlockNote content array\n   */\n  private static extractTextFromContent(content: any[]): string {\n    if (!Array.isArray(content)) return \"\";\n\n    return content\n      .map((item) => {\n        if (item.type === \"text\") {\n          return item.text || \"\";\n        }\n        return \"\";\n      })\n      .join(\"\");\n  }\n\n  /**\n   * Calculate Levenshtein distance between two strings\n   */\n  private static levenshteinDistance(str1: string, str2: string): number {\n    const matrix = Array(str2.length + 1)\n      .fill(null)\n      .map(() => Array(str1.length + 1).fill(null));\n\n    for (let i = 0; i <= str1.length; i++) {\n      matrix[0][i] = i;\n    }\n\n    for (let j = 0; j <= str2.length; j++) {\n      matrix[j][0] = j;\n    }\n\n    for (let j = 1; j <= str2.length; j++) {\n      for (let i = 1; i <= str1.length; i++) {\n        const substitutionCost = str1[i - 1] === str2[j - 1] ? 0 : 1;\n        matrix[j][i] = Math.min(\n          matrix[j][i - 1] + 1, // deletion\n          matrix[j - 1][i] + 1, // insertion\n          matrix[j - 1][i - 1] + substitutionCost, // substitution\n        );\n      }\n    }\n\n    return matrix[str2.length][str1.length];\n  }\n\n  /**\n   * Generate word-level diffs between two content arrays\n   */\n  static generateWordDiffs(originalContent: any, newContent: any, blockId: string): WordDiff[] {\n    const originalText = this.extractTextFromContent(originalContent || []);\n    const newText = this.extractTextFromContent(newContent || []);\n\n    if (!originalText && !newText) return [];\n    if (!originalText) {\n      return newText\n        .split(/\\s+/)\n        .filter((word) => word.trim())\n        .map((word, index) => ({\n          type: \"added\" as const,\n          text: word,\n          diffId: `${blockId}-add-${index}`,\n          accepted: false,\n          rejected: false,\n        }));\n    }\n    if (!newText) {\n      return originalText\n        .split(/\\s+/)\n        .filter((word) => word.trim())\n        .map((word, index) => ({\n          type: \"removed\" as const,\n          text: word,\n          diffId: `${blockId}-remove-${index}`,\n          accepted: false,\n          rejected: false,\n        }));\n    }\n\n    return this.diffWords(originalText, newText, blockId);\n  }\n\n  /**\n   * Perform word-level diff using word-only approach (no space tokenization)\n   */\n  private static diffWords(text1: string, text2: string, blockId: string): WordDiff[] {\n    const words1 = text1.split(/\\s+/).filter((word) => word.length > 0);\n    const words2 = text2.split(/\\s+/).filter((word) => word.length > 0);\n\n    const diffs = this.myersDiff(words1, words2);\n\n    // Consolidate adjacent changes to reduce fragmentation\n    const consolidatedDiffs = this.consolidateAdjacentChanges(diffs);\n\n    const result: WordDiff[] = [];\n    let diffIndex = 0;\n\n    for (let i = 0; i < consolidatedDiffs.length; i++) {\n      const diff = consolidatedDiffs[i];\n      const isLastDiff = i === consolidatedDiffs.length - 1;\n\n      switch (diff.type) {\n        case \"equal\":\n          result.push({\n            type: \"unchanged\",\n            text: diff.value,\n            diffId: `${blockId}-unchanged-${diffIndex++}`,\n            accepted: true,\n            rejected: false,\n          });\n\n          // Add space after word if not the last diff\n          if (!isLastDiff) {\n            result.push({\n              type: \"unchanged\",\n              text: \" \",\n              diffId: `${blockId}-space-${diffIndex++}`,\n              accepted: true,\n              rejected: false,\n            });\n          }\n          break;\n\n        case \"delete\":\n          // Check if this is a consolidated change or regular change\n          if ((diff as any).consolidated) {\n            // This is a consolidated deletion - check if next is consolidated insertion\n            const nextDiff = i + 1 < consolidatedDiffs.length ? consolidatedDiffs[i + 1] : null;\n            const isConsolidatedReplacement = nextDiff && nextDiff.type === \"insert\" && (nextDiff as any).consolidated;\n\n            if (isConsolidatedReplacement) {\n              // Use single shared diff ID for the entire consolidated change\n              const replacementId = `${blockId}-replace-${diffIndex++}`;\n\n              // Add the removed text\n              result.push({\n                type: \"removed\",\n                text: diff.value,\n                diffId: replacementId,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add the new text with same diff ID\n              result.push({\n                type: \"added\",\n                text: nextDiff.value,\n                diffId: replacementId,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Skip the next insert since we handled it\n              i++;\n\n              // Add space after replacement if not the last\n              if (i < consolidatedDiffs.length - 1) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            } else {\n              // Consolidated deletion without replacement\n              result.push({\n                type: \"removed\",\n                text: diff.value,\n                diffId: `${blockId}-remove-${diffIndex++}`,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add space after deletion if not the last\n              if (!isLastDiff) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            }\n          } else {\n            // Regular single-word processing\n            const nextDiff = i + 1 < consolidatedDiffs.length ? consolidatedDiffs[i + 1] : null;\n            const isReplacement =\n              nextDiff && nextDiff.type === \"insert\" && this.areWordsSimilar(diff.value, nextDiff.value);\n\n            if (isReplacement) {\n              // Use single shared diff ID for both operations\n              const replacementId = `${blockId}-replace-${diffIndex++}`;\n\n              // Add the removed word\n              result.push({\n                type: \"removed\",\n                text: diff.value,\n                diffId: replacementId,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add the new word with same diff ID (no space between them)\n              result.push({\n                type: \"added\",\n                text: nextDiff.value,\n                diffId: replacementId,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Skip the next insert since we handled it\n              i++;\n\n              // Add space after replacement if not the last\n              if (i < consolidatedDiffs.length - 1) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            } else {\n              // Regular deletion\n              result.push({\n                type: \"removed\",\n                text: diff.value,\n                diffId: `${blockId}-remove-${diffIndex++}`,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add space after deletion if not the last\n              if (!isLastDiff) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            }\n          }\n          break;\n\n        case \"insert\":\n          // Only handle if not already processed as part of replacement or consolidation\n          if ((diff as any).consolidated) {\n            // This should have been handled in the delete case above\n            const prevDiff = i > 0 ? consolidatedDiffs[i - 1] : null;\n            const wasProcessedAsConsolidatedReplacement =\n              prevDiff && prevDiff.type === \"delete\" && (prevDiff as any).consolidated;\n\n            if (!wasProcessedAsConsolidatedReplacement) {\n              // Standalone consolidated insertion\n              result.push({\n                type: \"added\",\n                text: diff.value,\n                diffId: `${blockId}-add-${diffIndex++}`,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add space after insertion if not the last\n              if (!isLastDiff) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            }\n          } else {\n            // Regular single-word processing\n            const prevDiff = i > 0 ? consolidatedDiffs[i - 1] : null;\n            const wasProcessedAsReplacement =\n              prevDiff && prevDiff.type === \"delete\" && this.areWordsSimilar(prevDiff.value, diff.value);\n\n            if (!wasProcessedAsReplacement) {\n              result.push({\n                type: \"added\",\n                text: diff.value,\n                diffId: `${blockId}-add-${diffIndex++}`,\n                accepted: false,\n                rejected: false,\n              });\n\n              // Add space after insertion if not the last\n              if (!isLastDiff) {\n                result.push({\n                  type: \"unchanged\",\n                  text: \" \",\n                  diffId: `${blockId}-space-${diffIndex++}`,\n                  accepted: true,\n                  rejected: false,\n                });\n              }\n            }\n          }\n          break;\n      }\n    }\n\n    return result;\n  } /**\n   * Improved diff algorithm that better handles word insertions\n   * Uses a combination of LCS and heuristics to minimize false changes\n   */\n  private static myersDiff(a: string[], b: string[]): Array<{ type: \"equal\" | \"delete\" | \"insert\"; value: string }> {\n    if (a.length === 0) {\n      return b.map((value) => ({ type: \"insert\" as const, value }));\n    }\n    if (b.length === 0) {\n      return a.map((value) => ({ type: \"delete\" as const, value }));\n    }\n\n    // Use dynamic programming for optimal diff\n    const dp = this.computeEditScript(a, b);\n    return this.reconstructDiff(a, b, dp);\n  }\n\n  /**\n   * Compute edit script using dynamic programming\n   */\n  private static computeEditScript(a: string[], b: string[]): number[][] {\n    const m = a.length;\n    const n = b.length;\n    const dp: number[][] = Array(m + 1)\n      .fill(null)\n      .map(() => Array(n + 1).fill(0));\n\n    // Initialize base cases\n    for (let i = 0; i <= m; i++) dp[i][0] = i;\n    for (let j = 0; j <= n; j++) dp[0][j] = j;\n\n    // Fill the DP table\n    for (let i = 1; i <= m; i++) {\n      for (let j = 1; j <= n; j++) {\n        if (a[i - 1] === b[j - 1]) {\n          dp[i][j] = dp[i - 1][j - 1]; // No operation needed\n        } else {\n          dp[i][j] =\n            1 +\n            Math.min(\n              dp[i - 1][j], // Delete from a\n              dp[i][j - 1], // Insert into a\n              dp[i - 1][j - 1], // Replace\n            );\n        }\n      }\n    }\n\n    return dp;\n  }\n\n  /**\n   * Reconstruct the actual diff from the DP table\n   */\n  private static reconstructDiff(\n    a: string[],\n    b: string[],\n    dp: number[][],\n  ): Array<{ type: \"equal\" | \"delete\" | \"insert\"; value: string; sharedDiffId?: boolean }> {\n    const result: Array<{ type: \"equal\" | \"delete\" | \"insert\"; value: string; sharedDiffId?: boolean }> = [];\n    let i = a.length;\n    let j = b.length;\n\n    while (i > 0 || j > 0) {\n      if (i > 0 && j > 0 && a[i - 1] === b[j - 1]) {\n        // Equal\n        result.unshift({ type: \"equal\", value: a[i - 1] });\n        i--;\n        j--;\n      } else {\n        // Determine the best operation with preference for insert/delete over replace\n        const deleteCost = i > 0 ? dp[i - 1][j] : Infinity;\n        const insertCost = j > 0 ? dp[i][j - 1] : Infinity;\n        const replaceCost = i > 0 && j > 0 ? dp[i - 1][j - 1] : Infinity;\n\n        const minCost = Math.min(deleteCost, insertCost, replaceCost);\n\n        // Prefer insertions and deletions over replacements when costs are equal\n        if (minCost === insertCost && j > 0) {\n          // Insert\n          result.unshift({ type: \"insert\", value: b[j - 1] });\n          j--;\n        } else if (minCost === deleteCost && i > 0) {\n          // Delete\n          result.unshift({ type: \"delete\", value: a[i - 1] });\n          i--;\n        } else if (minCost === replaceCost && i > 0 && j > 0) {\n          // Only use replace for similar words, otherwise prefer separate operations\n          if (this.areWordsSimilar(a[i - 1], b[j - 1])) {\n            // Similar words - treat as replacement with shared diffId\n            result.unshift({ type: \"insert\", value: b[j - 1], sharedDiffId: true });\n            result.unshift({ type: \"delete\", value: a[i - 1], sharedDiffId: true });\n            i--;\n            j--;\n          } else {\n            // Different words - prefer insert over delete when costs are equal\n            result.unshift({ type: \"insert\", value: b[j - 1] });\n            j--;\n          }\n        }\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Consolidate adjacent changes to reduce fragmentation\n   * e.g., if we have: delete \"Key\", insert \"Key!\", delete \"Challenges\"\n   * We can consolidate this into: replace [\"Key\", \"Challenges\"] with [\"Key!\"]\n   */\n  private static consolidateAdjacentChanges(\n    diffs: Array<{ type: \"equal\" | \"delete\" | \"insert\"; value: string }>,\n  ): Array<{ type: \"equal\" | \"delete\" | \"insert\"; value: string; consolidated?: boolean }> {\n    const result = [];\n    let i = 0;\n\n    while (i < diffs.length) {\n      const current = diffs[i];\n\n      if (current.type === \"equal\") {\n        result.push(current);\n        i++;\n        continue;\n      }\n\n      // Look for patterns of adjacent changes that can be consolidated\n      const changeSequence = [];\n      let j = i;\n\n      // Collect adjacent non-equal changes\n      while (j < diffs.length && diffs[j].type !== \"equal\") {\n        changeSequence.push(diffs[j]);\n        j++;\n      }\n\n      if (changeSequence.length <= 1) {\n        // Single change, no consolidation needed\n        result.push(current);\n        i++;\n        continue;\n      }\n\n      // Check if we should consolidate this sequence\n      const shouldConsolidate = this.shouldConsolidateChanges(\n        changeSequence as Array<{ type: \"delete\" | \"insert\"; value: string }>,\n      );\n\n      if (shouldConsolidate) {\n        // Create consolidated changes\n        const deletedWords = changeSequence.filter((c) => c.type === \"delete\").map((c) => c.value);\n        const insertedWords = changeSequence.filter((c) => c.type === \"insert\").map((c) => c.value);\n\n        if (deletedWords.length > 0) {\n          result.push({\n            type: \"delete\" as const,\n            value: deletedWords.join(\" \"),\n            consolidated: true,\n          });\n        }\n\n        if (insertedWords.length > 0) {\n          result.push({\n            type: \"insert\" as const,\n            value: insertedWords.join(\" \"),\n            consolidated: true,\n          });\n        }\n      } else {\n        // Don't consolidate, add individual changes\n        changeSequence.forEach((change) => result.push(change));\n      }\n\n      i = j;\n    }\n\n    return result;\n  }\n\n  /**\n   * Determine if a sequence of changes should be consolidated\n   */\n  private static shouldConsolidateChanges(changes: Array<{ type: \"delete\" | \"insert\"; value: string }>): boolean {\n    // Consolidate if we have both deletions and insertions in the same sequence\n    const hasDeletes = changes.some((c) => c.type === \"delete\");\n    const hasInserts = changes.some((c) => c.type === \"insert\");\n\n    // Only consolidate if we have both types of changes (replacements/modifications)\n    // Pure additions or pure deletions are fine as separate changes\n    return hasDeletes && hasInserts;\n  }\n\n  /**\n   * Check if two words are similar enough to be considered a replacement\n   */\n  private static areWordsSimilar(word1: string, word2: string): boolean {\n    // If words are exactly the same, they're similar\n    if (word1 === word2) return true;\n\n    // Consider words similar if they share more than 70% of their characters\n    const maxLen = Math.max(word1.length, word2.length);\n    const minLen = Math.min(word1.length, word2.length);\n\n    // If one word is much longer than the other, they're not similar\n    if (maxLen > minLen * 2) {\n      return false;\n    }\n\n    // Special case: if one word is just the other plus punctuation, treat as separate changes\n    // e.g., \"Key\" and \"Key!\" should not be considered similar for replacement\n    const word1Clean = word1.replace(/[^\\w]/g, \"\");\n    const word2Clean = word2.replace(/[^\\w]/g, \"\");\n\n    if (word1Clean === word2Clean && word1 !== word2) {\n      // One word is just the other with added punctuation - don't treat as replacement\n      return false;\n    }\n\n    // Calculate character overlap using Levenshtein distance\n    const distance = this.levenshteinDistance(word1, word2);\n    const similarity = 1 - distance / maxLen;\n\n    return similarity > 0.7; // Increased threshold to be more conservative\n  }\n}\n","import { PartialBlock } from \"@blocknote/core\";\nimport { DiffBlock, WordDiff } from \"./blocknote-diff.util\";\n\nexport class BlockNoteWordDiffRendererUtil {\n  static renderWordDiffs(\n    diffBlocks: DiffBlock[],\n    onAcceptChange?: (diffId: string) => void,\n    onRejectChange?: (diffId: string) => void,\n    acceptedChanges?: Set<string>,\n    rejectedChanges?: Set<string>,\n  ): PartialBlock[] {\n    if (acceptedChanges || rejectedChanges) {\n      diffBlocks = this.updateWordDiffStates(diffBlocks, acceptedChanges, rejectedChanges);\n    }\n    return diffBlocks.map((block) => this.renderDiffBlock(block, onAcceptChange, onRejectChange));\n  }\n\n  private static updateWordDiffStates(\n    diffBlocks: DiffBlock[],\n    acceptedChanges?: Set<string>,\n    rejectedChanges?: Set<string>,\n  ): DiffBlock[] {\n    return diffBlocks.map((block) => {\n      const updatedBlock = { ...block };\n\n      if (updatedBlock.diffId) {\n        updatedBlock.accepted = acceptedChanges?.has(updatedBlock.diffId) || false;\n        updatedBlock.rejected = rejectedChanges?.has(updatedBlock.diffId) || false;\n      }\n\n      if (updatedBlock.wordDiffs) {\n        updatedBlock.wordDiffs = updatedBlock.wordDiffs.map((wordDiff) => ({\n          ...wordDiff,\n          accepted: acceptedChanges?.has(wordDiff.diffId) || false,\n          rejected: rejectedChanges?.has(wordDiff.diffId) || false,\n        }));\n      }\n\n      if (updatedBlock.children) {\n        updatedBlock.children = this.updateWordDiffStates(\n          updatedBlock.children as DiffBlock[],\n          acceptedChanges,\n          rejectedChanges,\n        );\n      }\n\n      return updatedBlock;\n    });\n  }\n\n  private static renderDiffBlock(\n    block: DiffBlock,\n    onAcceptChange?: (diffId: string) => void,\n    onRejectChange?: (diffId: string) => void,\n  ): PartialBlock {\n    if (block.diffType === \"modified\" && block.wordDiffs) {\n      return this.renderWordLevelDiff(block, onAcceptChange, onRejectChange);\n    }\n\n    if (block.diffType === \"added\" || block.diffType === \"removed\") {\n      return this.renderBlockLevelDiff(block, onAcceptChange, onRejectChange);\n    }\n\n    const baseBlock: PartialBlock = {\n      id: block.id || crypto.randomUUID(),\n      type: (block.type as any) || \"paragraph\",\n      props: this.getBlockProps(block),\n      content: Array.isArray(block.content) ? block.content : [],\n      children: block.children?.map((child) =>\n        this.renderDiffBlock(child as DiffBlock, onAcceptChange, onRejectChange),\n      ),\n    };\n\n    return baseBlock;\n  }\n\n  private static renderBlockLevelDiff(\n    block: DiffBlock,\n    onAcceptChange?: (diffId: string) => void,\n    onRejectChange?: (diffId: string) => void,\n  ): PartialBlock {\n    if (!block.diffId) {\n      return {\n        id: block.id || crypto.randomUUID(),\n        type: (block.type as any) || \"paragraph\",\n        props: block.props || {},\n        content: Array.isArray(block.content) ? block.content : [],\n        children: block.children?.map((child) =>\n          this.renderDiffBlock(child as DiffBlock, onAcceptChange, onRejectChange),\n        ),\n      };\n    }\n\n    const blockAccepted = block.accepted || false;\n    const blockRejected = block.rejected || false;\n\n    let content = Array.isArray(block.content) ? [...block.content] : [];\n\n    if (block.diffType === \"added\") {\n      if (blockRejected) {\n        return {\n          id: block.id || crypto.randomUUID(),\n          type: \"paragraph\",\n          props: {},\n          content: [],\n          children: [],\n        };\n      } else if (!blockAccepted) {\n        content = content.map((item: any) => ({\n          ...item,\n          styles: { ...item.styles, bold: true },\n        }));\n\n        content.push({\n          type: \"diffActions\",\n          props: { diffIds: block.diffId },\n        });\n      }\n    } else if (block.diffType === \"removed\") {\n      if (blockAccepted) {\n        return {\n          id: block.id || crypto.randomUUID(),\n          type: \"paragraph\",\n          props: {},\n          content: [],\n          children: [],\n        };\n      } else if (!blockRejected) {\n        content = content.map((item: any) => ({\n          ...item,\n          styles: { ...item.styles, strike: true },\n        }));\n\n        content.push({\n          type: \"diffActions\",\n          props: { diffIds: block.diffId },\n        });\n      }\n    }\n\n    const baseBlock: PartialBlock = {\n      id: block.id || crypto.randomUUID(),\n      type: (block.type as any) || \"paragraph\",\n      props: this.getBlockProps(block),\n      content: content,\n      children: block.children?.map((child) =>\n        this.renderDiffBlock(child as DiffBlock, onAcceptChange, onRejectChange),\n      ),\n    };\n\n    return baseBlock;\n  }\n\n  private static renderWordLevelDiff(\n    block: DiffBlock,\n    onAcceptChange?: (diffId: string) => void,\n    onRejectChange?: (diffId: string) => void,\n  ): PartialBlock {\n    if (!block.wordDiffs) {\n      return {\n        id: block.id || crypto.randomUUID(),\n        type: (block.type as any) || \"paragraph\",\n        props: block.props || {},\n        content: Array.isArray(block.content) ? block.content : [],\n        children: [],\n      };\n    }\n\n    const content = this.groupAndRenderWordDiffs(block.wordDiffs);\n\n    return {\n      id: block.id || crypto.randomUUID(),\n      type: (block.type as any) || \"paragraph\",\n      props: block.props || {},\n      content: Array.isArray(content) ? content : [],\n      children:\n        block.children?.map((child) => this.renderDiffBlock(child as DiffBlock, onAcceptChange, onRejectChange)) || [],\n    };\n  }\n\n  private static groupAndRenderWordDiffs(wordDiffs: WordDiff[]): any[] {\n    const content: any[] = [];\n\n    for (let i = 0; i < wordDiffs.length; i++) {\n      const wordDiff = wordDiffs[i];\n\n      const isLastOfGroup = this.isLastDiffInGroup(wordDiffs, i);\n\n      const textContent = this.createTextContent(wordDiff, isLastOfGroup);\n      if (textContent) {\n        if (Array.isArray(textContent)) {\n          content.push(...textContent);\n        } else {\n          content.push(textContent);\n        }\n      }\n    }\n\n    const cleanedContent = this.cleanupSpaces(content);\n\n    return cleanedContent;\n  }\n\n  private static cleanupSpaces(content: any[]): any[] {\n    const filtered = content.filter((item) => item !== null && item !== undefined);\n\n    const cleaned: any[] = [];\n\n    for (let i = 0; i < filtered.length; i++) {\n      const current = filtered[i];\n\n      if (current.type === \"text\" && current.text === \" \") {\n        const lastItem = cleaned[cleaned.length - 1];\n\n        if (\n          i === 0 ||\n          i === filtered.length - 1 ||\n          (lastItem && lastItem.type === \"text\" && lastItem.text === \" \") ||\n          (lastItem && lastItem.type === \"diffActions\")\n        ) {\n          continue;\n        }\n      }\n\n      if (current.type === \"diffActions\") {\n        const nextItem = i + 1 < filtered.length ? filtered[i + 1] : null;\n\n        cleaned.push(current);\n\n        if (nextItem && nextItem.type === \"text\" && nextItem.text !== \" \" && nextItem.type !== \"diffActions\") {\n          cleaned.push({\n            type: \"text\",\n            text: \" \",\n            styles: {},\n          });\n        }\n\n        continue;\n      }\n\n      cleaned.push(current);\n    }\n\n    return cleaned;\n  }\n\n  private static isLastDiffInGroup(wordDiffs: WordDiff[], currentIndex: number): boolean {\n    const currentDiff = wordDiffs[currentIndex];\n\n    if (currentDiff.type === \"unchanged\") {\n      return false;\n    }\n\n    for (let i = currentIndex + 1; i < wordDiffs.length; i++) {\n      const nextDiff = wordDiffs[i];\n\n      if (nextDiff.diffId === currentDiff.diffId && (nextDiff.type === \"added\" || nextDiff.type === \"removed\")) {\n        return false;\n      }\n\n      if (nextDiff.type !== \"unchanged\" && nextDiff.diffId !== currentDiff.diffId) {\n        break;\n      }\n    }\n\n    return true;\n  }\n\n  private static createTextContent(wordDiff: WordDiff, isLastOfGroup?: boolean): any[] | any {\n    switch (wordDiff.type) {\n      case \"added\":\n        if (wordDiff.accepted) {\n          return {\n            type: \"text\",\n            text: wordDiff.text,\n            styles: {},\n          };\n        } else if (wordDiff.rejected) {\n          return null;\n        } else {\n          if (wordDiff.text.trim() === \"\") {\n            return {\n              type: \"text\",\n              text: wordDiff.text,\n              styles: { backgroundColor: \"#dcfce7\" },\n            };\n          } else {\n            const baseContent = {\n              type: \"text\",\n              text: wordDiff.text,\n              styles: { bold: true },\n            };\n\n            if (isLastOfGroup) {\n              return [\n                baseContent,\n                {\n                  type: \"diffActions\",\n                  props: { diffIds: wordDiff.diffId },\n                },\n              ];\n            } else {\n              return baseContent;\n            }\n          }\n        }\n\n      case \"removed\":\n        if (wordDiff.accepted) {\n          return null;\n        } else if (wordDiff.rejected) {\n          return {\n            type: \"text\",\n            text: wordDiff.text,\n            styles: {},\n          };\n        } else {\n          if (wordDiff.text.trim() === \"\") {\n            return {\n              type: \"text\",\n              text: wordDiff.text,\n              styles: { strike: true },\n            };\n          } else {\n            const baseContent = {\n              type: \"text\",\n              text: wordDiff.text,\n              styles: { strike: true },\n            };\n\n            if (isLastOfGroup) {\n              return [\n                baseContent,\n                {\n                  type: \"diffActions\",\n                  props: { diffIds: wordDiff.diffId },\n                },\n              ];\n            } else {\n              return baseContent;\n            }\n          }\n        }\n\n      case \"unchanged\":\n      default:\n        return {\n          type: \"text\",\n          text: wordDiff.text,\n          styles: {},\n        };\n    }\n  }\n\n  private static getBlockProps(block: DiffBlock): any {\n    const baseProps = block.props || {};\n\n    return baseProps;\n  }\n\n  static generateChangeSummary(diffBlocks: DiffBlock[]): {\n    totalWords: number;\n    addedWords: number;\n    removedWords: number;\n    acceptedChanges: number;\n    rejectedChanges: number;\n    pendingChanges: number;\n  } {\n    let totalWords = 0;\n    let addedWords = 0;\n    let removedWords = 0;\n    let acceptedChanges = 0;\n    let rejectedChanges = 0;\n    let pendingChanges = 0;\n\n    const processBlock = (block: DiffBlock) => {\n      if (block.wordDiffs) {\n        block.wordDiffs.forEach((wordDiff) => {\n          totalWords++;\n\n          if (wordDiff.type === \"added\") {\n            addedWords++;\n          } else if (wordDiff.type === \"removed\") {\n            removedWords++;\n          }\n\n          if (wordDiff.accepted) {\n            acceptedChanges++;\n          } else if (wordDiff.rejected) {\n            rejectedChanges++;\n          } else if (wordDiff.type !== \"unchanged\") {\n            pendingChanges++;\n          }\n        });\n      }\n\n      if (block.children) {\n        block.children.forEach((child) => processBlock(child as DiffBlock));\n      }\n    };\n\n    diffBlocks.forEach(processBlock);\n\n    return {\n      totalWords,\n      addedWords,\n      removedWords,\n      acceptedChanges,\n      rejectedChanges,\n      pendingChanges,\n    };\n  }\n}\n","import { LucideIcon } from \"lucide-react\";\nimport { ReactNode } from \"react\";\nimport { ApiDataInterface, Modules } from \"../core\";\nimport { ContentInterface } from \"../features/content/data/content.interface\";\nimport { ModuleWithPermissions } from \"../permissions\";\nimport { cn } from \"./cn\";\n\nexport const getIconByModule = (params: { module: ModuleWithPermissions; className?: string }): ReactNode => {\n  const IconComponent = getLucideIconByModule({ module: params.module });\n  if (!IconComponent) return null;\n  return <IconComponent className={cn(``, params.className)} />;\n};\n\nexport const getIcon = (params: { element: ApiDataInterface; className?: string }): ReactNode => {\n  const IconComponent = getLucideIcon({ element: params.element });\n  if (!IconComponent) return null;\n  return <IconComponent className={cn(``, params.className)} />;\n};\n\nexport const getIconByModuleName = (params: { name: string; className?: string }): ReactNode => {\n  return getIconByModule({ module: Modules.findByModelName(params.name), className: params.className });\n};\n\nexport const getLucideIcon = (params: { element: ApiDataInterface }): LucideIcon | null => {\n  if (params.element.type === \"contents\") {\n    const contentType = (params.element as ContentInterface).contentType;\n    if (!contentType) return null;\n    return getLucideIconByModule({ module: Modules.findByModelName(contentType) });\n  }\n\n  return getLucideIconByModule({ module: Modules.findByName(params.element.type) });\n};\n\nexport const getLucideIconByModule = (params: { module: ModuleWithPermissions }): LucideIcon | null => {\n  return params.module.icon ?? null;\n};\n\nexport const getLucideIconByModuleName = (params: { name: string }): LucideIcon | null => {\n  return getLucideIconByModule({ module: Modules.findByModelName(params.name) });\n};\n"],"mappings":";;;;;;;;AAAA,SAAS,YAA6B;AACtC,SAAS,eAAe;AAEjB,SAAS,MAAM,QAAsB;AAC1C,SAAO,QAAQ,KAAK,MAAM,CAAC;AAC7B;AAFgB;;;ACHhB,YAAY,WAAW;AAQvB,SAAS,OAAU,KAAqB,OAAU;AAChD,MAAI,OAAO,QAAQ,YAAY;AAC7B,WAAO,IAAI,KAAK;AAAA,EAClB;AAEA,MAAI,QAAQ,QAAQ,QAAQ,QAAW;AACrC,QAAI,UAAU;AAAA,EAChB;AACF;AARS;AAcT,SAAS,eAAkB,MAA8C;AACvE,SAAO,CAAC,SAAS;AACf,QAAI,aAAa;AACjB,UAAM,WAAW,KAAK,IAAI,CAAC,QAAQ;AACjC,YAAM,UAAU,OAAO,KAAK,IAAI;AAChC,UAAI,CAAC,cAAc,OAAO,YAAY,YAAY;AAChD,qBAAa;AAAA,MACf;AACA,aAAO;AAAA,IACT,CAAC;AAMD,QAAI,YAAY;AACd,aAAO,MAAM;AACX,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,gBAAM,UAAU,SAAS,CAAC;AAC1B,cAAI,OAAO,YAAY,YAAY;AACjC,oBAAQ;AAAA,UACV,OAAO;AACL,mBAAO,KAAK,CAAC,GAAG,IAAI;AAAA,UACtB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AA5BS;AAkCT,SAAS,mBAAsB,MAA8C;AAC3E,SAAa,kBAAY,YAAY,GAAG,IAAI,GAAG,IAAI;AACrD;AAFS;;;ACtDT,YAAYA,YAAW;AAEvB,IAAM,oBAAoB;AAEnB,SAAS,cAAc;AAC5B,QAAM,CAAC,UAAU,WAAW,IAAU,gBAA8B,MAAS;AAE7E,EAAM,iBAAU,MAAM;AACpB,UAAM,MAAM,OAAO,WAAW,eAAe,oBAAoB,CAAC,KAAK;AACvE,UAAM,WAAW,6BAAM;AACrB,kBAAY,OAAO,aAAa,iBAAiB;AAAA,IACnD,GAFiB;AAGjB,QAAI,iBAAiB,UAAU,QAAQ;AACvC,gBAAY,OAAO,aAAa,iBAAiB;AACjD,WAAO,MAAM,IAAI,oBAAoB,UAAU,QAAQ;AAAA,EACzD,GAAG,CAAC,CAAC;AAEL,SAAO,CAAC,CAAC;AACX;AAdgB;;;ACJT,IAAM,aAAa,wBAAC,WAAiB,iBAAuC;AACjF,QAAM,gBAAgB,UAAU,YAAY;AAE5C,QAAM,aAAa,wBAAC,MAAY,YAC9B,IAAI,KAAK,eAAe,eAAe,OAAO,EAAE,OAAO,IAAI,GAD1C;AAGnB,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,OAAO,IAAI,QAAQ,IAAI,UAAU,QAAQ;AAE/C,MAAI,iBAAiB,WAAW;AAC9B,QAAI,OAAO,KAAK,KAAK,KAAK,IAAM,gBAAe;AAAA,QAC1C,gBAAe;AAAA,EACtB;AAEA,MAAI,iBAAiB,aAAa;AAChC,UAAM,UAAU,KAAK,MAAM,OAAO,GAAI;AACtC,UAAM,UAAU,KAAK,MAAM,UAAU,EAAE;AACvC,UAAM,QAAQ,KAAK,MAAM,UAAU,EAAE;AACrC,UAAM,OAAO,KAAK,MAAM,QAAQ,EAAE;AAElC,QAAI,OAAO,EAAG,QAAO,GAAG,IAAI;AAC5B,QAAI,QAAQ,EAAG,QAAO,GAAG,KAAK;AAC9B,QAAI,UAAU,EAAG,QAAO,GAAG,OAAO;AAClC,WAAO,GAAG,OAAO;AAAA,EACnB;AAGA,QAAM,cAA0C;AAAA,IAC9C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,EACP;AACA,QAAM,cAA0C;AAAA,IAC9C,MAAM;AAAA,IACN,QAAQ;AAAA,EACV;AAGA,UAAQ,cAAc;AAAA,IACpB,KAAK;AACH,aAAO,WAAW,WAAW,WAAW;AAAA,IAC1C,KAAK;AACH,aAAO,WAAW,WAAW,WAAW;AAAA,IAC1C,KAAK;AACH,aAAO,GAAG,WAAW,WAAW,WAAW,CAAC,IAAI,WAAW,WAAW,WAAW,CAAC;AAAA,IACpF;AACE,YAAM,IAAI,MAAM,uBAAuB;AAAA,EAC3C;AACF,GAhD0B;;;ACFnB,IAAM,SAAS,wBAAI,gBAAqD;AAC7E,MAAI,CAAC,YAAa,QAAO;AACzB,MAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,WAAO,YAAY,SAAS;AAAA,EAC9B;AACA,SAAO;AACT,GANsB;;;ACCtB,SAAS,cAAc,eAAe,gBAA8B;AAE7D,IAAM,eAAN,MAAmB;AAAA,EAH1B,OAG0B;AAAA;AAAA;AAAA,EAChB;AAAA,EACA;AAAA,EAMR,YACE,uBAKA;AACA,SAAK,yBAAyB;AAC9B,SAAK,cAAc,CAAC;AAAA,EACtB;AAAA,EAEA,UAA2C,WAAqC,QAAY,QAAuB;AACjH,QAAI,CAAC,aAAc,UAAU,UAAU,CAAC,KAAK,uBAAuB,EAAE,QAAQ,OAAO,CAAC,EAAI;AAC1F,SAAK,YAAY,KAAK,SAAS;AAAA,EACjC;AAAA,EAEA,gBAAqC;AACnC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,aAAuC;AACrC,QAAI,KAAK,YAAY,WAAW,EAAG,QAAO;AAE1C,UAAM,WAAgC,KAAK,YAAY;AAAA,MAAI,CAAC,QAAQ,UAClE,aAAa,QAAQ,EAAE,KAAK,OAAO,OAAO,MAAM,CAAC;AAAA,IACnD;AAEA,WAAO,cAAc,UAAU,CAAC,GAAG,QAAQ;AAAA,EAC7C;AACF;AAEO,SAAS,gBAAgB,QAOH;AAC3B,QAAM,eAAe,IAAI,aAAa,OAAO,qBAAqB;AAClE,SAAO,QAAQ,QAAQ,CAAC,WAAW,aAAa,UAAU,OAAO,WAAW,OAAO,QAAQ,OAAO,MAAM,CAAC;AACzG,SAAO,aAAa,WAAW;AACjC;AAXgB;AAaT,SAAS,mBAAmB,QAOX;AACtB,QAAM,eAAe,IAAI,aAAa,OAAO,qBAAqB;AAClE,SAAO,QAAQ,QAAQ,CAAC,WAAW,aAAa,UAAU,OAAO,WAAW,OAAO,QAAQ,OAAO,MAAM,CAAC;AACzG,SAAO,aAAa,cAAc;AACpC;AAXgB;;;ACvDhB,SAAS,SAAS;AAEX,IAAM,mBAAmB,EAAE,OAAO;AAAA,EACvC,IAAI,EAAE,OAAO;AAAA,EACb,MAAM,EAAE,OAAO;AAAA,EACf,QAAQ,EAAE,OAAO,EAAE,SAAS;AAC9B,CAAC;;;ACND,SAAS,KAAAC,UAAS;AAEX,IAAM,qBAAqBA,GAAE,OAAO;AAAA,EACzC,IAAIA,GAAE,OAAO;AAAA,EACb,MAAMA,GAAE,OAAO;AACjB,CAAC;;;ACkCM,IAAM,oBAAN,MAAwB;AAAA,EAvC/B,OAuC+B;AAAA;AAAA;AAAA,EAC7B,OAAwB,kBAAoC;AAAA,IAC1D,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,qBAAqB;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,KACL,iBAAiC,CAAC,GAClC,YAA4B,CAAC,GAC7B,UAA4B,CAAC,GACjB;AACZ,UAAM,OAAO,EAAE,GAAG,KAAK,iBAAiB,GAAG,QAAQ;AAGnD,UAAM,cAAc,oBAAI,IAA0B;AAClD,UAAM,SAAS,oBAAI,IAA0B;AAG7C,mBAAe,QAAQ,CAAC,UAAU;AAChC,UAAI,MAAM,IAAI;AACZ,oBAAY,IAAI,MAAM,IAAI,KAAK;AAAA,MACjC;AAAA,IACF,CAAC;AAED,cAAU,QAAQ,CAAC,UAAU;AAC3B,UAAI,MAAM,IAAI;AACZ,eAAO,IAAI,MAAM,IAAI,KAAK;AAAA,MAC5B;AAAA,IACF,CAAC;AAED,UAAM,aAA0B,CAAC;AACjC,UAAM,kBAAkB,oBAAI,IAAY;AAGxC,eAAW,iBAAiB,gBAAgB;AAC1C,YAAM,UAAU,cAAc;AAG9B,YAAM,YAAY,WAAW,OAAO,WAAW;AAC/C,YAAM,WAAW,UAAU,OAAO,IAAI,OAAO,IAAI;AAEjD,UAAI,CAAC,UAAU;AAEb,cAAM,eAA0B;AAAA,UAC9B,GAAG;AAAA,UACH,IAAI;AAAA,UACJ,UAAU;AAAA,UACV,QAAQ,WAAW,SAAS;AAAA,QAC9B;AACA,mBAAW,KAAK,YAAY;AAAA,MAC9B,OAAO;AAEL,YAAI,SAAS;AACX,0BAAgB,IAAI,OAAO;AAAA,QAC7B;AAEA,YAAI,KAAK,eAAe,eAAe,UAAU,IAAI,GAAG;AAEtD,gBAAM,iBAA4B;AAAA,YAChC,GAAG;AAAA,YACH,UAAU;AAAA,UACZ;AACA,qBAAW,KAAK,cAAc;AAAA,QAChC,OAAO;AAEL,gBAAM,YAAY,KAAK,kBAAkB,cAAc,SAAS,SAAS,SAAS,SAAS;AAC3F,gBAAM,gBAA2B;AAAA,YAC/B,GAAG;AAAA,YACH,UAAU;AAAA,YACV,iBAAiB,cAAc;AAAA,YAC/B,QAAQ,YAAY,SAAS;AAAA,YAC7B;AAAA,UACF;AACA,qBAAW,KAAK,aAAa;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAGA,eAAW,YAAY,WAAW;AAChC,YAAM,UAAU,SAAS;AAGzB,UAAI,WAAW,gBAAgB,IAAI,OAAO,EAAG;AAG7C,YAAM,cAAc,WAAW,OAAO,WAAW;AACjD,YAAM,aAAwB;AAAA,QAC5B,GAAG;AAAA,QACH,IAAI;AAAA,QACJ,UAAU;AAAA,QACV,QAAQ,SAAS,WAAW;AAAA,MAC9B;AACA,iBAAW,KAAK,UAAU;AAAA,IAC5B;AAGA,UAAM,mBAAmB,KAAK,eAAe,YAAY,gBAAgB,SAAS;AAElF,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,YAAY,iBAAiB,KAAK,CAAC,UAAU,MAAM,aAAa,WAAW;AAAA,IAC7E;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,eAAe,QAAsB,QAAsB,SAAoC;AAE5G,QAAI,OAAO,SAAS,OAAO,MAAM;AAC/B,aAAO;AAAA,IACT;AAGA,QAAI,CAAC,KAAK,UAAU,OAAO,OAAO,OAAO,KAAK,GAAG;AAC/C,aAAO;AAAA,IACT;AAGA,QAAI,QAAQ,gBAAgB;AAC1B,UAAI,CAAC,KAAK,UAAU,OAAO,SAAS,OAAO,OAAO,GAAG;AACnD,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,YAAY,OAAO,YAAY,CAAC;AACtC,UAAM,YAAY,OAAO,YAAY,CAAC;AAEtC,QAAI,UAAU,WAAW,UAAU,QAAQ;AACzC,aAAO;AAAA,IACT;AAEA,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAI,CAAC,KAAK,eAAe,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,OAAO,GAAG;AAC7D,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,UAAU,MAAW,MAAoB;AACtD,QAAI,SAAS,KAAM,QAAO;AAE1B,QAAI,QAAQ,QAAQ,QAAQ,KAAM,QAAO,SAAS;AAElD,QAAI,OAAO,SAAS,OAAO,KAAM,QAAO;AAExC,QAAI,OAAO,SAAS,SAAU,QAAO,SAAS;AAE9C,QAAI,MAAM,QAAQ,IAAI,MAAM,MAAM,QAAQ,IAAI,EAAG,QAAO;AAExD,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,UAAI,KAAK,WAAW,KAAK,OAAQ,QAAO;AACxC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,CAAC,KAAK,UAAU,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAG,QAAO;AAAA,MAChD;AACA,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,UAAM,QAAQ,OAAO,KAAK,IAAI;AAE9B,QAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAE1C,eAAW,OAAO,OAAO;AACvB,UAAI,CAAC,MAAM,SAAS,GAAG,EAAG,QAAO;AACjC,UAAI,CAAC,KAAK,UAAU,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,EAAG,QAAO;AAAA,IACpD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,eACb,YACA,gBACA,WACa;AAEb,UAAM,oBAAoB,oBAAI,IAAoB;AAClD,UAAM,eAAe,oBAAI,IAAoB;AAE7C,mBAAe,QAAQ,CAAC,OAAO,UAAU;AACvC,UAAI,MAAM,IAAI;AACZ,0BAAkB,IAAI,MAAM,IAAI,KAAK;AAAA,MACvC;AAAA,IACF,CAAC;AAED,cAAU,QAAQ,CAAC,OAAO,UAAU;AAClC,UAAI,MAAM,IAAI;AACZ,qBAAa,IAAI,MAAM,IAAI,KAAK;AAAA,MAClC;AAAA,IACF,CAAC;AAED,WAAO,WAAW,KAAK,CAAC,GAAG,MAAM;AAC/B,YAAM,MAAM,EAAE;AACd,YAAM,MAAM,EAAE;AAEd,UAAI,CAAC,OAAO,CAAC,IAAK,QAAO;AAGzB,YAAM,OAAO,aAAa,IAAI,GAAG,KAAK,kBAAkB,IAAI,GAAG,KAAK;AACpE,YAAM,OAAO,aAAa,IAAI,GAAG,KAAK,kBAAkB,IAAI,GAAG,KAAK;AAEpE,aAAO,OAAO;AAAA,IAChB,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,oBAAoB,UAAiB,UAAyB;AAC3E,QAAI,CAAC,YAAY,CAAC,SAAU,QAAO;AAEnC,UAAM,QAAQ,KAAK,uBAAuB,QAAQ;AAClD,UAAM,QAAQ,KAAK,uBAAuB,QAAQ;AAElD,QAAI,UAAU,MAAO,QAAO;AAC5B,QAAI,CAAC,SAAS,CAAC,MAAO,QAAO;AAG7B,UAAM,YAAY,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;AACrD,UAAM,WAAW,KAAK,oBAAoB,OAAO,KAAK;AAEtD,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,uBAAuB,SAAwB;AAC5D,QAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO;AAEpC,WAAO,QACJ,IAAI,CAAC,SAAS;AACb,UAAI,KAAK,SAAS,QAAQ;AACxB,eAAO,KAAK,QAAQ;AAAA,MACtB;AACA,aAAO;AAAA,IACT,CAAC,EACA,KAAK,EAAE;AAAA,EACZ;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,oBAAoB,MAAc,MAAsB;AACrE,UAAM,SAAS,MAAM,KAAK,SAAS,CAAC,EACjC,KAAK,IAAI,EACT,IAAI,MAAM,MAAM,KAAK,SAAS,CAAC,EAAE,KAAK,IAAI,CAAC;AAE9C,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,EAAE,CAAC,IAAI;AAAA,IACjB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,EAAE,CAAC,IAAI;AAAA,IACjB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,eAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,cAAM,mBAAmB,KAAK,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,IAAI;AAC3D,eAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,UAClB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,UACnB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA;AAAA,UACnB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,MAAM,EAAE,KAAK,MAAM;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,kBAAkB,iBAAsB,YAAiB,SAA6B;AAC3F,UAAM,eAAe,KAAK,uBAAuB,mBAAmB,CAAC,CAAC;AACtE,UAAM,UAAU,KAAK,uBAAuB,cAAc,CAAC,CAAC;AAE5D,QAAI,CAAC,gBAAgB,CAAC,QAAS,QAAO,CAAC;AACvC,QAAI,CAAC,cAAc;AACjB,aAAO,QACJ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,KAAK,CAAC,EAC5B,IAAI,CAAC,MAAM,WAAW;AAAA,QACrB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ,GAAG,OAAO,QAAQ,KAAK;AAAA,QAC/B,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,EAAE;AAAA,IACN;AACA,QAAI,CAAC,SAAS;AACZ,aAAO,aACJ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,KAAK,CAAC,EAC5B,IAAI,CAAC,MAAM,WAAW;AAAA,QACrB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ,GAAG,OAAO,WAAW,KAAK;AAAA,QAClC,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,EAAE;AAAA,IACN;AAEA,WAAO,KAAK,UAAU,cAAc,SAAS,OAAO;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,UAAU,OAAe,OAAe,SAA6B;AAClF,UAAM,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAClE,UAAM,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAElE,UAAM,QAAQ,KAAK,UAAU,QAAQ,MAAM;AAG3C,UAAM,oBAAoB,KAAK,2BAA2B,KAAK;AAE/D,UAAM,SAAqB,CAAC;AAC5B,QAAI,YAAY;AAEhB,aAAS,IAAI,GAAG,IAAI,kBAAkB,QAAQ,KAAK;AACjD,YAAM,OAAO,kBAAkB,CAAC;AAChC,YAAM,aAAa,MAAM,kBAAkB,SAAS;AAEpD,cAAQ,KAAK,MAAM;AAAA,QACjB,KAAK;AACH,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,MAAM,KAAK;AAAA,YACX,QAAQ,GAAG,OAAO,cAAc,WAAW;AAAA,YAC3C,UAAU;AAAA,YACV,UAAU;AAAA,UACZ,CAAC;AAGD,cAAI,CAAC,YAAY;AACf,mBAAO,KAAK;AAAA,cACV,MAAM;AAAA,cACN,MAAM;AAAA,cACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,cACvC,UAAU;AAAA,cACV,UAAU;AAAA,YACZ,CAAC;AAAA,UACH;AACA;AAAA,QAEF,KAAK;AAEH,cAAK,KAAa,cAAc;AAE9B,kBAAM,WAAW,IAAI,IAAI,kBAAkB,SAAS,kBAAkB,IAAI,CAAC,IAAI;AAC/E,kBAAM,4BAA4B,YAAY,SAAS,SAAS,YAAa,SAAiB;AAE9F,gBAAI,2BAA2B;AAE7B,oBAAM,gBAAgB,GAAG,OAAO,YAAY,WAAW;AAGvD,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ;AAAA,gBACR,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,SAAS;AAAA,gBACf,QAAQ;AAAA,gBACR,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD;AAGA,kBAAI,IAAI,kBAAkB,SAAS,GAAG;AACpC,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF,OAAO;AAEL,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ,GAAG,OAAO,WAAW,WAAW;AAAA,gBACxC,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,kBAAI,CAAC,YAAY;AACf,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF;AAAA,UACF,OAAO;AAEL,kBAAM,WAAW,IAAI,IAAI,kBAAkB,SAAS,kBAAkB,IAAI,CAAC,IAAI;AAC/E,kBAAM,gBACJ,YAAY,SAAS,SAAS,YAAY,KAAK,gBAAgB,KAAK,OAAO,SAAS,KAAK;AAE3F,gBAAI,eAAe;AAEjB,oBAAM,gBAAgB,GAAG,OAAO,YAAY,WAAW;AAGvD,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ;AAAA,gBACR,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,SAAS;AAAA,gBACf,QAAQ;AAAA,gBACR,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD;AAGA,kBAAI,IAAI,kBAAkB,SAAS,GAAG;AACpC,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF,OAAO;AAEL,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ,GAAG,OAAO,WAAW,WAAW;AAAA,gBACxC,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,kBAAI,CAAC,YAAY;AACf,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF;AAAA,UACF;AACA;AAAA,QAEF,KAAK;AAEH,cAAK,KAAa,cAAc;AAE9B,kBAAM,WAAW,IAAI,IAAI,kBAAkB,IAAI,CAAC,IAAI;AACpD,kBAAM,wCACJ,YAAY,SAAS,SAAS,YAAa,SAAiB;AAE9D,gBAAI,CAAC,uCAAuC;AAE1C,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ,GAAG,OAAO,QAAQ,WAAW;AAAA,gBACrC,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,kBAAI,CAAC,YAAY;AACf,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF;AAAA,UACF,OAAO;AAEL,kBAAM,WAAW,IAAI,IAAI,kBAAkB,IAAI,CAAC,IAAI;AACpD,kBAAM,4BACJ,YAAY,SAAS,SAAS,YAAY,KAAK,gBAAgB,SAAS,OAAO,KAAK,KAAK;AAE3F,gBAAI,CAAC,2BAA2B;AAC9B,qBAAO,KAAK;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM,KAAK;AAAA,gBACX,QAAQ,GAAG,OAAO,QAAQ,WAAW;AAAA,gBACrC,UAAU;AAAA,gBACV,UAAU;AAAA,cACZ,CAAC;AAGD,kBAAI,CAAC,YAAY;AACf,uBAAO,KAAK;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,QAAQ,GAAG,OAAO,UAAU,WAAW;AAAA,kBACvC,UAAU;AAAA,kBACV,UAAU;AAAA,gBACZ,CAAC;AAAA,cACH;AAAA,YACF;AAAA,UACF;AACA;AAAA,MACJ;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAIA,OAAe,UAAU,GAAa,GAA4E;AAChH,QAAI,EAAE,WAAW,GAAG;AAClB,aAAO,EAAE,IAAI,CAAC,WAAW,EAAE,MAAM,UAAmB,MAAM,EAAE;AAAA,IAC9D;AACA,QAAI,EAAE,WAAW,GAAG;AAClB,aAAO,EAAE,IAAI,CAAC,WAAW,EAAE,MAAM,UAAmB,MAAM,EAAE;AAAA,IAC9D;AAGA,UAAM,KAAK,KAAK,kBAAkB,GAAG,CAAC;AACtC,WAAO,KAAK,gBAAgB,GAAG,GAAG,EAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,kBAAkB,GAAa,GAAyB;AACrE,UAAM,IAAI,EAAE;AACZ,UAAM,IAAI,EAAE;AACZ,UAAM,KAAiB,MAAM,IAAI,CAAC,EAC/B,KAAK,IAAI,EACT,IAAI,MAAM,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;AAGjC,aAAS,IAAI,GAAG,KAAK,GAAG,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AACxC,aAAS,IAAI,GAAG,KAAK,GAAG,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AAGxC,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,eAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AACzB,aAAG,CAAC,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QAC5B,OAAO;AACL,aAAG,CAAC,EAAE,CAAC,IACL,IACA,KAAK;AAAA,YACH,GAAG,IAAI,CAAC,EAAE,CAAC;AAAA;AAAA,YACX,GAAG,CAAC,EAAE,IAAI,CAAC;AAAA;AAAA,YACX,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA;AAAA,UACjB;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,gBACb,GACA,GACA,IACuF;AACvF,UAAM,SAAgG,CAAC;AACvG,QAAI,IAAI,EAAE;AACV,QAAI,IAAI,EAAE;AAEV,WAAO,IAAI,KAAK,IAAI,GAAG;AACrB,UAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AAE3C,eAAO,QAAQ,EAAE,MAAM,SAAS,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AACjD;AACA;AAAA,MACF,OAAO;AAEL,cAAM,aAAa,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI;AAC1C,cAAM,aAAa,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI;AAC1C,cAAM,cAAc,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAExD,cAAM,UAAU,KAAK,IAAI,YAAY,YAAY,WAAW;AAG5D,YAAI,YAAY,cAAc,IAAI,GAAG;AAEnC,iBAAO,QAAQ,EAAE,MAAM,UAAU,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAClD;AAAA,QACF,WAAW,YAAY,cAAc,IAAI,GAAG;AAE1C,iBAAO,QAAQ,EAAE,MAAM,UAAU,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAClD;AAAA,QACF,WAAW,YAAY,eAAe,IAAI,KAAK,IAAI,GAAG;AAEpD,cAAI,KAAK,gBAAgB,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG;AAE5C,mBAAO,QAAQ,EAAE,MAAM,UAAU,OAAO,EAAE,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC;AACtE,mBAAO,QAAQ,EAAE,MAAM,UAAU,OAAO,EAAE,IAAI,CAAC,GAAG,cAAc,KAAK,CAAC;AACtE;AACA;AAAA,UACF,OAAO;AAEL,mBAAO,QAAQ,EAAE,MAAM,UAAU,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAClD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAe,2BACb,OACuF;AACvF,UAAM,SAAS,CAAC;AAChB,QAAI,IAAI;AAER,WAAO,IAAI,MAAM,QAAQ;AACvB,YAAM,UAAU,MAAM,CAAC;AAEvB,UAAI,QAAQ,SAAS,SAAS;AAC5B,eAAO,KAAK,OAAO;AACnB;AACA;AAAA,MACF;AAGA,YAAM,iBAAiB,CAAC;AACxB,UAAI,IAAI;AAGR,aAAO,IAAI,MAAM,UAAU,MAAM,CAAC,EAAE,SAAS,SAAS;AACpD,uBAAe,KAAK,MAAM,CAAC,CAAC;AAC5B;AAAA,MACF;AAEA,UAAI,eAAe,UAAU,GAAG;AAE9B,eAAO,KAAK,OAAO;AACnB;AACA;AAAA,MACF;AAGA,YAAM,oBAAoB,KAAK;AAAA,QAC7B;AAAA,MACF;AAEA,UAAI,mBAAmB;AAErB,cAAM,eAAe,eAAe,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AACzF,cAAM,gBAAgB,eAAe,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAE1F,YAAI,aAAa,SAAS,GAAG;AAC3B,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,OAAO,aAAa,KAAK,GAAG;AAAA,YAC5B,cAAc;AAAA,UAChB,CAAC;AAAA,QACH;AAEA,YAAI,cAAc,SAAS,GAAG;AAC5B,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,OAAO,cAAc,KAAK,GAAG;AAAA,YAC7B,cAAc;AAAA,UAChB,CAAC;AAAA,QACH;AAAA,MACF,OAAO;AAEL,uBAAe,QAAQ,CAAC,WAAW,OAAO,KAAK,MAAM,CAAC;AAAA,MACxD;AAEA,UAAI;AAAA,IACN;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,yBAAyB,SAAuE;AAE7G,UAAM,aAAa,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ;AAC1D,UAAM,aAAa,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ;AAI1D,WAAO,cAAc;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,gBAAgB,OAAe,OAAwB;AAEpE,QAAI,UAAU,MAAO,QAAO;AAG5B,UAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;AAClD,UAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;AAGlD,QAAI,SAAS,SAAS,GAAG;AACvB,aAAO;AAAA,IACT;AAIA,UAAM,aAAa,MAAM,QAAQ,UAAU,EAAE;AAC7C,UAAM,aAAa,MAAM,QAAQ,UAAU,EAAE;AAE7C,QAAI,eAAe,cAAc,UAAU,OAAO;AAEhD,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,KAAK,oBAAoB,OAAO,KAAK;AACtD,UAAM,aAAa,IAAI,WAAW;AAElC,WAAO,aAAa;AAAA,EACtB;AACF;;;AC3yBO,IAAM,gCAAN,MAAoC;AAAA,EAH3C,OAG2C;AAAA;AAAA;AAAA,EACzC,OAAO,gBACL,YACA,gBACA,gBACA,iBACA,iBACgB;AAChB,QAAI,mBAAmB,iBAAiB;AACtC,mBAAa,KAAK,qBAAqB,YAAY,iBAAiB,eAAe;AAAA,IACrF;AACA,WAAO,WAAW,IAAI,CAAC,UAAU,KAAK,gBAAgB,OAAO,gBAAgB,cAAc,CAAC;AAAA,EAC9F;AAAA,EAEA,OAAe,qBACb,YACA,iBACA,iBACa;AACb,WAAO,WAAW,IAAI,CAAC,UAAU;AAC/B,YAAM,eAAe,EAAE,GAAG,MAAM;AAEhC,UAAI,aAAa,QAAQ;AACvB,qBAAa,WAAW,iBAAiB,IAAI,aAAa,MAAM,KAAK;AACrE,qBAAa,WAAW,iBAAiB,IAAI,aAAa,MAAM,KAAK;AAAA,MACvE;AAEA,UAAI,aAAa,WAAW;AAC1B,qBAAa,YAAY,aAAa,UAAU,IAAI,CAAC,cAAc;AAAA,UACjE,GAAG;AAAA,UACH,UAAU,iBAAiB,IAAI,SAAS,MAAM,KAAK;AAAA,UACnD,UAAU,iBAAiB,IAAI,SAAS,MAAM,KAAK;AAAA,QACrD,EAAE;AAAA,MACJ;AAEA,UAAI,aAAa,UAAU;AACzB,qBAAa,WAAW,KAAK;AAAA,UAC3B,aAAa;AAAA,UACb;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,OAAe,gBACb,OACA,gBACA,gBACc;AACd,QAAI,MAAM,aAAa,cAAc,MAAM,WAAW;AACpD,aAAO,KAAK,oBAAoB,OAAO,gBAAgB,cAAc;AAAA,IACvE;AAEA,QAAI,MAAM,aAAa,WAAW,MAAM,aAAa,WAAW;AAC9D,aAAO,KAAK,qBAAqB,OAAO,gBAAgB,cAAc;AAAA,IACxE;AAEA,UAAM,YAA0B;AAAA,MAC9B,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,MAClC,MAAO,MAAM,QAAgB;AAAA,MAC7B,OAAO,KAAK,cAAc,KAAK;AAAA,MAC/B,SAAS,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,MACzD,UAAU,MAAM,UAAU;AAAA,QAAI,CAAC,UAC7B,KAAK,gBAAgB,OAAoB,gBAAgB,cAAc;AAAA,MACzE;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,qBACb,OACA,gBACA,gBACc;AACd,QAAI,CAAC,MAAM,QAAQ;AACjB,aAAO;AAAA,QACL,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,QAClC,MAAO,MAAM,QAAgB;AAAA,QAC7B,OAAO,MAAM,SAAS,CAAC;AAAA,QACvB,SAAS,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,QACzD,UAAU,MAAM,UAAU;AAAA,UAAI,CAAC,UAC7B,KAAK,gBAAgB,OAAoB,gBAAgB,cAAc;AAAA,QACzE;AAAA,MACF;AAAA,IACF;AAEA,UAAM,gBAAgB,MAAM,YAAY;AACxC,UAAM,gBAAgB,MAAM,YAAY;AAExC,QAAI,UAAU,MAAM,QAAQ,MAAM,OAAO,IAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC;AAEnE,QAAI,MAAM,aAAa,SAAS;AAC9B,UAAI,eAAe;AACjB,eAAO;AAAA,UACL,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,UAClC,MAAM;AAAA,UACN,OAAO,CAAC;AAAA,UACR,SAAS,CAAC;AAAA,UACV,UAAU,CAAC;AAAA,QACb;AAAA,MACF,WAAW,CAAC,eAAe;AACzB,kBAAU,QAAQ,IAAI,CAAC,UAAe;AAAA,UACpC,GAAG;AAAA,UACH,QAAQ,EAAE,GAAG,KAAK,QAAQ,MAAM,KAAK;AAAA,QACvC,EAAE;AAEF,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,OAAO,EAAE,SAAS,MAAM,OAAO;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF,WAAW,MAAM,aAAa,WAAW;AACvC,UAAI,eAAe;AACjB,eAAO;AAAA,UACL,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,UAClC,MAAM;AAAA,UACN,OAAO,CAAC;AAAA,UACR,SAAS,CAAC;AAAA,UACV,UAAU,CAAC;AAAA,QACb;AAAA,MACF,WAAW,CAAC,eAAe;AACzB,kBAAU,QAAQ,IAAI,CAAC,UAAe;AAAA,UACpC,GAAG;AAAA,UACH,QAAQ,EAAE,GAAG,KAAK,QAAQ,QAAQ,KAAK;AAAA,QACzC,EAAE;AAEF,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,OAAO,EAAE,SAAS,MAAM,OAAO;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF;AAEA,UAAM,YAA0B;AAAA,MAC9B,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,MAClC,MAAO,MAAM,QAAgB;AAAA,MAC7B,OAAO,KAAK,cAAc,KAAK;AAAA,MAC/B;AAAA,MACA,UAAU,MAAM,UAAU;AAAA,QAAI,CAAC,UAC7B,KAAK,gBAAgB,OAAoB,gBAAgB,cAAc;AAAA,MACzE;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,oBACb,OACA,gBACA,gBACc;AACd,QAAI,CAAC,MAAM,WAAW;AACpB,aAAO;AAAA,QACL,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,QAClC,MAAO,MAAM,QAAgB;AAAA,QAC7B,OAAO,MAAM,SAAS,CAAC;AAAA,QACvB,SAAS,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,QACzD,UAAU,CAAC;AAAA,MACb;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,wBAAwB,MAAM,SAAS;AAE5D,WAAO;AAAA,MACL,IAAI,MAAM,MAAM,OAAO,WAAW;AAAA,MAClC,MAAO,MAAM,QAAgB;AAAA,MAC7B,OAAO,MAAM,SAAS,CAAC;AAAA,MACvB,SAAS,MAAM,QAAQ,OAAO,IAAI,UAAU,CAAC;AAAA,MAC7C,UACE,MAAM,UAAU,IAAI,CAAC,UAAU,KAAK,gBAAgB,OAAoB,gBAAgB,cAAc,CAAC,KAAK,CAAC;AAAA,IACjH;AAAA,EACF;AAAA,EAEA,OAAe,wBAAwB,WAA8B;AACnE,UAAM,UAAiB,CAAC;AAExB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,WAAW,UAAU,CAAC;AAE5B,YAAM,gBAAgB,KAAK,kBAAkB,WAAW,CAAC;AAEzD,YAAM,cAAc,KAAK,kBAAkB,UAAU,aAAa;AAClE,UAAI,aAAa;AACf,YAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,kBAAQ,KAAK,GAAG,WAAW;AAAA,QAC7B,OAAO;AACL,kBAAQ,KAAK,WAAW;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,KAAK,cAAc,OAAO;AAEjD,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,cAAc,SAAuB;AAClD,UAAM,WAAW,QAAQ,OAAO,CAAC,SAAS,SAAS,QAAQ,SAAS,MAAS;AAE7E,UAAM,UAAiB,CAAC;AAExB,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,UAAU,SAAS,CAAC;AAE1B,UAAI,QAAQ,SAAS,UAAU,QAAQ,SAAS,KAAK;AACnD,cAAM,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAE3C,YACE,MAAM,KACN,MAAM,SAAS,SAAS,KACvB,YAAY,SAAS,SAAS,UAAU,SAAS,SAAS,OAC1D,YAAY,SAAS,SAAS,eAC/B;AACA;AAAA,QACF;AAAA,MACF;AAEA,UAAI,QAAQ,SAAS,eAAe;AAClC,cAAM,WAAW,IAAI,IAAI,SAAS,SAAS,SAAS,IAAI,CAAC,IAAI;AAE7D,gBAAQ,KAAK,OAAO;AAEpB,YAAI,YAAY,SAAS,SAAS,UAAU,SAAS,SAAS,OAAO,SAAS,SAAS,eAAe;AACpG,kBAAQ,KAAK;AAAA,YACX,MAAM;AAAA,YACN,MAAM;AAAA,YACN,QAAQ,CAAC;AAAA,UACX,CAAC;AAAA,QACH;AAEA;AAAA,MACF;AAEA,cAAQ,KAAK,OAAO;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,kBAAkB,WAAuB,cAA+B;AACrF,UAAM,cAAc,UAAU,YAAY;AAE1C,QAAI,YAAY,SAAS,aAAa;AACpC,aAAO;AAAA,IACT;AAEA,aAAS,IAAI,eAAe,GAAG,IAAI,UAAU,QAAQ,KAAK;AACxD,YAAM,WAAW,UAAU,CAAC;AAE5B,UAAI,SAAS,WAAW,YAAY,WAAW,SAAS,SAAS,WAAW,SAAS,SAAS,YAAY;AACxG,eAAO;AAAA,MACT;AAEA,UAAI,SAAS,SAAS,eAAe,SAAS,WAAW,YAAY,QAAQ;AAC3E;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,kBAAkB,UAAoB,eAAsC;AACzF,YAAQ,SAAS,MAAM;AAAA,MACrB,KAAK;AACH,YAAI,SAAS,UAAU;AACrB,iBAAO;AAAA,YACL,MAAM;AAAA,YACN,MAAM,SAAS;AAAA,YACf,QAAQ,CAAC;AAAA,UACX;AAAA,QACF,WAAW,SAAS,UAAU;AAC5B,iBAAO;AAAA,QACT,OAAO;AACL,cAAI,SAAS,KAAK,KAAK,MAAM,IAAI;AAC/B,mBAAO;AAAA,cACL,MAAM;AAAA,cACN,MAAM,SAAS;AAAA,cACf,QAAQ,EAAE,iBAAiB,UAAU;AAAA,YACvC;AAAA,UACF,OAAO;AACL,kBAAM,cAAc;AAAA,cAClB,MAAM;AAAA,cACN,MAAM,SAAS;AAAA,cACf,QAAQ,EAAE,MAAM,KAAK;AAAA,YACvB;AAEA,gBAAI,eAAe;AACjB,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,kBACE,MAAM;AAAA,kBACN,OAAO,EAAE,SAAS,SAAS,OAAO;AAAA,gBACpC;AAAA,cACF;AAAA,YACF,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAAA,MAEF,KAAK;AACH,YAAI,SAAS,UAAU;AACrB,iBAAO;AAAA,QACT,WAAW,SAAS,UAAU;AAC5B,iBAAO;AAAA,YACL,MAAM;AAAA,YACN,MAAM,SAAS;AAAA,YACf,QAAQ,CAAC;AAAA,UACX;AAAA,QACF,OAAO;AACL,cAAI,SAAS,KAAK,KAAK,MAAM,IAAI;AAC/B,mBAAO;AAAA,cACL,MAAM;AAAA,cACN,MAAM,SAAS;AAAA,cACf,QAAQ,EAAE,QAAQ,KAAK;AAAA,YACzB;AAAA,UACF,OAAO;AACL,kBAAM,cAAc;AAAA,cAClB,MAAM;AAAA,cACN,MAAM,SAAS;AAAA,cACf,QAAQ,EAAE,QAAQ,KAAK;AAAA,YACzB;AAEA,gBAAI,eAAe;AACjB,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,kBACE,MAAM;AAAA,kBACN,OAAO,EAAE,SAAS,SAAS,OAAO;AAAA,gBACpC;AAAA,cACF;AAAA,YACF,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAAA,MAEF,KAAK;AAAA,MACL;AACE,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM,SAAS;AAAA,UACf,QAAQ,CAAC;AAAA,QACX;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,OAAe,cAAc,OAAuB;AAClD,UAAM,YAAY,MAAM,SAAS,CAAC;AAElC,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,sBAAsB,YAO3B;AACA,QAAI,aAAa;AACjB,QAAI,aAAa;AACjB,QAAI,eAAe;AACnB,QAAI,kBAAkB;AACtB,QAAI,kBAAkB;AACtB,QAAI,iBAAiB;AAErB,UAAM,eAAe,wBAAC,UAAqB;AACzC,UAAI,MAAM,WAAW;AACnB,cAAM,UAAU,QAAQ,CAAC,aAAa;AACpC;AAEA,cAAI,SAAS,SAAS,SAAS;AAC7B;AAAA,UACF,WAAW,SAAS,SAAS,WAAW;AACtC;AAAA,UACF;AAEA,cAAI,SAAS,UAAU;AACrB;AAAA,UACF,WAAW,SAAS,UAAU;AAC5B;AAAA,UACF,WAAW,SAAS,SAAS,aAAa;AACxC;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAEA,UAAI,MAAM,UAAU;AAClB,cAAM,SAAS,QAAQ,CAAC,UAAU,aAAa,KAAkB,CAAC;AAAA,MACpE;AAAA,IACF,GAxBqB;AA0BrB,eAAW,QAAQ,YAAY;AAE/B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AClZS;AAHF,IAAM,kBAAkB,wBAAC,WAA6E;AAC3G,QAAM,gBAAgB,sBAAsB,EAAE,QAAQ,OAAO,OAAO,CAAC;AACrE,MAAI,CAAC,cAAe,QAAO;AAC3B,SAAO,oBAAC,iBAAc,WAAW,GAAG,IAAI,OAAO,SAAS,GAAG;AAC7D,GAJ+B;AAMxB,IAAM,UAAU,wBAAC,WAAyE;AAC/F,QAAM,gBAAgB,cAAc,EAAE,SAAS,OAAO,QAAQ,CAAC;AAC/D,MAAI,CAAC,cAAe,QAAO;AAC3B,SAAO,oBAAC,iBAAc,WAAW,GAAG,IAAI,OAAO,SAAS,GAAG;AAC7D,GAJuB;AAMhB,IAAM,sBAAsB,wBAAC,WAA4D;AAC9F,SAAO,gBAAgB,EAAE,QAAQ,QAAQ,gBAAgB,OAAO,IAAI,GAAG,WAAW,OAAO,UAAU,CAAC;AACtG,GAFmC;AAI5B,IAAM,gBAAgB,wBAAC,WAA6D;AACzF,MAAI,OAAO,QAAQ,SAAS,YAAY;AACtC,UAAM,cAAe,OAAO,QAA6B;AACzD,QAAI,CAAC,YAAa,QAAO;AACzB,WAAO,sBAAsB,EAAE,QAAQ,QAAQ,gBAAgB,WAAW,EAAE,CAAC;AAAA,EAC/E;AAEA,SAAO,sBAAsB,EAAE,QAAQ,QAAQ,WAAW,OAAO,QAAQ,IAAI,EAAE,CAAC;AAClF,GAR6B;AAUtB,IAAM,wBAAwB,wBAAC,WAAiE;AACrG,SAAO,OAAO,OAAO,QAAQ;AAC/B,GAFqC;AAI9B,IAAM,4BAA4B,wBAAC,WAAgD;AACxF,SAAO,sBAAsB,EAAE,QAAQ,QAAQ,gBAAgB,OAAO,IAAI,EAAE,CAAC;AAC/E,GAFyC;","names":["React","z"]}