@strapi/database 5.50.0 → 5.50.2

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

@@ -1 +1 @@
-{"version":3,"file":"regular-relations.js","sources":["../../src/entity-manager/regular-relations.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-namespace */\nimport { map, isEmpty } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport {\n  isBidirectional,\n  isOneToAny,\n  isManyToAny,\n  isAnyToOne,\n  hasOrderColumn,\n  hasInverseOrderColumn,\n} from '../metadata';\nimport { createQueryBuilder } from '../query';\nimport { addSchema } from '../utils/knex';\nimport type { Database } from '..';\nimport type { ID, Relation, Model } from '../types';\n\ndeclare module 'knex' {\n  namespace Knex {\n    interface ChainableInterface {\n      transacting(trx?: Knex.Transaction): this;\n    }\n  }\n}\n\n//  TODO: This is a short term solution, to not steal relations from the same document.\nconst getDocumentSiblingIdsQuery = (tableName: string, id: ID) => {\n  // Find if the model is a content type or something else (e.g. component)\n  // to only get the documentId if it's a content type\n  const models: Model[] = Array.from(strapi.db.metadata.values());\n\n  const isContentType = models.find((model) => {\n    return model.tableName === tableName && model.attributes.documentId;\n  });\n\n  if (!isContentType) {\n    return [id];\n  }\n\n  // NOTE: SubQueries are wrapped in a function to not reuse the same connection,\n  // which causes infinite self references\n  return function (query) {\n    query\n      .select('id')\n      .from(tableName)\n      // Get all child ids of the document id\n      .whereIn('document_id', (documentIDSubQuery) => {\n        documentIDSubQuery\n          .from(tableName)\n          // get document id related to the current id\n          .select('document_id')\n          .where('id', id);\n      });\n  } satisfies Knex.QueryCallback;\n};\n\n/**\n * If some relations currently exist for this oneToX relation, on the one side, this function removes them and update the inverse order if needed.\n */\nconst deletePreviousOneToAnyRelations = async ({\n  id,\n  attribute,\n  relIdsToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdsToadd: ID[];\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  if (!(isBidirectional(attribute) && isOneToAny(attribute))) {\n    throw new Error(\n      'deletePreviousOneToAnyRelations can only be called for bidirectional oneToAny relations'\n    );\n  }\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n\n  const con = db.getConnection();\n\n  await con\n    .delete()\n    .from(joinTable.name)\n    // Exclude the ids of the current document\n    .whereNotIn(joinColumn.name, getDocumentSiblingIdsQuery(joinColumn.referencedTable!, id))\n    // Include all the ids that are being connected\n    .whereIn(inverseJoinColumn.name, relIdsToadd)\n    .where(joinTable.on || {})\n    .transacting(trx);\n\n  await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToadd, transaction: trx });\n};\n\n/**\n * If a relation currently exists for this xToOne relations, this function removes it and update the inverse order if needed.\n */\nconst deletePreviousAnyToOneRelations = async ({\n  id,\n  attribute,\n  relIdToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdToadd: ID;\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const con = db.getConnection();\n\n  if (!isAnyToOne(attribute)) {\n    throw new Error('deletePreviousAnyToOneRelations can only be called for anyToOne relations');\n  }\n  // handling manyToOne\n  if (isManyToAny(attribute)) {\n    // if the database integrity was not broken relsToDelete is supposed to be of length 1\n    const relsToDelete = await con\n      .select(inverseJoinColumn.name)\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n\n    const relIdsToDelete = map(inverseJoinColumn.name, relsToDelete);\n\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $in: relIdsToDelete },\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n\n    await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToDelete, transaction: trx });\n\n    // handling oneToOne\n  } else {\n    await con\n      .delete()\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      // Exclude the ids of the current document\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n  }\n};\n\n/**\n * Delete all or some relations of entity field\n */\nconst deleteRelations = async ({\n  id,\n  attribute,\n  db,\n  relIdsToNotDelete = [],\n  relIdsToDelete = [],\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  relIdsToNotDelete?: ID[];\n  relIdsToDelete?: ID[] | 'all';\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const all = relIdsToDelete === 'all';\n\n  if (hasOrderColumn(attribute) || hasInverseOrderColumn(attribute)) {\n    let lastId: ID = 0;\n    let done = false;\n    const batchSize = 100;\n\n    while (!done) {\n      const batchToDelete: { id: ID }[] = await createQueryBuilder(joinTable.name, db)\n        .select(inverseJoinColumn.name)\n        .where({\n          [joinColumn.name]: id,\n          id: { $gt: lastId },\n          [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n          ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n        })\n        .where(joinTable.on || {})\n        .orderBy('id')\n        .limit(batchSize)\n        .transacting(trx)\n        .execute();\n\n      done = batchToDelete.length < batchSize;\n      lastId = batchToDelete[batchToDelete.length - 1]?.id || 0;\n\n      const batchIds = map(inverseJoinColumn.name, batchToDelete);\n\n      await createQueryBuilder(joinTable.name, db)\n        .delete()\n        .where({\n          [joinColumn.name]: id,\n          [inverseJoinColumn.name]: { $in: batchIds },\n        })\n        .where(joinTable.on || {})\n        .transacting(trx)\n        .execute();\n\n      await cleanOrderColumns({ attribute, db, id, inverseRelIds: batchIds, transaction: trx });\n    }\n  } else {\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n        ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n  }\n};\n\n/**\n * Clean the order columns by ensuring the order value are continuous (ex: 1, 2, 3 and not 1, 5, 10)\n */\nconst cleanOrderColumns = async ({\n  id,\n  attribute,\n  db,\n  inverseRelIds = [],\n  transaction: trx,\n}: {\n  id?: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  inverseRelIds?: ID[];\n  transaction?: Knex.Transaction;\n}) => {\n  if (\n    !(hasOrderColumn(attribute) && id) &&\n    !(hasInverseOrderColumn(attribute) && !isEmpty(inverseRelIds))\n  ) {\n    return;\n  }\n\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn, orderColumnName, inverseOrderColumnName } = joinTable;\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :joinColumn: ORDER BY :orderColumn:) AS src_order,\n    FROM :joinTable:\n    WHERE :joinColumn: = :id\n  ) AS b\n  SET :orderColumn: = b.src_order\n  WHERE b.id = a.id;\n  */\n  const updateOrderColumn = async () => {\n    if (!hasOrderColumn(attribute) || !id) {\n      return;\n    }\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('src_order', orderColumnName, joinColumn.name)\n        .where(joinColumn.name, id)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.src_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, orderColumnName]\n          )\n          .transacting(trx);\n\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.src_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, orderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :inverseJoinColumn: ORDER BY :inverseOrderColumn:) AS inv_order\n    FROM :joinTable:\n    WHERE :inverseJoinColumn: IN (:inverseRelIds)\n  ) AS b\n  SET :inverseOrderColumn: = b.inv_order\n  WHERE b.id = a.id;\n  */\n  const updateInverseOrderColumn = async () => {\n    if (!hasInverseOrderColumn(attribute) || isEmpty(inverseRelIds)) return;\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('inv_order', inverseOrderColumnName, inverseJoinColumn.name)\n        .where(inverseJoinColumn.name, 'in', inverseRelIds)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.inv_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, inverseOrderColumnName]\n          )\n          .transacting(trx);\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.inv_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, inverseOrderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  // Run updates in a deterministic order to avoid lock cycles on the same join table.\n  await updateOrderColumn();\n  await updateInverseOrderColumn();\n};\n\nexport {\n  deletePreviousOneToAnyRelations,\n  deletePreviousAnyToOneRelations,\n  deleteRelations,\n  cleanOrderColumns,\n};\n"],"names":["getDocumentSiblingIdsQuery","tableName","id","models","Array","from","strapi","db","metadata","values","isContentType","find","model","attributes","documentId","query","select","whereIn","documentIDSubQuery","where","deletePreviousOneToAnyRelations","attribute","relIdsToadd","transaction","trx","isBidirectional","isOneToAny","Error","joinTable","joinColumn","inverseJoinColumn","con","getConnection","delete","name","whereNotIn","referencedTable","on","transacting","cleanOrderColumns","inverseRelIds","deletePreviousAnyToOneRelations","relIdToadd","isAnyToOne","isManyToAny","relsToDelete","relIdsToDelete","map","createQueryBuilder","$in","execute","deleteRelations","relIdsToNotDelete","all","hasOrderColumn","hasInverseOrderColumn","lastId","done","batchSize","batchToDelete","$gt","$notIn","orderBy","limit","length","batchIds","isEmpty","orderColumnName","inverseOrderColumnName","updateOrderColumn","selectRowsToOrder","joinTableName","connection","rowNumber","toSQL","dialect","client","raw","sql","bindings","addSchema","updateInverseOrderColumn"],"mappings":";;;;;;;;AAyBA;AACA,MAAMA,0BAAAA,GAA6B,CAACC,SAAAA,EAAmBC,EAAAA,GAAAA;;;IAGrD,MAAMC,MAAAA,GAAkBC,MAAMC,IAAI,CAACC,OAAOC,EAAE,CAACC,QAAQ,CAACC,MAAM,EAAA,CAAA;AAE5D,IAAA,MAAMC,aAAAA,GAAgBP,MAAAA,CAAOQ,IAAI,CAAC,CAACC,KAAAA,GAAAA;AACjC,QAAA,OAAOA,MAAMX,SAAS,KAAKA,aAAaW,KAAAA,CAAMC,UAAU,CAACC,UAAU;AACrE,IAAA,CAAA,CAAA;AAEA,IAAA,IAAI,CAACJ,aAAAA,EAAe;QAClB,OAAO;AAACR,YAAAA;AAAG,SAAA;AACb,IAAA;;;AAIA,IAAA,OAAO,SAAUa,KAAK,EAAA;AACpBA,QAAAA,KAAAA,CACGC,MAAM,CAAC,IAAA,CAAA,CACPX,IAAI,CAACJ,UACN;SACCgB,OAAO,CAAC,eAAe,CAACC,kBAAAA,GAAAA;YACvBA,kBAAAA,CACGb,IAAI,CAACJ,SAAAA,CACN;AACCe,aAAAA,MAAM,CAAC,aAAA,CAAA,CACPG,KAAK,CAAC,IAAA,EAAMjB,EAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AACJ,IAAA,CAAA;AACF,CAAA;AAEA;;AAEC,IACD,MAAMkB,+BAAAA,GAAkC,OAAO,EAC7ClB,EAAE,EACFmB,SAAS,EACTC,WAAW,EACXf,EAAE,EACFgB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IAAI,EAAEC,yBAAAA,CAAgBJ,SAAAA,CAAAA,IAAcK,oBAAAA,CAAWL,UAAS,CAAA,EAAI;AAC1D,QAAA,MAAM,IAAIM,KAAAA,CACR,yFAAA,CAAA;AAEJ,IAAA;IACA,MAAM,EAAEC,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAE1C,MAAMG,GAAAA,GAAMxB,GAAGyB,aAAa,EAAA;IAE5B,MAAMD,GAAAA,CACHE,MAAM,EAAA,CACN5B,IAAI,CAACuB,SAAAA,CAAUM,IAAI,CACpB;KACCC,UAAU,CAACN,WAAWK,IAAI,EAAElC,2BAA2B6B,UAAAA,CAAWO,eAAe,EAAGlC,EAAAA,CAAAA,CACrF;AACCe,KAAAA,OAAO,CAACa,iBAAAA,CAAkBI,IAAI,EAAEZ,WAAAA,CAAAA,CAChCH,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,IAAA,MAAMe,iBAAAA,CAAkB;AAAElB,QAAAA,SAAAA;AAAWd,QAAAA,EAAAA;QAAIiC,aAAAA,EAAelB,WAAAA;QAAaC,WAAAA,EAAaC;AAAI,KAAA,CAAA;AACxF;AAEA;;AAEC,IACD,MAAMiB,+BAAAA,GAAkC,OAAO,EAC7CvC,EAAE,EACFmB,SAAS,EACTqB,UAAU,EACVnC,EAAE,EACFgB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAC1C,MAAMG,GAAAA,GAAMxB,GAAGyB,aAAa,EAAA;IAE5B,IAAI,CAACW,qBAAWtB,SAAAA,CAAAA,EAAY;AAC1B,QAAA,MAAM,IAAIM,KAAAA,CAAM,2EAAA,CAAA;AAClB,IAAA;;AAEA,IAAA,IAAIiB,sBAAYvB,SAAAA,CAAAA,EAAY;;AAE1B,QAAA,MAAMwB,eAAe,MAAMd,GAAAA,CACxBf,MAAM,CAACc,kBAAkBI,IAAI,CAAA,CAC7B7B,IAAI,CAACuB,UAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,WAAWK,IAAI,EAAEhC,EAAAA,CAAAA,CACvBiC,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBlC,0BAAAA,CAA2B8B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,QAAA,MAAMsB,cAAAA,GAAiBC,KAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEW,YAAAA,CAAAA;QAEnD,MAAMG,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;YACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAEe,GAAAA,EAAKH;AAAe;SAClD,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,QAAA,MAAMX,iBAAAA,CAAkB;AAAElB,YAAAA,SAAAA;AAAWd,YAAAA,EAAAA;YAAIiC,aAAAA,EAAeM,cAAAA;YAAgBvB,WAAAA,EAAaC;AAAI,SAAA,CAAA;;IAG3F,CAAA,MAAO;AACL,QAAA,MAAMO,GAAAA,CACHE,MAAM,EAAA,CACN5B,IAAI,CAACuB,SAAAA,CAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEhC,GACxB;AACCiC,SAAAA,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBlC,0BAAAA,CAA2B8B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AACjB,IAAA;AACF;AAEA;;AAEC,UACK2B,eAAAA,GAAkB,OAAO,EAC7BjD,EAAE,EACFmB,SAAS,EACTd,EAAE,EACF6C,iBAAAA,GAAoB,EAAE,EACtBN,cAAAA,GAAiB,EAAE,EACnBvB,WAAAA,EAAaC,GAAG,EAQjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;AAC1C,IAAA,MAAMyB,MAAMP,cAAAA,KAAmB,KAAA;IAE/B,IAAIQ,wBAAAA,CAAejC,SAAAA,CAAAA,IAAckC,+BAAAA,CAAsBlC,SAAAA,CAAAA,EAAY;AACjE,QAAA,IAAImC,MAAAA,GAAa,CAAA;AACjB,QAAA,IAAIC,IAAAA,GAAO,KAAA;AACX,QAAA,MAAMC,SAAAA,GAAY,GAAA;AAElB,QAAA,MAAO,CAACD,IAAAA,CAAM;AACZ,YAAA,MAAME,aAAAA,GAA8B,MAAMX,YAAAA,CAAmBpB,SAAAA,CAAUM,IAAI,EAAE3B,EAAAA,CAAAA,CAC1ES,MAAM,CAACc,iBAAAA,CAAkBI,IAAI,CAAA,CAC7Bf,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;gBACnBA,EAAAA,EAAI;oBAAE0D,GAAAA,EAAKJ;AAAO,iBAAA;gBAClB,CAAC1B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAE2B,MAAAA,EAAQT;AAAkB,iBAAA;gBACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;oBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;wBAAEe,GAAAA,EAAKH;AAAe;;AACnE,aAAA,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvByB,OAAO,CAAC,IAAA,CAAA,CACRC,KAAK,CAACL,SAAAA,CAAAA,CACNpB,WAAW,CAACd,KACZ0B,OAAO,EAAA;YAEVO,IAAAA,GAAOE,aAAAA,CAAcK,MAAM,GAAGN,SAAAA;AAC9BF,YAAAA,MAAAA,GAASG,aAAa,CAACA,aAAAA,CAAcK,MAAM,GAAG,CAAA,CAAE,EAAE9D,EAAAA,IAAM,CAAA;AAExD,YAAA,MAAM+D,QAAAA,GAAWlB,KAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEyB,aAAAA,CAAAA;YAE7C,MAAMX,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;gBACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKgB;AAAS;aAC5C,CAAA,CACC9C,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,YAAA,MAAMX,iBAAAA,CAAkB;AAAElB,gBAAAA,SAAAA;AAAWd,gBAAAA,EAAAA;AAAIL,gBAAAA,EAAAA;gBAAIsC,aAAAA,EAAeyB,QAAAA;gBAAU1C,WAAAA,EAAaC;AAAI,aAAA,CAAA;AACzF,QAAA;IACF,CAAA,MAAO;QACL,MAAMwB,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;YACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAE2B,MAAAA,EAAQT;AAAkB,aAAA;YACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;gBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKH;AAAe;;SACnE,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AACZ,IAAA;AACF;AAEA;;AAEC,IACD,MAAMX,iBAAAA,GAAoB,OAAO,EAC/BrC,EAAE,EACFmB,SAAS,EACTd,EAAE,EACFiC,aAAAA,GAAgB,EAAE,EAClBjB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IACE,EAAE8B,wBAAAA,CAAejC,SAAAA,CAAAA,IAAcnB,EAAC,CAAA,IAChC,EAAEqD,+BAAAA,CAAsBlC,SAAAA,CAAAA,IAAc,CAAC6C,SAAAA,CAAQ1B,cAAa,CAAA,EAC5D;AACA,QAAA;AACF,IAAA;IAEA,MAAM,EAAEZ,SAAS,EAAE,GAAGP,SAAAA;IACtB,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAEqC,eAAe,EAAEC,sBAAsB,EAAE,GAAGxC,SAAAA;AAEnF;;;;;;;;;;;AAWA,KACA,MAAMyC,iBAAAA,GAAoB,UAAA;AACxB,QAAA,IAAI,CAACf,wBAAAA,CAAejC,SAAAA,CAAAA,IAAc,CAACnB,EAAAA,EAAI;AACrC,YAAA;AACF,QAAA;QAEA,MAAMoE,iBAAAA,GAAoB,CAACC,aAAAA,GACzBhE,EAAAA,CACGiE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,WAAA,EAAaN,eAAAA,EAAiBtC,UAAAA,CAAWK,IAAI,CAAA,CACvDf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEhC,EAAAA,CAAAA,CACvBwE,KAAK,EAAA;AAEV,QAAA,OAAQpE,MAAAA,CAAOC,EAAE,CAACoE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM3B,EAAAA,CACHyB,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEZ,wBAAAA;AAAgB,qBAAA,CAAA,CAEtD7B,WAAW,CAACd,GAAAA,CAAAA;AAEf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,cAAAA,CAAUzE,EAAAA,EAAIqB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMhE,EAAAA,CAAGiE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeJ,wBAAAA,eAAAA;AAAoBnD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAErDzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;AAEA;;;;;;;;;;;AAWA,KACA,MAAMyD,wBAAAA,GAA2B,UAAA;AAC/B,QAAA,IAAI,CAAC1B,+BAAAA,CAAsBlC,SAAAA,CAAAA,IAAc6C,SAAAA,CAAQ1B,aAAAA,CAAAA,EAAgB;QAEjE,MAAM8B,iBAAAA,GAAoB,CAACC,aAAAA,GACzBhE,EAAAA,CACGiE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,aAAaL,sBAAAA,EAAwBtC,iBAAAA,CAAkBI,IAAI,CAAA,CACrEf,KAAK,CAACW,kBAAkBI,IAAI,EAAE,IAAA,EAAMM,aAAAA,CAAAA,CACpCkC,KAAK,EAAA;AAEV,QAAA,OAAQpE,MAAAA,CAAOC,EAAE,CAACoE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM3B,EAAAA,CACHyB,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEX,wBAAAA;AAAuB,qBAAA,CAAA,CAE7D9B,WAAW,CAACd,GAAAA,CAAAA;AACf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,cAAAA,CAAUzE,EAAAA,EAAIqB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMhE,EAAAA,CAAGiE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeH,wBAAAA,sBAAAA;AAA2BpD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAE5DzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;;IAGA,MAAM6C,iBAAAA,EAAAA;IACN,MAAMY,wBAAAA,EAAAA;AACR;;;;;;;"}
+{"version":3,"file":"regular-relations.js","sources":["../../src/entity-manager/regular-relations.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-namespace */\nimport { map, isEmpty } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport {\n  isBidirectional,\n  isOneToAny,\n  isManyToAny,\n  isAnyToOne,\n  hasOrderColumn,\n  hasInverseOrderColumn,\n} from '../metadata';\nimport { createQueryBuilder } from '../query';\nimport { addSchema } from '../utils/knex';\nimport type { Database } from '..';\nimport type { ID, Relation, Model } from '../types';\n\ndeclare module 'knex' {\n  namespace Knex {\n    interface ChainableInterface {\n      transacting(trx?: Knex.Transaction): this;\n    }\n  }\n}\n\n//  TODO: This is a short term solution, to not steal relations from the same document.\nconst getDocumentSiblingIdsQuery = (tableName: string, id: ID) => {\n  // Find if the model is a content type or something else (e.g. component)\n  // to only get the documentId if it's a content type\n  const models: Model[] = Array.from(strapi.db.metadata.values());\n\n  const isContentType = models.find((model) => {\n    return model.tableName === tableName && model.attributes.documentId;\n  });\n\n  if (!isContentType) {\n    return [id];\n  }\n\n  // NOTE: SubQueries are wrapped in a function to not reuse the same connection,\n  // which causes infinite self references\n  return function findDocumentSiblingIds(query) {\n    query\n      .select('id')\n      .from(tableName)\n      // Get all child ids of the document id\n      .whereIn('document_id', (documentIDSubQuery) => {\n        documentIDSubQuery\n          .from(tableName)\n          // get document id related to the current id\n          .select('document_id')\n          .where('id', id);\n      });\n  } satisfies Knex.QueryCallback;\n};\n\n/**\n * If some relations currently exist for this oneToX relation, on the one side, this function removes them and update the inverse order if needed.\n */\nconst deletePreviousOneToAnyRelations = async ({\n  id,\n  attribute,\n  relIdsToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdsToadd: ID[];\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  if (!(isBidirectional(attribute) && isOneToAny(attribute))) {\n    throw new Error(\n      'deletePreviousOneToAnyRelations can only be called for bidirectional oneToAny relations'\n    );\n  }\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n\n  const con = db.getConnection();\n\n  await con\n    .delete()\n    .from(joinTable.name)\n    // Exclude the ids of the current document\n    .whereNotIn(joinColumn.name, getDocumentSiblingIdsQuery(joinColumn.referencedTable!, id))\n    // Include all the ids that are being connected\n    .whereIn(inverseJoinColumn.name, relIdsToadd)\n    .where(joinTable.on || {})\n    .transacting(trx);\n\n  await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToadd, transaction: trx });\n};\n\n/**\n * If a relation currently exists for this xToOne relations, this function removes it and update the inverse order if needed.\n */\nconst deletePreviousAnyToOneRelations = async ({\n  id,\n  attribute,\n  relIdToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdToadd: ID;\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const con = db.getConnection();\n\n  if (!isAnyToOne(attribute)) {\n    throw new Error('deletePreviousAnyToOneRelations can only be called for anyToOne relations');\n  }\n  // handling manyToOne\n  if (isManyToAny(attribute)) {\n    // if the database integrity was not broken relsToDelete is supposed to be of length 1\n    const relsToDelete = await con\n      .select(inverseJoinColumn.name)\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n\n    const relIdsToDelete = map(inverseJoinColumn.name, relsToDelete);\n\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $in: relIdsToDelete },\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n\n    await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToDelete, transaction: trx });\n\n    // handling oneToOne\n  } else {\n    await con\n      .delete()\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      // Exclude the ids of the current document\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n  }\n};\n\n/**\n * Delete all or some relations of entity field\n */\nconst deleteRelations = async ({\n  id,\n  attribute,\n  db,\n  relIdsToNotDelete = [],\n  relIdsToDelete = [],\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  relIdsToNotDelete?: ID[];\n  relIdsToDelete?: ID[] | 'all';\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const all = relIdsToDelete === 'all';\n\n  if (hasOrderColumn(attribute) || hasInverseOrderColumn(attribute)) {\n    let lastId: ID = 0;\n    let done = false;\n    const batchSize = 100;\n\n    while (!done) {\n      const batchToDelete: { id: ID }[] = await createQueryBuilder(joinTable.name, db)\n        .select(inverseJoinColumn.name)\n        .where({\n          [joinColumn.name]: id,\n          id: { $gt: lastId },\n          [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n          ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n        })\n        .where(joinTable.on || {})\n        .orderBy('id')\n        .limit(batchSize)\n        .transacting(trx)\n        .execute();\n\n      done = batchToDelete.length < batchSize;\n      lastId = batchToDelete[batchToDelete.length - 1]?.id || 0;\n\n      const batchIds = map(inverseJoinColumn.name, batchToDelete);\n\n      await createQueryBuilder(joinTable.name, db)\n        .delete()\n        .where({\n          [joinColumn.name]: id,\n          [inverseJoinColumn.name]: { $in: batchIds },\n        })\n        .where(joinTable.on || {})\n        .transacting(trx)\n        .execute();\n\n      await cleanOrderColumns({ attribute, db, id, inverseRelIds: batchIds, transaction: trx });\n    }\n  } else {\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n        ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n  }\n};\n\n/**\n * Clean the order columns by ensuring the order value are continuous (ex: 1, 2, 3 and not 1, 5, 10)\n */\nconst cleanOrderColumns = async ({\n  id,\n  attribute,\n  db,\n  inverseRelIds = [],\n  transaction: trx,\n}: {\n  id?: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  inverseRelIds?: ID[];\n  transaction?: Knex.Transaction;\n}) => {\n  if (\n    !(hasOrderColumn(attribute) && id) &&\n    !(hasInverseOrderColumn(attribute) && !isEmpty(inverseRelIds))\n  ) {\n    return;\n  }\n\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn, orderColumnName, inverseOrderColumnName } = joinTable;\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :joinColumn: ORDER BY :orderColumn:) AS src_order,\n    FROM :joinTable:\n    WHERE :joinColumn: = :id\n  ) AS b\n  SET :orderColumn: = b.src_order\n  WHERE b.id = a.id;\n  */\n  const updateOrderColumn = async () => {\n    if (!hasOrderColumn(attribute) || !id) {\n      return;\n    }\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('src_order', orderColumnName, joinColumn.name)\n        .where(joinColumn.name, id)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.src_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, orderColumnName]\n          )\n          .transacting(trx);\n\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.src_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, orderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :inverseJoinColumn: ORDER BY :inverseOrderColumn:) AS inv_order\n    FROM :joinTable:\n    WHERE :inverseJoinColumn: IN (:inverseRelIds)\n  ) AS b\n  SET :inverseOrderColumn: = b.inv_order\n  WHERE b.id = a.id;\n  */\n  const updateInverseOrderColumn = async () => {\n    if (!hasInverseOrderColumn(attribute) || isEmpty(inverseRelIds)) return;\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('inv_order', inverseOrderColumnName, inverseJoinColumn.name)\n        .where(inverseJoinColumn.name, 'in', inverseRelIds)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.inv_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, inverseOrderColumnName]\n          )\n          .transacting(trx);\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.inv_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, inverseOrderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  // Run updates in a deterministic order to avoid lock cycles on the same join table.\n  await updateOrderColumn();\n  await updateInverseOrderColumn();\n};\n\nexport {\n  deletePreviousOneToAnyRelations,\n  deletePreviousAnyToOneRelations,\n  deleteRelations,\n  cleanOrderColumns,\n};\n"],"names":["getDocumentSiblingIdsQuery","tableName","id","models","Array","from","strapi","db","metadata","values","isContentType","find","model","attributes","documentId","findDocumentSiblingIds","query","select","whereIn","documentIDSubQuery","where","deletePreviousOneToAnyRelations","attribute","relIdsToadd","transaction","trx","isBidirectional","isOneToAny","Error","joinTable","joinColumn","inverseJoinColumn","con","getConnection","delete","name","whereNotIn","referencedTable","on","transacting","cleanOrderColumns","inverseRelIds","deletePreviousAnyToOneRelations","relIdToadd","isAnyToOne","isManyToAny","relsToDelete","relIdsToDelete","map","createQueryBuilder","$in","execute","deleteRelations","relIdsToNotDelete","all","hasOrderColumn","hasInverseOrderColumn","lastId","done","batchSize","batchToDelete","$gt","$notIn","orderBy","limit","length","batchIds","isEmpty","orderColumnName","inverseOrderColumnName","updateOrderColumn","selectRowsToOrder","joinTableName","connection","rowNumber","toSQL","dialect","client","raw","sql","bindings","addSchema","updateInverseOrderColumn"],"mappings":";;;;;;;;AAyBA;AACA,MAAMA,0BAAAA,GAA6B,CAACC,SAAAA,EAAmBC,EAAAA,GAAAA;;;IAGrD,MAAMC,MAAAA,GAAkBC,MAAMC,IAAI,CAACC,OAAOC,EAAE,CAACC,QAAQ,CAACC,MAAM,EAAA,CAAA;AAE5D,IAAA,MAAMC,aAAAA,GAAgBP,MAAAA,CAAOQ,IAAI,CAAC,CAACC,KAAAA,GAAAA;AACjC,QAAA,OAAOA,MAAMX,SAAS,KAAKA,aAAaW,KAAAA,CAAMC,UAAU,CAACC,UAAU;AACrE,IAAA,CAAA,CAAA;AAEA,IAAA,IAAI,CAACJ,aAAAA,EAAe;QAClB,OAAO;AAACR,YAAAA;AAAG,SAAA;AACb,IAAA;;;IAIA,OAAO,SAASa,uBAAuBC,KAAK,EAAA;AAC1CA,QAAAA,KAAAA,CACGC,MAAM,CAAC,IAAA,CAAA,CACPZ,IAAI,CAACJ,UACN;SACCiB,OAAO,CAAC,eAAe,CAACC,kBAAAA,GAAAA;YACvBA,kBAAAA,CACGd,IAAI,CAACJ,SAAAA,CACN;AACCgB,aAAAA,MAAM,CAAC,aAAA,CAAA,CACPG,KAAK,CAAC,IAAA,EAAMlB,EAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AACJ,IAAA,CAAA;AACF,CAAA;AAEA;;AAEC,IACD,MAAMmB,+BAAAA,GAAkC,OAAO,EAC7CnB,EAAE,EACFoB,SAAS,EACTC,WAAW,EACXhB,EAAE,EACFiB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IAAI,EAAEC,yBAAAA,CAAgBJ,SAAAA,CAAAA,IAAcK,oBAAAA,CAAWL,UAAS,CAAA,EAAI;AAC1D,QAAA,MAAM,IAAIM,KAAAA,CACR,yFAAA,CAAA;AAEJ,IAAA;IACA,MAAM,EAAEC,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAE1C,MAAMG,GAAAA,GAAMzB,GAAG0B,aAAa,EAAA;IAE5B,MAAMD,GAAAA,CACHE,MAAM,EAAA,CACN7B,IAAI,CAACwB,SAAAA,CAAUM,IAAI,CACpB;KACCC,UAAU,CAACN,WAAWK,IAAI,EAAEnC,2BAA2B8B,UAAAA,CAAWO,eAAe,EAAGnC,EAAAA,CAAAA,CACrF;AACCgB,KAAAA,OAAO,CAACa,iBAAAA,CAAkBI,IAAI,EAAEZ,WAAAA,CAAAA,CAChCH,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,IAAA,MAAMe,iBAAAA,CAAkB;AAAElB,QAAAA,SAAAA;AAAWf,QAAAA,EAAAA;QAAIkC,aAAAA,EAAelB,WAAAA;QAAaC,WAAAA,EAAaC;AAAI,KAAA,CAAA;AACxF;AAEA;;AAEC,IACD,MAAMiB,+BAAAA,GAAkC,OAAO,EAC7CxC,EAAE,EACFoB,SAAS,EACTqB,UAAU,EACVpC,EAAE,EACFiB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAC1C,MAAMG,GAAAA,GAAMzB,GAAG0B,aAAa,EAAA;IAE5B,IAAI,CAACW,qBAAWtB,SAAAA,CAAAA,EAAY;AAC1B,QAAA,MAAM,IAAIM,KAAAA,CAAM,2EAAA,CAAA;AAClB,IAAA;;AAEA,IAAA,IAAIiB,sBAAYvB,SAAAA,CAAAA,EAAY;;AAE1B,QAAA,MAAMwB,eAAe,MAAMd,GAAAA,CACxBf,MAAM,CAACc,kBAAkBI,IAAI,CAAA,CAC7B9B,IAAI,CAACwB,UAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,WAAWK,IAAI,EAAEjC,EAAAA,CAAAA,CACvBkC,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBnC,0BAAAA,CAA2B+B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,QAAA,MAAMsB,cAAAA,GAAiBC,KAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEW,YAAAA,CAAAA;QAEnD,MAAMG,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;YACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAEe,GAAAA,EAAKH;AAAe;SAClD,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,QAAA,MAAMX,iBAAAA,CAAkB;AAAElB,YAAAA,SAAAA;AAAWf,YAAAA,EAAAA;YAAIkC,aAAAA,EAAeM,cAAAA;YAAgBvB,WAAAA,EAAaC;AAAI,SAAA,CAAA;;IAG3F,CAAA,MAAO;AACL,QAAA,MAAMO,GAAAA,CACHE,MAAM,EAAA,CACN7B,IAAI,CAACwB,SAAAA,CAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEjC,GACxB;AACCkC,SAAAA,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBnC,0BAAAA,CAA2B+B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AACjB,IAAA;AACF;AAEA;;AAEC,UACK2B,eAAAA,GAAkB,OAAO,EAC7BlD,EAAE,EACFoB,SAAS,EACTf,EAAE,EACF8C,iBAAAA,GAAoB,EAAE,EACtBN,cAAAA,GAAiB,EAAE,EACnBvB,WAAAA,EAAaC,GAAG,EAQjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;AAC1C,IAAA,MAAMyB,MAAMP,cAAAA,KAAmB,KAAA;IAE/B,IAAIQ,wBAAAA,CAAejC,SAAAA,CAAAA,IAAckC,+BAAAA,CAAsBlC,SAAAA,CAAAA,EAAY;AACjE,QAAA,IAAImC,MAAAA,GAAa,CAAA;AACjB,QAAA,IAAIC,IAAAA,GAAO,KAAA;AACX,QAAA,MAAMC,SAAAA,GAAY,GAAA;AAElB,QAAA,MAAO,CAACD,IAAAA,CAAM;AACZ,YAAA,MAAME,aAAAA,GAA8B,MAAMX,YAAAA,CAAmBpB,SAAAA,CAAUM,IAAI,EAAE5B,EAAAA,CAAAA,CAC1EU,MAAM,CAACc,iBAAAA,CAAkBI,IAAI,CAAA,CAC7Bf,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;gBACnBA,EAAAA,EAAI;oBAAE2D,GAAAA,EAAKJ;AAAO,iBAAA;gBAClB,CAAC1B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAE2B,MAAAA,EAAQT;AAAkB,iBAAA;gBACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;oBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;wBAAEe,GAAAA,EAAKH;AAAe;;AACnE,aAAA,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvByB,OAAO,CAAC,IAAA,CAAA,CACRC,KAAK,CAACL,SAAAA,CAAAA,CACNpB,WAAW,CAACd,KACZ0B,OAAO,EAAA;YAEVO,IAAAA,GAAOE,aAAAA,CAAcK,MAAM,GAAGN,SAAAA;AAC9BF,YAAAA,MAAAA,GAASG,aAAa,CAACA,aAAAA,CAAcK,MAAM,GAAG,CAAA,CAAE,EAAE/D,EAAAA,IAAM,CAAA;AAExD,YAAA,MAAMgE,QAAAA,GAAWlB,KAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEyB,aAAAA,CAAAA;YAE7C,MAAMX,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;gBACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKgB;AAAS;aAC5C,CAAA,CACC9C,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,YAAA,MAAMX,iBAAAA,CAAkB;AAAElB,gBAAAA,SAAAA;AAAWf,gBAAAA,EAAAA;AAAIL,gBAAAA,EAAAA;gBAAIuC,aAAAA,EAAeyB,QAAAA;gBAAU1C,WAAAA,EAAaC;AAAI,aAAA,CAAA;AACzF,QAAA;IACF,CAAA,MAAO;QACL,MAAMwB,YAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;YACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAE2B,MAAAA,EAAQT;AAAkB,aAAA;YACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;gBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKH;AAAe;;SACnE,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AACZ,IAAA;AACF;AAEA;;AAEC,IACD,MAAMX,iBAAAA,GAAoB,OAAO,EAC/BtC,EAAE,EACFoB,SAAS,EACTf,EAAE,EACFkC,aAAAA,GAAgB,EAAE,EAClBjB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IACE,EAAE8B,wBAAAA,CAAejC,SAAAA,CAAAA,IAAcpB,EAAC,CAAA,IAChC,EAAEsD,+BAAAA,CAAsBlC,SAAAA,CAAAA,IAAc,CAAC6C,SAAAA,CAAQ1B,cAAa,CAAA,EAC5D;AACA,QAAA;AACF,IAAA;IAEA,MAAM,EAAEZ,SAAS,EAAE,GAAGP,SAAAA;IACtB,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAEqC,eAAe,EAAEC,sBAAsB,EAAE,GAAGxC,SAAAA;AAEnF;;;;;;;;;;;AAWA,KACA,MAAMyC,iBAAAA,GAAoB,UAAA;AACxB,QAAA,IAAI,CAACf,wBAAAA,CAAejC,SAAAA,CAAAA,IAAc,CAACpB,EAAAA,EAAI;AACrC,YAAA;AACF,QAAA;QAEA,MAAMqE,iBAAAA,GAAoB,CAACC,aAAAA,GACzBjE,EAAAA,CACGkE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,WAAA,EAAaN,eAAAA,EAAiBtC,UAAAA,CAAWK,IAAI,CAAA,CACvDf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEjC,EAAAA,CAAAA,CACvByE,KAAK,EAAA;AAEV,QAAA,OAAQrE,MAAAA,CAAOC,EAAE,CAACqE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM5B,EAAAA,CACH0B,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEZ,wBAAAA;AAAgB,qBAAA,CAAA,CAEtD7B,WAAW,CAACd,GAAAA,CAAAA;AAEf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,cAAAA,CAAU1E,EAAAA,EAAIsB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMjE,EAAAA,CAAGkE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeJ,wBAAAA,eAAAA;AAAoBnD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAErDzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;AAEA;;;;;;;;;;;AAWA,KACA,MAAMyD,wBAAAA,GAA2B,UAAA;AAC/B,QAAA,IAAI,CAAC1B,+BAAAA,CAAsBlC,SAAAA,CAAAA,IAAc6C,SAAAA,CAAQ1B,aAAAA,CAAAA,EAAgB;QAEjE,MAAM8B,iBAAAA,GAAoB,CAACC,aAAAA,GACzBjE,EAAAA,CACGkE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,aAAaL,sBAAAA,EAAwBtC,iBAAAA,CAAkBI,IAAI,CAAA,CACrEf,KAAK,CAACW,kBAAkBI,IAAI,EAAE,IAAA,EAAMM,aAAAA,CAAAA,CACpCkC,KAAK,EAAA;AAEV,QAAA,OAAQrE,MAAAA,CAAOC,EAAE,CAACqE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM5B,EAAAA,CACH0B,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEX,wBAAAA;AAAuB,qBAAA,CAAA,CAE7D9B,WAAW,CAACd,GAAAA,CAAAA;AACf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,cAAAA,CAAU1E,EAAAA,EAAIsB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMjE,EAAAA,CAAGkE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeH,wBAAAA,sBAAAA;AAA2BpD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAE5DzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;;IAGA,MAAM6C,iBAAAA,EAAAA;IACN,MAAMY,wBAAAA,EAAAA;AACR;;;;;;;"}

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

@@ -19,7 +19,7 @@ const getDocumentSiblingIdsQuery = (tableName, id)=>{
     }
     // NOTE: SubQueries are wrapped in a function to not reuse the same connection,
     // which causes infinite self references
-    return function(query) {
+    return function findDocumentSiblingIds(query) {
         query.select('id').from(tableName)// Get all child ids of the document id
         .whereIn('document_id', (documentIDSubQuery)=>{
             documentIDSubQuery.from(tableName)// get document id related to the current id

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

@@ -1 +1 @@
-{"version":3,"file":"regular-relations.mjs","sources":["../../src/entity-manager/regular-relations.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-namespace */\nimport { map, isEmpty } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport {\n  isBidirectional,\n  isOneToAny,\n  isManyToAny,\n  isAnyToOne,\n  hasOrderColumn,\n  hasInverseOrderColumn,\n} from '../metadata';\nimport { createQueryBuilder } from '../query';\nimport { addSchema } from '../utils/knex';\nimport type { Database } from '..';\nimport type { ID, Relation, Model } from '../types';\n\ndeclare module 'knex' {\n  namespace Knex {\n    interface ChainableInterface {\n      transacting(trx?: Knex.Transaction): this;\n    }\n  }\n}\n\n//  TODO: This is a short term solution, to not steal relations from the same document.\nconst getDocumentSiblingIdsQuery = (tableName: string, id: ID) => {\n  // Find if the model is a content type or something else (e.g. component)\n  // to only get the documentId if it's a content type\n  const models: Model[] = Array.from(strapi.db.metadata.values());\n\n  const isContentType = models.find((model) => {\n    return model.tableName === tableName && model.attributes.documentId;\n  });\n\n  if (!isContentType) {\n    return [id];\n  }\n\n  // NOTE: SubQueries are wrapped in a function to not reuse the same connection,\n  // which causes infinite self references\n  return function (query) {\n    query\n      .select('id')\n      .from(tableName)\n      // Get all child ids of the document id\n      .whereIn('document_id', (documentIDSubQuery) => {\n        documentIDSubQuery\n          .from(tableName)\n          // get document id related to the current id\n          .select('document_id')\n          .where('id', id);\n      });\n  } satisfies Knex.QueryCallback;\n};\n\n/**\n * If some relations currently exist for this oneToX relation, on the one side, this function removes them and update the inverse order if needed.\n */\nconst deletePreviousOneToAnyRelations = async ({\n  id,\n  attribute,\n  relIdsToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdsToadd: ID[];\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  if (!(isBidirectional(attribute) && isOneToAny(attribute))) {\n    throw new Error(\n      'deletePreviousOneToAnyRelations can only be called for bidirectional oneToAny relations'\n    );\n  }\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n\n  const con = db.getConnection();\n\n  await con\n    .delete()\n    .from(joinTable.name)\n    // Exclude the ids of the current document\n    .whereNotIn(joinColumn.name, getDocumentSiblingIdsQuery(joinColumn.referencedTable!, id))\n    // Include all the ids that are being connected\n    .whereIn(inverseJoinColumn.name, relIdsToadd)\n    .where(joinTable.on || {})\n    .transacting(trx);\n\n  await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToadd, transaction: trx });\n};\n\n/**\n * If a relation currently exists for this xToOne relations, this function removes it and update the inverse order if needed.\n */\nconst deletePreviousAnyToOneRelations = async ({\n  id,\n  attribute,\n  relIdToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdToadd: ID;\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const con = db.getConnection();\n\n  if (!isAnyToOne(attribute)) {\n    throw new Error('deletePreviousAnyToOneRelations can only be called for anyToOne relations');\n  }\n  // handling manyToOne\n  if (isManyToAny(attribute)) {\n    // if the database integrity was not broken relsToDelete is supposed to be of length 1\n    const relsToDelete = await con\n      .select(inverseJoinColumn.name)\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n\n    const relIdsToDelete = map(inverseJoinColumn.name, relsToDelete);\n\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $in: relIdsToDelete },\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n\n    await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToDelete, transaction: trx });\n\n    // handling oneToOne\n  } else {\n    await con\n      .delete()\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      // Exclude the ids of the current document\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n  }\n};\n\n/**\n * Delete all or some relations of entity field\n */\nconst deleteRelations = async ({\n  id,\n  attribute,\n  db,\n  relIdsToNotDelete = [],\n  relIdsToDelete = [],\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  relIdsToNotDelete?: ID[];\n  relIdsToDelete?: ID[] | 'all';\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const all = relIdsToDelete === 'all';\n\n  if (hasOrderColumn(attribute) || hasInverseOrderColumn(attribute)) {\n    let lastId: ID = 0;\n    let done = false;\n    const batchSize = 100;\n\n    while (!done) {\n      const batchToDelete: { id: ID }[] = await createQueryBuilder(joinTable.name, db)\n        .select(inverseJoinColumn.name)\n        .where({\n          [joinColumn.name]: id,\n          id: { $gt: lastId },\n          [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n          ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n        })\n        .where(joinTable.on || {})\n        .orderBy('id')\n        .limit(batchSize)\n        .transacting(trx)\n        .execute();\n\n      done = batchToDelete.length < batchSize;\n      lastId = batchToDelete[batchToDelete.length - 1]?.id || 0;\n\n      const batchIds = map(inverseJoinColumn.name, batchToDelete);\n\n      await createQueryBuilder(joinTable.name, db)\n        .delete()\n        .where({\n          [joinColumn.name]: id,\n          [inverseJoinColumn.name]: { $in: batchIds },\n        })\n        .where(joinTable.on || {})\n        .transacting(trx)\n        .execute();\n\n      await cleanOrderColumns({ attribute, db, id, inverseRelIds: batchIds, transaction: trx });\n    }\n  } else {\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n        ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n  }\n};\n\n/**\n * Clean the order columns by ensuring the order value are continuous (ex: 1, 2, 3 and not 1, 5, 10)\n */\nconst cleanOrderColumns = async ({\n  id,\n  attribute,\n  db,\n  inverseRelIds = [],\n  transaction: trx,\n}: {\n  id?: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  inverseRelIds?: ID[];\n  transaction?: Knex.Transaction;\n}) => {\n  if (\n    !(hasOrderColumn(attribute) && id) &&\n    !(hasInverseOrderColumn(attribute) && !isEmpty(inverseRelIds))\n  ) {\n    return;\n  }\n\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn, orderColumnName, inverseOrderColumnName } = joinTable;\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :joinColumn: ORDER BY :orderColumn:) AS src_order,\n    FROM :joinTable:\n    WHERE :joinColumn: = :id\n  ) AS b\n  SET :orderColumn: = b.src_order\n  WHERE b.id = a.id;\n  */\n  const updateOrderColumn = async () => {\n    if (!hasOrderColumn(attribute) || !id) {\n      return;\n    }\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('src_order', orderColumnName, joinColumn.name)\n        .where(joinColumn.name, id)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.src_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, orderColumnName]\n          )\n          .transacting(trx);\n\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.src_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, orderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :inverseJoinColumn: ORDER BY :inverseOrderColumn:) AS inv_order\n    FROM :joinTable:\n    WHERE :inverseJoinColumn: IN (:inverseRelIds)\n  ) AS b\n  SET :inverseOrderColumn: = b.inv_order\n  WHERE b.id = a.id;\n  */\n  const updateInverseOrderColumn = async () => {\n    if (!hasInverseOrderColumn(attribute) || isEmpty(inverseRelIds)) return;\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('inv_order', inverseOrderColumnName, inverseJoinColumn.name)\n        .where(inverseJoinColumn.name, 'in', inverseRelIds)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.inv_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, inverseOrderColumnName]\n          )\n          .transacting(trx);\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.inv_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, inverseOrderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  // Run updates in a deterministic order to avoid lock cycles on the same join table.\n  await updateOrderColumn();\n  await updateInverseOrderColumn();\n};\n\nexport {\n  deletePreviousOneToAnyRelations,\n  deletePreviousAnyToOneRelations,\n  deleteRelations,\n  cleanOrderColumns,\n};\n"],"names":["getDocumentSiblingIdsQuery","tableName","id","models","Array","from","strapi","db","metadata","values","isContentType","find","model","attributes","documentId","query","select","whereIn","documentIDSubQuery","where","deletePreviousOneToAnyRelations","attribute","relIdsToadd","transaction","trx","isBidirectional","isOneToAny","Error","joinTable","joinColumn","inverseJoinColumn","con","getConnection","delete","name","whereNotIn","referencedTable","on","transacting","cleanOrderColumns","inverseRelIds","deletePreviousAnyToOneRelations","relIdToadd","isAnyToOne","isManyToAny","relsToDelete","relIdsToDelete","map","createQueryBuilder","$in","execute","deleteRelations","relIdsToNotDelete","all","hasOrderColumn","hasInverseOrderColumn","lastId","done","batchSize","batchToDelete","$gt","$notIn","orderBy","limit","length","batchIds","isEmpty","orderColumnName","inverseOrderColumnName","updateOrderColumn","selectRowsToOrder","joinTableName","connection","rowNumber","toSQL","dialect","client","raw","sql","bindings","addSchema","updateInverseOrderColumn"],"mappings":";;;;;;AAyBA;AACA,MAAMA,0BAAAA,GAA6B,CAACC,SAAAA,EAAmBC,EAAAA,GAAAA;;;IAGrD,MAAMC,MAAAA,GAAkBC,MAAMC,IAAI,CAACC,OAAOC,EAAE,CAACC,QAAQ,CAACC,MAAM,EAAA,CAAA;AAE5D,IAAA,MAAMC,aAAAA,GAAgBP,MAAAA,CAAOQ,IAAI,CAAC,CAACC,KAAAA,GAAAA;AACjC,QAAA,OAAOA,MAAMX,SAAS,KAAKA,aAAaW,KAAAA,CAAMC,UAAU,CAACC,UAAU;AACrE,IAAA,CAAA,CAAA;AAEA,IAAA,IAAI,CAACJ,aAAAA,EAAe;QAClB,OAAO;AAACR,YAAAA;AAAG,SAAA;AACb,IAAA;;;AAIA,IAAA,OAAO,SAAUa,KAAK,EAAA;AACpBA,QAAAA,KAAAA,CACGC,MAAM,CAAC,IAAA,CAAA,CACPX,IAAI,CAACJ,UACN;SACCgB,OAAO,CAAC,eAAe,CAACC,kBAAAA,GAAAA;YACvBA,kBAAAA,CACGb,IAAI,CAACJ,SAAAA,CACN;AACCe,aAAAA,MAAM,CAAC,aAAA,CAAA,CACPG,KAAK,CAAC,IAAA,EAAMjB,EAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AACJ,IAAA,CAAA;AACF,CAAA;AAEA;;AAEC,IACD,MAAMkB,+BAAAA,GAAkC,OAAO,EAC7ClB,EAAE,EACFmB,SAAS,EACTC,WAAW,EACXf,EAAE,EACFgB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IAAI,EAAEC,eAAAA,CAAgBJ,SAAAA,CAAAA,IAAcK,UAAAA,CAAWL,UAAS,CAAA,EAAI;AAC1D,QAAA,MAAM,IAAIM,KAAAA,CACR,yFAAA,CAAA;AAEJ,IAAA;IACA,MAAM,EAAEC,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAE1C,MAAMG,GAAAA,GAAMxB,GAAGyB,aAAa,EAAA;IAE5B,MAAMD,GAAAA,CACHE,MAAM,EAAA,CACN5B,IAAI,CAACuB,SAAAA,CAAUM,IAAI,CACpB;KACCC,UAAU,CAACN,WAAWK,IAAI,EAAElC,2BAA2B6B,UAAAA,CAAWO,eAAe,EAAGlC,EAAAA,CAAAA,CACrF;AACCe,KAAAA,OAAO,CAACa,iBAAAA,CAAkBI,IAAI,EAAEZ,WAAAA,CAAAA,CAChCH,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,IAAA,MAAMe,iBAAAA,CAAkB;AAAElB,QAAAA,SAAAA;AAAWd,QAAAA,EAAAA;QAAIiC,aAAAA,EAAelB,WAAAA;QAAaC,WAAAA,EAAaC;AAAI,KAAA,CAAA;AACxF;AAEA;;AAEC,IACD,MAAMiB,+BAAAA,GAAkC,OAAO,EAC7CvC,EAAE,EACFmB,SAAS,EACTqB,UAAU,EACVnC,EAAE,EACFgB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAC1C,MAAMG,GAAAA,GAAMxB,GAAGyB,aAAa,EAAA;IAE5B,IAAI,CAACW,WAAWtB,SAAAA,CAAAA,EAAY;AAC1B,QAAA,MAAM,IAAIM,KAAAA,CAAM,2EAAA,CAAA;AAClB,IAAA;;AAEA,IAAA,IAAIiB,YAAYvB,SAAAA,CAAAA,EAAY;;AAE1B,QAAA,MAAMwB,eAAe,MAAMd,GAAAA,CACxBf,MAAM,CAACc,kBAAkBI,IAAI,CAAA,CAC7B7B,IAAI,CAACuB,UAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,WAAWK,IAAI,EAAEhC,EAAAA,CAAAA,CACvBiC,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBlC,0BAAAA,CAA2B8B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,QAAA,MAAMsB,cAAAA,GAAiBC,GAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEW,YAAAA,CAAAA;QAEnD,MAAMG,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;YACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAEe,GAAAA,EAAKH;AAAe;SAClD,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,QAAA,MAAMX,iBAAAA,CAAkB;AAAElB,YAAAA,SAAAA;AAAWd,YAAAA,EAAAA;YAAIiC,aAAAA,EAAeM,cAAAA;YAAgBvB,WAAAA,EAAaC;AAAI,SAAA,CAAA;;IAG3F,CAAA,MAAO;AACL,QAAA,MAAMO,GAAAA,CACHE,MAAM,EAAA,CACN5B,IAAI,CAACuB,SAAAA,CAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEhC,GACxB;AACCiC,SAAAA,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBlC,0BAAAA,CAA2B8B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AACjB,IAAA;AACF;AAEA;;AAEC,UACK2B,eAAAA,GAAkB,OAAO,EAC7BjD,EAAE,EACFmB,SAAS,EACTd,EAAE,EACF6C,iBAAAA,GAAoB,EAAE,EACtBN,cAAAA,GAAiB,EAAE,EACnBvB,WAAAA,EAAaC,GAAG,EAQjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;AAC1C,IAAA,MAAMyB,MAAMP,cAAAA,KAAmB,KAAA;IAE/B,IAAIQ,cAAAA,CAAejC,SAAAA,CAAAA,IAAckC,qBAAAA,CAAsBlC,SAAAA,CAAAA,EAAY;AACjE,QAAA,IAAImC,MAAAA,GAAa,CAAA;AACjB,QAAA,IAAIC,IAAAA,GAAO,KAAA;AACX,QAAA,MAAMC,SAAAA,GAAY,GAAA;AAElB,QAAA,MAAO,CAACD,IAAAA,CAAM;AACZ,YAAA,MAAME,aAAAA,GAA8B,MAAMX,kBAAAA,CAAmBpB,SAAAA,CAAUM,IAAI,EAAE3B,EAAAA,CAAAA,CAC1ES,MAAM,CAACc,iBAAAA,CAAkBI,IAAI,CAAA,CAC7Bf,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;gBACnBA,EAAAA,EAAI;oBAAE0D,GAAAA,EAAKJ;AAAO,iBAAA;gBAClB,CAAC1B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAE2B,MAAAA,EAAQT;AAAkB,iBAAA;gBACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;oBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;wBAAEe,GAAAA,EAAKH;AAAe;;AACnE,aAAA,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvByB,OAAO,CAAC,IAAA,CAAA,CACRC,KAAK,CAACL,SAAAA,CAAAA,CACNpB,WAAW,CAACd,KACZ0B,OAAO,EAAA;YAEVO,IAAAA,GAAOE,aAAAA,CAAcK,MAAM,GAAGN,SAAAA;AAC9BF,YAAAA,MAAAA,GAASG,aAAa,CAACA,aAAAA,CAAcK,MAAM,GAAG,CAAA,CAAE,EAAE9D,EAAAA,IAAM,CAAA;AAExD,YAAA,MAAM+D,QAAAA,GAAWlB,GAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEyB,aAAAA,CAAAA;YAE7C,MAAMX,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;gBACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKgB;AAAS;aAC5C,CAAA,CACC9C,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,YAAA,MAAMX,iBAAAA,CAAkB;AAAElB,gBAAAA,SAAAA;AAAWd,gBAAAA,EAAAA;AAAIL,gBAAAA,EAAAA;gBAAIsC,aAAAA,EAAeyB,QAAAA;gBAAU1C,WAAAA,EAAaC;AAAI,aAAA,CAAA;AACzF,QAAA;IACF,CAAA,MAAO;QACL,MAAMwB,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE3B,IACtC0B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGhC,EAAAA;YACnB,CAAC4B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAE2B,MAAAA,EAAQT;AAAkB,aAAA;YACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;gBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKH;AAAe;;SACnE,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AACZ,IAAA;AACF;AAEA;;AAEC,IACD,MAAMX,iBAAAA,GAAoB,OAAO,EAC/BrC,EAAE,EACFmB,SAAS,EACTd,EAAE,EACFiC,aAAAA,GAAgB,EAAE,EAClBjB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IACE,EAAE8B,cAAAA,CAAejC,SAAAA,CAAAA,IAAcnB,EAAC,CAAA,IAChC,EAAEqD,qBAAAA,CAAsBlC,SAAAA,CAAAA,IAAc,CAAC6C,OAAAA,CAAQ1B,cAAa,CAAA,EAC5D;AACA,QAAA;AACF,IAAA;IAEA,MAAM,EAAEZ,SAAS,EAAE,GAAGP,SAAAA;IACtB,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAEqC,eAAe,EAAEC,sBAAsB,EAAE,GAAGxC,SAAAA;AAEnF;;;;;;;;;;;AAWA,KACA,MAAMyC,iBAAAA,GAAoB,UAAA;AACxB,QAAA,IAAI,CAACf,cAAAA,CAAejC,SAAAA,CAAAA,IAAc,CAACnB,EAAAA,EAAI;AACrC,YAAA;AACF,QAAA;QAEA,MAAMoE,iBAAAA,GAAoB,CAACC,aAAAA,GACzBhE,EAAAA,CACGiE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,WAAA,EAAaN,eAAAA,EAAiBtC,UAAAA,CAAWK,IAAI,CAAA,CACvDf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEhC,EAAAA,CAAAA,CACvBwE,KAAK,EAAA;AAEV,QAAA,OAAQpE,MAAAA,CAAOC,EAAE,CAACoE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM3B,EAAAA,CACHyB,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEZ,wBAAAA;AAAgB,qBAAA,CAAA,CAEtD7B,WAAW,CAACd,GAAAA,CAAAA;AAEf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,SAAAA,CAAUzE,EAAAA,EAAIqB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMhE,EAAAA,CAAGiE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeJ,wBAAAA,eAAAA;AAAoBnD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAErDzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;AAEA;;;;;;;;;;;AAWA,KACA,MAAMyD,wBAAAA,GAA2B,UAAA;AAC/B,QAAA,IAAI,CAAC1B,qBAAAA,CAAsBlC,SAAAA,CAAAA,IAAc6C,OAAAA,CAAQ1B,aAAAA,CAAAA,EAAgB;QAEjE,MAAM8B,iBAAAA,GAAoB,CAACC,aAAAA,GACzBhE,EAAAA,CACGiE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,aAAaL,sBAAAA,EAAwBtC,iBAAAA,CAAkBI,IAAI,CAAA,CACrEf,KAAK,CAACW,kBAAkBI,IAAI,EAAE,IAAA,EAAMM,aAAAA,CAAAA,CACpCkC,KAAK,EAAA;AAEV,QAAA,OAAQpE,MAAAA,CAAOC,EAAE,CAACoE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM3B,EAAAA,CACHyB,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEX,wBAAAA;AAAuB,qBAAA,CAAA,CAE7D9B,WAAW,CAACd,GAAAA,CAAAA;AACf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,SAAAA,CAAUzE,EAAAA,EAAIqB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMhE,EAAAA,CAAGiE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeH,wBAAAA,sBAAAA;AAA2BpD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAE5DzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;;IAGA,MAAM6C,iBAAAA,EAAAA;IACN,MAAMY,wBAAAA,EAAAA;AACR;;;;"}
+{"version":3,"file":"regular-relations.mjs","sources":["../../src/entity-manager/regular-relations.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-namespace */\nimport { map, isEmpty } from 'lodash/fp';\nimport type { Knex } from 'knex';\n\nimport {\n  isBidirectional,\n  isOneToAny,\n  isManyToAny,\n  isAnyToOne,\n  hasOrderColumn,\n  hasInverseOrderColumn,\n} from '../metadata';\nimport { createQueryBuilder } from '../query';\nimport { addSchema } from '../utils/knex';\nimport type { Database } from '..';\nimport type { ID, Relation, Model } from '../types';\n\ndeclare module 'knex' {\n  namespace Knex {\n    interface ChainableInterface {\n      transacting(trx?: Knex.Transaction): this;\n    }\n  }\n}\n\n//  TODO: This is a short term solution, to not steal relations from the same document.\nconst getDocumentSiblingIdsQuery = (tableName: string, id: ID) => {\n  // Find if the model is a content type or something else (e.g. component)\n  // to only get the documentId if it's a content type\n  const models: Model[] = Array.from(strapi.db.metadata.values());\n\n  const isContentType = models.find((model) => {\n    return model.tableName === tableName && model.attributes.documentId;\n  });\n\n  if (!isContentType) {\n    return [id];\n  }\n\n  // NOTE: SubQueries are wrapped in a function to not reuse the same connection,\n  // which causes infinite self references\n  return function findDocumentSiblingIds(query) {\n    query\n      .select('id')\n      .from(tableName)\n      // Get all child ids of the document id\n      .whereIn('document_id', (documentIDSubQuery) => {\n        documentIDSubQuery\n          .from(tableName)\n          // get document id related to the current id\n          .select('document_id')\n          .where('id', id);\n      });\n  } satisfies Knex.QueryCallback;\n};\n\n/**\n * If some relations currently exist for this oneToX relation, on the one side, this function removes them and update the inverse order if needed.\n */\nconst deletePreviousOneToAnyRelations = async ({\n  id,\n  attribute,\n  relIdsToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdsToadd: ID[];\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  if (!(isBidirectional(attribute) && isOneToAny(attribute))) {\n    throw new Error(\n      'deletePreviousOneToAnyRelations can only be called for bidirectional oneToAny relations'\n    );\n  }\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n\n  const con = db.getConnection();\n\n  await con\n    .delete()\n    .from(joinTable.name)\n    // Exclude the ids of the current document\n    .whereNotIn(joinColumn.name, getDocumentSiblingIdsQuery(joinColumn.referencedTable!, id))\n    // Include all the ids that are being connected\n    .whereIn(inverseJoinColumn.name, relIdsToadd)\n    .where(joinTable.on || {})\n    .transacting(trx);\n\n  await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToadd, transaction: trx });\n};\n\n/**\n * If a relation currently exists for this xToOne relations, this function removes it and update the inverse order if needed.\n */\nconst deletePreviousAnyToOneRelations = async ({\n  id,\n  attribute,\n  relIdToadd,\n  db,\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  relIdToadd: ID;\n  db: Database;\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const con = db.getConnection();\n\n  if (!isAnyToOne(attribute)) {\n    throw new Error('deletePreviousAnyToOneRelations can only be called for anyToOne relations');\n  }\n  // handling manyToOne\n  if (isManyToAny(attribute)) {\n    // if the database integrity was not broken relsToDelete is supposed to be of length 1\n    const relsToDelete = await con\n      .select(inverseJoinColumn.name)\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n\n    const relIdsToDelete = map(inverseJoinColumn.name, relsToDelete);\n\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $in: relIdsToDelete },\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n\n    await cleanOrderColumns({ attribute, db, inverseRelIds: relIdsToDelete, transaction: trx });\n\n    // handling oneToOne\n  } else {\n    await con\n      .delete()\n      .from(joinTable.name)\n      .where(joinColumn.name, id)\n      // Exclude the ids of the current document\n      .whereNotIn(\n        inverseJoinColumn.name,\n        getDocumentSiblingIdsQuery(inverseJoinColumn.referencedTable!, relIdToadd)\n      )\n      .where(joinTable.on || {})\n      .transacting(trx);\n  }\n};\n\n/**\n * Delete all or some relations of entity field\n */\nconst deleteRelations = async ({\n  id,\n  attribute,\n  db,\n  relIdsToNotDelete = [],\n  relIdsToDelete = [],\n  transaction: trx,\n}: {\n  id: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  relIdsToNotDelete?: ID[];\n  relIdsToDelete?: ID[] | 'all';\n  transaction?: Knex.Transaction;\n}) => {\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn } = joinTable;\n  const all = relIdsToDelete === 'all';\n\n  if (hasOrderColumn(attribute) || hasInverseOrderColumn(attribute)) {\n    let lastId: ID = 0;\n    let done = false;\n    const batchSize = 100;\n\n    while (!done) {\n      const batchToDelete: { id: ID }[] = await createQueryBuilder(joinTable.name, db)\n        .select(inverseJoinColumn.name)\n        .where({\n          [joinColumn.name]: id,\n          id: { $gt: lastId },\n          [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n          ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n        })\n        .where(joinTable.on || {})\n        .orderBy('id')\n        .limit(batchSize)\n        .transacting(trx)\n        .execute();\n\n      done = batchToDelete.length < batchSize;\n      lastId = batchToDelete[batchToDelete.length - 1]?.id || 0;\n\n      const batchIds = map(inverseJoinColumn.name, batchToDelete);\n\n      await createQueryBuilder(joinTable.name, db)\n        .delete()\n        .where({\n          [joinColumn.name]: id,\n          [inverseJoinColumn.name]: { $in: batchIds },\n        })\n        .where(joinTable.on || {})\n        .transacting(trx)\n        .execute();\n\n      await cleanOrderColumns({ attribute, db, id, inverseRelIds: batchIds, transaction: trx });\n    }\n  } else {\n    await createQueryBuilder(joinTable.name, db)\n      .delete()\n      .where({\n        [joinColumn.name]: id,\n        [inverseJoinColumn.name]: { $notIn: relIdsToNotDelete },\n        ...(all ? {} : { [inverseJoinColumn.name]: { $in: relIdsToDelete } }),\n      })\n      .where(joinTable.on || {})\n      .transacting(trx)\n      .execute();\n  }\n};\n\n/**\n * Clean the order columns by ensuring the order value are continuous (ex: 1, 2, 3 and not 1, 5, 10)\n */\nconst cleanOrderColumns = async ({\n  id,\n  attribute,\n  db,\n  inverseRelIds = [],\n  transaction: trx,\n}: {\n  id?: ID;\n  attribute: Relation.Bidirectional;\n  db: Database;\n  inverseRelIds?: ID[];\n  transaction?: Knex.Transaction;\n}) => {\n  if (\n    !(hasOrderColumn(attribute) && id) &&\n    !(hasInverseOrderColumn(attribute) && !isEmpty(inverseRelIds))\n  ) {\n    return;\n  }\n\n  const { joinTable } = attribute;\n  const { joinColumn, inverseJoinColumn, orderColumnName, inverseOrderColumnName } = joinTable;\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :joinColumn: ORDER BY :orderColumn:) AS src_order,\n    FROM :joinTable:\n    WHERE :joinColumn: = :id\n  ) AS b\n  SET :orderColumn: = b.src_order\n  WHERE b.id = a.id;\n  */\n  const updateOrderColumn = async () => {\n    if (!hasOrderColumn(attribute) || !id) {\n      return;\n    }\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('src_order', orderColumnName, joinColumn.name)\n        .where(joinColumn.name, id)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.src_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, orderColumnName]\n          )\n          .transacting(trx);\n\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.src_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, orderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  /**\n  UPDATE :joinTable: as a,\n  (\n    SELECT\n      id,\n      ROW_NUMBER() OVER ( PARTITION BY :inverseJoinColumn: ORDER BY :inverseOrderColumn:) AS inv_order\n    FROM :joinTable:\n    WHERE :inverseJoinColumn: IN (:inverseRelIds)\n  ) AS b\n  SET :inverseOrderColumn: = b.inv_order\n  WHERE b.id = a.id;\n  */\n  const updateInverseOrderColumn = async () => {\n    if (!hasInverseOrderColumn(attribute) || isEmpty(inverseRelIds)) return;\n\n    const selectRowsToOrder = (joinTableName: string) =>\n      db\n        .connection(joinTableName)\n        .select('id')\n        .rowNumber('inv_order', inverseOrderColumnName, inverseJoinColumn.name)\n        .where(inverseJoinColumn.name, 'in', inverseRelIds)\n        .toSQL();\n\n    switch (strapi.db.dialect.client) {\n      case 'mysql': {\n        // Here it's MariaDB and MySQL 8\n        const select = selectRowsToOrder(joinTable.name);\n\n        await db\n          .getConnection()\n          .raw(\n            `UPDATE ?? as a, ( ${select.sql} ) AS b\n            SET ?? = b.inv_order\n            WHERE b.id = a.id`,\n            [joinTable.name, ...select.bindings, inverseOrderColumnName]\n          )\n          .transacting(trx);\n        break;\n      }\n      default: {\n        const joinTableName = addSchema(db, joinTable.name);\n        const select = selectRowsToOrder(joinTableName);\n\n        // raw query as knex doesn't allow updating from a subquery\n        await db.connection\n          .raw(\n            `UPDATE ?? as a\n            SET ?? = b.inv_order\n            FROM ( ${select.sql} ) AS b\n            WHERE b.id = a.id`,\n            [joinTableName, inverseOrderColumnName, ...select.bindings]\n          )\n          .transacting(trx);\n      }\n    }\n  };\n\n  // Run updates in a deterministic order to avoid lock cycles on the same join table.\n  await updateOrderColumn();\n  await updateInverseOrderColumn();\n};\n\nexport {\n  deletePreviousOneToAnyRelations,\n  deletePreviousAnyToOneRelations,\n  deleteRelations,\n  cleanOrderColumns,\n};\n"],"names":["getDocumentSiblingIdsQuery","tableName","id","models","Array","from","strapi","db","metadata","values","isContentType","find","model","attributes","documentId","findDocumentSiblingIds","query","select","whereIn","documentIDSubQuery","where","deletePreviousOneToAnyRelations","attribute","relIdsToadd","transaction","trx","isBidirectional","isOneToAny","Error","joinTable","joinColumn","inverseJoinColumn","con","getConnection","delete","name","whereNotIn","referencedTable","on","transacting","cleanOrderColumns","inverseRelIds","deletePreviousAnyToOneRelations","relIdToadd","isAnyToOne","isManyToAny","relsToDelete","relIdsToDelete","map","createQueryBuilder","$in","execute","deleteRelations","relIdsToNotDelete","all","hasOrderColumn","hasInverseOrderColumn","lastId","done","batchSize","batchToDelete","$gt","$notIn","orderBy","limit","length","batchIds","isEmpty","orderColumnName","inverseOrderColumnName","updateOrderColumn","selectRowsToOrder","joinTableName","connection","rowNumber","toSQL","dialect","client","raw","sql","bindings","addSchema","updateInverseOrderColumn"],"mappings":";;;;;;AAyBA;AACA,MAAMA,0BAAAA,GAA6B,CAACC,SAAAA,EAAmBC,EAAAA,GAAAA;;;IAGrD,MAAMC,MAAAA,GAAkBC,MAAMC,IAAI,CAACC,OAAOC,EAAE,CAACC,QAAQ,CAACC,MAAM,EAAA,CAAA;AAE5D,IAAA,MAAMC,aAAAA,GAAgBP,MAAAA,CAAOQ,IAAI,CAAC,CAACC,KAAAA,GAAAA;AACjC,QAAA,OAAOA,MAAMX,SAAS,KAAKA,aAAaW,KAAAA,CAAMC,UAAU,CAACC,UAAU;AACrE,IAAA,CAAA,CAAA;AAEA,IAAA,IAAI,CAACJ,aAAAA,EAAe;QAClB,OAAO;AAACR,YAAAA;AAAG,SAAA;AACb,IAAA;;;IAIA,OAAO,SAASa,uBAAuBC,KAAK,EAAA;AAC1CA,QAAAA,KAAAA,CACGC,MAAM,CAAC,IAAA,CAAA,CACPZ,IAAI,CAACJ,UACN;SACCiB,OAAO,CAAC,eAAe,CAACC,kBAAAA,GAAAA;YACvBA,kBAAAA,CACGd,IAAI,CAACJ,SAAAA,CACN;AACCgB,aAAAA,MAAM,CAAC,aAAA,CAAA,CACPG,KAAK,CAAC,IAAA,EAAMlB,EAAAA,CAAAA;AACjB,QAAA,CAAA,CAAA;AACJ,IAAA,CAAA;AACF,CAAA;AAEA;;AAEC,IACD,MAAMmB,+BAAAA,GAAkC,OAAO,EAC7CnB,EAAE,EACFoB,SAAS,EACTC,WAAW,EACXhB,EAAE,EACFiB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IAAI,EAAEC,eAAAA,CAAgBJ,SAAAA,CAAAA,IAAcK,UAAAA,CAAWL,UAAS,CAAA,EAAI;AAC1D,QAAA,MAAM,IAAIM,KAAAA,CACR,yFAAA,CAAA;AAEJ,IAAA;IACA,MAAM,EAAEC,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAE1C,MAAMG,GAAAA,GAAMzB,GAAG0B,aAAa,EAAA;IAE5B,MAAMD,GAAAA,CACHE,MAAM,EAAA,CACN7B,IAAI,CAACwB,SAAAA,CAAUM,IAAI,CACpB;KACCC,UAAU,CAACN,WAAWK,IAAI,EAAEnC,2BAA2B8B,UAAAA,CAAWO,eAAe,EAAGnC,EAAAA,CAAAA,CACrF;AACCgB,KAAAA,OAAO,CAACa,iBAAAA,CAAkBI,IAAI,EAAEZ,WAAAA,CAAAA,CAChCH,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,IAAA,MAAMe,iBAAAA,CAAkB;AAAElB,QAAAA,SAAAA;AAAWf,QAAAA,EAAAA;QAAIkC,aAAAA,EAAelB,WAAAA;QAAaC,WAAAA,EAAaC;AAAI,KAAA,CAAA;AACxF;AAEA;;AAEC,IACD,MAAMiB,+BAAAA,GAAkC,OAAO,EAC7CxC,EAAE,EACFoB,SAAS,EACTqB,UAAU,EACVpC,EAAE,EACFiB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;IAC1C,MAAMG,GAAAA,GAAMzB,GAAG0B,aAAa,EAAA;IAE5B,IAAI,CAACW,WAAWtB,SAAAA,CAAAA,EAAY;AAC1B,QAAA,MAAM,IAAIM,KAAAA,CAAM,2EAAA,CAAA;AAClB,IAAA;;AAEA,IAAA,IAAIiB,YAAYvB,SAAAA,CAAAA,EAAY;;AAE1B,QAAA,MAAMwB,eAAe,MAAMd,GAAAA,CACxBf,MAAM,CAACc,kBAAkBI,IAAI,CAAA,CAC7B9B,IAAI,CAACwB,UAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,WAAWK,IAAI,EAAEjC,EAAAA,CAAAA,CACvBkC,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBnC,0BAAAA,CAA2B+B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AAEf,QAAA,MAAMsB,cAAAA,GAAiBC,GAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEW,YAAAA,CAAAA;QAEnD,MAAMG,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;YACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAEe,GAAAA,EAAKH;AAAe;SAClD,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,QAAA,MAAMX,iBAAAA,CAAkB;AAAElB,YAAAA,SAAAA;AAAWf,YAAAA,EAAAA;YAAIkC,aAAAA,EAAeM,cAAAA;YAAgBvB,WAAAA,EAAaC;AAAI,SAAA,CAAA;;IAG3F,CAAA,MAAO;AACL,QAAA,MAAMO,GAAAA,CACHE,MAAM,EAAA,CACN7B,IAAI,CAACwB,SAAAA,CAAUM,IAAI,CAAA,CACnBf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEjC,GACxB;AACCkC,SAAAA,UAAU,CACTL,iBAAAA,CAAkBI,IAAI,EACtBnC,0BAAAA,CAA2B+B,kBAAkBM,eAAe,EAAGM,UAAAA,CAAAA,CAAAA,CAEhEvB,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA;AACjB,IAAA;AACF;AAEA;;AAEC,UACK2B,eAAAA,GAAkB,OAAO,EAC7BlD,EAAE,EACFoB,SAAS,EACTf,EAAE,EACF8C,iBAAAA,GAAoB,EAAE,EACtBN,cAAAA,GAAiB,EAAE,EACnBvB,WAAAA,EAAaC,GAAG,EAQjB,GAAA;IACC,MAAM,EAAEI,SAAS,EAAE,GAAGP,SAAAA;AACtB,IAAA,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAE,GAAGF,SAAAA;AAC1C,IAAA,MAAMyB,MAAMP,cAAAA,KAAmB,KAAA;IAE/B,IAAIQ,cAAAA,CAAejC,SAAAA,CAAAA,IAAckC,qBAAAA,CAAsBlC,SAAAA,CAAAA,EAAY;AACjE,QAAA,IAAImC,MAAAA,GAAa,CAAA;AACjB,QAAA,IAAIC,IAAAA,GAAO,KAAA;AACX,QAAA,MAAMC,SAAAA,GAAY,GAAA;AAElB,QAAA,MAAO,CAACD,IAAAA,CAAM;AACZ,YAAA,MAAME,aAAAA,GAA8B,MAAMX,kBAAAA,CAAmBpB,SAAAA,CAAUM,IAAI,EAAE5B,EAAAA,CAAAA,CAC1EU,MAAM,CAACc,iBAAAA,CAAkBI,IAAI,CAAA,CAC7Bf,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;gBACnBA,EAAAA,EAAI;oBAAE2D,GAAAA,EAAKJ;AAAO,iBAAA;gBAClB,CAAC1B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAE2B,MAAAA,EAAQT;AAAkB,iBAAA;gBACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;oBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;wBAAEe,GAAAA,EAAKH;AAAe;;AACnE,aAAA,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvByB,OAAO,CAAC,IAAA,CAAA,CACRC,KAAK,CAACL,SAAAA,CAAAA,CACNpB,WAAW,CAACd,KACZ0B,OAAO,EAAA;YAEVO,IAAAA,GAAOE,aAAAA,CAAcK,MAAM,GAAGN,SAAAA;AAC9BF,YAAAA,MAAAA,GAASG,aAAa,CAACA,aAAAA,CAAcK,MAAM,GAAG,CAAA,CAAE,EAAE/D,EAAAA,IAAM,CAAA;AAExD,YAAA,MAAMgE,QAAAA,GAAWlB,GAAAA,CAAIjB,iBAAAA,CAAkBI,IAAI,EAAEyB,aAAAA,CAAAA;YAE7C,MAAMX,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;gBACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;gBACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKgB;AAAS;aAC5C,CAAA,CACC9C,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AAEV,YAAA,MAAMX,iBAAAA,CAAkB;AAAElB,gBAAAA,SAAAA;AAAWf,gBAAAA,EAAAA;AAAIL,gBAAAA,EAAAA;gBAAIuC,aAAAA,EAAeyB,QAAAA;gBAAU1C,WAAAA,EAAaC;AAAI,aAAA,CAAA;AACzF,QAAA;IACF,CAAA,MAAO;QACL,MAAMwB,kBAAAA,CAAmBpB,UAAUM,IAAI,EAAE5B,IACtC2B,MAAM,EAAA,CACNd,KAAK,CAAC;YACL,CAACU,UAAAA,CAAWK,IAAI,GAAGjC,EAAAA;YACnB,CAAC6B,iBAAAA,CAAkBI,IAAI,GAAG;gBAAE2B,MAAAA,EAAQT;AAAkB,aAAA;YACtD,GAAIC,GAAAA,GAAM,EAAC,GAAI;gBAAE,CAACvB,iBAAAA,CAAkBI,IAAI,GAAG;oBAAEe,GAAAA,EAAKH;AAAe;;SACnE,CAAA,CACC3B,KAAK,CAACS,SAAAA,CAAUS,EAAE,IAAI,EAAC,CAAA,CACvBC,WAAW,CAACd,GAAAA,CAAAA,CACZ0B,OAAO,EAAA;AACZ,IAAA;AACF;AAEA;;AAEC,IACD,MAAMX,iBAAAA,GAAoB,OAAO,EAC/BtC,EAAE,EACFoB,SAAS,EACTf,EAAE,EACFkC,aAAAA,GAAgB,EAAE,EAClBjB,WAAAA,EAAaC,GAAG,EAOjB,GAAA;AACC,IAAA,IACE,EAAE8B,cAAAA,CAAejC,SAAAA,CAAAA,IAAcpB,EAAC,CAAA,IAChC,EAAEsD,qBAAAA,CAAsBlC,SAAAA,CAAAA,IAAc,CAAC6C,OAAAA,CAAQ1B,cAAa,CAAA,EAC5D;AACA,QAAA;AACF,IAAA;IAEA,MAAM,EAAEZ,SAAS,EAAE,GAAGP,SAAAA;IACtB,MAAM,EAAEQ,UAAU,EAAEC,iBAAiB,EAAEqC,eAAe,EAAEC,sBAAsB,EAAE,GAAGxC,SAAAA;AAEnF;;;;;;;;;;;AAWA,KACA,MAAMyC,iBAAAA,GAAoB,UAAA;AACxB,QAAA,IAAI,CAACf,cAAAA,CAAejC,SAAAA,CAAAA,IAAc,CAACpB,EAAAA,EAAI;AACrC,YAAA;AACF,QAAA;QAEA,MAAMqE,iBAAAA,GAAoB,CAACC,aAAAA,GACzBjE,EAAAA,CACGkE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,WAAA,EAAaN,eAAAA,EAAiBtC,UAAAA,CAAWK,IAAI,CAAA,CACvDf,KAAK,CAACU,UAAAA,CAAWK,IAAI,EAAEjC,EAAAA,CAAAA,CACvByE,KAAK,EAAA;AAEV,QAAA,OAAQrE,MAAAA,CAAOC,EAAE,CAACqE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM5B,EAAAA,CACH0B,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEZ,wBAAAA;AAAgB,qBAAA,CAAA,CAEtD7B,WAAW,CAACd,GAAAA,CAAAA;AAEf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,SAAAA,CAAU1E,EAAAA,EAAIsB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMjE,EAAAA,CAAGkE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeJ,wBAAAA,eAAAA;AAAoBnD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAErDzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;AAEA;;;;;;;;;;;AAWA,KACA,MAAMyD,wBAAAA,GAA2B,UAAA;AAC/B,QAAA,IAAI,CAAC1B,qBAAAA,CAAsBlC,SAAAA,CAAAA,IAAc6C,OAAAA,CAAQ1B,aAAAA,CAAAA,EAAgB;QAEjE,MAAM8B,iBAAAA,GAAoB,CAACC,aAAAA,GACzBjE,EAAAA,CACGkE,UAAU,CAACD,aAAAA,CAAAA,CACXvD,MAAM,CAAC,IAAA,CAAA,CACPyD,SAAS,CAAC,aAAaL,sBAAAA,EAAwBtC,iBAAAA,CAAkBI,IAAI,CAAA,CACrEf,KAAK,CAACW,kBAAkBI,IAAI,EAAE,IAAA,EAAMM,aAAAA,CAAAA,CACpCkC,KAAK,EAAA;AAEV,QAAA,OAAQrE,MAAAA,CAAOC,EAAE,CAACqE,OAAO,CAACC,MAAM;YAC9B,KAAK,OAAA;AAAS,gBAAA;;oBAEZ,MAAM5D,MAAAA,GAASsD,iBAAAA,CAAkB1C,SAAAA,CAAUM,IAAI,CAAA;oBAE/C,MAAM5B,EAAAA,CACH0B,aAAa,EAAA,CACb6C,GAAG,CACF,CAAC,kBAAkB,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;;AAEf,6BAAA,CAAC,EAClB;AAAClD,wBAAAA,SAAAA,CAAUM,IAAI;AAAKlB,wBAAAA,GAAAA,MAAAA,CAAO+D,QAAQ;AAAEX,wBAAAA;AAAuB,qBAAA,CAAA,CAE7D9B,WAAW,CAACd,GAAAA,CAAAA;AACf,oBAAA;AACF,gBAAA;AACA,YAAA;AAAS,gBAAA;AACP,oBAAA,MAAM+C,aAAAA,GAAgBS,SAAAA,CAAU1E,EAAAA,EAAIsB,SAAAA,CAAUM,IAAI,CAAA;AAClD,oBAAA,MAAMlB,SAASsD,iBAAAA,CAAkBC,aAAAA,CAAAA;;AAGjC,oBAAA,MAAMjE,EAAAA,CAAGkE,UAAU,CAChBK,GAAG,CACF,CAAC;;mBAEM,EAAE7D,MAAAA,CAAO8D,GAAG,CAAC;AACH,6BAAA,CAAC,EAClB;AAACP,wBAAAA,aAAAA;AAAeH,wBAAAA,sBAAAA;AAA2BpD,wBAAAA,GAAAA,MAAAA,CAAO+D;AAAS,qBAAA,CAAA,CAE5DzC,WAAW,CAACd,GAAAA,CAAAA;AACjB,gBAAA;AACF;AACF,IAAA,CAAA;;IAGA,MAAM6C,iBAAAA,EAAAA;IACN,MAAMY,wBAAAA,EAAAA;AACR;;;;"}

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

@@ -160,21 +160,21 @@ var ___default = /*#__PURE__*/_interopDefault(_$1);
     const insertRelation = (r)=>{
         let idx;
         if (r.position?.before) {
-            const { idx: _idx, relation } = findRelation(r.position.before);
+            const { idx: relationIndex, relation } = findRelation(r.position.before);
             if (relation.init) {
                 r.order = relation.order - 0.5;
             } else {
                 r.order = relation.order;
             }
-            idx = _idx;
+            idx = relationIndex;
         } else if (r.position?.after) {
-            const { idx: _idx, relation } = findRelation(r.position.after);
+            const { idx: relationIndex, relation } = findRelation(r.position.after);
             if (relation.init) {
                 r.order = relation.order + 0.5;
             } else {
                 r.order = relation.order;
             }
-            idx = _idx + 1;
+            idx = relationIndex + 1;
         } else if (r.position?.start) {
             r.order = 0.5;
             idx = 0;

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[] = castArray(initArr ?? []).map((r) => ({\n    init: true,\n    id: r[idColumn] as ID,\n    order: Number(r[orderColumn]) || 1,\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: _idx, 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 = _idx;\n    } else if (r.position?.after) {\n      const { idx: _idx, 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\n      idx = _idx + 1;\n    } else if (r.position?.start) {\n      r.order = 0.5;\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 (err) {\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      return _(computedRelations)\n        .groupBy('order')\n        .reduce(\n          (acc, relations) => {\n            if (relations[0]?.init) return acc;\n            relations.forEach((relation, idx) => {\n              acc[relation.id] = Math.floor(relation.order) + (idx + 1) / (relations.length + 1);\n            });\n            return acc;\n          },\n          {} as Record<ID, number>\n        );\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","castArray","map","r","init","order","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","_idx","start","length","disconnect","relations","connect","err","Error","get","getOrderMap","_","groupBy","Math","floor"],"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;IAEA,MAAMC,iBAAAA,GAAmCC,YAAUL,OAAAA,IAAW,EAAE,EAAEM,GAAG,CAAC,CAACC,CAAAA,IAAO;YAC5EC,IAAAA,EAAM,IAAA;YACN/B,EAAAA,EAAI8B,CAAC,CAACN,QAAAA,CAAS;AACfQ,YAAAA,KAAAA,EAAOC,MAAAA,CAAOH,CAAC,CAACL,WAAAA,CAAY,CAAA,IAAK;SACnC,CAAA,CAAA;AAEA,IAAA,MAAMS,QAAAA,GAAWC,OAAAA,CAAM,OAAA,EAASR,iBAAAA,CAAAA,EAAoBK,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMI,eAAe,CAACpC,EAAAA,GAAAA;QACpB,MAAMqC,GAAAA,GAAMV,kBAAkBW,SAAS,CAAC,CAACR,CAAAA,GAAMA,CAAAA,CAAE9B,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEqC,YAAAA,GAAAA;YAAKlC,QAAAA,EAAUwB,iBAAiB,CAACU,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACT,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEO,GAAG,EAAE,GAAGD,YAAAA,CAAaN,EAAE9B,EAAE,CAAA;AACjC,QAAA,IAAIqC,OAAO,CAAA,EAAG;YACZV,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACX,CAAAA,GAAAA;QACtB,IAAIO,GAAAA;QAEJ,IAAIP,CAAAA,CAAEzB,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAE+B,GAAAA,EAAKK,IAAI,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACC,MAAM,CAAA;YAC9D,IAAIH,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;YACAK,GAAAA,GAAMK,IAAAA;AACR,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAE8B,GAAAA,EAAKK,IAAI,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACE,KAAK,CAAA;YAC7D,IAAIJ,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;AAEAK,YAAAA,GAAAA,GAAMK,IAAAA,GAAO,CAAA;AACf,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEsC,KAAAA,EAAO;AAC5Bb,YAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;YACVK,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLP,CAAAA,CAAEE,KAAK,GAAGE,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMV,kBAAkBiB,MAAM;AAChC,QAAA;;QAGAjB,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGP,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLe,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjClB,WAAAA,CAAUkB,SAAAA,CAAAA,CAAWzB,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BoC,cAAAA,CAAepC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACA4C,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9BxD,YAAAA,gBAAAA,CAAiBsC,YAAUkB,SAAAA,CAAAA,EAAYnB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC0C,UAAU,CAAC1C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFsC,cAAAA,CAAetC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAO6C,GAAAA,EAAK;AACZ,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gDAAgD,EAC/C9C,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;AACA6C,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAOvB,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGAwB,WAAAA,CAAAA,GAAAA;YACE,OAAOC,kBAAAA,CAAEzB,mBACN0B,OAAO,CAAC,SACRxD,MAAM,CACL,CAACC,GAAAA,EAAKgD,SAAAA,GAAAA;AACJ,gBAAA,IAAIA,SAAS,CAAC,CAAA,CAAE,EAAEf,MAAM,OAAOjC,GAAAA;gBAC/BgD,SAAAA,CAAUzB,OAAO,CAAC,CAAClB,QAAAA,EAAUkC,GAAAA,GAAAA;oBAC3BvC,GAAG,CAACK,SAASH,EAAE,CAAC,GAAGsD,IAAAA,CAAKC,KAAK,CAACpD,QAAAA,CAAS6B,KAAK,IAAI,CAACK,MAAM,CAAA,KAAMS,SAAAA,CAAUF,MAAM,GAAG,CAAA,CAAA;AAClF,gBAAA,CAAA,CAAA;gBACA,OAAO9C,GAAAA;AACT,YAAA,CAAA,EACA,EAAC,CAAA;AAEP,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 * @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[] = castArray(initArr ?? []).map((r) => ({\n    init: true,\n    id: r[idColumn] as ID,\n    order: Number(r[orderColumn]) || 1,\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: relationIndex, 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 = relationIndex;\n    } else if (r.position?.after) {\n      const { idx: relationIndex, 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\n      idx = relationIndex + 1;\n    } else if (r.position?.start) {\n      r.order = 0.5;\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 (err) {\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      return _(computedRelations)\n        .groupBy('order')\n        .reduce(\n          (acc, relations) => {\n            if (relations[0]?.init) return acc;\n            relations.forEach((relation, idx) => {\n              acc[relation.id] = Math.floor(relation.order) + (idx + 1) / (relations.length + 1);\n            });\n            return acc;\n          },\n          {} as Record<ID, number>\n        );\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","castArray","map","r","init","order","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","relationIndex","start","length","disconnect","relations","connect","err","Error","get","getOrderMap","_","groupBy","Math","floor"],"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;IAEA,MAAMC,iBAAAA,GAAmCC,YAAUL,OAAAA,IAAW,EAAE,EAAEM,GAAG,CAAC,CAACC,CAAAA,IAAO;YAC5EC,IAAAA,EAAM,IAAA;YACN/B,EAAAA,EAAI8B,CAAC,CAACN,QAAAA,CAAS;AACfQ,YAAAA,KAAAA,EAAOC,MAAAA,CAAOH,CAAC,CAACL,WAAAA,CAAY,CAAA,IAAK;SACnC,CAAA,CAAA;AAEA,IAAA,MAAMS,QAAAA,GAAWC,OAAAA,CAAM,OAAA,EAASR,iBAAAA,CAAAA,EAAoBK,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMI,eAAe,CAACpC,EAAAA,GAAAA;QACpB,MAAMqC,GAAAA,GAAMV,kBAAkBW,SAAS,CAAC,CAACR,CAAAA,GAAMA,CAAAA,CAAE9B,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEqC,YAAAA,GAAAA;YAAKlC,QAAAA,EAAUwB,iBAAiB,CAACU,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACT,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEO,GAAG,EAAE,GAAGD,YAAAA,CAAaN,EAAE9B,EAAE,CAAA;AACjC,QAAA,IAAIqC,OAAO,CAAA,EAAG;YACZV,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACX,CAAAA,GAAAA;QACtB,IAAIO,GAAAA;QAEJ,IAAIP,CAAAA,CAAEzB,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAE+B,GAAAA,EAAKK,aAAa,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACC,MAAM,CAAA;YACvE,IAAIH,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;YACAK,GAAAA,GAAMK,aAAAA;AACR,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAE8B,GAAAA,EAAKK,aAAa,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACE,KAAK,CAAA;YACtE,IAAIJ,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;AAEAK,YAAAA,GAAAA,GAAMK,aAAAA,GAAgB,CAAA;AACxB,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEsC,KAAAA,EAAO;AAC5Bb,YAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;YACVK,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLP,CAAAA,CAAEE,KAAK,GAAGE,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMV,kBAAkBiB,MAAM;AAChC,QAAA;;QAGAjB,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGP,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLe,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjClB,WAAAA,CAAUkB,SAAAA,CAAAA,CAAWzB,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BoC,cAAAA,CAAepC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACA4C,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9BxD,YAAAA,gBAAAA,CAAiBsC,YAAUkB,SAAAA,CAAAA,EAAYnB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC0C,UAAU,CAAC1C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFsC,cAAAA,CAAetC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAO6C,GAAAA,EAAK;AACZ,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gDAAgD,EAC/C9C,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;AACA6C,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAOvB,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGAwB,WAAAA,CAAAA,GAAAA;YACE,OAAOC,kBAAAA,CAAEzB,mBACN0B,OAAO,CAAC,SACRxD,MAAM,CACL,CAACC,GAAAA,EAAKgD,SAAAA,GAAAA;AACJ,gBAAA,IAAIA,SAAS,CAAC,CAAA,CAAE,EAAEf,MAAM,OAAOjC,GAAAA;gBAC/BgD,SAAAA,CAAUzB,OAAO,CAAC,CAAClB,QAAAA,EAAUkC,GAAAA,GAAAA;oBAC3BvC,GAAG,CAACK,SAASH,EAAE,CAAC,GAAGsD,IAAAA,CAAKC,KAAK,CAACpD,QAAAA,CAAS6B,KAAK,IAAI,CAACK,MAAM,CAAA,KAAMS,SAAAA,CAAUF,MAAM,GAAG,CAAA,CAAA;AAClF,gBAAA,CAAA,CAAA;gBACA,OAAO9C,GAAAA;AACT,YAAA,CAAA,EACA,EAAC,CAAA;AAEP,QAAA;AACF,KAAA;AACF;;;;;"}

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

@@ -154,21 +154,21 @@ import InvalidRelationError from '../errors/invalid-relation.mjs';
     const insertRelation = (r)=>{
         let idx;
         if (r.position?.before) {
-            const { idx: _idx, relation } = findRelation(r.position.before);
+            const { idx: relationIndex, relation } = findRelation(r.position.before);
             if (relation.init) {
                 r.order = relation.order - 0.5;
             } else {
                 r.order = relation.order;
             }
-            idx = _idx;
+            idx = relationIndex;
         } else if (r.position?.after) {
-            const { idx: _idx, relation } = findRelation(r.position.after);
+            const { idx: relationIndex, relation } = findRelation(r.position.after);
             if (relation.init) {
                 r.order = relation.order + 0.5;
             } else {
                 r.order = relation.order;
             }
-            idx = _idx + 1;
+            idx = relationIndex + 1;
         } else if (r.position?.start) {
             r.order = 0.5;
             idx = 0;

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[] = castArray(initArr ?? []).map((r) => ({\n    init: true,\n    id: r[idColumn] as ID,\n    order: Number(r[orderColumn]) || 1,\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: _idx, 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 = _idx;\n    } else if (r.position?.after) {\n      const { idx: _idx, 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\n      idx = _idx + 1;\n    } else if (r.position?.start) {\n      r.order = 0.5;\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 (err) {\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      return _(computedRelations)\n        .groupBy('order')\n        .reduce(\n          (acc, relations) => {\n            if (relations[0]?.init) return acc;\n            relations.forEach((relation, idx) => {\n              acc[relation.id] = Math.floor(relation.order) + (idx + 1) / (relations.length + 1);\n            });\n            return acc;\n          },\n          {} as Record<ID, number>\n        );\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","castArray","map","r","init","order","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","_idx","start","length","disconnect","relations","connect","err","Error","get","getOrderMap","_","groupBy","Math","floor"],"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;IAEA,MAAMC,iBAAAA,GAAmCC,UAAUL,OAAAA,IAAW,EAAE,EAAEM,GAAG,CAAC,CAACC,CAAAA,IAAO;YAC5EC,IAAAA,EAAM,IAAA;YACN/B,EAAAA,EAAI8B,CAAC,CAACN,QAAAA,CAAS;AACfQ,YAAAA,KAAAA,EAAOC,MAAAA,CAAOH,CAAC,CAACL,WAAAA,CAAY,CAAA,IAAK;SACnC,CAAA,CAAA;AAEA,IAAA,MAAMS,QAAAA,GAAWC,KAAAA,CAAM,OAAA,EAASR,iBAAAA,CAAAA,EAAoBK,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMI,eAAe,CAACpC,EAAAA,GAAAA;QACpB,MAAMqC,GAAAA,GAAMV,kBAAkBW,SAAS,CAAC,CAACR,CAAAA,GAAMA,CAAAA,CAAE9B,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEqC,YAAAA,GAAAA;YAAKlC,QAAAA,EAAUwB,iBAAiB,CAACU,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACT,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEO,GAAG,EAAE,GAAGD,YAAAA,CAAaN,EAAE9B,EAAE,CAAA;AACjC,QAAA,IAAIqC,OAAO,CAAA,EAAG;YACZV,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACX,CAAAA,GAAAA;QACtB,IAAIO,GAAAA;QAEJ,IAAIP,CAAAA,CAAEzB,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAE+B,GAAAA,EAAKK,IAAI,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACC,MAAM,CAAA;YAC9D,IAAIH,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;YACAK,GAAAA,GAAMK,IAAAA;AACR,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAE8B,GAAAA,EAAKK,IAAI,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACE,KAAK,CAAA;YAC7D,IAAIJ,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;AAEAK,YAAAA,GAAAA,GAAMK,IAAAA,GAAO,CAAA;AACf,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEsC,KAAAA,EAAO;AAC5Bb,YAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;YACVK,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLP,CAAAA,CAAEE,KAAK,GAAGE,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMV,kBAAkBiB,MAAM;AAChC,QAAA;;QAGAjB,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGP,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLe,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjClB,SAAAA,CAAUkB,SAAAA,CAAAA,CAAWzB,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BoC,cAAAA,CAAepC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACA4C,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9BxD,YAAAA,gBAAAA,CAAiBsC,UAAUkB,SAAAA,CAAAA,EAAYnB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC0C,UAAU,CAAC1C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFsC,cAAAA,CAAetC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAO6C,GAAAA,EAAK;AACZ,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gDAAgD,EAC/C9C,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;AACA6C,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAOvB,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGAwB,WAAAA,CAAAA,GAAAA;YACE,OAAOC,CAAAA,CAAEzB,mBACN0B,OAAO,CAAC,SACRxD,MAAM,CACL,CAACC,GAAAA,EAAKgD,SAAAA,GAAAA;AACJ,gBAAA,IAAIA,SAAS,CAAC,CAAA,CAAE,EAAEf,MAAM,OAAOjC,GAAAA;gBAC/BgD,SAAAA,CAAUzB,OAAO,CAAC,CAAClB,QAAAA,EAAUkC,GAAAA,GAAAA;oBAC3BvC,GAAG,CAACK,SAASH,EAAE,CAAC,GAAGsD,IAAAA,CAAKC,KAAK,CAACpD,QAAAA,CAAS6B,KAAK,IAAI,CAACK,MAAM,CAAA,KAAMS,SAAAA,CAAUF,MAAM,GAAG,CAAA,CAAA;AAClF,gBAAA,CAAA,CAAA;gBACA,OAAO9C,GAAAA;AACT,YAAA,CAAA,EACA,EAAC,CAAA;AAEP,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 * @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[] = castArray(initArr ?? []).map((r) => ({\n    init: true,\n    id: r[idColumn] as ID,\n    order: Number(r[orderColumn]) || 1,\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: relationIndex, 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 = relationIndex;\n    } else if (r.position?.after) {\n      const { idx: relationIndex, 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\n      idx = relationIndex + 1;\n    } else if (r.position?.start) {\n      r.order = 0.5;\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 (err) {\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      return _(computedRelations)\n        .groupBy('order')\n        .reduce(\n          (acc, relations) => {\n            if (relations[0]?.init) return acc;\n            relations.forEach((relation, idx) => {\n              acc[relation.id] = Math.floor(relation.order) + (idx + 1) / (relations.length + 1);\n            });\n            return acc;\n          },\n          {} as Record<ID, number>\n        );\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","castArray","map","r","init","order","Number","maxOrder","maxBy","findRelation","idx","findIndex","removeRelation","splice","insertRelation","relationIndex","start","length","disconnect","relations","connect","err","Error","get","getOrderMap","_","groupBy","Math","floor"],"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;IAEA,MAAMC,iBAAAA,GAAmCC,UAAUL,OAAAA,IAAW,EAAE,EAAEM,GAAG,CAAC,CAACC,CAAAA,IAAO;YAC5EC,IAAAA,EAAM,IAAA;YACN/B,EAAAA,EAAI8B,CAAC,CAACN,QAAAA,CAAS;AACfQ,YAAAA,KAAAA,EAAOC,MAAAA,CAAOH,CAAC,CAACL,WAAAA,CAAY,CAAA,IAAK;SACnC,CAAA,CAAA;AAEA,IAAA,MAAMS,QAAAA,GAAWC,KAAAA,CAAM,OAAA,EAASR,iBAAAA,CAAAA,EAAoBK,KAAAA,IAAS,CAAA;AAE7D,IAAA,MAAMI,eAAe,CAACpC,EAAAA,GAAAA;QACpB,MAAMqC,GAAAA,GAAMV,kBAAkBW,SAAS,CAAC,CAACR,CAAAA,GAAMA,CAAAA,CAAE9B,EAAE,KAAKA,EAAAA,CAAAA;QACxD,OAAO;AAAEqC,YAAAA,GAAAA;YAAKlC,QAAAA,EAAUwB,iBAAiB,CAACU,GAAAA;AAAK,SAAA;AACjD,IAAA,CAAA;AAEA,IAAA,MAAME,iBAAiB,CAACT,CAAAA,GAAAA;AACtB,QAAA,MAAM,EAAEO,GAAG,EAAE,GAAGD,YAAAA,CAAaN,EAAE9B,EAAE,CAAA;AACjC,QAAA,IAAIqC,OAAO,CAAA,EAAG;YACZV,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,CAAA;AAChC,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMI,iBAAiB,CAACX,CAAAA,GAAAA;QACtB,IAAIO,GAAAA;QAEJ,IAAIP,CAAAA,CAAEzB,QAAQ,EAAEC,MAAAA,EAAQ;YACtB,MAAM,EAAE+B,GAAAA,EAAKK,aAAa,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACC,MAAM,CAAA;YACvE,IAAIH,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;YACAK,GAAAA,GAAMK,aAAAA;AACR,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEE,KAAAA,EAAO;YAC5B,MAAM,EAAE8B,GAAAA,EAAKK,aAAa,EAAEvC,QAAQ,EAAE,GAAGiC,YAAAA,CAAaN,CAAAA,CAAEzB,QAAQ,CAACE,KAAK,CAAA;YACtE,IAAIJ,QAAAA,CAAS4B,IAAI,EAAE;AACjBD,gBAAAA,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK,GAAG,GAAA;YAC7B,CAAA,MAAO;gBACLF,CAAAA,CAAEE,KAAK,GAAG7B,QAAAA,CAAS6B,KAAK;AAC1B,YAAA;AAEAK,YAAAA,GAAAA,GAAMK,aAAAA,GAAgB,CAAA;AACxB,QAAA,CAAA,MAAO,IAAIZ,CAAAA,CAAEzB,QAAQ,EAAEsC,KAAAA,EAAO;AAC5Bb,YAAAA,CAAAA,CAAEE,KAAK,GAAG,GAAA;YACVK,GAAAA,GAAM,CAAA;QACR,CAAA,MAAO;YACLP,CAAAA,CAAEE,KAAK,GAAGE,QAAAA,GAAW,GAAA;AACrBG,YAAAA,GAAAA,GAAMV,kBAAkBiB,MAAM;AAChC,QAAA;;QAGAjB,iBAAAA,CAAkBa,MAAM,CAACH,GAAAA,EAAK,CAAA,EAAGP,CAAAA,CAAAA;AACnC,IAAA,CAAA;IAEA,OAAO;AACLe,QAAAA,UAAAA,CAAAA,CAAWC,SAAwB,EAAA;YACjClB,SAAAA,CAAUkB,SAAAA,CAAAA,CAAWzB,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBAC5BoC,cAAAA,CAAepC,QAAAA,CAAAA;AACjB,YAAA,CAAA,CAAA;AACA,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AACA4C,QAAAA,OAAAA,CAAAA,CAAQD,SAAwB,EAAA;AAC9BxD,YAAAA,gBAAAA,CAAiBsC,UAAUkB,SAAAA,CAAAA,EAAYnB,iBAAAA,EAAmBD,MAAAA,CAAAA,CAAQL,OAAO,CAAC,CAAClB,QAAAA,GAAAA;gBACzE,IAAI,CAAC0C,UAAU,CAAC1C,QAAAA,CAAAA;gBAEhB,IAAI;oBACFsC,cAAAA,CAAetC,QAAAA,CAAAA;AACjB,gBAAA,CAAA,CAAE,OAAO6C,GAAAA,EAAK;AACZ,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gDAAgD,EAC/C9C,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;AACA6C,QAAAA,GAAAA,CAAAA,GAAAA;YACE,OAAOvB,iBAAAA;AACT,QAAA,CAAA;AACA;;QAGAwB,WAAAA,CAAAA,GAAAA;YACE,OAAOC,CAAAA,CAAEzB,mBACN0B,OAAO,CAAC,SACRxD,MAAM,CACL,CAACC,GAAAA,EAAKgD,SAAAA,GAAAA;AACJ,gBAAA,IAAIA,SAAS,CAAC,CAAA,CAAE,EAAEf,MAAM,OAAOjC,GAAAA;gBAC/BgD,SAAAA,CAAUzB,OAAO,CAAC,CAAClB,QAAAA,EAAUkC,GAAAA,GAAAA;oBAC3BvC,GAAG,CAACK,SAASH,EAAE,CAAC,GAAGsD,IAAAA,CAAKC,KAAK,CAACpD,QAAAA,CAAS6B,KAAK,IAAI,CAACK,MAAM,CAAA,KAAMS,SAAAA,CAAUF,MAAM,GAAG,CAAA,CAAA;AAClF,gBAAA,CAAA,CAAA;gBACA,OAAO9C,GAAAA;AACT,YAAA,CAAA,EACA,EAAC,CAAA;AAEP,QAAA;AACF,KAAA;AACF;;;;"}

package/dist/query/helpers/order-by.js

@@ -194,7 +194,7 @@ const getStrapiOrderColumnAlias = (column)=>{
     // Notes:
     // - Only select the first row for each partition
     // - Since we're applying the "where" statement directly on baseQuery (and not on resultQuery), we're using an inner join to avoid unwanted rows
-    .innerJoin(selectRowsAsNumberedPartitions, function() {
+    .innerJoin(selectRowsAsNumberedPartitions, function joinPartitionedRows() {
         this// Only select rows that are returned by T
         .on(`${partitionedQueryAlias}.id`, `${resultQueryAlias}.id`)// By only selecting the rows number equal to 1, we make sure we don't have duplicate, and that
         // we're selecting rows in the correct order amongst the groups created by the "partition by"

package/dist/query/helpers/order-by.js.map

@@ -1 +1 @@
-{"version":3,"file":"order-by.js","sources":["../../../src/query/helpers/order-by.ts"],"sourcesContent":["import _ from 'lodash/fp';\nimport knex from 'knex';\n\nimport * as types from '../../utils/types';\nimport { createJoin } from './join';\nimport { toColumnName } from './transform';\n\nimport type { Ctx } from '../types';\n\ntype OrderByCtx = Ctx & { alias?: string };\ntype OrderBy = string | { [key: string]: 'asc' | 'desc' } | OrderBy[];\ntype OrderByColumnValue = { column: string; order?: 'asc' | 'desc' };\ntype OrderByRawValue = { rawExpression: 'status'; isI18n?: boolean; order?: 'asc' | 'desc' };\nexport type OrderByValue = OrderByColumnValue | OrderByRawValue;\n\nconst COL_STRAPI_ROW_NUMBER = '__strapi_row_number';\nconst COL_STRAPI_ORDER_BY_PREFIX = '__strapi_order_by';\n\n/**\n * Builds a SQL CASE expression that maps each row to a numeric status rank:\n *   0 = draft/created (no published sibling with same documentId [+ locale])\n *   1 = modified (draft updated_at > published updated_at for same documentId [+ locale])\n *   2 = published\n *\n * @param db - Database instance (used to access knex raw)\n * @param tableName - Actual DB table name (used in correlated subqueries)\n * @param tableAlias - Alias of the table in the outer query (e.g. \"t0\")\n * @param isI18n - When true, adds a locale condition to avoid cross-locale contamination\n */\nexport const buildStatusSortExpression = (\n  db: { connection: { raw: (sql: string, bindings?: unknown[]) => knex.Knex.Raw } },\n  tableName: string,\n  tableAlias: string,\n  isI18n = false\n): knex.Knex.Raw => {\n  const localeCondition = isI18n ? ` AND sub.locale = ${tableAlias}.locale` : '';\n\n  return db.connection.raw(\n    `CASE WHEN NOT EXISTS(SELECT 1 FROM ?? sub WHERE sub.document_id = ${tableAlias}.document_id AND sub.published_at IS NOT NULL${localeCondition}) THEN 0 WHEN ${tableAlias}.updated_at > (SELECT MAX(sub.updated_at) FROM ?? sub WHERE sub.document_id = ${tableAlias}.document_id AND sub.published_at IS NOT NULL${localeCondition}) THEN 1 ELSE 2 END`,\n    [tableName, tableName]\n  );\n};\n\n/** DB handle accepted by {@link buildStatusSortExpression}. */\ntype StatusSortDb = Parameters<typeof buildStatusSortExpression>[0];\n\n/**\n * Shape passed to Knex `orderBy` for compound ordering. Knex accepts `Knex.Raw` in the column\n * position at runtime; generated typings sometimes only list string.\n */\nexport type KnexOrderByColumnDescriptor = {\n  column: string | knex.Knex.Raw;\n  order?: 'asc' | 'desc';\n};\n\n/**\n * Maps processed {@link OrderByValue} entries to descriptors Knex can consume. Translates the\n * virtual `status` sort into a parameterized raw SQL expression.\n */\nexport const toKnexOrderByDescriptor = (\n  db: StatusSortDb,\n  tableName: string,\n  rootTableAlias: string,\n  entry: OrderByValue\n): KnexOrderByColumnDescriptor => {\n  if ('rawExpression' in entry) {\n    return {\n      column: buildStatusSortExpression(db, tableName, rootTableAlias, entry.isI18n),\n      order: entry.order,\n    };\n  }\n\n  return { column: entry.column, order: entry.order };\n};\n\nexport const processOrderBy = (orderBy: OrderBy, ctx: OrderByCtx): OrderByValue[] => {\n  const { db, uid, qb, alias } = ctx;\n  const meta = db.metadata.get(uid);\n  const { attributes } = meta;\n\n  if (typeof orderBy === 'string') {\n    if (orderBy === 'status') {\n      if (!attributes.publishedAt || !attributes.documentId) {\n        throw new Error(\n          `Cannot order by status on model ${uid}: missing publishedAt or documentId`\n        );\n      }\n      const isI18n = 'locale' in attributes;\n      return [{ rawExpression: 'status' as const, isI18n, order: undefined }];\n    }\n\n    const attribute = attributes[orderBy];\n\n    if (!attribute) {\n      throw new Error(`Attribute ${orderBy} not found on model ${uid}`);\n    }\n\n    const columnName = toColumnName(meta, orderBy);\n\n    return [{ column: qb.aliasColumn(columnName, alias) }];\n  }\n\n  if (Array.isArray(orderBy)) {\n    return orderBy.flatMap((value) => processOrderBy(value, ctx));\n  }\n\n  if (_.isPlainObject(orderBy)) {\n    return Object.entries(orderBy).flatMap(([key, direction]) => {\n      const value = orderBy[key];\n\n      if (key === 'status') {\n        if (!attributes.publishedAt || !attributes.documentId) {\n          throw new Error(\n            `Cannot order by status on model ${uid}: missing publishedAt or documentId`\n          );\n        }\n        const isI18n = 'locale' in attributes;\n        return [{ rawExpression: 'status' as const, isI18n, order: direction as 'asc' | 'desc' }];\n      }\n\n      const attribute = attributes[key];\n\n      if (!attribute) {\n        throw new Error(`Attribute ${key} not found on model ${uid}`);\n      }\n\n      if (types.isScalar(attribute.type)) {\n        const columnName = toColumnName(meta, key);\n\n        return { column: qb.aliasColumn(columnName, alias), order: direction };\n      }\n\n      if (attribute.type === 'relation' && 'target' in attribute) {\n        const subAlias = createJoin(ctx, {\n          alias: alias || qb.alias,\n          attributeName: key,\n          attribute,\n        });\n\n        return processOrderBy(value, {\n          db,\n          qb,\n          alias: subAlias,\n          uid: attribute.target,\n        });\n      }\n\n      throw new Error(`You cannot order on ${attribute.type} types`);\n    });\n  }\n\n  throw new Error('Invalid orderBy syntax');\n};\n\nexport const getStrapiOrderColumnAlias = (column: string) => {\n  const trimmedColumnName = column.replaceAll('.', '_');\n\n  return `${COL_STRAPI_ORDER_BY_PREFIX}__${trimmedColumnName}`;\n};\n\n/**\n * Wraps the original Knex query with deep sorting functionality.\n *\n * The function takes an original query and an OrderByCtx object as parameters and returns a new Knex query with deep sorting applied.\n */\nexport const wrapWithDeepSort = (originalQuery: knex.Knex.QueryBuilder, ctx: OrderByCtx) => {\n  /**\n   * Notes:\n   * - The generated query has the following flow: baseQuery (filtered unsorted data) -> T (partitioned/sorted data) --> resultQuery (distinct, paginated, sorted data)\n   * - Pagination and selection are transferred from the original query to the outer one to avoid pruning rows too early\n   * - Filtering (where) has to be done in the deepest sub query possible to avoid processing invalid rows and corrupting the final results\n   * - We assume that all necessary joins are done in the original query (`originalQuery`), and every needed column is available with the right name and alias.\n   */\n\n  const { db, qb, uid } = ctx;\n\n  const { tableName } = db.metadata.get(uid);\n\n  // The orderBy is cloned to avoid unwanted mutations of the original object\n  const orderBy = _.cloneDeep<OrderByValue[]>(qb.state.orderBy);\n\n  // Separate column-based entries from raw-expression entries (e.g. status)\n  const columnOrderBy = orderBy.filter((ob): ob is OrderByColumnValue => 'column' in ob);\n  const rawExpressionOrderBy = orderBy.filter((ob): ob is OrderByRawValue => 'rawExpression' in ob);\n\n  // 0. Init a new Knex query instance (referenced as resultQuery) using the DB connection\n  //    The connection reuse the original table name (aliased if needed)\n  const resultQueryAlias = qb.getAlias();\n  const aliasedTableName = qb.mustUseAlias() ? alias(resultQueryAlias, tableName) : tableName;\n\n  const resultQuery = db.getConnection(aliasedTableName);\n\n  // 1. Clone the original query to create the sub-query (referenced as baseQuery) and avoid any mutation on the initial object\n  const baseQuery = originalQuery.clone();\n  const baseQueryAlias = qb.getAlias();\n\n  // Clear unwanted statements from the sub-query 'baseQuery'\n  // Note: `first()` is cleared through the combination of `baseQuery.clear('limit')` and calling `baseQuery.select(...)` again\n  // Note: Those statements will be re-applied when duplicates are removed from the final selection\n  baseQuery\n    // Columns selection\n    .clear('select')\n    // Pagination and sorting\n    .clear('order')\n    .clear('limit')\n    .clear('offset');\n\n  // Override the initial select and return only the columns needed for the partitioning.\n  // Only column-based orderBy entries are included here; raw expressions are applied later.\n  baseQuery.select(\n    // Always select the row id for future manipulation\n    prefix(qb.alias, 'id'),\n    // Select every column used in an order by clause, but alias it for future reference\n    // i.e. if t2.name is present in an order by clause:\n    //      Then, \"t2.name\" will become \"t2.name as __strapi_order_by__t2_name\"\n    ...columnOrderBy.map((orderByClause) =>\n      alias(getStrapiOrderColumnAlias(orderByClause.column), orderByClause.column)\n    )\n  );\n\n  // 2. Create a sub-query callback to extract and sort the partitions using row number\n  const partitionedQueryAlias = qb.getAlias();\n\n  const selectRowsAsNumberedPartitions = (partitionedQuery: knex.Knex.QueryBuilder) => {\n    // Transform order by clause to their alias to reference them from baseQuery\n    const prefixedOrderBy = columnOrderBy.map((orderByClause) => ({\n      column: prefix(baseQueryAlias, getStrapiOrderColumnAlias(orderByClause.column)),\n      order: orderByClause.order,\n    }));\n\n    // partitionedQuery select must contain every column used for sorting\n    const orderByColumns = prefixedOrderBy.map<string>(_.prop('column'));\n\n    partitionedQuery\n      .select(\n        // Always select baseQuery.id\n        prefix(baseQueryAlias, 'id'),\n        // Sort columns\n        ...orderByColumns\n      )\n      // The row number is used to assign an index to every row in every partition\n      .rowNumber(COL_STRAPI_ROW_NUMBER, (subQuery) => {\n        for (const orderByClause of prefixedOrderBy) {\n          subQuery.orderBy(orderByClause.column, orderByClause.order, 'last');\n        }\n\n        // And each partition/group is created based on baseQuery.id\n        subQuery.partitionBy(`${baseQueryAlias}.id`);\n      })\n      .from(baseQuery.as(baseQueryAlias))\n      .as(partitionedQueryAlias);\n  };\n\n  // 3. Create the final resultQuery query, that select and sort the wanted data using T\n\n  // Filter to string-only select items before diffing (Knex.Raw items are passed through as-is)\n  const stringSelect = qb.state.select.filter((s): s is string => typeof s === 'string');\n  const originalSelect = _.difference(\n    stringSelect,\n    // Remove column-based order by columns from the initial select (raw expressions are not in select)\n    columnOrderBy.map(_.prop('column'))\n  )\n    // Alias everything in resultQuery\n    .map((col) => `${resultQueryAlias}.${col}`);\n\n  resultQuery\n    .select(originalSelect)\n    // Join T to resultQuery to access sorted data\n    // Notes:\n    // - Only select the first row for each partition\n    // - Since we're applying the \"where\" statement directly on baseQuery (and not on resultQuery), we're using an inner join to avoid unwanted rows\n    .innerJoin(selectRowsAsNumberedPartitions, function () {\n      this\n        // Only select rows that are returned by T\n        .on(`${partitionedQueryAlias}.id`, `${resultQueryAlias}.id`)\n        // By only selecting the rows number equal to 1, we make sure we don't have duplicate, and that\n        // we're selecting rows in the correct order amongst the groups created by the \"partition by\"\n        .andOnVal(`${partitionedQueryAlias}.${COL_STRAPI_ROW_NUMBER}`, '=', 1);\n    });\n\n  // Re-apply pagination params\n\n  if (qb.state.limit) {\n    resultQuery.limit(qb.state.limit);\n  }\n\n  if (qb.state.offset) {\n    resultQuery.offset(qb.state.offset);\n  }\n\n  if (qb.state.first) {\n    resultQuery.first();\n  }\n\n  // Re-apply the sort using T values (column-based), then append raw expression sorts.\n  // Cast to any[] because Knex's TS types don't accept Knex.Raw in the column position,\n  // even though Knex supports it at runtime.\n  resultQuery.orderBy([\n    // Transform column-based \"order by\" clause to their T alias and prefix them with T alias\n    ...columnOrderBy.map((orderByClause) => ({\n      column: prefix(partitionedQueryAlias, getStrapiOrderColumnAlias(orderByClause.column)),\n      order: orderByClause.order,\n    })),\n    // Rebuild raw expression entries with the correct outer alias (resultQueryAlias)\n    ...rawExpressionOrderBy.map((entry) => ({\n      column: buildStatusSortExpression(db, tableName, resultQueryAlias, entry.isI18n),\n      order: entry.order,\n    })),\n    // Add T.id to the order by clause to get consistent results in case several rows have the exact same order\n    { column: `${partitionedQueryAlias}.id`, order: 'asc' },\n  ] as any);\n\n  return resultQuery;\n};\n\n// Utils\nconst alias = _.curry((alias: string, value: string) => `${value} as ${alias}`);\nconst prefix = _.curry((prefix: string, value: string) => `${prefix}.${value}`);\n"],"names":["COL_STRAPI_ROW_NUMBER","COL_STRAPI_ORDER_BY_PREFIX","buildStatusSortExpression","db","tableName","tableAlias","isI18n","localeCondition","connection","raw","toKnexOrderByDescriptor","rootTableAlias","entry","column","order","processOrderBy","orderBy","ctx","uid","qb","alias","meta","metadata","get","attributes","publishedAt","documentId","Error","rawExpression","undefined","attribute","columnName","toColumnName","aliasColumn","Array","isArray","flatMap","value","_","isPlainObject","Object","entries","key","direction","types","type","subAlias","createJoin","attributeName","target","getStrapiOrderColumnAlias","trimmedColumnName","replaceAll","wrapWithDeepSort","originalQuery","cloneDeep","state","columnOrderBy","filter","ob","rawExpressionOrderBy","resultQueryAlias","getAlias","aliasedTableName","mustUseAlias","resultQuery","getConnection","baseQuery","clone","baseQueryAlias","clear","select","prefix","map","orderByClause","partitionedQueryAlias","selectRowsAsNumberedPartitions","partitionedQuery","prefixedOrderBy","orderByColumns","prop","rowNumber","subQuery","partitionBy","from","as","stringSelect","s","originalSelect","difference","col","innerJoin","on","andOnVal","limit","offset","first","curry"],"mappings":";;;;;;;;;;;AAeA,MAAMA,qBAAAA,GAAwB,qBAAA;AAC9B,MAAMC,0BAAAA,GAA6B,mBAAA;AAEnC;;;;;;;;;;UAWaC,yBAAAA,GAA4B,CACvCC,IACAC,SAAAA,EACAC,UAAAA,EACAC,SAAS,KAAK,GAAA;IAEd,MAAMC,eAAAA,GAAkBD,SAAS,CAAC,kBAAkB,EAAED,UAAAA,CAAW,OAAO,CAAC,GAAG,EAAA;IAE5E,OAAOF,EAAAA,CAAGK,UAAU,CAACC,GAAG,CACtB,CAAC,kEAAkE,EAAEJ,UAAAA,CAAW,6CAA6C,EAAEE,gBAAgB,cAAc,EAAEF,UAAAA,CAAW,8EAA8E,EAAEA,UAAAA,CAAW,6CAA6C,EAAEE,eAAAA,CAAgB,mBAAmB,CAAC,EACxV;AAACH,QAAAA,SAAAA;AAAWA,QAAAA;AAAU,KAAA,CAAA;AAE1B;AAcA;;;AAGC,IACM,MAAMM,uBAAAA,GAA0B,CACrCP,EAAAA,EACAC,WACAO,cAAAA,EACAC,KAAAA,GAAAA;AAEA,IAAA,IAAI,mBAAmBA,KAAAA,EAAO;QAC5B,OAAO;AACLC,YAAAA,MAAAA,EAAQX,yBAAAA,CAA0BC,EAAAA,EAAIC,SAAAA,EAAWO,cAAAA,EAAgBC,MAAMN,MAAM,CAAA;AAC7EQ,YAAAA,KAAAA,EAAOF,MAAME;AACf,SAAA;AACF,IAAA;IAEA,OAAO;AAAED,QAAAA,MAAAA,EAAQD,MAAMC,MAAM;AAAEC,QAAAA,KAAAA,EAAOF,MAAME;AAAM,KAAA;AACpD;AAEO,MAAMC,cAAAA,GAAiB,CAACC,OAAAA,EAAkBC,GAAAA,GAAAA;IAC/C,MAAM,EAAEd,EAAE,EAAEe,GAAG,EAAEC,EAAE,EAAEC,KAAK,EAAE,GAAGH,GAAAA;AAC/B,IAAA,MAAMI,IAAAA,GAAOlB,EAAAA,CAAGmB,QAAQ,CAACC,GAAG,CAACL,GAAAA,CAAAA;IAC7B,MAAM,EAAEM,UAAU,EAAE,GAAGH,IAAAA;IAEvB,IAAI,OAAOL,YAAY,QAAA,EAAU;AAC/B,QAAA,IAAIA,YAAY,QAAA,EAAU;AACxB,YAAA,IAAI,CAACQ,UAAAA,CAAWC,WAAW,IAAI,CAACD,UAAAA,CAAWE,UAAU,EAAE;AACrD,gBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gCAAgC,EAAET,GAAAA,CAAI,mCAAmC,CAAC,CAAA;AAE/E,YAAA;AACA,YAAA,MAAMZ,SAAS,QAAA,IAAYkB,UAAAA;YAC3B,OAAO;AAAC,gBAAA;oBAAEI,aAAAA,EAAe,QAAA;AAAmBtB,oBAAAA,MAAAA;oBAAQQ,KAAAA,EAAOe;AAAU;AAAE,aAAA;AACzE,QAAA;QAEA,MAAMC,SAAAA,GAAYN,UAAU,CAACR,OAAAA,CAAQ;AAErC,QAAA,IAAI,CAACc,SAAAA,EAAW;YACd,MAAM,IAAIH,MAAM,CAAC,UAAU,EAAEX,OAAAA,CAAQ,oBAAoB,EAAEE,GAAAA,CAAAA,CAAK,CAAA;AAClE,QAAA;QAEA,MAAMa,UAAAA,GAAaC,uBAAaX,IAAAA,EAAML,OAAAA,CAAAA;QAEtC,OAAO;AAAC,YAAA;gBAAEH,MAAAA,EAAQM,EAAAA,CAAGc,WAAW,CAACF,UAAAA,EAAYX,KAAAA;AAAO;AAAE,SAAA;AACxD,IAAA;IAEA,IAAIc,KAAAA,CAAMC,OAAO,CAACnB,OAAAA,CAAAA,EAAU;AAC1B,QAAA,OAAOA,QAAQoB,OAAO,CAAC,CAACC,KAAAA,GAAUtB,eAAesB,KAAAA,EAAOpB,GAAAA,CAAAA,CAAAA;AAC1D,IAAA;IAEA,IAAIqB,kBAAAA,CAAEC,aAAa,CAACvB,OAAAA,CAAAA,EAAU;QAC5B,OAAOwB,MAAAA,CAAOC,OAAO,CAACzB,OAAAA,CAAAA,CAASoB,OAAO,CAAC,CAAC,CAACM,GAAAA,EAAKC,SAAAA,CAAU,GAAA;YACtD,MAAMN,KAAAA,GAAQrB,OAAO,CAAC0B,GAAAA,CAAI;AAE1B,YAAA,IAAIA,QAAQ,QAAA,EAAU;AACpB,gBAAA,IAAI,CAAClB,UAAAA,CAAWC,WAAW,IAAI,CAACD,UAAAA,CAAWE,UAAU,EAAE;AACrD,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gCAAgC,EAAET,GAAAA,CAAI,mCAAmC,CAAC,CAAA;AAE/E,gBAAA;AACA,gBAAA,MAAMZ,SAAS,QAAA,IAAYkB,UAAAA;gBAC3B,OAAO;AAAC,oBAAA;wBAAEI,aAAAA,EAAe,QAAA;AAAmBtB,wBAAAA,MAAAA;wBAAQQ,KAAAA,EAAO6B;AAA4B;AAAE,iBAAA;AAC3F,YAAA;YAEA,MAAMb,SAAAA,GAAYN,UAAU,CAACkB,GAAAA,CAAI;AAEjC,YAAA,IAAI,CAACZ,SAAAA,EAAW;gBACd,MAAM,IAAIH,MAAM,CAAC,UAAU,EAAEe,GAAAA,CAAI,oBAAoB,EAAExB,GAAAA,CAAAA,CAAK,CAAA;AAC9D,YAAA;AAEA,YAAA,IAAI0B,cAAc,CAACd,SAAAA,CAAUe,IAAI,CAAA,EAAG;gBAClC,MAAMd,UAAAA,GAAaC,uBAAaX,IAAAA,EAAMqB,GAAAA,CAAAA;gBAEtC,OAAO;oBAAE7B,MAAAA,EAAQM,EAAAA,CAAGc,WAAW,CAACF,UAAAA,EAAYX,KAAAA,CAAAA;oBAAQN,KAAAA,EAAO6B;AAAU,iBAAA;AACvE,YAAA;AAEA,YAAA,IAAIb,SAAAA,CAAUe,IAAI,KAAK,UAAA,IAAc,YAAYf,SAAAA,EAAW;gBAC1D,MAAMgB,QAAAA,GAAWC,gBAAW9B,GAAAA,EAAK;oBAC/BG,KAAAA,EAAOA,KAAAA,IAASD,GAAGC,KAAK;oBACxB4B,aAAAA,EAAeN,GAAAA;AACfZ,oBAAAA;AACF,iBAAA,CAAA;AAEA,gBAAA,OAAOf,eAAesB,KAAAA,EAAO;AAC3BlC,oBAAAA,EAAAA;AACAgB,oBAAAA,EAAAA;oBACAC,KAAAA,EAAO0B,QAAAA;AACP5B,oBAAAA,GAAAA,EAAKY,UAAUmB;AACjB,iBAAA,CAAA;AACF,YAAA;YAEA,MAAM,IAAItB,MAAM,CAAC,oBAAoB,EAAEG,SAAAA,CAAUe,IAAI,CAAC,MAAM,CAAC,CAAA;AAC/D,QAAA,CAAA,CAAA;AACF,IAAA;AAEA,IAAA,MAAM,IAAIlB,KAAAA,CAAM,wBAAA,CAAA;AAClB;AAEO,MAAMuB,4BAA4B,CAACrC,MAAAA,GAAAA;AACxC,IAAA,MAAMsC,iBAAAA,GAAoBtC,MAAAA,CAAOuC,UAAU,CAAC,GAAA,EAAK,GAAA,CAAA;AAEjD,IAAA,OAAO,CAAA,EAAGnD,0BAAAA,CAA2B,EAAE,EAAEkD,iBAAAA,CAAAA,CAAmB;AAC9D;AAEA;;;;AAIC,IACM,MAAME,gBAAAA,GAAmB,CAACC,aAAAA,EAAuCrC,GAAAA,GAAAA;AACtE;;;;;;MAQA,MAAM,EAAEd,EAAE,EAAEgB,EAAE,EAAED,GAAG,EAAE,GAAGD,GAAAA;IAExB,MAAM,EAAEb,SAAS,EAAE,GAAGD,GAAGmB,QAAQ,CAACC,GAAG,CAACL,GAAAA,CAAAA;;AAGtC,IAAA,MAAMF,UAAUsB,kBAAAA,CAAEiB,SAAS,CAAiBpC,EAAAA,CAAGqC,KAAK,CAACxC,OAAO,CAAA;;AAG5D,IAAA,MAAMyC,gBAAgBzC,OAAAA,CAAQ0C,MAAM,CAAC,CAACC,KAAiC,QAAA,IAAYA,EAAAA,CAAAA;AACnF,IAAA,MAAMC,uBAAuB5C,OAAAA,CAAQ0C,MAAM,CAAC,CAACC,KAA8B,eAAA,IAAmBA,EAAAA,CAAAA;;;IAI9F,MAAME,gBAAAA,GAAmB1C,GAAG2C,QAAQ,EAAA;AACpC,IAAA,MAAMC,mBAAmB5C,EAAAA,CAAG6C,YAAY,EAAA,GAAK5C,KAAAA,CAAMyC,kBAAkBzD,SAAAA,CAAAA,GAAaA,SAAAA;IAElF,MAAM6D,WAAAA,GAAc9D,EAAAA,CAAG+D,aAAa,CAACH,gBAAAA,CAAAA;;IAGrC,MAAMI,SAAAA,GAAYb,cAAcc,KAAK,EAAA;IACrC,MAAMC,cAAAA,GAAiBlD,GAAG2C,QAAQ,EAAA;;;;AAKlCK,IAAAA,SACE;KACCG,KAAK,CAAC,SACP;AACCA,KAAAA,KAAK,CAAC,OAAA,CAAA,CACNA,KAAK,CAAC,OAAA,CAAA,CACNA,KAAK,CAAC,QAAA,CAAA;;;IAITH,SAAAA,CAAUI,MAAM;AAEdC,IAAAA,MAAAA,CAAOrD,EAAAA,CAAGC,KAAK,EAAE,IAAA,CAAA;;;OAIdqC,aAAAA,CAAcgB,GAAG,CAAC,CAACC,aAAAA,GACpBtD,KAAAA,CAAM8B,0BAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,EAAG6D,aAAAA,CAAc7D,MAAM,CAAA,CAAA,CAAA;;IAK/E,MAAM8D,qBAAAA,GAAwBxD,GAAG2C,QAAQ,EAAA;AAEzC,IAAA,MAAMc,iCAAiC,CAACC,gBAAAA,GAAAA;;AAEtC,QAAA,MAAMC,kBAAkBrB,aAAAA,CAAcgB,GAAG,CAAC,CAACC,iBAAmB;AAC5D7D,gBAAAA,MAAAA,EAAQ2D,MAAAA,CAAOH,cAAAA,EAAgBnB,yBAAAA,CAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,CAAA;AAC7EC,gBAAAA,KAAAA,EAAO4D,cAAc5D;aACvB,CAAA,CAAA;;AAGA,QAAA,MAAMiE,iBAAiBD,eAAAA,CAAgBL,GAAG,CAASnC,kBAAAA,CAAE0C,IAAI,CAAC,QAAA,CAAA,CAAA;QAE1DH,gBAAAA,CACGN,MAAM;QAELC,MAAAA,CAAOH,cAAAA,EAAgB;AAEpBU,QAAAA,GAAAA,cAAAA,CAEL;SACCE,SAAS,CAACjF,uBAAuB,CAACkF,QAAAA,GAAAA;YACjC,KAAK,MAAMR,iBAAiBI,eAAAA,CAAiB;AAC3CI,gBAAAA,QAAAA,CAASlE,OAAO,CAAC0D,aAAAA,CAAc7D,MAAM,EAAE6D,aAAAA,CAAc5D,KAAK,EAAE,MAAA,CAAA;AAC9D,YAAA;;AAGAoE,YAAAA,QAAAA,CAASC,WAAW,CAAC,CAAA,EAAGd,cAAAA,CAAe,GAAG,CAAC,CAAA;AAC7C,QAAA,CAAA,CAAA,CACCe,IAAI,CAACjB,SAAAA,CAAUkB,EAAE,CAAChB,cAAAA,CAAAA,CAAAA,CAClBgB,EAAE,CAACV,qBAAAA,CAAAA;AACR,IAAA,CAAA;;;IAKA,MAAMW,YAAAA,GAAenE,EAAAA,CAAGqC,KAAK,CAACe,MAAM,CAACb,MAAM,CAAC,CAAC6B,CAAAA,GAAmB,OAAOA,CAAAA,KAAM,QAAA,CAAA;AAC7E,IAAA,MAAMC,cAAAA,GAAiBlD,kBAAAA,CAAEmD,UAAU,CACjCH;AAEA7B,IAAAA,aAAAA,CAAcgB,GAAG,CAACnC,kBAAAA,CAAE0C,IAAI,CAAC,WAEzB;AACCP,KAAAA,GAAG,CAAC,CAACiB,GAAAA,GAAQ,GAAG7B,gBAAAA,CAAiB,CAAC,EAAE6B,GAAAA,CAAAA,CAAK,CAAA;IAE5CzB,WAAAA,CACGM,MAAM,CAACiB,cAAAA,CACR;;;;AAICG,KAAAA,SAAS,CAACf,8BAAAA,EAAgC,WAAA;AACzC,QAAA,IAAI;SAEDgB,EAAE,CAAC,CAAA,EAAGjB,qBAAAA,CAAsB,GAAG,CAAC,EAAE,CAAA,EAAGd,gBAAAA,CAAiB,GAAG,CAAC,CAC3D;;AAECgC,SAAAA,QAAQ,CAAC,CAAA,EAAGlB,qBAAAA,CAAsB,CAAC,EAAE3E,qBAAAA,CAAAA,CAAuB,EAAE,GAAA,EAAK,CAAA,CAAA;AACxE,IAAA,CAAA,CAAA;;AAIF,IAAA,IAAImB,EAAAA,CAAGqC,KAAK,CAACsC,KAAK,EAAE;AAClB7B,QAAAA,WAAAA,CAAY6B,KAAK,CAAC3E,EAAAA,CAAGqC,KAAK,CAACsC,KAAK,CAAA;AAClC,IAAA;AAEA,IAAA,IAAI3E,EAAAA,CAAGqC,KAAK,CAACuC,MAAM,EAAE;AACnB9B,QAAAA,WAAAA,CAAY8B,MAAM,CAAC5E,EAAAA,CAAGqC,KAAK,CAACuC,MAAM,CAAA;AACpC,IAAA;AAEA,IAAA,IAAI5E,EAAAA,CAAGqC,KAAK,CAACwC,KAAK,EAAE;AAClB/B,QAAAA,WAAAA,CAAY+B,KAAK,EAAA;AACnB,IAAA;;;;AAKA/B,IAAAA,WAAAA,CAAYjD,OAAO,CAAC;;AAEfyC,QAAAA,GAAAA,aAAAA,CAAcgB,GAAG,CAAC,CAACC,aAAAA,IAAmB;AACvC7D,gBAAAA,MAAAA,EAAQ2D,MAAAA,CAAOG,qBAAAA,EAAuBzB,yBAAAA,CAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,CAAA;AACpFC,gBAAAA,KAAAA,EAAO4D,cAAc5D;aACvB,CAAA,CAAA;;AAEG8C,QAAAA,GAAAA,oBAAAA,CAAqBa,GAAG,CAAC,CAAC7D,KAAAA,IAAW;AACtCC,gBAAAA,MAAAA,EAAQX,yBAAAA,CAA0BC,EAAAA,EAAIC,SAAAA,EAAWyD,gBAAAA,EAAkBjD,MAAMN,MAAM,CAAA;AAC/EQ,gBAAAA,KAAAA,EAAOF,MAAME;aACf,CAAA,CAAA;;AAEA,QAAA;YAAED,MAAAA,EAAQ,CAAA,EAAG8D,qBAAAA,CAAsB,GAAG,CAAC;YAAE7D,KAAAA,EAAO;AAAM;AACvD,KAAA,CAAA;IAED,OAAOmD,WAAAA;AACT;AAEA;AACA,MAAM7C,KAAAA,GAAQkB,kBAAAA,CAAE2D,KAAK,CAAC,CAAC7E,KAAAA,EAAeiB,KAAAA,GAAkB,CAAA,EAAGA,KAAAA,CAAM,IAAI,EAAEjB,KAAAA,CAAAA,CAAO,CAAA;AAC9E,MAAMoD,MAAAA,GAASlC,kBAAAA,CAAE2D,KAAK,CAAC,CAACzB,MAAAA,EAAgBnC,KAAAA,GAAkB,CAAA,EAAGmC,MAAAA,CAAO,CAAC,EAAEnC,KAAAA,CAAAA,CAAO,CAAA;;;;;;;;"}
+{"version":3,"file":"order-by.js","sources":["../../../src/query/helpers/order-by.ts"],"sourcesContent":["import _ from 'lodash/fp';\nimport knex from 'knex';\n\nimport * as types from '../../utils/types';\nimport { createJoin } from './join';\nimport { toColumnName } from './transform';\n\nimport type { Ctx } from '../types';\n\ntype OrderByCtx = Ctx & { alias?: string };\ntype OrderBy = string | { [key: string]: 'asc' | 'desc' } | OrderBy[];\ntype OrderByColumnValue = { column: string; order?: 'asc' | 'desc' };\ntype OrderByRawValue = { rawExpression: 'status'; isI18n?: boolean; order?: 'asc' | 'desc' };\nexport type OrderByValue = OrderByColumnValue | OrderByRawValue;\n\nconst COL_STRAPI_ROW_NUMBER = '__strapi_row_number';\nconst COL_STRAPI_ORDER_BY_PREFIX = '__strapi_order_by';\n\n/**\n * Builds a SQL CASE expression that maps each row to a numeric status rank:\n *   0 = draft/created (no published sibling with same documentId [+ locale])\n *   1 = modified (draft updated_at > published updated_at for same documentId [+ locale])\n *   2 = published\n *\n * @param db - Database instance (used to access knex raw)\n * @param tableName - Actual DB table name (used in correlated subqueries)\n * @param tableAlias - Alias of the table in the outer query (e.g. \"t0\")\n * @param isI18n - When true, adds a locale condition to avoid cross-locale contamination\n */\nexport const buildStatusSortExpression = (\n  db: { connection: { raw: (sql: string, bindings?: unknown[]) => knex.Knex.Raw } },\n  tableName: string,\n  tableAlias: string,\n  isI18n = false\n): knex.Knex.Raw => {\n  const localeCondition = isI18n ? ` AND sub.locale = ${tableAlias}.locale` : '';\n\n  return db.connection.raw(\n    `CASE WHEN NOT EXISTS(SELECT 1 FROM ?? sub WHERE sub.document_id = ${tableAlias}.document_id AND sub.published_at IS NOT NULL${localeCondition}) THEN 0 WHEN ${tableAlias}.updated_at > (SELECT MAX(sub.updated_at) FROM ?? sub WHERE sub.document_id = ${tableAlias}.document_id AND sub.published_at IS NOT NULL${localeCondition}) THEN 1 ELSE 2 END`,\n    [tableName, tableName]\n  );\n};\n\n/** DB handle accepted by {@link buildStatusSortExpression}. */\ntype StatusSortDb = Parameters<typeof buildStatusSortExpression>[0];\n\n/**\n * Shape passed to Knex `orderBy` for compound ordering. Knex accepts `Knex.Raw` in the column\n * position at runtime; generated typings sometimes only list string.\n */\nexport type KnexOrderByColumnDescriptor = {\n  column: string | knex.Knex.Raw;\n  order?: 'asc' | 'desc';\n};\n\n/**\n * Maps processed {@link OrderByValue} entries to descriptors Knex can consume. Translates the\n * virtual `status` sort into a parameterized raw SQL expression.\n */\nexport const toKnexOrderByDescriptor = (\n  db: StatusSortDb,\n  tableName: string,\n  rootTableAlias: string,\n  entry: OrderByValue\n): KnexOrderByColumnDescriptor => {\n  if ('rawExpression' in entry) {\n    return {\n      column: buildStatusSortExpression(db, tableName, rootTableAlias, entry.isI18n),\n      order: entry.order,\n    };\n  }\n\n  return { column: entry.column, order: entry.order };\n};\n\nexport const processOrderBy = (orderBy: OrderBy, ctx: OrderByCtx): OrderByValue[] => {\n  const { db, uid, qb, alias } = ctx;\n  const meta = db.metadata.get(uid);\n  const { attributes } = meta;\n\n  if (typeof orderBy === 'string') {\n    if (orderBy === 'status') {\n      if (!attributes.publishedAt || !attributes.documentId) {\n        throw new Error(\n          `Cannot order by status on model ${uid}: missing publishedAt or documentId`\n        );\n      }\n      const isI18n = 'locale' in attributes;\n      return [{ rawExpression: 'status' as const, isI18n, order: undefined }];\n    }\n\n    const attribute = attributes[orderBy];\n\n    if (!attribute) {\n      throw new Error(`Attribute ${orderBy} not found on model ${uid}`);\n    }\n\n    const columnName = toColumnName(meta, orderBy);\n\n    return [{ column: qb.aliasColumn(columnName, alias) }];\n  }\n\n  if (Array.isArray(orderBy)) {\n    return orderBy.flatMap((value) => processOrderBy(value, ctx));\n  }\n\n  if (_.isPlainObject(orderBy)) {\n    return Object.entries(orderBy).flatMap(([key, direction]) => {\n      const value = orderBy[key];\n\n      if (key === 'status') {\n        if (!attributes.publishedAt || !attributes.documentId) {\n          throw new Error(\n            `Cannot order by status on model ${uid}: missing publishedAt or documentId`\n          );\n        }\n        const isI18n = 'locale' in attributes;\n        return [{ rawExpression: 'status' as const, isI18n, order: direction as 'asc' | 'desc' }];\n      }\n\n      const attribute = attributes[key];\n\n      if (!attribute) {\n        throw new Error(`Attribute ${key} not found on model ${uid}`);\n      }\n\n      if (types.isScalar(attribute.type)) {\n        const columnName = toColumnName(meta, key);\n\n        return { column: qb.aliasColumn(columnName, alias), order: direction };\n      }\n\n      if (attribute.type === 'relation' && 'target' in attribute) {\n        const subAlias = createJoin(ctx, {\n          alias: alias || qb.alias,\n          attributeName: key,\n          attribute,\n        });\n\n        return processOrderBy(value, {\n          db,\n          qb,\n          alias: subAlias,\n          uid: attribute.target,\n        });\n      }\n\n      throw new Error(`You cannot order on ${attribute.type} types`);\n    });\n  }\n\n  throw new Error('Invalid orderBy syntax');\n};\n\nexport const getStrapiOrderColumnAlias = (column: string) => {\n  const trimmedColumnName = column.replaceAll('.', '_');\n\n  return `${COL_STRAPI_ORDER_BY_PREFIX}__${trimmedColumnName}`;\n};\n\n/**\n * Wraps the original Knex query with deep sorting functionality.\n *\n * The function takes an original query and an OrderByCtx object as parameters and returns a new Knex query with deep sorting applied.\n */\nexport const wrapWithDeepSort = (originalQuery: knex.Knex.QueryBuilder, ctx: OrderByCtx) => {\n  /**\n   * Notes:\n   * - The generated query has the following flow: baseQuery (filtered unsorted data) -> T (partitioned/sorted data) --> resultQuery (distinct, paginated, sorted data)\n   * - Pagination and selection are transferred from the original query to the outer one to avoid pruning rows too early\n   * - Filtering (where) has to be done in the deepest sub query possible to avoid processing invalid rows and corrupting the final results\n   * - We assume that all necessary joins are done in the original query (`originalQuery`), and every needed column is available with the right name and alias.\n   */\n\n  const { db, qb, uid } = ctx;\n\n  const { tableName } = db.metadata.get(uid);\n\n  // The orderBy is cloned to avoid unwanted mutations of the original object\n  const orderBy = _.cloneDeep<OrderByValue[]>(qb.state.orderBy);\n\n  // Separate column-based entries from raw-expression entries (e.g. status)\n  const columnOrderBy = orderBy.filter((ob): ob is OrderByColumnValue => 'column' in ob);\n  const rawExpressionOrderBy = orderBy.filter((ob): ob is OrderByRawValue => 'rawExpression' in ob);\n\n  // 0. Init a new Knex query instance (referenced as resultQuery) using the DB connection\n  //    The connection reuse the original table name (aliased if needed)\n  const resultQueryAlias = qb.getAlias();\n  const aliasedTableName = qb.mustUseAlias() ? alias(resultQueryAlias, tableName) : tableName;\n\n  const resultQuery = db.getConnection(aliasedTableName);\n\n  // 1. Clone the original query to create the sub-query (referenced as baseQuery) and avoid any mutation on the initial object\n  const baseQuery = originalQuery.clone();\n  const baseQueryAlias = qb.getAlias();\n\n  // Clear unwanted statements from the sub-query 'baseQuery'\n  // Note: `first()` is cleared through the combination of `baseQuery.clear('limit')` and calling `baseQuery.select(...)` again\n  // Note: Those statements will be re-applied when duplicates are removed from the final selection\n  baseQuery\n    // Columns selection\n    .clear('select')\n    // Pagination and sorting\n    .clear('order')\n    .clear('limit')\n    .clear('offset');\n\n  // Override the initial select and return only the columns needed for the partitioning.\n  // Only column-based orderBy entries are included here; raw expressions are applied later.\n  baseQuery.select(\n    // Always select the row id for future manipulation\n    prefix(qb.alias, 'id'),\n    // Select every column used in an order by clause, but alias it for future reference\n    // i.e. if t2.name is present in an order by clause:\n    //      Then, \"t2.name\" will become \"t2.name as __strapi_order_by__t2_name\"\n    ...columnOrderBy.map((orderByClause) =>\n      alias(getStrapiOrderColumnAlias(orderByClause.column), orderByClause.column)\n    )\n  );\n\n  // 2. Create a sub-query callback to extract and sort the partitions using row number\n  const partitionedQueryAlias = qb.getAlias();\n\n  const selectRowsAsNumberedPartitions = (partitionedQuery: knex.Knex.QueryBuilder) => {\n    // Transform order by clause to their alias to reference them from baseQuery\n    const prefixedOrderBy = columnOrderBy.map((orderByClause) => ({\n      column: prefix(baseQueryAlias, getStrapiOrderColumnAlias(orderByClause.column)),\n      order: orderByClause.order,\n    }));\n\n    // partitionedQuery select must contain every column used for sorting\n    const orderByColumns = prefixedOrderBy.map<string>(_.prop('column'));\n\n    partitionedQuery\n      .select(\n        // Always select baseQuery.id\n        prefix(baseQueryAlias, 'id'),\n        // Sort columns\n        ...orderByColumns\n      )\n      // The row number is used to assign an index to every row in every partition\n      .rowNumber(COL_STRAPI_ROW_NUMBER, (subQuery) => {\n        for (const orderByClause of prefixedOrderBy) {\n          subQuery.orderBy(orderByClause.column, orderByClause.order, 'last');\n        }\n\n        // And each partition/group is created based on baseQuery.id\n        subQuery.partitionBy(`${baseQueryAlias}.id`);\n      })\n      .from(baseQuery.as(baseQueryAlias))\n      .as(partitionedQueryAlias);\n  };\n\n  // 3. Create the final resultQuery query, that select and sort the wanted data using T\n\n  // Filter to string-only select items before diffing (Knex.Raw items are passed through as-is)\n  const stringSelect = qb.state.select.filter((s): s is string => typeof s === 'string');\n  const originalSelect = _.difference(\n    stringSelect,\n    // Remove column-based order by columns from the initial select (raw expressions are not in select)\n    columnOrderBy.map(_.prop('column'))\n  )\n    // Alias everything in resultQuery\n    .map((col) => `${resultQueryAlias}.${col}`);\n\n  resultQuery\n    .select(originalSelect)\n    // Join T to resultQuery to access sorted data\n    // Notes:\n    // - Only select the first row for each partition\n    // - Since we're applying the \"where\" statement directly on baseQuery (and not on resultQuery), we're using an inner join to avoid unwanted rows\n    .innerJoin(selectRowsAsNumberedPartitions, function joinPartitionedRows() {\n      this\n        // Only select rows that are returned by T\n        .on(`${partitionedQueryAlias}.id`, `${resultQueryAlias}.id`)\n        // By only selecting the rows number equal to 1, we make sure we don't have duplicate, and that\n        // we're selecting rows in the correct order amongst the groups created by the \"partition by\"\n        .andOnVal(`${partitionedQueryAlias}.${COL_STRAPI_ROW_NUMBER}`, '=', 1);\n    });\n\n  // Re-apply pagination params\n\n  if (qb.state.limit) {\n    resultQuery.limit(qb.state.limit);\n  }\n\n  if (qb.state.offset) {\n    resultQuery.offset(qb.state.offset);\n  }\n\n  if (qb.state.first) {\n    resultQuery.first();\n  }\n\n  // Re-apply the sort using T values (column-based), then append raw expression sorts.\n  // Cast to any[] because Knex's TS types don't accept Knex.Raw in the column position,\n  // even though Knex supports it at runtime.\n  resultQuery.orderBy([\n    // Transform column-based \"order by\" clause to their T alias and prefix them with T alias\n    ...columnOrderBy.map((orderByClause) => ({\n      column: prefix(partitionedQueryAlias, getStrapiOrderColumnAlias(orderByClause.column)),\n      order: orderByClause.order,\n    })),\n    // Rebuild raw expression entries with the correct outer alias (resultQueryAlias)\n    ...rawExpressionOrderBy.map((entry) => ({\n      column: buildStatusSortExpression(db, tableName, resultQueryAlias, entry.isI18n),\n      order: entry.order,\n    })),\n    // Add T.id to the order by clause to get consistent results in case several rows have the exact same order\n    { column: `${partitionedQueryAlias}.id`, order: 'asc' },\n  ] as any);\n\n  return resultQuery;\n};\n\n// Utils\nconst alias = _.curry((alias: string, value: string) => `${value} as ${alias}`);\nconst prefix = _.curry((prefix: string, value: string) => `${prefix}.${value}`);\n"],"names":["COL_STRAPI_ROW_NUMBER","COL_STRAPI_ORDER_BY_PREFIX","buildStatusSortExpression","db","tableName","tableAlias","isI18n","localeCondition","connection","raw","toKnexOrderByDescriptor","rootTableAlias","entry","column","order","processOrderBy","orderBy","ctx","uid","qb","alias","meta","metadata","get","attributes","publishedAt","documentId","Error","rawExpression","undefined","attribute","columnName","toColumnName","aliasColumn","Array","isArray","flatMap","value","_","isPlainObject","Object","entries","key","direction","types","type","subAlias","createJoin","attributeName","target","getStrapiOrderColumnAlias","trimmedColumnName","replaceAll","wrapWithDeepSort","originalQuery","cloneDeep","state","columnOrderBy","filter","ob","rawExpressionOrderBy","resultQueryAlias","getAlias","aliasedTableName","mustUseAlias","resultQuery","getConnection","baseQuery","clone","baseQueryAlias","clear","select","prefix","map","orderByClause","partitionedQueryAlias","selectRowsAsNumberedPartitions","partitionedQuery","prefixedOrderBy","orderByColumns","prop","rowNumber","subQuery","partitionBy","from","as","stringSelect","s","originalSelect","difference","col","innerJoin","joinPartitionedRows","on","andOnVal","limit","offset","first","curry"],"mappings":";;;;;;;;;;;AAeA,MAAMA,qBAAAA,GAAwB,qBAAA;AAC9B,MAAMC,0BAAAA,GAA6B,mBAAA;AAEnC;;;;;;;;;;UAWaC,yBAAAA,GAA4B,CACvCC,IACAC,SAAAA,EACAC,UAAAA,EACAC,SAAS,KAAK,GAAA;IAEd,MAAMC,eAAAA,GAAkBD,SAAS,CAAC,kBAAkB,EAAED,UAAAA,CAAW,OAAO,CAAC,GAAG,EAAA;IAE5E,OAAOF,EAAAA,CAAGK,UAAU,CAACC,GAAG,CACtB,CAAC,kEAAkE,EAAEJ,UAAAA,CAAW,6CAA6C,EAAEE,gBAAgB,cAAc,EAAEF,UAAAA,CAAW,8EAA8E,EAAEA,UAAAA,CAAW,6CAA6C,EAAEE,eAAAA,CAAgB,mBAAmB,CAAC,EACxV;AAACH,QAAAA,SAAAA;AAAWA,QAAAA;AAAU,KAAA,CAAA;AAE1B;AAcA;;;AAGC,IACM,MAAMM,uBAAAA,GAA0B,CACrCP,EAAAA,EACAC,WACAO,cAAAA,EACAC,KAAAA,GAAAA;AAEA,IAAA,IAAI,mBAAmBA,KAAAA,EAAO;QAC5B,OAAO;AACLC,YAAAA,MAAAA,EAAQX,yBAAAA,CAA0BC,EAAAA,EAAIC,SAAAA,EAAWO,cAAAA,EAAgBC,MAAMN,MAAM,CAAA;AAC7EQ,YAAAA,KAAAA,EAAOF,MAAME;AACf,SAAA;AACF,IAAA;IAEA,OAAO;AAAED,QAAAA,MAAAA,EAAQD,MAAMC,MAAM;AAAEC,QAAAA,KAAAA,EAAOF,MAAME;AAAM,KAAA;AACpD;AAEO,MAAMC,cAAAA,GAAiB,CAACC,OAAAA,EAAkBC,GAAAA,GAAAA;IAC/C,MAAM,EAAEd,EAAE,EAAEe,GAAG,EAAEC,EAAE,EAAEC,KAAK,EAAE,GAAGH,GAAAA;AAC/B,IAAA,MAAMI,IAAAA,GAAOlB,EAAAA,CAAGmB,QAAQ,CAACC,GAAG,CAACL,GAAAA,CAAAA;IAC7B,MAAM,EAAEM,UAAU,EAAE,GAAGH,IAAAA;IAEvB,IAAI,OAAOL,YAAY,QAAA,EAAU;AAC/B,QAAA,IAAIA,YAAY,QAAA,EAAU;AACxB,YAAA,IAAI,CAACQ,UAAAA,CAAWC,WAAW,IAAI,CAACD,UAAAA,CAAWE,UAAU,EAAE;AACrD,gBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gCAAgC,EAAET,GAAAA,CAAI,mCAAmC,CAAC,CAAA;AAE/E,YAAA;AACA,YAAA,MAAMZ,SAAS,QAAA,IAAYkB,UAAAA;YAC3B,OAAO;AAAC,gBAAA;oBAAEI,aAAAA,EAAe,QAAA;AAAmBtB,oBAAAA,MAAAA;oBAAQQ,KAAAA,EAAOe;AAAU;AAAE,aAAA;AACzE,QAAA;QAEA,MAAMC,SAAAA,GAAYN,UAAU,CAACR,OAAAA,CAAQ;AAErC,QAAA,IAAI,CAACc,SAAAA,EAAW;YACd,MAAM,IAAIH,MAAM,CAAC,UAAU,EAAEX,OAAAA,CAAQ,oBAAoB,EAAEE,GAAAA,CAAAA,CAAK,CAAA;AAClE,QAAA;QAEA,MAAMa,UAAAA,GAAaC,uBAAaX,IAAAA,EAAML,OAAAA,CAAAA;QAEtC,OAAO;AAAC,YAAA;gBAAEH,MAAAA,EAAQM,EAAAA,CAAGc,WAAW,CAACF,UAAAA,EAAYX,KAAAA;AAAO;AAAE,SAAA;AACxD,IAAA;IAEA,IAAIc,KAAAA,CAAMC,OAAO,CAACnB,OAAAA,CAAAA,EAAU;AAC1B,QAAA,OAAOA,QAAQoB,OAAO,CAAC,CAACC,KAAAA,GAAUtB,eAAesB,KAAAA,EAAOpB,GAAAA,CAAAA,CAAAA;AAC1D,IAAA;IAEA,IAAIqB,kBAAAA,CAAEC,aAAa,CAACvB,OAAAA,CAAAA,EAAU;QAC5B,OAAOwB,MAAAA,CAAOC,OAAO,CAACzB,OAAAA,CAAAA,CAASoB,OAAO,CAAC,CAAC,CAACM,GAAAA,EAAKC,SAAAA,CAAU,GAAA;YACtD,MAAMN,KAAAA,GAAQrB,OAAO,CAAC0B,GAAAA,CAAI;AAE1B,YAAA,IAAIA,QAAQ,QAAA,EAAU;AACpB,gBAAA,IAAI,CAAClB,UAAAA,CAAWC,WAAW,IAAI,CAACD,UAAAA,CAAWE,UAAU,EAAE;AACrD,oBAAA,MAAM,IAAIC,KAAAA,CACR,CAAC,gCAAgC,EAAET,GAAAA,CAAI,mCAAmC,CAAC,CAAA;AAE/E,gBAAA;AACA,gBAAA,MAAMZ,SAAS,QAAA,IAAYkB,UAAAA;gBAC3B,OAAO;AAAC,oBAAA;wBAAEI,aAAAA,EAAe,QAAA;AAAmBtB,wBAAAA,MAAAA;wBAAQQ,KAAAA,EAAO6B;AAA4B;AAAE,iBAAA;AAC3F,YAAA;YAEA,MAAMb,SAAAA,GAAYN,UAAU,CAACkB,GAAAA,CAAI;AAEjC,YAAA,IAAI,CAACZ,SAAAA,EAAW;gBACd,MAAM,IAAIH,MAAM,CAAC,UAAU,EAAEe,GAAAA,CAAI,oBAAoB,EAAExB,GAAAA,CAAAA,CAAK,CAAA;AAC9D,YAAA;AAEA,YAAA,IAAI0B,cAAc,CAACd,SAAAA,CAAUe,IAAI,CAAA,EAAG;gBAClC,MAAMd,UAAAA,GAAaC,uBAAaX,IAAAA,EAAMqB,GAAAA,CAAAA;gBAEtC,OAAO;oBAAE7B,MAAAA,EAAQM,EAAAA,CAAGc,WAAW,CAACF,UAAAA,EAAYX,KAAAA,CAAAA;oBAAQN,KAAAA,EAAO6B;AAAU,iBAAA;AACvE,YAAA;AAEA,YAAA,IAAIb,SAAAA,CAAUe,IAAI,KAAK,UAAA,IAAc,YAAYf,SAAAA,EAAW;gBAC1D,MAAMgB,QAAAA,GAAWC,gBAAW9B,GAAAA,EAAK;oBAC/BG,KAAAA,EAAOA,KAAAA,IAASD,GAAGC,KAAK;oBACxB4B,aAAAA,EAAeN,GAAAA;AACfZ,oBAAAA;AACF,iBAAA,CAAA;AAEA,gBAAA,OAAOf,eAAesB,KAAAA,EAAO;AAC3BlC,oBAAAA,EAAAA;AACAgB,oBAAAA,EAAAA;oBACAC,KAAAA,EAAO0B,QAAAA;AACP5B,oBAAAA,GAAAA,EAAKY,UAAUmB;AACjB,iBAAA,CAAA;AACF,YAAA;YAEA,MAAM,IAAItB,MAAM,CAAC,oBAAoB,EAAEG,SAAAA,CAAUe,IAAI,CAAC,MAAM,CAAC,CAAA;AAC/D,QAAA,CAAA,CAAA;AACF,IAAA;AAEA,IAAA,MAAM,IAAIlB,KAAAA,CAAM,wBAAA,CAAA;AAClB;AAEO,MAAMuB,4BAA4B,CAACrC,MAAAA,GAAAA;AACxC,IAAA,MAAMsC,iBAAAA,GAAoBtC,MAAAA,CAAOuC,UAAU,CAAC,GAAA,EAAK,GAAA,CAAA;AAEjD,IAAA,OAAO,CAAA,EAAGnD,0BAAAA,CAA2B,EAAE,EAAEkD,iBAAAA,CAAAA,CAAmB;AAC9D;AAEA;;;;AAIC,IACM,MAAME,gBAAAA,GAAmB,CAACC,aAAAA,EAAuCrC,GAAAA,GAAAA;AACtE;;;;;;MAQA,MAAM,EAAEd,EAAE,EAAEgB,EAAE,EAAED,GAAG,EAAE,GAAGD,GAAAA;IAExB,MAAM,EAAEb,SAAS,EAAE,GAAGD,GAAGmB,QAAQ,CAACC,GAAG,CAACL,GAAAA,CAAAA;;AAGtC,IAAA,MAAMF,UAAUsB,kBAAAA,CAAEiB,SAAS,CAAiBpC,EAAAA,CAAGqC,KAAK,CAACxC,OAAO,CAAA;;AAG5D,IAAA,MAAMyC,gBAAgBzC,OAAAA,CAAQ0C,MAAM,CAAC,CAACC,KAAiC,QAAA,IAAYA,EAAAA,CAAAA;AACnF,IAAA,MAAMC,uBAAuB5C,OAAAA,CAAQ0C,MAAM,CAAC,CAACC,KAA8B,eAAA,IAAmBA,EAAAA,CAAAA;;;IAI9F,MAAME,gBAAAA,GAAmB1C,GAAG2C,QAAQ,EAAA;AACpC,IAAA,MAAMC,mBAAmB5C,EAAAA,CAAG6C,YAAY,EAAA,GAAK5C,KAAAA,CAAMyC,kBAAkBzD,SAAAA,CAAAA,GAAaA,SAAAA;IAElF,MAAM6D,WAAAA,GAAc9D,EAAAA,CAAG+D,aAAa,CAACH,gBAAAA,CAAAA;;IAGrC,MAAMI,SAAAA,GAAYb,cAAcc,KAAK,EAAA;IACrC,MAAMC,cAAAA,GAAiBlD,GAAG2C,QAAQ,EAAA;;;;AAKlCK,IAAAA,SACE;KACCG,KAAK,CAAC,SACP;AACCA,KAAAA,KAAK,CAAC,OAAA,CAAA,CACNA,KAAK,CAAC,OAAA,CAAA,CACNA,KAAK,CAAC,QAAA,CAAA;;;IAITH,SAAAA,CAAUI,MAAM;AAEdC,IAAAA,MAAAA,CAAOrD,EAAAA,CAAGC,KAAK,EAAE,IAAA,CAAA;;;OAIdqC,aAAAA,CAAcgB,GAAG,CAAC,CAACC,aAAAA,GACpBtD,KAAAA,CAAM8B,0BAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,EAAG6D,aAAAA,CAAc7D,MAAM,CAAA,CAAA,CAAA;;IAK/E,MAAM8D,qBAAAA,GAAwBxD,GAAG2C,QAAQ,EAAA;AAEzC,IAAA,MAAMc,iCAAiC,CAACC,gBAAAA,GAAAA;;AAEtC,QAAA,MAAMC,kBAAkBrB,aAAAA,CAAcgB,GAAG,CAAC,CAACC,iBAAmB;AAC5D7D,gBAAAA,MAAAA,EAAQ2D,MAAAA,CAAOH,cAAAA,EAAgBnB,yBAAAA,CAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,CAAA;AAC7EC,gBAAAA,KAAAA,EAAO4D,cAAc5D;aACvB,CAAA,CAAA;;AAGA,QAAA,MAAMiE,iBAAiBD,eAAAA,CAAgBL,GAAG,CAASnC,kBAAAA,CAAE0C,IAAI,CAAC,QAAA,CAAA,CAAA;QAE1DH,gBAAAA,CACGN,MAAM;QAELC,MAAAA,CAAOH,cAAAA,EAAgB;AAEpBU,QAAAA,GAAAA,cAAAA,CAEL;SACCE,SAAS,CAACjF,uBAAuB,CAACkF,QAAAA,GAAAA;YACjC,KAAK,MAAMR,iBAAiBI,eAAAA,CAAiB;AAC3CI,gBAAAA,QAAAA,CAASlE,OAAO,CAAC0D,aAAAA,CAAc7D,MAAM,EAAE6D,aAAAA,CAAc5D,KAAK,EAAE,MAAA,CAAA;AAC9D,YAAA;;AAGAoE,YAAAA,QAAAA,CAASC,WAAW,CAAC,CAAA,EAAGd,cAAAA,CAAe,GAAG,CAAC,CAAA;AAC7C,QAAA,CAAA,CAAA,CACCe,IAAI,CAACjB,SAAAA,CAAUkB,EAAE,CAAChB,cAAAA,CAAAA,CAAAA,CAClBgB,EAAE,CAACV,qBAAAA,CAAAA;AACR,IAAA,CAAA;;;IAKA,MAAMW,YAAAA,GAAenE,EAAAA,CAAGqC,KAAK,CAACe,MAAM,CAACb,MAAM,CAAC,CAAC6B,CAAAA,GAAmB,OAAOA,CAAAA,KAAM,QAAA,CAAA;AAC7E,IAAA,MAAMC,cAAAA,GAAiBlD,kBAAAA,CAAEmD,UAAU,CACjCH;AAEA7B,IAAAA,aAAAA,CAAcgB,GAAG,CAACnC,kBAAAA,CAAE0C,IAAI,CAAC,WAEzB;AACCP,KAAAA,GAAG,CAAC,CAACiB,GAAAA,GAAQ,GAAG7B,gBAAAA,CAAiB,CAAC,EAAE6B,GAAAA,CAAAA,CAAK,CAAA;IAE5CzB,WAAAA,CACGM,MAAM,CAACiB,cAAAA,CACR;;;;KAICG,SAAS,CAACf,gCAAgC,SAASgB,mBAAAA,GAAAA;AAClD,QAAA,IAAI;SAEDC,EAAE,CAAC,CAAA,EAAGlB,qBAAAA,CAAsB,GAAG,CAAC,EAAE,CAAA,EAAGd,gBAAAA,CAAiB,GAAG,CAAC,CAC3D;;AAECiC,SAAAA,QAAQ,CAAC,CAAA,EAAGnB,qBAAAA,CAAsB,CAAC,EAAE3E,qBAAAA,CAAAA,CAAuB,EAAE,GAAA,EAAK,CAAA,CAAA;AACxE,IAAA,CAAA,CAAA;;AAIF,IAAA,IAAImB,EAAAA,CAAGqC,KAAK,CAACuC,KAAK,EAAE;AAClB9B,QAAAA,WAAAA,CAAY8B,KAAK,CAAC5E,EAAAA,CAAGqC,KAAK,CAACuC,KAAK,CAAA;AAClC,IAAA;AAEA,IAAA,IAAI5E,EAAAA,CAAGqC,KAAK,CAACwC,MAAM,EAAE;AACnB/B,QAAAA,WAAAA,CAAY+B,MAAM,CAAC7E,EAAAA,CAAGqC,KAAK,CAACwC,MAAM,CAAA;AACpC,IAAA;AAEA,IAAA,IAAI7E,EAAAA,CAAGqC,KAAK,CAACyC,KAAK,EAAE;AAClBhC,QAAAA,WAAAA,CAAYgC,KAAK,EAAA;AACnB,IAAA;;;;AAKAhC,IAAAA,WAAAA,CAAYjD,OAAO,CAAC;;AAEfyC,QAAAA,GAAAA,aAAAA,CAAcgB,GAAG,CAAC,CAACC,aAAAA,IAAmB;AACvC7D,gBAAAA,MAAAA,EAAQ2D,MAAAA,CAAOG,qBAAAA,EAAuBzB,yBAAAA,CAA0BwB,aAAAA,CAAc7D,MAAM,CAAA,CAAA;AACpFC,gBAAAA,KAAAA,EAAO4D,cAAc5D;aACvB,CAAA,CAAA;;AAEG8C,QAAAA,GAAAA,oBAAAA,CAAqBa,GAAG,CAAC,CAAC7D,KAAAA,IAAW;AACtCC,gBAAAA,MAAAA,EAAQX,yBAAAA,CAA0BC,EAAAA,EAAIC,SAAAA,EAAWyD,gBAAAA,EAAkBjD,MAAMN,MAAM,CAAA;AAC/EQ,gBAAAA,KAAAA,EAAOF,MAAME;aACf,CAAA,CAAA;;AAEA,QAAA;YAAED,MAAAA,EAAQ,CAAA,EAAG8D,qBAAAA,CAAsB,GAAG,CAAC;YAAE7D,KAAAA,EAAO;AAAM;AACvD,KAAA,CAAA;IAED,OAAOmD,WAAAA;AACT;AAEA;AACA,MAAM7C,KAAAA,GAAQkB,kBAAAA,CAAE4D,KAAK,CAAC,CAAC9E,KAAAA,EAAeiB,KAAAA,GAAkB,CAAA,EAAGA,KAAAA,CAAM,IAAI,EAAEjB,KAAAA,CAAAA,CAAO,CAAA;AAC9E,MAAMoD,MAAAA,GAASlC,kBAAAA,CAAE4D,KAAK,CAAC,CAAC1B,MAAAA,EAAgBnC,KAAAA,GAAkB,CAAA,EAAGmC,MAAAA,CAAO,CAAC,EAAEnC,KAAAA,CAAAA,CAAO,CAAA;;;;;;;;"}

package/dist/query/helpers/order-by.mjs

@@ -188,7 +188,7 @@ const getStrapiOrderColumnAlias = (column)=>{
     // Notes:
     // - Only select the first row for each partition
     // - Since we're applying the "where" statement directly on baseQuery (and not on resultQuery), we're using an inner join to avoid unwanted rows
-    .innerJoin(selectRowsAsNumberedPartitions, function() {
+    .innerJoin(selectRowsAsNumberedPartitions, function joinPartitionedRows() {
         this// Only select rows that are returned by T
         .on(`${partitionedQueryAlias}.id`, `${resultQueryAlias}.id`)// By only selecting the rows number equal to 1, we make sure we don't have duplicate, and that
         // we're selecting rows in the correct order amongst the groups created by the "partition by"