@itwin/imodel-transformer 2.0.0-dev.7 → 2.0.0-dev.70

package/lib/cjs/ElementBulkDelete.js

@@ -0,0 +1,358 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.planBulkDelete = planBulkDelete;
+const core_bentley_1 = require("@itwin/core-bentley");
+const core_common_1 = require("@itwin/core-common");
+/** Plans native bulk deletion of the specified element trees.
+ *
+ * An element that something outside the deleted trees still references is kept, together with what it
+ * needs to stay valid, and the rest is deleted. Keeping elements can leave new outside references, so the
+ * plan repeats until none remain.
+ *
+ * Native validation checks each root against the iModel before the call, so a root is refused when its tree
+ * contains a definition, such as a category or a view, that a non-definition element in the same call still
+ * uses. The plan deletes those users in an earlier call than the definitions they use. Validation stays enabled
+ * for every call, so a reference this plan does not know about fails loudly instead of leaving a dangling
+ * reference. That includes elements outside the trees whose geometry uses a definition in them, such as a
+ * geometry part: only native code can read geometry, so those uses are not checked in advance.
+ * @internal
+ */
+async function planBulkDelete(targetDb, elementIds) {
+    const requestedIds = new Set(elementIds);
+    const keptReferences = new Map();
+    for (;;) {
+        const trees = await queryDeletionTrees(targetDb, requestedIds);
+        if (trees.roots.size === 0)
+            return { phases: [], keptReferences };
+        const references = await queryReferences(targetDb, trees.rootsByElement.keys());
+        const blockedIds = new Set();
+        for (const { referencingId, referencedId } of references.references) {
+            if (trees.rootsByElement.has(referencingId))
+                continue;
+            blockedIds.add(referencedId);
+            if (!keptReferences.has(referencedId))
+                keptReferences.set(referencedId, referencingId);
+        }
+        if (blockedIds.size === 0)
+            return {
+                phases: await planPhases(targetDb, trees, references),
+                keptReferences,
+            };
+        // Every blocked element is reached from a requested element, and queryKeptElements walks back up to it,
+        // so each pass removes at least one requested element and the loop ends.
+        const requestedCount = requestedIds.size;
+        for (const id of await queryKeptElements(targetDb, blockedIds))
+            requestedIds.delete(id);
+        (0, core_bentley_1.assert)(requestedIds.size < requestedCount, "Keeping referenced elements must remove a requested element");
+    }
+}
+/** Orders the roots of deletion trees that nothing outside them references into native calls. */
+async function planPhases(targetDb, trees, { references, geometryDefinitionIds }) {
+    // Elements in the trees that use a definition that is also in the trees. Native validation refuses the definition while they exist.
+    const usersOfDeletedDefinitions = new Set();
+    // Roots whose trees contain such a definition. They must be deleted after its users.
+    const rootsWithUsedDefinitions = new Set();
+    const addUsedDefinition = (definitionId) => {
+        for (const rootId of trees.rootsByElement.get(definitionId) ?? [])
+            rootsWithUsedDefinitions.add(rootId);
+    };
+    const sameCallReferences = [];
+    for (const reference of references) {
+        if (reference.usersFirst) {
+            usersOfDeletedDefinitions.add(reference.referencingId);
+            addUsedDefinition(reference.referencedId);
+        }
+        else {
+            sameCallReferences.push(reference);
+        }
+    }
+    // Only native code can tell which geometry uses a geometry part, material, texture, line style, or sub-category,
+    // so every geometric element in the trees counts as a user of every such definition. Deleting the trees that
+    // contain those definitions last is enough unless one of them also contains a geometric element; only then are
+    // all geometric elements queried, to delete them as roots of their own.
+    const geometryRoots = new Set();
+    for (const id of geometryDefinitionIds)
+        for (const rootId of trees.rootsByElement.get(id) ?? [])
+            geometryRoots.add(rootId);
+    if (geometryRoots.size > 0) {
+        const elementsInGeometryTrees = [...trees.rootsByElement]
+            .filter(([, rootIds]) => rootIds.some((id) => geometryRoots.has(id)))
+            .map(([id]) => id);
+        if ((await queryGeometricElements(targetDb, elementsInGeometryTrees)).length >
+            0)
+            for (const id of await queryGeometricElements(targetDb, trees.rootsByElement.keys()))
+                usersOfDeletedDefinitions.add(id);
+        for (const rootId of geometryRoots)
+            rootsWithUsedDefinitions.add(rootId);
+    }
+    if (rootsWithUsedDefinitions.size === 0)
+        return [[...trees.roots]];
+    // True when a root deleted in the last call removes the element.
+    const isInTreeWithUsedDefinition = (id) => (trees.rootsByElement.get(id) ?? []).some((rootId) => rootsWithUsedDefinitions.has(rootId));
+    // True when a root deleted in the first call removes the element. An element in overlapping trees can satisfy both checks.
+    const isInOtherTree = (id) => (trees.rootsByElement.get(id) ?? []).some((rootId) => !rootsWithUsedDefinitions.has(rootId));
+    // Deleting the other roots first works unless a user shares a tree with a used definition, or an other tree
+    // contains an element that an element deleted later references, such as its code scope.
+    const canDeleteOtherRootsFirst = ![...usersOfDeletedDefinitions].some(isInTreeWithUsedDefinition) &&
+        !sameCallReferences.some(({ referencingId, referencedId }) => isInTreeWithUsedDefinition(referencingId) && isInOtherTree(referencedId));
+    if (canDeleteOtherRootsFirst) {
+        // There are no other roots only when every tree contains a geometry definition and nothing in the trees uses a
+        // definition through a queried reference.
+        const otherRoots = [...trees.roots].filter((id) => !rootsWithUsedDefinitions.has(id));
+        return otherRoots.length > 0
+            ? [otherRoots, [...rootsWithUsedDefinitions]]
+            : [[...rootsWithUsedDefinitions]];
+    }
+    // Otherwise delete the users and their code dependents as roots of their own. Core refuses to delete an
+    // element whose code scopes an element deleted in a later call, so the first call also takes code dependents
+    // that have a parent. They are all in the trees; one outside them would have kept its code scope above.
+    const userTrees = await queryDeletionTrees(targetDb, usersOfDeletedDefinitions, true);
+    const remainingRoots = [...trees.roots].filter((id) => !userTrees.rootsByElement.has(id));
+    const phases = [[...userTrees.roots]];
+    if (remainingRoots.length > 0)
+        phases.push(remainingRoots);
+    return phases;
+}
+/** Finds the native deletion roots and every element their deletion removes.
+ *
+ * Native deletion already cascades through child elements and modeled contents. This query follows
+ * those dependencies to find elements whose codes are scoped by an element in a deleted tree. Each
+ * code-dependent element becomes another native deletion root. Only top-level code dependents are
+ * included unless `includeParentedCodeDependents` is true.
+ */
+async function queryDeletionTrees(targetDb, elementIds, includeParentedCodeDependents = false) {
+    const roots = new Set();
+    // An element has more than one root only when requested trees overlap. UNION in the query already removes duplicate
+    // (element, root) pairs, so an array holds distinct roots without allocating a Set per element.
+    const rootsByElement = new Map();
+    // CascadeIds pairs each traversed element with a root that the native API must delete. The anchor
+    // adds requested elements that still exist, except those whose parent or modeled element is also
+    // requested: the recursion reaches them anyway, and anchoring them too would walk a nested tree once
+    // per requested ancestor. Recursive branches walk child elements and modeled contents while
+    // preserving DeleteRootId. An element whose code is scoped by anything already traversed becomes a
+    // new root, so recursion also covers its tree and code dependents.
+    const query = `
+    WITH RECURSIVE CascadeIds(Id, DeleteRootId) AS (
+      SELECT element.ECInstanceId, element.ECInstanceId
+      FROM bis.Element element
+      INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId
+      WHERE (element.Parent.Id IS NULL OR element.Parent.Id NOT IN (SELECT id FROM IdSet(:elementIds)))
+        AND element.Model.Id NOT IN (SELECT id FROM IdSet(:elementIds))
+      UNION
+      SELECT child.ECInstanceId, deletionParent.DeleteRootId
+      FROM bis.Element child
+      INNER JOIN CascadeIds deletionParent ON child.Parent.Id = deletionParent.Id
+      UNION
+      SELECT modelElement.ECInstanceId, modeledElement.DeleteRootId
+      FROM bis.Element modelElement
+      INNER JOIN CascadeIds modeledElement ON modelElement.Model.Id = modeledElement.Id
+      UNION
+      SELECT codeDependent.ECInstanceId, codeDependent.ECInstanceId
+      FROM bis.Element codeDependent
+      INNER JOIN CascadeIds scope ON codeDependent.CodeScope.Id = scope.Id
+      ${includeParentedCodeDependents ? "" : "WHERE codeDependent.Parent.Id IS NULL"}
+    )
+    SELECT Id AS id, DeleteRootId AS rootId FROM CascadeIds
+  `;
+    const params = new core_common_1.QueryBinder().bindIdSet("elementIds", elementIds);
+    for await (const row of targetDb.createQueryReader(query, params, {
+        usePrimaryConn: true,
+    })) {
+        roots.add(row.rootId);
+        const elementRoots = rootsByElement.get(row.id);
+        if (elementRoots)
+            elementRoots.push(row.rootId);
+        else
+            rootsByElement.set(row.id, [row.rootId]);
+    }
+    return { roots, rootsByElement };
+}
+/** Finds the elements to keep so that the blocked elements stay valid: each blocked element and its child
+ * elements and sub-model contents, plus every element whose deletion would delete a kept element or leave its
+ * parent, model, or code scope dangling.
+ *
+ * The whole subtree below a blocked element is kept, even when the element is blocked only as a code scope and
+ * its children could be deleted. A kept category needs its sub-categories, because the plan can't see geometry
+ * outside the trees that uses them, and keeping too much is safe.
+ */
+async function queryKeptElements(targetDb, blockedIds) {
+    const query = `
+    WITH RECURSIVE
+      Above(Id) AS (
+        SELECT ids.id FROM IdSet(:blockedIds) ids
+        UNION
+        SELECT element.Parent.Id FROM bis.Element element
+        INNER JOIN Above ON element.ECInstanceId = Above.Id
+        WHERE element.Parent.Id IS NOT NULL
+        UNION
+        SELECT element.Model.Id FROM bis.Element element
+        INNER JOIN Above ON element.ECInstanceId = Above.Id
+        UNION
+        SELECT element.CodeScope.Id FROM bis.Element element
+        INNER JOIN Above ON element.ECInstanceId = Above.Id
+      ),
+      Below(Id) AS (
+        SELECT ids.id FROM IdSet(:blockedIds) ids
+        UNION
+        SELECT element.ECInstanceId FROM bis.Element element
+        INNER JOIN Below ON element.Parent.Id = Below.Id
+        UNION
+        SELECT element.ECInstanceId FROM bis.Element element
+        INNER JOIN Below ON element.Model.Id = Below.Id
+      )
+    SELECT Id AS id FROM Above
+    UNION
+    SELECT Id FROM Below
+  `;
+    const keptIds = new Set();
+    const params = new core_common_1.QueryBinder().bindIdSet("blockedIds", blockedIds);
+    for await (const row of targetDb.createQueryReader(query, params, {
+        usePrimaryConn: true,
+    }))
+        keptIds.add(row.id);
+    return keptIds;
+}
+/** Finds BisCore references to the specified elements that native deletion validates and that [[queryDeletionTrees]]
+ * does not follow. Parent and model references are not included because the deleted trees contain every child and
+ * modeled element.
+ */
+async function queryReferences(targetDb, elementIds) {
+    const references = [];
+    const geometryDefinitionIds = [];
+    // Any element can be a code scope. Every other validated reference targets a definition element, so those are
+    // queried only for the definitions among the elements, which are usually few or none.
+    const definitionIds = [];
+    const firstQuery = `
+    SELECT element.ECInstanceId AS referencingId, element.CodeScope.Id AS referencedId, 0 AS isDefinition
+    FROM bis.Element element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.CodeScope.Id
+    UNION ALL
+    SELECT definition.ECInstanceId, definition.ECInstanceId, 1
+    FROM bis.DefinitionElement definition
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = definition.ECInstanceId
+  `;
+    for await (const row of targetDb.createQueryReader(firstQuery, new core_common_1.QueryBinder().bindIdSet("elementIds", elementIds), { usePrimaryConn: true })) {
+        if (row.isDefinition === 1)
+            definitionIds.push(row.referencedId);
+        else
+            references.push({
+                referencingId: row.referencingId,
+                referencedId: row.referencedId,
+                usersFirst: false,
+            });
+    }
+    if (definitionIds.length === 0)
+        return { references, geometryDefinitionIds };
+    // Classes and properties added in later BisCore versions.
+    const sectionReferences = await querySectionViewReferences(targetDb);
+    // Kind 1: native validation refuses the definition while the referencing element exists, even in the same call.
+    // Kind 0: deleting both in the same call is enough. Native validation treats a default sub-category, whose ID
+    // follows its category's, as used by the category unless both are deleted.
+    // Kind 2: a definition that geometry references, so its users can't be queried.
+    const definitionQuery = `
+    SELECT element.ECInstanceId AS referencingId, element.Category.Id AS referencedId, 1 AS kind
+    FROM bis.GeometricElement3d element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.Category.Id
+    UNION ALL
+    SELECT element.ECInstanceId, element.Category.Id, 1
+    FROM bis.GeometricElement2d element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.Category.Id
+    UNION ALL
+    SELECT element.ECInstanceId, element.View.Id, 1
+    FROM bis.ViewAttachment element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.View.Id
+    ${sectionReferences
+        .map(({ className, propertyName }) => `
+    UNION ALL
+    SELECT element.ECInstanceId, element.${propertyName}.Id, 1
+    FROM bis.${className} element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.${propertyName}.Id`)
+        .join("")}
+    UNION ALL
+    SELECT viewDefinition.ECInstanceId, viewDefinition.DisplayStyle.Id, 0
+    FROM bis.ViewDefinition viewDefinition
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.DisplayStyle.Id
+    UNION ALL
+    SELECT viewDefinition.ECInstanceId, viewDefinition.CategorySelector.Id, 0
+    FROM bis.ViewDefinition viewDefinition
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.CategorySelector.Id
+    UNION ALL
+    SELECT viewDefinition.ECInstanceId, viewDefinition.ModelSelector.Id, 0
+    FROM bis.SpatialViewDefinition viewDefinition
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.ModelSelector.Id
+    UNION ALL
+    SELECT subCategory.Parent.Id, subCategory.ECInstanceId, 0
+    FROM bis.SubCategory subCategory
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = subCategory.ECInstanceId
+    WHERE CAST(subCategory.ECInstanceId AS INTEGER) = CAST(subCategory.Parent.Id AS INTEGER) + 1
+    UNION ALL
+    SELECT subCategory.ECInstanceId, subCategory.ECInstanceId, 2
+    FROM bis.SubCategory subCategory
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = subCategory.ECInstanceId
+    WHERE CAST(subCategory.ECInstanceId AS INTEGER) <> CAST(subCategory.Parent.Id AS INTEGER) + 1
+    ${["GeometryPart", "RenderMaterial", "Texture", "LineStyle"]
+        .map((className) => `
+    UNION ALL
+    SELECT element.ECInstanceId, element.ECInstanceId, 2
+    FROM bis.${className} element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId`)
+        .join("")}
+  `;
+    for await (const row of targetDb.createQueryReader(definitionQuery, new core_common_1.QueryBinder().bindIdSet("elementIds", definitionIds), { usePrimaryConn: true })) {
+        if (row.kind === 2)
+            geometryDefinitionIds.push(row.referencedId);
+        else
+            references.push({
+                referencingId: row.referencingId,
+                referencedId: row.referencedId,
+                usersFirst: row.kind === 1,
+            });
+    }
+    return { references, geometryDefinitionIds };
+}
+/** Finds the BisCore section classes and view properties that exist in the iModel's schema. */
+async function querySectionViewReferences(targetDb) {
+    const query = `
+    SELECT classDef.Name AS className, propertyDef.Name AS propertyName
+    FROM meta.ECPropertyDef propertyDef
+    INNER JOIN meta.ECClassDef classDef ON classDef.ECInstanceId = propertyDef.Class.Id
+    INNER JOIN meta.ECSchemaDef schemaDef ON schemaDef.ECInstanceId = classDef.Schema.Id
+    WHERE schemaDef.Name = 'BisCore'
+      AND ((classDef.Name = 'SectionDrawing' AND propertyDef.Name = 'SpatialView')
+        OR (classDef.Name = 'SectionDrawingLocation' AND propertyDef.Name = 'SectionView'))
+  `;
+    const references = [];
+    for await (const row of targetDb.createQueryReader(query, undefined, {
+        usePrimaryConn: true,
+    }))
+        references.push({
+            className: row.className,
+            propertyName: row.propertyName,
+        });
+    return references;
+}
+/** Finds the 2D and 3D geometric elements among the specified elements. */
+async function queryGeometricElements(targetDb, elementIds) {
+    // Joining the abstract bis.GeometricElement with an IdSet is quadratic, so query its 3D and 2D subclasses.
+    const query = `
+    SELECT element.ECInstanceId AS id
+    FROM bis.GeometricElement3d element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId
+    UNION ALL
+    SELECT element.ECInstanceId
+    FROM bis.GeometricElement2d element
+    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId
+  `;
+    const ids = [];
+    const params = new core_common_1.QueryBinder().bindIdSet("elementIds", elementIds);
+    for await (const row of targetDb.createQueryReader(query, params, {
+        usePrimaryConn: true,
+    }))
+        ids.push(row.id);
+    return ids;
+}
+//# sourceMappingURL=ElementBulkDelete.js.map

package/lib/cjs/ElementBulkDelete.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ElementBulkDelete.js","sourceRoot":"","sources":["../../src/ElementBulkDelete.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,sDAA6E;AAC7E,oDAAiD;AAuBjD;;;;;;;;;;;;;GAaG;AACI,KAAK,yBACV,QAAkB,EAClB,UAAmC;IAEnC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAA0B,CAAC;IACzD,SAAS,CAAC;QACR,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC/D,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;QAElE,MAAM,UAAU,GAAG,MAAM,eAAe,CACtC,QAAQ,EACR,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,CAC5B,CAAC;QACF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAc,CAAC;QACzC,KAAK,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;YACpE,IAAI,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC;gBAAE,SAAS;YACtD,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC7B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC;gBACnC,cAAc,CAAC,GAAG,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YACvB,OAAO;gBACL,MAAM,EAAE,MAAM,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,UAAU,CAAC;gBACrD,cAAc;aACf,CAAC;QAEJ,wGAAwG;QACxG,yEAAyE;QACzE,MAAM,cAAc,GAAG,YAAY,CAAC,IAAI,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,MAAM,iBAAiB,CAAC,QAAQ,EAAE,UAAU,CAAC;YAC5D,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAA,qBAAM,EACJ,YAAY,CAAC,IAAI,GAAG,cAAc,EAClC,6DAA6D,CAC9D,CAAC;IACJ,CAAC;AACH,CAAC;AAED,iGAAiG;AACjG,KAAK,UAAU,UAAU,CACvB,QAAkB,EAClB,KAAoB,EACpB,EAAE,UAAU,EAAE,qBAAqB,EAAkB;IAErD,oIAAoI;IACpI,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAAc,CAAC;IACxD,qFAAqF;IACrF,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAc,CAAC;IACvD,MAAM,iBAAiB,GAAG,CAAC,YAAwB,EAAE,EAAE;QACrD,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE;YAC/D,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC;IACF,MAAM,kBAAkB,GAAoB,EAAE,CAAC;IAC/C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACzB,yBAAyB,CAAC,GAAG,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;YACvD,iBAAiB,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IACD,iHAAiH;IACjH,6GAA6G;IAC7G,+GAA+G;IAC/G,wEAAwE;IACxE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAc,CAAC;IAC5C,KAAK,MAAM,EAAE,IAAI,qBAAqB;QACpC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YACrD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC9B,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,uBAAuB,GAAG,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC;aACtD,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;aACpE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACrB,IACE,CAAC,MAAM,sBAAsB,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC,CAAC,MAAM;YACxE,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,MAAM,sBAAsB,CAC3C,QAAQ,EACR,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,CAC5B;gBACC,yBAAyB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,KAAK,MAAM,MAAM,IAAI,aAAa;YAAE,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,wBAAwB,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,iEAAiE;IACjE,MAAM,0BAA0B,GAAG,CAAC,EAAc,EAAE,EAAE,CACpD,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CACnD,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,CACrC,CAAC;IACJ,2HAA2H;IAC3H,MAAM,aAAa,GAAG,CAAC,EAAc,EAAE,EAAE,CACvC,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CACvC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,CAClD,CAAC;IACJ,4GAA4G;IAC5G,wFAAwF;IACxF,MAAM,wBAAwB,GAC5B,CAAC,CAAC,GAAG,yBAAyB,CAAC,CAAC,IAAI,CAAC,0BAA0B,CAAC;QAChE,CAAC,kBAAkB,CAAC,IAAI,CACtB,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,EAAE,EAAE,CAClC,0BAA0B,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,YAAY,CAAC,CAC3E,CAAC;IACJ,IAAI,wBAAwB,EAAE,CAAC;QAC7B,+GAA+G;QAC/G,0CAA0C;QAC1C,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CACxC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,CAAC,CAC1C,CAAC;QACF,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC;YAC1B,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,GAAG,wBAAwB,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,wGAAwG;IACxG,6GAA6G;IAC7G,wGAAwG;IACxG,MAAM,SAAS,GAAG,MAAM,kBAAkB,CACxC,QAAQ,EACR,yBAAyB,EACzB,IAAI,CACL,CAAC;IACF,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAC5C,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAC1C,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC3D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,kBAAkB,CAC/B,QAAkB,EAClB,UAAmC,EACnC,6BAA6B,GAAG,KAAK;IAErC,MAAM,KAAK,GAAY,IAAI,GAAG,EAAc,CAAC;IAC7C,oHAAoH;IACpH,gGAAgG;IAChG,MAAM,cAAc,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC3D,kGAAkG;IAClG,iGAAiG;IACjG,qGAAqG;IACrG,4FAA4F;IAC5F,mGAAmG;IACnG,mEAAmE;IACnE,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;;;;;QAmBR,6BAA6B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,uCAAuC;;;GAGjF,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,yBAAW,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IACrE,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE;QAChE,cAAc,EAAE,IAAI;KACrB,CAAC,EAAE,CAAC;QACH,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtB,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,YAAY;YAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;;YAC3C,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC;AACnC,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,iBAAiB,CAC9B,QAAkB,EAClB,UAAmC;IAEnC,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2Bb,CAAC;IACF,MAAM,OAAO,GAAY,IAAI,GAAG,EAAc,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,yBAAW,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IACrE,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE;QAChE,cAAc,EAAE,IAAI;KACrB,CAAC;QACA,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtB,OAAO,OAAO,CAAC;AACjB,CAAC;AAmBD;;;GAGG;AACH,KAAK,UAAU,eAAe,CAC5B,QAAkB,EAClB,UAAgC;IAEhC,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,MAAM,qBAAqB,GAAiB,EAAE,CAAC;IAC/C,8GAA8G;IAC9G,sFAAsF;IACtF,MAAM,aAAa,GAAiB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAG;;;;;;;;GAQlB,CAAC;IACF,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAChD,UAAU,EACV,IAAI,yBAAW,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,EACrD,EAAE,cAAc,EAAE,IAAI,EAAE,CACzB,EAAE,CAAC;QACF,IAAI,GAAG,CAAC,YAAY,KAAK,CAAC;YAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;;YAE/D,UAAU,CAAC,IAAI,CAAC;gBACd,aAAa,EAAE,GAAG,CAAC,aAAa;gBAChC,YAAY,EAAE,GAAG,CAAC,YAAY;gBAC9B,UAAU,EAAE,KAAK;aAClB,CAAC,CAAC;IACP,CAAC;IACD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,CAAC;IAE7E,0DAA0D;IAC1D,MAAM,iBAAiB,GAAG,MAAM,0BAA0B,CAAC,QAAQ,CAAC,CAAC;IACrE,gHAAgH;IAChH,8GAA8G;IAC9G,2EAA2E;IAC3E,gFAAgF;IAChF,MAAM,eAAe,GAAG;;;;;;;;;;;;MAYpB,iBAAiB;SAChB,GAAG,CACF,CAAC,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;;2CAEE,YAAY;eACxC,SAAS;4DACoC,YAAY,KAAK,CACtE;SACA,IAAI,CAAC,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;MAuBT,CAAC,cAAc,EAAE,gBAAgB,EAAE,SAAS,EAAE,WAAW,CAAC;SACzD,GAAG,CACF,CAAC,SAAS,EAAE,EAAE,CAAC;;;eAGR,SAAS;uEAC+C,CAChE;SACA,IAAI,CAAC,EAAE,CAAC;GACZ,CAAC;IACF,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAChD,eAAe,EACf,IAAI,yBAAW,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,aAAa,CAAC,EACxD,EAAE,cAAc,EAAE,IAAI,EAAE,CACzB,EAAE,CAAC;QACF,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;YAAE,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;;YAE/D,UAAU,CAAC,IAAI,CAAC;gBACd,aAAa,EAAE,GAAG,CAAC,aAAa;gBAChC,YAAY,EAAE,GAAG,CAAC,YAAY;gBAC9B,UAAU,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC;aAC3B,CAAC,CAAC;IACP,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,CAAC;AAC/C,CAAC;AAED,+FAA+F;AAC/F,KAAK,UAAU,0BAA0B,CACvC,QAAkB;IAElB,MAAM,KAAK,GAAG;;;;;;;;GAQb,CAAC;IACF,MAAM,UAAU,GAAkD,EAAE,CAAC;IACrE,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE;QACnE,cAAc,EAAE,IAAI;KACrB,CAAC;QACA,UAAU,CAAC,IAAI,CAAC;YACd,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,YAAY,EAAE,GAAG,CAAC,YAAY;SAC/B,CAAC,CAAC;IACL,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,2EAA2E;AAC3E,KAAK,UAAU,sBAAsB,CACnC,QAAkB,EAClB,UAAgC;IAEhC,2GAA2G;IAC3G,MAAM,KAAK,GAAG;;;;;;;;GAQb,CAAC;IACF,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,IAAI,yBAAW,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IACrE,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE;QAChE,cAAc,EAAE,IAAI;KACrB,CAAC;QACA,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACnB,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { assert, Id64Array, Id64Set, Id64String } from \"@itwin/core-bentley\";\nimport { QueryBinder } from \"@itwin/core-common\";\nimport { IModelDb } from \"@itwin/core-backend\";\n\n/** Native deletion calls needed to delete a set of element trees without a partial result.\n * @internal\n */\nexport interface BulkDeletePlan {\n  /** Roots for each native deletion call, in execution order. Empty when nothing needs deleting. */\n  readonly phases: readonly Id64Array[];\n  /** Elements kept because an element outside the deleted trees still references them, each mapped to one such\n   * referencing element. Their child elements and sub-models, and the elements whose deletion would delete them,\n   * are kept too.\n   */\n  readonly keptReferences: ReadonlyMap<Id64String, Id64String>;\n}\n\ninterface DeletionTrees {\n  /** Roots that the native API must receive. */\n  readonly roots: Id64Set;\n  /** Every element that deleting the roots removes, mapped to the roots whose trees contain it. */\n  readonly rootsByElement: ReadonlyMap<Id64String, readonly Id64String[]>;\n}\n\n/** Plans native bulk deletion of the specified element trees.\n *\n * An element that something outside the deleted trees still references is kept, together with what it\n * needs to stay valid, and the rest is deleted. Keeping elements can leave new outside references, so the\n * plan repeats until none remain.\n *\n * Native validation checks each root against the iModel before the call, so a root is refused when its tree\n * contains a definition, such as a category or a view, that a non-definition element in the same call still\n * uses. The plan deletes those users in an earlier call than the definitions they use. Validation stays enabled\n * for every call, so a reference this plan does not know about fails loudly instead of leaving a dangling\n * reference. That includes elements outside the trees whose geometry uses a definition in them, such as a\n * geometry part: only native code can read geometry, so those uses are not checked in advance.\n * @internal\n */\nexport async function planBulkDelete(\n  targetDb: IModelDb,\n  elementIds: ReadonlySet<Id64String>\n): Promise<BulkDeletePlan> {\n  const requestedIds = new Set(elementIds);\n  const keptReferences = new Map<Id64String, Id64String>();\n  for (;;) {\n    const trees = await queryDeletionTrees(targetDb, requestedIds);\n    if (trees.roots.size === 0) return { phases: [], keptReferences };\n\n    const references = await queryReferences(\n      targetDb,\n      trees.rootsByElement.keys()\n    );\n    const blockedIds = new Set<Id64String>();\n    for (const { referencingId, referencedId } of references.references) {\n      if (trees.rootsByElement.has(referencingId)) continue;\n      blockedIds.add(referencedId);\n      if (!keptReferences.has(referencedId))\n        keptReferences.set(referencedId, referencingId);\n    }\n    if (blockedIds.size === 0)\n      return {\n        phases: await planPhases(targetDb, trees, references),\n        keptReferences,\n      };\n\n    // Every blocked element is reached from a requested element, and queryKeptElements walks back up to it,\n    // so each pass removes at least one requested element and the loop ends.\n    const requestedCount = requestedIds.size;\n    for (const id of await queryKeptElements(targetDb, blockedIds))\n      requestedIds.delete(id);\n    assert(\n      requestedIds.size < requestedCount,\n      \"Keeping referenced elements must remove a requested element\"\n    );\n  }\n}\n\n/** Orders the roots of deletion trees that nothing outside them references into native calls. */\nasync function planPhases(\n  targetDb: IModelDb,\n  trees: DeletionTrees,\n  { references, geometryDefinitionIds }: TreeReferences\n): Promise<Id64Array[]> {\n  // Elements in the trees that use a definition that is also in the trees. Native validation refuses the definition while they exist.\n  const usersOfDeletedDefinitions = new Set<Id64String>();\n  // Roots whose trees contain such a definition. They must be deleted after its users.\n  const rootsWithUsedDefinitions = new Set<Id64String>();\n  const addUsedDefinition = (definitionId: Id64String) => {\n    for (const rootId of trees.rootsByElement.get(definitionId) ?? [])\n      rootsWithUsedDefinitions.add(rootId);\n  };\n  const sameCallReferences: TreeReference[] = [];\n  for (const reference of references) {\n    if (reference.usersFirst) {\n      usersOfDeletedDefinitions.add(reference.referencingId);\n      addUsedDefinition(reference.referencedId);\n    } else {\n      sameCallReferences.push(reference);\n    }\n  }\n  // Only native code can tell which geometry uses a geometry part, material, texture, line style, or sub-category,\n  // so every geometric element in the trees counts as a user of every such definition. Deleting the trees that\n  // contain those definitions last is enough unless one of them also contains a geometric element; only then are\n  // all geometric elements queried, to delete them as roots of their own.\n  const geometryRoots = new Set<Id64String>();\n  for (const id of geometryDefinitionIds)\n    for (const rootId of trees.rootsByElement.get(id) ?? [])\n      geometryRoots.add(rootId);\n  if (geometryRoots.size > 0) {\n    const elementsInGeometryTrees = [...trees.rootsByElement]\n      .filter(([, rootIds]) => rootIds.some((id) => geometryRoots.has(id)))\n      .map(([id]) => id);\n    if (\n      (await queryGeometricElements(targetDb, elementsInGeometryTrees)).length >\n      0\n    )\n      for (const id of await queryGeometricElements(\n        targetDb,\n        trees.rootsByElement.keys()\n      ))\n        usersOfDeletedDefinitions.add(id);\n    for (const rootId of geometryRoots) rootsWithUsedDefinitions.add(rootId);\n  }\n  if (rootsWithUsedDefinitions.size === 0) return [[...trees.roots]];\n  // True when a root deleted in the last call removes the element.\n  const isInTreeWithUsedDefinition = (id: Id64String) =>\n    (trees.rootsByElement.get(id) ?? []).some((rootId) =>\n      rootsWithUsedDefinitions.has(rootId)\n    );\n  // True when a root deleted in the first call removes the element. An element in overlapping trees can satisfy both checks.\n  const isInOtherTree = (id: Id64String) =>\n    (trees.rootsByElement.get(id) ?? []).some(\n      (rootId) => !rootsWithUsedDefinitions.has(rootId)\n    );\n  // Deleting the other roots first works unless a user shares a tree with a used definition, or an other tree\n  // contains an element that an element deleted later references, such as its code scope.\n  const canDeleteOtherRootsFirst =\n    ![...usersOfDeletedDefinitions].some(isInTreeWithUsedDefinition) &&\n    !sameCallReferences.some(\n      ({ referencingId, referencedId }) =>\n        isInTreeWithUsedDefinition(referencingId) && isInOtherTree(referencedId)\n    );\n  if (canDeleteOtherRootsFirst) {\n    // There are no other roots only when every tree contains a geometry definition and nothing in the trees uses a\n    // definition through a queried reference.\n    const otherRoots = [...trees.roots].filter(\n      (id) => !rootsWithUsedDefinitions.has(id)\n    );\n    return otherRoots.length > 0\n      ? [otherRoots, [...rootsWithUsedDefinitions]]\n      : [[...rootsWithUsedDefinitions]];\n  }\n\n  // Otherwise delete the users and their code dependents as roots of their own. Core refuses to delete an\n  // element whose code scopes an element deleted in a later call, so the first call also takes code dependents\n  // that have a parent. They are all in the trees; one outside them would have kept its code scope above.\n  const userTrees = await queryDeletionTrees(\n    targetDb,\n    usersOfDeletedDefinitions,\n    true\n  );\n  const remainingRoots = [...trees.roots].filter(\n    (id) => !userTrees.rootsByElement.has(id)\n  );\n  const phases = [[...userTrees.roots]];\n  if (remainingRoots.length > 0) phases.push(remainingRoots);\n  return phases;\n}\n\n/** Finds the native deletion roots and every element their deletion removes.\n *\n * Native deletion already cascades through child elements and modeled contents. This query follows\n * those dependencies to find elements whose codes are scoped by an element in a deleted tree. Each\n * code-dependent element becomes another native deletion root. Only top-level code dependents are\n * included unless `includeParentedCodeDependents` is true.\n */\nasync function queryDeletionTrees(\n  targetDb: IModelDb,\n  elementIds: ReadonlySet<Id64String>,\n  includeParentedCodeDependents = false\n): Promise<DeletionTrees> {\n  const roots: Id64Set = new Set<Id64String>();\n  // An element has more than one root only when requested trees overlap. UNION in the query already removes duplicate\n  // (element, root) pairs, so an array holds distinct roots without allocating a Set per element.\n  const rootsByElement = new Map<Id64String, Id64String[]>();\n  // CascadeIds pairs each traversed element with a root that the native API must delete. The anchor\n  // adds requested elements that still exist, except those whose parent or modeled element is also\n  // requested: the recursion reaches them anyway, and anchoring them too would walk a nested tree once\n  // per requested ancestor. Recursive branches walk child elements and modeled contents while\n  // preserving DeleteRootId. An element whose code is scoped by anything already traversed becomes a\n  // new root, so recursion also covers its tree and code dependents.\n  const query = `\n    WITH RECURSIVE CascadeIds(Id, DeleteRootId) AS (\n      SELECT element.ECInstanceId, element.ECInstanceId\n      FROM bis.Element element\n      INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId\n      WHERE (element.Parent.Id IS NULL OR element.Parent.Id NOT IN (SELECT id FROM IdSet(:elementIds)))\n        AND element.Model.Id NOT IN (SELECT id FROM IdSet(:elementIds))\n      UNION\n      SELECT child.ECInstanceId, deletionParent.DeleteRootId\n      FROM bis.Element child\n      INNER JOIN CascadeIds deletionParent ON child.Parent.Id = deletionParent.Id\n      UNION\n      SELECT modelElement.ECInstanceId, modeledElement.DeleteRootId\n      FROM bis.Element modelElement\n      INNER JOIN CascadeIds modeledElement ON modelElement.Model.Id = modeledElement.Id\n      UNION\n      SELECT codeDependent.ECInstanceId, codeDependent.ECInstanceId\n      FROM bis.Element codeDependent\n      INNER JOIN CascadeIds scope ON codeDependent.CodeScope.Id = scope.Id\n      ${includeParentedCodeDependents ? \"\" : \"WHERE codeDependent.Parent.Id IS NULL\"}\n    )\n    SELECT Id AS id, DeleteRootId AS rootId FROM CascadeIds\n  `;\n  const params = new QueryBinder().bindIdSet(\"elementIds\", elementIds);\n  for await (const row of targetDb.createQueryReader(query, params, {\n    usePrimaryConn: true,\n  })) {\n    roots.add(row.rootId);\n    const elementRoots = rootsByElement.get(row.id);\n    if (elementRoots) elementRoots.push(row.rootId);\n    else rootsByElement.set(row.id, [row.rootId]);\n  }\n  return { roots, rootsByElement };\n}\n\n/** Finds the elements to keep so that the blocked elements stay valid: each blocked element and its child\n * elements and sub-model contents, plus every element whose deletion would delete a kept element or leave its\n * parent, model, or code scope dangling.\n *\n * The whole subtree below a blocked element is kept, even when the element is blocked only as a code scope and\n * its children could be deleted. A kept category needs its sub-categories, because the plan can't see geometry\n * outside the trees that uses them, and keeping too much is safe.\n */\nasync function queryKeptElements(\n  targetDb: IModelDb,\n  blockedIds: ReadonlySet<Id64String>\n): Promise<Id64Set> {\n  const query = `\n    WITH RECURSIVE\n      Above(Id) AS (\n        SELECT ids.id FROM IdSet(:blockedIds) ids\n        UNION\n        SELECT element.Parent.Id FROM bis.Element element\n        INNER JOIN Above ON element.ECInstanceId = Above.Id\n        WHERE element.Parent.Id IS NOT NULL\n        UNION\n        SELECT element.Model.Id FROM bis.Element element\n        INNER JOIN Above ON element.ECInstanceId = Above.Id\n        UNION\n        SELECT element.CodeScope.Id FROM bis.Element element\n        INNER JOIN Above ON element.ECInstanceId = Above.Id\n      ),\n      Below(Id) AS (\n        SELECT ids.id FROM IdSet(:blockedIds) ids\n        UNION\n        SELECT element.ECInstanceId FROM bis.Element element\n        INNER JOIN Below ON element.Parent.Id = Below.Id\n        UNION\n        SELECT element.ECInstanceId FROM bis.Element element\n        INNER JOIN Below ON element.Model.Id = Below.Id\n      )\n    SELECT Id AS id FROM Above\n    UNION\n    SELECT Id FROM Below\n  `;\n  const keptIds: Id64Set = new Set<Id64String>();\n  const params = new QueryBinder().bindIdSet(\"blockedIds\", blockedIds);\n  for await (const row of targetDb.createQueryReader(query, params, {\n    usePrimaryConn: true,\n  }))\n    keptIds.add(row.id);\n  return keptIds;\n}\n\ninterface TreeReference {\n  readonly referencingId: Id64String;\n  readonly referencedId: Id64String;\n  /** True when native validation refuses the referenced element while the referencing element exists, even when\n   * both are deleted in the same call. False when deleting them in the same call is enough.\n   */\n  readonly usersFirst: boolean;\n}\n\ninterface TreeReferences {\n  readonly references: readonly TreeReference[];\n  /** Geometry parts, materials, textures, line styles, and non-default sub-categories in the trees. Geometry\n   * references them, so their users can't be queried.\n   */\n  readonly geometryDefinitionIds: readonly Id64String[];\n}\n\n/** Finds BisCore references to the specified elements that native deletion validates and that [[queryDeletionTrees]]\n * does not follow. Parent and model references are not included because the deleted trees contain every child and\n * modeled element.\n */\nasync function queryReferences(\n  targetDb: IModelDb,\n  elementIds: Iterable<Id64String>\n): Promise<TreeReferences> {\n  const references: TreeReference[] = [];\n  const geometryDefinitionIds: Id64String[] = [];\n  // Any element can be a code scope. Every other validated reference targets a definition element, so those are\n  // queried only for the definitions among the elements, which are usually few or none.\n  const definitionIds: Id64String[] = [];\n  const firstQuery = `\n    SELECT element.ECInstanceId AS referencingId, element.CodeScope.Id AS referencedId, 0 AS isDefinition\n    FROM bis.Element element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.CodeScope.Id\n    UNION ALL\n    SELECT definition.ECInstanceId, definition.ECInstanceId, 1\n    FROM bis.DefinitionElement definition\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = definition.ECInstanceId\n  `;\n  for await (const row of targetDb.createQueryReader(\n    firstQuery,\n    new QueryBinder().bindIdSet(\"elementIds\", elementIds),\n    { usePrimaryConn: true }\n  )) {\n    if (row.isDefinition === 1) definitionIds.push(row.referencedId);\n    else\n      references.push({\n        referencingId: row.referencingId,\n        referencedId: row.referencedId,\n        usersFirst: false,\n      });\n  }\n  if (definitionIds.length === 0) return { references, geometryDefinitionIds };\n\n  // Classes and properties added in later BisCore versions.\n  const sectionReferences = await querySectionViewReferences(targetDb);\n  // Kind 1: native validation refuses the definition while the referencing element exists, even in the same call.\n  // Kind 0: deleting both in the same call is enough. Native validation treats a default sub-category, whose ID\n  // follows its category's, as used by the category unless both are deleted.\n  // Kind 2: a definition that geometry references, so its users can't be queried.\n  const definitionQuery = `\n    SELECT element.ECInstanceId AS referencingId, element.Category.Id AS referencedId, 1 AS kind\n    FROM bis.GeometricElement3d element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.Category.Id\n    UNION ALL\n    SELECT element.ECInstanceId, element.Category.Id, 1\n    FROM bis.GeometricElement2d element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.Category.Id\n    UNION ALL\n    SELECT element.ECInstanceId, element.View.Id, 1\n    FROM bis.ViewAttachment element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.View.Id\n    ${sectionReferences\n      .map(\n        ({ className, propertyName }) => `\n    UNION ALL\n    SELECT element.ECInstanceId, element.${propertyName}.Id, 1\n    FROM bis.${className} element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.${propertyName}.Id`\n      )\n      .join(\"\")}\n    UNION ALL\n    SELECT viewDefinition.ECInstanceId, viewDefinition.DisplayStyle.Id, 0\n    FROM bis.ViewDefinition viewDefinition\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.DisplayStyle.Id\n    UNION ALL\n    SELECT viewDefinition.ECInstanceId, viewDefinition.CategorySelector.Id, 0\n    FROM bis.ViewDefinition viewDefinition\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.CategorySelector.Id\n    UNION ALL\n    SELECT viewDefinition.ECInstanceId, viewDefinition.ModelSelector.Id, 0\n    FROM bis.SpatialViewDefinition viewDefinition\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = viewDefinition.ModelSelector.Id\n    UNION ALL\n    SELECT subCategory.Parent.Id, subCategory.ECInstanceId, 0\n    FROM bis.SubCategory subCategory\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = subCategory.ECInstanceId\n    WHERE CAST(subCategory.ECInstanceId AS INTEGER) = CAST(subCategory.Parent.Id AS INTEGER) + 1\n    UNION ALL\n    SELECT subCategory.ECInstanceId, subCategory.ECInstanceId, 2\n    FROM bis.SubCategory subCategory\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = subCategory.ECInstanceId\n    WHERE CAST(subCategory.ECInstanceId AS INTEGER) <> CAST(subCategory.Parent.Id AS INTEGER) + 1\n    ${[\"GeometryPart\", \"RenderMaterial\", \"Texture\", \"LineStyle\"]\n      .map(\n        (className) => `\n    UNION ALL\n    SELECT element.ECInstanceId, element.ECInstanceId, 2\n    FROM bis.${className} element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId`\n      )\n      .join(\"\")}\n  `;\n  for await (const row of targetDb.createQueryReader(\n    definitionQuery,\n    new QueryBinder().bindIdSet(\"elementIds\", definitionIds),\n    { usePrimaryConn: true }\n  )) {\n    if (row.kind === 2) geometryDefinitionIds.push(row.referencedId);\n    else\n      references.push({\n        referencingId: row.referencingId,\n        referencedId: row.referencedId,\n        usersFirst: row.kind === 1,\n      });\n  }\n  return { references, geometryDefinitionIds };\n}\n\n/** Finds the BisCore section classes and view properties that exist in the iModel's schema. */\nasync function querySectionViewReferences(\n  targetDb: IModelDb\n): Promise<{ className: string; propertyName: string }[]> {\n  const query = `\n    SELECT classDef.Name AS className, propertyDef.Name AS propertyName\n    FROM meta.ECPropertyDef propertyDef\n    INNER JOIN meta.ECClassDef classDef ON classDef.ECInstanceId = propertyDef.Class.Id\n    INNER JOIN meta.ECSchemaDef schemaDef ON schemaDef.ECInstanceId = classDef.Schema.Id\n    WHERE schemaDef.Name = 'BisCore'\n      AND ((classDef.Name = 'SectionDrawing' AND propertyDef.Name = 'SpatialView')\n        OR (classDef.Name = 'SectionDrawingLocation' AND propertyDef.Name = 'SectionView'))\n  `;\n  const references: { className: string; propertyName: string }[] = [];\n  for await (const row of targetDb.createQueryReader(query, undefined, {\n    usePrimaryConn: true,\n  }))\n    references.push({\n      className: row.className,\n      propertyName: row.propertyName,\n    });\n  return references;\n}\n\n/** Finds the 2D and 3D geometric elements among the specified elements. */\nasync function queryGeometricElements(\n  targetDb: IModelDb,\n  elementIds: Iterable<Id64String>\n): Promise<Id64String[]> {\n  // Joining the abstract bis.GeometricElement with an IdSet is quadratic, so query its 3D and 2D subclasses.\n  const query = `\n    SELECT element.ECInstanceId AS id\n    FROM bis.GeometricElement3d element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId\n    UNION ALL\n    SELECT element.ECInstanceId\n    FROM bis.GeometricElement2d element\n    INNER JOIN IdSet(:elementIds) ids ON ids.id = element.ECInstanceId\n  `;\n  const ids: Id64String[] = [];\n  const params = new QueryBinder().bindIdSet(\"elementIds\", elementIds);\n  for await (const row of targetDb.createQueryReader(query, params, {\n    usePrimaryConn: true,\n  }))\n    ids.push(row.id);\n  return ids;\n}\n"]}

package/lib/cjs/EntityExistenceCache.d.ts

@@ -0,0 +1,43 @@
+/** @packageDocumentation
+ * @module Utils
+ */
+import { EntityReference } from "@itwin/core-common";
+import { IModelDb } from "@itwin/core-backend";
+/** A positive-only read-through cache of entity existence checks, scoped to a single transformation run.
+ *
+ * Entities are created continuously as a transformation progresses, so a negative
+ * ("does not exist") result may become stale at any moment — therefore only positive
+ * results are ever cached. Positive results can only be invalidated by deletes, which the
+ * transformer routes through [[invalidate]] and [[clearDb]].
+ *
+ * The cache is keyed by [IModelDb]($core-backend) instance, so same-iModel transformations
+ * (where sourceDb === targetDb) share a single set and source/target roles cannot be confused.
+ *
+ * [IModelImporter]($transformer) delete operations invalidate registered caches. Deletes performed
+ * directly through an `EditTxn` while a transformation is active are out-of-band and must not be
+ * mixed with transformer operations. A successful high-level `process()` clears the cache when the
+ * transformation finalizes; low-level or failed transformations clear it when the transformer is
+ * disposed.
+ * @internal
+ */
+export declare class EntityExistenceCache {
+    private _existsByDb;
+    private getDbSet;
+    /** Check whether an entity exists in `db`, consulting the cache first.
+     * A `true` result is cached; a `false` result is never cached and will be re-queried.
+     */
+    exists(db: IModelDb, entityReference: EntityReference): Promise<boolean>;
+    /** Read through the cache to check which of the supplied entities exist in `db`, populating it on a miss. */
+    existsAll(db: IModelDb, entityReferences: Iterable<EntityReference>): Promise<ReadonlySet<EntityReference>>;
+    /** Record that an entity is known to exist in `db` (e.g. it was just imported). */
+    markExists(db: IModelDb, entityReference: EntityReference): void;
+    /** Remove a single entity from the cache for `db`, forcing a re-query on next check. */
+    invalidate(db: IModelDb, entityReference: EntityReference): void;
+    /** Drop all cached results for `db`. Used when a delete may cascade to entities the
+     * caller cannot enumerate (e.g. element tree deletes that remove descendants and submodels).
+     */
+    clearDb(db: IModelDb): void;
+    /** Drop all cached results. */
+    clear(): void;
+}
+//# sourceMappingURL=EntityExistenceCache.d.ts.map

package/lib/cjs/EntityExistenceCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EntityExistenceCache.d.ts","sourceRoot":"","sources":["../../src/EntityExistenceCache.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAG/C;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,WAAW,CAA6C;IAEhE,OAAO,CAAC,QAAQ;IAShB;;OAEG;IACU,MAAM,CACjB,EAAE,EAAE,QAAQ,EACZ,eAAe,EAAE,eAAe,GAC/B,OAAO,CAAC,OAAO,CAAC,CAMlB;IAED,6GAA6G;IAChG,SAAS,CACpB,EAAE,EAAE,QAAQ,EACZ,gBAAgB,EAAE,QAAQ,CAAC,eAAe,CAAC,GAC1C,OAAO,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAkBvC;IAED,mFAAmF;IAC5E,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,GAAG,IAAI,CAEtE;IAED,wFAAwF;IACjF,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,GAAG,IAAI,CAEtE;IAED;;OAEG;IACI,OAAO,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI,CAEjC;IAED,+BAA+B;IACxB,KAAK,IAAI,IAAI,CAEnB;CACF"}

package/lib/cjs/EntityExistenceCache.js

@@ -0,0 +1,91 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+ * See LICENSE.md in the project root for license terms and full copyright notice.
+ *--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Utils
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EntityExistenceCache = void 0;
+const EntityUnifier_1 = require("./EntityUnifier");
+/** A positive-only read-through cache of entity existence checks, scoped to a single transformation run.
+ *
+ * Entities are created continuously as a transformation progresses, so a negative
+ * ("does not exist") result may become stale at any moment — therefore only positive
+ * results are ever cached. Positive results can only be invalidated by deletes, which the
+ * transformer routes through [[invalidate]] and [[clearDb]].
+ *
+ * The cache is keyed by [IModelDb]($core-backend) instance, so same-iModel transformations
+ * (where sourceDb === targetDb) share a single set and source/target roles cannot be confused.
+ *
+ * [IModelImporter]($transformer) delete operations invalidate registered caches. Deletes performed
+ * directly through an `EditTxn` while a transformation is active are out-of-band and must not be
+ * mixed with transformer operations. A successful high-level `process()` clears the cache when the
+ * transformation finalizes; low-level or failed transformations clear it when the transformer is
+ * disposed.
+ * @internal
+ */
+class EntityExistenceCache {
+    _existsByDb = new Map();
+    getDbSet(db) {
+        let set = this._existsByDb.get(db);
+        if (set === undefined) {
+            set = new Set();
+            this._existsByDb.set(db, set);
+        }
+        return set;
+    }
+    /** Check whether an entity exists in `db`, consulting the cache first.
+     * A `true` result is cached; a `false` result is never cached and will be re-queried.
+     */
+    async exists(db, entityReference) {
+        const set = this.getDbSet(db);
+        if (set.has(entityReference))
+            return true;
+        const found = await EntityUnifier_1.EntityUnifier.exists(db, { entityReference });
+        if (found)
+            set.add(entityReference);
+        return found;
+    }
+    /** Read through the cache to check which of the supplied entities exist in `db`, populating it on a miss. */
+    async existsAll(db, entityReferences) {
+        const dbSet = this.getDbSet(db);
+        const found = new Set();
+        const unverified = [];
+        for (const entityReference of entityReferences) {
+            if (dbSet.has(entityReference))
+                found.add(entityReference);
+            else
+                unverified.push(entityReference);
+        }
+        if (unverified.length === 0)
+            return found;
+        const queried = await EntityUnifier_1.EntityUnifier.existsAll(db, unverified);
+        for (const entityReference of queried) {
+            dbSet.add(entityReference);
+            found.add(entityReference);
+        }
+        return found;
+    }
+    /** Record that an entity is known to exist in `db` (e.g. it was just imported). */
+    markExists(db, entityReference) {
+        this.getDbSet(db).add(entityReference);
+    }
+    /** Remove a single entity from the cache for `db`, forcing a re-query on next check. */
+    invalidate(db, entityReference) {
+        this._existsByDb.get(db)?.delete(entityReference);
+    }
+    /** Drop all cached results for `db`. Used when a delete may cascade to entities the
+     * caller cannot enumerate (e.g. element tree deletes that remove descendants and submodels).
+     */
+    clearDb(db) {
+        this._existsByDb.delete(db);
+    }
+    /** Drop all cached results. */
+    clear() {
+        this._existsByDb.clear();
+    }
+}
+exports.EntityExistenceCache = EntityExistenceCache;
+//# sourceMappingURL=EntityExistenceCache.js.map

package/lib/cjs/EntityExistenceCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EntityExistenceCache.js","sourceRoot":"","sources":["../../src/EntityExistenceCache.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG;;GAEG;;;AAIH,mDAAgD;AAEhD;;;;;;;;;;;;;;;;GAgBG;AACH;IACU,WAAW,GAAG,IAAI,GAAG,EAAkC,CAAC;IAExD,QAAQ,CAAC,EAAY;QAC3B,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YAChB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,EAAY,EACZ,eAAgC;QAEhC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,6BAAa,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,CAAC;QAClE,IAAI,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6GAA6G;IACtG,KAAK,CAAC,SAAS,CACpB,EAAY,EACZ,gBAA2C;QAE3C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;QACzC,MAAM,UAAU,GAAsB,EAAE,CAAC;QAEzC,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;YAC/C,IAAI,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;;gBACtD,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAE1C,MAAM,OAAO,GAAG,MAAM,6BAAa,CAAC,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC9D,KAAK,MAAM,eAAe,IAAI,OAAO,EAAE,CAAC;YACtC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mFAAmF;IAC5E,UAAU,CAAC,EAAY,EAAE,eAAgC;QAC9D,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACzC,CAAC;IAED,wFAAwF;IACjF,UAAU,CAAC,EAAY,EAAE,eAAgC;QAC9D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,EAAY;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,+BAA+B;IACxB,KAAK;QACV,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utils\n */\n\nimport { EntityReference } from \"@itwin/core-common\";\nimport { IModelDb } from \"@itwin/core-backend\";\nimport { EntityUnifier } from \"./EntityUnifier\";\n\n/** A positive-only read-through cache of entity existence checks, scoped to a single transformation run.\n *\n * Entities are created continuously as a transformation progresses, so a negative\n * (\"does not exist\") result may become stale at any moment — therefore only positive\n * results are ever cached. Positive results can only be invalidated by deletes, which the\n * transformer routes through [[invalidate]] and [[clearDb]].\n *\n * The cache is keyed by [IModelDb]($core-backend) instance, so same-iModel transformations\n * (where sourceDb === targetDb) share a single set and source/target roles cannot be confused.\n *\n * [IModelImporter]($transformer) delete operations invalidate registered caches. Deletes performed\n * directly through an `EditTxn` while a transformation is active are out-of-band and must not be\n * mixed with transformer operations. A successful high-level `process()` clears the cache when the\n * transformation finalizes; low-level or failed transformations clear it when the transformer is\n * disposed.\n * @internal\n */\nexport class EntityExistenceCache {\n  private _existsByDb = new Map<IModelDb, Set<EntityReference>>();\n\n  private getDbSet(db: IModelDb): Set<EntityReference> {\n    let set = this._existsByDb.get(db);\n    if (set === undefined) {\n      set = new Set();\n      this._existsByDb.set(db, set);\n    }\n    return set;\n  }\n\n  /** Check whether an entity exists in `db`, consulting the cache first.\n   * A `true` result is cached; a `false` result is never cached and will be re-queried.\n   */\n  public async exists(\n    db: IModelDb,\n    entityReference: EntityReference\n  ): Promise<boolean> {\n    const set = this.getDbSet(db);\n    if (set.has(entityReference)) return true;\n    const found = await EntityUnifier.exists(db, { entityReference });\n    if (found) set.add(entityReference);\n    return found;\n  }\n\n  /** Read through the cache to check which of the supplied entities exist in `db`, populating it on a miss. */\n  public async existsAll(\n    db: IModelDb,\n    entityReferences: Iterable<EntityReference>\n  ): Promise<ReadonlySet<EntityReference>> {\n    const dbSet = this.getDbSet(db);\n    const found = new Set<EntityReference>();\n    const unverified: EntityReference[] = [];\n\n    for (const entityReference of entityReferences) {\n      if (dbSet.has(entityReference)) found.add(entityReference);\n      else unverified.push(entityReference);\n    }\n\n    if (unverified.length === 0) return found;\n\n    const queried = await EntityUnifier.existsAll(db, unverified);\n    for (const entityReference of queried) {\n      dbSet.add(entityReference);\n      found.add(entityReference);\n    }\n    return found;\n  }\n\n  /** Record that an entity is known to exist in `db` (e.g. it was just imported). */\n  public markExists(db: IModelDb, entityReference: EntityReference): void {\n    this.getDbSet(db).add(entityReference);\n  }\n\n  /** Remove a single entity from the cache for `db`, forcing a re-query on next check. */\n  public invalidate(db: IModelDb, entityReference: EntityReference): void {\n    this._existsByDb.get(db)?.delete(entityReference);\n  }\n\n  /** Drop all cached results for `db`. Used when a delete may cascade to entities the\n   * caller cannot enumerate (e.g. element tree deletes that remove descendants and submodels).\n   */\n  public clearDb(db: IModelDb): void {\n    this._existsByDb.delete(db);\n  }\n\n  /** Drop all cached results. */\n  public clear(): void {\n    this._existsByDb.clear();\n  }\n}\n"]}

package/lib/cjs/EntityUnifier.d.ts

@@ -4,18 +4,18 @@
  * for entity-generic operations in the transformer
  */
 import { EntityReference } from "@itwin/core-common";
-import { ConcreteEntity, ConcreteEntityProps, IModelDb } from "@itwin/core-backend";
+import { ConcreteEntity, IModelDb } from "@itwin/core-backend";
 /** @internal */
 export declare namespace EntityUnifier {
-    export function getReadableType(entity: ConcreteEntity): "element" | "element aspect" | "relationship" | "unknown entity type";
-    type EntityUpdater = (entityProps: ConcreteEntityProps) => void;
-    /** needs to return a widened type otherwise typescript complains when result is used with a narrow type */
-    export function updaterFor(db: IModelDb, entity: ConcreteEntity): EntityUpdater;
-    export function exists(db: IModelDb, arg: {
+    function getReadableType(entity: ConcreteEntity): "element" | "element aspect" | "relationship" | "unknown entity type";
+    function exists(db: IModelDb, arg: {
         entity: ConcreteEntity;
     } | {
         entityReference: EntityReference;
     }): Promise<boolean>;
-    export {};
+    /** Batched existence check: returns the subset of `entityReferences` that exist in `db`,
+     * using one query per concrete entity type instead of one query per reference.
+     */
+    function existsAll(db: IModelDb, entityReferences: Iterable<EntityReference>): Promise<Set<EntityReference>>;
 }
 //# sourceMappingURL=EntityUnifier.d.ts.map

package/lib/cjs/EntityUnifier.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"EntityUnifier.d.ts","sourceRoot":"","sources":["../../src/EntityUnifier.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AAGH,OAAO,EAEL,eAAe,EAEhB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,cAAc,EACd,mBAAmB,EAKnB,QAAQ,EAET,MAAM,qBAAqB,CAAC;AAG7B,gBAAgB;AAChB,yBAAiB,aAAa,CAAC;IAC7B,MAAM,UAAU,eAAe,CAAC,MAAM,EAAE,cAAc,yEAKrD;IAED,KAAK,aAAa,GAAG,CAAC,WAAW,EAAE,mBAAmB,KAAK,IAAI,CAAC;IAEhE,2GAA2G;IAC3G,MAAM,UAAU,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,cAAc,iBAc9D;IAED,gBAAsB,MAAM,CAC1B,EAAE,EAAE,QAAQ,EACZ,GAAG,EAAE;QAAE,MAAM,EAAE,cAAc,CAAA;KAAE,GAAG;QAAE,eAAe,EAAE,eAAe,CAAA;KAAE,oBAkBvE;;CACF"}
+{"version":3,"file":"EntityUnifier.d.ts","sourceRoot":"","sources":["../../src/EntityUnifier.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AAEH,OAAO,EAEL,eAAe,EAEhB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,cAAc,EAMd,QAAQ,EAGT,MAAM,qBAAqB,CAAC;AAU7B,gBAAgB;AAChB,yBAAiB,aAAa,CAAC;IAC7B,SAAgB,eAAe,CAAC,MAAM,EAAE,cAAc,yEAKrD;IAED,SAAsB,MAAM,CAC1B,EAAE,EAAE,QAAQ,EACZ,GAAG,EAAE;QAAE,MAAM,EAAE,cAAc,CAAA;KAAE,GAAG;QAAE,eAAe,EAAE,eAAe,CAAA;KAAE,oBAqBvE;IAED;;OAEG;IACH,SAAsB,SAAS,CAC7B,EAAE,EAAE,QAAQ,EACZ,gBAAgB,EAAE,QAAQ,CAAC,eAAe,CAAC,GAC1C,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CA8B/B;CACF"}