@strapi/content-type-builder 5.56.0 → 5.57.0

package/dist/admin/components/DataManager/utils/cleanData.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"cleanData.mjs","sources":["../../../../../admin/src/components/DataManager/utils/cleanData.ts"],"sourcesContent":["import camelCase from 'lodash/camelCase';\nimport omit from 'lodash/omit';\nimport sortBy from 'lodash/sortBy';\n\nimport { pluginId } from '../../../pluginId';\n\nimport {\n  createEmptyContentStructure,\n  hasContentStructureChanged,\n  toServerFile,\n} from './contentStructure';\n\nimport type { ContentStructure } from './contentStructure';\nimport type {\n  Component,\n  Components,\n  ContentTypes,\n  ContentType,\n  AnyAttribute,\n} from '../../../types';\nimport type { UID } from '@strapi/types';\n\nconst sortContentType = (types: ContentTypes) => {\n  return sortBy(\n    Object.keys(types)\n      .map((uid) => ({\n        visible: types[uid].visible,\n        name: uid as UID.ContentType,\n        title: types[uid].info.displayName,\n        plugin: types[uid].plugin,\n        uid: uid as UID.ContentType,\n        to: `/plugins/${pluginId}/content-types/${uid}`,\n        kind: types[uid].kind,\n        restrictRelationsTo: types[uid].restrictRelationsTo,\n        status: types[uid].status,\n      }))\n      .filter((obj) => obj !== null),\n    (obj) => camelCase(obj.title)\n  );\n};\n\ntype TrackingEventProperties = {\n  newContentTypes: number;\n  editedContentTypes: number;\n  deletedContentTypes: number;\n  newComponents: number;\n  editedComponents: number;\n  deletedComponents: number;\n  newFields: number;\n  editedFields: number;\n  deletedFields: number;\n};\n\nconst stateToRequestData = ({\n  components,\n  contentTypes,\n  contentStructure = createEmptyContentStructure(),\n  initialContentStructure = createEmptyContentStructure(),\n}: {\n  components: Components;\n  contentTypes: ContentTypes;\n  contentStructure?: ContentStructure;\n  initialContentStructure?: ContentStructure;\n}) => {\n  const trackingEventProperties: TrackingEventProperties = {\n    newContentTypes: 0,\n    editedContentTypes: 0,\n    deletedContentTypes: 0,\n    newComponents: 0,\n    editedComponents: 0,\n    deletedComponents: 0,\n    newFields: 0,\n    editedFields: 0,\n    deletedFields: 0,\n  };\n\n  const formattedComponents = Object.values(components)\n    .filter((compo) => {\n      return ['NEW', 'CHANGED', 'REMOVED'].includes(compo.status);\n    })\n    .map((component) => {\n      const requestFormattedComponent = formatTypeForRequest(component);\n\n      const eventAction = requestFormattedComponent.action as 'create' | 'update' | 'delete';\n      updateEventCounts(\n        { ...component, action: eventAction },\n        trackingEventProperties,\n        'component'\n      );\n\n      return requestFormattedComponent;\n    });\n\n  const formattedContentTypes = Object.values(contentTypes)\n    .filter((contentType) => {\n      return ['NEW', 'CHANGED', 'REMOVED'].includes(contentType.status);\n    })\n    .map((contentType) => {\n      const requestFormattedContentType = formatTypeForRequest(contentType);\n\n      const eventAction = requestFormattedContentType.action as 'create' | 'update' | 'delete';\n      updateEventCounts(\n        { ...contentType, action: eventAction },\n        trackingEventProperties,\n        'contentType'\n      );\n\n      return requestFormattedContentType;\n    });\n\n  // Folder changes occur in the same operation as schema changes.\n  // Attach the draft structure only when a change has occurred, as the server-side\n  // ZOD schema for this payload specifies that the contentStructure property is optional.\n  const structureChanged = hasContentStructureChanged(contentStructure, initialContentStructure);\n  const contentStructureRequestPayload = structureChanged\n    ? { contentStructure: toServerFile(contentStructure) }\n    : undefined;\n\n  return {\n    requestData: {\n      components: formattedComponents,\n      contentTypes: formattedContentTypes,\n      ...contentStructureRequestPayload,\n    },\n    trackingEventProperties,\n  };\n};\n\nconst removeNullKeys = (obj: Record<string, unknown>) => {\n  return Object.fromEntries(\n    Object.entries(obj).filter(([_, value]) => {\n      if (Array.isArray(value)) {\n        return value.length > 0;\n      }\n      if (typeof value === 'object' && value !== null) {\n        return Object.keys(value).length > 0;\n      }\n      return value !== null && value !== undefined;\n    })\n  );\n};\n\nconst formatAttribute = (attr: AnyAttribute) => {\n  if ('customField' in attr) {\n    return { ...attr, type: 'customField' };\n  }\n\n  if ('targetAttribute' in attr) {\n    return {\n      ...attr,\n      targetAttribute: attr.targetAttribute === '-' ? null : attr.targetAttribute,\n      // Explicitly preserve conditions for relations\n      ...(attr.conditions && { conditions: attr.conditions }),\n    };\n  }\n\n  return attr;\n};\n\nconst formatTypeForRequest = (type: ContentType | Component) => {\n  let action;\n  // should we do a diff with the initial data instead of trusting the state status ??\n  switch (type.status) {\n    case 'NEW':\n      action = 'create';\n      break;\n    case 'CHANGED':\n      action = 'update';\n      break;\n    case 'REMOVED':\n      return { action: 'delete', uid: type.uid };\n    default:\n      throw new Error('Invalid status');\n  }\n\n  return {\n    action,\n    uid: type.uid,\n    category: 'category' in type ? type.category : undefined,\n    ...omit(type, ['info', 'options', 'visible', 'uid', 'restrictRelationsTo']),\n    ...type.options,\n    ...type.info,\n    attributes: type.attributes.map((attr) => {\n      let action;\n\n      switch (attr.status) {\n        // NOTE: we want to always send the full data to preserve the order\n\n        case 'NEW':\n          action = 'create';\n          break;\n        case 'REMOVED':\n          return { action: 'delete', name: attr.name };\n        case 'UNCHANGED':\n        case 'CHANGED':\n        default:\n          action = 'update';\n      }\n\n      return {\n        action,\n        name: attr.name,\n        properties: removeNullKeys(omit(formatAttribute(attr), ['status', 'name'])),\n      };\n    }),\n  };\n};\n\nconst updateEventCounts = (\n  type: (ContentType | Component) & { action?: 'create' | 'update' | 'delete' },\n  counts: TrackingEventProperties,\n  entityType: 'component' | 'contentType'\n) => {\n  if (!type || typeof type.action !== 'string') {\n    return;\n  }\n\n  const isContentType = entityType === 'contentType';\n\n  switch (type.action) {\n    case 'create':\n      if (isContentType) {\n        counts.newContentTypes++;\n      } else {\n        counts.newComponents++;\n      }\n      break;\n    case 'update':\n      if (isContentType) {\n        counts.editedContentTypes++;\n      } else {\n        counts.editedComponents++;\n      }\n      break;\n    case 'delete':\n      if (isContentType) {\n        counts.deletedContentTypes++;\n      } else {\n        counts.deletedComponents++;\n      }\n      break;\n    default:\n      break;\n  }\n\n  if (Array.isArray(type.attributes)) {\n    if (type.action === 'delete') {\n      counts.deletedFields += type.attributes.length;\n    } else {\n      type.attributes.forEach((attribute) => {\n        if (!attribute || typeof attribute.status !== 'string') {\n          return;\n        }\n\n        switch (attribute.status) {\n          case 'NEW':\n            counts.newFields++;\n            break;\n          case 'CHANGED':\n            counts.editedFields++;\n            break;\n          case 'REMOVED':\n            counts.deletedFields++;\n            break;\n          case 'UNCHANGED':\n          default:\n            break;\n        }\n      });\n    }\n  }\n};\n\nexport { stateToRequestData, sortContentType };\n"],"names":["sortContentType","types","sortBy","Object","keys","map","uid","visible","name","title","info","displayName","plugin","to","pluginId","kind","restrictRelationsTo","status","filter","obj","camelCase","stateToRequestData","components","contentTypes","contentStructure","createEmptyContentStructure","initialContentStructure","trackingEventProperties","newContentTypes","editedContentTypes","deletedContentTypes","newComponents","editedComponents","deletedComponents","newFields","editedFields","deletedFields","formattedComponents","values","compo","includes","component","requestFormattedComponent","formatTypeForRequest","eventAction","action","updateEventCounts","formattedContentTypes","contentType","requestFormattedContentType","structureChanged","hasContentStructureChanged","contentStructureRequestPayload","toServerFile","undefined","requestData","removeNullKeys","fromEntries","entries","_","value","Array","isArray","length","formatAttribute","attr","type","targetAttribute","conditions","Error","category","omit","options","attributes","properties","counts","entityType","isContentType","forEach","attribute"],"mappings":";;;;;;AAsBA,MAAMA,kBAAkB,CAACC,KAAAA,GAAAA;IACvB,OAAOC,MAAAA,CACLC,OAAOC,IAAI,CAACH,OACTI,GAAG,CAAC,CAACC,GAAAA,IAAS;AACbC,YAAAA,OAAAA,EAASN,KAAK,CAACK,GAAAA,CAAI,CAACC,OAAO;YAC3BC,IAAAA,EAAMF,GAAAA;AACNG,YAAAA,KAAAA,EAAOR,KAAK,CAACK,GAAAA,CAAI,CAACI,IAAI,CAACC,WAAW;AAClCC,YAAAA,MAAAA,EAAQX,KAAK,CAACK,GAAAA,CAAI,CAACM,MAAM;YACzBN,GAAAA,EAAKA,GAAAA;AACLO,YAAAA,EAAAA,EAAI,CAAC,SAAS,EAAEC,QAAAA,CAAS,eAAe,EAAER,GAAAA,CAAAA,CAAK;AAC/CS,YAAAA,IAAAA,EAAMd,KAAK,CAACK,GAAAA,CAAI,CAACS,IAAI;AACrBC,YAAAA,mBAAAA,EAAqBf,KAAK,CAACK,GAAAA,CAAI,CAACU,mBAAmB;AACnDC,YAAAA,MAAAA,EAAQhB,KAAK,CAACK,GAAAA,CAAI,CAACW;SACrB,CAAA,CAAA,CACCC,MAAM,CAAC,CAACC,GAAAA,GAAQA,GAAAA,KAAQ,IAAA,CAAA,EAC3B,CAACA,GAAAA,GAAQC,SAAAA,CAAUD,GAAAA,CAAIV,KAAK,CAAA,CAAA;AAEhC;AAcA,MAAMY,kBAAAA,GAAqB,CAAC,EAC1BC,UAAU,EACVC,YAAY,EACZC,gBAAAA,GAAmBC,2BAAAA,EAA6B,EAChDC,uBAAAA,GAA0BD,2BAAAA,EAA6B,EAMxD,GAAA;AACC,IAAA,MAAME,uBAAAA,GAAmD;QACvDC,eAAAA,EAAiB,CAAA;QACjBC,kBAAAA,EAAoB,CAAA;QACpBC,mBAAAA,EAAqB,CAAA;QACrBC,aAAAA,EAAe,CAAA;QACfC,gBAAAA,EAAkB,CAAA;QAClBC,iBAAAA,EAAmB,CAAA;QACnBC,SAAAA,EAAW,CAAA;QACXC,YAAAA,EAAc,CAAA;QACdC,aAAAA,EAAe;AACjB,KAAA;AAEA,IAAA,MAAMC,sBAAsBlC,MAAAA,CAAOmC,MAAM,CAAChB,UAAAA,CAAAA,CACvCJ,MAAM,CAAC,CAACqB,KAAAA,GAAAA;QACP,OAAO;AAAC,YAAA,KAAA;AAAO,YAAA,SAAA;AAAW,YAAA;SAAU,CAACC,QAAQ,CAACD,KAAAA,CAAMtB,MAAM,CAAA;IAC5D,CAAA,CAAA,CACCZ,GAAG,CAAC,CAACoC,SAAAA,GAAAA;AACJ,QAAA,MAAMC,4BAA4BC,oBAAAA,CAAqBF,SAAAA,CAAAA;QAEvD,MAAMG,WAAAA,GAAcF,0BAA0BG,MAAM;QACpDC,iBAAAA,CACE;AAAE,YAAA,GAAGL,SAAS;YAAEI,MAAAA,EAAQD;AAAY,SAAA,EACpCjB,uBAAAA,EACA,WAAA,CAAA;QAGF,OAAOe,yBAAAA;AACT,IAAA,CAAA,CAAA;AAEF,IAAA,MAAMK,wBAAwB5C,MAAAA,CAAOmC,MAAM,CAACf,YAAAA,CAAAA,CACzCL,MAAM,CAAC,CAAC8B,WAAAA,GAAAA;QACP,OAAO;AAAC,YAAA,KAAA;AAAO,YAAA,SAAA;AAAW,YAAA;SAAU,CAACR,QAAQ,CAACQ,WAAAA,CAAY/B,MAAM,CAAA;IAClE,CAAA,CAAA,CACCZ,GAAG,CAAC,CAAC2C,WAAAA,GAAAA;AACJ,QAAA,MAAMC,8BAA8BN,oBAAAA,CAAqBK,WAAAA,CAAAA;QAEzD,MAAMJ,WAAAA,GAAcK,4BAA4BJ,MAAM;QACtDC,iBAAAA,CACE;AAAE,YAAA,GAAGE,WAAW;YAAEH,MAAAA,EAAQD;AAAY,SAAA,EACtCjB,uBAAAA,EACA,aAAA,CAAA;QAGF,OAAOsB,2BAAAA;AACT,IAAA,CAAA,CAAA;;;;IAKF,MAAMC,gBAAAA,GAAmBC,2BAA2B3B,gBAAAA,EAAkBE,uBAAAA,CAAAA;AACtE,IAAA,MAAM0B,iCAAiCF,gBAAAA,GACnC;AAAE1B,QAAAA,gBAAAA,EAAkB6B,YAAAA,CAAa7B,gBAAAA;KAAkB,GACnD8B,SAAAA;IAEJ,OAAO;QACLC,WAAAA,EAAa;YACXjC,UAAAA,EAAYe,mBAAAA;YACZd,YAAAA,EAAcwB,qBAAAA;AACd,YAAA,GAAGK;AACL,SAAA;AACAzB,QAAAA;AACF,KAAA;AACF;AAEA,MAAM6B,iBAAiB,CAACrC,GAAAA,GAAAA;AACtB,IAAA,OAAOhB,MAAAA,CAAOsD,WAAW,CACvBtD,MAAAA,CAAOuD,OAAO,CAACvC,GAAAA,CAAAA,CAAKD,MAAM,CAAC,CAAC,CAACyC,CAAAA,EAAGC,KAAAA,CAAM,GAAA;QACpC,IAAIC,KAAAA,CAAMC,OAAO,CAACF,KAAAA,CAAAA,EAAQ;YACxB,OAAOA,KAAAA,CAAMG,MAAM,GAAG,CAAA;AACxB,QAAA;AACA,QAAA,IAAI,OAAOH,KAAAA,KAAU,QAAA,IAAYA,KAAAA,KAAU,IAAA,EAAM;AAC/C,YAAA,OAAOzD,MAAAA,CAAOC,IAAI,CAACwD,KAAAA,CAAAA,CAAOG,MAAM,GAAG,CAAA;AACrC,QAAA;QACA,OAAOH,KAAAA,KAAU,QAAQA,KAAAA,KAAUN,SAAAA;AACrC,IAAA,CAAA,CAAA,CAAA;AAEJ,CAAA;AAEA,MAAMU,kBAAkB,CAACC,IAAAA,GAAAA;AACvB,IAAA,IAAI,iBAAiBA,IAAAA,EAAM;QACzB,OAAO;AAAE,YAAA,GAAGA,IAAI;YAAEC,IAAAA,EAAM;AAAc,SAAA;AACxC,IAAA;AAEA,IAAA,IAAI,qBAAqBD,IAAAA,EAAM;QAC7B,OAAO;AACL,YAAA,GAAGA,IAAI;AACPE,YAAAA,eAAAA,EAAiBF,KAAKE,eAAe,KAAK,GAAA,GAAM,IAAA,GAAOF,KAAKE,eAAe;;YAE3E,GAAIF,IAAAA,CAAKG,UAAU,IAAI;AAAEA,gBAAAA,UAAAA,EAAYH,KAAKG;;AAC5C,SAAA;AACF,IAAA;IAEA,OAAOH,IAAAA;AACT,CAAA;AAEA,MAAMtB,uBAAuB,CAACuB,IAAAA,GAAAA;IAC5B,IAAIrB,MAAAA;;AAEJ,IAAA,OAAQqB,KAAKjD,MAAM;QACjB,KAAK,KAAA;YACH4B,MAAAA,GAAS,QAAA;AACT,YAAA;QACF,KAAK,SAAA;YACHA,MAAAA,GAAS,QAAA;AACT,YAAA;QACF,KAAK,SAAA;YACH,OAAO;gBAAEA,MAAAA,EAAQ,QAAA;AAAUvC,gBAAAA,GAAAA,EAAK4D,KAAK5D;AAAI,aAAA;AAC3C,QAAA;AACE,YAAA,MAAM,IAAI+D,KAAAA,CAAM,gBAAA,CAAA;AACpB;IAEA,OAAO;AACLxB,QAAAA,MAAAA;AACAvC,QAAAA,GAAAA,EAAK4D,KAAK5D,GAAG;AACbgE,QAAAA,QAAAA,EAAU,UAAA,IAAcJ,IAAAA,GAAOA,IAAAA,CAAKI,QAAQ,GAAGhB,SAAAA;AAC/C,QAAA,GAAGiB,KAAKL,IAAAA,EAAM;AAAC,YAAA,MAAA;AAAQ,YAAA,SAAA;AAAW,YAAA,SAAA;AAAW,YAAA,KAAA;AAAO,YAAA;SAAsB,CAAC;AAC3E,QAAA,GAAGA,KAAKM,OAAO;AACf,QAAA,GAAGN,KAAKxD,IAAI;AACZ+D,QAAAA,UAAAA,EAAYP,IAAAA,CAAKO,UAAU,CAACpE,GAAG,CAAC,CAAC4D,IAAAA,GAAAA;YAC/B,IAAIpB,MAAAA;AAEJ,YAAA,OAAQoB,KAAKhD,MAAM;;gBAGjB,KAAK,KAAA;oBACH4B,MAAAA,GAAS,QAAA;AACT,oBAAA;gBACF,KAAK,SAAA;oBACH,OAAO;wBAAEA,MAAAA,EAAQ,QAAA;AAAUrC,wBAAAA,IAAAA,EAAMyD,KAAKzD;AAAK,qBAAA;gBAC7C,KAAK,WAAA;gBACL,KAAK,SAAA;AACL,gBAAA;oBACEqC,MAAAA,GAAS,QAAA;AACb;YAEA,OAAO;AACLA,gBAAAA,MAAAA;AACArC,gBAAAA,IAAAA,EAAMyD,KAAKzD,IAAI;gBACfkE,UAAAA,EAAYlB,cAAAA,CAAee,IAAAA,CAAKP,eAAAA,CAAgBC,IAAAA,CAAAA,EAAO;AAAC,oBAAA,QAAA;AAAU,oBAAA;AAAO,iBAAA,CAAA;AAC3E,aAAA;AACF,QAAA,CAAA;AACF,KAAA;AACF,CAAA;AAEA,MAAMnB,iBAAAA,GAAoB,CACxBoB,IAAAA,EACAS,MAAAA,EACAC,UAAAA,GAAAA;AAEA,IAAA,IAAI,CAACV,IAAAA,IAAQ,OAAOA,IAAAA,CAAKrB,MAAM,KAAK,QAAA,EAAU;AAC5C,QAAA;AACF,IAAA;AAEA,IAAA,MAAMgC,gBAAgBD,UAAAA,KAAe,aAAA;AAErC,IAAA,OAAQV,KAAKrB,MAAM;QACjB,KAAK,QAAA;AACH,YAAA,IAAIgC,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAO/C,eAAe,EAAA;YACxB,CAAA,MAAO;AACL+C,gBAAAA,MAAAA,CAAO5C,aAAa,EAAA;AACtB,YAAA;AACA,YAAA;QACF,KAAK,QAAA;AACH,YAAA,IAAI8C,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAO9C,kBAAkB,EAAA;YAC3B,CAAA,MAAO;AACL8C,gBAAAA,MAAAA,CAAO3C,gBAAgB,EAAA;AACzB,YAAA;AACA,YAAA;QACF,KAAK,QAAA;AACH,YAAA,IAAI6C,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAO7C,mBAAmB,EAAA;YAC5B,CAAA,MAAO;AACL6C,gBAAAA,MAAAA,CAAO1C,iBAAiB,EAAA;AAC1B,YAAA;AACA,YAAA;AAGJ;AAEA,IAAA,IAAI4B,KAAAA,CAAMC,OAAO,CAACI,IAAAA,CAAKO,UAAU,CAAA,EAAG;QAClC,IAAIP,IAAAA,CAAKrB,MAAM,KAAK,QAAA,EAAU;AAC5B8B,YAAAA,MAAAA,CAAOvC,aAAa,IAAI8B,IAAAA,CAAKO,UAAU,CAACV,MAAM;QAChD,CAAA,MAAO;AACLG,YAAAA,IAAAA,CAAKO,UAAU,CAACK,OAAO,CAAC,CAACC,SAAAA,GAAAA;AACvB,gBAAA,IAAI,CAACA,SAAAA,IAAa,OAAOA,SAAAA,CAAU9D,MAAM,KAAK,QAAA,EAAU;AACtD,oBAAA;AACF,gBAAA;AAEA,gBAAA,OAAQ8D,UAAU9D,MAAM;oBACtB,KAAK,KAAA;AACH0D,wBAAAA,MAAAA,CAAOzC,SAAS,EAAA;AAChB,wBAAA;oBACF,KAAK,SAAA;AACHyC,wBAAAA,MAAAA,CAAOxC,YAAY,EAAA;AACnB,wBAAA;oBACF,KAAK,SAAA;AACHwC,wBAAAA,MAAAA,CAAOvC,aAAa,EAAA;AACpB,wBAAA;AAIJ;AACF,YAAA,CAAA,CAAA;AACF,QAAA;AACF,IAAA;AACF,CAAA;;;;"}
+{"version":3,"file":"cleanData.mjs","sources":["../../../../../admin/src/components/DataManager/utils/cleanData.ts"],"sourcesContent":["import camelCase from 'lodash/camelCase';\nimport omit from 'lodash/omit';\nimport sortBy from 'lodash/sortBy';\n\nimport { pluginId } from '../../../pluginId';\n\nimport {\n  createEmptyContentStructure,\n  hasContentStructureChanged,\n  toServerFile,\n} from './contentStructure';\n\nimport type { ContentStructure } from './contentStructure';\nimport type {\n  Component,\n  Components,\n  ContentTypes,\n  ContentType,\n  AnyAttribute,\n} from '../../../types';\nimport type { UID } from '@strapi/types';\n\nconst sortContentType = (types: ContentTypes) => {\n  return sortBy(\n    Object.keys(types)\n      .map((uid) => ({\n        visible: types[uid].visible,\n        name: uid as UID.ContentType,\n        title: types[uid].info.displayName,\n        plugin: types[uid].plugin,\n        uid: uid as UID.ContentType,\n        to: `/plugins/${pluginId}/content-types/${uid}`,\n        kind: types[uid].kind,\n        restrictRelationsTo: types[uid].restrictRelationsTo,\n        status: types[uid].status,\n      }))\n      .filter((obj) => obj !== null),\n    (obj) => camelCase(obj.title)\n  );\n};\n\ntype TrackingEventProperties = {\n  newContentTypes: number;\n  editedContentTypes: number;\n  deletedContentTypes: number;\n  newComponents: number;\n  editedComponents: number;\n  deletedComponents: number;\n  newFields: number;\n  editedFields: number;\n  deletedFields: number;\n};\n\nconst stateToRequestData = ({\n  components,\n  contentTypes,\n  contentStructure = createEmptyContentStructure(),\n  initialContentStructure = createEmptyContentStructure(),\n}: {\n  components: Components;\n  contentTypes: ContentTypes;\n  contentStructure?: ContentStructure;\n  initialContentStructure?: ContentStructure;\n}) => {\n  const trackingEventProperties: TrackingEventProperties = {\n    newContentTypes: 0,\n    editedContentTypes: 0,\n    deletedContentTypes: 0,\n    newComponents: 0,\n    editedComponents: 0,\n    deletedComponents: 0,\n    newFields: 0,\n    editedFields: 0,\n    deletedFields: 0,\n  };\n\n  const formattedComponents = Object.values(components)\n    .filter((compo) => {\n      return ['NEW', 'CHANGED', 'REMOVED'].includes(compo.status);\n    })\n    .map((component) => {\n      const requestFormattedComponent = formatTypeForRequest(component);\n\n      const eventAction = requestFormattedComponent.action as 'create' | 'update' | 'delete';\n      updateEventCounts(\n        { ...component, action: eventAction },\n        trackingEventProperties,\n        'component'\n      );\n\n      return requestFormattedComponent;\n    });\n\n  const formattedContentTypes = Object.values(contentTypes)\n    .filter((contentType) => {\n      return ['NEW', 'CHANGED', 'REMOVED'].includes(contentType.status);\n    })\n    .map((contentType) => {\n      const requestFormattedContentType = formatTypeForRequest(contentType);\n\n      const eventAction = requestFormattedContentType.action as 'create' | 'update' | 'delete';\n      updateEventCounts(\n        { ...contentType, action: eventAction },\n        trackingEventProperties,\n        'contentType'\n      );\n\n      return requestFormattedContentType;\n    });\n\n  // Folder changes occur in the same operation as schema changes.\n  // Attach the draft structure only when a change has occurred, as the server-side\n  // ZOD schema for this payload specifies that the contentStructure property is optional.\n  const structureChanged = hasContentStructureChanged(contentStructure, initialContentStructure);\n  const contentStructureRequestPayload = structureChanged\n    ? { contentStructure: toServerFile(contentStructure) }\n    : undefined;\n\n  return {\n    requestData: {\n      components: formattedComponents,\n      contentTypes: formattedContentTypes,\n      ...contentStructureRequestPayload,\n    },\n    trackingEventProperties,\n  };\n};\n\nconst removeNullKeys = (obj: Record<string, unknown>) => {\n  return Object.fromEntries(\n    Object.entries(obj).filter(([_, value]) => {\n      if (Array.isArray(value)) {\n        return value.length > 0;\n      }\n      if (typeof value === 'object' && value !== null) {\n        return Object.keys(value).length > 0;\n      }\n      return value !== null && value !== undefined;\n    })\n  );\n};\n\nconst formatAttribute = (attr: AnyAttribute) => {\n  if ('customField' in attr) {\n    return { ...attr, type: 'customField' };\n  }\n\n  if ('targetAttribute' in attr) {\n    return {\n      ...attr,\n      targetAttribute: attr.targetAttribute === '-' ? null : attr.targetAttribute,\n      // Explicitly preserve conditions for relations\n      ...(attr.conditions && { conditions: attr.conditions }),\n    };\n  }\n\n  return attr;\n};\n\nconst formatTypeForRequest = (type: ContentType | Component) => {\n  let action;\n  // should we do a diff with the initial data instead of trusting the state status ??\n  switch (type.status) {\n    case 'NEW':\n      action = 'create';\n      break;\n    case 'CHANGED':\n      action = 'update';\n      break;\n    case 'REMOVED':\n      return { action: 'delete', uid: type.uid };\n    default:\n      throw new Error('Invalid status');\n  }\n\n  return {\n    action,\n    uid: type.uid,\n    category: 'category' in type ? type.category : undefined,\n    ...omit(type, [\n      'info',\n      'options',\n      'visible',\n      'uid',\n      'restrictRelationsTo',\n      'renames',\n      'declinedRenameNames',\n    ]),\n    ...type.options,\n    ...type.info,\n    // Forward the ordered rename path (existing fields only) so the server can\n    // generate a data-preserving migration that replays each hop verbatim.\n    ...(action === 'update' && Array.isArray(type.renames) && type.renames.length > 0\n      ? { renames: type.renames }\n      : {}),\n    attributes: type.attributes.map((attr) => {\n      let action;\n\n      switch (attr.status) {\n        // NOTE: we want to always send the full data to preserve the order\n\n        case 'NEW':\n          action = 'create';\n          break;\n        case 'REMOVED':\n          return { action: 'delete', name: attr.name };\n        case 'UNCHANGED':\n        case 'CHANGED':\n        default:\n          action = 'update';\n      }\n\n      return {\n        action,\n        name: attr.name,\n        properties: removeNullKeys(omit(formatAttribute(attr), ['status', 'name'])),\n      };\n    }),\n  };\n};\n\nconst updateEventCounts = (\n  type: (ContentType | Component) & { action?: 'create' | 'update' | 'delete' },\n  counts: TrackingEventProperties,\n  entityType: 'component' | 'contentType'\n) => {\n  if (!type || typeof type.action !== 'string') {\n    return;\n  }\n\n  const isContentType = entityType === 'contentType';\n\n  switch (type.action) {\n    case 'create':\n      if (isContentType) {\n        counts.newContentTypes++;\n      } else {\n        counts.newComponents++;\n      }\n      break;\n    case 'update':\n      if (isContentType) {\n        counts.editedContentTypes++;\n      } else {\n        counts.editedComponents++;\n      }\n      break;\n    case 'delete':\n      if (isContentType) {\n        counts.deletedContentTypes++;\n      } else {\n        counts.deletedComponents++;\n      }\n      break;\n    default:\n      break;\n  }\n\n  if (Array.isArray(type.attributes)) {\n    if (type.action === 'delete') {\n      counts.deletedFields += type.attributes.length;\n    } else {\n      type.attributes.forEach((attribute) => {\n        if (!attribute || typeof attribute.status !== 'string') {\n          return;\n        }\n\n        switch (attribute.status) {\n          case 'NEW':\n            counts.newFields++;\n            break;\n          case 'CHANGED':\n            counts.editedFields++;\n            break;\n          case 'REMOVED':\n            counts.deletedFields++;\n            break;\n          case 'UNCHANGED':\n          default:\n            break;\n        }\n      });\n    }\n  }\n};\n\nexport { stateToRequestData, sortContentType };\n"],"names":["sortContentType","types","sortBy","Object","keys","map","uid","visible","name","title","info","displayName","plugin","to","pluginId","kind","restrictRelationsTo","status","filter","obj","camelCase","stateToRequestData","components","contentTypes","contentStructure","createEmptyContentStructure","initialContentStructure","trackingEventProperties","newContentTypes","editedContentTypes","deletedContentTypes","newComponents","editedComponents","deletedComponents","newFields","editedFields","deletedFields","formattedComponents","values","compo","includes","component","requestFormattedComponent","formatTypeForRequest","eventAction","action","updateEventCounts","formattedContentTypes","contentType","requestFormattedContentType","structureChanged","hasContentStructureChanged","contentStructureRequestPayload","toServerFile","undefined","requestData","removeNullKeys","fromEntries","entries","_","value","Array","isArray","length","formatAttribute","attr","type","targetAttribute","conditions","Error","category","omit","options","renames","attributes","properties","counts","entityType","isContentType","forEach","attribute"],"mappings":";;;;;;AAsBA,MAAMA,kBAAkB,CAACC,KAAAA,GAAAA;IACvB,OAAOC,MAAAA,CACLC,OAAOC,IAAI,CAACH,OACTI,GAAG,CAAC,CAACC,GAAAA,IAAS;AACbC,YAAAA,OAAAA,EAASN,KAAK,CAACK,GAAAA,CAAI,CAACC,OAAO;YAC3BC,IAAAA,EAAMF,GAAAA;AACNG,YAAAA,KAAAA,EAAOR,KAAK,CAACK,GAAAA,CAAI,CAACI,IAAI,CAACC,WAAW;AAClCC,YAAAA,MAAAA,EAAQX,KAAK,CAACK,GAAAA,CAAI,CAACM,MAAM;YACzBN,GAAAA,EAAKA,GAAAA;AACLO,YAAAA,EAAAA,EAAI,CAAC,SAAS,EAAEC,QAAAA,CAAS,eAAe,EAAER,GAAAA,CAAAA,CAAK;AAC/CS,YAAAA,IAAAA,EAAMd,KAAK,CAACK,GAAAA,CAAI,CAACS,IAAI;AACrBC,YAAAA,mBAAAA,EAAqBf,KAAK,CAACK,GAAAA,CAAI,CAACU,mBAAmB;AACnDC,YAAAA,MAAAA,EAAQhB,KAAK,CAACK,GAAAA,CAAI,CAACW;SACrB,CAAA,CAAA,CACCC,MAAM,CAAC,CAACC,GAAAA,GAAQA,GAAAA,KAAQ,IAAA,CAAA,EAC3B,CAACA,GAAAA,GAAQC,SAAAA,CAAUD,GAAAA,CAAIV,KAAK,CAAA,CAAA;AAEhC;AAcA,MAAMY,kBAAAA,GAAqB,CAAC,EAC1BC,UAAU,EACVC,YAAY,EACZC,gBAAAA,GAAmBC,2BAAAA,EAA6B,EAChDC,uBAAAA,GAA0BD,2BAAAA,EAA6B,EAMxD,GAAA;AACC,IAAA,MAAME,uBAAAA,GAAmD;QACvDC,eAAAA,EAAiB,CAAA;QACjBC,kBAAAA,EAAoB,CAAA;QACpBC,mBAAAA,EAAqB,CAAA;QACrBC,aAAAA,EAAe,CAAA;QACfC,gBAAAA,EAAkB,CAAA;QAClBC,iBAAAA,EAAmB,CAAA;QACnBC,SAAAA,EAAW,CAAA;QACXC,YAAAA,EAAc,CAAA;QACdC,aAAAA,EAAe;AACjB,KAAA;AAEA,IAAA,MAAMC,sBAAsBlC,MAAAA,CAAOmC,MAAM,CAAChB,UAAAA,CAAAA,CACvCJ,MAAM,CAAC,CAACqB,KAAAA,GAAAA;QACP,OAAO;AAAC,YAAA,KAAA;AAAO,YAAA,SAAA;AAAW,YAAA;SAAU,CAACC,QAAQ,CAACD,KAAAA,CAAMtB,MAAM,CAAA;IAC5D,CAAA,CAAA,CACCZ,GAAG,CAAC,CAACoC,SAAAA,GAAAA;AACJ,QAAA,MAAMC,4BAA4BC,oBAAAA,CAAqBF,SAAAA,CAAAA;QAEvD,MAAMG,WAAAA,GAAcF,0BAA0BG,MAAM;QACpDC,iBAAAA,CACE;AAAE,YAAA,GAAGL,SAAS;YAAEI,MAAAA,EAAQD;AAAY,SAAA,EACpCjB,uBAAAA,EACA,WAAA,CAAA;QAGF,OAAOe,yBAAAA;AACT,IAAA,CAAA,CAAA;AAEF,IAAA,MAAMK,wBAAwB5C,MAAAA,CAAOmC,MAAM,CAACf,YAAAA,CAAAA,CACzCL,MAAM,CAAC,CAAC8B,WAAAA,GAAAA;QACP,OAAO;AAAC,YAAA,KAAA;AAAO,YAAA,SAAA;AAAW,YAAA;SAAU,CAACR,QAAQ,CAACQ,WAAAA,CAAY/B,MAAM,CAAA;IAClE,CAAA,CAAA,CACCZ,GAAG,CAAC,CAAC2C,WAAAA,GAAAA;AACJ,QAAA,MAAMC,8BAA8BN,oBAAAA,CAAqBK,WAAAA,CAAAA;QAEzD,MAAMJ,WAAAA,GAAcK,4BAA4BJ,MAAM;QACtDC,iBAAAA,CACE;AAAE,YAAA,GAAGE,WAAW;YAAEH,MAAAA,EAAQD;AAAY,SAAA,EACtCjB,uBAAAA,EACA,aAAA,CAAA;QAGF,OAAOsB,2BAAAA;AACT,IAAA,CAAA,CAAA;;;;IAKF,MAAMC,gBAAAA,GAAmBC,2BAA2B3B,gBAAAA,EAAkBE,uBAAAA,CAAAA;AACtE,IAAA,MAAM0B,iCAAiCF,gBAAAA,GACnC;AAAE1B,QAAAA,gBAAAA,EAAkB6B,YAAAA,CAAa7B,gBAAAA;KAAkB,GACnD8B,SAAAA;IAEJ,OAAO;QACLC,WAAAA,EAAa;YACXjC,UAAAA,EAAYe,mBAAAA;YACZd,YAAAA,EAAcwB,qBAAAA;AACd,YAAA,GAAGK;AACL,SAAA;AACAzB,QAAAA;AACF,KAAA;AACF;AAEA,MAAM6B,iBAAiB,CAACrC,GAAAA,GAAAA;AACtB,IAAA,OAAOhB,MAAAA,CAAOsD,WAAW,CACvBtD,MAAAA,CAAOuD,OAAO,CAACvC,GAAAA,CAAAA,CAAKD,MAAM,CAAC,CAAC,CAACyC,CAAAA,EAAGC,KAAAA,CAAM,GAAA;QACpC,IAAIC,KAAAA,CAAMC,OAAO,CAACF,KAAAA,CAAAA,EAAQ;YACxB,OAAOA,KAAAA,CAAMG,MAAM,GAAG,CAAA;AACxB,QAAA;AACA,QAAA,IAAI,OAAOH,KAAAA,KAAU,QAAA,IAAYA,KAAAA,KAAU,IAAA,EAAM;AAC/C,YAAA,OAAOzD,MAAAA,CAAOC,IAAI,CAACwD,KAAAA,CAAAA,CAAOG,MAAM,GAAG,CAAA;AACrC,QAAA;QACA,OAAOH,KAAAA,KAAU,QAAQA,KAAAA,KAAUN,SAAAA;AACrC,IAAA,CAAA,CAAA,CAAA;AAEJ,CAAA;AAEA,MAAMU,kBAAkB,CAACC,IAAAA,GAAAA;AACvB,IAAA,IAAI,iBAAiBA,IAAAA,EAAM;QACzB,OAAO;AAAE,YAAA,GAAGA,IAAI;YAAEC,IAAAA,EAAM;AAAc,SAAA;AACxC,IAAA;AAEA,IAAA,IAAI,qBAAqBD,IAAAA,EAAM;QAC7B,OAAO;AACL,YAAA,GAAGA,IAAI;AACPE,YAAAA,eAAAA,EAAiBF,KAAKE,eAAe,KAAK,GAAA,GAAM,IAAA,GAAOF,KAAKE,eAAe;;YAE3E,GAAIF,IAAAA,CAAKG,UAAU,IAAI;AAAEA,gBAAAA,UAAAA,EAAYH,KAAKG;;AAC5C,SAAA;AACF,IAAA;IAEA,OAAOH,IAAAA;AACT,CAAA;AAEA,MAAMtB,uBAAuB,CAACuB,IAAAA,GAAAA;IAC5B,IAAIrB,MAAAA;;AAEJ,IAAA,OAAQqB,KAAKjD,MAAM;QACjB,KAAK,KAAA;YACH4B,MAAAA,GAAS,QAAA;AACT,YAAA;QACF,KAAK,SAAA;YACHA,MAAAA,GAAS,QAAA;AACT,YAAA;QACF,KAAK,SAAA;YACH,OAAO;gBAAEA,MAAAA,EAAQ,QAAA;AAAUvC,gBAAAA,GAAAA,EAAK4D,KAAK5D;AAAI,aAAA;AAC3C,QAAA;AACE,YAAA,MAAM,IAAI+D,KAAAA,CAAM,gBAAA,CAAA;AACpB;IAEA,OAAO;AACLxB,QAAAA,MAAAA;AACAvC,QAAAA,GAAAA,EAAK4D,KAAK5D,GAAG;AACbgE,QAAAA,QAAAA,EAAU,UAAA,IAAcJ,IAAAA,GAAOA,IAAAA,CAAKI,QAAQ,GAAGhB,SAAAA;AAC/C,QAAA,GAAGiB,KAAKL,IAAAA,EAAM;AACZ,YAAA,MAAA;AACA,YAAA,SAAA;AACA,YAAA,SAAA;AACA,YAAA,KAAA;AACA,YAAA,qBAAA;AACA,YAAA,SAAA;AACA,YAAA;SACD,CAAC;AACF,QAAA,GAAGA,KAAKM,OAAO;AACf,QAAA,GAAGN,KAAKxD,IAAI;;;AAGZ,QAAA,GAAImC,MAAAA,KAAW,QAAA,IAAYgB,KAAAA,CAAMC,OAAO,CAACI,IAAAA,CAAKO,OAAO,CAAA,IAAKP,IAAAA,CAAKO,OAAO,CAACV,MAAM,GAAG,CAAA,GAC5E;AAAEU,YAAAA,OAAAA,EAASP,KAAKO;AAAQ,SAAA,GACxB,EAAE;AACNC,QAAAA,UAAAA,EAAYR,IAAAA,CAAKQ,UAAU,CAACrE,GAAG,CAAC,CAAC4D,IAAAA,GAAAA;YAC/B,IAAIpB,MAAAA;AAEJ,YAAA,OAAQoB,KAAKhD,MAAM;;gBAGjB,KAAK,KAAA;oBACH4B,MAAAA,GAAS,QAAA;AACT,oBAAA;gBACF,KAAK,SAAA;oBACH,OAAO;wBAAEA,MAAAA,EAAQ,QAAA;AAAUrC,wBAAAA,IAAAA,EAAMyD,KAAKzD;AAAK,qBAAA;gBAC7C,KAAK,WAAA;gBACL,KAAK,SAAA;AACL,gBAAA;oBACEqC,MAAAA,GAAS,QAAA;AACb;YAEA,OAAO;AACLA,gBAAAA,MAAAA;AACArC,gBAAAA,IAAAA,EAAMyD,KAAKzD,IAAI;gBACfmE,UAAAA,EAAYnB,cAAAA,CAAee,IAAAA,CAAKP,eAAAA,CAAgBC,IAAAA,CAAAA,EAAO;AAAC,oBAAA,QAAA;AAAU,oBAAA;AAAO,iBAAA,CAAA;AAC3E,aAAA;AACF,QAAA,CAAA;AACF,KAAA;AACF,CAAA;AAEA,MAAMnB,iBAAAA,GAAoB,CACxBoB,IAAAA,EACAU,MAAAA,EACAC,UAAAA,GAAAA;AAEA,IAAA,IAAI,CAACX,IAAAA,IAAQ,OAAOA,IAAAA,CAAKrB,MAAM,KAAK,QAAA,EAAU;AAC5C,QAAA;AACF,IAAA;AAEA,IAAA,MAAMiC,gBAAgBD,UAAAA,KAAe,aAAA;AAErC,IAAA,OAAQX,KAAKrB,MAAM;QACjB,KAAK,QAAA;AACH,YAAA,IAAIiC,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAOhD,eAAe,EAAA;YACxB,CAAA,MAAO;AACLgD,gBAAAA,MAAAA,CAAO7C,aAAa,EAAA;AACtB,YAAA;AACA,YAAA;QACF,KAAK,QAAA;AACH,YAAA,IAAI+C,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAO/C,kBAAkB,EAAA;YAC3B,CAAA,MAAO;AACL+C,gBAAAA,MAAAA,CAAO5C,gBAAgB,EAAA;AACzB,YAAA;AACA,YAAA;QACF,KAAK,QAAA;AACH,YAAA,IAAI8C,aAAAA,EAAe;AACjBF,gBAAAA,MAAAA,CAAO9C,mBAAmB,EAAA;YAC5B,CAAA,MAAO;AACL8C,gBAAAA,MAAAA,CAAO3C,iBAAiB,EAAA;AAC1B,YAAA;AACA,YAAA;AAGJ;AAEA,IAAA,IAAI4B,KAAAA,CAAMC,OAAO,CAACI,IAAAA,CAAKQ,UAAU,CAAA,EAAG;QAClC,IAAIR,IAAAA,CAAKrB,MAAM,KAAK,QAAA,EAAU;AAC5B+B,YAAAA,MAAAA,CAAOxC,aAAa,IAAI8B,IAAAA,CAAKQ,UAAU,CAACX,MAAM;QAChD,CAAA,MAAO;AACLG,YAAAA,IAAAA,CAAKQ,UAAU,CAACK,OAAO,CAAC,CAACC,SAAAA,GAAAA;AACvB,gBAAA,IAAI,CAACA,SAAAA,IAAa,OAAOA,SAAAA,CAAU/D,MAAM,KAAK,QAAA,EAAU;AACtD,oBAAA;AACF,gBAAA;AAEA,gBAAA,OAAQ+D,UAAU/D,MAAM;oBACtB,KAAK,KAAA;AACH2D,wBAAAA,MAAAA,CAAO1C,SAAS,EAAA;AAChB,wBAAA;oBACF,KAAK,SAAA;AACH0C,wBAAAA,MAAAA,CAAOzC,YAAY,EAAA;AACnB,wBAAA;oBACF,KAAK,SAAA;AACHyC,wBAAAA,MAAAA,CAAOxC,aAAa,EAAA;AACpB,wBAAA;AAIJ;AACF,YAAA,CAAA,CAAA;AACF,QAAA;AACF,IAAA;AACF,CAAA;;;;"}

package/dist/admin/components/DataManager/utils/groupRenameChains.js

@@ -0,0 +1,86 @@
+'use strict';
+
+const findRoot = (parent, name)=>{
+    let current = name;
+    while(parent.get(current) !== current){
+        current = parent.get(current);
+    }
+    // Path compression keeps repeated lookups cheap on long chains.
+    let node = name;
+    while(parent.get(node) !== current){
+        const next = parent.get(node);
+        parent.set(node, current);
+        node = next;
+    }
+    return current;
+};
+const union = (parent, a, b)=>{
+    if (!parent.has(a)) {
+        parent.set(a, a);
+    }
+    if (!parent.has(b)) {
+        parent.set(b, b);
+    }
+    const rootA = findRoot(parent, a);
+    const rootB = findRoot(parent, b);
+    if (rootA !== rootB) {
+        parent.set(rootB, rootA);
+    }
+};
+const buildChain = (uid, renames, hopIndexes)=>{
+    // current name -> original name, seeded lazily: a hop whose `oldName` is not
+    // yet tracked starts from an original attribute.
+    const originalOf = new Map();
+    const firstIndexOf = new Map();
+    const intermediates = [];
+    hopIndexes.forEach((index)=>{
+        const { oldName, newName } = renames[index];
+        if (!originalOf.has(oldName)) {
+            originalOf.set(oldName, oldName);
+            firstIndexOf.set(oldName, index);
+        }
+        const original = originalOf.get(oldName);
+        originalOf.delete(oldName);
+        originalOf.set(newName, original);
+        intermediates.push(newName);
+    });
+    const pairs = [
+        ...originalOf.entries()
+    ].filter(([current, original])=>current !== original).map(([current, original])=>({
+            oldName: original,
+            newName: current
+        })).sort((a, b)=>(firstIndexOf.get(a.oldName) ?? 0) - (firstIndexOf.get(b.oldName) ?? 0));
+    const finalNames = new Set(originalOf.keys());
+    const via = intermediates.filter((name, position)=>!finalNames.has(name) && !firstIndexOf.has(name) && intermediates.indexOf(name) === position);
+    return {
+        id: `${uid}:chain:${hopIndexes[0]}`,
+        hopIndexes,
+        pairs,
+        via
+    };
+};
+/**
+ * Groups a type's ordered `renames[]` into chains (see `RenameChain`). Chains
+ * are ordered by their first hop; hops inside a chain keep their index order.
+ */ const groupRenameChains = (uid, renames)=>{
+    const parent = new Map();
+    renames.forEach((hop)=>union(parent, hop.oldName, hop.newName));
+    const buckets = new Map();
+    renames.forEach((hop, index)=>{
+        const root = findRoot(parent, hop.oldName);
+        const bucket = buckets.get(root);
+        if (bucket) {
+            bucket.push(index);
+        } else {
+            buckets.set(root, [
+                index
+            ]);
+        }
+    });
+    return [
+        ...buckets.values()
+    ].sort((a, b)=>a[0] - b[0]).map((hopIndexes)=>buildChain(uid, renames, hopIndexes));
+};
+
+exports.groupRenameChains = groupRenameChains;
+//# sourceMappingURL=groupRenameChains.js.map

package/dist/admin/components/DataManager/utils/groupRenameChains.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupRenameChains.js","sources":["../../../../../admin/src/components/DataManager/utils/groupRenameChains.ts"],"sourcesContent":["import type { RenameHop } from '../../../types';\n\nexport interface RenamePair {\n  oldName: string;\n  newName: string;\n}\n\n/**\n * A group of rename hops on one type that share attribute names, transitively:\n * `a -> b`, `b -> c` is one chain, so is the swap `a -> tmp`, `b -> a`,\n * `tmp -> b`, while `a -> b` and `x -> y` are two chains. Consent to preserve\n * data is given per chain, never per hop, because replaying a partial chain\n * either fails or silently skips hops whose target column still exists.\n */\nexport interface RenameChain {\n  /** `${uid}:chain:${firstHopIndex}` — stable key for consent decisions. */\n  id: string;\n  /** Indexes into the type's ordered `renames[]`, ascending. */\n  hopIndexes: number[];\n  /** Net effect after replaying the chain's hops, in first-appearance order. */\n  pairs: RenamePair[];\n  /** Names that only ever appear as intermediates (e.g. `tmp`). */\n  via: string[];\n}\n\nconst findRoot = (parent: Map<string, string>, name: string): string => {\n  let current = name;\n  while (parent.get(current) !== current) {\n    current = parent.get(current) as string;\n  }\n  // Path compression keeps repeated lookups cheap on long chains.\n  let node = name;\n  while (parent.get(node) !== current) {\n    const next = parent.get(node) as string;\n    parent.set(node, current);\n    node = next;\n  }\n  return current;\n};\n\nconst union = (parent: Map<string, string>, a: string, b: string): void => {\n  if (!parent.has(a)) {\n    parent.set(a, a);\n  }\n  if (!parent.has(b)) {\n    parent.set(b, b);\n  }\n  const rootA = findRoot(parent, a);\n  const rootB = findRoot(parent, b);\n  if (rootA !== rootB) {\n    parent.set(rootB, rootA);\n  }\n};\n\nconst buildChain = (uid: string, renames: RenameHop[], hopIndexes: number[]): RenameChain => {\n  // current name -> original name, seeded lazily: a hop whose `oldName` is not\n  // yet tracked starts from an original attribute.\n  const originalOf = new Map<string, string>();\n  const firstIndexOf = new Map<string, number>();\n  const intermediates: string[] = [];\n\n  hopIndexes.forEach((index) => {\n    const { oldName, newName } = renames[index];\n\n    if (!originalOf.has(oldName)) {\n      originalOf.set(oldName, oldName);\n      firstIndexOf.set(oldName, index);\n    }\n\n    const original = originalOf.get(oldName) as string;\n    originalOf.delete(oldName);\n    originalOf.set(newName, original);\n    intermediates.push(newName);\n  });\n\n  const pairs = [...originalOf.entries()]\n    .filter(([current, original]) => current !== original)\n    .map(([current, original]) => ({ oldName: original, newName: current }))\n    .sort((a, b) => (firstIndexOf.get(a.oldName) ?? 0) - (firstIndexOf.get(b.oldName) ?? 0));\n\n  const finalNames = new Set(originalOf.keys());\n  const via = intermediates.filter(\n    (name, position) =>\n      !finalNames.has(name) && !firstIndexOf.has(name) && intermediates.indexOf(name) === position\n  );\n\n  return { id: `${uid}:chain:${hopIndexes[0]}`, hopIndexes, pairs, via };\n};\n\n/**\n * Groups a type's ordered `renames[]` into chains (see `RenameChain`). Chains\n * are ordered by their first hop; hops inside a chain keep their index order.\n */\nexport const groupRenameChains = (uid: string, renames: RenameHop[]): RenameChain[] => {\n  const parent = new Map<string, string>();\n  renames.forEach((hop) => union(parent, hop.oldName, hop.newName));\n\n  const buckets = new Map<string, number[]>();\n  renames.forEach((hop, index) => {\n    const root = findRoot(parent, hop.oldName);\n    const bucket = buckets.get(root);\n    if (bucket) {\n      bucket.push(index);\n    } else {\n      buckets.set(root, [index]);\n    }\n  });\n\n  return [...buckets.values()]\n    .sort((a, b) => a[0] - b[0])\n    .map((hopIndexes) => buildChain(uid, renames, hopIndexes));\n};\n\n/**\n * Maps every hop index of `renames` to the chain it belongs to.\n */\nexport const chainByHopIndex = (chains: RenameChain[]): Map<number, RenameChain> => {\n  const byIndex = new Map<number, RenameChain>();\n  chains.forEach((chain) => chain.hopIndexes.forEach((index) => byIndex.set(index, chain)));\n  return byIndex;\n};\n"],"names":["findRoot","parent","name","current","get","node","next","set","union","a","b","has","rootA","rootB","buildChain","uid","renames","hopIndexes","originalOf","Map","firstIndexOf","intermediates","forEach","index","oldName","newName","original","delete","push","pairs","entries","filter","map","sort","finalNames","Set","keys","via","position","indexOf","id","groupRenameChains","hop","buckets","root","bucket","values"],"mappings":";;AAyBA,MAAMA,QAAAA,GAAW,CAACC,MAAAA,EAA6BC,IAAAA,GAAAA;AAC7C,IAAA,IAAIC,OAAAA,GAAUD,IAAAA;AACd,IAAA,MAAOD,MAAAA,CAAOG,GAAG,CAACD,OAAAA,CAAAA,KAAaA,OAAAA,CAAS;QACtCA,OAAAA,GAAUF,MAAAA,CAAOG,GAAG,CAACD,OAAAA,CAAAA;AACvB,IAAA;;AAEA,IAAA,IAAIE,IAAAA,GAAOH,IAAAA;AACX,IAAA,MAAOD,MAAAA,CAAOG,GAAG,CAACC,IAAAA,CAAAA,KAAUF,OAAAA,CAAS;QACnC,MAAMG,IAAAA,GAAOL,MAAAA,CAAOG,GAAG,CAACC,IAAAA,CAAAA;QACxBJ,MAAAA,CAAOM,GAAG,CAACF,IAAAA,EAAMF,OAAAA,CAAAA;QACjBE,IAAAA,GAAOC,IAAAA;AACT,IAAA;IACA,OAAOH,OAAAA;AACT,CAAA;AAEA,MAAMK,KAAAA,GAAQ,CAACP,MAAAA,EAA6BQ,CAAAA,EAAWC,CAAAA,GAAAA;AACrD,IAAA,IAAI,CAACT,MAAAA,CAAOU,GAAG,CAACF,CAAAA,CAAAA,EAAI;QAClBR,MAAAA,CAAOM,GAAG,CAACE,CAAAA,EAAGA,CAAAA,CAAAA;AAChB,IAAA;AACA,IAAA,IAAI,CAACR,MAAAA,CAAOU,GAAG,CAACD,CAAAA,CAAAA,EAAI;QAClBT,MAAAA,CAAOM,GAAG,CAACG,CAAAA,EAAGA,CAAAA,CAAAA;AAChB,IAAA;IACA,MAAME,KAAAA,GAAQZ,SAASC,MAAAA,EAAQQ,CAAAA,CAAAA;IAC/B,MAAMI,KAAAA,GAAQb,SAASC,MAAAA,EAAQS,CAAAA,CAAAA;AAC/B,IAAA,IAAIE,UAAUC,KAAAA,EAAO;QACnBZ,MAAAA,CAAOM,GAAG,CAACM,KAAAA,EAAOD,KAAAA,CAAAA;AACpB,IAAA;AACF,CAAA;AAEA,MAAME,UAAAA,GAAa,CAACC,GAAAA,EAAaC,OAAAA,EAAsBC,UAAAA,GAAAA;;;AAGrD,IAAA,MAAMC,aAAa,IAAIC,GAAAA,EAAAA;AACvB,IAAA,MAAMC,eAAe,IAAID,GAAAA,EAAAA;AACzB,IAAA,MAAME,gBAA0B,EAAE;IAElCJ,UAAAA,CAAWK,OAAO,CAAC,CAACC,KAAAA,GAAAA;QAClB,MAAM,EAAEC,OAAO,EAAEC,OAAO,EAAE,GAAGT,OAAO,CAACO,KAAAA,CAAM;AAE3C,QAAA,IAAI,CAACL,UAAAA,CAAWP,GAAG,CAACa,OAAAA,CAAAA,EAAU;YAC5BN,UAAAA,CAAWX,GAAG,CAACiB,OAAAA,EAASA,OAAAA,CAAAA;YACxBJ,YAAAA,CAAab,GAAG,CAACiB,OAAAA,EAASD,KAAAA,CAAAA;AAC5B,QAAA;QAEA,MAAMG,QAAAA,GAAWR,UAAAA,CAAWd,GAAG,CAACoB,OAAAA,CAAAA;AAChCN,QAAAA,UAAAA,CAAWS,MAAM,CAACH,OAAAA,CAAAA;QAClBN,UAAAA,CAAWX,GAAG,CAACkB,OAAAA,EAASC,QAAAA,CAAAA;AACxBL,QAAAA,aAAAA,CAAcO,IAAI,CAACH,OAAAA,CAAAA;AACrB,IAAA,CAAA,CAAA;AAEA,IAAA,MAAMI,KAAAA,GAAQ;AAAIX,QAAAA,GAAAA,UAAAA,CAAWY,OAAO;AAAG,KAAA,CACpCC,MAAM,CAAC,CAAC,CAAC5B,OAAAA,EAASuB,SAAS,GAAKvB,OAAAA,KAAYuB,QAAAA,CAAAA,CAC5CM,GAAG,CAAC,CAAC,CAAC7B,OAAAA,EAASuB,QAAAA,CAAS,IAAM;YAAEF,OAAAA,EAASE,QAAAA;YAAUD,OAAAA,EAAStB;SAAQ,CAAA,CAAA,CACpE8B,IAAI,CAAC,CAACxB,GAAGC,CAAAA,GAAOU,CAAAA,YAAAA,CAAahB,GAAG,CAACK,EAAEe,OAAO,CAAA,IAAK,CAAA,KAAMJ,YAAAA,CAAahB,GAAG,CAACM,CAAAA,CAAEc,OAAO,CAAA,IAAK,CAAA,CAAA,CAAA;AAEvF,IAAA,MAAMU,UAAAA,GAAa,IAAIC,GAAAA,CAAIjB,UAAAA,CAAWkB,IAAI,EAAA,CAAA;IAC1C,MAAMC,GAAAA,GAAMhB,cAAcU,MAAM,CAC9B,CAAC7B,IAAAA,EAAMoC,QAAAA,GACL,CAACJ,UAAAA,CAAWvB,GAAG,CAACT,IAAAA,CAAAA,IAAS,CAACkB,aAAaT,GAAG,CAACT,SAASmB,aAAAA,CAAckB,OAAO,CAACrC,IAAAA,CAAAA,KAAUoC,QAAAA,CAAAA;IAGxF,OAAO;AAAEE,QAAAA,EAAAA,EAAI,GAAGzB,GAAAA,CAAI,OAAO,EAAEE,UAAU,CAAC,EAAE,CAAA,CAAE;AAAEA,QAAAA,UAAAA;AAAYY,QAAAA,KAAAA;AAAOQ,QAAAA;AAAI,KAAA;AACvE,CAAA;AAEA;;;AAGC,IACM,MAAMI,iBAAAA,GAAoB,CAAC1B,GAAAA,EAAaC,OAAAA,GAAAA;AAC7C,IAAA,MAAMf,SAAS,IAAIkB,GAAAA,EAAAA;IACnBH,OAAAA,CAAQM,OAAO,CAAC,CAACoB,GAAAA,GAAQlC,KAAAA,CAAMP,QAAQyC,GAAAA,CAAIlB,OAAO,EAAEkB,GAAAA,CAAIjB,OAAO,CAAA,CAAA;AAE/D,IAAA,MAAMkB,UAAU,IAAIxB,GAAAA,EAAAA;IACpBH,OAAAA,CAAQM,OAAO,CAAC,CAACoB,GAAAA,EAAKnB,KAAAA,GAAAA;AACpB,QAAA,MAAMqB,IAAAA,GAAO5C,QAAAA,CAASC,MAAAA,EAAQyC,GAAAA,CAAIlB,OAAO,CAAA;QACzC,MAAMqB,MAAAA,GAASF,OAAAA,CAAQvC,GAAG,CAACwC,IAAAA,CAAAA;AAC3B,QAAA,IAAIC,MAAAA,EAAQ;AACVA,YAAAA,MAAAA,CAAOjB,IAAI,CAACL,KAAAA,CAAAA;QACd,CAAA,MAAO;YACLoB,OAAAA,CAAQpC,GAAG,CAACqC,IAAAA,EAAM;AAACrB,gBAAAA;AAAM,aAAA,CAAA;AAC3B,QAAA;AACF,IAAA,CAAA,CAAA;IAEA,OAAO;AAAIoB,QAAAA,GAAAA,OAAAA,CAAQG,MAAM;AAAG,KAAA,CACzBb,IAAI,CAAC,CAACxB,GAAGC,CAAAA,GAAMD,CAAC,CAAC,CAAA,CAAE,GAAGC,CAAC,CAAC,CAAA,CAAE,EAC1BsB,GAAG,CAAC,CAACf,UAAAA,GAAeH,UAAAA,CAAWC,KAAKC,OAAAA,EAASC,UAAAA,CAAAA,CAAAA;AAClD;;;;"}

package/dist/admin/components/DataManager/utils/groupRenameChains.mjs

@@ -0,0 +1,84 @@
+const findRoot = (parent, name)=>{
+    let current = name;
+    while(parent.get(current) !== current){
+        current = parent.get(current);
+    }
+    // Path compression keeps repeated lookups cheap on long chains.
+    let node = name;
+    while(parent.get(node) !== current){
+        const next = parent.get(node);
+        parent.set(node, current);
+        node = next;
+    }
+    return current;
+};
+const union = (parent, a, b)=>{
+    if (!parent.has(a)) {
+        parent.set(a, a);
+    }
+    if (!parent.has(b)) {
+        parent.set(b, b);
+    }
+    const rootA = findRoot(parent, a);
+    const rootB = findRoot(parent, b);
+    if (rootA !== rootB) {
+        parent.set(rootB, rootA);
+    }
+};
+const buildChain = (uid, renames, hopIndexes)=>{
+    // current name -> original name, seeded lazily: a hop whose `oldName` is not
+    // yet tracked starts from an original attribute.
+    const originalOf = new Map();
+    const firstIndexOf = new Map();
+    const intermediates = [];
+    hopIndexes.forEach((index)=>{
+        const { oldName, newName } = renames[index];
+        if (!originalOf.has(oldName)) {
+            originalOf.set(oldName, oldName);
+            firstIndexOf.set(oldName, index);
+        }
+        const original = originalOf.get(oldName);
+        originalOf.delete(oldName);
+        originalOf.set(newName, original);
+        intermediates.push(newName);
+    });
+    const pairs = [
+        ...originalOf.entries()
+    ].filter(([current, original])=>current !== original).map(([current, original])=>({
+            oldName: original,
+            newName: current
+        })).sort((a, b)=>(firstIndexOf.get(a.oldName) ?? 0) - (firstIndexOf.get(b.oldName) ?? 0));
+    const finalNames = new Set(originalOf.keys());
+    const via = intermediates.filter((name, position)=>!finalNames.has(name) && !firstIndexOf.has(name) && intermediates.indexOf(name) === position);
+    return {
+        id: `${uid}:chain:${hopIndexes[0]}`,
+        hopIndexes,
+        pairs,
+        via
+    };
+};
+/**
+ * Groups a type's ordered `renames[]` into chains (see `RenameChain`). Chains
+ * are ordered by their first hop; hops inside a chain keep their index order.
+ */ const groupRenameChains = (uid, renames)=>{
+    const parent = new Map();
+    renames.forEach((hop)=>union(parent, hop.oldName, hop.newName));
+    const buckets = new Map();
+    renames.forEach((hop, index)=>{
+        const root = findRoot(parent, hop.oldName);
+        const bucket = buckets.get(root);
+        if (bucket) {
+            bucket.push(index);
+        } else {
+            buckets.set(root, [
+                index
+            ]);
+        }
+    });
+    return [
+        ...buckets.values()
+    ].sort((a, b)=>a[0] - b[0]).map((hopIndexes)=>buildChain(uid, renames, hopIndexes));
+};
+
+export { groupRenameChains };
+//# sourceMappingURL=groupRenameChains.mjs.map

package/dist/admin/components/DataManager/utils/groupRenameChains.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupRenameChains.mjs","sources":["../../../../../admin/src/components/DataManager/utils/groupRenameChains.ts"],"sourcesContent":["import type { RenameHop } from '../../../types';\n\nexport interface RenamePair {\n  oldName: string;\n  newName: string;\n}\n\n/**\n * A group of rename hops on one type that share attribute names, transitively:\n * `a -> b`, `b -> c` is one chain, so is the swap `a -> tmp`, `b -> a`,\n * `tmp -> b`, while `a -> b` and `x -> y` are two chains. Consent to preserve\n * data is given per chain, never per hop, because replaying a partial chain\n * either fails or silently skips hops whose target column still exists.\n */\nexport interface RenameChain {\n  /** `${uid}:chain:${firstHopIndex}` — stable key for consent decisions. */\n  id: string;\n  /** Indexes into the type's ordered `renames[]`, ascending. */\n  hopIndexes: number[];\n  /** Net effect after replaying the chain's hops, in first-appearance order. */\n  pairs: RenamePair[];\n  /** Names that only ever appear as intermediates (e.g. `tmp`). */\n  via: string[];\n}\n\nconst findRoot = (parent: Map<string, string>, name: string): string => {\n  let current = name;\n  while (parent.get(current) !== current) {\n    current = parent.get(current) as string;\n  }\n  // Path compression keeps repeated lookups cheap on long chains.\n  let node = name;\n  while (parent.get(node) !== current) {\n    const next = parent.get(node) as string;\n    parent.set(node, current);\n    node = next;\n  }\n  return current;\n};\n\nconst union = (parent: Map<string, string>, a: string, b: string): void => {\n  if (!parent.has(a)) {\n    parent.set(a, a);\n  }\n  if (!parent.has(b)) {\n    parent.set(b, b);\n  }\n  const rootA = findRoot(parent, a);\n  const rootB = findRoot(parent, b);\n  if (rootA !== rootB) {\n    parent.set(rootB, rootA);\n  }\n};\n\nconst buildChain = (uid: string, renames: RenameHop[], hopIndexes: number[]): RenameChain => {\n  // current name -> original name, seeded lazily: a hop whose `oldName` is not\n  // yet tracked starts from an original attribute.\n  const originalOf = new Map<string, string>();\n  const firstIndexOf = new Map<string, number>();\n  const intermediates: string[] = [];\n\n  hopIndexes.forEach((index) => {\n    const { oldName, newName } = renames[index];\n\n    if (!originalOf.has(oldName)) {\n      originalOf.set(oldName, oldName);\n      firstIndexOf.set(oldName, index);\n    }\n\n    const original = originalOf.get(oldName) as string;\n    originalOf.delete(oldName);\n    originalOf.set(newName, original);\n    intermediates.push(newName);\n  });\n\n  const pairs = [...originalOf.entries()]\n    .filter(([current, original]) => current !== original)\n    .map(([current, original]) => ({ oldName: original, newName: current }))\n    .sort((a, b) => (firstIndexOf.get(a.oldName) ?? 0) - (firstIndexOf.get(b.oldName) ?? 0));\n\n  const finalNames = new Set(originalOf.keys());\n  const via = intermediates.filter(\n    (name, position) =>\n      !finalNames.has(name) && !firstIndexOf.has(name) && intermediates.indexOf(name) === position\n  );\n\n  return { id: `${uid}:chain:${hopIndexes[0]}`, hopIndexes, pairs, via };\n};\n\n/**\n * Groups a type's ordered `renames[]` into chains (see `RenameChain`). Chains\n * are ordered by their first hop; hops inside a chain keep their index order.\n */\nexport const groupRenameChains = (uid: string, renames: RenameHop[]): RenameChain[] => {\n  const parent = new Map<string, string>();\n  renames.forEach((hop) => union(parent, hop.oldName, hop.newName));\n\n  const buckets = new Map<string, number[]>();\n  renames.forEach((hop, index) => {\n    const root = findRoot(parent, hop.oldName);\n    const bucket = buckets.get(root);\n    if (bucket) {\n      bucket.push(index);\n    } else {\n      buckets.set(root, [index]);\n    }\n  });\n\n  return [...buckets.values()]\n    .sort((a, b) => a[0] - b[0])\n    .map((hopIndexes) => buildChain(uid, renames, hopIndexes));\n};\n\n/**\n * Maps every hop index of `renames` to the chain it belongs to.\n */\nexport const chainByHopIndex = (chains: RenameChain[]): Map<number, RenameChain> => {\n  const byIndex = new Map<number, RenameChain>();\n  chains.forEach((chain) => chain.hopIndexes.forEach((index) => byIndex.set(index, chain)));\n  return byIndex;\n};\n"],"names":["findRoot","parent","name","current","get","node","next","set","union","a","b","has","rootA","rootB","buildChain","uid","renames","hopIndexes","originalOf","Map","firstIndexOf","intermediates","forEach","index","oldName","newName","original","delete","push","pairs","entries","filter","map","sort","finalNames","Set","keys","via","position","indexOf","id","groupRenameChains","hop","buckets","root","bucket","values"],"mappings":"AAyBA,MAAMA,QAAAA,GAAW,CAACC,MAAAA,EAA6BC,IAAAA,GAAAA;AAC7C,IAAA,IAAIC,OAAAA,GAAUD,IAAAA;AACd,IAAA,MAAOD,MAAAA,CAAOG,GAAG,CAACD,OAAAA,CAAAA,KAAaA,OAAAA,CAAS;QACtCA,OAAAA,GAAUF,MAAAA,CAAOG,GAAG,CAACD,OAAAA,CAAAA;AACvB,IAAA;;AAEA,IAAA,IAAIE,IAAAA,GAAOH,IAAAA;AACX,IAAA,MAAOD,MAAAA,CAAOG,GAAG,CAACC,IAAAA,CAAAA,KAAUF,OAAAA,CAAS;QACnC,MAAMG,IAAAA,GAAOL,MAAAA,CAAOG,GAAG,CAACC,IAAAA,CAAAA;QACxBJ,MAAAA,CAAOM,GAAG,CAACF,IAAAA,EAAMF,OAAAA,CAAAA;QACjBE,IAAAA,GAAOC,IAAAA;AACT,IAAA;IACA,OAAOH,OAAAA;AACT,CAAA;AAEA,MAAMK,KAAAA,GAAQ,CAACP,MAAAA,EAA6BQ,CAAAA,EAAWC,CAAAA,GAAAA;AACrD,IAAA,IAAI,CAACT,MAAAA,CAAOU,GAAG,CAACF,CAAAA,CAAAA,EAAI;QAClBR,MAAAA,CAAOM,GAAG,CAACE,CAAAA,EAAGA,CAAAA,CAAAA;AAChB,IAAA;AACA,IAAA,IAAI,CAACR,MAAAA,CAAOU,GAAG,CAACD,CAAAA,CAAAA,EAAI;QAClBT,MAAAA,CAAOM,GAAG,CAACG,CAAAA,EAAGA,CAAAA,CAAAA;AAChB,IAAA;IACA,MAAME,KAAAA,GAAQZ,SAASC,MAAAA,EAAQQ,CAAAA,CAAAA;IAC/B,MAAMI,KAAAA,GAAQb,SAASC,MAAAA,EAAQS,CAAAA,CAAAA;AAC/B,IAAA,IAAIE,UAAUC,KAAAA,EAAO;QACnBZ,MAAAA,CAAOM,GAAG,CAACM,KAAAA,EAAOD,KAAAA,CAAAA;AACpB,IAAA;AACF,CAAA;AAEA,MAAME,UAAAA,GAAa,CAACC,GAAAA,EAAaC,OAAAA,EAAsBC,UAAAA,GAAAA;;;AAGrD,IAAA,MAAMC,aAAa,IAAIC,GAAAA,EAAAA;AACvB,IAAA,MAAMC,eAAe,IAAID,GAAAA,EAAAA;AACzB,IAAA,MAAME,gBAA0B,EAAE;IAElCJ,UAAAA,CAAWK,OAAO,CAAC,CAACC,KAAAA,GAAAA;QAClB,MAAM,EAAEC,OAAO,EAAEC,OAAO,EAAE,GAAGT,OAAO,CAACO,KAAAA,CAAM;AAE3C,QAAA,IAAI,CAACL,UAAAA,CAAWP,GAAG,CAACa,OAAAA,CAAAA,EAAU;YAC5BN,UAAAA,CAAWX,GAAG,CAACiB,OAAAA,EAASA,OAAAA,CAAAA;YACxBJ,YAAAA,CAAab,GAAG,CAACiB,OAAAA,EAASD,KAAAA,CAAAA;AAC5B,QAAA;QAEA,MAAMG,QAAAA,GAAWR,UAAAA,CAAWd,GAAG,CAACoB,OAAAA,CAAAA;AAChCN,QAAAA,UAAAA,CAAWS,MAAM,CAACH,OAAAA,CAAAA;QAClBN,UAAAA,CAAWX,GAAG,CAACkB,OAAAA,EAASC,QAAAA,CAAAA;AACxBL,QAAAA,aAAAA,CAAcO,IAAI,CAACH,OAAAA,CAAAA;AACrB,IAAA,CAAA,CAAA;AAEA,IAAA,MAAMI,KAAAA,GAAQ;AAAIX,QAAAA,GAAAA,UAAAA,CAAWY,OAAO;AAAG,KAAA,CACpCC,MAAM,CAAC,CAAC,CAAC5B,OAAAA,EAASuB,SAAS,GAAKvB,OAAAA,KAAYuB,QAAAA,CAAAA,CAC5CM,GAAG,CAAC,CAAC,CAAC7B,OAAAA,EAASuB,QAAAA,CAAS,IAAM;YAAEF,OAAAA,EAASE,QAAAA;YAAUD,OAAAA,EAAStB;SAAQ,CAAA,CAAA,CACpE8B,IAAI,CAAC,CAACxB,GAAGC,CAAAA,GAAOU,CAAAA,YAAAA,CAAahB,GAAG,CAACK,EAAEe,OAAO,CAAA,IAAK,CAAA,KAAMJ,YAAAA,CAAahB,GAAG,CAACM,CAAAA,CAAEc,OAAO,CAAA,IAAK,CAAA,CAAA,CAAA;AAEvF,IAAA,MAAMU,UAAAA,GAAa,IAAIC,GAAAA,CAAIjB,UAAAA,CAAWkB,IAAI,EAAA,CAAA;IAC1C,MAAMC,GAAAA,GAAMhB,cAAcU,MAAM,CAC9B,CAAC7B,IAAAA,EAAMoC,QAAAA,GACL,CAACJ,UAAAA,CAAWvB,GAAG,CAACT,IAAAA,CAAAA,IAAS,CAACkB,aAAaT,GAAG,CAACT,SAASmB,aAAAA,CAAckB,OAAO,CAACrC,IAAAA,CAAAA,KAAUoC,QAAAA,CAAAA;IAGxF,OAAO;AAAEE,QAAAA,EAAAA,EAAI,GAAGzB,GAAAA,CAAI,OAAO,EAAEE,UAAU,CAAC,EAAE,CAAA,CAAE;AAAEA,QAAAA,UAAAA;AAAYY,QAAAA,KAAAA;AAAOQ,QAAAA;AAAI,KAAA;AACvE,CAAA;AAEA;;;AAGC,IACM,MAAMI,iBAAAA,GAAoB,CAAC1B,GAAAA,EAAaC,OAAAA,GAAAA;AAC7C,IAAA,MAAMf,SAAS,IAAIkB,GAAAA,EAAAA;IACnBH,OAAAA,CAAQM,OAAO,CAAC,CAACoB,GAAAA,GAAQlC,KAAAA,CAAMP,QAAQyC,GAAAA,CAAIlB,OAAO,EAAEkB,GAAAA,CAAIjB,OAAO,CAAA,CAAA;AAE/D,IAAA,MAAMkB,UAAU,IAAIxB,GAAAA,EAAAA;IACpBH,OAAAA,CAAQM,OAAO,CAAC,CAACoB,GAAAA,EAAKnB,KAAAA,GAAAA;AACpB,QAAA,MAAMqB,IAAAA,GAAO5C,QAAAA,CAASC,MAAAA,EAAQyC,GAAAA,CAAIlB,OAAO,CAAA;QACzC,MAAMqB,MAAAA,GAASF,OAAAA,CAAQvC,GAAG,CAACwC,IAAAA,CAAAA;AAC3B,QAAA,IAAIC,MAAAA,EAAQ;AACVA,YAAAA,MAAAA,CAAOjB,IAAI,CAACL,KAAAA,CAAAA;QACd,CAAA,MAAO;YACLoB,OAAAA,CAAQpC,GAAG,CAACqC,IAAAA,EAAM;AAACrB,gBAAAA;AAAM,aAAA,CAAA;AAC3B,QAAA;AACF,IAAA,CAAA,CAAA;IAEA,OAAO;AAAIoB,QAAAA,GAAAA,OAAAA,CAAQG,MAAM;AAAG,KAAA,CACzBb,IAAI,CAAC,CAACxB,GAAGC,CAAAA,GAAMD,CAAC,CAAC,CAAA,CAAE,GAAGC,CAAC,CAAC,CAAA,CAAE,EAC1BsB,GAAG,CAAC,CAACf,UAAAA,GAAeH,UAAAA,CAAWC,KAAKC,OAAAA,EAASC,UAAAA,CAAAA,CAAAA;AAClD;;;;"}

package/dist/admin/components/DataManager/utils/isStorageCompatibleRename.js

@@ -0,0 +1,29 @@
+'use strict';
+
+var getRelationType = require('../../../utils/getRelationType.js');
+
+/**
+ * Whether `newAttribute` keeps the storage of `previousAttribute`, i.e. whether
+ * renaming the underlying database artifact is enough to carry the data over.
+ * A type change (or a relation retargeted or its direction switched, or a
+ * component swapped) must go through the regular drop-and-recreate path:
+ * renaming the column and letting schema sync alter its type in place can fail
+ * at startup on Postgres/MySQL.
+ */ const isStorageCompatibleRename = (previousAttribute, newAttribute)=>{
+    if (previousAttribute.type !== newAttribute.type) {
+        return false;
+    }
+    if (previousAttribute.type === 'relation' && newAttribute.type === 'relation') {
+        return previousAttribute.relation === newAttribute.relation && previousAttribute.target === newAttribute.target && // `manyWay` and a bidirectional `oneToMany` share `relation: 'oneToMany'`
+        // but own their join table differently, so switching direction is not a
+        // plain rename.
+        getRelationType.getRelationType(previousAttribute.relation, previousAttribute.targetAttribute) === getRelationType.getRelationType(newAttribute.relation, newAttribute.targetAttribute);
+    }
+    if (previousAttribute.type === 'component' && newAttribute.type === 'component') {
+        return previousAttribute.component === newAttribute.component && Boolean(previousAttribute.repeatable) === Boolean(newAttribute.repeatable);
+    }
+    return true;
+};
+
+exports.isStorageCompatibleRename = isStorageCompatibleRename;
+//# sourceMappingURL=isStorageCompatibleRename.js.map

package/dist/admin/components/DataManager/utils/isStorageCompatibleRename.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isStorageCompatibleRename.js","sources":["../../../../../admin/src/components/DataManager/utils/isStorageCompatibleRename.ts"],"sourcesContent":["import { getRelationType } from '../../../utils/getRelationType';\n\nimport type { AnyAttribute } from '../../../types';\n\n/**\n * Whether `newAttribute` keeps the storage of `previousAttribute`, i.e. whether\n * renaming the underlying database artifact is enough to carry the data over.\n * A type change (or a relation retargeted or its direction switched, or a\n * component swapped) must go through the regular drop-and-recreate path:\n * renaming the column and letting schema sync alter its type in place can fail\n * at startup on Postgres/MySQL.\n */\nexport const isStorageCompatibleRename = (\n  previousAttribute: AnyAttribute,\n  newAttribute: AnyAttribute\n): boolean => {\n  if (previousAttribute.type !== newAttribute.type) {\n    return false;\n  }\n\n  if (previousAttribute.type === 'relation' && newAttribute.type === 'relation') {\n    return (\n      previousAttribute.relation === newAttribute.relation &&\n      previousAttribute.target === newAttribute.target &&\n      // `manyWay` and a bidirectional `oneToMany` share `relation: 'oneToMany'`\n      // but own their join table differently, so switching direction is not a\n      // plain rename.\n      getRelationType(previousAttribute.relation, previousAttribute.targetAttribute) ===\n        getRelationType(newAttribute.relation, newAttribute.targetAttribute)\n    );\n  }\n\n  if (previousAttribute.type === 'component' && newAttribute.type === 'component') {\n    return (\n      previousAttribute.component === newAttribute.component &&\n      Boolean(previousAttribute.repeatable) === Boolean(newAttribute.repeatable)\n    );\n  }\n\n  return true;\n};\n"],"names":["isStorageCompatibleRename","previousAttribute","newAttribute","type","relation","target","getRelationType","targetAttribute","component","Boolean","repeatable"],"mappings":";;;;AAIA;;;;;;;AAOC,IACM,MAAMA,yBAAAA,GAA4B,CACvCC,iBAAAA,EACAC,YAAAA,GAAAA;AAEA,IAAA,IAAID,iBAAAA,CAAkBE,IAAI,KAAKD,YAAAA,CAAaC,IAAI,EAAE;QAChD,OAAO,KAAA;AACT,IAAA;AAEA,IAAA,IAAIF,kBAAkBE,IAAI,KAAK,cAAcD,YAAAA,CAAaC,IAAI,KAAK,UAAA,EAAY;AAC7E,QAAA,OACEF,iBAAAA,CAAkBG,QAAQ,KAAKF,YAAAA,CAAaE,QAAQ,IACpDH,iBAAAA,CAAkBI,MAAM,KAAKH,YAAAA,CAAaG,MAAM;;;QAIhDC,+BAAAA,CAAgBL,iBAAAA,CAAkBG,QAAQ,EAAEH,iBAAAA,CAAkBM,eAAe,CAAA,KAC3ED,+BAAAA,CAAgBJ,YAAAA,CAAaE,QAAQ,EAAEF,YAAAA,CAAaK,eAAe,CAAA;AAEzE,IAAA;AAEA,IAAA,IAAIN,kBAAkBE,IAAI,KAAK,eAAeD,YAAAA,CAAaC,IAAI,KAAK,WAAA,EAAa;AAC/E,QAAA,OACEF,iBAAAA,CAAkBO,SAAS,KAAKN,YAAAA,CAAaM,SAAS,IACtDC,OAAAA,CAAQR,iBAAAA,CAAkBS,UAAU,CAAA,KAAMD,OAAAA,CAAQP,YAAAA,CAAaQ,UAAU,CAAA;AAE7E,IAAA;IAEA,OAAO,IAAA;AACT;;;;"}

package/dist/admin/components/DataManager/utils/isStorageCompatibleRename.mjs

@@ -0,0 +1,27 @@
+import { getRelationType } from '../../../utils/getRelationType.mjs';
+
+/**
+ * Whether `newAttribute` keeps the storage of `previousAttribute`, i.e. whether
+ * renaming the underlying database artifact is enough to carry the data over.
+ * A type change (or a relation retargeted or its direction switched, or a
+ * component swapped) must go through the regular drop-and-recreate path:
+ * renaming the column and letting schema sync alter its type in place can fail
+ * at startup on Postgres/MySQL.
+ */ const isStorageCompatibleRename = (previousAttribute, newAttribute)=>{
+    if (previousAttribute.type !== newAttribute.type) {
+        return false;
+    }
+    if (previousAttribute.type === 'relation' && newAttribute.type === 'relation') {
+        return previousAttribute.relation === newAttribute.relation && previousAttribute.target === newAttribute.target && // `manyWay` and a bidirectional `oneToMany` share `relation: 'oneToMany'`
+        // but own their join table differently, so switching direction is not a
+        // plain rename.
+        getRelationType(previousAttribute.relation, previousAttribute.targetAttribute) === getRelationType(newAttribute.relation, newAttribute.targetAttribute);
+    }
+    if (previousAttribute.type === 'component' && newAttribute.type === 'component') {
+        return previousAttribute.component === newAttribute.component && Boolean(previousAttribute.repeatable) === Boolean(newAttribute.repeatable);
+    }
+    return true;
+};
+
+export { isStorageCompatibleRename };
+//# sourceMappingURL=isStorageCompatibleRename.mjs.map

package/dist/admin/components/DataManager/utils/isStorageCompatibleRename.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"isStorageCompatibleRename.mjs","sources":["../../../../../admin/src/components/DataManager/utils/isStorageCompatibleRename.ts"],"sourcesContent":["import { getRelationType } from '../../../utils/getRelationType';\n\nimport type { AnyAttribute } from '../../../types';\n\n/**\n * Whether `newAttribute` keeps the storage of `previousAttribute`, i.e. whether\n * renaming the underlying database artifact is enough to carry the data over.\n * A type change (or a relation retargeted or its direction switched, or a\n * component swapped) must go through the regular drop-and-recreate path:\n * renaming the column and letting schema sync alter its type in place can fail\n * at startup on Postgres/MySQL.\n */\nexport const isStorageCompatibleRename = (\n  previousAttribute: AnyAttribute,\n  newAttribute: AnyAttribute\n): boolean => {\n  if (previousAttribute.type !== newAttribute.type) {\n    return false;\n  }\n\n  if (previousAttribute.type === 'relation' && newAttribute.type === 'relation') {\n    return (\n      previousAttribute.relation === newAttribute.relation &&\n      previousAttribute.target === newAttribute.target &&\n      // `manyWay` and a bidirectional `oneToMany` share `relation: 'oneToMany'`\n      // but own their join table differently, so switching direction is not a\n      // plain rename.\n      getRelationType(previousAttribute.relation, previousAttribute.targetAttribute) ===\n        getRelationType(newAttribute.relation, newAttribute.targetAttribute)\n    );\n  }\n\n  if (previousAttribute.type === 'component' && newAttribute.type === 'component') {\n    return (\n      previousAttribute.component === newAttribute.component &&\n      Boolean(previousAttribute.repeatable) === Boolean(newAttribute.repeatable)\n    );\n  }\n\n  return true;\n};\n"],"names":["isStorageCompatibleRename","previousAttribute","newAttribute","type","relation","target","getRelationType","targetAttribute","component","Boolean","repeatable"],"mappings":";;AAIA;;;;;;;AAOC,IACM,MAAMA,yBAAAA,GAA4B,CACvCC,iBAAAA,EACAC,YAAAA,GAAAA;AAEA,IAAA,IAAID,iBAAAA,CAAkBE,IAAI,KAAKD,YAAAA,CAAaC,IAAI,EAAE;QAChD,OAAO,KAAA;AACT,IAAA;AAEA,IAAA,IAAIF,kBAAkBE,IAAI,KAAK,cAAcD,YAAAA,CAAaC,IAAI,KAAK,UAAA,EAAY;AAC7E,QAAA,OACEF,iBAAAA,CAAkBG,QAAQ,KAAKF,YAAAA,CAAaE,QAAQ,IACpDH,iBAAAA,CAAkBI,MAAM,KAAKH,YAAAA,CAAaG,MAAM;;;QAIhDC,eAAAA,CAAgBL,iBAAAA,CAAkBG,QAAQ,EAAEH,iBAAAA,CAAkBM,eAAe,CAAA,KAC3ED,eAAAA,CAAgBJ,YAAAA,CAAaE,QAAQ,EAAEF,YAAAA,CAAaK,eAAe,CAAA;AAEzE,IAAA;AAEA,IAAA,IAAIN,kBAAkBE,IAAI,KAAK,eAAeD,YAAAA,CAAaC,IAAI,KAAK,WAAA,EAAa;AAC/E,QAAA,OACEF,iBAAAA,CAAkBO,SAAS,KAAKN,YAAAA,CAAaM,SAAS,IACtDC,OAAAA,CAAQR,iBAAAA,CAAkBS,UAAU,CAAA,KAAMD,OAAAA,CAAQP,YAAAA,CAAaQ,UAAU,CAAA;AAE7E,IAAA;IAEA,OAAO,IAAA;AACT;;;;"}

package/dist/admin/components/DataManager/utils/resolveAfterEditRenameConsent.js

@@ -0,0 +1,35 @@
+'use strict';
+
+var RenameMigrationModal = require('../RenameMigrationModal.js');
+
+/**
+ * Decides whether a single rename hop (`oldName -> newName`) performed in the
+ * attribute form needs the user's consent to preserve data, given the hops
+ * already recorded on the type and the names of chains the user has declined.
+ *
+ * Consent inherits along a chain, so a chain is always accepted or declined as
+ * a whole (replaying a partial chain either fails or silently skips hops):
+ *
+ * 1. A hop that joins an accepted chain — it continues a recorded hop
+ *    (`oldName` was produced by one) or swaps into a name a recorded hop
+ *    vacated (`newName`) — is accepted without a prompt.
+ * 2. A hop that touches a declined name is declined without a prompt.
+ * 3. Otherwise the mode decides; `prompt-after-edit` asks the user.
+ */ const resolveAfterEditRenameConsent = ({ renames, declinedRenameNames, oldName, newName, mode })=>{
+    const joinsAcceptedChain = renames.some((hop)=>hop.newName === oldName || hop.oldName === newName);
+    if (joinsAcceptedChain) {
+        return 'accept';
+    }
+    const declined = new Set(declinedRenameNames);
+    if (declined.has(oldName) || declined.has(newName)) {
+        return 'decline';
+    }
+    const decision = RenameMigrationModal.getAttributeRenameDecision(mode);
+    if (decision === 'prompt') {
+        return 'prompt';
+    }
+    return decision ? 'accept' : 'decline';
+};
+
+exports.resolveAfterEditRenameConsent = resolveAfterEditRenameConsent;
+//# sourceMappingURL=resolveAfterEditRenameConsent.js.map

package/dist/admin/components/DataManager/utils/resolveAfterEditRenameConsent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolveAfterEditRenameConsent.js","sources":["../../../../../admin/src/components/DataManager/utils/resolveAfterEditRenameConsent.ts"],"sourcesContent":["import {\n  getAttributeRenameDecision,\n  type AttributeRenameMigrationMode,\n} from '../RenameMigrationModal';\n\nimport type { RenameHop } from '../../../types';\n\nexport type AfterEditRenameConsent = 'accept' | 'decline' | 'prompt';\n\n/**\n * Decides whether a single rename hop (`oldName -> newName`) performed in the\n * attribute form needs the user's consent to preserve data, given the hops\n * already recorded on the type and the names of chains the user has declined.\n *\n * Consent inherits along a chain, so a chain is always accepted or declined as\n * a whole (replaying a partial chain either fails or silently skips hops):\n *\n * 1. A hop that joins an accepted chain — it continues a recorded hop\n *    (`oldName` was produced by one) or swaps into a name a recorded hop\n *    vacated (`newName`) — is accepted without a prompt.\n * 2. A hop that touches a declined name is declined without a prompt.\n * 3. Otherwise the mode decides; `prompt-after-edit` asks the user.\n */\nexport const resolveAfterEditRenameConsent = ({\n  renames,\n  declinedRenameNames,\n  oldName,\n  newName,\n  mode,\n}: {\n  renames: RenameHop[];\n  declinedRenameNames: string[];\n  oldName: string;\n  newName: string;\n  mode: AttributeRenameMigrationMode;\n}): AfterEditRenameConsent => {\n  const joinsAcceptedChain = renames.some(\n    (hop) => hop.newName === oldName || hop.oldName === newName\n  );\n  if (joinsAcceptedChain) {\n    return 'accept';\n  }\n\n  const declined = new Set(declinedRenameNames);\n  if (declined.has(oldName) || declined.has(newName)) {\n    return 'decline';\n  }\n\n  const decision = getAttributeRenameDecision(mode);\n  if (decision === 'prompt') {\n    return 'prompt';\n  }\n\n  return decision ? 'accept' : 'decline';\n};\n"],"names":["resolveAfterEditRenameConsent","renames","declinedRenameNames","oldName","newName","mode","joinsAcceptedChain","some","hop","declined","Set","has","decision","getAttributeRenameDecision"],"mappings":";;;;AASA;;;;;;;;;;;;;AAaC,IACM,MAAMA,6BAAAA,GAAgC,CAAC,EAC5CC,OAAO,EACPC,mBAAmB,EACnBC,OAAO,EACPC,OAAO,EACPC,IAAI,EAOL,GAAA;AACC,IAAA,MAAMC,kBAAAA,GAAqBL,OAAAA,CAAQM,IAAI,CACrC,CAACC,GAAAA,GAAQA,GAAAA,CAAIJ,OAAO,KAAKD,OAAAA,IAAWK,GAAAA,CAAIL,OAAO,KAAKC,OAAAA,CAAAA;AAEtD,IAAA,IAAIE,kBAAAA,EAAoB;QACtB,OAAO,QAAA;AACT,IAAA;IAEA,MAAMG,QAAAA,GAAW,IAAIC,GAAAA,CAAIR,mBAAAA,CAAAA;AACzB,IAAA,IAAIO,SAASE,GAAG,CAACR,YAAYM,QAAAA,CAASE,GAAG,CAACP,OAAAA,CAAAA,EAAU;QAClD,OAAO,SAAA;AACT,IAAA;AAEA,IAAA,MAAMQ,WAAWC,+CAAAA,CAA2BR,IAAAA,CAAAA;AAC5C,IAAA,IAAIO,aAAa,QAAA,EAAU;QACzB,OAAO,QAAA;AACT,IAAA;AAEA,IAAA,OAAOA,WAAW,QAAA,GAAW,SAAA;AAC/B;;;;"}

package/dist/admin/components/DataManager/utils/resolveAfterEditRenameConsent.mjs

@@ -0,0 +1,33 @@
+import { getAttributeRenameDecision } from '../RenameMigrationModal.mjs';
+
+/**
+ * Decides whether a single rename hop (`oldName -> newName`) performed in the
+ * attribute form needs the user's consent to preserve data, given the hops
+ * already recorded on the type and the names of chains the user has declined.
+ *
+ * Consent inherits along a chain, so a chain is always accepted or declined as
+ * a whole (replaying a partial chain either fails or silently skips hops):
+ *
+ * 1. A hop that joins an accepted chain — it continues a recorded hop
+ *    (`oldName` was produced by one) or swaps into a name a recorded hop
+ *    vacated (`newName`) — is accepted without a prompt.
+ * 2. A hop that touches a declined name is declined without a prompt.
+ * 3. Otherwise the mode decides; `prompt-after-edit` asks the user.
+ */ const resolveAfterEditRenameConsent = ({ renames, declinedRenameNames, oldName, newName, mode })=>{
+    const joinsAcceptedChain = renames.some((hop)=>hop.newName === oldName || hop.oldName === newName);
+    if (joinsAcceptedChain) {
+        return 'accept';
+    }
+    const declined = new Set(declinedRenameNames);
+    if (declined.has(oldName) || declined.has(newName)) {
+        return 'decline';
+    }
+    const decision = getAttributeRenameDecision(mode);
+    if (decision === 'prompt') {
+        return 'prompt';
+    }
+    return decision ? 'accept' : 'decline';
+};
+
+export { resolveAfterEditRenameConsent };
+//# sourceMappingURL=resolveAfterEditRenameConsent.mjs.map

package/dist/admin/components/DataManager/utils/resolveAfterEditRenameConsent.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolveAfterEditRenameConsent.mjs","sources":["../../../../../admin/src/components/DataManager/utils/resolveAfterEditRenameConsent.ts"],"sourcesContent":["import {\n  getAttributeRenameDecision,\n  type AttributeRenameMigrationMode,\n} from '../RenameMigrationModal';\n\nimport type { RenameHop } from '../../../types';\n\nexport type AfterEditRenameConsent = 'accept' | 'decline' | 'prompt';\n\n/**\n * Decides whether a single rename hop (`oldName -> newName`) performed in the\n * attribute form needs the user's consent to preserve data, given the hops\n * already recorded on the type and the names of chains the user has declined.\n *\n * Consent inherits along a chain, so a chain is always accepted or declined as\n * a whole (replaying a partial chain either fails or silently skips hops):\n *\n * 1. A hop that joins an accepted chain — it continues a recorded hop\n *    (`oldName` was produced by one) or swaps into a name a recorded hop\n *    vacated (`newName`) — is accepted without a prompt.\n * 2. A hop that touches a declined name is declined without a prompt.\n * 3. Otherwise the mode decides; `prompt-after-edit` asks the user.\n */\nexport const resolveAfterEditRenameConsent = ({\n  renames,\n  declinedRenameNames,\n  oldName,\n  newName,\n  mode,\n}: {\n  renames: RenameHop[];\n  declinedRenameNames: string[];\n  oldName: string;\n  newName: string;\n  mode: AttributeRenameMigrationMode;\n}): AfterEditRenameConsent => {\n  const joinsAcceptedChain = renames.some(\n    (hop) => hop.newName === oldName || hop.oldName === newName\n  );\n  if (joinsAcceptedChain) {\n    return 'accept';\n  }\n\n  const declined = new Set(declinedRenameNames);\n  if (declined.has(oldName) || declined.has(newName)) {\n    return 'decline';\n  }\n\n  const decision = getAttributeRenameDecision(mode);\n  if (decision === 'prompt') {\n    return 'prompt';\n  }\n\n  return decision ? 'accept' : 'decline';\n};\n"],"names":["resolveAfterEditRenameConsent","renames","declinedRenameNames","oldName","newName","mode","joinsAcceptedChain","some","hop","declined","Set","has","decision","getAttributeRenameDecision"],"mappings":";;AASA;;;;;;;;;;;;;AAaC,IACM,MAAMA,6BAAAA,GAAgC,CAAC,EAC5CC,OAAO,EACPC,mBAAmB,EACnBC,OAAO,EACPC,OAAO,EACPC,IAAI,EAOL,GAAA;AACC,IAAA,MAAMC,kBAAAA,GAAqBL,OAAAA,CAAQM,IAAI,CACrC,CAACC,GAAAA,GAAQA,GAAAA,CAAIJ,OAAO,KAAKD,OAAAA,IAAWK,GAAAA,CAAIL,OAAO,KAAKC,OAAAA,CAAAA;AAEtD,IAAA,IAAIE,kBAAAA,EAAoB;QACtB,OAAO,QAAA;AACT,IAAA;IAEA,MAAMG,QAAAA,GAAW,IAAIC,GAAAA,CAAIR,mBAAAA,CAAAA;AACzB,IAAA,IAAIO,SAASE,GAAG,CAACR,YAAYM,QAAAA,CAASE,GAAG,CAACP,OAAAA,CAAAA,EAAU;QAClD,OAAO,SAAA;AACT,IAAA;AAEA,IAAA,MAAMQ,WAAWC,0BAAAA,CAA2BR,IAAAA,CAAAA;AAC5C,IAAA,IAAIO,aAAa,QAAA,EAAU;QACzB,OAAO,QAAA;AACT,IAAA;AAEA,IAAA,OAAOA,WAAW,QAAA,GAAW,SAAA;AAC/B;;;;"}

package/dist/admin/components/DataManager/utils/splitChainsByInheritedConsent.js

@@ -0,0 +1,48 @@
+'use strict';
+
+const hopsOf = (chain, renames)=>chain.hopIndexes.map((index)=>renames[index]);
+/**
+ * Buckets incoming rename chains (e.g. declared by the AI chat) by the consent
+ * the user already gave for the hops recorded on the type, using the same rules
+ * as the per-edit prompt (see `resolveAfterEditRenameConsent`): a chain that
+ * continues a recorded hop or swaps into a name one vacated is kept, a chain
+ * touching a declined name is declined, anything else needs a prompt.
+ */ const splitChainsByInheritedConsent = ({ recorded, declinedRenameNames, chains, renames })=>{
+    const declined = new Set(declinedRenameNames);
+    const result = {
+        keep: [],
+        decline: [],
+        prompt: []
+    };
+    chains.forEach((chain)=>{
+        const hops = hopsOf(chain, renames);
+        const joinsAcceptedChain = hops.some((hop)=>recorded.some((known)=>known.newName === hop.oldName || known.oldName === hop.newName));
+        if (joinsAcceptedChain) {
+            result.keep.push(chain);
+            return;
+        }
+        const touchesDeclinedName = hops.some((hop)=>declined.has(hop.oldName) || declined.has(hop.newName));
+        if (touchesDeclinedName) {
+            result.decline.push(chain);
+            return;
+        }
+        result.prompt.push(chain);
+    });
+    return result;
+};
+/** Every attribute name a set of chains touches, deduplicated, in hop order. */ const namesOfChains = (chains, renames)=>{
+    const names = new Set();
+    chains.forEach((chain)=>{
+        hopsOf(chain, renames).forEach((hop)=>{
+            names.add(hop.oldName);
+            names.add(hop.newName);
+        });
+    });
+    return [
+        ...names
+    ];
+};
+
+exports.namesOfChains = namesOfChains;
+exports.splitChainsByInheritedConsent = splitChainsByInheritedConsent;
+//# sourceMappingURL=splitChainsByInheritedConsent.js.map

package/dist/admin/components/DataManager/utils/splitChainsByInheritedConsent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"splitChainsByInheritedConsent.js","sources":["../../../../../admin/src/components/DataManager/utils/splitChainsByInheritedConsent.ts"],"sourcesContent":["import type { RenameChain } from './groupRenameChains';\nimport type { RenameHop } from '../../../types';\n\nexport interface SplitChains {\n  /** Chains that join a chain the user already accepted: kept without a prompt. */\n  keep: RenameChain[];\n  /** Chains touching a name the user already declined: dropped without a prompt. */\n  decline: RenameChain[];\n  /** Chains with no prior decision: the user has to be asked. */\n  prompt: RenameChain[];\n}\n\nconst hopsOf = (chain: RenameChain, renames: RenameHop[]): RenameHop[] =>\n  chain.hopIndexes.map((index) => renames[index]);\n\n/**\n * Buckets incoming rename chains (e.g. declared by the AI chat) by the consent\n * the user already gave for the hops recorded on the type, using the same rules\n * as the per-edit prompt (see `resolveAfterEditRenameConsent`): a chain that\n * continues a recorded hop or swaps into a name one vacated is kept, a chain\n * touching a declined name is declined, anything else needs a prompt.\n */\nexport const splitChainsByInheritedConsent = ({\n  recorded,\n  declinedRenameNames,\n  chains,\n  renames,\n}: {\n  recorded: RenameHop[];\n  declinedRenameNames: string[];\n  chains: RenameChain[];\n  /** The ordered hops the chains index into. */\n  renames: RenameHop[];\n}): SplitChains => {\n  const declined = new Set(declinedRenameNames);\n  const result: SplitChains = { keep: [], decline: [], prompt: [] };\n\n  chains.forEach((chain) => {\n    const hops = hopsOf(chain, renames);\n\n    const joinsAcceptedChain = hops.some((hop) =>\n      recorded.some((known) => known.newName === hop.oldName || known.oldName === hop.newName)\n    );\n    if (joinsAcceptedChain) {\n      result.keep.push(chain);\n      return;\n    }\n\n    const touchesDeclinedName = hops.some(\n      (hop) => declined.has(hop.oldName) || declined.has(hop.newName)\n    );\n    if (touchesDeclinedName) {\n      result.decline.push(chain);\n      return;\n    }\n\n    result.prompt.push(chain);\n  });\n\n  return result;\n};\n\n/** Every attribute name a set of chains touches, deduplicated, in hop order. */\nexport const namesOfChains = (chains: RenameChain[], renames: RenameHop[]): string[] => {\n  const names = new Set<string>();\n  chains.forEach((chain) => {\n    hopsOf(chain, renames).forEach((hop) => {\n      names.add(hop.oldName);\n      names.add(hop.newName);\n    });\n  });\n  return [...names];\n};\n"],"names":["hopsOf","chain","renames","hopIndexes","map","index","splitChainsByInheritedConsent","recorded","declinedRenameNames","chains","declined","Set","result","keep","decline","prompt","forEach","hops","joinsAcceptedChain","some","hop","known","newName","oldName","push","touchesDeclinedName","has","namesOfChains","names","add"],"mappings":";;AAYA,MAAMA,MAAAA,GAAS,CAACC,KAAAA,EAAoBC,OAAAA,GAClCD,KAAAA,CAAME,UAAU,CAACC,GAAG,CAAC,CAACC,KAAAA,GAAUH,OAAO,CAACG,KAAAA,CAAM,CAAA;AAEhD;;;;;;AAMC,IACM,MAAMC,6BAAAA,GAAgC,CAAC,EAC5CC,QAAQ,EACRC,mBAAmB,EACnBC,MAAM,EACNP,OAAO,EAOR,GAAA;IACC,MAAMQ,QAAAA,GAAW,IAAIC,GAAAA,CAAIH,mBAAAA,CAAAA;AACzB,IAAA,MAAMI,MAAAA,GAAsB;AAAEC,QAAAA,IAAAA,EAAM,EAAE;AAAEC,QAAAA,OAAAA,EAAS,EAAE;AAAEC,QAAAA,MAAAA,EAAQ;AAAG,KAAA;IAEhEN,MAAAA,CAAOO,OAAO,CAAC,CAACf,KAAAA,GAAAA;QACd,MAAMgB,IAAAA,GAAOjB,OAAOC,KAAAA,EAAOC,OAAAA,CAAAA;QAE3B,MAAMgB,kBAAAA,GAAqBD,KAAKE,IAAI,CAAC,CAACC,GAAAA,GACpCb,QAAAA,CAASY,IAAI,CAAC,CAACE,QAAUA,KAAAA,CAAMC,OAAO,KAAKF,GAAAA,CAAIG,OAAO,IAAIF,KAAAA,CAAME,OAAO,KAAKH,GAAAA,CAAIE,OAAO,CAAA,CAAA;AAEzF,QAAA,IAAIJ,kBAAAA,EAAoB;YACtBN,MAAAA,CAAOC,IAAI,CAACW,IAAI,CAACvB,KAAAA,CAAAA;AACjB,YAAA;AACF,QAAA;AAEA,QAAA,MAAMwB,sBAAsBR,IAAAA,CAAKE,IAAI,CACnC,CAACC,MAAQV,QAAAA,CAASgB,GAAG,CAACN,GAAAA,CAAIG,OAAO,CAAA,IAAKb,QAAAA,CAASgB,GAAG,CAACN,IAAIE,OAAO,CAAA,CAAA;AAEhE,QAAA,IAAIG,mBAAAA,EAAqB;YACvBb,MAAAA,CAAOE,OAAO,CAACU,IAAI,CAACvB,KAAAA,CAAAA;AACpB,YAAA;AACF,QAAA;QAEAW,MAAAA,CAAOG,MAAM,CAACS,IAAI,CAACvB,KAAAA,CAAAA;AACrB,IAAA,CAAA,CAAA;IAEA,OAAOW,MAAAA;AACT;AAEA,iFACO,MAAMe,aAAAA,GAAgB,CAAClB,MAAAA,EAAuBP,OAAAA,GAAAA;AACnD,IAAA,MAAM0B,QAAQ,IAAIjB,GAAAA,EAAAA;IAClBF,MAAAA,CAAOO,OAAO,CAAC,CAACf,KAAAA,GAAAA;AACdD,QAAAA,MAAAA,CAAOC,KAAAA,EAAOC,OAAAA,CAAAA,CAASc,OAAO,CAAC,CAACI,GAAAA,GAAAA;YAC9BQ,KAAAA,CAAMC,GAAG,CAACT,GAAAA,CAAIG,OAAO,CAAA;YACrBK,KAAAA,CAAMC,GAAG,CAACT,GAAAA,CAAIE,OAAO,CAAA;AACvB,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAA;IACA,OAAO;AAAIM,QAAAA,GAAAA;AAAM,KAAA;AACnB;;;;;"}

package/dist/admin/components/DataManager/utils/splitChainsByInheritedConsent.mjs

@@ -0,0 +1,45 @@
+const hopsOf = (chain, renames)=>chain.hopIndexes.map((index)=>renames[index]);
+/**
+ * Buckets incoming rename chains (e.g. declared by the AI chat) by the consent
+ * the user already gave for the hops recorded on the type, using the same rules
+ * as the per-edit prompt (see `resolveAfterEditRenameConsent`): a chain that
+ * continues a recorded hop or swaps into a name one vacated is kept, a chain
+ * touching a declined name is declined, anything else needs a prompt.
+ */ const splitChainsByInheritedConsent = ({ recorded, declinedRenameNames, chains, renames })=>{
+    const declined = new Set(declinedRenameNames);
+    const result = {
+        keep: [],
+        decline: [],
+        prompt: []
+    };
+    chains.forEach((chain)=>{
+        const hops = hopsOf(chain, renames);
+        const joinsAcceptedChain = hops.some((hop)=>recorded.some((known)=>known.newName === hop.oldName || known.oldName === hop.newName));
+        if (joinsAcceptedChain) {
+            result.keep.push(chain);
+            return;
+        }
+        const touchesDeclinedName = hops.some((hop)=>declined.has(hop.oldName) || declined.has(hop.newName));
+        if (touchesDeclinedName) {
+            result.decline.push(chain);
+            return;
+        }
+        result.prompt.push(chain);
+    });
+    return result;
+};
+/** Every attribute name a set of chains touches, deduplicated, in hop order. */ const namesOfChains = (chains, renames)=>{
+    const names = new Set();
+    chains.forEach((chain)=>{
+        hopsOf(chain, renames).forEach((hop)=>{
+            names.add(hop.oldName);
+            names.add(hop.newName);
+        });
+    });
+    return [
+        ...names
+    ];
+};
+
+export { namesOfChains, splitChainsByInheritedConsent };
+//# sourceMappingURL=splitChainsByInheritedConsent.mjs.map

package/dist/admin/components/DataManager/utils/splitChainsByInheritedConsent.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"splitChainsByInheritedConsent.mjs","sources":["../../../../../admin/src/components/DataManager/utils/splitChainsByInheritedConsent.ts"],"sourcesContent":["import type { RenameChain } from './groupRenameChains';\nimport type { RenameHop } from '../../../types';\n\nexport interface SplitChains {\n  /** Chains that join a chain the user already accepted: kept without a prompt. */\n  keep: RenameChain[];\n  /** Chains touching a name the user already declined: dropped without a prompt. */\n  decline: RenameChain[];\n  /** Chains with no prior decision: the user has to be asked. */\n  prompt: RenameChain[];\n}\n\nconst hopsOf = (chain: RenameChain, renames: RenameHop[]): RenameHop[] =>\n  chain.hopIndexes.map((index) => renames[index]);\n\n/**\n * Buckets incoming rename chains (e.g. declared by the AI chat) by the consent\n * the user already gave for the hops recorded on the type, using the same rules\n * as the per-edit prompt (see `resolveAfterEditRenameConsent`): a chain that\n * continues a recorded hop or swaps into a name one vacated is kept, a chain\n * touching a declined name is declined, anything else needs a prompt.\n */\nexport const splitChainsByInheritedConsent = ({\n  recorded,\n  declinedRenameNames,\n  chains,\n  renames,\n}: {\n  recorded: RenameHop[];\n  declinedRenameNames: string[];\n  chains: RenameChain[];\n  /** The ordered hops the chains index into. */\n  renames: RenameHop[];\n}): SplitChains => {\n  const declined = new Set(declinedRenameNames);\n  const result: SplitChains = { keep: [], decline: [], prompt: [] };\n\n  chains.forEach((chain) => {\n    const hops = hopsOf(chain, renames);\n\n    const joinsAcceptedChain = hops.some((hop) =>\n      recorded.some((known) => known.newName === hop.oldName || known.oldName === hop.newName)\n    );\n    if (joinsAcceptedChain) {\n      result.keep.push(chain);\n      return;\n    }\n\n    const touchesDeclinedName = hops.some(\n      (hop) => declined.has(hop.oldName) || declined.has(hop.newName)\n    );\n    if (touchesDeclinedName) {\n      result.decline.push(chain);\n      return;\n    }\n\n    result.prompt.push(chain);\n  });\n\n  return result;\n};\n\n/** Every attribute name a set of chains touches, deduplicated, in hop order. */\nexport const namesOfChains = (chains: RenameChain[], renames: RenameHop[]): string[] => {\n  const names = new Set<string>();\n  chains.forEach((chain) => {\n    hopsOf(chain, renames).forEach((hop) => {\n      names.add(hop.oldName);\n      names.add(hop.newName);\n    });\n  });\n  return [...names];\n};\n"],"names":["hopsOf","chain","renames","hopIndexes","map","index","splitChainsByInheritedConsent","recorded","declinedRenameNames","chains","declined","Set","result","keep","decline","prompt","forEach","hops","joinsAcceptedChain","some","hop","known","newName","oldName","push","touchesDeclinedName","has","namesOfChains","names","add"],"mappings":"AAYA,MAAMA,MAAAA,GAAS,CAACC,KAAAA,EAAoBC,OAAAA,GAClCD,KAAAA,CAAME,UAAU,CAACC,GAAG,CAAC,CAACC,KAAAA,GAAUH,OAAO,CAACG,KAAAA,CAAM,CAAA;AAEhD;;;;;;AAMC,IACM,MAAMC,6BAAAA,GAAgC,CAAC,EAC5CC,QAAQ,EACRC,mBAAmB,EACnBC,MAAM,EACNP,OAAO,EAOR,GAAA;IACC,MAAMQ,QAAAA,GAAW,IAAIC,GAAAA,CAAIH,mBAAAA,CAAAA;AACzB,IAAA,MAAMI,MAAAA,GAAsB;AAAEC,QAAAA,IAAAA,EAAM,EAAE;AAAEC,QAAAA,OAAAA,EAAS,EAAE;AAAEC,QAAAA,MAAAA,EAAQ;AAAG,KAAA;IAEhEN,MAAAA,CAAOO,OAAO,CAAC,CAACf,KAAAA,GAAAA;QACd,MAAMgB,IAAAA,GAAOjB,OAAOC,KAAAA,EAAOC,OAAAA,CAAAA;QAE3B,MAAMgB,kBAAAA,GAAqBD,KAAKE,IAAI,CAAC,CAACC,GAAAA,GACpCb,QAAAA,CAASY,IAAI,CAAC,CAACE,QAAUA,KAAAA,CAAMC,OAAO,KAAKF,GAAAA,CAAIG,OAAO,IAAIF,KAAAA,CAAME,OAAO,KAAKH,GAAAA,CAAIE,OAAO,CAAA,CAAA;AAEzF,QAAA,IAAIJ,kBAAAA,EAAoB;YACtBN,MAAAA,CAAOC,IAAI,CAACW,IAAI,CAACvB,KAAAA,CAAAA;AACjB,YAAA;AACF,QAAA;AAEA,QAAA,MAAMwB,sBAAsBR,IAAAA,CAAKE,IAAI,CACnC,CAACC,MAAQV,QAAAA,CAASgB,GAAG,CAACN,GAAAA,CAAIG,OAAO,CAAA,IAAKb,QAAAA,CAASgB,GAAG,CAACN,IAAIE,OAAO,CAAA,CAAA;AAEhE,QAAA,IAAIG,mBAAAA,EAAqB;YACvBb,MAAAA,CAAOE,OAAO,CAACU,IAAI,CAACvB,KAAAA,CAAAA;AACpB,YAAA;AACF,QAAA;QAEAW,MAAAA,CAAOG,MAAM,CAACS,IAAI,CAACvB,KAAAA,CAAAA;AACrB,IAAA,CAAA,CAAA;IAEA,OAAOW,MAAAA;AACT;AAEA,iFACO,MAAMe,aAAAA,GAAgB,CAAClB,MAAAA,EAAuBP,OAAAA,GAAAA;AACnD,IAAA,MAAM0B,QAAQ,IAAIjB,GAAAA,EAAAA;IAClBF,MAAAA,CAAOO,OAAO,CAAC,CAACf,KAAAA,GAAAA;AACdD,QAAAA,MAAAA,CAAOC,KAAAA,EAAOC,OAAAA,CAAAA,CAASc,OAAO,CAAC,CAACI,GAAAA,GAAAA;YAC9BQ,KAAAA,CAAMC,GAAG,CAACT,GAAAA,CAAIG,OAAO,CAAA;YACrBK,KAAAA,CAAMC,GAAG,CAACT,GAAAA,CAAIE,OAAO,CAAA;AACvB,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAA;IACA,OAAO;AAAIM,QAAAA,GAAAA;AAAM,KAAA;AACnB;;;;"}