@strapi/database 5.52.1 → 5.52.2

package/dist/entity-manager/relations-orderer.d.ts

@@ -54,6 +54,11 @@ declare const sortConnectArray: (connectArr: Link[], initialArr?: Link[], strict
  * - The final step would be to recalculate fractional order values.
  *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]
  *
+ * `initArr` is not the full relation list. For an ordered connect, `updateRelations` loads only
+ * the rows named as anchors by the payload plus the lowest- and highest-ordered rows, so entries
+ * that are adjacent in `computedRelations` are not adjacent in the stored list. Placement must be
+ * computed from the anchor's own order, never from its neighbours in this array.
+ *
  * @param {Array<*>} initArr - array of relations to initialize the class with
  * @param {string} idColumn - the column name of the id
  * @param {string} orderColumn - the column name of the order

package/dist/entity-manager/relations-orderer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relations-orderer.d.ts","sourceRoot":"","sources":["../../src/entity-manager/relations-orderer.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,UAAU,CAAC;AAEnC,UAAU,IAAI;IACZ,EAAE,EAAE,EAAE,CAAC;IACP,QAAQ,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,IAAI,CAAC;QAAC,GAAG,CAAC,EAAE,IAAI,CAAA;KAAE,CAAC;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,UAAU,WAAY,SAAQ,IAAI;IAChC,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,QAAA,MAAM,gBAAgB,GAAI,YAAY,IAAI,EAAE,EAAE,aAAY,IAAI,EAAO,EAAE,oBAAiB,WA0GvF,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,QAAA,MAAM,gBAAgB,GAAI,SAAS,SAAS,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,EAC5E,SAAS,SAAS,EAAE,EACpB,UAAU,MAAM,SAAS,EACzB,aAAa,MAAM,SAAS,EAC5B,SAAS,OAAO;0BAuEQ,IAAI,GAAG,IAAI,EAAE;uBAMhB,IAAI,GAAG,IAAI,EAAE;;IAqBhC;;OAEG;;CAoBN,CAAC;AAEF,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,CAAC"}
+{"version":3,"file":"relations-orderer.d.ts","sourceRoot":"","sources":["../../src/entity-manager/relations-orderer.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,UAAU,CAAC;AAEnC,UAAU,IAAI;IACZ,EAAE,EAAE,EAAE,CAAC;IACP,QAAQ,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE,IAAI,CAAC;QAAC,GAAG,CAAC,EAAE,IAAI,CAAA;KAAE,CAAC;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,UAAU,WAAY,SAAQ,IAAI;IAChC,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,QAAA,MAAM,gBAAgB,GAAI,YAAY,IAAI,EAAE,EAAE,aAAY,IAAI,EAAO,EAAE,oBAAiB,WA0GvF,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,QAAA,MAAM,gBAAgB,GAAI,SAAS,SAAS,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,EAC5E,SAAS,SAAS,EAAE,EACpB,UAAU,MAAM,SAAS,EACzB,aAAa,MAAM,SAAS,EAC5B,SAAS,OAAO;0BA8DQ,IAAI,GAAG,IAAI,EAAE;uBAMhB,IAAI,GAAG,IAAI,EAAE;;IAqBhC;;OAEG;;CAoBN,CAAC;AAEF,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,CAAC"}

package/dist/entity-manager/relations-orderer.js

@@ -131,6 +131,11 @@ var ___default = /*#__PURE__*/_interopDefault(_);
  * - The final step would be to recalculate fractional order values.
  *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]
  *
+ * `initArr` is not the full relation list. For an ordered connect, `updateRelations` loads only
+ * the rows named as anchors by the payload plus the lowest- and highest-ordered rows, so entries
+ * that are adjacent in `computedRelations` are not adjacent in the stored list. Placement must be
+ * computed from the anchor's own order, never from its neighbours in this array.
+ *
  * @param {Array<*>} initArr - array of relations to initialize the class with
  * @param {string} idColumn - the column name of the id
  * @param {string} orderColumn - the column name of the order
@@ -162,8 +167,7 @@ var ___default = /*#__PURE__*/_interopDefault(_);
         if (r.position?.before) {
             const { idx: beforeIdx, relation } = findRelation(r.position.before);
             if (relation.init) {
-                const prevRelation = beforeIdx > 0 ? computedRelations[beforeIdx - 1] : null;
-                r.order = prevRelation && prevRelation.order < relation.order ? (prevRelation.order + relation.order) / 2 : relation.order - 0.5;
+                r.order = relation.order - 0.5;
             } else {
                 r.order = relation.order;
             }
@@ -171,8 +175,7 @@ var ___default = /*#__PURE__*/_interopDefault(_);
         } else if (r.position?.after) {
             const { idx: afterIdx, relation } = findRelation(r.position.after);
             if (relation.init) {
-                const nextRelation = afterIdx < computedRelations.length - 1 ? computedRelations[afterIdx + 1] : null;
-                r.order = nextRelation && nextRelation.order > relation.order ? (relation.order + nextRelation.order) / 2 : relation.order + 0.5;
+                r.order = relation.order + 0.5;
             } else {
                 r.order = relation.order;
             }

package/dist/entity-manager/relations-orderer.js.map

@@ -1 +1 @@
-{"version":3,"file":"relations-orderer.js","sources":["../../src/entity-manager/relations-orderer.ts"],"sourcesContent":["import { castArray, maxBy } from 'lodash/fp';\nimport _ from 'lodash';\n\nimport { InvalidRelationError } from '../errors';\nimport type { ID } from '../types';\n\ninterface Link {\n  id: ID;\n  position?: { before?: ID; after?: ID; start?: true; end?: true };\n  order?: number;\n  __component?: string;\n}\n\ninterface OrderedLink extends Link {\n  init?: boolean;\n  order: number;\n}\n\n/**\n * When connecting relations, the order you connect them matters.\n *\n * Example, if you connect the following relations:\n *   { id: 5, position: { before: 1 } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 2, position: { end: true } }\n *\n * Going through the connect array, id 5 has to be connected before id 1,\n * so the order of id5 = id1 - 1. But the order value of id 1 is unknown.\n * The only way to know the order of id 1 is to connect it first.\n *\n * This function makes sure the relations are connected in the right order:\n *   { id: 2, position: { end: true } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 5, position: { before: 1 } }\n *\n */\nconst sortConnectArray = (connectArr: Link[], initialArr: Link[] = [], strictSort = true) => {\n  const sortedConnect: Link[] = [];\n  // Boolean to know if we have to recalculate the order of the relations\n  let needsSorting = false;\n  // Map to validate if relation is already in sortedConnect or DB.\n  const relationInInitialArray = initialArr.reduce(\n    (acc, rel) => ({ ...acc, [rel.id]: true }),\n    {} as Record<ID, boolean>\n  );\n  // Map to store the first index where a relation id is connected\n  const mappedRelations = connectArr.reduce(\n    (mapper, relation: Link) => {\n      const adjacentRelId = relation.position?.before || relation.position?.after;\n\n      if (!adjacentRelId || (!relationInInitialArray[adjacentRelId] && !mapper[adjacentRelId])) {\n        needsSorting = true;\n      }\n\n      /**\n       * We do not allow duplicate relations to be connected, so we need to check for uniqueness with components\n       * Note that the id here includes the uid for polymorphic relations\n       *\n       * So for normal relations, the same id means the same relation\n       * For component relations, it means the unique combo of (id, component name)\n       */\n\n      // Check if there's an existing relation with this id\n      const existingRelation = mapper[relation.id];\n\n      // Check if existing relation has a component or not\n      const hasNoComponent = existingRelation && !('__component' in existingRelation);\n\n      // Check if the existing relation has the same component as the new relation\n      const hasSameComponent =\n        existingRelation && existingRelation.__component === relation.__component;\n\n      // If we have an existing relation that is not unique (no component or same component) we won't accept it\n      if (existingRelation && (hasNoComponent || hasSameComponent)) {\n        throw new InvalidRelationError(\n          `The relation with id ${relation.id} is already connected. ` +\n            'You cannot connect the same relation twice.'\n        );\n      }\n\n      return {\n        [relation.id]: { ...relation, computed: false },\n        ...mapper,\n      };\n    },\n    {} as Record<ID, Link & { computed: boolean }>\n  );\n\n  // If we don't need to sort the connect array, we can return it as is\n  if (!needsSorting) return connectArr;\n\n  // Recursively compute in which order the relation should be connected\n  const computeRelation = (relation: Link, relationsSeenInBranch: Record<ID, boolean>) => {\n    const adjacentRelId = relation.position?.before || relation.position?.after;\n    const adjacentRelation = mappedRelations[adjacentRelId as ID];\n\n    // If the relation has already been seen in the current branch,\n    // it means there is a circular reference\n    if (adjacentRelId && relationsSeenInBranch[adjacentRelId]) {\n      throw new InvalidRelationError(\n        'A circular reference was found in the connect array. ' +\n          'One relation is trying to connect before/after another one that is trying to connect before/after it'\n      );\n    }\n\n    // This relation has already been computed\n    if (mappedRelations[relation.id]?.computed) {\n      return;\n    }\n\n    mappedRelations[relation.id].computed = true;\n\n    // Relation does not have a before or after attribute or is in the initial array\n    if (!adjacentRelId || relationInInitialArray[adjacentRelId]) {\n      sortedConnect.push(relation);\n      return;\n    }\n\n    // Look if id is referenced elsewhere in the array\n    if (mappedRelations[adjacentRelId]) {\n      computeRelation(adjacentRelation, { ...relationsSeenInBranch, [relation.id]: true });\n      sortedConnect.push(relation);\n    } else if (strictSort) {\n      // If we reach this point, it means that the adjacent relation is not in the connect array\n      // and it is not in the database.\n      throw new InvalidRelationError(\n        `There was a problem connecting relation with id ${\n          relation.id\n        } at position ${JSON.stringify(\n          relation.position\n        )}. The relation with id ${adjacentRelId} needs to be connected first.`\n      );\n    } else {\n      // We are in non-strict mode so we can push the relation.\n      sortedConnect.push({ id: relation.id, position: { end: true } });\n    }\n  };\n\n  // Iterate over connectArr and populate sortedConnect\n  connectArr.forEach((relation) => computeRelation(relation, {}));\n\n  return sortedConnect;\n};\n\n/**\n * Responsible for calculating the relations order when connecting them.\n *\n * The connect method takes an array of relations with positional attributes:\n * - before: the id of the relation to connect before\n * - after: the id of the relation to connect after\n * - end: it should be at the end\n * - start: it should be at the start\n *\n * Example:\n *  - Having a connect array like:\n *      [ { id: 4, before: 2 }, { id: 4, before: 3}, {id: 5, before: 4} ]\n * - With the initial relations:\n *      [ { id: 2, order: 4 }, { id: 3, order: 10 } ]\n * - Step by step, going through the connect array, the array of relations would be:\n *      [ { id: 4, order: 3.5 }, { id: 2, order: 4 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.5 },  { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n * - The final step would be to recalculate fractional order values.\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]\n *\n * @param {Array<*>} initArr - array of relations to initialize the class with\n * @param {string} idColumn - the column name of the id\n * @param {string} orderColumn - the column name of the order\n * @param {boolean} strict - if true, will throw an error if a relation is connected adjacent to\n *                               another one that does not exist\n * @return {*}\n */\nconst relationsOrderer = <TRelation extends Record<string, ID | number | null>>(\n  initArr: TRelation[],\n  idColumn: keyof TRelation,\n  orderColumn: keyof TRelation,\n  strict?: boolean\n) => {\n  const computedRelations: OrderedLink[] = _.sortBy(\n    castArray(initArr ?? []).map((r) => ({\n      init: true,\n      id: r[idColumn] as ID,\n      order: r[orderColumn] !== null && r[orderColumn] !== undefined ? Number(r[orderColumn]) : 1,\n    })),\n    'order'\n  );\n\n  const maxOrder = maxBy('order', computedRelations)?.order || 0;\n\n  const findRelation = (id: ID) => {\n    const idx = computedRelations.findIndex((r) => r.id === id);\n    return { idx, relation: computedRelations[idx] };\n  };\n\n  const removeRelation = (r: Link) => {\n    const { idx } = findRelation(r.id);\n    if (idx >= 0) {\n      computedRelations.splice(idx, 1);\n    }\n  };\n\n  const insertRelation = (r: Link) => {\n    let idx;\n\n    if (r.position?.before) {\n      const { idx: beforeIdx, relation } = findRelation(r.position.before);\n      if (relation.init) {\n        const prevRelation = beforeIdx > 0 ? computedRelations[beforeIdx - 1] : null;\n        r.order =\n          prevRelation && prevRelation.order < relation.order\n            ? (prevRelation.order + relation.order) / 2\n            : relation.order - 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = beforeIdx;\n    } else if (r.position?.after) {\n      const { idx: afterIdx, relation } = findRelation(r.position.after);\n      if (relation.init) {\n        const nextRelation =\n          afterIdx < computedRelations.length - 1 ? computedRelations[afterIdx + 1] : null;\n        r.order =\n          nextRelation && nextRelation.order > relation.order\n            ? (relation.order + nextRelation.order) / 2\n            : relation.order + 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = afterIdx + 1;\n    } else if (r.position?.start) {\n      if (computedRelations.length > 0) {\n        const firstRelation = computedRelations[0];\n        r.order = firstRelation.init ? firstRelation.order - 0.5 : firstRelation.order;\n      } else {\n        r.order = 0.5;\n      }\n      idx = 0;\n    } else {\n      r.order = maxOrder + 0.5;\n      idx = computedRelations.length;\n    }\n\n    // Insert the relation in the array\n    computedRelations.splice(idx, 0, r as OrderedLink);\n  };\n\n  return {\n    disconnect(relations: Link | Link[]) {\n      castArray(relations).forEach((relation) => {\n        removeRelation(relation);\n      });\n      return this;\n    },\n    connect(relations: Link | Link[]) {\n      sortConnectArray(castArray(relations), computedRelations, strict).forEach((relation) => {\n        this.disconnect(relation);\n\n        try {\n          insertRelation(relation);\n        } catch {\n          throw new Error(\n            `There was a problem connecting relation with id ${\n              relation.id\n            } at position ${JSON.stringify(\n              relation.position\n            )}. The list of connect relations is not valid`\n          );\n        }\n      });\n      return this;\n    },\n    get() {\n      return computedRelations;\n    },\n    /**\n     * Get a map between the relation id and its order\n     */\n    getOrderMap() {\n      const map: Record<ID, number> = {};\n      const chunks = _(computedRelations).groupBy('order').value();\n      const sortedKeys = Object.keys(chunks).sort((a, b) => parseFloat(a) - parseFloat(b));\n\n      for (const orderStr of sortedKeys) {\n        const relations = chunks[orderStr];\n        let offset = 1;\n        relations.forEach((relation) => {\n          if (!relation.init) {\n            map[relation.id] = parseFloat(orderStr) + (offset / (relations.length + 1)) * 0.49;\n            offset += 1;\n          }\n        });\n      }\n\n      return map;\n    },\n  };\n};\n\nexport { relationsOrderer, sortConnectArray };\n"],"names":["sortConnectArray","connectArr","initialArr","strictSort","sortedConnect","needsSorting","relationInInitialArray","reduce","acc","rel","id","mappedRelations","mapper","relation","adjacentRelId","position","before","after","existingRelation","hasNoComponent","hasSameComponent","__component","InvalidRelationError","computed","computeRelation","relationsSeenInBranch","adjacentRelation","push","JSON","stringify","end","forEach","relationsOrderer","initArr","idColumn","orderColumn","strict","computedRelations","_","sortBy","castArray","map","r","init","order","undefined","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","beforeIdx","prevRelation","afterIdx","nextRelation","length","start","firstRelation","disconnect","relations","connect","Error","get","getOrderMap","chunks","groupBy","value","sortedKeys","Object","keys","sort","a","b","parseFloat","orderStr","offset"],"mappings":";;;;;;;;;;AAkBA;;;;;;;;;;;;;;;;;IAkBA,MAAMA,mBAAmB,CAACC,UAAAA,EAAoBC,aAAqB,EAAE,EAAEC,aAAa,IAAI,GAAA;AACtF,IAAA,MAAMC,gBAAwB,EAAE;;AAEhC,IAAA,IAAIC,YAAAA,GAAe,KAAA;;AAEnB,IAAA,MAAMC,yBAAyBJ,UAAAA,CAAWK,MAAM,CAC9C,CAACC,GAAAA,EAAKC,OAAS;AAAE,YAAA,GAAGD,GAAG;YAAE,CAACC,GAAAA,CAAIC,EAAE,GAAG;AAAK,SAAA,GACxC,EAAC,CAAA;;AAGH,IAAA,MAAMC,eAAAA,GAAkBV,UAAAA,CAAWM,MAAM,CACvC,CAACK,MAAAA,EAAQC,QAAAA,GAAAA;AACP,QAAA,MAAMC,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QAEtE,IAAI,CAACH,aAAAA,IAAkB,CAACR,sBAAsB,CAACQ,aAAAA,CAAc,IAAI,CAACF,MAAM,CAACE,aAAAA,CAAc,EAAG;YACxFT,YAAAA,GAAe,IAAA;AACjB,QAAA;AAEA;;;;;;AAMC;AAGD,QAAA,MAAMa,gBAAAA,GAAmBN,MAAM,CAACC,QAAAA,CAASH,EAAE,CAAC;;AAG5C,QAAA,MAAMS,cAAAA,GAAiBD,gBAAAA,IAAoB,EAAE,iBAAiBA,gBAAe,CAAA;;AAG7E,QAAA,MAAME,mBACJF,gBAAAA,IAAoBA,gBAAAA,CAAiBG,WAAW,KAAKR,SAASQ,WAAW;;AAG3E,QAAA,IAAIH,gBAAAA,KAAqBC,cAAAA,IAAkBC,gBAAe,CAAA,EAAI;YAC5D,MAAM,IAAIE,eAAAA,CACR,CAAC,qBAAqB,EAAET,SAASH,EAAE,CAAC,uBAAuB,CAAC,GAC1D,6CAAA,CAAA;AAEN,QAAA;QAEA,OAAO;YACL,CAACG,QAAAA,CAASH,EAAE,GAAG;AAAE,gBAAA,GAAGG,QAAQ;gBAAEU,QAAAA,EAAU;AAAM,aAAA;AAC9C,YAAA,GAAGX;AACL,SAAA;AACF,IAAA,CAAA,EACA,EAAC,CAAA;;IAIH,IAAI,CAACP,cAAc,OAAOJ,UAAAA;;IAG1B,MAAMuB,eAAAA,GAAkB,CAACX,QAAAA,EAAgBY,qBAAAA,GAAAA;AACvC,QAAA,MAAMX,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QACtE,MAAMS,gBAAAA,GAAmBf,eAAe,CAACG,aAAAA,CAAoB;;;AAI7D,QAAA,IAAIA,aAAAA,IAAiBW,qBAAqB,CAACX,aAAAA,CAAc,EAAE;YACzD,MAAM,IAAIQ,gBACR,uDAAA,GACE,sGAAA,CAAA;AAEN,QAAA;;AAGA,QAAA,IAAIX,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,EAAEa,QAAAA,EAAU;AAC1C,YAAA;AACF,QAAA;AAEAZ,QAAAA,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,CAACa,QAAQ,GAAG,IAAA;;AAGxC,QAAA,IAAI,CAACT,aAAAA,IAAiBR,sBAAsB,CAACQ,cAAc,EAAE;AAC3DV,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACnB,YAAA;AACF,QAAA;;QAGA,IAAIF,eAAe,CAACG,aAAAA,CAAc,EAAE;AAClCU,YAAAA,eAAAA,CAAgBE,gBAAAA,EAAkB;AAAE,gBAAA,GAAGD,qBAAqB;gBAAE,CAACZ,QAAAA,CAASH,EAAE,GAAG;AAAK,aAAA,CAAA;AAClFN,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACrB,QAAA,CAAA,MAAO,IAAIV,UAAAA,EAAY;;;YAGrB,MAAM,IAAImB,gBACR,CAAC,gDAAgD,EAC/CT,QAAAA,CAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,uBAAuB,EAAED,aAAAA,CAAc,6BAA6B,CAAC,CAAA;QAE3E,CAAA,MAAO;;AAELV,YAAAA,aAAAA,CAAcuB,IAAI,CAAC;AAAEjB,gBAAAA,EAAAA,EAAIG,SAASH,EAAE;gBAAEK,QAAAA,EAAU;oBAAEe,GAAAA,EAAK;AAAK;AAAE,aAAA,CAAA;AAChE,QAAA;AACF,IAAA,CAAA;;AAGA7B,IAAAA,UAAAA,CAAW8B,OAAO,CAAC,CAAClB,QAAAA,GAAaW,eAAAA,CAAgBX,UAAU,EAAC,CAAA,CAAA;IAE5D,OAAOT,aAAAA;AACT;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BC,IACD,MAAM4B,gBAAAA,GAAmB,CACvBC,OAAAA,EACAC,UACAC,WAAAA,EACAC,MAAAA,GAAAA;AAEA,IAAA,MAAMC,iBAAAA,GAAmCC,kBAAAA,CAAEC,MAAM,CAC/CC,aAAAA,CAAUP,OAAAA,IAAW,EAAE,CAAA,CAAEQ,GAAG,CAAC,CAACC,CAAAA,IAAO;YACnCC,IAAAA,EAAM,IAAA;YACNjC,EAAAA,EAAIgC,CAAC,CAACR,QAAAA,CAAS;AACfU,YAAAA,KAAAA,EAAOF,CAAC,CAACP,WAAAA,CAAY,KAAK,QAAQO,CAAC,CAACP,WAAAA,CAAY,KAAKU,SAAAA,GAAYC,MAAAA,CAAOJ,CAAC,CAACP,YAAY,CAAA,GAAI;AAC5F,SAAA,CAAA,CAAA,EACA,OAAA,CAAA;AAGF,IAAA,MAAMY,QAAAA,GAAWC,SAAAA,CAAM,OAAA,EAASX,iBAAAA,CAAAA,EAAoBO,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMK,eAAe,CAACvC,EAAAA,GAAAA;QACpB,MAAMwC,GAAAA,GAAMb,kBAAkBc,SAAS,CAAC,CAACT,CAAAA,GAAMA,CAAAA,CAAEhC,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEwC,YAAAA,GAAAA;YAAKrC,QAAAA,EAAUwB,iBAAiB,CAACa,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACV,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEQ,GAAG,EAAE,GAAGD,YAAAA,CAAaP,EAAEhC,EAAE,CAAA;AACjC,QAAA,IAAIwC,OAAO,CAAA,EAAG;YACZb,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACZ,CAAAA,GAAAA;QACtB,IAAIQ,GAAAA;QAEJ,IAAIR,CAAAA,CAAE3B,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAEkC,GAAAA,EAAKK,SAAS,EAAE1C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACC,MAAM,CAAA;YACnE,IAAIH,QAAAA,CAAS8B,IAAI,EAAE;AACjB,gBAAA,MAAMa,eAAeD,SAAAA,GAAY,CAAA,GAAIlB,iBAAiB,CAACkB,SAAAA,GAAY,EAAE,GAAG,IAAA;gBACxEb,CAAAA,CAAEE,KAAK,GACLY,YAAAA,IAAgBA,YAAAA,CAAaZ,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAC9CY,CAAAA,YAAAA,CAAaZ,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,IAAI,CAAA,GACxC/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YACzB,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;YACAM,GAAAA,GAAMK,SAAAA;AACR,QAAA,CAAA,MAAO,IAAIb,CAAAA,CAAE3B,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAEiC,GAAAA,EAAKO,QAAQ,EAAE5C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACE,KAAK,CAAA;YACjE,IAAIJ,QAAAA,CAAS8B,IAAI,EAAE;gBACjB,MAAMe,YAAAA,GACJD,QAAAA,GAAWpB,iBAAAA,CAAkBsB,MAAM,GAAG,IAAItB,iBAAiB,CAACoB,QAAAA,GAAW,CAAA,CAAE,GAAG,IAAA;gBAC9Ef,CAAAA,CAAEE,KAAK,GACLc,YAAAA,IAAgBA,YAAAA,CAAad,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAC9C/B,CAAAA,QAAAA,CAAS+B,KAAK,GAAGc,YAAAA,CAAad,KAAK,IAAI,CAAA,GACxC/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YACzB,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;AACAM,YAAAA,GAAAA,GAAMO,QAAAA,GAAW,CAAA;AACnB,QAAA,CAAA,MAAO,IAAIf,CAAAA,CAAE3B,QAAQ,EAAE6C,KAAAA,EAAO;YAC5B,IAAIvB,iBAAAA,CAAkBsB,MAAM,GAAG,CAAA,EAAG;gBAChC,MAAME,aAAAA,GAAgBxB,iBAAiB,CAAC,CAAA,CAAE;gBAC1CK,CAAAA,CAAEE,KAAK,GAAGiB,aAAAA,CAAclB,IAAI,GAAGkB,cAAcjB,KAAK,GAAG,GAAA,GAAMiB,aAAAA,CAAcjB,KAAK;YAChF,CAAA,MAAO;AACLF,gBAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;AACZ,YAAA;YACAM,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLR,CAAAA,CAAEE,KAAK,GAAGG,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMb,kBAAkBsB,MAAM;AAChC,QAAA;;QAGAtB,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGR,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLoB,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjCvB,aAAAA,CAAUuB,SAAAA,CAAAA,CAAWhC,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BuC,cAAAA,CAAevC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAmD,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9B/D,YAAAA,gBAAAA,CAAiBwC,cAAUuB,SAAAA,CAAAA,EAAY1B,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAACiD,UAAU,CAACjD,QAAAA,CAAAA;gBAEhB,IAAI;oBACFyC,cAAAA,CAAezC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAM;AACN,oBAAA,MAAM,IAAIoD,KAAAA,CACR,CAAC,gDAAgD,EAC/CpD,SAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,4CAA4C,CAAC,CAAA;AAEnD,gBAAA;AACF,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAmD,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAO7B,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGA8B,WAAAA,CAAAA,GAAAA;AACE,YAAA,MAAM1B,MAA0B,EAAC;AACjC,YAAA,MAAM2B,SAAS9B,kBAAAA,CAAED,iBAAAA,CAAAA,CAAmBgC,OAAO,CAAC,SAASC,KAAK,EAAA;AAC1D,YAAA,MAAMC,UAAAA,GAAaC,MAAAA,CAAOC,IAAI,CAACL,MAAAA,CAAAA,CAAQM,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMC,UAAAA,CAAWF,CAAAA,CAAAA,GAAKE,UAAAA,CAAWD,CAAAA,CAAAA,CAAAA;YAEjF,KAAK,MAAME,YAAYP,UAAAA,CAAY;gBACjC,MAAMR,SAAAA,GAAYK,MAAM,CAACU,QAAAA,CAAS;AAClC,gBAAA,IAAIC,MAAAA,GAAS,CAAA;gBACbhB,SAAAA,CAAUhC,OAAO,CAAC,CAAClB,QAAAA,GAAAA;oBACjB,IAAI,CAACA,QAAAA,CAAS8B,IAAI,EAAE;AAClBF,wBAAAA,GAAG,CAAC5B,QAAAA,CAASH,EAAE,CAAC,GAAGmE,UAAAA,CAAWC,QAAAA,CAAAA,GAAY,MAACC,IAAUhB,SAAAA,CAAUJ,MAAM,GAAG,CAAA,CAAA,GAAM,IAAA;wBAC9EoB,MAAAA,IAAU,CAAA;AACZ,oBAAA;AACF,gBAAA,CAAA,CAAA;AACF,YAAA;YAEA,OAAOtC,GAAAA;AACT,QAAA;AACF,KAAA;AACF;;;;;"}
+{"version":3,"file":"relations-orderer.js","sources":["../../src/entity-manager/relations-orderer.ts"],"sourcesContent":["import { castArray, maxBy } from 'lodash/fp';\nimport _ from 'lodash';\n\nimport { InvalidRelationError } from '../errors';\nimport type { ID } from '../types';\n\ninterface Link {\n  id: ID;\n  position?: { before?: ID; after?: ID; start?: true; end?: true };\n  order?: number;\n  __component?: string;\n}\n\ninterface OrderedLink extends Link {\n  init?: boolean;\n  order: number;\n}\n\n/**\n * When connecting relations, the order you connect them matters.\n *\n * Example, if you connect the following relations:\n *   { id: 5, position: { before: 1 } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 2, position: { end: true } }\n *\n * Going through the connect array, id 5 has to be connected before id 1,\n * so the order of id5 = id1 - 1. But the order value of id 1 is unknown.\n * The only way to know the order of id 1 is to connect it first.\n *\n * This function makes sure the relations are connected in the right order:\n *   { id: 2, position: { end: true } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 5, position: { before: 1 } }\n *\n */\nconst sortConnectArray = (connectArr: Link[], initialArr: Link[] = [], strictSort = true) => {\n  const sortedConnect: Link[] = [];\n  // Boolean to know if we have to recalculate the order of the relations\n  let needsSorting = false;\n  // Map to validate if relation is already in sortedConnect or DB.\n  const relationInInitialArray = initialArr.reduce(\n    (acc, rel) => ({ ...acc, [rel.id]: true }),\n    {} as Record<ID, boolean>\n  );\n  // Map to store the first index where a relation id is connected\n  const mappedRelations = connectArr.reduce(\n    (mapper, relation: Link) => {\n      const adjacentRelId = relation.position?.before || relation.position?.after;\n\n      if (!adjacentRelId || (!relationInInitialArray[adjacentRelId] && !mapper[adjacentRelId])) {\n        needsSorting = true;\n      }\n\n      /**\n       * We do not allow duplicate relations to be connected, so we need to check for uniqueness with components\n       * Note that the id here includes the uid for polymorphic relations\n       *\n       * So for normal relations, the same id means the same relation\n       * For component relations, it means the unique combo of (id, component name)\n       */\n\n      // Check if there's an existing relation with this id\n      const existingRelation = mapper[relation.id];\n\n      // Check if existing relation has a component or not\n      const hasNoComponent = existingRelation && !('__component' in existingRelation);\n\n      // Check if the existing relation has the same component as the new relation\n      const hasSameComponent =\n        existingRelation && existingRelation.__component === relation.__component;\n\n      // If we have an existing relation that is not unique (no component or same component) we won't accept it\n      if (existingRelation && (hasNoComponent || hasSameComponent)) {\n        throw new InvalidRelationError(\n          `The relation with id ${relation.id} is already connected. ` +\n            'You cannot connect the same relation twice.'\n        );\n      }\n\n      return {\n        [relation.id]: { ...relation, computed: false },\n        ...mapper,\n      };\n    },\n    {} as Record<ID, Link & { computed: boolean }>\n  );\n\n  // If we don't need to sort the connect array, we can return it as is\n  if (!needsSorting) return connectArr;\n\n  // Recursively compute in which order the relation should be connected\n  const computeRelation = (relation: Link, relationsSeenInBranch: Record<ID, boolean>) => {\n    const adjacentRelId = relation.position?.before || relation.position?.after;\n    const adjacentRelation = mappedRelations[adjacentRelId as ID];\n\n    // If the relation has already been seen in the current branch,\n    // it means there is a circular reference\n    if (adjacentRelId && relationsSeenInBranch[adjacentRelId]) {\n      throw new InvalidRelationError(\n        'A circular reference was found in the connect array. ' +\n          'One relation is trying to connect before/after another one that is trying to connect before/after it'\n      );\n    }\n\n    // This relation has already been computed\n    if (mappedRelations[relation.id]?.computed) {\n      return;\n    }\n\n    mappedRelations[relation.id].computed = true;\n\n    // Relation does not have a before or after attribute or is in the initial array\n    if (!adjacentRelId || relationInInitialArray[adjacentRelId]) {\n      sortedConnect.push(relation);\n      return;\n    }\n\n    // Look if id is referenced elsewhere in the array\n    if (mappedRelations[adjacentRelId]) {\n      computeRelation(adjacentRelation, { ...relationsSeenInBranch, [relation.id]: true });\n      sortedConnect.push(relation);\n    } else if (strictSort) {\n      // If we reach this point, it means that the adjacent relation is not in the connect array\n      // and it is not in the database.\n      throw new InvalidRelationError(\n        `There was a problem connecting relation with id ${\n          relation.id\n        } at position ${JSON.stringify(\n          relation.position\n        )}. The relation with id ${adjacentRelId} needs to be connected first.`\n      );\n    } else {\n      // We are in non-strict mode so we can push the relation.\n      sortedConnect.push({ id: relation.id, position: { end: true } });\n    }\n  };\n\n  // Iterate over connectArr and populate sortedConnect\n  connectArr.forEach((relation) => computeRelation(relation, {}));\n\n  return sortedConnect;\n};\n\n/**\n * Responsible for calculating the relations order when connecting them.\n *\n * The connect method takes an array of relations with positional attributes:\n * - before: the id of the relation to connect before\n * - after: the id of the relation to connect after\n * - end: it should be at the end\n * - start: it should be at the start\n *\n * Example:\n *  - Having a connect array like:\n *      [ { id: 4, before: 2 }, { id: 4, before: 3}, {id: 5, before: 4} ]\n * - With the initial relations:\n *      [ { id: 2, order: 4 }, { id: 3, order: 10 } ]\n * - Step by step, going through the connect array, the array of relations would be:\n *      [ { id: 4, order: 3.5 }, { id: 2, order: 4 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.5 },  { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n * - The final step would be to recalculate fractional order values.\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]\n *\n * `initArr` is not the full relation list. For an ordered connect, `updateRelations` loads only\n * the rows named as anchors by the payload plus the lowest- and highest-ordered rows, so entries\n * that are adjacent in `computedRelations` are not adjacent in the stored list. Placement must be\n * computed from the anchor's own order, never from its neighbours in this array.\n *\n * @param {Array<*>} initArr - array of relations to initialize the class with\n * @param {string} idColumn - the column name of the id\n * @param {string} orderColumn - the column name of the order\n * @param {boolean} strict - if true, will throw an error if a relation is connected adjacent to\n *                               another one that does not exist\n * @return {*}\n */\nconst relationsOrderer = <TRelation extends Record<string, ID | number | null>>(\n  initArr: TRelation[],\n  idColumn: keyof TRelation,\n  orderColumn: keyof TRelation,\n  strict?: boolean\n) => {\n  const computedRelations: OrderedLink[] = _.sortBy(\n    castArray(initArr ?? []).map((r) => ({\n      init: true,\n      id: r[idColumn] as ID,\n      order: r[orderColumn] !== null && r[orderColumn] !== undefined ? Number(r[orderColumn]) : 1,\n    })),\n    'order'\n  );\n\n  const maxOrder = maxBy('order', computedRelations)?.order || 0;\n\n  const findRelation = (id: ID) => {\n    const idx = computedRelations.findIndex((r) => r.id === id);\n    return { idx, relation: computedRelations[idx] };\n  };\n\n  const removeRelation = (r: Link) => {\n    const { idx } = findRelation(r.id);\n    if (idx >= 0) {\n      computedRelations.splice(idx, 1);\n    }\n  };\n\n  const insertRelation = (r: Link) => {\n    let idx;\n\n    if (r.position?.before) {\n      const { idx: beforeIdx, relation } = findRelation(r.position.before);\n      if (relation.init) {\n        r.order = relation.order - 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = beforeIdx;\n    } else if (r.position?.after) {\n      const { idx: afterIdx, relation } = findRelation(r.position.after);\n      if (relation.init) {\n        r.order = relation.order + 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = afterIdx + 1;\n    } else if (r.position?.start) {\n      if (computedRelations.length > 0) {\n        const firstRelation = computedRelations[0];\n        r.order = firstRelation.init ? firstRelation.order - 0.5 : firstRelation.order;\n      } else {\n        r.order = 0.5;\n      }\n      idx = 0;\n    } else {\n      r.order = maxOrder + 0.5;\n      idx = computedRelations.length;\n    }\n\n    // Insert the relation in the array\n    computedRelations.splice(idx, 0, r as OrderedLink);\n  };\n\n  return {\n    disconnect(relations: Link | Link[]) {\n      castArray(relations).forEach((relation) => {\n        removeRelation(relation);\n      });\n      return this;\n    },\n    connect(relations: Link | Link[]) {\n      sortConnectArray(castArray(relations), computedRelations, strict).forEach((relation) => {\n        this.disconnect(relation);\n\n        try {\n          insertRelation(relation);\n        } catch {\n          throw new Error(\n            `There was a problem connecting relation with id ${\n              relation.id\n            } at position ${JSON.stringify(\n              relation.position\n            )}. The list of connect relations is not valid`\n          );\n        }\n      });\n      return this;\n    },\n    get() {\n      return computedRelations;\n    },\n    /**\n     * Get a map between the relation id and its order\n     */\n    getOrderMap() {\n      const map: Record<ID, number> = {};\n      const chunks = _(computedRelations).groupBy('order').value();\n      const sortedKeys = Object.keys(chunks).sort((a, b) => parseFloat(a) - parseFloat(b));\n\n      for (const orderStr of sortedKeys) {\n        const relations = chunks[orderStr];\n        let offset = 1;\n        relations.forEach((relation) => {\n          if (!relation.init) {\n            map[relation.id] = parseFloat(orderStr) + (offset / (relations.length + 1)) * 0.49;\n            offset += 1;\n          }\n        });\n      }\n\n      return map;\n    },\n  };\n};\n\nexport { relationsOrderer, sortConnectArray };\n"],"names":["sortConnectArray","connectArr","initialArr","strictSort","sortedConnect","needsSorting","relationInInitialArray","reduce","acc","rel","id","mappedRelations","mapper","relation","adjacentRelId","position","before","after","existingRelation","hasNoComponent","hasSameComponent","__component","InvalidRelationError","computed","computeRelation","relationsSeenInBranch","adjacentRelation","push","JSON","stringify","end","forEach","relationsOrderer","initArr","idColumn","orderColumn","strict","computedRelations","_","sortBy","castArray","map","r","init","order","undefined","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","beforeIdx","afterIdx","start","length","firstRelation","disconnect","relations","connect","Error","get","getOrderMap","chunks","groupBy","value","sortedKeys","Object","keys","sort","a","b","parseFloat","orderStr","offset"],"mappings":";;;;;;;;;;AAkBA;;;;;;;;;;;;;;;;;IAkBA,MAAMA,mBAAmB,CAACC,UAAAA,EAAoBC,aAAqB,EAAE,EAAEC,aAAa,IAAI,GAAA;AACtF,IAAA,MAAMC,gBAAwB,EAAE;;AAEhC,IAAA,IAAIC,YAAAA,GAAe,KAAA;;AAEnB,IAAA,MAAMC,yBAAyBJ,UAAAA,CAAWK,MAAM,CAC9C,CAACC,GAAAA,EAAKC,OAAS;AAAE,YAAA,GAAGD,GAAG;YAAE,CAACC,GAAAA,CAAIC,EAAE,GAAG;AAAK,SAAA,GACxC,EAAC,CAAA;;AAGH,IAAA,MAAMC,eAAAA,GAAkBV,UAAAA,CAAWM,MAAM,CACvC,CAACK,MAAAA,EAAQC,QAAAA,GAAAA;AACP,QAAA,MAAMC,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QAEtE,IAAI,CAACH,aAAAA,IAAkB,CAACR,sBAAsB,CAACQ,aAAAA,CAAc,IAAI,CAACF,MAAM,CAACE,aAAAA,CAAc,EAAG;YACxFT,YAAAA,GAAe,IAAA;AACjB,QAAA;AAEA;;;;;;AAMC;AAGD,QAAA,MAAMa,gBAAAA,GAAmBN,MAAM,CAACC,QAAAA,CAASH,EAAE,CAAC;;AAG5C,QAAA,MAAMS,cAAAA,GAAiBD,gBAAAA,IAAoB,EAAE,iBAAiBA,gBAAe,CAAA;;AAG7E,QAAA,MAAME,mBACJF,gBAAAA,IAAoBA,gBAAAA,CAAiBG,WAAW,KAAKR,SAASQ,WAAW;;AAG3E,QAAA,IAAIH,gBAAAA,KAAqBC,cAAAA,IAAkBC,gBAAe,CAAA,EAAI;YAC5D,MAAM,IAAIE,eAAAA,CACR,CAAC,qBAAqB,EAAET,SAASH,EAAE,CAAC,uBAAuB,CAAC,GAC1D,6CAAA,CAAA;AAEN,QAAA;QAEA,OAAO;YACL,CAACG,QAAAA,CAASH,EAAE,GAAG;AAAE,gBAAA,GAAGG,QAAQ;gBAAEU,QAAAA,EAAU;AAAM,aAAA;AAC9C,YAAA,GAAGX;AACL,SAAA;AACF,IAAA,CAAA,EACA,EAAC,CAAA;;IAIH,IAAI,CAACP,cAAc,OAAOJ,UAAAA;;IAG1B,MAAMuB,eAAAA,GAAkB,CAACX,QAAAA,EAAgBY,qBAAAA,GAAAA;AACvC,QAAA,MAAMX,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QACtE,MAAMS,gBAAAA,GAAmBf,eAAe,CAACG,aAAAA,CAAoB;;;AAI7D,QAAA,IAAIA,aAAAA,IAAiBW,qBAAqB,CAACX,aAAAA,CAAc,EAAE;YACzD,MAAM,IAAIQ,gBACR,uDAAA,GACE,sGAAA,CAAA;AAEN,QAAA;;AAGA,QAAA,IAAIX,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,EAAEa,QAAAA,EAAU;AAC1C,YAAA;AACF,QAAA;AAEAZ,QAAAA,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,CAACa,QAAQ,GAAG,IAAA;;AAGxC,QAAA,IAAI,CAACT,aAAAA,IAAiBR,sBAAsB,CAACQ,cAAc,EAAE;AAC3DV,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACnB,YAAA;AACF,QAAA;;QAGA,IAAIF,eAAe,CAACG,aAAAA,CAAc,EAAE;AAClCU,YAAAA,eAAAA,CAAgBE,gBAAAA,EAAkB;AAAE,gBAAA,GAAGD,qBAAqB;gBAAE,CAACZ,QAAAA,CAASH,EAAE,GAAG;AAAK,aAAA,CAAA;AAClFN,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACrB,QAAA,CAAA,MAAO,IAAIV,UAAAA,EAAY;;;YAGrB,MAAM,IAAImB,gBACR,CAAC,gDAAgD,EAC/CT,QAAAA,CAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,uBAAuB,EAAED,aAAAA,CAAc,6BAA6B,CAAC,CAAA;QAE3E,CAAA,MAAO;;AAELV,YAAAA,aAAAA,CAAcuB,IAAI,CAAC;AAAEjB,gBAAAA,EAAAA,EAAIG,SAASH,EAAE;gBAAEK,QAAAA,EAAU;oBAAEe,GAAAA,EAAK;AAAK;AAAE,aAAA,CAAA;AAChE,QAAA;AACF,IAAA,CAAA;;AAGA7B,IAAAA,UAAAA,CAAW8B,OAAO,CAAC,CAAClB,QAAAA,GAAaW,eAAAA,CAAgBX,UAAU,EAAC,CAAA,CAAA;IAE5D,OAAOT,aAAAA;AACT;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCC,IACD,MAAM4B,gBAAAA,GAAmB,CACvBC,OAAAA,EACAC,UACAC,WAAAA,EACAC,MAAAA,GAAAA;AAEA,IAAA,MAAMC,iBAAAA,GAAmCC,kBAAAA,CAAEC,MAAM,CAC/CC,aAAAA,CAAUP,OAAAA,IAAW,EAAE,CAAA,CAAEQ,GAAG,CAAC,CAACC,CAAAA,IAAO;YACnCC,IAAAA,EAAM,IAAA;YACNjC,EAAAA,EAAIgC,CAAC,CAACR,QAAAA,CAAS;AACfU,YAAAA,KAAAA,EAAOF,CAAC,CAACP,WAAAA,CAAY,KAAK,QAAQO,CAAC,CAACP,WAAAA,CAAY,KAAKU,SAAAA,GAAYC,MAAAA,CAAOJ,CAAC,CAACP,YAAY,CAAA,GAAI;AAC5F,SAAA,CAAA,CAAA,EACA,OAAA,CAAA;AAGF,IAAA,MAAMY,QAAAA,GAAWC,SAAAA,CAAM,OAAA,EAASX,iBAAAA,CAAAA,EAAoBO,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMK,eAAe,CAACvC,EAAAA,GAAAA;QACpB,MAAMwC,GAAAA,GAAMb,kBAAkBc,SAAS,CAAC,CAACT,CAAAA,GAAMA,CAAAA,CAAEhC,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEwC,YAAAA,GAAAA;YAAKrC,QAAAA,EAAUwB,iBAAiB,CAACa,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACV,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEQ,GAAG,EAAE,GAAGD,YAAAA,CAAaP,EAAEhC,EAAE,CAAA;AACjC,QAAA,IAAIwC,OAAO,CAAA,EAAG;YACZb,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACZ,CAAAA,GAAAA;QACtB,IAAIQ,GAAAA;QAEJ,IAAIR,CAAAA,CAAE3B,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAEkC,GAAAA,EAAKK,SAAS,EAAE1C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACC,MAAM,CAAA;YACnE,IAAIH,QAAAA,CAAS8B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;YACAM,GAAAA,GAAMK,SAAAA;AACR,QAAA,CAAA,MAAO,IAAIb,CAAAA,CAAE3B,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAEiC,GAAAA,EAAKM,QAAQ,EAAE3C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACE,KAAK,CAAA;YACjE,IAAIJ,QAAAA,CAAS8B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;AACAM,YAAAA,GAAAA,GAAMM,QAAAA,GAAW,CAAA;AACnB,QAAA,CAAA,MAAO,IAAId,CAAAA,CAAE3B,QAAQ,EAAE0C,KAAAA,EAAO;YAC5B,IAAIpB,iBAAAA,CAAkBqB,MAAM,GAAG,CAAA,EAAG;gBAChC,MAAMC,aAAAA,GAAgBtB,iBAAiB,CAAC,CAAA,CAAE;gBAC1CK,CAAAA,CAAEE,KAAK,GAAGe,aAAAA,CAAchB,IAAI,GAAGgB,cAAcf,KAAK,GAAG,GAAA,GAAMe,aAAAA,CAAcf,KAAK;YAChF,CAAA,MAAO;AACLF,gBAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;AACZ,YAAA;YACAM,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLR,CAAAA,CAAEE,KAAK,GAAGG,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMb,kBAAkBqB,MAAM;AAChC,QAAA;;QAGArB,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGR,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLkB,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjCrB,aAAAA,CAAUqB,SAAAA,CAAAA,CAAW9B,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BuC,cAAAA,CAAevC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAiD,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9B7D,YAAAA,gBAAAA,CAAiBwC,cAAUqB,SAAAA,CAAAA,EAAYxB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC+C,UAAU,CAAC/C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFyC,cAAAA,CAAezC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAM;AACN,oBAAA,MAAM,IAAIkD,KAAAA,CACR,CAAC,gDAAgD,EAC/ClD,SAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,4CAA4C,CAAC,CAAA;AAEnD,gBAAA;AACF,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAiD,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAO3B,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGA4B,WAAAA,CAAAA,GAAAA;AACE,YAAA,MAAMxB,MAA0B,EAAC;AACjC,YAAA,MAAMyB,SAAS5B,kBAAAA,CAAED,iBAAAA,CAAAA,CAAmB8B,OAAO,CAAC,SAASC,KAAK,EAAA;AAC1D,YAAA,MAAMC,UAAAA,GAAaC,MAAAA,CAAOC,IAAI,CAACL,MAAAA,CAAAA,CAAQM,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMC,UAAAA,CAAWF,CAAAA,CAAAA,GAAKE,UAAAA,CAAWD,CAAAA,CAAAA,CAAAA;YAEjF,KAAK,MAAME,YAAYP,UAAAA,CAAY;gBACjC,MAAMR,SAAAA,GAAYK,MAAM,CAACU,QAAAA,CAAS;AAClC,gBAAA,IAAIC,MAAAA,GAAS,CAAA;gBACbhB,SAAAA,CAAU9B,OAAO,CAAC,CAAClB,QAAAA,GAAAA;oBACjB,IAAI,CAACA,QAAAA,CAAS8B,IAAI,EAAE;AAClBF,wBAAAA,GAAG,CAAC5B,QAAAA,CAASH,EAAE,CAAC,GAAGiE,UAAAA,CAAWC,QAAAA,CAAAA,GAAY,MAACC,IAAUhB,SAAAA,CAAUH,MAAM,GAAG,CAAA,CAAA,GAAM,IAAA;wBAC9EmB,MAAAA,IAAU,CAAA;AACZ,oBAAA;AACF,gBAAA,CAAA,CAAA;AACF,YAAA;YAEA,OAAOpC,GAAAA;AACT,QAAA;AACF,KAAA;AACF;;;;;"}

package/dist/entity-manager/relations-orderer.mjs

@@ -125,6 +125,11 @@ import InvalidRelationError from '../errors/invalid-relation.mjs';
  * - The final step would be to recalculate fractional order values.
  *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]
  *
+ * `initArr` is not the full relation list. For an ordered connect, `updateRelations` loads only
+ * the rows named as anchors by the payload plus the lowest- and highest-ordered rows, so entries
+ * that are adjacent in `computedRelations` are not adjacent in the stored list. Placement must be
+ * computed from the anchor's own order, never from its neighbours in this array.
+ *
  * @param {Array<*>} initArr - array of relations to initialize the class with
  * @param {string} idColumn - the column name of the id
  * @param {string} orderColumn - the column name of the order
@@ -156,8 +161,7 @@ import InvalidRelationError from '../errors/invalid-relation.mjs';
         if (r.position?.before) {
             const { idx: beforeIdx, relation } = findRelation(r.position.before);
             if (relation.init) {
-                const prevRelation = beforeIdx > 0 ? computedRelations[beforeIdx - 1] : null;
-                r.order = prevRelation && prevRelation.order < relation.order ? (prevRelation.order + relation.order) / 2 : relation.order - 0.5;
+                r.order = relation.order - 0.5;
             } else {
                 r.order = relation.order;
             }
@@ -165,8 +169,7 @@ import InvalidRelationError from '../errors/invalid-relation.mjs';
         } else if (r.position?.after) {
             const { idx: afterIdx, relation } = findRelation(r.position.after);
             if (relation.init) {
-                const nextRelation = afterIdx < computedRelations.length - 1 ? computedRelations[afterIdx + 1] : null;
-                r.order = nextRelation && nextRelation.order > relation.order ? (relation.order + nextRelation.order) / 2 : relation.order + 0.5;
+                r.order = relation.order + 0.5;
             } else {
                 r.order = relation.order;
             }

package/dist/entity-manager/relations-orderer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"relations-orderer.mjs","sources":["../../src/entity-manager/relations-orderer.ts"],"sourcesContent":["import { castArray, maxBy } from 'lodash/fp';\nimport _ from 'lodash';\n\nimport { InvalidRelationError } from '../errors';\nimport type { ID } from '../types';\n\ninterface Link {\n  id: ID;\n  position?: { before?: ID; after?: ID; start?: true; end?: true };\n  order?: number;\n  __component?: string;\n}\n\ninterface OrderedLink extends Link {\n  init?: boolean;\n  order: number;\n}\n\n/**\n * When connecting relations, the order you connect them matters.\n *\n * Example, if you connect the following relations:\n *   { id: 5, position: { before: 1 } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 2, position: { end: true } }\n *\n * Going through the connect array, id 5 has to be connected before id 1,\n * so the order of id5 = id1 - 1. But the order value of id 1 is unknown.\n * The only way to know the order of id 1 is to connect it first.\n *\n * This function makes sure the relations are connected in the right order:\n *   { id: 2, position: { end: true } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 5, position: { before: 1 } }\n *\n */\nconst sortConnectArray = (connectArr: Link[], initialArr: Link[] = [], strictSort = true) => {\n  const sortedConnect: Link[] = [];\n  // Boolean to know if we have to recalculate the order of the relations\n  let needsSorting = false;\n  // Map to validate if relation is already in sortedConnect or DB.\n  const relationInInitialArray = initialArr.reduce(\n    (acc, rel) => ({ ...acc, [rel.id]: true }),\n    {} as Record<ID, boolean>\n  );\n  // Map to store the first index where a relation id is connected\n  const mappedRelations = connectArr.reduce(\n    (mapper, relation: Link) => {\n      const adjacentRelId = relation.position?.before || relation.position?.after;\n\n      if (!adjacentRelId || (!relationInInitialArray[adjacentRelId] && !mapper[adjacentRelId])) {\n        needsSorting = true;\n      }\n\n      /**\n       * We do not allow duplicate relations to be connected, so we need to check for uniqueness with components\n       * Note that the id here includes the uid for polymorphic relations\n       *\n       * So for normal relations, the same id means the same relation\n       * For component relations, it means the unique combo of (id, component name)\n       */\n\n      // Check if there's an existing relation with this id\n      const existingRelation = mapper[relation.id];\n\n      // Check if existing relation has a component or not\n      const hasNoComponent = existingRelation && !('__component' in existingRelation);\n\n      // Check if the existing relation has the same component as the new relation\n      const hasSameComponent =\n        existingRelation && existingRelation.__component === relation.__component;\n\n      // If we have an existing relation that is not unique (no component or same component) we won't accept it\n      if (existingRelation && (hasNoComponent || hasSameComponent)) {\n        throw new InvalidRelationError(\n          `The relation with id ${relation.id} is already connected. ` +\n            'You cannot connect the same relation twice.'\n        );\n      }\n\n      return {\n        [relation.id]: { ...relation, computed: false },\n        ...mapper,\n      };\n    },\n    {} as Record<ID, Link & { computed: boolean }>\n  );\n\n  // If we don't need to sort the connect array, we can return it as is\n  if (!needsSorting) return connectArr;\n\n  // Recursively compute in which order the relation should be connected\n  const computeRelation = (relation: Link, relationsSeenInBranch: Record<ID, boolean>) => {\n    const adjacentRelId = relation.position?.before || relation.position?.after;\n    const adjacentRelation = mappedRelations[adjacentRelId as ID];\n\n    // If the relation has already been seen in the current branch,\n    // it means there is a circular reference\n    if (adjacentRelId && relationsSeenInBranch[adjacentRelId]) {\n      throw new InvalidRelationError(\n        'A circular reference was found in the connect array. ' +\n          'One relation is trying to connect before/after another one that is trying to connect before/after it'\n      );\n    }\n\n    // This relation has already been computed\n    if (mappedRelations[relation.id]?.computed) {\n      return;\n    }\n\n    mappedRelations[relation.id].computed = true;\n\n    // Relation does not have a before or after attribute or is in the initial array\n    if (!adjacentRelId || relationInInitialArray[adjacentRelId]) {\n      sortedConnect.push(relation);\n      return;\n    }\n\n    // Look if id is referenced elsewhere in the array\n    if (mappedRelations[adjacentRelId]) {\n      computeRelation(adjacentRelation, { ...relationsSeenInBranch, [relation.id]: true });\n      sortedConnect.push(relation);\n    } else if (strictSort) {\n      // If we reach this point, it means that the adjacent relation is not in the connect array\n      // and it is not in the database.\n      throw new InvalidRelationError(\n        `There was a problem connecting relation with id ${\n          relation.id\n        } at position ${JSON.stringify(\n          relation.position\n        )}. The relation with id ${adjacentRelId} needs to be connected first.`\n      );\n    } else {\n      // We are in non-strict mode so we can push the relation.\n      sortedConnect.push({ id: relation.id, position: { end: true } });\n    }\n  };\n\n  // Iterate over connectArr and populate sortedConnect\n  connectArr.forEach((relation) => computeRelation(relation, {}));\n\n  return sortedConnect;\n};\n\n/**\n * Responsible for calculating the relations order when connecting them.\n *\n * The connect method takes an array of relations with positional attributes:\n * - before: the id of the relation to connect before\n * - after: the id of the relation to connect after\n * - end: it should be at the end\n * - start: it should be at the start\n *\n * Example:\n *  - Having a connect array like:\n *      [ { id: 4, before: 2 }, { id: 4, before: 3}, {id: 5, before: 4} ]\n * - With the initial relations:\n *      [ { id: 2, order: 4 }, { id: 3, order: 10 } ]\n * - Step by step, going through the connect array, the array of relations would be:\n *      [ { id: 4, order: 3.5 }, { id: 2, order: 4 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.5 },  { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n * - The final step would be to recalculate fractional order values.\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]\n *\n * @param {Array<*>} initArr - array of relations to initialize the class with\n * @param {string} idColumn - the column name of the id\n * @param {string} orderColumn - the column name of the order\n * @param {boolean} strict - if true, will throw an error if a relation is connected adjacent to\n *                               another one that does not exist\n * @return {*}\n */\nconst relationsOrderer = <TRelation extends Record<string, ID | number | null>>(\n  initArr: TRelation[],\n  idColumn: keyof TRelation,\n  orderColumn: keyof TRelation,\n  strict?: boolean\n) => {\n  const computedRelations: OrderedLink[] = _.sortBy(\n    castArray(initArr ?? []).map((r) => ({\n      init: true,\n      id: r[idColumn] as ID,\n      order: r[orderColumn] !== null && r[orderColumn] !== undefined ? Number(r[orderColumn]) : 1,\n    })),\n    'order'\n  );\n\n  const maxOrder = maxBy('order', computedRelations)?.order || 0;\n\n  const findRelation = (id: ID) => {\n    const idx = computedRelations.findIndex((r) => r.id === id);\n    return { idx, relation: computedRelations[idx] };\n  };\n\n  const removeRelation = (r: Link) => {\n    const { idx } = findRelation(r.id);\n    if (idx >= 0) {\n      computedRelations.splice(idx, 1);\n    }\n  };\n\n  const insertRelation = (r: Link) => {\n    let idx;\n\n    if (r.position?.before) {\n      const { idx: beforeIdx, relation } = findRelation(r.position.before);\n      if (relation.init) {\n        const prevRelation = beforeIdx > 0 ? computedRelations[beforeIdx - 1] : null;\n        r.order =\n          prevRelation && prevRelation.order < relation.order\n            ? (prevRelation.order + relation.order) / 2\n            : relation.order - 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = beforeIdx;\n    } else if (r.position?.after) {\n      const { idx: afterIdx, relation } = findRelation(r.position.after);\n      if (relation.init) {\n        const nextRelation =\n          afterIdx < computedRelations.length - 1 ? computedRelations[afterIdx + 1] : null;\n        r.order =\n          nextRelation && nextRelation.order > relation.order\n            ? (relation.order + nextRelation.order) / 2\n            : relation.order + 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = afterIdx + 1;\n    } else if (r.position?.start) {\n      if (computedRelations.length > 0) {\n        const firstRelation = computedRelations[0];\n        r.order = firstRelation.init ? firstRelation.order - 0.5 : firstRelation.order;\n      } else {\n        r.order = 0.5;\n      }\n      idx = 0;\n    } else {\n      r.order = maxOrder + 0.5;\n      idx = computedRelations.length;\n    }\n\n    // Insert the relation in the array\n    computedRelations.splice(idx, 0, r as OrderedLink);\n  };\n\n  return {\n    disconnect(relations: Link | Link[]) {\n      castArray(relations).forEach((relation) => {\n        removeRelation(relation);\n      });\n      return this;\n    },\n    connect(relations: Link | Link[]) {\n      sortConnectArray(castArray(relations), computedRelations, strict).forEach((relation) => {\n        this.disconnect(relation);\n\n        try {\n          insertRelation(relation);\n        } catch {\n          throw new Error(\n            `There was a problem connecting relation with id ${\n              relation.id\n            } at position ${JSON.stringify(\n              relation.position\n            )}. The list of connect relations is not valid`\n          );\n        }\n      });\n      return this;\n    },\n    get() {\n      return computedRelations;\n    },\n    /**\n     * Get a map between the relation id and its order\n     */\n    getOrderMap() {\n      const map: Record<ID, number> = {};\n      const chunks = _(computedRelations).groupBy('order').value();\n      const sortedKeys = Object.keys(chunks).sort((a, b) => parseFloat(a) - parseFloat(b));\n\n      for (const orderStr of sortedKeys) {\n        const relations = chunks[orderStr];\n        let offset = 1;\n        relations.forEach((relation) => {\n          if (!relation.init) {\n            map[relation.id] = parseFloat(orderStr) + (offset / (relations.length + 1)) * 0.49;\n            offset += 1;\n          }\n        });\n      }\n\n      return map;\n    },\n  };\n};\n\nexport { relationsOrderer, sortConnectArray };\n"],"names":["sortConnectArray","connectArr","initialArr","strictSort","sortedConnect","needsSorting","relationInInitialArray","reduce","acc","rel","id","mappedRelations","mapper","relation","adjacentRelId","position","before","after","existingRelation","hasNoComponent","hasSameComponent","__component","InvalidRelationError","computed","computeRelation","relationsSeenInBranch","adjacentRelation","push","JSON","stringify","end","forEach","relationsOrderer","initArr","idColumn","orderColumn","strict","computedRelations","_","sortBy","castArray","map","r","init","order","undefined","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","beforeIdx","prevRelation","afterIdx","nextRelation","length","start","firstRelation","disconnect","relations","connect","Error","get","getOrderMap","chunks","groupBy","value","sortedKeys","Object","keys","sort","a","b","parseFloat","orderStr","offset"],"mappings":";;;;AAkBA;;;;;;;;;;;;;;;;;IAkBA,MAAMA,mBAAmB,CAACC,UAAAA,EAAoBC,aAAqB,EAAE,EAAEC,aAAa,IAAI,GAAA;AACtF,IAAA,MAAMC,gBAAwB,EAAE;;AAEhC,IAAA,IAAIC,YAAAA,GAAe,KAAA;;AAEnB,IAAA,MAAMC,yBAAyBJ,UAAAA,CAAWK,MAAM,CAC9C,CAACC,GAAAA,EAAKC,OAAS;AAAE,YAAA,GAAGD,GAAG;YAAE,CAACC,GAAAA,CAAIC,EAAE,GAAG;AAAK,SAAA,GACxC,EAAC,CAAA;;AAGH,IAAA,MAAMC,eAAAA,GAAkBV,UAAAA,CAAWM,MAAM,CACvC,CAACK,MAAAA,EAAQC,QAAAA,GAAAA;AACP,QAAA,MAAMC,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QAEtE,IAAI,CAACH,aAAAA,IAAkB,CAACR,sBAAsB,CAACQ,aAAAA,CAAc,IAAI,CAACF,MAAM,CAACE,aAAAA,CAAc,EAAG;YACxFT,YAAAA,GAAe,IAAA;AACjB,QAAA;AAEA;;;;;;AAMC;AAGD,QAAA,MAAMa,gBAAAA,GAAmBN,MAAM,CAACC,QAAAA,CAASH,EAAE,CAAC;;AAG5C,QAAA,MAAMS,cAAAA,GAAiBD,gBAAAA,IAAoB,EAAE,iBAAiBA,gBAAe,CAAA;;AAG7E,QAAA,MAAME,mBACJF,gBAAAA,IAAoBA,gBAAAA,CAAiBG,WAAW,KAAKR,SAASQ,WAAW;;AAG3E,QAAA,IAAIH,gBAAAA,KAAqBC,cAAAA,IAAkBC,gBAAe,CAAA,EAAI;YAC5D,MAAM,IAAIE,oBAAAA,CACR,CAAC,qBAAqB,EAAET,SAASH,EAAE,CAAC,uBAAuB,CAAC,GAC1D,6CAAA,CAAA;AAEN,QAAA;QAEA,OAAO;YACL,CAACG,QAAAA,CAASH,EAAE,GAAG;AAAE,gBAAA,GAAGG,QAAQ;gBAAEU,QAAAA,EAAU;AAAM,aAAA;AAC9C,YAAA,GAAGX;AACL,SAAA;AACF,IAAA,CAAA,EACA,EAAC,CAAA;;IAIH,IAAI,CAACP,cAAc,OAAOJ,UAAAA;;IAG1B,MAAMuB,eAAAA,GAAkB,CAACX,QAAAA,EAAgBY,qBAAAA,GAAAA;AACvC,QAAA,MAAMX,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QACtE,MAAMS,gBAAAA,GAAmBf,eAAe,CAACG,aAAAA,CAAoB;;;AAI7D,QAAA,IAAIA,aAAAA,IAAiBW,qBAAqB,CAACX,aAAAA,CAAc,EAAE;YACzD,MAAM,IAAIQ,qBACR,uDAAA,GACE,sGAAA,CAAA;AAEN,QAAA;;AAGA,QAAA,IAAIX,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,EAAEa,QAAAA,EAAU;AAC1C,YAAA;AACF,QAAA;AAEAZ,QAAAA,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,CAACa,QAAQ,GAAG,IAAA;;AAGxC,QAAA,IAAI,CAACT,aAAAA,IAAiBR,sBAAsB,CAACQ,cAAc,EAAE;AAC3DV,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACnB,YAAA;AACF,QAAA;;QAGA,IAAIF,eAAe,CAACG,aAAAA,CAAc,EAAE;AAClCU,YAAAA,eAAAA,CAAgBE,gBAAAA,EAAkB;AAAE,gBAAA,GAAGD,qBAAqB;gBAAE,CAACZ,QAAAA,CAASH,EAAE,GAAG;AAAK,aAAA,CAAA;AAClFN,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACrB,QAAA,CAAA,MAAO,IAAIV,UAAAA,EAAY;;;YAGrB,MAAM,IAAImB,qBACR,CAAC,gDAAgD,EAC/CT,QAAAA,CAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,uBAAuB,EAAED,aAAAA,CAAc,6BAA6B,CAAC,CAAA;QAE3E,CAAA,MAAO;;AAELV,YAAAA,aAAAA,CAAcuB,IAAI,CAAC;AAAEjB,gBAAAA,EAAAA,EAAIG,SAASH,EAAE;gBAAEK,QAAAA,EAAU;oBAAEe,GAAAA,EAAK;AAAK;AAAE,aAAA,CAAA;AAChE,QAAA;AACF,IAAA,CAAA;;AAGA7B,IAAAA,UAAAA,CAAW8B,OAAO,CAAC,CAAClB,QAAAA,GAAaW,eAAAA,CAAgBX,UAAU,EAAC,CAAA,CAAA;IAE5D,OAAOT,aAAAA;AACT;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BC,IACD,MAAM4B,gBAAAA,GAAmB,CACvBC,OAAAA,EACAC,UACAC,WAAAA,EACAC,MAAAA,GAAAA;AAEA,IAAA,MAAMC,iBAAAA,GAAmCC,CAAAA,CAAEC,MAAM,CAC/CC,SAAAA,CAAUP,OAAAA,IAAW,EAAE,CAAA,CAAEQ,GAAG,CAAC,CAACC,CAAAA,IAAO;YACnCC,IAAAA,EAAM,IAAA;YACNjC,EAAAA,EAAIgC,CAAC,CAACR,QAAAA,CAAS;AACfU,YAAAA,KAAAA,EAAOF,CAAC,CAACP,WAAAA,CAAY,KAAK,QAAQO,CAAC,CAACP,WAAAA,CAAY,KAAKU,SAAAA,GAAYC,MAAAA,CAAOJ,CAAC,CAACP,YAAY,CAAA,GAAI;AAC5F,SAAA,CAAA,CAAA,EACA,OAAA,CAAA;AAGF,IAAA,MAAMY,QAAAA,GAAWC,KAAAA,CAAM,OAAA,EAASX,iBAAAA,CAAAA,EAAoBO,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMK,eAAe,CAACvC,EAAAA,GAAAA;QACpB,MAAMwC,GAAAA,GAAMb,kBAAkBc,SAAS,CAAC,CAACT,CAAAA,GAAMA,CAAAA,CAAEhC,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEwC,YAAAA,GAAAA;YAAKrC,QAAAA,EAAUwB,iBAAiB,CAACa,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACV,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEQ,GAAG,EAAE,GAAGD,YAAAA,CAAaP,EAAEhC,EAAE,CAAA;AACjC,QAAA,IAAIwC,OAAO,CAAA,EAAG;YACZb,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACZ,CAAAA,GAAAA;QACtB,IAAIQ,GAAAA;QAEJ,IAAIR,CAAAA,CAAE3B,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAEkC,GAAAA,EAAKK,SAAS,EAAE1C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACC,MAAM,CAAA;YACnE,IAAIH,QAAAA,CAAS8B,IAAI,EAAE;AACjB,gBAAA,MAAMa,eAAeD,SAAAA,GAAY,CAAA,GAAIlB,iBAAiB,CAACkB,SAAAA,GAAY,EAAE,GAAG,IAAA;gBACxEb,CAAAA,CAAEE,KAAK,GACLY,YAAAA,IAAgBA,YAAAA,CAAaZ,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAC9CY,CAAAA,YAAAA,CAAaZ,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,IAAI,CAAA,GACxC/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YACzB,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;YACAM,GAAAA,GAAMK,SAAAA;AACR,QAAA,CAAA,MAAO,IAAIb,CAAAA,CAAE3B,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAEiC,GAAAA,EAAKO,QAAQ,EAAE5C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACE,KAAK,CAAA;YACjE,IAAIJ,QAAAA,CAAS8B,IAAI,EAAE;gBACjB,MAAMe,YAAAA,GACJD,QAAAA,GAAWpB,iBAAAA,CAAkBsB,MAAM,GAAG,IAAItB,iBAAiB,CAACoB,QAAAA,GAAW,CAAA,CAAE,GAAG,IAAA;gBAC9Ef,CAAAA,CAAEE,KAAK,GACLc,YAAAA,IAAgBA,YAAAA,CAAad,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAC9C/B,CAAAA,QAAAA,CAAS+B,KAAK,GAAGc,YAAAA,CAAad,KAAK,IAAI,CAAA,GACxC/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YACzB,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;AACAM,YAAAA,GAAAA,GAAMO,QAAAA,GAAW,CAAA;AACnB,QAAA,CAAA,MAAO,IAAIf,CAAAA,CAAE3B,QAAQ,EAAE6C,KAAAA,EAAO;YAC5B,IAAIvB,iBAAAA,CAAkBsB,MAAM,GAAG,CAAA,EAAG;gBAChC,MAAME,aAAAA,GAAgBxB,iBAAiB,CAAC,CAAA,CAAE;gBAC1CK,CAAAA,CAAEE,KAAK,GAAGiB,aAAAA,CAAclB,IAAI,GAAGkB,cAAcjB,KAAK,GAAG,GAAA,GAAMiB,aAAAA,CAAcjB,KAAK;YAChF,CAAA,MAAO;AACLF,gBAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;AACZ,YAAA;YACAM,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLR,CAAAA,CAAEE,KAAK,GAAGG,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMb,kBAAkBsB,MAAM;AAChC,QAAA;;QAGAtB,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGR,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLoB,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjCvB,SAAAA,CAAUuB,SAAAA,CAAAA,CAAWhC,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BuC,cAAAA,CAAevC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAmD,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9B/D,YAAAA,gBAAAA,CAAiBwC,UAAUuB,SAAAA,CAAAA,EAAY1B,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAACiD,UAAU,CAACjD,QAAAA,CAAAA;gBAEhB,IAAI;oBACFyC,cAAAA,CAAezC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAM;AACN,oBAAA,MAAM,IAAIoD,KAAAA,CACR,CAAC,gDAAgD,EAC/CpD,SAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,4CAA4C,CAAC,CAAA;AAEnD,gBAAA;AACF,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAmD,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAO7B,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGA8B,WAAAA,CAAAA,GAAAA;AACE,YAAA,MAAM1B,MAA0B,EAAC;AACjC,YAAA,MAAM2B,SAAS9B,CAAAA,CAAED,iBAAAA,CAAAA,CAAmBgC,OAAO,CAAC,SAASC,KAAK,EAAA;AAC1D,YAAA,MAAMC,UAAAA,GAAaC,MAAAA,CAAOC,IAAI,CAACL,MAAAA,CAAAA,CAAQM,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMC,UAAAA,CAAWF,CAAAA,CAAAA,GAAKE,UAAAA,CAAWD,CAAAA,CAAAA,CAAAA;YAEjF,KAAK,MAAME,YAAYP,UAAAA,CAAY;gBACjC,MAAMR,SAAAA,GAAYK,MAAM,CAACU,QAAAA,CAAS;AAClC,gBAAA,IAAIC,MAAAA,GAAS,CAAA;gBACbhB,SAAAA,CAAUhC,OAAO,CAAC,CAAClB,QAAAA,GAAAA;oBACjB,IAAI,CAACA,QAAAA,CAAS8B,IAAI,EAAE;AAClBF,wBAAAA,GAAG,CAAC5B,QAAAA,CAASH,EAAE,CAAC,GAAGmE,UAAAA,CAAWC,QAAAA,CAAAA,GAAY,MAACC,IAAUhB,SAAAA,CAAUJ,MAAM,GAAG,CAAA,CAAA,GAAM,IAAA;wBAC9EoB,MAAAA,IAAU,CAAA;AACZ,oBAAA;AACF,gBAAA,CAAA,CAAA;AACF,YAAA;YAEA,OAAOtC,GAAAA;AACT,QAAA;AACF,KAAA;AACF;;;;"}
+{"version":3,"file":"relations-orderer.mjs","sources":["../../src/entity-manager/relations-orderer.ts"],"sourcesContent":["import { castArray, maxBy } from 'lodash/fp';\nimport _ from 'lodash';\n\nimport { InvalidRelationError } from '../errors';\nimport type { ID } from '../types';\n\ninterface Link {\n  id: ID;\n  position?: { before?: ID; after?: ID; start?: true; end?: true };\n  order?: number;\n  __component?: string;\n}\n\ninterface OrderedLink extends Link {\n  init?: boolean;\n  order: number;\n}\n\n/**\n * When connecting relations, the order you connect them matters.\n *\n * Example, if you connect the following relations:\n *   { id: 5, position: { before: 1 } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 2, position: { end: true } }\n *\n * Going through the connect array, id 5 has to be connected before id 1,\n * so the order of id5 = id1 - 1. But the order value of id 1 is unknown.\n * The only way to know the order of id 1 is to connect it first.\n *\n * This function makes sure the relations are connected in the right order:\n *   { id: 2, position: { end: true } }\n *   { id: 1, position: { before: 2 } }\n *   { id: 5, position: { before: 1 } }\n *\n */\nconst sortConnectArray = (connectArr: Link[], initialArr: Link[] = [], strictSort = true) => {\n  const sortedConnect: Link[] = [];\n  // Boolean to know if we have to recalculate the order of the relations\n  let needsSorting = false;\n  // Map to validate if relation is already in sortedConnect or DB.\n  const relationInInitialArray = initialArr.reduce(\n    (acc, rel) => ({ ...acc, [rel.id]: true }),\n    {} as Record<ID, boolean>\n  );\n  // Map to store the first index where a relation id is connected\n  const mappedRelations = connectArr.reduce(\n    (mapper, relation: Link) => {\n      const adjacentRelId = relation.position?.before || relation.position?.after;\n\n      if (!adjacentRelId || (!relationInInitialArray[adjacentRelId] && !mapper[adjacentRelId])) {\n        needsSorting = true;\n      }\n\n      /**\n       * We do not allow duplicate relations to be connected, so we need to check for uniqueness with components\n       * Note that the id here includes the uid for polymorphic relations\n       *\n       * So for normal relations, the same id means the same relation\n       * For component relations, it means the unique combo of (id, component name)\n       */\n\n      // Check if there's an existing relation with this id\n      const existingRelation = mapper[relation.id];\n\n      // Check if existing relation has a component or not\n      const hasNoComponent = existingRelation && !('__component' in existingRelation);\n\n      // Check if the existing relation has the same component as the new relation\n      const hasSameComponent =\n        existingRelation && existingRelation.__component === relation.__component;\n\n      // If we have an existing relation that is not unique (no component or same component) we won't accept it\n      if (existingRelation && (hasNoComponent || hasSameComponent)) {\n        throw new InvalidRelationError(\n          `The relation with id ${relation.id} is already connected. ` +\n            'You cannot connect the same relation twice.'\n        );\n      }\n\n      return {\n        [relation.id]: { ...relation, computed: false },\n        ...mapper,\n      };\n    },\n    {} as Record<ID, Link & { computed: boolean }>\n  );\n\n  // If we don't need to sort the connect array, we can return it as is\n  if (!needsSorting) return connectArr;\n\n  // Recursively compute in which order the relation should be connected\n  const computeRelation = (relation: Link, relationsSeenInBranch: Record<ID, boolean>) => {\n    const adjacentRelId = relation.position?.before || relation.position?.after;\n    const adjacentRelation = mappedRelations[adjacentRelId as ID];\n\n    // If the relation has already been seen in the current branch,\n    // it means there is a circular reference\n    if (adjacentRelId && relationsSeenInBranch[adjacentRelId]) {\n      throw new InvalidRelationError(\n        'A circular reference was found in the connect array. ' +\n          'One relation is trying to connect before/after another one that is trying to connect before/after it'\n      );\n    }\n\n    // This relation has already been computed\n    if (mappedRelations[relation.id]?.computed) {\n      return;\n    }\n\n    mappedRelations[relation.id].computed = true;\n\n    // Relation does not have a before or after attribute or is in the initial array\n    if (!adjacentRelId || relationInInitialArray[adjacentRelId]) {\n      sortedConnect.push(relation);\n      return;\n    }\n\n    // Look if id is referenced elsewhere in the array\n    if (mappedRelations[adjacentRelId]) {\n      computeRelation(adjacentRelation, { ...relationsSeenInBranch, [relation.id]: true });\n      sortedConnect.push(relation);\n    } else if (strictSort) {\n      // If we reach this point, it means that the adjacent relation is not in the connect array\n      // and it is not in the database.\n      throw new InvalidRelationError(\n        `There was a problem connecting relation with id ${\n          relation.id\n        } at position ${JSON.stringify(\n          relation.position\n        )}. The relation with id ${adjacentRelId} needs to be connected first.`\n      );\n    } else {\n      // We are in non-strict mode so we can push the relation.\n      sortedConnect.push({ id: relation.id, position: { end: true } });\n    }\n  };\n\n  // Iterate over connectArr and populate sortedConnect\n  connectArr.forEach((relation) => computeRelation(relation, {}));\n\n  return sortedConnect;\n};\n\n/**\n * Responsible for calculating the relations order when connecting them.\n *\n * The connect method takes an array of relations with positional attributes:\n * - before: the id of the relation to connect before\n * - after: the id of the relation to connect after\n * - end: it should be at the end\n * - start: it should be at the start\n *\n * Example:\n *  - Having a connect array like:\n *      [ { id: 4, before: 2 }, { id: 4, before: 3}, {id: 5, before: 4} ]\n * - With the initial relations:\n *      [ { id: 2, order: 4 }, { id: 3, order: 10 } ]\n * - Step by step, going through the connect array, the array of relations would be:\n *      [ { id: 4, order: 3.5 }, { id: 2, order: 4 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.5 },  { id: 4, order: 3.5 }, { id: 3, order: 10 } ]\n * - The final step would be to recalculate fractional order values.\n *      [ { id: 2, order: 4 }, { id: 5, order: 3.33 },  { id: 4, order: 3.66 }, { id: 3, order: 10 } ]\n *\n * `initArr` is not the full relation list. For an ordered connect, `updateRelations` loads only\n * the rows named as anchors by the payload plus the lowest- and highest-ordered rows, so entries\n * that are adjacent in `computedRelations` are not adjacent in the stored list. Placement must be\n * computed from the anchor's own order, never from its neighbours in this array.\n *\n * @param {Array<*>} initArr - array of relations to initialize the class with\n * @param {string} idColumn - the column name of the id\n * @param {string} orderColumn - the column name of the order\n * @param {boolean} strict - if true, will throw an error if a relation is connected adjacent to\n *                               another one that does not exist\n * @return {*}\n */\nconst relationsOrderer = <TRelation extends Record<string, ID | number | null>>(\n  initArr: TRelation[],\n  idColumn: keyof TRelation,\n  orderColumn: keyof TRelation,\n  strict?: boolean\n) => {\n  const computedRelations: OrderedLink[] = _.sortBy(\n    castArray(initArr ?? []).map((r) => ({\n      init: true,\n      id: r[idColumn] as ID,\n      order: r[orderColumn] !== null && r[orderColumn] !== undefined ? Number(r[orderColumn]) : 1,\n    })),\n    'order'\n  );\n\n  const maxOrder = maxBy('order', computedRelations)?.order || 0;\n\n  const findRelation = (id: ID) => {\n    const idx = computedRelations.findIndex((r) => r.id === id);\n    return { idx, relation: computedRelations[idx] };\n  };\n\n  const removeRelation = (r: Link) => {\n    const { idx } = findRelation(r.id);\n    if (idx >= 0) {\n      computedRelations.splice(idx, 1);\n    }\n  };\n\n  const insertRelation = (r: Link) => {\n    let idx;\n\n    if (r.position?.before) {\n      const { idx: beforeIdx, relation } = findRelation(r.position.before);\n      if (relation.init) {\n        r.order = relation.order - 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = beforeIdx;\n    } else if (r.position?.after) {\n      const { idx: afterIdx, relation } = findRelation(r.position.after);\n      if (relation.init) {\n        r.order = relation.order + 0.5;\n      } else {\n        r.order = relation.order;\n      }\n      idx = afterIdx + 1;\n    } else if (r.position?.start) {\n      if (computedRelations.length > 0) {\n        const firstRelation = computedRelations[0];\n        r.order = firstRelation.init ? firstRelation.order - 0.5 : firstRelation.order;\n      } else {\n        r.order = 0.5;\n      }\n      idx = 0;\n    } else {\n      r.order = maxOrder + 0.5;\n      idx = computedRelations.length;\n    }\n\n    // Insert the relation in the array\n    computedRelations.splice(idx, 0, r as OrderedLink);\n  };\n\n  return {\n    disconnect(relations: Link | Link[]) {\n      castArray(relations).forEach((relation) => {\n        removeRelation(relation);\n      });\n      return this;\n    },\n    connect(relations: Link | Link[]) {\n      sortConnectArray(castArray(relations), computedRelations, strict).forEach((relation) => {\n        this.disconnect(relation);\n\n        try {\n          insertRelation(relation);\n        } catch {\n          throw new Error(\n            `There was a problem connecting relation with id ${\n              relation.id\n            } at position ${JSON.stringify(\n              relation.position\n            )}. The list of connect relations is not valid`\n          );\n        }\n      });\n      return this;\n    },\n    get() {\n      return computedRelations;\n    },\n    /**\n     * Get a map between the relation id and its order\n     */\n    getOrderMap() {\n      const map: Record<ID, number> = {};\n      const chunks = _(computedRelations).groupBy('order').value();\n      const sortedKeys = Object.keys(chunks).sort((a, b) => parseFloat(a) - parseFloat(b));\n\n      for (const orderStr of sortedKeys) {\n        const relations = chunks[orderStr];\n        let offset = 1;\n        relations.forEach((relation) => {\n          if (!relation.init) {\n            map[relation.id] = parseFloat(orderStr) + (offset / (relations.length + 1)) * 0.49;\n            offset += 1;\n          }\n        });\n      }\n\n      return map;\n    },\n  };\n};\n\nexport { relationsOrderer, sortConnectArray };\n"],"names":["sortConnectArray","connectArr","initialArr","strictSort","sortedConnect","needsSorting","relationInInitialArray","reduce","acc","rel","id","mappedRelations","mapper","relation","adjacentRelId","position","before","after","existingRelation","hasNoComponent","hasSameComponent","__component","InvalidRelationError","computed","computeRelation","relationsSeenInBranch","adjacentRelation","push","JSON","stringify","end","forEach","relationsOrderer","initArr","idColumn","orderColumn","strict","computedRelations","_","sortBy","castArray","map","r","init","order","undefined","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","beforeIdx","afterIdx","start","length","firstRelation","disconnect","relations","connect","Error","get","getOrderMap","chunks","groupBy","value","sortedKeys","Object","keys","sort","a","b","parseFloat","orderStr","offset"],"mappings":";;;;AAkBA;;;;;;;;;;;;;;;;;IAkBA,MAAMA,mBAAmB,CAACC,UAAAA,EAAoBC,aAAqB,EAAE,EAAEC,aAAa,IAAI,GAAA;AACtF,IAAA,MAAMC,gBAAwB,EAAE;;AAEhC,IAAA,IAAIC,YAAAA,GAAe,KAAA;;AAEnB,IAAA,MAAMC,yBAAyBJ,UAAAA,CAAWK,MAAM,CAC9C,CAACC,GAAAA,EAAKC,OAAS;AAAE,YAAA,GAAGD,GAAG;YAAE,CAACC,GAAAA,CAAIC,EAAE,GAAG;AAAK,SAAA,GACxC,EAAC,CAAA;;AAGH,IAAA,MAAMC,eAAAA,GAAkBV,UAAAA,CAAWM,MAAM,CACvC,CAACK,MAAAA,EAAQC,QAAAA,GAAAA;AACP,QAAA,MAAMC,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QAEtE,IAAI,CAACH,aAAAA,IAAkB,CAACR,sBAAsB,CAACQ,aAAAA,CAAc,IAAI,CAACF,MAAM,CAACE,aAAAA,CAAc,EAAG;YACxFT,YAAAA,GAAe,IAAA;AACjB,QAAA;AAEA;;;;;;AAMC;AAGD,QAAA,MAAMa,gBAAAA,GAAmBN,MAAM,CAACC,QAAAA,CAASH,EAAE,CAAC;;AAG5C,QAAA,MAAMS,cAAAA,GAAiBD,gBAAAA,IAAoB,EAAE,iBAAiBA,gBAAe,CAAA;;AAG7E,QAAA,MAAME,mBACJF,gBAAAA,IAAoBA,gBAAAA,CAAiBG,WAAW,KAAKR,SAASQ,WAAW;;AAG3E,QAAA,IAAIH,gBAAAA,KAAqBC,cAAAA,IAAkBC,gBAAe,CAAA,EAAI;YAC5D,MAAM,IAAIE,oBAAAA,CACR,CAAC,qBAAqB,EAAET,SAASH,EAAE,CAAC,uBAAuB,CAAC,GAC1D,6CAAA,CAAA;AAEN,QAAA;QAEA,OAAO;YACL,CAACG,QAAAA,CAASH,EAAE,GAAG;AAAE,gBAAA,GAAGG,QAAQ;gBAAEU,QAAAA,EAAU;AAAM,aAAA;AAC9C,YAAA,GAAGX;AACL,SAAA;AACF,IAAA,CAAA,EACA,EAAC,CAAA;;IAIH,IAAI,CAACP,cAAc,OAAOJ,UAAAA;;IAG1B,MAAMuB,eAAAA,GAAkB,CAACX,QAAAA,EAAgBY,qBAAAA,GAAAA;AACvC,QAAA,MAAMX,gBAAgBD,QAAAA,CAASE,QAAQ,EAAEC,MAAAA,IAAUH,QAAAA,CAASE,QAAQ,EAAEE,KAAAA;QACtE,MAAMS,gBAAAA,GAAmBf,eAAe,CAACG,aAAAA,CAAoB;;;AAI7D,QAAA,IAAIA,aAAAA,IAAiBW,qBAAqB,CAACX,aAAAA,CAAc,EAAE;YACzD,MAAM,IAAIQ,qBACR,uDAAA,GACE,sGAAA,CAAA;AAEN,QAAA;;AAGA,QAAA,IAAIX,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,EAAEa,QAAAA,EAAU;AAC1C,YAAA;AACF,QAAA;AAEAZ,QAAAA,eAAe,CAACE,QAAAA,CAASH,EAAE,CAAC,CAACa,QAAQ,GAAG,IAAA;;AAGxC,QAAA,IAAI,CAACT,aAAAA,IAAiBR,sBAAsB,CAACQ,cAAc,EAAE;AAC3DV,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACnB,YAAA;AACF,QAAA;;QAGA,IAAIF,eAAe,CAACG,aAAAA,CAAc,EAAE;AAClCU,YAAAA,eAAAA,CAAgBE,gBAAAA,EAAkB;AAAE,gBAAA,GAAGD,qBAAqB;gBAAE,CAACZ,QAAAA,CAASH,EAAE,GAAG;AAAK,aAAA,CAAA;AAClFN,YAAAA,aAAAA,CAAcuB,IAAI,CAACd,QAAAA,CAAAA;AACrB,QAAA,CAAA,MAAO,IAAIV,UAAAA,EAAY;;;YAGrB,MAAM,IAAImB,qBACR,CAAC,gDAAgD,EAC/CT,QAAAA,CAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,uBAAuB,EAAED,aAAAA,CAAc,6BAA6B,CAAC,CAAA;QAE3E,CAAA,MAAO;;AAELV,YAAAA,aAAAA,CAAcuB,IAAI,CAAC;AAAEjB,gBAAAA,EAAAA,EAAIG,SAASH,EAAE;gBAAEK,QAAAA,EAAU;oBAAEe,GAAAA,EAAK;AAAK;AAAE,aAAA,CAAA;AAChE,QAAA;AACF,IAAA,CAAA;;AAGA7B,IAAAA,UAAAA,CAAW8B,OAAO,CAAC,CAAClB,QAAAA,GAAaW,eAAAA,CAAgBX,UAAU,EAAC,CAAA,CAAA;IAE5D,OAAOT,aAAAA;AACT;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCC,IACD,MAAM4B,gBAAAA,GAAmB,CACvBC,OAAAA,EACAC,UACAC,WAAAA,EACAC,MAAAA,GAAAA;AAEA,IAAA,MAAMC,iBAAAA,GAAmCC,CAAAA,CAAEC,MAAM,CAC/CC,SAAAA,CAAUP,OAAAA,IAAW,EAAE,CAAA,CAAEQ,GAAG,CAAC,CAACC,CAAAA,IAAO;YACnCC,IAAAA,EAAM,IAAA;YACNjC,EAAAA,EAAIgC,CAAC,CAACR,QAAAA,CAAS;AACfU,YAAAA,KAAAA,EAAOF,CAAC,CAACP,WAAAA,CAAY,KAAK,QAAQO,CAAC,CAACP,WAAAA,CAAY,KAAKU,SAAAA,GAAYC,MAAAA,CAAOJ,CAAC,CAACP,YAAY,CAAA,GAAI;AAC5F,SAAA,CAAA,CAAA,EACA,OAAA,CAAA;AAGF,IAAA,MAAMY,QAAAA,GAAWC,KAAAA,CAAM,OAAA,EAASX,iBAAAA,CAAAA,EAAoBO,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMK,eAAe,CAACvC,EAAAA,GAAAA;QACpB,MAAMwC,GAAAA,GAAMb,kBAAkBc,SAAS,CAAC,CAACT,CAAAA,GAAMA,CAAAA,CAAEhC,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEwC,YAAAA,GAAAA;YAAKrC,QAAAA,EAAUwB,iBAAiB,CAACa,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACV,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEQ,GAAG,EAAE,GAAGD,YAAAA,CAAaP,EAAEhC,EAAE,CAAA;AACjC,QAAA,IAAIwC,OAAO,CAAA,EAAG;YACZb,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACZ,CAAAA,GAAAA;QACtB,IAAIQ,GAAAA;QAEJ,IAAIR,CAAAA,CAAE3B,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAEkC,GAAAA,EAAKK,SAAS,EAAE1C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACC,MAAM,CAAA;YACnE,IAAIH,QAAAA,CAAS8B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;YACAM,GAAAA,GAAMK,SAAAA;AACR,QAAA,CAAA,MAAO,IAAIb,CAAAA,CAAE3B,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAEiC,GAAAA,EAAKM,QAAQ,EAAE3C,QAAQ,EAAE,GAAGoC,YAAAA,CAAaP,CAAAA,CAAE3B,QAAQ,CAACE,KAAK,CAAA;YACjE,IAAIJ,QAAAA,CAAS8B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG/B,QAAAA,CAAS+B,KAAK;AAC1B,YAAA;AACAM,YAAAA,GAAAA,GAAMM,QAAAA,GAAW,CAAA;AACnB,QAAA,CAAA,MAAO,IAAId,CAAAA,CAAE3B,QAAQ,EAAE0C,KAAAA,EAAO;YAC5B,IAAIpB,iBAAAA,CAAkBqB,MAAM,GAAG,CAAA,EAAG;gBAChC,MAAMC,aAAAA,GAAgBtB,iBAAiB,CAAC,CAAA,CAAE;gBAC1CK,CAAAA,CAAEE,KAAK,GAAGe,aAAAA,CAAchB,IAAI,GAAGgB,cAAcf,KAAK,GAAG,GAAA,GAAMe,aAAAA,CAAcf,KAAK;YAChF,CAAA,MAAO;AACLF,gBAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;AACZ,YAAA;YACAM,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLR,CAAAA,CAAEE,KAAK,GAAGG,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMb,kBAAkBqB,MAAM;AAChC,QAAA;;QAGArB,iBAAAA,CAAkBgB,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGR,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLkB,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjCrB,SAAAA,CAAUqB,SAAAA,CAAAA,CAAW9B,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BuC,cAAAA,CAAevC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAiD,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9B7D,YAAAA,gBAAAA,CAAiBwC,UAAUqB,SAAAA,CAAAA,EAAYxB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC+C,UAAU,CAAC/C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFyC,cAAAA,CAAezC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAM;AACN,oBAAA,MAAM,IAAIkD,KAAAA,CACR,CAAC,gDAAgD,EAC/ClD,SAASH,EAAE,CACZ,aAAa,EAAEkB,KAAKC,SAAS,CAC5BhB,SAASE,QAAQ,CAAA,CACjB,4CAA4C,CAAC,CAAA;AAEnD,gBAAA;AACF,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACAiD,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAO3B,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGA4B,WAAAA,CAAAA,GAAAA;AACE,YAAA,MAAMxB,MAA0B,EAAC;AACjC,YAAA,MAAMyB,SAAS5B,CAAAA,CAAED,iBAAAA,CAAAA,CAAmB8B,OAAO,CAAC,SAASC,KAAK,EAAA;AAC1D,YAAA,MAAMC,UAAAA,GAAaC,MAAAA,CAAOC,IAAI,CAACL,MAAAA,CAAAA,CAAQM,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMC,UAAAA,CAAWF,CAAAA,CAAAA,GAAKE,UAAAA,CAAWD,CAAAA,CAAAA,CAAAA;YAEjF,KAAK,MAAME,YAAYP,UAAAA,CAAY;gBACjC,MAAMR,SAAAA,GAAYK,MAAM,CAACU,QAAAA,CAAS;AAClC,gBAAA,IAAIC,MAAAA,GAAS,CAAA;gBACbhB,SAAAA,CAAU9B,OAAO,CAAC,CAAClB,QAAAA,GAAAA;oBACjB,IAAI,CAACA,QAAAA,CAAS8B,IAAI,EAAE;AAClBF,wBAAAA,GAAG,CAAC5B,QAAAA,CAASH,EAAE,CAAC,GAAGiE,UAAAA,CAAWC,QAAAA,CAAAA,GAAY,MAACC,IAAUhB,SAAAA,CAAUH,MAAM,GAAG,CAAA,CAAA,GAAM,IAAA;wBAC9EmB,MAAAA,IAAU,CAAA;AACZ,oBAAA;AACF,gBAAA,CAAA,CAAA;AACF,YAAA;YAEA,OAAOpC,GAAAA;AACT,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/migrations/heartbeat.d.ts

@@ -0,0 +1,19 @@
+export interface HeartbeatLoggerOptions {
+    /** Minimum time between heartbeat log lines. Defaults to 60s. */
+    intervalMs?: number;
+    /** Injectable clock for tests. */
+    now?: () => number;
+}
+export interface HeartbeatLogger {
+    /**
+     * Emit `buildMessage(elapsedSeconds)` at most once per interval.
+     * Safe to call on every batch — no-ops until the interval elapses.
+     */
+    tick(buildMessage: (elapsedSeconds: number) => string): void;
+}
+/**
+ * Append-only, time-throttled progress logger for long-running migrations.
+ * Never rewrites terminal lines — one complete Winston info line per tick.
+ */
+export declare const createHeartbeatLogger: (log: (message: string) => void, { intervalMs, now }?: HeartbeatLoggerOptions) => HeartbeatLogger;
+//# sourceMappingURL=heartbeat.d.ts.map

package/dist/migrations/heartbeat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"heartbeat.d.ts","sourceRoot":"","sources":["../../src/migrations/heartbeat.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,sBAAsB;IACrC,iEAAiE;IACjE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,kCAAkC;IAClC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,IAAI,CAAC,YAAY,EAAE,CAAC,cAAc,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;CAC9D;AAED;;;GAGG;AACH,eAAO,MAAM,qBAAqB,GAChC,KAAK,CAAC,OAAO,EAAE,MAAM,KAAK,IAAI,EAC9B,sBAAiD,sBAA2B,KAC3E,eAgBF,CAAC"}

package/dist/migrations/heartbeat.js

@@ -0,0 +1,23 @@
+'use strict';
+
+/**
+ * Append-only, time-throttled progress logger for long-running migrations.
+ * Never rewrites terminal lines — one complete Winston info line per tick.
+ */ const createHeartbeatLogger = (log, { intervalMs = 60000, now = ()=>Date.now() } = {})=>{
+    const startedAt = now();
+    let lastEmittedAt = startedAt;
+    return {
+        tick (buildMessage) {
+            const current = now();
+            if (current - lastEmittedAt < intervalMs) {
+                return;
+            }
+            const elapsedSeconds = Math.floor((current - startedAt) / 1000);
+            log(buildMessage(elapsedSeconds));
+            lastEmittedAt = current;
+        }
+    };
+};
+
+exports.createHeartbeatLogger = createHeartbeatLogger;
+//# sourceMappingURL=heartbeat.js.map

package/dist/migrations/heartbeat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"heartbeat.js","sources":["../../src/migrations/heartbeat.ts"],"sourcesContent":["export interface HeartbeatLoggerOptions {\n  /** Minimum time between heartbeat log lines. Defaults to 60s. */\n  intervalMs?: number;\n  /** Injectable clock for tests. */\n  now?: () => number;\n}\n\nexport interface HeartbeatLogger {\n  /**\n   * Emit `buildMessage(elapsedSeconds)` at most once per interval.\n   * Safe to call on every batch — no-ops until the interval elapses.\n   */\n  tick(buildMessage: (elapsedSeconds: number) => string): void;\n}\n\n/**\n * Append-only, time-throttled progress logger for long-running migrations.\n * Never rewrites terminal lines — one complete Winston info line per tick.\n */\nexport const createHeartbeatLogger = (\n  log: (message: string) => void,\n  { intervalMs = 60_000, now = () => Date.now() }: HeartbeatLoggerOptions = {}\n): HeartbeatLogger => {\n  const startedAt = now();\n  let lastEmittedAt = startedAt;\n\n  return {\n    tick(buildMessage) {\n      const current = now();\n      if (current - lastEmittedAt < intervalMs) {\n        return;\n      }\n\n      const elapsedSeconds = Math.floor((current - startedAt) / 1000);\n      log(buildMessage(elapsedSeconds));\n      lastEmittedAt = current;\n    },\n  };\n};\n"],"names":["createHeartbeatLogger","log","intervalMs","now","Date","startedAt","lastEmittedAt","tick","buildMessage","current","elapsedSeconds","Math","floor"],"mappings":";;AAeA;;;AAGC,IACM,MAAMA,qBAAAA,GAAwB,CACnCC,GAAAA,EACA,EAAEC,UAAAA,GAAa,KAAM,EAAEC,GAAAA,GAAM,IAAMC,IAAAA,CAAKD,GAAG,EAAE,EAA0B,GAAG,EAAE,GAAA;AAE5E,IAAA,MAAME,SAAAA,GAAYF,GAAAA,EAAAA;AAClB,IAAA,IAAIG,aAAAA,GAAgBD,SAAAA;IAEpB,OAAO;AACLE,QAAAA,IAAAA,CAAAA,CAAKC,YAAY,EAAA;AACf,YAAA,MAAMC,OAAAA,GAAUN,GAAAA,EAAAA;YAChB,IAAIM,OAAAA,GAAUH,gBAAgBJ,UAAAA,EAAY;AACxC,gBAAA;AACF,YAAA;YAEA,MAAMQ,cAAAA,GAAiBC,KAAKC,KAAK,CAAC,CAACH,OAAAA,GAAUJ,SAAQ,IAAK,IAAA,CAAA;AAC1DJ,YAAAA,GAAAA,CAAIO,YAAAA,CAAaE,cAAAA,CAAAA,CAAAA;YACjBJ,aAAAA,GAAgBG,OAAAA;AAClB,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/migrations/heartbeat.mjs

@@ -0,0 +1,21 @@
+/**
+ * Append-only, time-throttled progress logger for long-running migrations.
+ * Never rewrites terminal lines — one complete Winston info line per tick.
+ */ const createHeartbeatLogger = (log, { intervalMs = 60000, now = ()=>Date.now() } = {})=>{
+    const startedAt = now();
+    let lastEmittedAt = startedAt;
+    return {
+        tick (buildMessage) {
+            const current = now();
+            if (current - lastEmittedAt < intervalMs) {
+                return;
+            }
+            const elapsedSeconds = Math.floor((current - startedAt) / 1000);
+            log(buildMessage(elapsedSeconds));
+            lastEmittedAt = current;
+        }
+    };
+};
+
+export { createHeartbeatLogger };
+//# sourceMappingURL=heartbeat.mjs.map

package/dist/migrations/heartbeat.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"heartbeat.mjs","sources":["../../src/migrations/heartbeat.ts"],"sourcesContent":["export interface HeartbeatLoggerOptions {\n  /** Minimum time between heartbeat log lines. Defaults to 60s. */\n  intervalMs?: number;\n  /** Injectable clock for tests. */\n  now?: () => number;\n}\n\nexport interface HeartbeatLogger {\n  /**\n   * Emit `buildMessage(elapsedSeconds)` at most once per interval.\n   * Safe to call on every batch — no-ops until the interval elapses.\n   */\n  tick(buildMessage: (elapsedSeconds: number) => string): void;\n}\n\n/**\n * Append-only, time-throttled progress logger for long-running migrations.\n * Never rewrites terminal lines — one complete Winston info line per tick.\n */\nexport const createHeartbeatLogger = (\n  log: (message: string) => void,\n  { intervalMs = 60_000, now = () => Date.now() }: HeartbeatLoggerOptions = {}\n): HeartbeatLogger => {\n  const startedAt = now();\n  let lastEmittedAt = startedAt;\n\n  return {\n    tick(buildMessage) {\n      const current = now();\n      if (current - lastEmittedAt < intervalMs) {\n        return;\n      }\n\n      const elapsedSeconds = Math.floor((current - startedAt) / 1000);\n      log(buildMessage(elapsedSeconds));\n      lastEmittedAt = current;\n    },\n  };\n};\n"],"names":["createHeartbeatLogger","log","intervalMs","now","Date","startedAt","lastEmittedAt","tick","buildMessage","current","elapsedSeconds","Math","floor"],"mappings":"AAeA;;;AAGC,IACM,MAAMA,qBAAAA,GAAwB,CACnCC,GAAAA,EACA,EAAEC,UAAAA,GAAa,KAAM,EAAEC,GAAAA,GAAM,IAAMC,IAAAA,CAAKD,GAAG,EAAE,EAA0B,GAAG,EAAE,GAAA;AAE5E,IAAA,MAAME,SAAAA,GAAYF,GAAAA,EAAAA;AAClB,IAAA,IAAIG,aAAAA,GAAgBD,SAAAA;IAEpB,OAAO;AACLE,QAAAA,IAAAA,CAAAA,CAAKC,YAAY,EAAA;AACf,YAAA,MAAMC,OAAAA,GAAUN,GAAAA,EAAAA;YAChB,IAAIM,OAAAA,GAAUH,gBAAgBJ,UAAAA,EAAY;AACxC,gBAAA;AACF,YAAA;YAEA,MAAMQ,cAAAA,GAAiBC,KAAKC,KAAK,CAAC,CAACH,OAAAA,GAAUJ,SAAQ,IAAK,IAAA,CAAA;AAC1DJ,YAAAA,GAAAA,CAAIO,YAAAA,CAAaE,cAAAA,CAAAA,CAAAA;YACjBJ,aAAAA,GAAgBG,OAAAA;AAClB,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/migrations/internal-migrations/5.0.0-02-document-id.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"5.0.0-02-document-id.d.ts","sourceRoot":"","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAiK3C,eAAO,MAAM,iBAAiB,EAAE,SA6B/B,CAAC"}
+{"version":3,"file":"5.0.0-02-document-id.d.ts","sourceRoot":"","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAwL3C,eAAO,MAAM,iBAAiB,EAAE,SAgC/B,CAAC"}

package/dist/migrations/internal-migrations/5.0.0-02-document-id.js

@@ -2,6 +2,7 @@
 
 var cuid2 = require('@paralleldrive/cuid2');
 var _ = require('lodash/fp');
+var heartbeat = require('../heartbeat.js');
 
 function getBatchSize(trx, defaultSize = 1000) {
     const client = trx.client.config.client;
@@ -64,11 +65,12 @@ const getNextIdsToCreateDocumentId = async (db, knex, { joinColumn, inverseJoinC
     return [];
 };
 // Migrate document ids for tables that have localizations
-const migrateDocumentIdsWithLocalizations = async (db, knex, meta)=>{
+const migrateDocumentIdsWithLocalizations = async (db, knex, meta, heartbeat)=>{
     const singularName = meta.singularName.toLowerCase();
     const joinColumn = _.snakeCase(`${singularName}_id`);
     const inverseJoinColumn = _.snakeCase(`inv_${singularName}_id`);
     let ids;
+    let processed = 0;
     do {
         ids = await getNextIdsToCreateDocumentId(db, knex, {
             joinColumn,
@@ -80,13 +82,17 @@ const migrateDocumentIdsWithLocalizations = async (db, knex, meta)=>{
             await knex(meta.tableName).update({
                 document_id: cuid2.createId()
             }).whereIn('id', ids);
+            processed += ids.length;
+            const rowsProcessed = processed;
+            heartbeat.tick((elapsedSeconds)=>`[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${rowsProcessed} rows processed`);
         }
     }while (ids.length > 0)
 };
 // Migrate document ids for tables that don't have localizations
-const migrationDocumentIds = async (db, knex, meta)=>{
+const migrationDocumentIds = async (db, knex, meta, heartbeat)=>{
     const batchSize = getBatchSize(knex);
-    let recordsLeft = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0].recordsLeft;
+    const total = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0].recordsLeft;
+    let recordsLeft = total;
     while(recordsLeft > 0){
         const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;
         const updateRecords = (await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)).map((item)=>({
@@ -95,6 +101,8 @@ const migrationDocumentIds = async (db, knex, meta)=>{
             }));
         await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();
         recordsLeft -= updateRecords.length;
+        const processed = total - recordsLeft;
+        heartbeat.tick((elapsedSeconds)=>`[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${processed}/${total}`);
     }
 };
 const isDuplicateColumnError = (error)=>{
@@ -123,7 +131,9 @@ const hasLocalizationsJoinTable = async (knex, tableName)=>{
 const createdDocumentId = {
     name: '5.0.0-02-created-document-id',
     async up (knex, db) {
-        // do sth
+        const heartbeat$1 = heartbeat.createHeartbeatLogger((message)=>{
+            db.logger.info(message);
+        });
         for (const meta of db.metadata.values()){
             const hasTable = await knex.schema.hasTable(meta.tableName);
             if (!hasTable) {
@@ -135,9 +145,9 @@ const createdDocumentId = {
                     await createDocumentIdColumn(knex, meta.tableName);
                 }
                 if (await hasLocalizationsJoinTable(knex, meta.tableName)) {
-                    await migrateDocumentIdsWithLocalizations(db, knex, meta);
+                    await migrateDocumentIdsWithLocalizations(db, knex, meta, heartbeat$1);
                 } else {
-                    await migrationDocumentIds(db, knex, meta);
+                    await migrationDocumentIds(db, knex, meta, heartbeat$1);
                 }
             }
         }

package/dist/migrations/internal-migrations/5.0.0-02-document-id.js.map

@@ -1 +1 @@
-{"version":3,"file":"5.0.0-02-document-id.js","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"sourcesContent":["/**\n * NOTE: This migration avoids using the `identifiers` utility.\n * As the `5.0.0-01-convert-identifiers-long-than-max-length`\n * migration does not convert the `localizations` join tables, as they are not\n * tables that exist anymore in v5 and are not in the db metadata.\n *\n * This migration therefore relies on the fact that those tables still exist, and\n * references them directly.\n *\n * Database join table name: `categories_localizations_links`\n * Actual `identifiers` returned join table name: `categories_localizations_lnk`\n *\n */\nimport { createId } from '@paralleldrive/cuid2';\nimport { snakeCase } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport type { Migration } from '../common';\nimport type { Database } from '../..';\nimport type { Meta } from '../../metadata';\n\nfunction getBatchSize(trx: Knex, defaultSize: number = 1000): number {\n  const client = trx.client.config.client;\n  const isSQLite =\n    typeof client === 'string' && ['sqlite', 'sqlite3', 'better-sqlite3'].includes(client);\n  return isSQLite ? Math.min(defaultSize, 250) : defaultSize;\n}\n\ninterface Params {\n  joinColumn: string;\n  inverseJoinColumn: string;\n  tableName: string;\n  joinTableName: string;\n}\n\nconst QUERIES = {\n  async postgres(knex: Knex, params: Params) {\n    const res = await knex.raw(\n      `\n    SELECT :tableName:.id as id, string_agg(DISTINCT :inverseJoinColumn:::character varying, ',') as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res.rows;\n  },\n  async mysql(knex: Knex, params: Params) {\n    const [res] = await knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res;\n  },\n  async sqlite(knex: Knex, params: Params) {\n    return knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :joinTableName:.:joinColumn:\n    LIMIT 1;\n    `,\n      params\n    );\n  },\n};\n\nconst getNextIdsToCreateDocumentId = async (\n  db: Database,\n  knex: Knex,\n  {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  }: {\n    joinColumn: string;\n    inverseJoinColumn: string;\n    tableName: string;\n    joinTableName: string;\n  }\n): Promise<number[]> => {\n  const res = await QUERIES[db.dialect.client as keyof typeof QUERIES](knex, {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  });\n\n  if (res.length > 0) {\n    const row = res[0];\n    const otherIds = row.other_ids\n      ? row.other_ids.split(',').map((v: string) => parseInt(v, 10))\n      : [];\n\n    return [row.id, ...otherIds];\n  }\n\n  return [];\n};\n\n// Migrate document ids for tables that have localizations\nconst migrateDocumentIdsWithLocalizations = async (db: Database, knex: Knex, meta: Meta) => {\n  const singularName = meta.singularName.toLowerCase();\n  const joinColumn = snakeCase(`${singularName}_id`);\n  const inverseJoinColumn = snakeCase(`inv_${singularName}_id`);\n  let ids: number[];\n\n  do {\n    ids = await getNextIdsToCreateDocumentId(db, knex, {\n      joinColumn,\n      inverseJoinColumn,\n      tableName: meta.tableName,\n      joinTableName: snakeCase(`${meta.tableName}_localizations_links`),\n    });\n\n    if (ids.length > 0) {\n      await knex(meta.tableName).update({ document_id: createId() }).whereIn('id', ids);\n    }\n  } while (ids.length > 0);\n};\n\n// Migrate document ids for tables that don't have localizations\nconst migrationDocumentIds = async (db: Database, knex: Knex, meta: Meta) => {\n  const batchSize = getBatchSize(knex);\n  let recordsLeft = +(\n    await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id')\n  )[0].recordsLeft;\n  while (recordsLeft > 0) {\n    const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;\n    const updateRecords = (\n      await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)\n    ).map((item) => ({ id: item.id, document_id: createId() }));\n    await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();\n    recordsLeft -= updateRecords.length;\n  }\n};\n\nconst isDuplicateColumnError = (error: unknown): boolean => {\n  if (!error || typeof error !== 'object') return false;\n  const e = error as { code?: string; errno?: number; message?: string };\n  if (e.code === '42701') return true;\n  if (e.errno === 1060) return true;\n  if (typeof e.message === 'string' && /duplicate column/i.test(e.message)) return true;\n  return false;\n};\n\nconst createDocumentIdColumn = async (knex: Knex, tableName: string) => {\n  try {\n    await knex.schema.alterTable(tableName, (table) => {\n      table.string('document_id');\n    });\n  } catch (error) {\n    if (!isDuplicateColumnError(error)) {\n      throw error;\n    }\n  }\n};\n\nconst hasLocalizationsJoinTable = async (knex: Knex, tableName: string) => {\n  const joinTableName = snakeCase(`${tableName}_localizations_links`);\n  return knex.schema.hasTable(joinTableName);\n};\n\nexport const createdDocumentId: Migration = {\n  name: '5.0.0-02-created-document-id',\n  async up(knex, db) {\n    // do sth\n    for (const meta of db.metadata.values()) {\n      const hasTable = await knex.schema.hasTable(meta.tableName);\n\n      if (!hasTable) {\n        continue;\n      }\n\n      if ('documentId' in meta.attributes) {\n        const hasDocumentIdColumn = await knex.schema.hasColumn(meta.tableName, 'document_id');\n\n        if (!hasDocumentIdColumn) {\n          await createDocumentIdColumn(knex, meta.tableName);\n        }\n\n        if (await hasLocalizationsJoinTable(knex, meta.tableName)) {\n          await migrateDocumentIdsWithLocalizations(db, knex, meta);\n        } else {\n          await migrationDocumentIds(db, knex, meta);\n        }\n      }\n    }\n  },\n  async down() {\n    throw new Error('not implemented');\n  },\n};\n"],"names":["getBatchSize","trx","defaultSize","client","config","isSQLite","includes","Math","min","QUERIES","postgres","knex","params","res","raw","rows","mysql","sqlite","getNextIdsToCreateDocumentId","db","joinColumn","inverseJoinColumn","tableName","joinTableName","dialect","length","row","otherIds","other_ids","split","map","v","parseInt","id","migrateDocumentIdsWithLocalizations","meta","singularName","toLowerCase","snakeCase","ids","update","document_id","createId","whereIn","migrationDocumentIds","batchSize","recordsLeft","count","whereNull","currentBatchSize","updateRecords","select","limit","item","insert","onConflict","merge","isDuplicateColumnError","error","e","code","errno","message","test","createDocumentIdColumn","schema","alterTable","table","string","hasLocalizationsJoinTable","hasTable","createdDocumentId","name","up","metadata","values","attributes","hasDocumentIdColumn","hasColumn","down","Error"],"mappings":";;;;;AAqBA,SAASA,YAAAA,CAAaC,GAAS,EAAEC,WAAAA,GAAsB,IAAI,EAAA;AACzD,IAAA,MAAMC,SAASF,GAAAA,CAAIE,MAAM,CAACC,MAAM,CAACD,MAAM;IACvC,MAAME,QAAAA,GACJ,OAAOF,MAAAA,KAAW,QAAA,IAAY;AAAC,QAAA,QAAA;AAAU,QAAA,SAAA;AAAW,QAAA;AAAiB,KAAA,CAACG,QAAQ,CAACH,MAAAA,CAAAA;AACjF,IAAA,OAAOE,QAAAA,GAAWE,IAAAA,CAAKC,GAAG,CAACN,aAAa,GAAA,CAAA,GAAOA,WAAAA;AACjD;AASA,MAAMO,OAAAA,GAAU;IACd,MAAMC,QAAAA,CAAAA,CAASC,IAAU,EAAEC,MAAc,EAAA;AACvC,QAAA,MAAMC,GAAAA,GAAM,MAAMF,IAAAA,CAAKG,GAAG,CACxB;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;AAGF,QAAA,OAAOC,IAAIE,IAAI;AACjB,IAAA,CAAA;IACA,MAAMC,KAAAA,CAAAA,CAAML,IAAU,EAAEC,MAAc,EAAA;AACpC,QAAA,MAAM,CAACC,GAAAA,CAAI,GAAG,MAAMF,IAAAA,CAAKG,GAAG,CAC1B;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;QAGF,OAAOC,GAAAA;AACT,IAAA,CAAA;IACA,MAAMI,MAAAA,CAAAA,CAAON,IAAU,EAAEC,MAAc,EAAA;QACrC,OAAOD,IAAAA,CAAKG,GAAG,CACb;;;;;;;AAOF,IAAA,CAAC,EACCF,MAAAA,CAAAA;AAEJ,IAAA;AACF,CAAA;AAEA,MAAMM,4BAAAA,GAA+B,OACnCC,EAAAA,EACAR,IAAAA,EACA,EACES,UAAU,EACVC,iBAAiB,EACjBC,SAAS,EACTC,aAAa,EAMd,GAAA;IAED,MAAMV,GAAAA,GAAM,MAAMJ,OAAO,CAACU,EAAAA,CAAGK,OAAO,CAACrB,MAAM,CAAyB,CAACQ,IAAAA,EAAM;AACzES,QAAAA,UAAAA;AACAC,QAAAA,iBAAAA;AACAC,QAAAA,SAAAA;AACAC,QAAAA;AACF,KAAA,CAAA;IAEA,IAAIV,GAAAA,CAAIY,MAAM,GAAG,CAAA,EAAG;QAClB,MAAMC,GAAAA,GAAMb,GAAG,CAAC,CAAA,CAAE;AAClB,QAAA,MAAMc,WAAWD,GAAAA,CAAIE,SAAS,GAC1BF,GAAAA,CAAIE,SAAS,CAACC,KAAK,CAAC,GAAA,CAAA,CAAKC,GAAG,CAAC,CAACC,IAAcC,QAAAA,CAASD,CAAAA,EAAG,OACxD,EAAE;QAEN,OAAO;AAACL,YAAAA,GAAAA,CAAIO,EAAE;AAAKN,YAAAA,GAAAA;AAAS,SAAA;AAC9B,IAAA;AAEA,IAAA,OAAO,EAAE;AACX,CAAA;AAEA;AACA,MAAMO,mCAAAA,GAAsC,OAAOf,EAAAA,EAAcR,IAAAA,EAAYwB,IAAAA,GAAAA;AAC3E,IAAA,MAAMC,YAAAA,GAAeD,IAAAA,CAAKC,YAAY,CAACC,WAAW,EAAA;AAClD,IAAA,MAAMjB,UAAAA,GAAakB,WAAAA,CAAU,CAAA,EAAGF,YAAAA,CAAa,GAAG,CAAC,CAAA;AACjD,IAAA,MAAMf,oBAAoBiB,WAAAA,CAAU,CAAC,IAAI,EAAEF,YAAAA,CAAa,GAAG,CAAC,CAAA;IAC5D,IAAIG,GAAAA;IAEJ,GAAG;QACDA,GAAAA,GAAM,MAAMrB,4BAAAA,CAA6BC,EAAAA,EAAIR,IAAAA,EAAM;AACjDS,YAAAA,UAAAA;AACAC,YAAAA,iBAAAA;AACAC,YAAAA,SAAAA,EAAWa,KAAKb,SAAS;AACzBC,YAAAA,aAAAA,EAAee,YAAU,CAAA,EAAGH,IAAAA,CAAKb,SAAS,CAAC,oBAAoB,CAAC;AAClE,SAAA,CAAA;QAEA,IAAIiB,GAAAA,CAAId,MAAM,GAAG,CAAA,EAAG;AAClB,YAAA,MAAMd,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEkB,MAAM,CAAC;gBAAEC,WAAAA,EAAaC,cAAAA;aAAW,CAAA,CAAGC,OAAO,CAAC,IAAA,EAAMJ,GAAAA,CAAAA;AAC/E,QAAA;IACF,CAAA,OAASA,GAAAA,CAAId,MAAM,GAAG,CAAA;AACxB,CAAA;AAEA;AACA,MAAMmB,oBAAAA,GAAuB,OAAOzB,EAAAA,EAAcR,IAAAA,EAAYwB,IAAAA,GAAAA;AAC5D,IAAA,MAAMU,YAAY7C,YAAAA,CAAaW,IAAAA,CAAAA;AAC/B,IAAA,IAAImC,cAAc,CAChB,CAAA,MAAMnC,IAAAA,CAAKwB,KAAKb,SAAS,CAAA,CAAEyB,KAAK,CAAC,kBAAA,CAAA,CAAoBC,SAAS,CAAC,aAAA,CAAa,EAC5E,CAAA,CAAE,CAACF,WAAW;AAChB,IAAA,MAAOA,cAAc,CAAA,CAAG;QACtB,MAAMG,gBAAAA,GAAmBH,WAAAA,GAAcD,SAAAA,GAAYC,WAAAA,GAAcD,SAAAA;QACjE,MAAMK,aAAAA,GAAgB,CACpB,MAAMvC,KAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAE6B,MAAM,CAAC,IAAA,CAAA,CAAMH,SAAS,CAAC,aAAA,CAAA,CAAeI,KAAK,CAACH,gBAAAA,CAAgB,EACvFnB,GAAG,CAAC,CAACuB,IAAAA,IAAU;AAAEpB,gBAAAA,EAAAA,EAAIoB,KAAKpB,EAAE;gBAAEQ,WAAAA,EAAaC,cAAAA;aAAW,CAAA,CAAA;QACxD,MAAM/B,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEgC,MAAM,CAACJ,aAAAA,CAAAA,CAAeK,UAAU,CAAC,IAAA,CAAA,CAAMC,KAAK,EAAA;AACvEV,QAAAA,WAAAA,IAAeI,cAAczB,MAAM;AACrC,IAAA;AACF,CAAA;AAEA,MAAMgC,yBAAyB,CAACC,KAAAA,GAAAA;AAC9B,IAAA,IAAI,CAACA,KAAAA,IAAS,OAAOA,KAAAA,KAAU,UAAU,OAAO,KAAA;AAChD,IAAA,MAAMC,CAAAA,GAAID,KAAAA;AACV,IAAA,IAAIC,CAAAA,CAAEC,IAAI,KAAK,OAAA,EAAS,OAAO,IAAA;AAC/B,IAAA,IAAID,CAAAA,CAAEE,KAAK,KAAK,IAAA,EAAM,OAAO,IAAA;IAC7B,IAAI,OAAOF,CAAAA,CAAEG,OAAO,KAAK,QAAA,IAAY,mBAAA,CAAoBC,IAAI,CAACJ,CAAAA,CAAEG,OAAO,CAAA,EAAG,OAAO,IAAA;IACjF,OAAO,KAAA;AACT,CAAA;AAEA,MAAME,sBAAAA,GAAyB,OAAOrD,IAAAA,EAAYW,SAAAA,GAAAA;IAChD,IAAI;AACF,QAAA,MAAMX,KAAKsD,MAAM,CAACC,UAAU,CAAC5C,WAAW,CAAC6C,KAAAA,GAAAA;AACvCA,YAAAA,KAAAA,CAAMC,MAAM,CAAC,aAAA,CAAA;AACf,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAE,OAAOV,KAAAA,EAAO;QACd,IAAI,CAACD,uBAAuBC,KAAAA,CAAAA,EAAQ;YAClC,MAAMA,KAAAA;AACR,QAAA;AACF,IAAA;AACF,CAAA;AAEA,MAAMW,yBAAAA,GAA4B,OAAO1D,IAAAA,EAAYW,SAAAA,GAAAA;AACnD,IAAA,MAAMC,aAAAA,GAAgBe,WAAAA,CAAU,CAAA,EAAGhB,SAAAA,CAAU,oBAAoB,CAAC,CAAA;AAClE,IAAA,OAAOX,IAAAA,CAAKsD,MAAM,CAACK,QAAQ,CAAC/C,aAAAA,CAAAA;AAC9B,CAAA;MAEagD,iBAAAA,GAA+B;IAC1CC,IAAAA,EAAM,8BAAA;IACN,MAAMC,EAAAA,CAAAA,CAAG9D,IAAI,EAAEQ,EAAE,EAAA;;AAEf,QAAA,KAAK,MAAMgB,IAAAA,IAAQhB,EAAAA,CAAGuD,QAAQ,CAACC,MAAM,EAAA,CAAI;YACvC,MAAML,QAAAA,GAAW,MAAM3D,IAAAA,CAAKsD,MAAM,CAACK,QAAQ,CAACnC,KAAKb,SAAS,CAAA;AAE1D,YAAA,IAAI,CAACgD,QAAAA,EAAU;AACb,gBAAA;AACF,YAAA;YAEA,IAAI,YAAA,IAAgBnC,IAAAA,CAAKyC,UAAU,EAAE;gBACnC,MAAMC,mBAAAA,GAAsB,MAAMlE,IAAAA,CAAKsD,MAAM,CAACa,SAAS,CAAC3C,IAAAA,CAAKb,SAAS,EAAE,aAAA,CAAA;AAExE,gBAAA,IAAI,CAACuD,mBAAAA,EAAqB;oBACxB,MAAMb,sBAAAA,CAAuBrD,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA;AACnD,gBAAA;AAEA,gBAAA,IAAI,MAAM+C,yBAAAA,CAA0B1D,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA,EAAG;oBACzD,MAAMY,mCAAAA,CAAoCf,IAAIR,IAAAA,EAAMwB,IAAAA,CAAAA;gBACtD,CAAA,MAAO;oBACL,MAAMS,oBAAAA,CAAqBzB,IAAIR,IAAAA,EAAMwB,IAAAA,CAAAA;AACvC,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA,CAAA;IACA,MAAM4C,IAAAA,CAAAA,GAAAA;AACJ,QAAA,MAAM,IAAIC,KAAAA,CAAM,iBAAA,CAAA;AAClB,IAAA;AACF;;;;"}
+{"version":3,"file":"5.0.0-02-document-id.js","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"sourcesContent":["/**\n * NOTE: This migration avoids using the `identifiers` utility.\n * As the `5.0.0-01-convert-identifiers-long-than-max-length`\n * migration does not convert the `localizations` join tables, as they are not\n * tables that exist anymore in v5 and are not in the db metadata.\n *\n * This migration therefore relies on the fact that those tables still exist, and\n * references them directly.\n *\n * Database join table name: `categories_localizations_links`\n * Actual `identifiers` returned join table name: `categories_localizations_lnk`\n *\n */\nimport { createId } from '@paralleldrive/cuid2';\nimport { snakeCase } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport type { Migration } from '../common';\nimport { createHeartbeatLogger, type HeartbeatLogger } from '../heartbeat';\nimport type { Database } from '../..';\nimport type { Meta } from '../../metadata';\n\nfunction getBatchSize(trx: Knex, defaultSize: number = 1000): number {\n  const client = trx.client.config.client;\n  const isSQLite =\n    typeof client === 'string' && ['sqlite', 'sqlite3', 'better-sqlite3'].includes(client);\n  return isSQLite ? Math.min(defaultSize, 250) : defaultSize;\n}\n\ninterface Params {\n  joinColumn: string;\n  inverseJoinColumn: string;\n  tableName: string;\n  joinTableName: string;\n}\n\nconst QUERIES = {\n  async postgres(knex: Knex, params: Params) {\n    const res = await knex.raw(\n      `\n    SELECT :tableName:.id as id, string_agg(DISTINCT :inverseJoinColumn:::character varying, ',') as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res.rows;\n  },\n  async mysql(knex: Knex, params: Params) {\n    const [res] = await knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res;\n  },\n  async sqlite(knex: Knex, params: Params) {\n    return knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :joinTableName:.:joinColumn:\n    LIMIT 1;\n    `,\n      params\n    );\n  },\n};\n\nconst getNextIdsToCreateDocumentId = async (\n  db: Database,\n  knex: Knex,\n  {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  }: {\n    joinColumn: string;\n    inverseJoinColumn: string;\n    tableName: string;\n    joinTableName: string;\n  }\n): Promise<number[]> => {\n  const res = await QUERIES[db.dialect.client as keyof typeof QUERIES](knex, {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  });\n\n  if (res.length > 0) {\n    const row = res[0];\n    const otherIds = row.other_ids\n      ? row.other_ids.split(',').map((v: string) => parseInt(v, 10))\n      : [];\n\n    return [row.id, ...otherIds];\n  }\n\n  return [];\n};\n\n// Migrate document ids for tables that have localizations\nconst migrateDocumentIdsWithLocalizations = async (\n  db: Database,\n  knex: Knex,\n  meta: Meta,\n  heartbeat: HeartbeatLogger\n) => {\n  const singularName = meta.singularName.toLowerCase();\n  const joinColumn = snakeCase(`${singularName}_id`);\n  const inverseJoinColumn = snakeCase(`inv_${singularName}_id`);\n  let ids: number[];\n  let processed = 0;\n\n  do {\n    ids = await getNextIdsToCreateDocumentId(db, knex, {\n      joinColumn,\n      inverseJoinColumn,\n      tableName: meta.tableName,\n      joinTableName: snakeCase(`${meta.tableName}_localizations_links`),\n    });\n\n    if (ids.length > 0) {\n      await knex(meta.tableName).update({ document_id: createId() }).whereIn('id', ids);\n      processed += ids.length;\n      const rowsProcessed = processed;\n      heartbeat.tick(\n        (elapsedSeconds) =>\n          `[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${rowsProcessed} rows processed`\n      );\n    }\n  } while (ids.length > 0);\n};\n\n// Migrate document ids for tables that don't have localizations\nconst migrationDocumentIds = async (\n  db: Database,\n  knex: Knex,\n  meta: Meta,\n  heartbeat: HeartbeatLogger\n) => {\n  const batchSize = getBatchSize(knex);\n  const total = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0]\n    .recordsLeft;\n  let recordsLeft = total;\n  while (recordsLeft > 0) {\n    const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;\n    const updateRecords = (\n      await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)\n    ).map((item) => ({ id: item.id, document_id: createId() }));\n    await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();\n    recordsLeft -= updateRecords.length;\n    const processed = total - recordsLeft;\n    heartbeat.tick(\n      (elapsedSeconds) =>\n        `[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${processed}/${total}`\n    );\n  }\n};\n\nconst isDuplicateColumnError = (error: unknown): boolean => {\n  if (!error || typeof error !== 'object') return false;\n  const e = error as { code?: string; errno?: number; message?: string };\n  if (e.code === '42701') return true;\n  if (e.errno === 1060) return true;\n  if (typeof e.message === 'string' && /duplicate column/i.test(e.message)) return true;\n  return false;\n};\n\nconst createDocumentIdColumn = async (knex: Knex, tableName: string) => {\n  try {\n    await knex.schema.alterTable(tableName, (table) => {\n      table.string('document_id');\n    });\n  } catch (error) {\n    if (!isDuplicateColumnError(error)) {\n      throw error;\n    }\n  }\n};\n\nconst hasLocalizationsJoinTable = async (knex: Knex, tableName: string) => {\n  const joinTableName = snakeCase(`${tableName}_localizations_links`);\n  return knex.schema.hasTable(joinTableName);\n};\n\nexport const createdDocumentId: Migration = {\n  name: '5.0.0-02-created-document-id',\n  async up(knex, db) {\n    const heartbeat = createHeartbeatLogger((message) => {\n      db.logger.info(message);\n    });\n\n    for (const meta of db.metadata.values()) {\n      const hasTable = await knex.schema.hasTable(meta.tableName);\n\n      if (!hasTable) {\n        continue;\n      }\n\n      if ('documentId' in meta.attributes) {\n        const hasDocumentIdColumn = await knex.schema.hasColumn(meta.tableName, 'document_id');\n\n        if (!hasDocumentIdColumn) {\n          await createDocumentIdColumn(knex, meta.tableName);\n        }\n\n        if (await hasLocalizationsJoinTable(knex, meta.tableName)) {\n          await migrateDocumentIdsWithLocalizations(db, knex, meta, heartbeat);\n        } else {\n          await migrationDocumentIds(db, knex, meta, heartbeat);\n        }\n      }\n    }\n  },\n  async down() {\n    throw new Error('not implemented');\n  },\n};\n"],"names":["getBatchSize","trx","defaultSize","client","config","isSQLite","includes","Math","min","QUERIES","postgres","knex","params","res","raw","rows","mysql","sqlite","getNextIdsToCreateDocumentId","db","joinColumn","inverseJoinColumn","tableName","joinTableName","dialect","length","row","otherIds","other_ids","split","map","v","parseInt","id","migrateDocumentIdsWithLocalizations","meta","heartbeat","singularName","toLowerCase","snakeCase","ids","processed","update","document_id","createId","whereIn","rowsProcessed","tick","elapsedSeconds","migrationDocumentIds","batchSize","total","count","whereNull","recordsLeft","currentBatchSize","updateRecords","select","limit","item","insert","onConflict","merge","isDuplicateColumnError","error","e","code","errno","message","test","createDocumentIdColumn","schema","alterTable","table","string","hasLocalizationsJoinTable","hasTable","createdDocumentId","name","up","createHeartbeatLogger","logger","info","metadata","values","attributes","hasDocumentIdColumn","hasColumn","down","Error"],"mappings":";;;;;;AAsBA,SAASA,YAAAA,CAAaC,GAAS,EAAEC,WAAAA,GAAsB,IAAI,EAAA;AACzD,IAAA,MAAMC,SAASF,GAAAA,CAAIE,MAAM,CAACC,MAAM,CAACD,MAAM;IACvC,MAAME,QAAAA,GACJ,OAAOF,MAAAA,KAAW,QAAA,IAAY;AAAC,QAAA,QAAA;AAAU,QAAA,SAAA;AAAW,QAAA;AAAiB,KAAA,CAACG,QAAQ,CAACH,MAAAA,CAAAA;AACjF,IAAA,OAAOE,QAAAA,GAAWE,IAAAA,CAAKC,GAAG,CAACN,aAAa,GAAA,CAAA,GAAOA,WAAAA;AACjD;AASA,MAAMO,OAAAA,GAAU;IACd,MAAMC,QAAAA,CAAAA,CAASC,IAAU,EAAEC,MAAc,EAAA;AACvC,QAAA,MAAMC,GAAAA,GAAM,MAAMF,IAAAA,CAAKG,GAAG,CACxB;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;AAGF,QAAA,OAAOC,IAAIE,IAAI;AACjB,IAAA,CAAA;IACA,MAAMC,KAAAA,CAAAA,CAAML,IAAU,EAAEC,MAAc,EAAA;AACpC,QAAA,MAAM,CAACC,GAAAA,CAAI,GAAG,MAAMF,IAAAA,CAAKG,GAAG,CAC1B;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;QAGF,OAAOC,GAAAA;AACT,IAAA,CAAA;IACA,MAAMI,MAAAA,CAAAA,CAAON,IAAU,EAAEC,MAAc,EAAA;QACrC,OAAOD,IAAAA,CAAKG,GAAG,CACb;;;;;;;AAOF,IAAA,CAAC,EACCF,MAAAA,CAAAA;AAEJ,IAAA;AACF,CAAA;AAEA,MAAMM,4BAAAA,GAA+B,OACnCC,EAAAA,EACAR,IAAAA,EACA,EACES,UAAU,EACVC,iBAAiB,EACjBC,SAAS,EACTC,aAAa,EAMd,GAAA;IAED,MAAMV,GAAAA,GAAM,MAAMJ,OAAO,CAACU,EAAAA,CAAGK,OAAO,CAACrB,MAAM,CAAyB,CAACQ,IAAAA,EAAM;AACzES,QAAAA,UAAAA;AACAC,QAAAA,iBAAAA;AACAC,QAAAA,SAAAA;AACAC,QAAAA;AACF,KAAA,CAAA;IAEA,IAAIV,GAAAA,CAAIY,MAAM,GAAG,CAAA,EAAG;QAClB,MAAMC,GAAAA,GAAMb,GAAG,CAAC,CAAA,CAAE;AAClB,QAAA,MAAMc,WAAWD,GAAAA,CAAIE,SAAS,GAC1BF,GAAAA,CAAIE,SAAS,CAACC,KAAK,CAAC,GAAA,CAAA,CAAKC,GAAG,CAAC,CAACC,IAAcC,QAAAA,CAASD,CAAAA,EAAG,OACxD,EAAE;QAEN,OAAO;AAACL,YAAAA,GAAAA,CAAIO,EAAE;AAAKN,YAAAA,GAAAA;AAAS,SAAA;AAC9B,IAAA;AAEA,IAAA,OAAO,EAAE;AACX,CAAA;AAEA;AACA,MAAMO,mCAAAA,GAAsC,OAC1Cf,EAAAA,EACAR,IAAAA,EACAwB,IAAAA,EACAC,SAAAA,GAAAA;AAEA,IAAA,MAAMC,YAAAA,GAAeF,IAAAA,CAAKE,YAAY,CAACC,WAAW,EAAA;AAClD,IAAA,MAAMlB,UAAAA,GAAamB,WAAAA,CAAU,CAAA,EAAGF,YAAAA,CAAa,GAAG,CAAC,CAAA;AACjD,IAAA,MAAMhB,oBAAoBkB,WAAAA,CAAU,CAAC,IAAI,EAAEF,YAAAA,CAAa,GAAG,CAAC,CAAA;IAC5D,IAAIG,GAAAA;AACJ,IAAA,IAAIC,SAAAA,GAAY,CAAA;IAEhB,GAAG;QACDD,GAAAA,GAAM,MAAMtB,4BAAAA,CAA6BC,EAAAA,EAAIR,IAAAA,EAAM;AACjDS,YAAAA,UAAAA;AACAC,YAAAA,iBAAAA;AACAC,YAAAA,SAAAA,EAAWa,KAAKb,SAAS;AACzBC,YAAAA,aAAAA,EAAegB,YAAU,CAAA,EAAGJ,IAAAA,CAAKb,SAAS,CAAC,oBAAoB,CAAC;AAClE,SAAA,CAAA;QAEA,IAAIkB,GAAAA,CAAIf,MAAM,GAAG,CAAA,EAAG;AAClB,YAAA,MAAMd,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEoB,MAAM,CAAC;gBAAEC,WAAAA,EAAaC,cAAAA;aAAW,CAAA,CAAGC,OAAO,CAAC,IAAA,EAAML,GAAAA,CAAAA;AAC7EC,YAAAA,SAAAA,IAAaD,IAAIf,MAAM;AACvB,YAAA,MAAMqB,aAAAA,GAAgBL,SAAAA;AACtBL,YAAAA,SAAAA,CAAUW,IAAI,CACZ,CAACC,cAAAA,GACC,CAAC,6BAA6B,EAAEA,cAAAA,CAAe,KAAK,EAAEb,KAAKb,SAAS,CAAC,CAAC,EAAEwB,aAAAA,CAAc,eAAe,CAAC,CAAA;AAE5G,QAAA;IACF,CAAA,OAASN,GAAAA,CAAIf,MAAM,GAAG,CAAA;AACxB,CAAA;AAEA;AACA,MAAMwB,oBAAAA,GAAuB,OAC3B9B,EAAAA,EACAR,IAAAA,EACAwB,IAAAA,EACAC,SAAAA,GAAAA;AAEA,IAAA,MAAMc,YAAYlD,YAAAA,CAAaW,IAAAA,CAAAA;AAC/B,IAAA,MAAMwC,QAAQ,CAAE,CAAA,MAAMxC,IAAAA,CAAKwB,KAAKb,SAAS,CAAA,CAAE8B,KAAK,CAAC,kBAAA,CAAA,CAAoBC,SAAS,CAAC,aAAA,CAAa,EAAG,CAAA,CAAE,CAC9FC,WAAW;AACd,IAAA,IAAIA,WAAAA,GAAcH,KAAAA;AAClB,IAAA,MAAOG,cAAc,CAAA,CAAG;QACtB,MAAMC,gBAAAA,GAAmBD,WAAAA,GAAcJ,SAAAA,GAAYI,WAAAA,GAAcJ,SAAAA;QACjE,MAAMM,aAAAA,GAAgB,CACpB,MAAM7C,KAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEmC,MAAM,CAAC,IAAA,CAAA,CAAMJ,SAAS,CAAC,aAAA,CAAA,CAAeK,KAAK,CAACH,gBAAAA,CAAgB,EACvFzB,GAAG,CAAC,CAAC6B,IAAAA,IAAU;AAAE1B,gBAAAA,EAAAA,EAAI0B,KAAK1B,EAAE;gBAAEU,WAAAA,EAAaC,cAAAA;aAAW,CAAA,CAAA;QACxD,MAAMjC,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEsC,MAAM,CAACJ,aAAAA,CAAAA,CAAeK,UAAU,CAAC,IAAA,CAAA,CAAMC,KAAK,EAAA;AACvER,QAAAA,WAAAA,IAAeE,cAAc/B,MAAM;AACnC,QAAA,MAAMgB,YAAYU,KAAAA,GAAQG,WAAAA;AAC1BlB,QAAAA,SAAAA,CAAUW,IAAI,CACZ,CAACC,iBACC,CAAC,6BAA6B,EAAEA,cAAAA,CAAe,KAAK,EAAEb,IAAAA,CAAKb,SAAS,CAAC,CAAC,EAAEmB,SAAAA,CAAU,CAAC,EAAEU,KAAAA,CAAAA,CAAO,CAAA;AAElG,IAAA;AACF,CAAA;AAEA,MAAMY,yBAAyB,CAACC,KAAAA,GAAAA;AAC9B,IAAA,IAAI,CAACA,KAAAA,IAAS,OAAOA,KAAAA,KAAU,UAAU,OAAO,KAAA;AAChD,IAAA,MAAMC,CAAAA,GAAID,KAAAA;AACV,IAAA,IAAIC,CAAAA,CAAEC,IAAI,KAAK,OAAA,EAAS,OAAO,IAAA;AAC/B,IAAA,IAAID,CAAAA,CAAEE,KAAK,KAAK,IAAA,EAAM,OAAO,IAAA;IAC7B,IAAI,OAAOF,CAAAA,CAAEG,OAAO,KAAK,QAAA,IAAY,mBAAA,CAAoBC,IAAI,CAACJ,CAAAA,CAAEG,OAAO,CAAA,EAAG,OAAO,IAAA;IACjF,OAAO,KAAA;AACT,CAAA;AAEA,MAAME,sBAAAA,GAAyB,OAAO3D,IAAAA,EAAYW,SAAAA,GAAAA;IAChD,IAAI;AACF,QAAA,MAAMX,KAAK4D,MAAM,CAACC,UAAU,CAAClD,WAAW,CAACmD,KAAAA,GAAAA;AACvCA,YAAAA,KAAAA,CAAMC,MAAM,CAAC,aAAA,CAAA;AACf,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAE,OAAOV,KAAAA,EAAO;QACd,IAAI,CAACD,uBAAuBC,KAAAA,CAAAA,EAAQ;YAClC,MAAMA,KAAAA;AACR,QAAA;AACF,IAAA;AACF,CAAA;AAEA,MAAMW,yBAAAA,GAA4B,OAAOhE,IAAAA,EAAYW,SAAAA,GAAAA;AACnD,IAAA,MAAMC,aAAAA,GAAgBgB,WAAAA,CAAU,CAAA,EAAGjB,SAAAA,CAAU,oBAAoB,CAAC,CAAA;AAClE,IAAA,OAAOX,IAAAA,CAAK4D,MAAM,CAACK,QAAQ,CAACrD,aAAAA,CAAAA;AAC9B,CAAA;MAEasD,iBAAAA,GAA+B;IAC1CC,IAAAA,EAAM,8BAAA;IACN,MAAMC,EAAAA,CAAAA,CAAGpE,IAAI,EAAEQ,EAAE,EAAA;QACf,MAAMiB,WAAAA,GAAY4C,gCAAsB,CAACZ,OAAAA,GAAAA;YACvCjD,EAAAA,CAAG8D,MAAM,CAACC,IAAI,CAACd,OAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AAEA,QAAA,KAAK,MAAMjC,IAAAA,IAAQhB,EAAAA,CAAGgE,QAAQ,CAACC,MAAM,EAAA,CAAI;YACvC,MAAMR,QAAAA,GAAW,MAAMjE,IAAAA,CAAK4D,MAAM,CAACK,QAAQ,CAACzC,KAAKb,SAAS,CAAA;AAE1D,YAAA,IAAI,CAACsD,QAAAA,EAAU;AACb,gBAAA;AACF,YAAA;YAEA,IAAI,YAAA,IAAgBzC,IAAAA,CAAKkD,UAAU,EAAE;gBACnC,MAAMC,mBAAAA,GAAsB,MAAM3E,IAAAA,CAAK4D,MAAM,CAACgB,SAAS,CAACpD,IAAAA,CAAKb,SAAS,EAAE,aAAA,CAAA;AAExE,gBAAA,IAAI,CAACgE,mBAAAA,EAAqB;oBACxB,MAAMhB,sBAAAA,CAAuB3D,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA;AACnD,gBAAA;AAEA,gBAAA,IAAI,MAAMqD,yBAAAA,CAA0BhE,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA,EAAG;oBACzD,MAAMY,mCAAAA,CAAoCf,EAAAA,EAAIR,IAAAA,EAAMwB,IAAAA,EAAMC,WAAAA,CAAAA;gBAC5D,CAAA,MAAO;oBACL,MAAMa,oBAAAA,CAAqB9B,EAAAA,EAAIR,IAAAA,EAAMwB,IAAAA,EAAMC,WAAAA,CAAAA;AAC7C,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA,CAAA;IACA,MAAMoD,IAAAA,CAAAA,GAAAA;AACJ,QAAA,MAAM,IAAIC,KAAAA,CAAM,iBAAA,CAAA;AAClB,IAAA;AACF;;;;"}

package/dist/migrations/internal-migrations/5.0.0-02-document-id.mjs

@@ -1,5 +1,6 @@
 import { createId } from '@paralleldrive/cuid2';
 import { snakeCase } from 'lodash/fp';
+import { createHeartbeatLogger } from '../heartbeat.mjs';
 
 function getBatchSize(trx, defaultSize = 1000) {
     const client = trx.client.config.client;
@@ -62,11 +63,12 @@ const getNextIdsToCreateDocumentId = async (db, knex, { joinColumn, inverseJoinC
     return [];
 };
 // Migrate document ids for tables that have localizations
-const migrateDocumentIdsWithLocalizations = async (db, knex, meta)=>{
+const migrateDocumentIdsWithLocalizations = async (db, knex, meta, heartbeat)=>{
     const singularName = meta.singularName.toLowerCase();
     const joinColumn = snakeCase(`${singularName}_id`);
     const inverseJoinColumn = snakeCase(`inv_${singularName}_id`);
     let ids;
+    let processed = 0;
     do {
         ids = await getNextIdsToCreateDocumentId(db, knex, {
             joinColumn,
@@ -78,13 +80,17 @@ const migrateDocumentIdsWithLocalizations = async (db, knex, meta)=>{
             await knex(meta.tableName).update({
                 document_id: createId()
             }).whereIn('id', ids);
+            processed += ids.length;
+            const rowsProcessed = processed;
+            heartbeat.tick((elapsedSeconds)=>`[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${rowsProcessed} rows processed`);
         }
     }while (ids.length > 0)
 };
 // Migrate document ids for tables that don't have localizations
-const migrationDocumentIds = async (db, knex, meta)=>{
+const migrationDocumentIds = async (db, knex, meta, heartbeat)=>{
     const batchSize = getBatchSize(knex);
-    let recordsLeft = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0].recordsLeft;
+    const total = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0].recordsLeft;
+    let recordsLeft = total;
     while(recordsLeft > 0){
         const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;
         const updateRecords = (await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)).map((item)=>({
@@ -93,6 +99,8 @@ const migrationDocumentIds = async (db, knex, meta)=>{
             }));
         await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();
         recordsLeft -= updateRecords.length;
+        const processed = total - recordsLeft;
+        heartbeat.tick((elapsedSeconds)=>`[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${processed}/${total}`);
     }
 };
 const isDuplicateColumnError = (error)=>{
@@ -121,7 +129,9 @@ const hasLocalizationsJoinTable = async (knex, tableName)=>{
 const createdDocumentId = {
     name: '5.0.0-02-created-document-id',
     async up (knex, db) {
-        // do sth
+        const heartbeat = createHeartbeatLogger((message)=>{
+            db.logger.info(message);
+        });
         for (const meta of db.metadata.values()){
             const hasTable = await knex.schema.hasTable(meta.tableName);
             if (!hasTable) {
@@ -133,9 +143,9 @@ const createdDocumentId = {
                     await createDocumentIdColumn(knex, meta.tableName);
                 }
                 if (await hasLocalizationsJoinTable(knex, meta.tableName)) {
-                    await migrateDocumentIdsWithLocalizations(db, knex, meta);
+                    await migrateDocumentIdsWithLocalizations(db, knex, meta, heartbeat);
                 } else {
-                    await migrationDocumentIds(db, knex, meta);
+                    await migrationDocumentIds(db, knex, meta, heartbeat);
                 }
             }
         }

package/dist/migrations/internal-migrations/5.0.0-02-document-id.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"5.0.0-02-document-id.mjs","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"sourcesContent":["/**\n * NOTE: This migration avoids using the `identifiers` utility.\n * As the `5.0.0-01-convert-identifiers-long-than-max-length`\n * migration does not convert the `localizations` join tables, as they are not\n * tables that exist anymore in v5 and are not in the db metadata.\n *\n * This migration therefore relies on the fact that those tables still exist, and\n * references them directly.\n *\n * Database join table name: `categories_localizations_links`\n * Actual `identifiers` returned join table name: `categories_localizations_lnk`\n *\n */\nimport { createId } from '@paralleldrive/cuid2';\nimport { snakeCase } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport type { Migration } from '../common';\nimport type { Database } from '../..';\nimport type { Meta } from '../../metadata';\n\nfunction getBatchSize(trx: Knex, defaultSize: number = 1000): number {\n  const client = trx.client.config.client;\n  const isSQLite =\n    typeof client === 'string' && ['sqlite', 'sqlite3', 'better-sqlite3'].includes(client);\n  return isSQLite ? Math.min(defaultSize, 250) : defaultSize;\n}\n\ninterface Params {\n  joinColumn: string;\n  inverseJoinColumn: string;\n  tableName: string;\n  joinTableName: string;\n}\n\nconst QUERIES = {\n  async postgres(knex: Knex, params: Params) {\n    const res = await knex.raw(\n      `\n    SELECT :tableName:.id as id, string_agg(DISTINCT :inverseJoinColumn:::character varying, ',') as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res.rows;\n  },\n  async mysql(knex: Knex, params: Params) {\n    const [res] = await knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res;\n  },\n  async sqlite(knex: Knex, params: Params) {\n    return knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :joinTableName:.:joinColumn:\n    LIMIT 1;\n    `,\n      params\n    );\n  },\n};\n\nconst getNextIdsToCreateDocumentId = async (\n  db: Database,\n  knex: Knex,\n  {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  }: {\n    joinColumn: string;\n    inverseJoinColumn: string;\n    tableName: string;\n    joinTableName: string;\n  }\n): Promise<number[]> => {\n  const res = await QUERIES[db.dialect.client as keyof typeof QUERIES](knex, {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  });\n\n  if (res.length > 0) {\n    const row = res[0];\n    const otherIds = row.other_ids\n      ? row.other_ids.split(',').map((v: string) => parseInt(v, 10))\n      : [];\n\n    return [row.id, ...otherIds];\n  }\n\n  return [];\n};\n\n// Migrate document ids for tables that have localizations\nconst migrateDocumentIdsWithLocalizations = async (db: Database, knex: Knex, meta: Meta) => {\n  const singularName = meta.singularName.toLowerCase();\n  const joinColumn = snakeCase(`${singularName}_id`);\n  const inverseJoinColumn = snakeCase(`inv_${singularName}_id`);\n  let ids: number[];\n\n  do {\n    ids = await getNextIdsToCreateDocumentId(db, knex, {\n      joinColumn,\n      inverseJoinColumn,\n      tableName: meta.tableName,\n      joinTableName: snakeCase(`${meta.tableName}_localizations_links`),\n    });\n\n    if (ids.length > 0) {\n      await knex(meta.tableName).update({ document_id: createId() }).whereIn('id', ids);\n    }\n  } while (ids.length > 0);\n};\n\n// Migrate document ids for tables that don't have localizations\nconst migrationDocumentIds = async (db: Database, knex: Knex, meta: Meta) => {\n  const batchSize = getBatchSize(knex);\n  let recordsLeft = +(\n    await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id')\n  )[0].recordsLeft;\n  while (recordsLeft > 0) {\n    const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;\n    const updateRecords = (\n      await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)\n    ).map((item) => ({ id: item.id, document_id: createId() }));\n    await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();\n    recordsLeft -= updateRecords.length;\n  }\n};\n\nconst isDuplicateColumnError = (error: unknown): boolean => {\n  if (!error || typeof error !== 'object') return false;\n  const e = error as { code?: string; errno?: number; message?: string };\n  if (e.code === '42701') return true;\n  if (e.errno === 1060) return true;\n  if (typeof e.message === 'string' && /duplicate column/i.test(e.message)) return true;\n  return false;\n};\n\nconst createDocumentIdColumn = async (knex: Knex, tableName: string) => {\n  try {\n    await knex.schema.alterTable(tableName, (table) => {\n      table.string('document_id');\n    });\n  } catch (error) {\n    if (!isDuplicateColumnError(error)) {\n      throw error;\n    }\n  }\n};\n\nconst hasLocalizationsJoinTable = async (knex: Knex, tableName: string) => {\n  const joinTableName = snakeCase(`${tableName}_localizations_links`);\n  return knex.schema.hasTable(joinTableName);\n};\n\nexport const createdDocumentId: Migration = {\n  name: '5.0.0-02-created-document-id',\n  async up(knex, db) {\n    // do sth\n    for (const meta of db.metadata.values()) {\n      const hasTable = await knex.schema.hasTable(meta.tableName);\n\n      if (!hasTable) {\n        continue;\n      }\n\n      if ('documentId' in meta.attributes) {\n        const hasDocumentIdColumn = await knex.schema.hasColumn(meta.tableName, 'document_id');\n\n        if (!hasDocumentIdColumn) {\n          await createDocumentIdColumn(knex, meta.tableName);\n        }\n\n        if (await hasLocalizationsJoinTable(knex, meta.tableName)) {\n          await migrateDocumentIdsWithLocalizations(db, knex, meta);\n        } else {\n          await migrationDocumentIds(db, knex, meta);\n        }\n      }\n    }\n  },\n  async down() {\n    throw new Error('not implemented');\n  },\n};\n"],"names":["getBatchSize","trx","defaultSize","client","config","isSQLite","includes","Math","min","QUERIES","postgres","knex","params","res","raw","rows","mysql","sqlite","getNextIdsToCreateDocumentId","db","joinColumn","inverseJoinColumn","tableName","joinTableName","dialect","length","row","otherIds","other_ids","split","map","v","parseInt","id","migrateDocumentIdsWithLocalizations","meta","singularName","toLowerCase","snakeCase","ids","update","document_id","createId","whereIn","migrationDocumentIds","batchSize","recordsLeft","count","whereNull","currentBatchSize","updateRecords","select","limit","item","insert","onConflict","merge","isDuplicateColumnError","error","e","code","errno","message","test","createDocumentIdColumn","schema","alterTable","table","string","hasLocalizationsJoinTable","hasTable","createdDocumentId","name","up","metadata","values","attributes","hasDocumentIdColumn","hasColumn","down","Error"],"mappings":";;;AAqBA,SAASA,YAAAA,CAAaC,GAAS,EAAEC,WAAAA,GAAsB,IAAI,EAAA;AACzD,IAAA,MAAMC,SAASF,GAAAA,CAAIE,MAAM,CAACC,MAAM,CAACD,MAAM;IACvC,MAAME,QAAAA,GACJ,OAAOF,MAAAA,KAAW,QAAA,IAAY;AAAC,QAAA,QAAA;AAAU,QAAA,SAAA;AAAW,QAAA;AAAiB,KAAA,CAACG,QAAQ,CAACH,MAAAA,CAAAA;AACjF,IAAA,OAAOE,QAAAA,GAAWE,IAAAA,CAAKC,GAAG,CAACN,aAAa,GAAA,CAAA,GAAOA,WAAAA;AACjD;AASA,MAAMO,OAAAA,GAAU;IACd,MAAMC,QAAAA,CAAAA,CAASC,IAAU,EAAEC,MAAc,EAAA;AACvC,QAAA,MAAMC,GAAAA,GAAM,MAAMF,IAAAA,CAAKG,GAAG,CACxB;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;AAGF,QAAA,OAAOC,IAAIE,IAAI;AACjB,IAAA,CAAA;IACA,MAAMC,KAAAA,CAAAA,CAAML,IAAU,EAAEC,MAAc,EAAA;AACpC,QAAA,MAAM,CAACC,GAAAA,CAAI,GAAG,MAAMF,IAAAA,CAAKG,GAAG,CAC1B;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;QAGF,OAAOC,GAAAA;AACT,IAAA,CAAA;IACA,MAAMI,MAAAA,CAAAA,CAAON,IAAU,EAAEC,MAAc,EAAA;QACrC,OAAOD,IAAAA,CAAKG,GAAG,CACb;;;;;;;AAOF,IAAA,CAAC,EACCF,MAAAA,CAAAA;AAEJ,IAAA;AACF,CAAA;AAEA,MAAMM,4BAAAA,GAA+B,OACnCC,EAAAA,EACAR,IAAAA,EACA,EACES,UAAU,EACVC,iBAAiB,EACjBC,SAAS,EACTC,aAAa,EAMd,GAAA;IAED,MAAMV,GAAAA,GAAM,MAAMJ,OAAO,CAACU,EAAAA,CAAGK,OAAO,CAACrB,MAAM,CAAyB,CAACQ,IAAAA,EAAM;AACzES,QAAAA,UAAAA;AACAC,QAAAA,iBAAAA;AACAC,QAAAA,SAAAA;AACAC,QAAAA;AACF,KAAA,CAAA;IAEA,IAAIV,GAAAA,CAAIY,MAAM,GAAG,CAAA,EAAG;QAClB,MAAMC,GAAAA,GAAMb,GAAG,CAAC,CAAA,CAAE;AAClB,QAAA,MAAMc,WAAWD,GAAAA,CAAIE,SAAS,GAC1BF,GAAAA,CAAIE,SAAS,CAACC,KAAK,CAAC,GAAA,CAAA,CAAKC,GAAG,CAAC,CAACC,IAAcC,QAAAA,CAASD,CAAAA,EAAG,OACxD,EAAE;QAEN,OAAO;AAACL,YAAAA,GAAAA,CAAIO,EAAE;AAAKN,YAAAA,GAAAA;AAAS,SAAA;AAC9B,IAAA;AAEA,IAAA,OAAO,EAAE;AACX,CAAA;AAEA;AACA,MAAMO,mCAAAA,GAAsC,OAAOf,EAAAA,EAAcR,IAAAA,EAAYwB,IAAAA,GAAAA;AAC3E,IAAA,MAAMC,YAAAA,GAAeD,IAAAA,CAAKC,YAAY,CAACC,WAAW,EAAA;AAClD,IAAA,MAAMjB,UAAAA,GAAakB,SAAAA,CAAU,CAAA,EAAGF,YAAAA,CAAa,GAAG,CAAC,CAAA;AACjD,IAAA,MAAMf,oBAAoBiB,SAAAA,CAAU,CAAC,IAAI,EAAEF,YAAAA,CAAa,GAAG,CAAC,CAAA;IAC5D,IAAIG,GAAAA;IAEJ,GAAG;QACDA,GAAAA,GAAM,MAAMrB,4BAAAA,CAA6BC,EAAAA,EAAIR,IAAAA,EAAM;AACjDS,YAAAA,UAAAA;AACAC,YAAAA,iBAAAA;AACAC,YAAAA,SAAAA,EAAWa,KAAKb,SAAS;AACzBC,YAAAA,aAAAA,EAAee,UAAU,CAAA,EAAGH,IAAAA,CAAKb,SAAS,CAAC,oBAAoB,CAAC;AAClE,SAAA,CAAA;QAEA,IAAIiB,GAAAA,CAAId,MAAM,GAAG,CAAA,EAAG;AAClB,YAAA,MAAMd,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEkB,MAAM,CAAC;gBAAEC,WAAAA,EAAaC,QAAAA;aAAW,CAAA,CAAGC,OAAO,CAAC,IAAA,EAAMJ,GAAAA,CAAAA;AAC/E,QAAA;IACF,CAAA,OAASA,GAAAA,CAAId,MAAM,GAAG,CAAA;AACxB,CAAA;AAEA;AACA,MAAMmB,oBAAAA,GAAuB,OAAOzB,EAAAA,EAAcR,IAAAA,EAAYwB,IAAAA,GAAAA;AAC5D,IAAA,MAAMU,YAAY7C,YAAAA,CAAaW,IAAAA,CAAAA;AAC/B,IAAA,IAAImC,cAAc,CAChB,CAAA,MAAMnC,IAAAA,CAAKwB,KAAKb,SAAS,CAAA,CAAEyB,KAAK,CAAC,kBAAA,CAAA,CAAoBC,SAAS,CAAC,aAAA,CAAa,EAC5E,CAAA,CAAE,CAACF,WAAW;AAChB,IAAA,MAAOA,cAAc,CAAA,CAAG;QACtB,MAAMG,gBAAAA,GAAmBH,WAAAA,GAAcD,SAAAA,GAAYC,WAAAA,GAAcD,SAAAA;QACjE,MAAMK,aAAAA,GAAgB,CACpB,MAAMvC,KAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAE6B,MAAM,CAAC,IAAA,CAAA,CAAMH,SAAS,CAAC,aAAA,CAAA,CAAeI,KAAK,CAACH,gBAAAA,CAAgB,EACvFnB,GAAG,CAAC,CAACuB,IAAAA,IAAU;AAAEpB,gBAAAA,EAAAA,EAAIoB,KAAKpB,EAAE;gBAAEQ,WAAAA,EAAaC,QAAAA;aAAW,CAAA,CAAA;QACxD,MAAM/B,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEgC,MAAM,CAACJ,aAAAA,CAAAA,CAAeK,UAAU,CAAC,IAAA,CAAA,CAAMC,KAAK,EAAA;AACvEV,QAAAA,WAAAA,IAAeI,cAAczB,MAAM;AACrC,IAAA;AACF,CAAA;AAEA,MAAMgC,yBAAyB,CAACC,KAAAA,GAAAA;AAC9B,IAAA,IAAI,CAACA,KAAAA,IAAS,OAAOA,KAAAA,KAAU,UAAU,OAAO,KAAA;AAChD,IAAA,MAAMC,CAAAA,GAAID,KAAAA;AACV,IAAA,IAAIC,CAAAA,CAAEC,IAAI,KAAK,OAAA,EAAS,OAAO,IAAA;AAC/B,IAAA,IAAID,CAAAA,CAAEE,KAAK,KAAK,IAAA,EAAM,OAAO,IAAA;IAC7B,IAAI,OAAOF,CAAAA,CAAEG,OAAO,KAAK,QAAA,IAAY,mBAAA,CAAoBC,IAAI,CAACJ,CAAAA,CAAEG,OAAO,CAAA,EAAG,OAAO,IAAA;IACjF,OAAO,KAAA;AACT,CAAA;AAEA,MAAME,sBAAAA,GAAyB,OAAOrD,IAAAA,EAAYW,SAAAA,GAAAA;IAChD,IAAI;AACF,QAAA,MAAMX,KAAKsD,MAAM,CAACC,UAAU,CAAC5C,WAAW,CAAC6C,KAAAA,GAAAA;AACvCA,YAAAA,KAAAA,CAAMC,MAAM,CAAC,aAAA,CAAA;AACf,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAE,OAAOV,KAAAA,EAAO;QACd,IAAI,CAACD,uBAAuBC,KAAAA,CAAAA,EAAQ;YAClC,MAAMA,KAAAA;AACR,QAAA;AACF,IAAA;AACF,CAAA;AAEA,MAAMW,yBAAAA,GAA4B,OAAO1D,IAAAA,EAAYW,SAAAA,GAAAA;AACnD,IAAA,MAAMC,aAAAA,GAAgBe,SAAAA,CAAU,CAAA,EAAGhB,SAAAA,CAAU,oBAAoB,CAAC,CAAA;AAClE,IAAA,OAAOX,IAAAA,CAAKsD,MAAM,CAACK,QAAQ,CAAC/C,aAAAA,CAAAA;AAC9B,CAAA;MAEagD,iBAAAA,GAA+B;IAC1CC,IAAAA,EAAM,8BAAA;IACN,MAAMC,EAAAA,CAAAA,CAAG9D,IAAI,EAAEQ,EAAE,EAAA;;AAEf,QAAA,KAAK,MAAMgB,IAAAA,IAAQhB,EAAAA,CAAGuD,QAAQ,CAACC,MAAM,EAAA,CAAI;YACvC,MAAML,QAAAA,GAAW,MAAM3D,IAAAA,CAAKsD,MAAM,CAACK,QAAQ,CAACnC,KAAKb,SAAS,CAAA;AAE1D,YAAA,IAAI,CAACgD,QAAAA,EAAU;AACb,gBAAA;AACF,YAAA;YAEA,IAAI,YAAA,IAAgBnC,IAAAA,CAAKyC,UAAU,EAAE;gBACnC,MAAMC,mBAAAA,GAAsB,MAAMlE,IAAAA,CAAKsD,MAAM,CAACa,SAAS,CAAC3C,IAAAA,CAAKb,SAAS,EAAE,aAAA,CAAA;AAExE,gBAAA,IAAI,CAACuD,mBAAAA,EAAqB;oBACxB,MAAMb,sBAAAA,CAAuBrD,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA;AACnD,gBAAA;AAEA,gBAAA,IAAI,MAAM+C,yBAAAA,CAA0B1D,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA,EAAG;oBACzD,MAAMY,mCAAAA,CAAoCf,IAAIR,IAAAA,EAAMwB,IAAAA,CAAAA;gBACtD,CAAA,MAAO;oBACL,MAAMS,oBAAAA,CAAqBzB,IAAIR,IAAAA,EAAMwB,IAAAA,CAAAA;AACvC,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA,CAAA;IACA,MAAM4C,IAAAA,CAAAA,GAAAA;AACJ,QAAA,MAAM,IAAIC,KAAAA,CAAM,iBAAA,CAAA;AAClB,IAAA;AACF;;;;"}
+{"version":3,"file":"5.0.0-02-document-id.mjs","sources":["../../../src/migrations/internal-migrations/5.0.0-02-document-id.ts"],"sourcesContent":["/**\n * NOTE: This migration avoids using the `identifiers` utility.\n * As the `5.0.0-01-convert-identifiers-long-than-max-length`\n * migration does not convert the `localizations` join tables, as they are not\n * tables that exist anymore in v5 and are not in the db metadata.\n *\n * This migration therefore relies on the fact that those tables still exist, and\n * references them directly.\n *\n * Database join table name: `categories_localizations_links`\n * Actual `identifiers` returned join table name: `categories_localizations_lnk`\n *\n */\nimport { createId } from '@paralleldrive/cuid2';\nimport { snakeCase } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport type { Migration } from '../common';\nimport { createHeartbeatLogger, type HeartbeatLogger } from '../heartbeat';\nimport type { Database } from '../..';\nimport type { Meta } from '../../metadata';\n\nfunction getBatchSize(trx: Knex, defaultSize: number = 1000): number {\n  const client = trx.client.config.client;\n  const isSQLite =\n    typeof client === 'string' && ['sqlite', 'sqlite3', 'better-sqlite3'].includes(client);\n  return isSQLite ? Math.min(defaultSize, 250) : defaultSize;\n}\n\ninterface Params {\n  joinColumn: string;\n  inverseJoinColumn: string;\n  tableName: string;\n  joinTableName: string;\n}\n\nconst QUERIES = {\n  async postgres(knex: Knex, params: Params) {\n    const res = await knex.raw(\n      `\n    SELECT :tableName:.id as id, string_agg(DISTINCT :inverseJoinColumn:::character varying, ',') as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res.rows;\n  },\n  async mysql(knex: Knex, params: Params) {\n    const [res] = await knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :tableName:.id, :joinTableName:.:joinColumn:\n    LIMIT 1;\n  `,\n      params\n    );\n\n    return res;\n  },\n  async sqlite(knex: Knex, params: Params) {\n    return knex.raw(\n      `\n    SELECT :tableName:.id as id, group_concat(DISTINCT :inverseJoinColumn:) as other_ids\n    FROM :tableName:\n    LEFT JOIN :joinTableName: ON :tableName:.id = :joinTableName:.:joinColumn:\n    WHERE :tableName:.document_id IS NULL\n    GROUP BY :joinTableName:.:joinColumn:\n    LIMIT 1;\n    `,\n      params\n    );\n  },\n};\n\nconst getNextIdsToCreateDocumentId = async (\n  db: Database,\n  knex: Knex,\n  {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  }: {\n    joinColumn: string;\n    inverseJoinColumn: string;\n    tableName: string;\n    joinTableName: string;\n  }\n): Promise<number[]> => {\n  const res = await QUERIES[db.dialect.client as keyof typeof QUERIES](knex, {\n    joinColumn,\n    inverseJoinColumn,\n    tableName,\n    joinTableName,\n  });\n\n  if (res.length > 0) {\n    const row = res[0];\n    const otherIds = row.other_ids\n      ? row.other_ids.split(',').map((v: string) => parseInt(v, 10))\n      : [];\n\n    return [row.id, ...otherIds];\n  }\n\n  return [];\n};\n\n// Migrate document ids for tables that have localizations\nconst migrateDocumentIdsWithLocalizations = async (\n  db: Database,\n  knex: Knex,\n  meta: Meta,\n  heartbeat: HeartbeatLogger\n) => {\n  const singularName = meta.singularName.toLowerCase();\n  const joinColumn = snakeCase(`${singularName}_id`);\n  const inverseJoinColumn = snakeCase(`inv_${singularName}_id`);\n  let ids: number[];\n  let processed = 0;\n\n  do {\n    ids = await getNextIdsToCreateDocumentId(db, knex, {\n      joinColumn,\n      inverseJoinColumn,\n      tableName: meta.tableName,\n      joinTableName: snakeCase(`${meta.tableName}_localizations_links`),\n    });\n\n    if (ids.length > 0) {\n      await knex(meta.tableName).update({ document_id: createId() }).whereIn('id', ids);\n      processed += ids.length;\n      const rowsProcessed = processed;\n      heartbeat.tick(\n        (elapsedSeconds) =>\n          `[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${rowsProcessed} rows processed`\n      );\n    }\n  } while (ids.length > 0);\n};\n\n// Migrate document ids for tables that don't have localizations\nconst migrationDocumentIds = async (\n  db: Database,\n  knex: Knex,\n  meta: Meta,\n  heartbeat: HeartbeatLogger\n) => {\n  const batchSize = getBatchSize(knex);\n  const total = +(await knex(meta.tableName).count('* as recordsLeft').whereNull('document_id'))[0]\n    .recordsLeft;\n  let recordsLeft = total;\n  while (recordsLeft > 0) {\n    const currentBatchSize = recordsLeft < batchSize ? recordsLeft : batchSize;\n    const updateRecords = (\n      await knex(meta.tableName).select('id').whereNull('document_id').limit(currentBatchSize)\n    ).map((item) => ({ id: item.id, document_id: createId() }));\n    await knex(meta.tableName).insert(updateRecords).onConflict('id').merge();\n    recordsLeft -= updateRecords.length;\n    const processed = total - recordsLeft;\n    heartbeat.tick(\n      (elapsedSeconds) =>\n        `[document-id] still running (${elapsedSeconds}s) · ${meta.tableName} ${processed}/${total}`\n    );\n  }\n};\n\nconst isDuplicateColumnError = (error: unknown): boolean => {\n  if (!error || typeof error !== 'object') return false;\n  const e = error as { code?: string; errno?: number; message?: string };\n  if (e.code === '42701') return true;\n  if (e.errno === 1060) return true;\n  if (typeof e.message === 'string' && /duplicate column/i.test(e.message)) return true;\n  return false;\n};\n\nconst createDocumentIdColumn = async (knex: Knex, tableName: string) => {\n  try {\n    await knex.schema.alterTable(tableName, (table) => {\n      table.string('document_id');\n    });\n  } catch (error) {\n    if (!isDuplicateColumnError(error)) {\n      throw error;\n    }\n  }\n};\n\nconst hasLocalizationsJoinTable = async (knex: Knex, tableName: string) => {\n  const joinTableName = snakeCase(`${tableName}_localizations_links`);\n  return knex.schema.hasTable(joinTableName);\n};\n\nexport const createdDocumentId: Migration = {\n  name: '5.0.0-02-created-document-id',\n  async up(knex, db) {\n    const heartbeat = createHeartbeatLogger((message) => {\n      db.logger.info(message);\n    });\n\n    for (const meta of db.metadata.values()) {\n      const hasTable = await knex.schema.hasTable(meta.tableName);\n\n      if (!hasTable) {\n        continue;\n      }\n\n      if ('documentId' in meta.attributes) {\n        const hasDocumentIdColumn = await knex.schema.hasColumn(meta.tableName, 'document_id');\n\n        if (!hasDocumentIdColumn) {\n          await createDocumentIdColumn(knex, meta.tableName);\n        }\n\n        if (await hasLocalizationsJoinTable(knex, meta.tableName)) {\n          await migrateDocumentIdsWithLocalizations(db, knex, meta, heartbeat);\n        } else {\n          await migrationDocumentIds(db, knex, meta, heartbeat);\n        }\n      }\n    }\n  },\n  async down() {\n    throw new Error('not implemented');\n  },\n};\n"],"names":["getBatchSize","trx","defaultSize","client","config","isSQLite","includes","Math","min","QUERIES","postgres","knex","params","res","raw","rows","mysql","sqlite","getNextIdsToCreateDocumentId","db","joinColumn","inverseJoinColumn","tableName","joinTableName","dialect","length","row","otherIds","other_ids","split","map","v","parseInt","id","migrateDocumentIdsWithLocalizations","meta","heartbeat","singularName","toLowerCase","snakeCase","ids","processed","update","document_id","createId","whereIn","rowsProcessed","tick","elapsedSeconds","migrationDocumentIds","batchSize","total","count","whereNull","recordsLeft","currentBatchSize","updateRecords","select","limit","item","insert","onConflict","merge","isDuplicateColumnError","error","e","code","errno","message","test","createDocumentIdColumn","schema","alterTable","table","string","hasLocalizationsJoinTable","hasTable","createdDocumentId","name","up","createHeartbeatLogger","logger","info","metadata","values","attributes","hasDocumentIdColumn","hasColumn","down","Error"],"mappings":";;;;AAsBA,SAASA,YAAAA,CAAaC,GAAS,EAAEC,WAAAA,GAAsB,IAAI,EAAA;AACzD,IAAA,MAAMC,SAASF,GAAAA,CAAIE,MAAM,CAACC,MAAM,CAACD,MAAM;IACvC,MAAME,QAAAA,GACJ,OAAOF,MAAAA,KAAW,QAAA,IAAY;AAAC,QAAA,QAAA;AAAU,QAAA,SAAA;AAAW,QAAA;AAAiB,KAAA,CAACG,QAAQ,CAACH,MAAAA,CAAAA;AACjF,IAAA,OAAOE,QAAAA,GAAWE,IAAAA,CAAKC,GAAG,CAACN,aAAa,GAAA,CAAA,GAAOA,WAAAA;AACjD;AASA,MAAMO,OAAAA,GAAU;IACd,MAAMC,QAAAA,CAAAA,CAASC,IAAU,EAAEC,MAAc,EAAA;AACvC,QAAA,MAAMC,GAAAA,GAAM,MAAMF,IAAAA,CAAKG,GAAG,CACxB;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;AAGF,QAAA,OAAOC,IAAIE,IAAI;AACjB,IAAA,CAAA;IACA,MAAMC,KAAAA,CAAAA,CAAML,IAAU,EAAEC,MAAc,EAAA;AACpC,QAAA,MAAM,CAACC,GAAAA,CAAI,GAAG,MAAMF,IAAAA,CAAKG,GAAG,CAC1B;;;;;;;AAOJ,EAAA,CAAC,EACGF,MAAAA,CAAAA;QAGF,OAAOC,GAAAA;AACT,IAAA,CAAA;IACA,MAAMI,MAAAA,CAAAA,CAAON,IAAU,EAAEC,MAAc,EAAA;QACrC,OAAOD,IAAAA,CAAKG,GAAG,CACb;;;;;;;AAOF,IAAA,CAAC,EACCF,MAAAA,CAAAA;AAEJ,IAAA;AACF,CAAA;AAEA,MAAMM,4BAAAA,GAA+B,OACnCC,EAAAA,EACAR,IAAAA,EACA,EACES,UAAU,EACVC,iBAAiB,EACjBC,SAAS,EACTC,aAAa,EAMd,GAAA;IAED,MAAMV,GAAAA,GAAM,MAAMJ,OAAO,CAACU,EAAAA,CAAGK,OAAO,CAACrB,MAAM,CAAyB,CAACQ,IAAAA,EAAM;AACzES,QAAAA,UAAAA;AACAC,QAAAA,iBAAAA;AACAC,QAAAA,SAAAA;AACAC,QAAAA;AACF,KAAA,CAAA;IAEA,IAAIV,GAAAA,CAAIY,MAAM,GAAG,CAAA,EAAG;QAClB,MAAMC,GAAAA,GAAMb,GAAG,CAAC,CAAA,CAAE;AAClB,QAAA,MAAMc,WAAWD,GAAAA,CAAIE,SAAS,GAC1BF,GAAAA,CAAIE,SAAS,CAACC,KAAK,CAAC,GAAA,CAAA,CAAKC,GAAG,CAAC,CAACC,IAAcC,QAAAA,CAASD,CAAAA,EAAG,OACxD,EAAE;QAEN,OAAO;AAACL,YAAAA,GAAAA,CAAIO,EAAE;AAAKN,YAAAA,GAAAA;AAAS,SAAA;AAC9B,IAAA;AAEA,IAAA,OAAO,EAAE;AACX,CAAA;AAEA;AACA,MAAMO,mCAAAA,GAAsC,OAC1Cf,EAAAA,EACAR,IAAAA,EACAwB,IAAAA,EACAC,SAAAA,GAAAA;AAEA,IAAA,MAAMC,YAAAA,GAAeF,IAAAA,CAAKE,YAAY,CAACC,WAAW,EAAA;AAClD,IAAA,MAAMlB,UAAAA,GAAamB,SAAAA,CAAU,CAAA,EAAGF,YAAAA,CAAa,GAAG,CAAC,CAAA;AACjD,IAAA,MAAMhB,oBAAoBkB,SAAAA,CAAU,CAAC,IAAI,EAAEF,YAAAA,CAAa,GAAG,CAAC,CAAA;IAC5D,IAAIG,GAAAA;AACJ,IAAA,IAAIC,SAAAA,GAAY,CAAA;IAEhB,GAAG;QACDD,GAAAA,GAAM,MAAMtB,4BAAAA,CAA6BC,EAAAA,EAAIR,IAAAA,EAAM;AACjDS,YAAAA,UAAAA;AACAC,YAAAA,iBAAAA;AACAC,YAAAA,SAAAA,EAAWa,KAAKb,SAAS;AACzBC,YAAAA,aAAAA,EAAegB,UAAU,CAAA,EAAGJ,IAAAA,CAAKb,SAAS,CAAC,oBAAoB,CAAC;AAClE,SAAA,CAAA;QAEA,IAAIkB,GAAAA,CAAIf,MAAM,GAAG,CAAA,EAAG;AAClB,YAAA,MAAMd,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEoB,MAAM,CAAC;gBAAEC,WAAAA,EAAaC,QAAAA;aAAW,CAAA,CAAGC,OAAO,CAAC,IAAA,EAAML,GAAAA,CAAAA;AAC7EC,YAAAA,SAAAA,IAAaD,IAAIf,MAAM;AACvB,YAAA,MAAMqB,aAAAA,GAAgBL,SAAAA;AACtBL,YAAAA,SAAAA,CAAUW,IAAI,CACZ,CAACC,cAAAA,GACC,CAAC,6BAA6B,EAAEA,cAAAA,CAAe,KAAK,EAAEb,KAAKb,SAAS,CAAC,CAAC,EAAEwB,aAAAA,CAAc,eAAe,CAAC,CAAA;AAE5G,QAAA;IACF,CAAA,OAASN,GAAAA,CAAIf,MAAM,GAAG,CAAA;AACxB,CAAA;AAEA;AACA,MAAMwB,oBAAAA,GAAuB,OAC3B9B,EAAAA,EACAR,IAAAA,EACAwB,IAAAA,EACAC,SAAAA,GAAAA;AAEA,IAAA,MAAMc,YAAYlD,YAAAA,CAAaW,IAAAA,CAAAA;AAC/B,IAAA,MAAMwC,QAAQ,CAAE,CAAA,MAAMxC,IAAAA,CAAKwB,KAAKb,SAAS,CAAA,CAAE8B,KAAK,CAAC,kBAAA,CAAA,CAAoBC,SAAS,CAAC,aAAA,CAAa,EAAG,CAAA,CAAE,CAC9FC,WAAW;AACd,IAAA,IAAIA,WAAAA,GAAcH,KAAAA;AAClB,IAAA,MAAOG,cAAc,CAAA,CAAG;QACtB,MAAMC,gBAAAA,GAAmBD,WAAAA,GAAcJ,SAAAA,GAAYI,WAAAA,GAAcJ,SAAAA;QACjE,MAAMM,aAAAA,GAAgB,CACpB,MAAM7C,KAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEmC,MAAM,CAAC,IAAA,CAAA,CAAMJ,SAAS,CAAC,aAAA,CAAA,CAAeK,KAAK,CAACH,gBAAAA,CAAgB,EACvFzB,GAAG,CAAC,CAAC6B,IAAAA,IAAU;AAAE1B,gBAAAA,EAAAA,EAAI0B,KAAK1B,EAAE;gBAAEU,WAAAA,EAAaC,QAAAA;aAAW,CAAA,CAAA;QACxD,MAAMjC,IAAAA,CAAKwB,IAAAA,CAAKb,SAAS,CAAA,CAAEsC,MAAM,CAACJ,aAAAA,CAAAA,CAAeK,UAAU,CAAC,IAAA,CAAA,CAAMC,KAAK,EAAA;AACvER,QAAAA,WAAAA,IAAeE,cAAc/B,MAAM;AACnC,QAAA,MAAMgB,YAAYU,KAAAA,GAAQG,WAAAA;AAC1BlB,QAAAA,SAAAA,CAAUW,IAAI,CACZ,CAACC,iBACC,CAAC,6BAA6B,EAAEA,cAAAA,CAAe,KAAK,EAAEb,IAAAA,CAAKb,SAAS,CAAC,CAAC,EAAEmB,SAAAA,CAAU,CAAC,EAAEU,KAAAA,CAAAA,CAAO,CAAA;AAElG,IAAA;AACF,CAAA;AAEA,MAAMY,yBAAyB,CAACC,KAAAA,GAAAA;AAC9B,IAAA,IAAI,CAACA,KAAAA,IAAS,OAAOA,KAAAA,KAAU,UAAU,OAAO,KAAA;AAChD,IAAA,MAAMC,CAAAA,GAAID,KAAAA;AACV,IAAA,IAAIC,CAAAA,CAAEC,IAAI,KAAK,OAAA,EAAS,OAAO,IAAA;AAC/B,IAAA,IAAID,CAAAA,CAAEE,KAAK,KAAK,IAAA,EAAM,OAAO,IAAA;IAC7B,IAAI,OAAOF,CAAAA,CAAEG,OAAO,KAAK,QAAA,IAAY,mBAAA,CAAoBC,IAAI,CAACJ,CAAAA,CAAEG,OAAO,CAAA,EAAG,OAAO,IAAA;IACjF,OAAO,KAAA;AACT,CAAA;AAEA,MAAME,sBAAAA,GAAyB,OAAO3D,IAAAA,EAAYW,SAAAA,GAAAA;IAChD,IAAI;AACF,QAAA,MAAMX,KAAK4D,MAAM,CAACC,UAAU,CAAClD,WAAW,CAACmD,KAAAA,GAAAA;AACvCA,YAAAA,KAAAA,CAAMC,MAAM,CAAC,aAAA,CAAA;AACf,QAAA,CAAA,CAAA;AACF,IAAA,CAAA,CAAE,OAAOV,KAAAA,EAAO;QACd,IAAI,CAACD,uBAAuBC,KAAAA,CAAAA,EAAQ;YAClC,MAAMA,KAAAA;AACR,QAAA;AACF,IAAA;AACF,CAAA;AAEA,MAAMW,yBAAAA,GAA4B,OAAOhE,IAAAA,EAAYW,SAAAA,GAAAA;AACnD,IAAA,MAAMC,aAAAA,GAAgBgB,SAAAA,CAAU,CAAA,EAAGjB,SAAAA,CAAU,oBAAoB,CAAC,CAAA;AAClE,IAAA,OAAOX,IAAAA,CAAK4D,MAAM,CAACK,QAAQ,CAACrD,aAAAA,CAAAA;AAC9B,CAAA;MAEasD,iBAAAA,GAA+B;IAC1CC,IAAAA,EAAM,8BAAA;IACN,MAAMC,EAAAA,CAAAA,CAAGpE,IAAI,EAAEQ,EAAE,EAAA;QACf,MAAMiB,SAAAA,GAAY4C,sBAAsB,CAACZ,OAAAA,GAAAA;YACvCjD,EAAAA,CAAG8D,MAAM,CAACC,IAAI,CAACd,OAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AAEA,QAAA,KAAK,MAAMjC,IAAAA,IAAQhB,EAAAA,CAAGgE,QAAQ,CAACC,MAAM,EAAA,CAAI;YACvC,MAAMR,QAAAA,GAAW,MAAMjE,IAAAA,CAAK4D,MAAM,CAACK,QAAQ,CAACzC,KAAKb,SAAS,CAAA;AAE1D,YAAA,IAAI,CAACsD,QAAAA,EAAU;AACb,gBAAA;AACF,YAAA;YAEA,IAAI,YAAA,IAAgBzC,IAAAA,CAAKkD,UAAU,EAAE;gBACnC,MAAMC,mBAAAA,GAAsB,MAAM3E,IAAAA,CAAK4D,MAAM,CAACgB,SAAS,CAACpD,IAAAA,CAAKb,SAAS,EAAE,aAAA,CAAA;AAExE,gBAAA,IAAI,CAACgE,mBAAAA,EAAqB;oBACxB,MAAMhB,sBAAAA,CAAuB3D,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA;AACnD,gBAAA;AAEA,gBAAA,IAAI,MAAMqD,yBAAAA,CAA0BhE,IAAAA,EAAMwB,IAAAA,CAAKb,SAAS,CAAA,EAAG;oBACzD,MAAMY,mCAAAA,CAAoCf,EAAAA,EAAIR,IAAAA,EAAMwB,IAAAA,EAAMC,SAAAA,CAAAA;gBAC5D,CAAA,MAAO;oBACL,MAAMa,oBAAAA,CAAqB9B,EAAAA,EAAIR,IAAAA,EAAMwB,IAAAA,EAAMC,SAAAA,CAAAA;AAC7C,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA,CAAA;IACA,MAAMoD,IAAAA,CAAAA,GAAAA;AACJ,QAAA,MAAM,IAAIC,KAAAA,CAAM,iBAAA,CAAA;AAClB,IAAA;AACF;;;;"}

package/dist/migrations/internal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"internal.d.ts","sourceRoot":"","sources":["../../src/migrations/internal.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,yBAAyB,EAAa,MAAM,UAAU,CAAC;AACrE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC;AAEnC,eAAO,MAAM,+BAA+B,GAAI,IAAI,QAAQ,KAAG,yBAmC9D,CAAC"}
+{"version":3,"file":"internal.d.ts","sourceRoot":"","sources":["../../src/migrations/internal.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,yBAAyB,EAAa,MAAM,UAAU,CAAC;AACrE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC;AAEnC,eAAO,MAAM,+BAA+B,GAAI,IAAI,QAAQ,KAAG,yBAkC9D,CAAC"}

package/dist/migrations/internal.js

@@ -20,8 +20,7 @@ const createInternalMigrationProvider = (db)=>{
         }),
         logger: {
             info (message) {
-                // NOTE: only log internal migration in debug mode
-                db.logger.debug(logger.transformLogMessage('info', message));
+                db.logger.info(logger.transformLogMessage('info', message));
             }
         },
         getMigrations: async ()=>migrations.map((migration)=>({

package/dist/migrations/internal.js.map

@@ -1 +1 @@
-{"version":3,"file":"internal.js","sources":["../../src/migrations/internal.ts"],"sourcesContent":["import { wrapTransaction } from './common';\nimport { createMigrationRunner } from './runner';\nimport { internalMigrations } from './internal-migrations';\nimport { createStorage } from './storage';\nimport { transformLogMessage } from './logger';\n\nimport type { InternalMigrationProvider, Migration } from './common';\nimport type { Database } from '..';\n\nexport const createInternalMigrationProvider = (db: Database): InternalMigrationProvider => {\n  const context = { db };\n  const migrations: Migration[] = [...internalMigrations];\n\n  const runner = createMigrationRunner({\n    storage: createStorage({ db, tableName: 'strapi_migrations_internal' }),\n    logger: {\n      info(message) {\n        // NOTE: only log internal migration in debug mode\n        db.logger.debug(transformLogMessage('info', message));\n      },\n    },\n    getMigrations: async () =>\n      migrations.map((migration) => ({\n        name: migration.name,\n        up: wrapTransaction(context.db)(migration.up),\n        down: wrapTransaction(context.db)(migration.down),\n      })),\n  });\n\n  return {\n    async register(migration: Migration) {\n      migrations.push(migration);\n    },\n    async shouldRun() {\n      const pendingMigrations = await runner.pending();\n      return pendingMigrations.length > 0;\n    },\n    async up() {\n      await runner.up();\n    },\n    async down() {\n      await runner.down();\n    },\n  };\n};\n"],"names":["createInternalMigrationProvider","db","context","migrations","internalMigrations","runner","createMigrationRunner","storage","createStorage","tableName","logger","info","message","debug","transformLogMessage","getMigrations","map","migration","name","up","wrapTransaction","down","register","push","shouldRun","pendingMigrations","pending","length"],"mappings":";;;;;;;;AASO,MAAMA,kCAAkC,CAACC,EAAAA,GAAAA;AAC9C,IAAA,MAAMC,OAAAA,GAAU;AAAED,QAAAA;AAAG,KAAA;AACrB,IAAA,MAAME,UAAAA,GAA0B;AAAIC,QAAAA,GAAAA;AAAmB,KAAA;AAEvD,IAAA,MAAMC,WAASC,4BAAAA,CAAsB;AACnCC,QAAAA,OAAAA,EAASC,qBAAAA,CAAc;AAAEP,YAAAA,EAAAA;YAAIQ,SAAAA,EAAW;AAA6B,SAAA,CAAA;QACrEC,MAAAA,EAAQ;AACNC,YAAAA,IAAAA,CAAAA,CAAKC,OAAO,EAAA;;AAEVX,gBAAAA,EAAAA,CAAGS,MAAM,CAACG,KAAK,CAACC,2BAAoB,MAAA,EAAQF,OAAAA,CAAAA,CAAAA;AAC9C,YAAA;AACF,SAAA;AACAG,QAAAA,aAAAA,EAAe,UACbZ,UAAAA,CAAWa,GAAG,CAAC,CAACC,aAAe;AAC7BC,oBAAAA,IAAAA,EAAMD,UAAUC,IAAI;AACpBC,oBAAAA,EAAAA,EAAIC,sBAAAA,CAAgBlB,OAAAA,CAAQD,EAAE,CAAA,CAAEgB,UAAUE,EAAE,CAAA;AAC5CE,oBAAAA,IAAAA,EAAMD,sBAAAA,CAAgBlB,OAAAA,CAAQD,EAAE,CAAA,CAAEgB,UAAUI,IAAI;iBAClD,CAAA;AACJ,KAAA,CAAA;IAEA,OAAO;AACL,QAAA,MAAMC,UAASL,SAAoB,EAAA;AACjCd,YAAAA,UAAAA,CAAWoB,IAAI,CAACN,SAAAA,CAAAA;AAClB,QAAA,CAAA;QACA,MAAMO,SAAAA,CAAAA,GAAAA;YACJ,MAAMC,iBAAAA,GAAoB,MAAMpB,QAAAA,CAAOqB,OAAO,EAAA;YAC9C,OAAOD,iBAAAA,CAAkBE,MAAM,GAAG,CAAA;AACpC,QAAA,CAAA;QACA,MAAMR,EAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMd,SAAOc,EAAE,EAAA;AACjB,QAAA,CAAA;QACA,MAAME,IAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMhB,SAAOgB,IAAI,EAAA;AACnB,QAAA;AACF,KAAA;AACF;;;;"}
+{"version":3,"file":"internal.js","sources":["../../src/migrations/internal.ts"],"sourcesContent":["import { wrapTransaction } from './common';\nimport { createMigrationRunner } from './runner';\nimport { internalMigrations } from './internal-migrations';\nimport { createStorage } from './storage';\nimport { transformLogMessage } from './logger';\n\nimport type { InternalMigrationProvider, Migration } from './common';\nimport type { Database } from '..';\n\nexport const createInternalMigrationProvider = (db: Database): InternalMigrationProvider => {\n  const context = { db };\n  const migrations: Migration[] = [...internalMigrations];\n\n  const runner = createMigrationRunner({\n    storage: createStorage({ db, tableName: 'strapi_migrations_internal' }),\n    logger: {\n      info(message) {\n        db.logger.info(transformLogMessage('info', message));\n      },\n    },\n    getMigrations: async () =>\n      migrations.map((migration) => ({\n        name: migration.name,\n        up: wrapTransaction(context.db)(migration.up),\n        down: wrapTransaction(context.db)(migration.down),\n      })),\n  });\n\n  return {\n    async register(migration: Migration) {\n      migrations.push(migration);\n    },\n    async shouldRun() {\n      const pendingMigrations = await runner.pending();\n      return pendingMigrations.length > 0;\n    },\n    async up() {\n      await runner.up();\n    },\n    async down() {\n      await runner.down();\n    },\n  };\n};\n"],"names":["createInternalMigrationProvider","db","context","migrations","internalMigrations","runner","createMigrationRunner","storage","createStorage","tableName","logger","info","message","transformLogMessage","getMigrations","map","migration","name","up","wrapTransaction","down","register","push","shouldRun","pendingMigrations","pending","length"],"mappings":";;;;;;;;AASO,MAAMA,kCAAkC,CAACC,EAAAA,GAAAA;AAC9C,IAAA,MAAMC,OAAAA,GAAU;AAAED,QAAAA;AAAG,KAAA;AACrB,IAAA,MAAME,UAAAA,GAA0B;AAAIC,QAAAA,GAAAA;AAAmB,KAAA;AAEvD,IAAA,MAAMC,WAASC,4BAAAA,CAAsB;AACnCC,QAAAA,OAAAA,EAASC,qBAAAA,CAAc;AAAEP,YAAAA,EAAAA;YAAIQ,SAAAA,EAAW;AAA6B,SAAA,CAAA;QACrEC,MAAAA,EAAQ;AACNC,YAAAA,IAAAA,CAAAA,CAAKC,OAAO,EAAA;AACVX,gBAAAA,EAAAA,CAAGS,MAAM,CAACC,IAAI,CAACE,2BAAoB,MAAA,EAAQD,OAAAA,CAAAA,CAAAA;AAC7C,YAAA;AACF,SAAA;AACAE,QAAAA,aAAAA,EAAe,UACbX,UAAAA,CAAWY,GAAG,CAAC,CAACC,aAAe;AAC7BC,oBAAAA,IAAAA,EAAMD,UAAUC,IAAI;AACpBC,oBAAAA,EAAAA,EAAIC,sBAAAA,CAAgBjB,OAAAA,CAAQD,EAAE,CAAA,CAAEe,UAAUE,EAAE,CAAA;AAC5CE,oBAAAA,IAAAA,EAAMD,sBAAAA,CAAgBjB,OAAAA,CAAQD,EAAE,CAAA,CAAEe,UAAUI,IAAI;iBAClD,CAAA;AACJ,KAAA,CAAA;IAEA,OAAO;AACL,QAAA,MAAMC,UAASL,SAAoB,EAAA;AACjCb,YAAAA,UAAAA,CAAWmB,IAAI,CAACN,SAAAA,CAAAA;AAClB,QAAA,CAAA;QACA,MAAMO,SAAAA,CAAAA,GAAAA;YACJ,MAAMC,iBAAAA,GAAoB,MAAMnB,QAAAA,CAAOoB,OAAO,EAAA;YAC9C,OAAOD,iBAAAA,CAAkBE,MAAM,GAAG,CAAA;AACpC,QAAA,CAAA;QACA,MAAMR,EAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMb,SAAOa,EAAE,EAAA;AACjB,QAAA,CAAA;QACA,MAAME,IAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMf,SAAOe,IAAI,EAAA;AACnB,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/migrations/internal.mjs

@@ -18,8 +18,7 @@ const createInternalMigrationProvider = (db)=>{
         }),
         logger: {
             info (message) {
-                // NOTE: only log internal migration in debug mode
-                db.logger.debug(transformLogMessage('info', message));
+                db.logger.info(transformLogMessage('info', message));
             }
         },
         getMigrations: async ()=>migrations.map((migration)=>({

package/dist/migrations/internal.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"internal.mjs","sources":["../../src/migrations/internal.ts"],"sourcesContent":["import { wrapTransaction } from './common';\nimport { createMigrationRunner } from './runner';\nimport { internalMigrations } from './internal-migrations';\nimport { createStorage } from './storage';\nimport { transformLogMessage } from './logger';\n\nimport type { InternalMigrationProvider, Migration } from './common';\nimport type { Database } from '..';\n\nexport const createInternalMigrationProvider = (db: Database): InternalMigrationProvider => {\n  const context = { db };\n  const migrations: Migration[] = [...internalMigrations];\n\n  const runner = createMigrationRunner({\n    storage: createStorage({ db, tableName: 'strapi_migrations_internal' }),\n    logger: {\n      info(message) {\n        // NOTE: only log internal migration in debug mode\n        db.logger.debug(transformLogMessage('info', message));\n      },\n    },\n    getMigrations: async () =>\n      migrations.map((migration) => ({\n        name: migration.name,\n        up: wrapTransaction(context.db)(migration.up),\n        down: wrapTransaction(context.db)(migration.down),\n      })),\n  });\n\n  return {\n    async register(migration: Migration) {\n      migrations.push(migration);\n    },\n    async shouldRun() {\n      const pendingMigrations = await runner.pending();\n      return pendingMigrations.length > 0;\n    },\n    async up() {\n      await runner.up();\n    },\n    async down() {\n      await runner.down();\n    },\n  };\n};\n"],"names":["createInternalMigrationProvider","db","context","migrations","internalMigrations","runner","createMigrationRunner","storage","createStorage","tableName","logger","info","message","debug","transformLogMessage","getMigrations","map","migration","name","up","wrapTransaction","down","register","push","shouldRun","pendingMigrations","pending","length"],"mappings":";;;;;;AASO,MAAMA,kCAAkC,CAACC,EAAAA,GAAAA;AAC9C,IAAA,MAAMC,OAAAA,GAAU;AAAED,QAAAA;AAAG,KAAA;AACrB,IAAA,MAAME,UAAAA,GAA0B;AAAIC,QAAAA,GAAAA;AAAmB,KAAA;AAEvD,IAAA,MAAMC,SAASC,qBAAAA,CAAsB;AACnCC,QAAAA,OAAAA,EAASC,aAAAA,CAAc;AAAEP,YAAAA,EAAAA;YAAIQ,SAAAA,EAAW;AAA6B,SAAA,CAAA;QACrEC,MAAAA,EAAQ;AACNC,YAAAA,IAAAA,CAAAA,CAAKC,OAAO,EAAA;;AAEVX,gBAAAA,EAAAA,CAAGS,MAAM,CAACG,KAAK,CAACC,oBAAoB,MAAA,EAAQF,OAAAA,CAAAA,CAAAA;AAC9C,YAAA;AACF,SAAA;AACAG,QAAAA,aAAAA,EAAe,UACbZ,UAAAA,CAAWa,GAAG,CAAC,CAACC,aAAe;AAC7BC,oBAAAA,IAAAA,EAAMD,UAAUC,IAAI;AACpBC,oBAAAA,EAAAA,EAAIC,eAAAA,CAAgBlB,OAAAA,CAAQD,EAAE,CAAA,CAAEgB,UAAUE,EAAE,CAAA;AAC5CE,oBAAAA,IAAAA,EAAMD,eAAAA,CAAgBlB,OAAAA,CAAQD,EAAE,CAAA,CAAEgB,UAAUI,IAAI;iBAClD,CAAA;AACJ,KAAA,CAAA;IAEA,OAAO;AACL,QAAA,MAAMC,UAASL,SAAoB,EAAA;AACjCd,YAAAA,UAAAA,CAAWoB,IAAI,CAACN,SAAAA,CAAAA;AAClB,QAAA,CAAA;QACA,MAAMO,SAAAA,CAAAA,GAAAA;YACJ,MAAMC,iBAAAA,GAAoB,MAAMpB,MAAAA,CAAOqB,OAAO,EAAA;YAC9C,OAAOD,iBAAAA,CAAkBE,MAAM,GAAG,CAAA;AACpC,QAAA,CAAA;QACA,MAAMR,EAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMd,OAAOc,EAAE,EAAA;AACjB,QAAA,CAAA;QACA,MAAME,IAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMhB,OAAOgB,IAAI,EAAA;AACnB,QAAA;AACF,KAAA;AACF;;;;"}
+{"version":3,"file":"internal.mjs","sources":["../../src/migrations/internal.ts"],"sourcesContent":["import { wrapTransaction } from './common';\nimport { createMigrationRunner } from './runner';\nimport { internalMigrations } from './internal-migrations';\nimport { createStorage } from './storage';\nimport { transformLogMessage } from './logger';\n\nimport type { InternalMigrationProvider, Migration } from './common';\nimport type { Database } from '..';\n\nexport const createInternalMigrationProvider = (db: Database): InternalMigrationProvider => {\n  const context = { db };\n  const migrations: Migration[] = [...internalMigrations];\n\n  const runner = createMigrationRunner({\n    storage: createStorage({ db, tableName: 'strapi_migrations_internal' }),\n    logger: {\n      info(message) {\n        db.logger.info(transformLogMessage('info', message));\n      },\n    },\n    getMigrations: async () =>\n      migrations.map((migration) => ({\n        name: migration.name,\n        up: wrapTransaction(context.db)(migration.up),\n        down: wrapTransaction(context.db)(migration.down),\n      })),\n  });\n\n  return {\n    async register(migration: Migration) {\n      migrations.push(migration);\n    },\n    async shouldRun() {\n      const pendingMigrations = await runner.pending();\n      return pendingMigrations.length > 0;\n    },\n    async up() {\n      await runner.up();\n    },\n    async down() {\n      await runner.down();\n    },\n  };\n};\n"],"names":["createInternalMigrationProvider","db","context","migrations","internalMigrations","runner","createMigrationRunner","storage","createStorage","tableName","logger","info","message","transformLogMessage","getMigrations","map","migration","name","up","wrapTransaction","down","register","push","shouldRun","pendingMigrations","pending","length"],"mappings":";;;;;;AASO,MAAMA,kCAAkC,CAACC,EAAAA,GAAAA;AAC9C,IAAA,MAAMC,OAAAA,GAAU;AAAED,QAAAA;AAAG,KAAA;AACrB,IAAA,MAAME,UAAAA,GAA0B;AAAIC,QAAAA,GAAAA;AAAmB,KAAA;AAEvD,IAAA,MAAMC,SAASC,qBAAAA,CAAsB;AACnCC,QAAAA,OAAAA,EAASC,aAAAA,CAAc;AAAEP,YAAAA,EAAAA;YAAIQ,SAAAA,EAAW;AAA6B,SAAA,CAAA;QACrEC,MAAAA,EAAQ;AACNC,YAAAA,IAAAA,CAAAA,CAAKC,OAAO,EAAA;AACVX,gBAAAA,EAAAA,CAAGS,MAAM,CAACC,IAAI,CAACE,oBAAoB,MAAA,EAAQD,OAAAA,CAAAA,CAAAA;AAC7C,YAAA;AACF,SAAA;AACAE,QAAAA,aAAAA,EAAe,UACbX,UAAAA,CAAWY,GAAG,CAAC,CAACC,aAAe;AAC7BC,oBAAAA,IAAAA,EAAMD,UAAUC,IAAI;AACpBC,oBAAAA,EAAAA,EAAIC,eAAAA,CAAgBjB,OAAAA,CAAQD,EAAE,CAAA,CAAEe,UAAUE,EAAE,CAAA;AAC5CE,oBAAAA,IAAAA,EAAMD,eAAAA,CAAgBjB,OAAAA,CAAQD,EAAE,CAAA,CAAEe,UAAUI,IAAI;iBAClD,CAAA;AACJ,KAAA,CAAA;IAEA,OAAO;AACL,QAAA,MAAMC,UAASL,SAAoB,EAAA;AACjCb,YAAAA,UAAAA,CAAWmB,IAAI,CAACN,SAAAA,CAAAA;AAClB,QAAA,CAAA;QACA,MAAMO,SAAAA,CAAAA,GAAAA;YACJ,MAAMC,iBAAAA,GAAoB,MAAMnB,MAAAA,CAAOoB,OAAO,EAAA;YAC9C,OAAOD,iBAAAA,CAAkBE,MAAM,GAAG,CAAA;AACpC,QAAA,CAAA;QACA,MAAMR,EAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMb,OAAOa,EAAE,EAAA;AACjB,QAAA,CAAA;QACA,MAAME,IAAAA,CAAAA,GAAAA;AACJ,YAAA,MAAMf,OAAOe,IAAI,EAAA;AACnB,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/migrations/logger.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/migrations/logger.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,mBAAmB,GAAI,OAAO,MAAM,EAAE,SAAS,OAAO;;;;;;;;CAiBlE,CAAC"}
+{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/migrations/logger.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,mBAAmB,GAAI,OAAO,MAAM,EAAE,SAAS,OAAO;;;;;;;;CAwBlE,CAAC"}

package/dist/migrations/logger.js

@@ -9,9 +9,14 @@ const transformLogMessage = (level, message)=>{
     }
     if (typeof message === 'object' && message !== null) {
         if ('event' in message && 'name' in message) {
+            const { event, name, durationSeconds } = message;
+            let text = `[internal migration]: ${event} ${name}`;
+            if (typeof durationSeconds === 'number' && Number.isFinite(durationSeconds)) {
+                text += ` (${durationSeconds.toFixed(3)}s)`;
+            }
             return {
                 level,
-                message: `[internal migration]: ${message.event} ${message?.name}`,
+                message: text,
                 timestamp: Date.now()
             };
         }

package/dist/migrations/logger.js.map

@@ -1 +1 @@
-{"version":3,"file":"logger.js","sources":["../../src/migrations/logger.ts"],"sourcesContent":["export const transformLogMessage = (level: string, message: unknown) => {\n  if (typeof message === 'string') {\n    return { level, message };\n  }\n\n  if (typeof message === 'object' && message !== null) {\n    if ('event' in message && 'name' in message) {\n      return {\n        level,\n        message: `[internal migration]: ${message.event} ${message?.name}`,\n        timestamp: Date.now(),\n      };\n    }\n  }\n\n  // NOTE: the message typing are too loose so in practice we should never arrive here.\n  return '';\n};\n"],"names":["transformLogMessage","level","message","event","name","timestamp","Date","now"],"mappings":";;AAAO,MAAMA,mBAAAA,GAAsB,CAACC,KAAAA,EAAeC,OAAAA,GAAAA;IACjD,IAAI,OAAOA,YAAY,QAAA,EAAU;QAC/B,OAAO;AAAED,YAAAA,KAAAA;AAAOC,YAAAA;AAAQ,SAAA;AAC1B,IAAA;AAEA,IAAA,IAAI,OAAOA,OAAAA,KAAY,QAAA,IAAYA,OAAAA,KAAY,IAAA,EAAM;QACnD,IAAI,OAAA,IAAWA,OAAAA,IAAW,MAAA,IAAUA,OAAAA,EAAS;YAC3C,OAAO;AACLD,gBAAAA,KAAAA;gBACAC,OAAAA,EAAS,CAAC,sBAAsB,EAAEA,OAAAA,CAAQC,KAAK,CAAC,CAAC,EAAED,OAAAA,EAASE,IAAAA,CAAAA,CAAM;AAClEC,gBAAAA,SAAAA,EAAWC,KAAKC,GAAG;AACrB,aAAA;AACF,QAAA;AACF,IAAA;;IAGA,OAAO,EAAA;AACT;;;;"}
+{"version":3,"file":"logger.js","sources":["../../src/migrations/logger.ts"],"sourcesContent":["type MigrationLogEvent = {\n  event: unknown;\n  name: unknown;\n  durationSeconds?: unknown;\n};\n\nexport const transformLogMessage = (level: string, message: unknown) => {\n  if (typeof message === 'string') {\n    return { level, message };\n  }\n\n  if (typeof message === 'object' && message !== null) {\n    if ('event' in message && 'name' in message) {\n      const { event, name, durationSeconds } = message as MigrationLogEvent;\n      let text = `[internal migration]: ${event} ${name}`;\n\n      if (typeof durationSeconds === 'number' && Number.isFinite(durationSeconds)) {\n        text += ` (${durationSeconds.toFixed(3)}s)`;\n      }\n\n      return {\n        level,\n        message: text,\n        timestamp: Date.now(),\n      };\n    }\n  }\n\n  // NOTE: the message typing are too loose so in practice we should never arrive here.\n  return '';\n};\n"],"names":["transformLogMessage","level","message","event","name","durationSeconds","text","Number","isFinite","toFixed","timestamp","Date","now"],"mappings":";;AAMO,MAAMA,mBAAAA,GAAsB,CAACC,KAAAA,EAAeC,OAAAA,GAAAA;IACjD,IAAI,OAAOA,YAAY,QAAA,EAAU;QAC/B,OAAO;AAAED,YAAAA,KAAAA;AAAOC,YAAAA;AAAQ,SAAA;AAC1B,IAAA;AAEA,IAAA,IAAI,OAAOA,OAAAA,KAAY,QAAA,IAAYA,OAAAA,KAAY,IAAA,EAAM;QACnD,IAAI,OAAA,IAAWA,OAAAA,IAAW,MAAA,IAAUA,OAAAA,EAAS;AAC3C,YAAA,MAAM,EAAEC,KAAK,EAAEC,IAAI,EAAEC,eAAe,EAAE,GAAGH,OAAAA;AACzC,YAAA,IAAII,OAAO,CAAC,sBAAsB,EAAEH,KAAAA,CAAM,CAAC,EAAEC,IAAAA,CAAAA,CAAM;AAEnD,YAAA,IAAI,OAAOC,eAAAA,KAAoB,QAAA,IAAYE,MAAAA,CAAOC,QAAQ,CAACH,eAAAA,CAAAA,EAAkB;gBAC3EC,IAAAA,IAAQ,CAAC,EAAE,EAAED,eAAAA,CAAgBI,OAAO,CAAC,CAAA,CAAA,CAAG,EAAE,CAAC;AAC7C,YAAA;YAEA,OAAO;AACLR,gBAAAA,KAAAA;gBACAC,OAAAA,EAASI,IAAAA;AACTI,gBAAAA,SAAAA,EAAWC,KAAKC,GAAG;AACrB,aAAA;AACF,QAAA;AACF,IAAA;;IAGA,OAAO,EAAA;AACT;;;;"}

package/dist/migrations/logger.mjs

@@ -7,9 +7,14 @@ const transformLogMessage = (level, message)=>{
     }
     if (typeof message === 'object' && message !== null) {
         if ('event' in message && 'name' in message) {
+            const { event, name, durationSeconds } = message;
+            let text = `[internal migration]: ${event} ${name}`;
+            if (typeof durationSeconds === 'number' && Number.isFinite(durationSeconds)) {
+                text += ` (${durationSeconds.toFixed(3)}s)`;
+            }
             return {
                 level,
-                message: `[internal migration]: ${message.event} ${message?.name}`,
+                message: text,
                 timestamp: Date.now()
             };
         }

package/dist/migrations/logger.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"logger.mjs","sources":["../../src/migrations/logger.ts"],"sourcesContent":["export const transformLogMessage = (level: string, message: unknown) => {\n  if (typeof message === 'string') {\n    return { level, message };\n  }\n\n  if (typeof message === 'object' && message !== null) {\n    if ('event' in message && 'name' in message) {\n      return {\n        level,\n        message: `[internal migration]: ${message.event} ${message?.name}`,\n        timestamp: Date.now(),\n      };\n    }\n  }\n\n  // NOTE: the message typing are too loose so in practice we should never arrive here.\n  return '';\n};\n"],"names":["transformLogMessage","level","message","event","name","timestamp","Date","now"],"mappings":"AAAO,MAAMA,mBAAAA,GAAsB,CAACC,KAAAA,EAAeC,OAAAA,GAAAA;IACjD,IAAI,OAAOA,YAAY,QAAA,EAAU;QAC/B,OAAO;AAAED,YAAAA,KAAAA;AAAOC,YAAAA;AAAQ,SAAA;AAC1B,IAAA;AAEA,IAAA,IAAI,OAAOA,OAAAA,KAAY,QAAA,IAAYA,OAAAA,KAAY,IAAA,EAAM;QACnD,IAAI,OAAA,IAAWA,OAAAA,IAAW,MAAA,IAAUA,OAAAA,EAAS;YAC3C,OAAO;AACLD,gBAAAA,KAAAA;gBACAC,OAAAA,EAAS,CAAC,sBAAsB,EAAEA,OAAAA,CAAQC,KAAK,CAAC,CAAC,EAAED,OAAAA,EAASE,IAAAA,CAAAA,CAAM;AAClEC,gBAAAA,SAAAA,EAAWC,KAAKC,GAAG;AACrB,aAAA;AACF,QAAA;AACF,IAAA;;IAGA,OAAO,EAAA;AACT;;;;"}
+{"version":3,"file":"logger.mjs","sources":["../../src/migrations/logger.ts"],"sourcesContent":["type MigrationLogEvent = {\n  event: unknown;\n  name: unknown;\n  durationSeconds?: unknown;\n};\n\nexport const transformLogMessage = (level: string, message: unknown) => {\n  if (typeof message === 'string') {\n    return { level, message };\n  }\n\n  if (typeof message === 'object' && message !== null) {\n    if ('event' in message && 'name' in message) {\n      const { event, name, durationSeconds } = message as MigrationLogEvent;\n      let text = `[internal migration]: ${event} ${name}`;\n\n      if (typeof durationSeconds === 'number' && Number.isFinite(durationSeconds)) {\n        text += ` (${durationSeconds.toFixed(3)}s)`;\n      }\n\n      return {\n        level,\n        message: text,\n        timestamp: Date.now(),\n      };\n    }\n  }\n\n  // NOTE: the message typing are too loose so in practice we should never arrive here.\n  return '';\n};\n"],"names":["transformLogMessage","level","message","event","name","durationSeconds","text","Number","isFinite","toFixed","timestamp","Date","now"],"mappings":"AAMO,MAAMA,mBAAAA,GAAsB,CAACC,KAAAA,EAAeC,OAAAA,GAAAA;IACjD,IAAI,OAAOA,YAAY,QAAA,EAAU;QAC/B,OAAO;AAAED,YAAAA,KAAAA;AAAOC,YAAAA;AAAQ,SAAA;AAC1B,IAAA;AAEA,IAAA,IAAI,OAAOA,OAAAA,KAAY,QAAA,IAAYA,OAAAA,KAAY,IAAA,EAAM;QACnD,IAAI,OAAA,IAAWA,OAAAA,IAAW,MAAA,IAAUA,OAAAA,EAAS;AAC3C,YAAA,MAAM,EAAEC,KAAK,EAAEC,IAAI,EAAEC,eAAe,EAAE,GAAGH,OAAAA;AACzC,YAAA,IAAII,OAAO,CAAC,sBAAsB,EAAEH,KAAAA,CAAM,CAAC,EAAEC,IAAAA,CAAAA,CAAM;AAEnD,YAAA,IAAI,OAAOC,eAAAA,KAAoB,QAAA,IAAYE,MAAAA,CAAOC,QAAQ,CAACH,eAAAA,CAAAA,EAAkB;gBAC3EC,IAAAA,IAAQ,CAAC,EAAE,EAAED,eAAAA,CAAgBI,OAAO,CAAC,CAAA,CAAA,CAAG,EAAE,CAAC;AAC7C,YAAA;YAEA,OAAO;AACLR,gBAAAA,KAAAA;gBACAC,OAAAA,EAASI,IAAAA;AACTI,gBAAAA,SAAAA,EAAWC,KAAKC,GAAG;AACrB,aAAA;AACF,QAAA;AACF,IAAA;;IAGA,OAAO,EAAA;AACT;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@strapi/database",
-  "version": "5.52.1",
+  "version": "5.52.2",
   "description": "Strapi's database layer",
   "homepage": "https://strapi.io",
   "bugs": {
@@ -46,7 +46,7 @@
   },
   "dependencies": {
     "@paralleldrive/cuid2": "2.2.2",
-    "@strapi/utils": "5.52.1",
+    "@strapi/utils": "5.52.2",
     "ajv": "8.20.0",
     "date-fns": "2.30.0",
     "debug": "4.3.4",
@@ -59,11 +59,11 @@
     "@types/fs-extra": "11.0.4",
     "@types/jest": "29.5.2",
     "@types/node": "20.19.41",
-    "eslint-config-custom": "5.52.1",
+    "eslint-config-custom": "5.52.2",
     "jest": "29.6.0",
-    "tsconfig": "5.52.1",
+    "tsconfig": "5.52.2",
     "vitest": "catalog:",
-    "vitest-config": "5.52.1"
+    "vitest-config": "5.52.2"
   },
   "engines": {
     "node": ">=20.0.0 <=26.x.x",