@intlayer/babel 9.4.4 → 9.5.1

package/dist/esm/babel-plugin-intlayer-field-rename.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"babel-plugin-intlayer-field-rename.mjs","names":[],"sources":["../../src/babel-plugin-intlayer-field-rename.ts"],"sourcesContent":["import type { NodePath, PluginObject } from '@babel/core';\nimport type * as BabelTypes from '@babel/types';\nimport {\n  CHAINABLE_RUNTIME_METHOD_NAMES,\n  INTLAYER_CALLER_NAMES,\n  type IntlayerCallerName,\n  type NestedRenameEntry,\n  type NestedRenameMap,\n  type PruneContext,\n  unwrapAwait,\n} from './babel-plugin-intlayer-usage-analyzer';\n\n// ── Field-name helpers ────────────────────────────────────────────────────────\n\n/**\n * Intlayer internal property names that must never be used as short-name\n * targets. These appear inside content-node values (e.g. `{ nodeType:\n * \"translation\", … }`) and are read by the intlayer runtime.\n */\nconst RESERVED_CONTENT_FIELD_NAMES = new Set(['nodeType']);\n\n/** Alphabet used to derive short field aliases (`a`, `b`, …, `aa`, `ab`, …). */\nconst SHORT_NAME_ALPHABET = 'abcdefghijklmnopqrstuvwxyz';\n\n/**\n * Converts a zero-based index to a short alphabetic identifier.\n *   0 → 'a', 1 → 'b', …, 25 → 'z', 26 → 'aa', 27 → 'ab', …\n */\nexport const generateShortFieldName = (index: number): string => {\n  if (!Number.isInteger(index) || index < 0) {\n    throw new RangeError(\n      `generateShortFieldName expects a non-negative integer index, received: ${index}`\n    );\n  }\n\n  const remainder = index % SHORT_NAME_ALPHABET.length;\n  const quotient = Math.floor(index / SHORT_NAME_ALPHABET.length);\n\n  return quotient === 0 && SHORT_NAME_ALPHABET[remainder]\n    ? SHORT_NAME_ALPHABET[remainder]\n    : generateShortFieldName(quotient - 1) + SHORT_NAME_ALPHABET[remainder];\n};\n\n/**\n * Recursively builds a `NestedRenameMap` from a compiled dictionary content\n * value by traversing the intlayer node structure.\n *\n * Rules:\n *  - If the value has `nodeType: 'translation'`, user-defined fields live\n *    inside `translation[locale]`. Recurse into the first locale's value.\n *  - All other intlayer runtime nodes (enumeration, condition, gender, …) are\n *    treated as leaves — their internal keys must never be renamed.\n *  - Arrays produce an empty children map.  Array elements are not traversed\n *    because consumers may access them via `.map()` / `.filter()` callbacks,\n *    which the source-code rename walk cannot enter.  Renaming element fields\n *    in the JSON without the matching source-code rename would produce\n *    mismatched key names and runtime crashes.\n *    The `[0]` pass-through in `walkRenameChain` is preserved so that direct\n *    indexed access (`field[0].sub`) silently terminates at the empty children\n *    map without breaking anything.\n *  - Plain objects are user-defined records: ALL non-reserved keys are renamed\n *    with short alphabetic aliases (a, b, c, …) and each value is recursed into.\n *  - Primitives produce an empty map (no further renaming).\n *\n * The rename map is built from ALL user-defined fields (not just consumed ones).\n * Both the JSON rename and the source-code rename use the same map, so the\n * short names are always consistent regardless of which fields are pruned.\n *\n * @param contentValue - The dictionary content value to analyse.\n */\nexport const buildNestedRenameMapFromContent = (\n  contentValue: unknown\n): NestedRenameMap => {\n  if (\n    !contentValue ||\n    typeof contentValue !== 'object' ||\n    Array.isArray(contentValue)\n  ) {\n    return new Map();\n  }\n\n  const record = contentValue as Record<string, unknown>;\n\n  // Any object with `nodeType: string` is an intlayer runtime node.\n  if (typeof record.nodeType === 'string') {\n    // Translation node: user-defined fields live inside translation[locale].\n    if (\n      record.nodeType === 'translation' &&\n      record.translation &&\n      typeof record.translation === 'object' &&\n      !Array.isArray(record.translation)\n    ) {\n      const firstLocaleValue = Object.values(\n        record.translation as Record<string, unknown>\n      )[0];\n      return buildNestedRenameMapFromContent(firstLocaleValue);\n    }\n\n    // All other intlayer nodes (enumeration, pluralization, conditions, …)\n    // resolve to a single value at runtime through a call the source-code\n    // rename walk cannot traverse (e.g. `content.myEnum(count)`), and the\n    // JSON renamers only descend into translation nodes. Treat them as\n    // leaves so the source and JSON sides always stay consistent.\n    return new Map();\n  }\n\n  // Exclude React elements from being treated as user-defined records.\n  // JSX elements in the compiled JSON have a $$typeof property (usually Symbol(react.element)).\n  if (\n    record.$$typeof ||\n    (record.type && record.props && Object.hasOwn(record, 'ref'))\n  ) {\n    return new Map();\n  }\n\n  // User-defined record: rename ALL non-reserved keys with stable alphabetic\n  // aliases sorted alphabetically so the mapping is deterministic.\n  const sortedKeys = Object.keys(record)\n    .filter((key) => !RESERVED_CONTENT_FIELD_NAMES.has(key))\n    .sort();\n\n  const renameMap: NestedRenameMap = new Map();\n\n  for (let i = 0; i < sortedKeys.length; i++) {\n    const key = sortedKeys[i];\n\n    if (!key) continue;\n\n    const children = buildNestedRenameMapFromContent(record[key]);\n\n    renameMap.set(key, { shortName: generateShortFieldName(i), children });\n  }\n\n  return renameMap;\n};\n\n/**\n * Walks `fieldPath` through a {@link NestedRenameMap} and returns the entry at\n * the final path segment, or `undefined` when any segment is missing (e.g. the\n * path crosses an array or leaf value whose children are not mapped).\n *\n * Used to locate the rename entry of an opaquely-consumed content value so its\n * children map can be cleared before the JSON rename is applied.\n *\n * @param renameMap - The root rename map to walk.\n * @param fieldPath - Original (pre-rename) field names from the content root.\n */\nexport const getNestedRenameEntryAtPath = (\n  renameMap: NestedRenameMap,\n  fieldPath: readonly string[]\n): NestedRenameEntry | undefined => {\n  let currentRenameMap = renameMap;\n  let renameEntry: NestedRenameEntry | undefined;\n\n  for (const fieldName of fieldPath) {\n    renameEntry = currentRenameMap.get(fieldName);\n    if (!renameEntry) return undefined;\n    currentRenameMap = renameEntry.children;\n  }\n\n  return renameEntry;\n};\n\n// ── Serialisation for non-Babel consumers ─────────────────────────────────────\n\n/**\n * JSON-serialisable form of a {@link NestedRenameEntry}.\n *\n * Mirrors `FieldRenameNode` in the `@intlayer/swc` crate — both sides must stay\n * in sync.\n */\nexport type SerializedFieldRenameEntry = {\n  /** Short alphabetic alias the field is renamed to (`'a'`, `'b'`, …). */\n  shortName: string;\n  /** Rename table of the fields nested inside this one. */\n  children: SerializedFieldRenameMap;\n};\n\n/** JSON-serialisable form of a {@link NestedRenameMap}. */\nexport type SerializedFieldRenameMap = Record<\n  string,\n  SerializedFieldRenameEntry\n>;\n\n/** Recursively converts a {@link NestedRenameMap} to its serialisable form. */\nconst serializeNestedRenameMap = (\n  renameMap: NestedRenameMap\n): SerializedFieldRenameMap => {\n  const serialized: SerializedFieldRenameMap = {};\n\n  for (const [fieldName, renameEntry] of renameMap) {\n    serialized[fieldName] = {\n      shortName: renameEntry.shortName,\n      children: serializeNestedRenameMap(renameEntry.children),\n    };\n  }\n\n  return serialized;\n};\n\n/**\n * Converts the field-rename tables of a {@link PruneContext} into a plain JSON\n * object, keyed by dictionary key.\n *\n * Consumed by bundler integrations that cannot run the Babel rename plugin and\n * must forward the tables to another transformer — currently the `@intlayer/swc`\n * Wasm plugin used by Next.js, which rewrites the source accesses itself.\n *\n * Dictionaries flagged as structural edge cases are omitted: the JSON pipeline\n * leaves them untouched, so their source accesses must stay untouched too.\n * Empty tables are omitted as well, so the result is empty when there is\n * nothing to rename.\n */\nexport const serializeFieldRenameMap = (\n  pruneContext: PruneContext\n): Record<string, SerializedFieldRenameMap> => {\n  const serialized: Record<string, SerializedFieldRenameMap> = {};\n\n  for (const [\n    dictionaryKey,\n    renameMap,\n  ] of pruneContext.dictionaryKeyToFieldRenameMap) {\n    if (renameMap.size === 0) continue;\n    if (pruneContext.dictionariesWithEdgeCases.has(dictionaryKey)) continue;\n\n    serialized[dictionaryKey] = serializeNestedRenameMap(renameMap);\n  }\n\n  return serialized;\n};\n\n// ── Field-rename Babel plugin ─────────────────────────────────────────────────\n\n/**\n * Walks a MemberExpression chain starting from `startPath`, renaming each\n * property found in `currentRenameMap` at the corresponding nesting level.\n *\n * Numeric computed accesses (array indices such as `[0]`, `[1]`) are treated\n * as transparent pass-throughs: the rename map is kept unchanged and the walk\n * continues past the index.  This means `content.field[0].sub` is handled\n * correctly — `field` and `sub` are both renamed while `[0]` is left intact.\n */\nconst walkRenameChain = (\n  babelTypes: typeof BabelTypes,\n  startPath: NodePath<BabelTypes.Node>,\n  currentRenameMap: NestedRenameMap\n): {\n  finalPath: NodePath<BabelTypes.Node>;\n  finalRenameMap: NestedRenameMap;\n} => {\n  let refPath: NodePath<BabelTypes.Node> = startPath;\n  let renameMap = currentRenameMap;\n\n  while (true) {\n    const parentPath = refPath.parentPath;\n    if (!parentPath) break;\n\n    const parentNode = parentPath.node;\n\n    if (\n      (!babelTypes.isMemberExpression(parentNode) &&\n        !babelTypes.isOptionalMemberExpression(parentNode)) ||\n      (parentNode as BabelTypes.MemberExpression).object !== refPath.node\n    ) {\n      break;\n    }\n\n    const memberNode = parentNode as BabelTypes.MemberExpression;\n\n    // Numeric index access ([0], [1], …): advance past the array accessor\n    // without touching the rename map.  The next iteration will attempt to\n    // rename the property that follows the index.\n    if (\n      memberNode.computed &&\n      babelTypes.isNumericLiteral(memberNode.property)\n    ) {\n      refPath = parentPath;\n      continue;\n    }\n\n    // Nothing left to rename at this level — stop.\n    if (renameMap.size === 0) break;\n\n    let fieldName: string | undefined;\n\n    if (!memberNode.computed && babelTypes.isIdentifier(memberNode.property)) {\n      fieldName = memberNode.property.name;\n    } else if (\n      memberNode.computed &&\n      babelTypes.isStringLiteral(memberNode.property)\n    ) {\n      fieldName = memberNode.property.value;\n    } else {\n      break; // dynamic computed key – stop\n    }\n\n    const renameEntry = renameMap.get(fieldName);\n    if (!renameEntry) break; // not in map – stop\n\n    // Apply the rename\n    if (!memberNode.computed && babelTypes.isIdentifier(memberNode.property)) {\n      memberNode.property.name = renameEntry.shortName;\n    } else if (\n      memberNode.computed &&\n      babelTypes.isStringLiteral(memberNode.property)\n    ) {\n      memberNode.property.value = renameEntry.shortName;\n    }\n\n    refPath = parentPath;\n    renameMap = renameEntry.children;\n  }\n\n  return { finalPath: refPath, finalRenameMap: renameMap };\n};\n\n/**\n * Renames the properties of a destructuring `ObjectPattern` using `renameMap`,\n * recursing into nested patterns and following the references of bound local\n * variables.\n *\n * Handled property shapes:\n *\n *   { fieldA }              → { shortA: fieldA }\n *   { fieldA: localVar }    → { shortA: localVar }\n *   { fieldA = fallback }   → { shortA: fieldA = fallback }\n *   { fieldA: { nested } }  → { shortA: { shortN: nested } }\n *   { ['fieldA']: x }       → { ['shortA']: x }\n *   { [dynamicKey]: x }     → left untouched (dynamic key – not renamable)\n *\n * @param babelTypes - Babel types helper.\n * @param objectPattern - The destructuring pattern to rename.\n * @param scopePath - A path whose scope resolves the pattern's bindings.\n * @param renameMap - Rename table for the current nesting level.\n */\nconst renameObjectPatternProperties = (\n  babelTypes: typeof BabelTypes,\n  objectPattern: BabelTypes.ObjectPattern,\n  scopePath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  for (const property of objectPattern.properties) {\n    if (!babelTypes.isObjectProperty(property)) continue;\n\n    // Computed keys: a static string key ({ ['title']: x }) is renamable in\n    // place; any other computed key is dynamic and must be left untouched —\n    // replacing it with an identifier would create a variable reference.\n    if (property.computed && !babelTypes.isStringLiteral(property.key)) {\n      continue;\n    }\n\n    const keyName = babelTypes.isIdentifier(property.key)\n      ? property.key.name\n      : babelTypes.isStringLiteral(property.key)\n        ? property.key.value\n        : null;\n    if (!keyName) continue;\n\n    const renameEntry = renameMap.get(keyName);\n    if (!renameEntry) continue;\n\n    if (property.computed) {\n      // { ['fieldA']: x } → { ['shortA']: x }\n      (property.key as BabelTypes.StringLiteral).value = renameEntry.shortName;\n    } else {\n      // { fieldA } → { shortA: fieldA }\n      // { fieldA: localVar } → { shortA: localVar }\n      if (property.shorthand) {\n        property.shorthand = false;\n      }\n      property.key = babelTypes.identifier(renameEntry.shortName);\n    }\n\n    if (renameEntry.children.size === 0) continue;\n\n    // A default value ({ fieldA = fallback }) wraps the actual binding target.\n    const bindingTarget = babelTypes.isAssignmentPattern(property.value)\n      ? property.value.left\n      : property.value;\n\n    // Nested pattern:  const { fieldA: { nested } } = …  — rename its keys\n    // with this entry's children map.\n    if (babelTypes.isObjectPattern(bindingTarget)) {\n      renameObjectPatternProperties(\n        babelTypes,\n        bindingTarget,\n        scopePath,\n        renameEntry.children\n      );\n      continue;\n    }\n\n    // Identifier binding: recursively walk references to the local variable.\n    if (babelTypes.isIdentifier(bindingTarget)) {\n      const localVarBinding = scopePath.scope.getBinding(bindingTarget.name);\n      if (!localVarBinding) continue;\n\n      for (const nestedRefPath of localVarBinding.referencePaths) {\n        const { finalPath, finalRenameMap } = walkRenameChain(\n          babelTypes,\n          nestedRefPath,\n          renameEntry.children\n        );\n        walkObjectDestructuring(babelTypes, finalPath, finalRenameMap);\n      }\n    }\n  }\n};\n\n/**\n * Walks an object-destructuring assignment whose right-hand side is `refPath`,\n * renaming each destructured key that is found in `renameMap`.\n *\n * Handles the \"secondary destructuring\" pattern that `walkRenameChain` cannot\n * reach because the reference is not a MemberExpression:\n *\n *   const { webhooksSection } = useIntlayer('build-settings');\n *   const { modal, validationErrors } = webhooksSection;\n *     → const { a: modal, b: validationErrors } = webhooksSection;\n *\n * After renaming each key, {@link renameObjectPatternProperties} recursively\n * walks references to the newly-bound local variables, calling both\n * `walkRenameChain` (for subsequent member-access chains like\n * `validationErrors.invalidUrl`) and this function again (for further levels\n * of secondary destructuring).\n */\nconst walkObjectDestructuring = (\n  babelTypes: typeof BabelTypes,\n  refPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  if (renameMap.size === 0) return;\n\n  const parentNode = refPath.parent;\n\n  // Only handle:  const { a, b } = refVar\n  if (\n    !babelTypes.isVariableDeclarator(parentNode) ||\n    !babelTypes.isObjectPattern(parentNode.id) ||\n    parentNode.init !== refPath.node\n  ) {\n    return;\n  }\n\n  renameObjectPatternProperties(babelTypes, parentNode.id, refPath, renameMap);\n};\n\n/**\n * Renames every field access reachable from `rootPath`, whose value is the\n * dictionary content root.\n *\n * Combines the three ways a content root is consumed: a member-access chain,\n * a destructuring assignment, and a chainable runtime helper such as\n * `.onChange(cb)`.\n */\nconst renameContentConsumers = (\n  babelTypes: typeof BabelTypes,\n  rootPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  const { finalPath, finalRenameMap } = walkRenameChain(\n    babelTypes,\n    rootPath,\n    renameMap\n  );\n  walkObjectDestructuring(babelTypes, finalPath, finalRenameMap);\n  renameChainedRuntimeCall(babelTypes, finalPath, finalRenameMap);\n};\n\n/**\n * Handles `content.onChange(cb)` — a runtime subscription rather than a field\n * access (see {@link CHAINABLE_RUNTIME_METHOD_NAMES}).\n *\n * `walkRenameChain` stops at `onChange` because it is absent from the rename\n * map, which would leave the callback body reading the original field names\n * while the compiled JSON has already been renamed. This restarts the rename\n * walk on both sides of the call:\n *\n *   - the callback's first parameter receives the same content root, so its\n *     accesses are renamed with the same map;\n *   - the helper returns the content object, so the chain continues past it.\n *\n * @param refPath - Path whose value is the content root (the object the\n *   chainable method would be called on).\n */\nconst renameChainedRuntimeCall = (\n  babelTypes: typeof BabelTypes,\n  refPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  if (renameMap.size === 0) return;\n\n  const memberPath = refPath.parentPath;\n  if (!memberPath) return;\n\n  const memberNode = memberPath.node;\n  if (\n    (!babelTypes.isMemberExpression(memberNode) &&\n      !babelTypes.isOptionalMemberExpression(memberNode)) ||\n    (memberNode as BabelTypes.MemberExpression).object !== refPath.node\n  ) {\n    return;\n  }\n\n  const propertyNode = (memberNode as BabelTypes.MemberExpression).property;\n  const methodName = (memberNode as BabelTypes.MemberExpression).computed\n    ? babelTypes.isStringLiteral(propertyNode)\n      ? propertyNode.value\n      : undefined\n    : babelTypes.isIdentifier(propertyNode)\n      ? propertyNode.name\n      : undefined;\n\n  if (!methodName || !CHAINABLE_RUNTIME_METHOD_NAMES.has(methodName)) return;\n\n  const callPath = memberPath.parentPath;\n  if (!callPath) return;\n  if (!callPath.isCallExpression() && !callPath.isOptionalCallExpression()) {\n    return;\n  }\n  if ((callPath.node as BabelTypes.CallExpression).callee !== memberNode) {\n    return;\n  }\n\n  const argumentPaths = callPath.get(\n    'arguments'\n  ) as NodePath<BabelTypes.Node>[];\n\n  for (const argumentPath of argumentPaths) {\n    if (\n      !argumentPath.isArrowFunctionExpression() &&\n      !argumentPath.isFunctionExpression()\n    ) {\n      continue;\n    }\n\n    const [firstParameterPath] = argumentPath.get(\n      'params'\n    ) as NodePath<BabelTypes.Node>[];\n    if (!firstParameterPath) continue;\n\n    // ({ title }) => … — destructured directly in the parameter list.\n    if (firstParameterPath.isObjectPattern()) {\n      renameObjectPatternProperties(\n        babelTypes,\n        firstParameterPath.node,\n        argumentPath,\n        renameMap\n      );\n      continue;\n    }\n\n    // (content) => … — rename each access on the parameter.\n    if (!firstParameterPath.isIdentifier()) continue;\n\n    const parameterBinding = argumentPath.scope.getBinding(\n      firstParameterPath.node.name\n    );\n    if (!parameterBinding) continue;\n\n    for (const parameterRefPath of parameterBinding.referencePaths) {\n      renameContentConsumers(babelTypes, parameterRefPath, renameMap);\n    }\n  }\n\n  // The helper returns the content object itself, so keep walking past it —\n  // both when the result is used inline and when it is stored in a variable\n  // (`const content = useIntlayer('key').onChange(cb)`).\n  renameContentConsumers(babelTypes, callPath, renameMap);\n\n  const declaratorNode = callPath.parent;\n  if (\n    babelTypes.isVariableDeclarator(declaratorNode) &&\n    babelTypes.isIdentifier(declaratorNode.id) &&\n    declaratorNode.init === callPath.node\n  ) {\n    const resultBinding = callPath.scope.getBinding(declaratorNode.id.name);\n    for (const resultRefPath of resultBinding?.referencePaths ?? []) {\n      renameContentConsumers(babelTypes, resultRefPath, renameMap);\n    }\n  }\n};\n\n/**\n * Collects the local aliases under which `useIntlayer` / `getIntlayer` are\n * imported in the given program (e.g. `import { useIntlayer as useI } …`\n * yields `useI` → `useIntlayer`).\n *\n * Import declarations can only appear at the top level of a module, so the\n * program body is scanned directly instead of traversing the whole AST.\n */\nconst collectIntlayerCallerLocalNames = (\n  babelTypes: typeof BabelTypes,\n  programNode: BabelTypes.Program\n): Map<string, string> => {\n  const intlayerCallerLocalNameMap = new Map<string, string>();\n\n  for (const statement of programNode.body) {\n    if (!babelTypes.isImportDeclaration(statement)) continue;\n\n    for (const importSpecifier of statement.specifiers) {\n      if (!babelTypes.isImportSpecifier(importSpecifier)) continue;\n\n      const importedName = babelTypes.isIdentifier(importSpecifier.imported)\n        ? importSpecifier.imported.name\n        : importSpecifier.imported.value;\n\n      if (INTLAYER_CALLER_NAMES.includes(importedName as IntlayerCallerName)) {\n        intlayerCallerLocalNameMap.set(\n          importSpecifier.local.name,\n          importedName\n        );\n      }\n    }\n  }\n\n  return intlayerCallerLocalNameMap;\n};\n\n/**\n * Rewrites dictionary content field accesses in the given program to the\n * short aliases defined in `pruneContext.dictionaryKeyToFieldRenameMap`.\n *\n * Handled patterns (mirrors the usage analyser):\n *\n *   const { fieldA, fieldB } = useIntlayer('key')\n *     → const { shortA: fieldA, shortB: fieldB } = useIntlayer('key')\n *\n *   useIntlayer('key').fieldA\n *     → useIntlayer('key').shortA\n *\n *   const result = useIntlayer('key');  result.fieldA\n *     → const result = useIntlayer('key');  result.shortA\n *\n *   const { fieldA } = useIntlayer('key');\n *   const { nested } = fieldA;          // secondary destructuring\n *     → const { shortA: fieldA } = useIntlayer('key');\n *       const { shortN: nested } = fieldA;\n *\n * Exposed as a standalone function so that both\n * {@link makeFieldRenameBabelPlugin} and `intlayerMinifyBabelPlugin` can\n * invoke it from their own `Program.exit` visitors.\n */\nexport const renameIntlayerFieldAccesses = (\n  babelTypes: typeof BabelTypes,\n  programPath: NodePath<BabelTypes.Program>,\n  pruneContext: PruneContext\n): void => {\n  if (pruneContext.dictionaryKeyToFieldRenameMap.size === 0) return;\n\n  const intlayerCallerLocalNameMap = collectIntlayerCallerLocalNames(\n    babelTypes,\n    programPath.node\n  );\n  if (intlayerCallerLocalNameMap.size === 0) return;\n\n  // Visit all useIntlayer / getIntlayer call-sites and rename field accesses\n  programPath.traverse({\n    CallExpression: (callExpressionPath) => {\n      const calleeNode = callExpressionPath.node.callee;\n      let localCallerName: string | undefined;\n\n      if (babelTypes.isIdentifier(calleeNode)) {\n        localCallerName = calleeNode.name;\n      } else if (\n        babelTypes.isMemberExpression(calleeNode) &&\n        babelTypes.isIdentifier(calleeNode.property)\n      ) {\n        localCallerName = calleeNode.property.name;\n      }\n\n      if (!localCallerName || !intlayerCallerLocalNameMap.has(localCallerName))\n        return;\n\n      const callArguments = callExpressionPath.node.arguments;\n      if (callArguments.length === 0) return;\n\n      const firstArgument = callArguments[0];\n      let dictionaryKey: string | undefined;\n\n      if (babelTypes.isStringLiteral(firstArgument)) {\n        dictionaryKey = firstArgument.value;\n      } else if (\n        babelTypes.isTemplateLiteral(firstArgument) &&\n        firstArgument.expressions.length === 0 &&\n        firstArgument.quasis.length === 1 &&\n        firstArgument.quasis[0]\n      ) {\n        dictionaryKey =\n          firstArgument.quasis[0].value.cooked ??\n          firstArgument.quasis[0].value.raw;\n      }\n\n      if (!dictionaryKey) return;\n\n      // Dictionaries flagged as structural edge cases are left completely\n      // untouched by the JSON pipeline — keep their source accesses untouched\n      // too so both sides stay consistent.\n      if (pruneContext.dictionariesWithEdgeCases.has(dictionaryKey)) return;\n\n      const fieldRenameMap =\n        pruneContext.dictionaryKeyToFieldRenameMap.get(dictionaryKey);\n      if (!fieldRenameMap || fieldRenameMap.size === 0) return;\n\n      // `getIntlayerAsync('key')` is consumed through its `await`, so the\n      // content root is the await expression — the three cases below would\n      // otherwise only ever see an `AwaitExpression` parent.\n      const contentRootPath = unwrapAwait(babelTypes, callExpressionPath);\n      const parentNode = contentRootPath.parent;\n\n      // ── Case 1: const { fieldA, fieldB } = useIntlayer('key') ────────\n      if (\n        babelTypes.isVariableDeclarator(parentNode) &&\n        babelTypes.isObjectPattern(parentNode.id)\n      ) {\n        walkObjectDestructuring(babelTypes, contentRootPath, fieldRenameMap);\n        return;\n      }\n\n      // ── Case 2: useIntlayer('key').fieldA.nested ─────────────────────\n      //           (also useIntlayer('key').onChange(cb))\n      if (\n        (babelTypes.isMemberExpression(parentNode) ||\n          babelTypes.isOptionalMemberExpression(parentNode)) &&\n        (parentNode as BabelTypes.MemberExpression).object ===\n          contentRootPath.node\n      ) {\n        renameContentConsumers(babelTypes, contentRootPath, fieldRenameMap);\n        return;\n      }\n\n      // ── Case 3: const result = useIntlayer('key'); result.fieldA ─────\n      if (\n        babelTypes.isVariableDeclarator(parentNode) &&\n        babelTypes.isIdentifier(parentNode.id)\n      ) {\n        const variableBinding = callExpressionPath.scope.getBinding(\n          parentNode.id.name\n        );\n        if (!variableBinding) return;\n\n        for (const variableReferencePath of variableBinding.referencePaths) {\n          // Direct access: result.fieldA, const { fieldA } = result, or the\n          // chainable result.onChange(cb)\n          renameContentConsumers(\n            babelTypes,\n            variableReferencePath,\n            fieldRenameMap\n          );\n\n          // Signal accessor: result().fieldA or const { fieldA } = result()\n          // walkRenameChain stops at a CallExpression parent, so we need to\n          // start a new walk from the call-expression node itself.\n          const refParent = variableReferencePath.parent;\n          if (\n            (babelTypes.isCallExpression(refParent) ||\n              babelTypes.isOptionalCallExpression(refParent)) &&\n            (refParent as BabelTypes.CallExpression).callee ===\n              variableReferencePath.node\n          ) {\n            const callPath = variableReferencePath.parentPath;\n            if (callPath) {\n              renameContentConsumers(babelTypes, callPath, fieldRenameMap);\n            }\n          }\n        }\n      }\n    },\n  });\n};\n\n/**\n * Creates a Babel plugin that rewrites dictionary content field accesses in\n * source files to their short aliases via\n * {@link renameIntlayerFieldAccesses}.\n *\n * This plugin must run in a separate `transformAsync` pass **before**\n * `intlayerOptimizeBabelPlugin`, because the latter replaces `useIntlayer`\n * with `useDictionary`, erasing the dictionary-key information needed here.\n */\nexport const makeFieldRenameBabelPlugin =\n  (pruneContext: PruneContext) =>\n  ({ types: babelTypes }: { types: typeof BabelTypes }): PluginObject => ({\n    name: 'intlayer-field-rename',\n    visitor: {\n      Program: {\n        exit: (programPath) => {\n          renameIntlayerFieldAccesses(babelTypes, programPath, pruneContext);\n        },\n      },\n    },\n  });\n"],"mappings":";;;;;;;;AAmBA,MAAM,+CAA+B,IAAI,IAAI,CAAC,UAAU,CAAC;;AAGzD,MAAM,sBAAsB;;;;;AAM5B,MAAa,0BAA0B,UAA0B;CAC/D,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GACtC,MAAM,IAAI,WACR,0EAA0E,OAC5E;CAGF,MAAM,YAAY,QAAQ;CAC1B,MAAM,WAAW,KAAK,MAAM,QAAQ,EAA0B;CAE9D,OAAO,aAAa,KAAK,oBAAoB,aACzC,oBAAoB,aACpB,uBAAuB,WAAW,CAAC,IAAI,oBAAoB;AACjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,MAAa,mCACX,iBACoB;CACpB,IACE,CAAC,gBACD,OAAO,iBAAiB,YACxB,MAAM,QAAQ,YAAY,GAE1B,uBAAO,IAAI,IAAI;CAGjB,MAAM,SAAS;CAGf,IAAI,OAAO,OAAO,aAAa,UAAU;EAEvC,IACE,OAAO,aAAa,iBACpB,OAAO,eACP,OAAO,OAAO,gBAAgB,YAC9B,CAAC,MAAM,QAAQ,OAAO,WAAW,GACjC;GACA,MAAM,mBAAmB,OAAO,OAC9B,OAAO,WACT,CAAC,CAAC;GACF,OAAO,gCAAgC,gBAAgB;EACzD;EAOA,uBAAO,IAAI,IAAI;CACjB;CAIA,IACE,OAAO,YACN,OAAO,QAAQ,OAAO,SAAS,OAAO,OAAO,QAAQ,KAAK,GAE3D,uBAAO,IAAI,IAAI;CAKjB,MAAM,aAAa,OAAO,KAAK,MAAM,CAAC,CACnC,QAAQ,QAAQ,CAAC,6BAA6B,IAAI,GAAG,CAAC,CAAC,CACvD,KAAK;CAER,MAAM,4BAA6B,IAAI,IAAI;CAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,WAAW;EAEvB,IAAI,CAAC,KAAK;EAEV,MAAM,WAAW,gCAAgC,OAAO,IAAI;EAE5D,UAAU,IAAI,KAAK;GAAE,WAAW,uBAAuB,CAAC;GAAG;EAAS,CAAC;CACvE;CAEA,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,8BACX,WACA,cACkC;CAClC,IAAI,mBAAmB;CACvB,IAAI;CAEJ,KAAK,MAAM,aAAa,WAAW;EACjC,cAAc,iBAAiB,IAAI,SAAS;EAC5C,IAAI,CAAC,aAAa,OAAO;EACzB,mBAAmB,YAAY;CACjC;CAEA,OAAO;AACT;;AAwBA,MAAM,4BACJ,cAC6B;CAC7B,MAAM,aAAuC,CAAC;CAE9C,KAAK,MAAM,CAAC,WAAW,gBAAgB,WACrC,WAAW,aAAa;EACtB,WAAW,YAAY;EACvB,UAAU,yBAAyB,YAAY,QAAQ;CACzD;CAGF,OAAO;AACT;;;;;;;;;;;;;;AAeA,MAAa,2BACX,iBAC6C;CAC7C,MAAM,aAAuD,CAAC;CAE9D,KAAK,MAAM,CACT,eACA,cACG,aAAa,+BAA+B;EAC/C,IAAI,UAAU,SAAS,GAAG;EAC1B,IAAI,aAAa,0BAA0B,IAAI,aAAa,GAAG;EAE/D,WAAW,iBAAiB,yBAAyB,SAAS;CAChE;CAEA,OAAO;AACT;;;;;;;;;;AAaA,MAAM,mBACJ,YACA,WACA,qBAIG;CACH,IAAI,UAAqC;CACzC,IAAI,YAAY;CAEhB,OAAO,MAAM;EACX,MAAM,aAAa,QAAQ;EAC3B,IAAI,CAAC,YAAY;EAEjB,MAAM,aAAa,WAAW;EAE9B,IACG,CAAC,WAAW,mBAAmB,UAAU,KACxC,CAAC,WAAW,2BAA2B,UAAU,KAClD,WAA2C,WAAW,QAAQ,MAE/D;EAGF,MAAM,aAAa;EAKnB,IACE,WAAW,YACX,WAAW,iBAAiB,WAAW,QAAQ,GAC/C;GACA,UAAU;GACV;EACF;EAGA,IAAI,UAAU,SAAS,GAAG;EAE1B,IAAI;EAEJ,IAAI,CAAC,WAAW,YAAY,WAAW,aAAa,WAAW,QAAQ,GACrE,YAAY,WAAW,SAAS;OAC3B,IACL,WAAW,YACX,WAAW,gBAAgB,WAAW,QAAQ,GAE9C,YAAY,WAAW,SAAS;OAEhC;EAGF,MAAM,cAAc,UAAU,IAAI,SAAS;EAC3C,IAAI,CAAC,aAAa;EAGlB,IAAI,CAAC,WAAW,YAAY,WAAW,aAAa,WAAW,QAAQ,GACrE,WAAW,SAAS,OAAO,YAAY;OAClC,IACL,WAAW,YACX,WAAW,gBAAgB,WAAW,QAAQ,GAE9C,WAAW,SAAS,QAAQ,YAAY;EAG1C,UAAU;EACV,YAAY,YAAY;CAC1B;CAEA,OAAO;EAAE,WAAW;EAAS,gBAAgB;CAAU;AACzD;;;;;;;;;;;;;;;;;;;;AAqBA,MAAM,iCACJ,YACA,eACA,WACA,cACS;CACT,KAAK,MAAM,YAAY,cAAc,YAAY;EAC/C,IAAI,CAAC,WAAW,iBAAiB,QAAQ,GAAG;EAK5C,IAAI,SAAS,YAAY,CAAC,WAAW,gBAAgB,SAAS,GAAG,GAC/D;EAGF,MAAM,UAAU,WAAW,aAAa,SAAS,GAAG,IAChD,SAAS,IAAI,OACb,WAAW,gBAAgB,SAAS,GAAG,IACrC,SAAS,IAAI,QACb;EACN,IAAI,CAAC,SAAS;EAEd,MAAM,cAAc,UAAU,IAAI,OAAO;EACzC,IAAI,CAAC,aAAa;EAElB,IAAI,SAAS,UAEX,AAAC,SAAS,IAAiC,QAAQ,YAAY;OAC1D;GAGL,IAAI,SAAS,WACX,SAAS,YAAY;GAEvB,SAAS,MAAM,WAAW,WAAW,YAAY,SAAS;EAC5D;EAEA,IAAI,YAAY,SAAS,SAAS,GAAG;EAGrC,MAAM,gBAAgB,WAAW,oBAAoB,SAAS,KAAK,IAC/D,SAAS,MAAM,OACf,SAAS;EAIb,IAAI,WAAW,gBAAgB,aAAa,GAAG;GAC7C,8BACE,YACA,eACA,WACA,YAAY,QACd;GACA;EACF;EAGA,IAAI,WAAW,aAAa,aAAa,GAAG;GAC1C,MAAM,kBAAkB,UAAU,MAAM,WAAW,cAAc,IAAI;GACrE,IAAI,CAAC,iBAAiB;GAEtB,KAAK,MAAM,iBAAiB,gBAAgB,gBAAgB;IAC1D,MAAM,EAAE,WAAW,mBAAmB,gBACpC,YACA,eACA,YAAY,QACd;IACA,wBAAwB,YAAY,WAAW,cAAc;GAC/D;EACF;CACF;AACF;;;;;;;;;;;;;;;;;;AAmBA,MAAM,2BACJ,YACA,SACA,cACS;CACT,IAAI,UAAU,SAAS,GAAG;CAE1B,MAAM,aAAa,QAAQ;CAG3B,IACE,CAAC,WAAW,qBAAqB,UAAU,KAC3C,CAAC,WAAW,gBAAgB,WAAW,EAAE,KACzC,WAAW,SAAS,QAAQ,MAE5B;CAGF,8BAA8B,YAAY,WAAW,IAAI,SAAS,SAAS;AAC7E;;;;;;;;;AAUA,MAAM,0BACJ,YACA,UACA,cACS;CACT,MAAM,EAAE,WAAW,mBAAmB,gBACpC,YACA,UACA,SACF;CACA,wBAAwB,YAAY,WAAW,cAAc;CAC7D,yBAAyB,YAAY,WAAW,cAAc;AAChE;;;;;;;;;;;;;;;;;AAkBA,MAAM,4BACJ,YACA,SACA,cACS;CACT,IAAI,UAAU,SAAS,GAAG;CAE1B,MAAM,aAAa,QAAQ;CAC3B,IAAI,CAAC,YAAY;CAEjB,MAAM,aAAa,WAAW;CAC9B,IACG,CAAC,WAAW,mBAAmB,UAAU,KACxC,CAAC,WAAW,2BAA2B,UAAU,KAClD,WAA2C,WAAW,QAAQ,MAE/D;CAGF,MAAM,eAAgB,WAA2C;CACjE,MAAM,aAAc,WAA2C,WAC3D,WAAW,gBAAgB,YAAY,IACrC,aAAa,QACb,SACF,WAAW,aAAa,YAAY,IAClC,aAAa,OACb;CAEN,IAAI,CAAC,cAAc,CAAC,+BAA+B,IAAI,UAAU,GAAG;CAEpE,MAAM,WAAW,WAAW;CAC5B,IAAI,CAAC,UAAU;CACf,IAAI,CAAC,SAAS,iBAAiB,KAAK,CAAC,SAAS,yBAAyB,GACrE;CAEF,IAAK,SAAS,KAAmC,WAAW,YAC1D;CAGF,MAAM,gBAAgB,SAAS,IAC7B,WACF;CAEA,KAAK,MAAM,gBAAgB,eAAe;EACxC,IACE,CAAC,aAAa,0BAA0B,KACxC,CAAC,aAAa,qBAAqB,GAEnC;EAGF,MAAM,CAAC,sBAAsB,aAAa,IACxC,QACF;EACA,IAAI,CAAC,oBAAoB;EAGzB,IAAI,mBAAmB,gBAAgB,GAAG;GACxC,8BACE,YACA,mBAAmB,MACnB,cACA,SACF;GACA;EACF;EAGA,IAAI,CAAC,mBAAmB,aAAa,GAAG;EAExC,MAAM,mBAAmB,aAAa,MAAM,WAC1C,mBAAmB,KAAK,IAC1B;EACA,IAAI,CAAC,kBAAkB;EAEvB,KAAK,MAAM,oBAAoB,iBAAiB,gBAC9C,uBAAuB,YAAY,kBAAkB,SAAS;CAElE;CAKA,uBAAuB,YAAY,UAAU,SAAS;CAEtD,MAAM,iBAAiB,SAAS;CAChC,IACE,WAAW,qBAAqB,cAAc,KAC9C,WAAW,aAAa,eAAe,EAAE,KACzC,eAAe,SAAS,SAAS,MACjC;EACA,MAAM,gBAAgB,SAAS,MAAM,WAAW,eAAe,GAAG,IAAI;EACtE,KAAK,MAAM,iBAAiB,eAAe,kBAAkB,CAAC,GAC5D,uBAAuB,YAAY,eAAe,SAAS;CAE/D;AACF;;;;;;;;;AAUA,MAAM,mCACJ,YACA,gBACwB;CACxB,MAAM,6CAA6B,IAAI,IAAoB;CAE3D,KAAK,MAAM,aAAa,YAAY,MAAM;EACxC,IAAI,CAAC,WAAW,oBAAoB,SAAS,GAAG;EAEhD,KAAK,MAAM,mBAAmB,UAAU,YAAY;GAClD,IAAI,CAAC,WAAW,kBAAkB,eAAe,GAAG;GAEpD,MAAM,eAAe,WAAW,aAAa,gBAAgB,QAAQ,IACjE,gBAAgB,SAAS,OACzB,gBAAgB,SAAS;GAE7B,IAAI,sBAAsB,SAAS,YAAkC,GACnE,2BAA2B,IACzB,gBAAgB,MAAM,MACtB,YACF;EAEJ;CACF;CAEA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;AA0BA,MAAa,+BACX,YACA,aACA,iBACS;CACT,IAAI,aAAa,8BAA8B,SAAS,GAAG;CAE3D,MAAM,6BAA6B,gCACjC,YACA,YAAY,IACd;CACA,IAAI,2BAA2B,SAAS,GAAG;CAG3C,YAAY,SAAS,EACnB,iBAAiB,uBAAuB;EACtC,MAAM,aAAa,mBAAmB,KAAK;EAC3C,IAAI;EAEJ,IAAI,WAAW,aAAa,UAAU,GACpC,kBAAkB,WAAW;OACxB,IACL,WAAW,mBAAmB,UAAU,KACxC,WAAW,aAAa,WAAW,QAAQ,GAE3C,kBAAkB,WAAW,SAAS;EAGxC,IAAI,CAAC,mBAAmB,CAAC,2BAA2B,IAAI,eAAe,GACrE;EAEF,MAAM,gBAAgB,mBAAmB,KAAK;EAC9C,IAAI,cAAc,WAAW,GAAG;EAEhC,MAAM,gBAAgB,cAAc;EACpC,IAAI;EAEJ,IAAI,WAAW,gBAAgB,aAAa,GAC1C,gBAAgB,cAAc;OACzB,IACL,WAAW,kBAAkB,aAAa,KAC1C,cAAc,YAAY,WAAW,KACrC,cAAc,OAAO,WAAW,KAChC,cAAc,OAAO,IAErB,gBACE,cAAc,OAAO,EAAE,CAAC,MAAM,UAC9B,cAAc,OAAO,EAAE,CAAC,MAAM;EAGlC,IAAI,CAAC,eAAe;EAKpB,IAAI,aAAa,0BAA0B,IAAI,aAAa,GAAG;EAE/D,MAAM,iBACJ,aAAa,8BAA8B,IAAI,aAAa;EAC9D,IAAI,CAAC,kBAAkB,eAAe,SAAS,GAAG;EAKlD,MAAM,kBAAkB,YAAY,YAAY,kBAAkB;EAClE,MAAM,aAAa,gBAAgB;EAGnC,IACE,WAAW,qBAAqB,UAAU,KAC1C,WAAW,gBAAgB,WAAW,EAAE,GACxC;GACA,wBAAwB,YAAY,iBAAiB,cAAc;GACnE;EACF;EAIA,KACG,WAAW,mBAAmB,UAAU,KACvC,WAAW,2BAA2B,UAAU,MACjD,WAA2C,WAC1C,gBAAgB,MAClB;GACA,uBAAuB,YAAY,iBAAiB,cAAc;GAClE;EACF;EAGA,IACE,WAAW,qBAAqB,UAAU,KAC1C,WAAW,aAAa,WAAW,EAAE,GACrC;GACA,MAAM,kBAAkB,mBAAmB,MAAM,WAC/C,WAAW,GAAG,IAChB;GACA,IAAI,CAAC,iBAAiB;GAEtB,KAAK,MAAM,yBAAyB,gBAAgB,gBAAgB;IAGlE,uBACE,YACA,uBACA,cACF;IAKA,MAAM,YAAY,sBAAsB;IACxC,KACG,WAAW,iBAAiB,SAAS,KACpC,WAAW,yBAAyB,SAAS,MAC9C,UAAwC,WACvC,sBAAsB,MACxB;KACA,MAAM,WAAW,sBAAsB;KACvC,IAAI,UACF,uBAAuB,YAAY,UAAU,cAAc;IAE/D;GACF;EACF;CACF,EACF,CAAC;AACH;;;;;;;;;;AAWA,MAAa,8BACV,kBACA,EAAE,OAAO,kBAA8D;CACtE,MAAM;CACN,SAAS,EACP,SAAS,EACP,OAAO,gBAAgB;EACrB,4BAA4B,YAAY,aAAa,YAAY;CACnE,EACF,EACF;AACF"}
+{"version":3,"file":"babel-plugin-intlayer-field-rename.mjs","names":[],"sources":["../../src/babel-plugin-intlayer-field-rename.ts"],"sourcesContent":["import type { NodePath, PluginObject } from '@babel/core';\nimport type * as BabelTypes from '@babel/types';\nimport {\n  CHAINABLE_RUNTIME_METHOD_NAMES,\n  NATIVE_CALLER_NAME_SET,\n  type NestedRenameEntry,\n  type NestedRenameMap,\n  type PruneContext,\n  unwrapAwait,\n} from './babel-plugin-intlayer-usage-analyzer';\n\n// ── Field-name helpers ────────────────────────────────────────────────────────\n\n/**\n * Intlayer internal property names that must never be used as short-name\n * targets. These appear inside content-node values (e.g. `{ nodeType:\n * \"translation\", … }`) and are read by the intlayer runtime.\n */\nconst RESERVED_CONTENT_FIELD_NAMES = new Set(['nodeType']);\n\n/** Alphabet used to derive short field aliases (`a`, `b`, …, `aa`, `ab`, …). */\nconst SHORT_NAME_ALPHABET = 'abcdefghijklmnopqrstuvwxyz';\n\n/**\n * Converts a zero-based index to a short alphabetic identifier.\n *   0 → 'a', 1 → 'b', …, 25 → 'z', 26 → 'aa', 27 → 'ab', …\n */\nexport const generateShortFieldName = (index: number): string => {\n  if (!Number.isInteger(index) || index < 0) {\n    throw new RangeError(\n      `generateShortFieldName expects a non-negative integer index, received: ${index}`\n    );\n  }\n\n  const remainder = index % SHORT_NAME_ALPHABET.length;\n  const quotient = Math.floor(index / SHORT_NAME_ALPHABET.length);\n\n  return quotient === 0 && SHORT_NAME_ALPHABET[remainder]\n    ? SHORT_NAME_ALPHABET[remainder]\n    : generateShortFieldName(quotient - 1) + SHORT_NAME_ALPHABET[remainder];\n};\n\n/**\n * Recursively builds a `NestedRenameMap` from a compiled dictionary content\n * value by traversing the intlayer node structure.\n *\n * Rules:\n *  - If the value has `nodeType: 'translation'`, user-defined fields live\n *    inside `translation[locale]`. Recurse into the first locale's value.\n *  - All other intlayer runtime nodes (enumeration, condition, gender, …) are\n *    treated as leaves — their internal keys must never be renamed.\n *  - Arrays produce an empty children map.  Array elements are not traversed\n *    because consumers may access them via `.map()` / `.filter()` callbacks,\n *    which the source-code rename walk cannot enter.  Renaming element fields\n *    in the JSON without the matching source-code rename would produce\n *    mismatched key names and runtime crashes.\n *    The `[0]` pass-through in `walkRenameChain` is preserved so that direct\n *    indexed access (`field[0].sub`) silently terminates at the empty children\n *    map without breaking anything.\n *  - Plain objects are user-defined records: ALL non-reserved keys are renamed\n *    with short alphabetic aliases (a, b, c, …) and each value is recursed into.\n *  - Primitives produce an empty map (no further renaming).\n *\n * The rename map is built from ALL user-defined fields (not just consumed ones).\n * Both the JSON rename and the source-code rename use the same map, so the\n * short names are always consistent regardless of which fields are pruned.\n *\n * @param contentValue - The dictionary content value to analyse.\n */\nexport const buildNestedRenameMapFromContent = (\n  contentValue: unknown\n): NestedRenameMap => {\n  if (\n    !contentValue ||\n    typeof contentValue !== 'object' ||\n    Array.isArray(contentValue)\n  ) {\n    return new Map();\n  }\n\n  const record = contentValue as Record<string, unknown>;\n\n  // Any object with `nodeType: string` is an intlayer runtime node.\n  if (typeof record.nodeType === 'string') {\n    // Translation node: user-defined fields live inside translation[locale].\n    if (\n      record.nodeType === 'translation' &&\n      record.translation &&\n      typeof record.translation === 'object' &&\n      !Array.isArray(record.translation)\n    ) {\n      const firstLocaleValue = Object.values(\n        record.translation as Record<string, unknown>\n      )[0];\n      return buildNestedRenameMapFromContent(firstLocaleValue);\n    }\n\n    // All other intlayer nodes (enumeration, pluralization, conditions, …)\n    // resolve to a single value at runtime through a call the source-code\n    // rename walk cannot traverse (e.g. `content.myEnum(count)`), and the\n    // JSON renamers only descend into translation nodes. Treat them as\n    // leaves so the source and JSON sides always stay consistent.\n    return new Map();\n  }\n\n  // Exclude React elements from being treated as user-defined records.\n  // JSX elements in the compiled JSON have a $$typeof property (usually Symbol(react.element)).\n  if (\n    record.$$typeof ||\n    (record.type && record.props && Object.hasOwn(record, 'ref'))\n  ) {\n    return new Map();\n  }\n\n  // User-defined record: rename ALL non-reserved keys with stable alphabetic\n  // aliases sorted alphabetically so the mapping is deterministic.\n  const sortedKeys = Object.keys(record)\n    .filter((key) => !RESERVED_CONTENT_FIELD_NAMES.has(key))\n    .sort();\n\n  const renameMap: NestedRenameMap = new Map();\n\n  for (let i = 0; i < sortedKeys.length; i++) {\n    const key = sortedKeys[i];\n\n    if (!key) continue;\n\n    const children = buildNestedRenameMapFromContent(record[key]);\n\n    renameMap.set(key, { shortName: generateShortFieldName(i), children });\n  }\n\n  return renameMap;\n};\n\n/**\n * Walks `fieldPath` through a {@link NestedRenameMap} and returns the entry at\n * the final path segment, or `undefined` when any segment is missing (e.g. the\n * path crosses an array or leaf value whose children are not mapped).\n *\n * Used to locate the rename entry of an opaquely-consumed content value so its\n * children map can be cleared before the JSON rename is applied.\n *\n * @param renameMap - The root rename map to walk.\n * @param fieldPath - Original (pre-rename) field names from the content root.\n */\nexport const getNestedRenameEntryAtPath = (\n  renameMap: NestedRenameMap,\n  fieldPath: readonly string[]\n): NestedRenameEntry | undefined => {\n  let currentRenameMap = renameMap;\n  let renameEntry: NestedRenameEntry | undefined;\n\n  for (const fieldName of fieldPath) {\n    renameEntry = currentRenameMap.get(fieldName);\n    if (!renameEntry) return undefined;\n    currentRenameMap = renameEntry.children;\n  }\n\n  return renameEntry;\n};\n\n// ── Serialisation for non-Babel consumers ─────────────────────────────────────\n\n/**\n * JSON-serialisable form of a {@link NestedRenameEntry}.\n *\n * Mirrors `FieldRenameNode` in the `@intlayer/swc` crate — both sides must stay\n * in sync.\n */\nexport type SerializedFieldRenameEntry = {\n  /** Short alphabetic alias the field is renamed to (`'a'`, `'b'`, …). */\n  shortName: string;\n  /** Rename table of the fields nested inside this one. */\n  children: SerializedFieldRenameMap;\n};\n\n/** JSON-serialisable form of a {@link NestedRenameMap}. */\nexport type SerializedFieldRenameMap = Record<\n  string,\n  SerializedFieldRenameEntry\n>;\n\n/** Recursively converts a {@link NestedRenameMap} to its serialisable form. */\nconst serializeNestedRenameMap = (\n  renameMap: NestedRenameMap\n): SerializedFieldRenameMap => {\n  const serialized: SerializedFieldRenameMap = {};\n\n  for (const [fieldName, renameEntry] of renameMap) {\n    serialized[fieldName] = {\n      shortName: renameEntry.shortName,\n      children: serializeNestedRenameMap(renameEntry.children),\n    };\n  }\n\n  return serialized;\n};\n\n/**\n * Converts the field-rename tables of a {@link PruneContext} into a plain JSON\n * object, keyed by dictionary key.\n *\n * Consumed by bundler integrations that cannot run the Babel rename plugin and\n * must forward the tables to another transformer — currently the `@intlayer/swc`\n * Wasm plugin used by Next.js, which rewrites the source accesses itself.\n *\n * Dictionaries flagged as structural edge cases are omitted: the JSON pipeline\n * leaves them untouched, so their source accesses must stay untouched too.\n * Empty tables are omitted as well, so the result is empty when there is\n * nothing to rename.\n */\nexport const serializeFieldRenameMap = (\n  pruneContext: PruneContext\n): Record<string, SerializedFieldRenameMap> => {\n  const serialized: Record<string, SerializedFieldRenameMap> = {};\n\n  for (const [\n    dictionaryKey,\n    renameMap,\n  ] of pruneContext.dictionaryKeyToFieldRenameMap) {\n    if (renameMap.size === 0) continue;\n    if (pruneContext.dictionariesWithEdgeCases.has(dictionaryKey)) continue;\n\n    serialized[dictionaryKey] = serializeNestedRenameMap(renameMap);\n  }\n\n  return serialized;\n};\n\n// ── Field-rename Babel plugin ─────────────────────────────────────────────────\n\n/**\n * Walks a MemberExpression chain starting from `startPath`, renaming each\n * property found in `currentRenameMap` at the corresponding nesting level.\n *\n * Numeric computed accesses (array indices such as `[0]`, `[1]`) are treated\n * as transparent pass-throughs: the rename map is kept unchanged and the walk\n * continues past the index.  This means `content.field[0].sub` is handled\n * correctly — `field` and `sub` are both renamed while `[0]` is left intact.\n */\nconst walkRenameChain = (\n  babelTypes: typeof BabelTypes,\n  startPath: NodePath<BabelTypes.Node>,\n  currentRenameMap: NestedRenameMap\n): {\n  finalPath: NodePath<BabelTypes.Node>;\n  finalRenameMap: NestedRenameMap;\n} => {\n  let refPath: NodePath<BabelTypes.Node> = startPath;\n  let renameMap = currentRenameMap;\n\n  while (true) {\n    const parentPath = refPath.parentPath;\n    if (!parentPath) break;\n\n    const parentNode = parentPath.node;\n\n    if (\n      (!babelTypes.isMemberExpression(parentNode) &&\n        !babelTypes.isOptionalMemberExpression(parentNode)) ||\n      (parentNode as BabelTypes.MemberExpression).object !== refPath.node\n    ) {\n      break;\n    }\n\n    const memberNode = parentNode as BabelTypes.MemberExpression;\n\n    // Numeric index access ([0], [1], …): advance past the array accessor\n    // without touching the rename map.  The next iteration will attempt to\n    // rename the property that follows the index.\n    if (\n      memberNode.computed &&\n      babelTypes.isNumericLiteral(memberNode.property)\n    ) {\n      refPath = parentPath;\n      continue;\n    }\n\n    // Nothing left to rename at this level — stop.\n    if (renameMap.size === 0) break;\n\n    let fieldName: string | undefined;\n\n    if (!memberNode.computed && babelTypes.isIdentifier(memberNode.property)) {\n      fieldName = memberNode.property.name;\n    } else if (\n      memberNode.computed &&\n      babelTypes.isStringLiteral(memberNode.property)\n    ) {\n      fieldName = memberNode.property.value;\n    } else {\n      break; // dynamic computed key – stop\n    }\n\n    const renameEntry = renameMap.get(fieldName);\n    if (!renameEntry) break; // not in map – stop\n\n    // Apply the rename\n    if (!memberNode.computed && babelTypes.isIdentifier(memberNode.property)) {\n      memberNode.property.name = renameEntry.shortName;\n    } else if (\n      memberNode.computed &&\n      babelTypes.isStringLiteral(memberNode.property)\n    ) {\n      memberNode.property.value = renameEntry.shortName;\n    }\n\n    refPath = parentPath;\n    renameMap = renameEntry.children;\n  }\n\n  return { finalPath: refPath, finalRenameMap: renameMap };\n};\n\n/**\n * Renames the properties of a destructuring `ObjectPattern` using `renameMap`,\n * recursing into nested patterns and following the references of bound local\n * variables.\n *\n * Handled property shapes:\n *\n *   { fieldA }              → { shortA: fieldA }\n *   { fieldA: localVar }    → { shortA: localVar }\n *   { fieldA = fallback }   → { shortA: fieldA = fallback }\n *   { fieldA: { nested } }  → { shortA: { shortN: nested } }\n *   { ['fieldA']: x }       → { ['shortA']: x }\n *   { [dynamicKey]: x }     → left untouched (dynamic key – not renamable)\n *\n * @param babelTypes - Babel types helper.\n * @param objectPattern - The destructuring pattern to rename.\n * @param scopePath - A path whose scope resolves the pattern's bindings.\n * @param renameMap - Rename table for the current nesting level.\n */\nconst renameObjectPatternProperties = (\n  babelTypes: typeof BabelTypes,\n  objectPattern: BabelTypes.ObjectPattern,\n  scopePath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  for (const property of objectPattern.properties) {\n    if (!babelTypes.isObjectProperty(property)) continue;\n\n    // Computed keys: a static string key ({ ['title']: x }) is renamable in\n    // place; any other computed key is dynamic and must be left untouched —\n    // replacing it with an identifier would create a variable reference.\n    if (property.computed && !babelTypes.isStringLiteral(property.key)) {\n      continue;\n    }\n\n    const keyName = babelTypes.isIdentifier(property.key)\n      ? property.key.name\n      : babelTypes.isStringLiteral(property.key)\n        ? property.key.value\n        : null;\n    if (!keyName) continue;\n\n    const renameEntry = renameMap.get(keyName);\n    if (!renameEntry) continue;\n\n    if (property.computed) {\n      // { ['fieldA']: x } → { ['shortA']: x }\n      (property.key as BabelTypes.StringLiteral).value = renameEntry.shortName;\n    } else {\n      // { fieldA } → { shortA: fieldA }\n      // { fieldA: localVar } → { shortA: localVar }\n      if (property.shorthand) {\n        property.shorthand = false;\n      }\n      property.key = babelTypes.identifier(renameEntry.shortName);\n    }\n\n    if (renameEntry.children.size === 0) continue;\n\n    // A default value ({ fieldA = fallback }) wraps the actual binding target.\n    const bindingTarget = babelTypes.isAssignmentPattern(property.value)\n      ? property.value.left\n      : property.value;\n\n    // Nested pattern:  const { fieldA: { nested } } = …  — rename its keys\n    // with this entry's children map.\n    if (babelTypes.isObjectPattern(bindingTarget)) {\n      renameObjectPatternProperties(\n        babelTypes,\n        bindingTarget,\n        scopePath,\n        renameEntry.children\n      );\n      continue;\n    }\n\n    // Identifier binding: recursively walk references to the local variable.\n    if (babelTypes.isIdentifier(bindingTarget)) {\n      const localVarBinding = scopePath.scope.getBinding(bindingTarget.name);\n      if (!localVarBinding) continue;\n\n      for (const nestedRefPath of localVarBinding.referencePaths) {\n        const { finalPath, finalRenameMap } = walkRenameChain(\n          babelTypes,\n          nestedRefPath,\n          renameEntry.children\n        );\n        walkObjectDestructuring(babelTypes, finalPath, finalRenameMap);\n      }\n    }\n  }\n};\n\n/**\n * Walks an object-destructuring assignment whose right-hand side is `refPath`,\n * renaming each destructured key that is found in `renameMap`.\n *\n * Handles the \"secondary destructuring\" pattern that `walkRenameChain` cannot\n * reach because the reference is not a MemberExpression:\n *\n *   const { webhooksSection } = useIntlayer('build-settings');\n *   const { modal, validationErrors } = webhooksSection;\n *     → const { a: modal, b: validationErrors } = webhooksSection;\n *\n * After renaming each key, {@link renameObjectPatternProperties} recursively\n * walks references to the newly-bound local variables, calling both\n * `walkRenameChain` (for subsequent member-access chains like\n * `validationErrors.invalidUrl`) and this function again (for further levels\n * of secondary destructuring).\n */\nconst walkObjectDestructuring = (\n  babelTypes: typeof BabelTypes,\n  refPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  if (renameMap.size === 0) return;\n\n  const parentNode = refPath.parent;\n\n  // Only handle:  const { a, b } = refVar\n  if (\n    !babelTypes.isVariableDeclarator(parentNode) ||\n    !babelTypes.isObjectPattern(parentNode.id) ||\n    parentNode.init !== refPath.node\n  ) {\n    return;\n  }\n\n  renameObjectPatternProperties(babelTypes, parentNode.id, refPath, renameMap);\n};\n\n/**\n * Renames every field access reachable from `rootPath`, whose value is the\n * dictionary content root.\n *\n * Combines the three ways a content root is consumed: a member-access chain,\n * a destructuring assignment, and a chainable runtime helper such as\n * `.onChange(cb)`.\n */\nconst renameContentConsumers = (\n  babelTypes: typeof BabelTypes,\n  rootPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  const { finalPath, finalRenameMap } = walkRenameChain(\n    babelTypes,\n    rootPath,\n    renameMap\n  );\n  walkObjectDestructuring(babelTypes, finalPath, finalRenameMap);\n  renameChainedRuntimeCall(babelTypes, finalPath, finalRenameMap);\n};\n\n/**\n * Handles `content.onChange(cb)` — a runtime subscription rather than a field\n * access (see {@link CHAINABLE_RUNTIME_METHOD_NAMES}).\n *\n * `walkRenameChain` stops at `onChange` because it is absent from the rename\n * map, which would leave the callback body reading the original field names\n * while the compiled JSON has already been renamed. This restarts the rename\n * walk on both sides of the call:\n *\n *   - the callback's first parameter receives the same content root, so its\n *     accesses are renamed with the same map;\n *   - the helper returns the content object, so the chain continues past it.\n *\n * @param refPath - Path whose value is the content root (the object the\n *   chainable method would be called on).\n */\nconst renameChainedRuntimeCall = (\n  babelTypes: typeof BabelTypes,\n  refPath: NodePath<BabelTypes.Node>,\n  renameMap: NestedRenameMap\n): void => {\n  if (renameMap.size === 0) return;\n\n  const memberPath = refPath.parentPath;\n  if (!memberPath) return;\n\n  const memberNode = memberPath.node;\n  if (\n    (!babelTypes.isMemberExpression(memberNode) &&\n      !babelTypes.isOptionalMemberExpression(memberNode)) ||\n    (memberNode as BabelTypes.MemberExpression).object !== refPath.node\n  ) {\n    return;\n  }\n\n  const propertyNode = (memberNode as BabelTypes.MemberExpression).property;\n  const methodName = (memberNode as BabelTypes.MemberExpression).computed\n    ? babelTypes.isStringLiteral(propertyNode)\n      ? propertyNode.value\n      : undefined\n    : babelTypes.isIdentifier(propertyNode)\n      ? propertyNode.name\n      : undefined;\n\n  if (!methodName || !CHAINABLE_RUNTIME_METHOD_NAMES.has(methodName)) return;\n\n  const callPath = memberPath.parentPath;\n  if (!callPath) return;\n  if (!callPath.isCallExpression() && !callPath.isOptionalCallExpression()) {\n    return;\n  }\n  if ((callPath.node as BabelTypes.CallExpression).callee !== memberNode) {\n    return;\n  }\n\n  const argumentPaths = callPath.get(\n    'arguments'\n  ) as NodePath<BabelTypes.Node>[];\n\n  for (const argumentPath of argumentPaths) {\n    if (\n      !argumentPath.isArrowFunctionExpression() &&\n      !argumentPath.isFunctionExpression()\n    ) {\n      continue;\n    }\n\n    const [firstParameterPath] = argumentPath.get(\n      'params'\n    ) as NodePath<BabelTypes.Node>[];\n    if (!firstParameterPath) continue;\n\n    // ({ title }) => … — destructured directly in the parameter list.\n    if (firstParameterPath.isObjectPattern()) {\n      renameObjectPatternProperties(\n        babelTypes,\n        firstParameterPath.node,\n        argumentPath,\n        renameMap\n      );\n      continue;\n    }\n\n    // (content) => … — rename each access on the parameter.\n    if (!firstParameterPath.isIdentifier()) continue;\n\n    const parameterBinding = argumentPath.scope.getBinding(\n      firstParameterPath.node.name\n    );\n    if (!parameterBinding) continue;\n\n    for (const parameterRefPath of parameterBinding.referencePaths) {\n      renameContentConsumers(babelTypes, parameterRefPath, renameMap);\n    }\n  }\n\n  // The helper returns the content object itself, so keep walking past it —\n  // both when the result is used inline and when it is stored in a variable\n  // (`const content = useIntlayer('key').onChange(cb)`).\n  renameContentConsumers(babelTypes, callPath, renameMap);\n\n  const declaratorNode = callPath.parent;\n  if (\n    babelTypes.isVariableDeclarator(declaratorNode) &&\n    babelTypes.isIdentifier(declaratorNode.id) &&\n    declaratorNode.init === callPath.node\n  ) {\n    const resultBinding = callPath.scope.getBinding(declaratorNode.id.name);\n    for (const resultRefPath of resultBinding?.referencePaths ?? []) {\n      renameContentConsumers(babelTypes, resultRefPath, renameMap);\n    }\n  }\n};\n\n/**\n * Collects the local aliases under which `useIntlayer` / `getIntlayer` are\n * imported in the given program (e.g. `import { useIntlayer as useI } …`\n * yields `useI` → `useIntlayer`).\n *\n * Import declarations can only appear at the top level of a module, so the\n * program body is scanned directly instead of traversing the whole AST.\n */\nconst collectIntlayerCallerLocalNames = (\n  babelTypes: typeof BabelTypes,\n  programNode: BabelTypes.Program\n): Map<string, string> => {\n  const intlayerCallerLocalNameMap = new Map<string, string>();\n\n  for (const statement of programNode.body) {\n    if (!babelTypes.isImportDeclaration(statement)) continue;\n\n    for (const importSpecifier of statement.specifiers) {\n      if (!babelTypes.isImportSpecifier(importSpecifier)) continue;\n\n      const importedName = babelTypes.isIdentifier(importSpecifier.imported)\n        ? importSpecifier.imported.name\n        : importSpecifier.imported.value;\n\n      if (NATIVE_CALLER_NAME_SET.has(importedName)) {\n        intlayerCallerLocalNameMap.set(\n          importSpecifier.local.name,\n          importedName\n        );\n      }\n    }\n  }\n\n  return intlayerCallerLocalNameMap;\n};\n\n/**\n * Rewrites dictionary content field accesses in the given program to the\n * short aliases defined in `pruneContext.dictionaryKeyToFieldRenameMap`.\n *\n * Handled patterns (mirrors the usage analyser):\n *\n *   const { fieldA, fieldB } = useIntlayer('key')\n *     → const { shortA: fieldA, shortB: fieldB } = useIntlayer('key')\n *\n *   useIntlayer('key').fieldA\n *     → useIntlayer('key').shortA\n *\n *   const result = useIntlayer('key');  result.fieldA\n *     → const result = useIntlayer('key');  result.shortA\n *\n *   const { fieldA } = useIntlayer('key');\n *   const { nested } = fieldA;          // secondary destructuring\n *     → const { shortA: fieldA } = useIntlayer('key');\n *       const { shortN: nested } = fieldA;\n *\n * Exposed as a standalone function so that both\n * {@link makeFieldRenameBabelPlugin} and `intlayerMinifyBabelPlugin` can\n * invoke it from their own `Program.exit` visitors.\n */\nexport const renameIntlayerFieldAccesses = (\n  babelTypes: typeof BabelTypes,\n  programPath: NodePath<BabelTypes.Program>,\n  pruneContext: PruneContext\n): void => {\n  if (pruneContext.dictionaryKeyToFieldRenameMap.size === 0) return;\n\n  const intlayerCallerLocalNameMap = collectIntlayerCallerLocalNames(\n    babelTypes,\n    programPath.node\n  );\n  if (intlayerCallerLocalNameMap.size === 0) return;\n\n  // Visit all useIntlayer / getIntlayer call-sites and rename field accesses\n  programPath.traverse({\n    CallExpression: (callExpressionPath) => {\n      const calleeNode = callExpressionPath.node.callee;\n      let localCallerName: string | undefined;\n\n      if (babelTypes.isIdentifier(calleeNode)) {\n        localCallerName = calleeNode.name;\n      } else if (\n        babelTypes.isMemberExpression(calleeNode) &&\n        babelTypes.isIdentifier(calleeNode.property)\n      ) {\n        localCallerName = calleeNode.property.name;\n      }\n\n      if (!localCallerName || !intlayerCallerLocalNameMap.has(localCallerName))\n        return;\n\n      const callArguments = callExpressionPath.node.arguments;\n      if (callArguments.length === 0) return;\n\n      const firstArgument = callArguments[0];\n      let dictionaryKey: string | undefined;\n\n      if (babelTypes.isStringLiteral(firstArgument)) {\n        dictionaryKey = firstArgument.value;\n      } else if (\n        babelTypes.isTemplateLiteral(firstArgument) &&\n        firstArgument.expressions.length === 0 &&\n        firstArgument.quasis.length === 1 &&\n        firstArgument.quasis[0]\n      ) {\n        dictionaryKey =\n          firstArgument.quasis[0].value.cooked ??\n          firstArgument.quasis[0].value.raw;\n      }\n\n      if (!dictionaryKey) return;\n\n      // Dictionaries flagged as structural edge cases are left completely\n      // untouched by the JSON pipeline — keep their source accesses untouched\n      // too so both sides stay consistent.\n      if (pruneContext.dictionariesWithEdgeCases.has(dictionaryKey)) return;\n\n      const fieldRenameMap =\n        pruneContext.dictionaryKeyToFieldRenameMap.get(dictionaryKey);\n      if (!fieldRenameMap || fieldRenameMap.size === 0) return;\n\n      // `getIntlayerAsync('key')` is consumed through its `await`, so the\n      // content root is the await expression — the three cases below would\n      // otherwise only ever see an `AwaitExpression` parent.\n      const contentRootPath = unwrapAwait(babelTypes, callExpressionPath);\n      const parentNode = contentRootPath.parent;\n\n      // ── Case 1: const { fieldA, fieldB } = useIntlayer('key') ────────\n      if (\n        babelTypes.isVariableDeclarator(parentNode) &&\n        babelTypes.isObjectPattern(parentNode.id)\n      ) {\n        walkObjectDestructuring(babelTypes, contentRootPath, fieldRenameMap);\n        return;\n      }\n\n      // ── Case 2: useIntlayer('key').fieldA.nested ─────────────────────\n      //           (also useIntlayer('key').onChange(cb))\n      if (\n        (babelTypes.isMemberExpression(parentNode) ||\n          babelTypes.isOptionalMemberExpression(parentNode)) &&\n        (parentNode as BabelTypes.MemberExpression).object ===\n          contentRootPath.node\n      ) {\n        renameContentConsumers(babelTypes, contentRootPath, fieldRenameMap);\n        return;\n      }\n\n      // ── Case 3: const result = useIntlayer('key'); result.fieldA ─────\n      if (\n        babelTypes.isVariableDeclarator(parentNode) &&\n        babelTypes.isIdentifier(parentNode.id)\n      ) {\n        const variableBinding = callExpressionPath.scope.getBinding(\n          parentNode.id.name\n        );\n        if (!variableBinding) return;\n\n        for (const variableReferencePath of variableBinding.referencePaths) {\n          // Direct access: result.fieldA, const { fieldA } = result, or the\n          // chainable result.onChange(cb)\n          renameContentConsumers(\n            babelTypes,\n            variableReferencePath,\n            fieldRenameMap\n          );\n\n          // Signal accessor: result().fieldA or const { fieldA } = result()\n          // walkRenameChain stops at a CallExpression parent, so we need to\n          // start a new walk from the call-expression node itself.\n          const refParent = variableReferencePath.parent;\n          if (\n            (babelTypes.isCallExpression(refParent) ||\n              babelTypes.isOptionalCallExpression(refParent)) &&\n            (refParent as BabelTypes.CallExpression).callee ===\n              variableReferencePath.node\n          ) {\n            const callPath = variableReferencePath.parentPath;\n            if (callPath) {\n              renameContentConsumers(babelTypes, callPath, fieldRenameMap);\n            }\n          }\n        }\n      }\n    },\n  });\n};\n\n/**\n * Creates a Babel plugin that rewrites dictionary content field accesses in\n * source files to their short aliases via\n * {@link renameIntlayerFieldAccesses}.\n *\n * This plugin must run in a separate `transformAsync` pass **before**\n * `intlayerOptimizeBabelPlugin`, because the latter replaces `useIntlayer`\n * with `useDictionary`, erasing the dictionary-key information needed here.\n */\nexport const makeFieldRenameBabelPlugin =\n  (pruneContext: PruneContext) =>\n  ({ types: babelTypes }: { types: typeof BabelTypes }): PluginObject => ({\n    name: 'intlayer-field-rename',\n    visitor: {\n      Program: {\n        exit: (programPath) => {\n          renameIntlayerFieldAccesses(babelTypes, programPath, pruneContext);\n        },\n      },\n    },\n  });\n"],"mappings":";;;;;;;;;AAkBA,MAAM,+CAA+B,IAAI,IAAI,CAAC,UAAU,CAAC;;AAGzD,MAAM,sBAAsB;;;;;AAM5B,MAAa,0BAA0B,UAA0B;CAC/D,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GACtC,MAAM,IAAI,WACR,0EAA0E,OAC5E;CAGF,MAAM,YAAY,QAAQ;CAC1B,MAAM,WAAW,KAAK,MAAM,QAAQ,EAA0B;CAE9D,OAAO,aAAa,KAAK,oBAAoB,aACzC,oBAAoB,aACpB,uBAAuB,WAAW,CAAC,IAAI,oBAAoB;AACjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,MAAa,mCACX,iBACoB;CACpB,IACE,CAAC,gBACD,OAAO,iBAAiB,YACxB,MAAM,QAAQ,YAAY,GAE1B,uBAAO,IAAI,IAAI;CAGjB,MAAM,SAAS;CAGf,IAAI,OAAO,OAAO,aAAa,UAAU;EAEvC,IACE,OAAO,aAAa,iBACpB,OAAO,eACP,OAAO,OAAO,gBAAgB,YAC9B,CAAC,MAAM,QAAQ,OAAO,WAAW,GACjC;GACA,MAAM,mBAAmB,OAAO,OAC9B,OAAO,WACT,CAAC,CAAC;GACF,OAAO,gCAAgC,gBAAgB;EACzD;EAOA,uBAAO,IAAI,IAAI;CACjB;CAIA,IACE,OAAO,YACN,OAAO,QAAQ,OAAO,SAAS,OAAO,OAAO,QAAQ,KAAK,GAE3D,uBAAO,IAAI,IAAI;CAKjB,MAAM,aAAa,OAAO,KAAK,MAAM,CAAC,CACnC,QAAQ,QAAQ,CAAC,6BAA6B,IAAI,GAAG,CAAC,CAAC,CACvD,KAAK;CAER,MAAM,4BAA6B,IAAI,IAAI;CAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,WAAW;EAEvB,IAAI,CAAC,KAAK;EAEV,MAAM,WAAW,gCAAgC,OAAO,IAAI;EAE5D,UAAU,IAAI,KAAK;GAAE,WAAW,uBAAuB,CAAC;GAAG;EAAS,CAAC;CACvE;CAEA,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,8BACX,WACA,cACkC;CAClC,IAAI,mBAAmB;CACvB,IAAI;CAEJ,KAAK,MAAM,aAAa,WAAW;EACjC,cAAc,iBAAiB,IAAI,SAAS;EAC5C,IAAI,CAAC,aAAa,OAAO;EACzB,mBAAmB,YAAY;CACjC;CAEA,OAAO;AACT;;AAwBA,MAAM,4BACJ,cAC6B;CAC7B,MAAM,aAAuC,CAAC;CAE9C,KAAK,MAAM,CAAC,WAAW,gBAAgB,WACrC,WAAW,aAAa;EACtB,WAAW,YAAY;EACvB,UAAU,yBAAyB,YAAY,QAAQ;CACzD;CAGF,OAAO;AACT;;;;;;;;;;;;;;AAeA,MAAa,2BACX,iBAC6C;CAC7C,MAAM,aAAuD,CAAC;CAE9D,KAAK,MAAM,CACT,eACA,cACG,aAAa,+BAA+B;EAC/C,IAAI,UAAU,SAAS,GAAG;EAC1B,IAAI,aAAa,0BAA0B,IAAI,aAAa,GAAG;EAE/D,WAAW,iBAAiB,yBAAyB,SAAS;CAChE;CAEA,OAAO;AACT;;;;;;;;;;AAaA,MAAM,mBACJ,YACA,WACA,qBAIG;CACH,IAAI,UAAqC;CACzC,IAAI,YAAY;CAEhB,OAAO,MAAM;EACX,MAAM,aAAa,QAAQ;EAC3B,IAAI,CAAC,YAAY;EAEjB,MAAM,aAAa,WAAW;EAE9B,IACG,CAAC,WAAW,mBAAmB,UAAU,KACxC,CAAC,WAAW,2BAA2B,UAAU,KAClD,WAA2C,WAAW,QAAQ,MAE/D;EAGF,MAAM,aAAa;EAKnB,IACE,WAAW,YACX,WAAW,iBAAiB,WAAW,QAAQ,GAC/C;GACA,UAAU;GACV;EACF;EAGA,IAAI,UAAU,SAAS,GAAG;EAE1B,IAAI;EAEJ,IAAI,CAAC,WAAW,YAAY,WAAW,aAAa,WAAW,QAAQ,GACrE,YAAY,WAAW,SAAS;OAC3B,IACL,WAAW,YACX,WAAW,gBAAgB,WAAW,QAAQ,GAE9C,YAAY,WAAW,SAAS;OAEhC;EAGF,MAAM,cAAc,UAAU,IAAI,SAAS;EAC3C,IAAI,CAAC,aAAa;EAGlB,IAAI,CAAC,WAAW,YAAY,WAAW,aAAa,WAAW,QAAQ,GACrE,WAAW,SAAS,OAAO,YAAY;OAClC,IACL,WAAW,YACX,WAAW,gBAAgB,WAAW,QAAQ,GAE9C,WAAW,SAAS,QAAQ,YAAY;EAG1C,UAAU;EACV,YAAY,YAAY;CAC1B;CAEA,OAAO;EAAE,WAAW;EAAS,gBAAgB;CAAU;AACzD;;;;;;;;;;;;;;;;;;;;AAqBA,MAAM,iCACJ,YACA,eACA,WACA,cACS;CACT,KAAK,MAAM,YAAY,cAAc,YAAY;EAC/C,IAAI,CAAC,WAAW,iBAAiB,QAAQ,GAAG;EAK5C,IAAI,SAAS,YAAY,CAAC,WAAW,gBAAgB,SAAS,GAAG,GAC/D;EAGF,MAAM,UAAU,WAAW,aAAa,SAAS,GAAG,IAChD,SAAS,IAAI,OACb,WAAW,gBAAgB,SAAS,GAAG,IACrC,SAAS,IAAI,QACb;EACN,IAAI,CAAC,SAAS;EAEd,MAAM,cAAc,UAAU,IAAI,OAAO;EACzC,IAAI,CAAC,aAAa;EAElB,IAAI,SAAS,UAEX,AAAC,SAAS,IAAiC,QAAQ,YAAY;OAC1D;GAGL,IAAI,SAAS,WACX,SAAS,YAAY;GAEvB,SAAS,MAAM,WAAW,WAAW,YAAY,SAAS;EAC5D;EAEA,IAAI,YAAY,SAAS,SAAS,GAAG;EAGrC,MAAM,gBAAgB,WAAW,oBAAoB,SAAS,KAAK,IAC/D,SAAS,MAAM,OACf,SAAS;EAIb,IAAI,WAAW,gBAAgB,aAAa,GAAG;GAC7C,8BACE,YACA,eACA,WACA,YAAY,QACd;GACA;EACF;EAGA,IAAI,WAAW,aAAa,aAAa,GAAG;GAC1C,MAAM,kBAAkB,UAAU,MAAM,WAAW,cAAc,IAAI;GACrE,IAAI,CAAC,iBAAiB;GAEtB,KAAK,MAAM,iBAAiB,gBAAgB,gBAAgB;IAC1D,MAAM,EAAE,WAAW,mBAAmB,gBACpC,YACA,eACA,YAAY,QACd;IACA,wBAAwB,YAAY,WAAW,cAAc;GAC/D;EACF;CACF;AACF;;;;;;;;;;;;;;;;;;AAmBA,MAAM,2BACJ,YACA,SACA,cACS;CACT,IAAI,UAAU,SAAS,GAAG;CAE1B,MAAM,aAAa,QAAQ;CAG3B,IACE,CAAC,WAAW,qBAAqB,UAAU,KAC3C,CAAC,WAAW,gBAAgB,WAAW,EAAE,KACzC,WAAW,SAAS,QAAQ,MAE5B;CAGF,8BAA8B,YAAY,WAAW,IAAI,SAAS,SAAS;AAC7E;;;;;;;;;AAUA,MAAM,0BACJ,YACA,UACA,cACS;CACT,MAAM,EAAE,WAAW,mBAAmB,gBACpC,YACA,UACA,SACF;CACA,wBAAwB,YAAY,WAAW,cAAc;CAC7D,yBAAyB,YAAY,WAAW,cAAc;AAChE;;;;;;;;;;;;;;;;;AAkBA,MAAM,4BACJ,YACA,SACA,cACS;CACT,IAAI,UAAU,SAAS,GAAG;CAE1B,MAAM,aAAa,QAAQ;CAC3B,IAAI,CAAC,YAAY;CAEjB,MAAM,aAAa,WAAW;CAC9B,IACG,CAAC,WAAW,mBAAmB,UAAU,KACxC,CAAC,WAAW,2BAA2B,UAAU,KAClD,WAA2C,WAAW,QAAQ,MAE/D;CAGF,MAAM,eAAgB,WAA2C;CACjE,MAAM,aAAc,WAA2C,WAC3D,WAAW,gBAAgB,YAAY,IACrC,aAAa,QACb,SACF,WAAW,aAAa,YAAY,IAClC,aAAa,OACb;CAEN,IAAI,CAAC,cAAc,CAAC,+BAA+B,IAAI,UAAU,GAAG;CAEpE,MAAM,WAAW,WAAW;CAC5B,IAAI,CAAC,UAAU;CACf,IAAI,CAAC,SAAS,iBAAiB,KAAK,CAAC,SAAS,yBAAyB,GACrE;CAEF,IAAK,SAAS,KAAmC,WAAW,YAC1D;CAGF,MAAM,gBAAgB,SAAS,IAC7B,WACF;CAEA,KAAK,MAAM,gBAAgB,eAAe;EACxC,IACE,CAAC,aAAa,0BAA0B,KACxC,CAAC,aAAa,qBAAqB,GAEnC;EAGF,MAAM,CAAC,sBAAsB,aAAa,IACxC,QACF;EACA,IAAI,CAAC,oBAAoB;EAGzB,IAAI,mBAAmB,gBAAgB,GAAG;GACxC,8BACE,YACA,mBAAmB,MACnB,cACA,SACF;GACA;EACF;EAGA,IAAI,CAAC,mBAAmB,aAAa,GAAG;EAExC,MAAM,mBAAmB,aAAa,MAAM,WAC1C,mBAAmB,KAAK,IAC1B;EACA,IAAI,CAAC,kBAAkB;EAEvB,KAAK,MAAM,oBAAoB,iBAAiB,gBAC9C,uBAAuB,YAAY,kBAAkB,SAAS;CAElE;CAKA,uBAAuB,YAAY,UAAU,SAAS;CAEtD,MAAM,iBAAiB,SAAS;CAChC,IACE,WAAW,qBAAqB,cAAc,KAC9C,WAAW,aAAa,eAAe,EAAE,KACzC,eAAe,SAAS,SAAS,MACjC;EACA,MAAM,gBAAgB,SAAS,MAAM,WAAW,eAAe,GAAG,IAAI;EACtE,KAAK,MAAM,iBAAiB,eAAe,kBAAkB,CAAC,GAC5D,uBAAuB,YAAY,eAAe,SAAS;CAE/D;AACF;;;;;;;;;AAUA,MAAM,mCACJ,YACA,gBACwB;CACxB,MAAM,6CAA6B,IAAI,IAAoB;CAE3D,KAAK,MAAM,aAAa,YAAY,MAAM;EACxC,IAAI,CAAC,WAAW,oBAAoB,SAAS,GAAG;EAEhD,KAAK,MAAM,mBAAmB,UAAU,YAAY;GAClD,IAAI,CAAC,WAAW,kBAAkB,eAAe,GAAG;GAEpD,MAAM,eAAe,WAAW,aAAa,gBAAgB,QAAQ,IACjE,gBAAgB,SAAS,OACzB,gBAAgB,SAAS;GAE7B,IAAI,uBAAuB,IAAI,YAAY,GACzC,2BAA2B,IACzB,gBAAgB,MAAM,MACtB,YACF;EAEJ;CACF;CAEA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;AA0BA,MAAa,+BACX,YACA,aACA,iBACS;CACT,IAAI,aAAa,8BAA8B,SAAS,GAAG;CAE3D,MAAM,6BAA6B,gCACjC,YACA,YAAY,IACd;CACA,IAAI,2BAA2B,SAAS,GAAG;CAG3C,YAAY,SAAS,EACnB,iBAAiB,uBAAuB;EACtC,MAAM,aAAa,mBAAmB,KAAK;EAC3C,IAAI;EAEJ,IAAI,WAAW,aAAa,UAAU,GACpC,kBAAkB,WAAW;OACxB,IACL,WAAW,mBAAmB,UAAU,KACxC,WAAW,aAAa,WAAW,QAAQ,GAE3C,kBAAkB,WAAW,SAAS;EAGxC,IAAI,CAAC,mBAAmB,CAAC,2BAA2B,IAAI,eAAe,GACrE;EAEF,MAAM,gBAAgB,mBAAmB,KAAK;EAC9C,IAAI,cAAc,WAAW,GAAG;EAEhC,MAAM,gBAAgB,cAAc;EACpC,IAAI;EAEJ,IAAI,WAAW,gBAAgB,aAAa,GAC1C,gBAAgB,cAAc;OACzB,IACL,WAAW,kBAAkB,aAAa,KAC1C,cAAc,YAAY,WAAW,KACrC,cAAc,OAAO,WAAW,KAChC,cAAc,OAAO,IAErB,gBACE,cAAc,OAAO,EAAE,CAAC,MAAM,UAC9B,cAAc,OAAO,EAAE,CAAC,MAAM;EAGlC,IAAI,CAAC,eAAe;EAKpB,IAAI,aAAa,0BAA0B,IAAI,aAAa,GAAG;EAE/D,MAAM,iBACJ,aAAa,8BAA8B,IAAI,aAAa;EAC9D,IAAI,CAAC,kBAAkB,eAAe,SAAS,GAAG;EAKlD,MAAM,kBAAkB,YAAY,YAAY,kBAAkB;EAClE,MAAM,aAAa,gBAAgB;EAGnC,IACE,WAAW,qBAAqB,UAAU,KAC1C,WAAW,gBAAgB,WAAW,EAAE,GACxC;GACA,wBAAwB,YAAY,iBAAiB,cAAc;GACnE;EACF;EAIA,KACG,WAAW,mBAAmB,UAAU,KACvC,WAAW,2BAA2B,UAAU,MACjD,WAA2C,WAC1C,gBAAgB,MAClB;GACA,uBAAuB,YAAY,iBAAiB,cAAc;GAClE;EACF;EAGA,IACE,WAAW,qBAAqB,UAAU,KAC1C,WAAW,aAAa,WAAW,EAAE,GACrC;GACA,MAAM,kBAAkB,mBAAmB,MAAM,WAC/C,WAAW,GAAG,IAChB;GACA,IAAI,CAAC,iBAAiB;GAEtB,KAAK,MAAM,yBAAyB,gBAAgB,gBAAgB;IAGlE,uBACE,YACA,uBACA,cACF;IAKA,MAAM,YAAY,sBAAsB;IACxC,KACG,WAAW,iBAAiB,SAAS,KACpC,WAAW,yBAAyB,SAAS,MAC9C,UAAwC,WACvC,sBAAsB,MACxB;KACA,MAAM,WAAW,sBAAsB;KACvC,IAAI,UACF,uBAAuB,YAAY,UAAU,cAAc;IAE/D;GACF;EACF;CACF,EACF,CAAC;AACH;;;;;;;;;;AAWA,MAAa,8BACV,kBACA,EAAE,OAAO,kBAA8D;CACtE,MAAM;CACN,SAAS,EACP,SAAS,EACP,OAAO,gBAAgB;EACrB,4BAA4B,YAAY,aAAa,YAAY;CACnE,EACF,EACF;AACF"}