@memberjunction/metadata-sync 2.117.0 → 2.118.0

package/dist/lib/deletion-auditor.js

@@ -0,0 +1,219 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DeletionAuditor = void 0;
+const record_dependency_analyzer_1 = require("./record-dependency-analyzer");
+const database_reference_scanner_1 = require("./database-reference-scanner");
+const entity_foreign_key_helper_1 = require("./entity-foreign-key-helper");
+const sync_engine_1 = require("./sync-engine");
+/**
+ * Performs comprehensive deletion auditing across all metadata files
+ * Identifies all records that need to be deleted, in what order, and potential issues
+ */
+class DeletionAuditor {
+    metadata;
+    contextUser;
+    constructor(metadata, contextUser) {
+        this.metadata = metadata;
+        this.contextUser = contextUser;
+    }
+    /**
+     * Perform comprehensive deletion audit across all metadata files
+     *
+     * This analyzes:
+     * 1. Which records are explicitly marked for deletion
+     * 2. Which records must be implicitly deleted (due to FK constraints)
+     * 3. Database-only references that will prevent deletion
+     * 4. Correct deletion order (reverse topological sort)
+     * 5. Circular dependencies
+     *
+     * @param allRecords All flattened records from all metadata files
+     * @returns Complete deletion audit
+     */
+    async auditDeletions(allRecords) {
+        // Step 1: Identify records explicitly marked for deletion
+        const explicitDeletes = this.findExplicitDeletes(allRecords);
+        // Step 2: Build reverse dependency map for all records
+        const analyzer = new record_dependency_analyzer_1.RecordDependencyAnalyzer();
+        const reverseDependencies = analyzer.buildReverseDependencyMap(allRecords);
+        // Step 3: Find implicit deletes (records that depend on explicit deletes)
+        const implicitDeletes = this.findImplicitDeletes(explicitDeletes, reverseDependencies, allRecords);
+        // Step 4: Check which records actually exist in the database
+        const allDeletes = new Map([...explicitDeletes, ...implicitDeletes]);
+        const { existingRecords, alreadyDeleted } = await this.checkRecordExistence(Array.from(allDeletes.values()));
+        // Step 5: Scan database for existing references (only for records that still exist)
+        const reverseFKMap = entity_foreign_key_helper_1.EntityForeignKeyHelper.buildReverseFKMap(this.metadata);
+        const scanner = new database_reference_scanner_1.DatabaseReferenceScanner(this.metadata, this.contextUser);
+        const databaseReferences = await scanner.scanForReferences(existingRecords, reverseFKMap, allRecords // Pass all metadata records for correct exists-in-metadata check
+        );
+        // Step 6: Identify orphaned references (DB records not in metadata)
+        const orphanedReferences = this.findOrphanedReferences(databaseReferences, allRecords);
+        // Step 7: Calculate deletion order (reverse topological sort) - only for existing records
+        const deletionLevels = analyzer.reverseTopologicalSort(existingRecords, reverseDependencies);
+        // Step 8: Check for circular dependencies among records to delete
+        const circularDependencies = this.findCircularDependencies(existingRecords);
+        return {
+            explicitDeletes,
+            implicitDeletes,
+            alreadyDeleted,
+            databaseOnlyReferences: databaseReferences,
+            reverseDependencies,
+            deletionLevels,
+            circularDependencies,
+            orphanedReferences
+        };
+    }
+    /**
+     * Find all records marked with delete: true
+     */
+    findExplicitDeletes(records) {
+        const deletes = new Map();
+        for (const record of records) {
+            if (record.record.deleteRecord?.delete === true) {
+                deletes.set(record.id, record);
+            }
+        }
+        return deletes;
+    }
+    /**
+     * Find all records that depend on records being deleted (implicit deletes)
+     * Uses BFS to find transitive dependents
+     */
+    findImplicitDeletes(explicitDeletes, reverseDependencies, allRecords) {
+        const implicitDeletes = new Map();
+        const visited = new Set();
+        // BFS to find all transitive dependents
+        const queue = Array.from(explicitDeletes.keys());
+        while (queue.length > 0) {
+            const recordId = queue.shift();
+            if (visited.has(recordId))
+                continue;
+            visited.add(recordId);
+            const dependents = reverseDependencies.get(recordId) || [];
+            for (const dep of dependents) {
+                // Add dependent to implicit deletes if not already explicit
+                if (!explicitDeletes.has(dep.dependentId) &&
+                    !implicitDeletes.has(dep.dependentId)) {
+                    const record = allRecords.find(r => r.id === dep.dependentId);
+                    if (record) {
+                        implicitDeletes.set(dep.dependentId, record);
+                        queue.push(dep.dependentId);
+                    }
+                }
+            }
+        }
+        return implicitDeletes;
+    }
+    /**
+     * Check which records actually exist in the database
+     * Returns records separated into existing (need deletion) and already deleted
+     */
+    async checkRecordExistence(records) {
+        const existingRecords = [];
+        const alreadyDeleted = new Map();
+        // Import SyncEngine to check record existence
+        const syncEngine = new sync_engine_1.SyncEngine(this.contextUser);
+        for (const record of records) {
+            try {
+                // Check if record exists in database
+                const existingEntity = await syncEngine.loadEntity(record.entityName, record.record.primaryKey || {});
+                if (existingEntity) {
+                    existingRecords.push(record);
+                }
+                else {
+                    alreadyDeleted.set(record.id, record);
+                }
+            }
+            catch (error) {
+                // If we can't check, assume it exists to be safe
+                existingRecords.push(record);
+            }
+        }
+        return { existingRecords, alreadyDeleted };
+    }
+    /**
+     * Find orphaned references (database records not in metadata files)
+     * These will prevent deletion unless handled
+     */
+    findOrphanedReferences(databaseReferences, allRecords) {
+        const orphaned = [];
+        for (const ref of databaseReferences) {
+            if (!ref.existsInMetadata) {
+                orphaned.push({
+                    recordId: ref.referencedKey.ToConcatenatedString(),
+                    dependentId: ref.primaryKey.ToConcatenatedString(),
+                    entityName: ref.entityName,
+                    fieldName: ref.referencingField,
+                    filePath: '<DATABASE ONLY>'
+                });
+            }
+        }
+        return orphaned;
+    }
+    /**
+     * Check for circular dependencies among records to delete
+     * This would prevent safe deletion order
+     */
+    findCircularDependencies(records) {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const detectCycle = (record, path) => {
+            visited.add(record.id);
+            recursionStack.add(record.id);
+            path.push(`${record.entityName}:${this.getRecordDisplayName(record)}`);
+            for (const depId of record.dependencies) {
+                // Only check dependencies among records being deleted
+                const depRecord = records.find(r => r.id === depId);
+                if (!depRecord)
+                    continue;
+                if (!visited.has(depId)) {
+                    if (detectCycle(depRecord, [...path])) {
+                        return true;
+                    }
+                }
+                else if (recursionStack.has(depId)) {
+                    // Found a cycle
+                    const cycleStart = path.findIndex(p => p.startsWith(depRecord.entityName));
+                    const cycle = path.slice(cycleStart);
+                    cycle.push(`${depRecord.entityName}:${this.getRecordDisplayName(depRecord)}`);
+                    cycles.push(cycle);
+                    return true;
+                }
+            }
+            recursionStack.delete(record.id);
+            return false;
+        };
+        // Check all records for cycles
+        for (const record of records) {
+            if (!visited.has(record.id)) {
+                detectCycle(record, []);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Get a display name for a record (for error messages)
+     */
+    getRecordDisplayName(record) {
+        return record.record.fields?.Name ||
+            record.record.primaryKey?.ID ||
+            record.record.fields?.ID ||
+            record.id;
+    }
+    /**
+     * Check if deletion audit has blocking issues
+     */
+    isValid(audit) {
+        return audit.orphanedReferences.length === 0 &&
+            audit.circularDependencies.length === 0;
+    }
+    /**
+     * Check if deletion audit requires user confirmation
+     * (due to implicit deletes)
+     */
+    requiresConfirmation(audit) {
+        return audit.implicitDeletes.size > 0;
+    }
+}
+exports.DeletionAuditor = DeletionAuditor;
+//# sourceMappingURL=deletion-auditor.js.map

package/dist/lib/deletion-auditor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deletion-auditor.js","sourceRoot":"","sources":["../../src/lib/deletion-auditor.ts"],"names":[],"mappings":";;;AACA,6EAIsC;AACtC,6EAA2F;AAC3F,2EAAqE;AACrE,+CAA2C;AA4B3C;;;GAGG;AACH,MAAa,eAAe;IAEZ;IACA;IAFZ,YACY,QAAkB,EAClB,WAAqB;QADrB,aAAQ,GAAR,QAAQ,CAAU;QAClB,gBAAW,GAAX,WAAW,CAAU;IAC9B,CAAC;IAEJ;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,cAAc,CAAC,UAA6B;QAC9C,0DAA0D;QAC1D,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAE7D,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,qDAAwB,EAAE,CAAC;QAChD,MAAM,mBAAmB,GAAG,QAAQ,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAC;QAE3E,0EAA0E;QAC1E,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAC5C,eAAe,EACf,mBAAmB,EACnB,UAAU,CACb,CAAC;QAEF,6DAA6D;QAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,eAAe,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC;QACrE,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,GAAG,MAAM,IAAI,CAAC,oBAAoB,CACvE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAClC,CAAC;QAEF,oFAAoF;QACpF,MAAM,YAAY,GAAG,kDAAsB,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7E,MAAM,OAAO,GAAG,IAAI,qDAAwB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAE9E,MAAM,kBAAkB,GAAG,MAAM,OAAO,CAAC,iBAAiB,CACtD,eAAe,EACf,YAAY,EACZ,UAAU,CAAE,iEAAiE;SAChF,CAAC;QAEF,oEAAoE;QACpE,MAAM,kBAAkB,GAAG,IAAI,CAAC,sBAAsB,CAClD,kBAAkB,EAClB,UAAU,CACb,CAAC;QAEF,0FAA0F;QAC1F,MAAM,cAAc,GAAG,QAAQ,CAAC,sBAAsB,CAClD,eAAe,EACf,mBAAmB,CACtB,CAAC;QAEF,kEAAkE;QAClE,MAAM,oBAAoB,GAAG,IAAI,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC;QAE5E,OAAO;YACH,eAAe;YACf,eAAe;YACf,cAAc;YACd,sBAAsB,EAAE,kBAAkB;YAC1C,mBAAmB;YACnB,cAAc;YACd,oBAAoB;YACpB,kBAAkB;SACrB,CAAC;IACN,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,OAA0B;QAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;QAEnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,KAAK,IAAI,EAAE,CAAC;gBAC9C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACnC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;OAGG;IACK,mBAAmB,CACvB,eAA6C,EAC7C,mBAAqD,EACrD,UAA6B;QAE7B,MAAM,eAAe,GAAG,IAAI,GAAG,EAA2B,CAAC;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,wCAAwC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC;QAEjD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEtB,MAAM,UAAU,GAAG,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAE3D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC3B,4DAA4D;gBAC5D,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC;oBACrC,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBAExC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC9D,IAAI,MAAM,EAAE,CAAC;wBACT,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;wBAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAChC,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,eAAe,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,oBAAoB,CAC9B,OAA0B;QAE1B,MAAM,eAAe,GAAsB,EAAE,CAAC;QAC9C,MAAM,cAAc,GAAG,IAAI,GAAG,EAA2B,CAAC;QAE1D,8CAA8C;QAC9C,MAAM,UAAU,GAAG,IAAI,wBAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC;gBACD,qCAAqC;gBACrC,MAAM,cAAc,GAAG,MAAM,UAAU,CAAC,UAAU,CAC9C,MAAM,CAAC,UAAU,EACjB,MAAM,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CACjC,CAAC;gBAEF,IAAI,cAAc,EAAE,CAAC;oBACjB,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACJ,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC1C,CAAC;YACL,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACb,iDAAiD;gBACjD,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAC1B,kBAAuC,EACvC,UAA6B;QAE7B,MAAM,QAAQ,GAAwB,EAAE,CAAC;QAEzC,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;YACnC,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC;oBACV,QAAQ,EAAE,GAAG,CAAC,aAAa,CAAC,oBAAoB,EAAE;oBAClD,WAAW,EAAE,GAAG,CAAC,UAAU,CAAC,oBAAoB,EAAE;oBAClD,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS,EAAE,GAAG,CAAC,gBAAgB;oBAC/B,QAAQ,EAAE,iBAAiB;iBAC9B,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;OAGG;IACK,wBAAwB,CAAC,OAA0B;QACvD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,MAAM,WAAW,GAAG,CAAC,MAAuB,EAAE,IAAc,EAAW,EAAE;YACrE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAEvE,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACtC,sDAAsD;gBACtD,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;gBACpD,IAAI,CAAC,SAAS;oBAAE,SAAS;gBAEzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACtB,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;wBACpC,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACL,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACnC,gBAAgB;oBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;oBAC3E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACrC,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,UAAU,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC9E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACnB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC;QACjB,CAAC,CAAC;QAEF,+BAA+B;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,MAAuB;QAChD,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI;YAC1B,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE;YACxB,MAAM,CAAC,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAoB;QACxB,OAAO,KAAK,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC;YACrC,KAAK,CAAC,oBAAoB,CAAC,MAAM,KAAK,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,KAAoB;QACrC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC;IAC1C,CAAC;CACJ;AAvQD,0CAuQC","sourcesContent":["import { Metadata, UserInfo } from '@memberjunction/core';\nimport {\n    FlattenedRecord,\n    ReverseDependency,\n    RecordDependencyAnalyzer\n} from './record-dependency-analyzer';\nimport { DatabaseReference, DatabaseReferenceScanner } from './database-reference-scanner';\nimport { EntityForeignKeyHelper } from './entity-foreign-key-helper';\nimport { SyncEngine } from './sync-engine';\n/**\n * Complete audit result for deletion operations\n */\nexport interface DeletionAudit {\n    // Records explicitly marked for deletion (delete: true in metadata)\n    explicitDeletes: Map<string, FlattenedRecord>;\n\n    // Records that must be deleted due to FK dependencies\n    implicitDeletes: Map<string, FlattenedRecord>;\n\n    // Records marked for deletion that already don't exist in the database\n    alreadyDeleted: Map<string, FlattenedRecord>;\n\n    // Database records that reference records being deleted (not in metadata)\n    databaseOnlyReferences: DatabaseReference[];\n\n    // Reverse dependency map: recordId -> records that depend on it\n    reverseDependencies: Map<string, ReverseDependency[]>;\n\n    // Deletion order (reverse topological sort) - highest dependency level first\n    deletionLevels: FlattenedRecord[][];\n\n    // Errors/warnings\n    circularDependencies: string[][];\n    orphanedReferences: ReverseDependency[];\n}\n\n/**\n * Performs comprehensive deletion auditing across all metadata files\n * Identifies all records that need to be deleted, in what order, and potential issues\n */\nexport class DeletionAuditor {\n    constructor(\n        private metadata: Metadata,\n        private contextUser: UserInfo\n    ) {}\n\n    /**\n     * Perform comprehensive deletion audit across all metadata files\n     *\n     * This analyzes:\n     * 1. Which records are explicitly marked for deletion\n     * 2. Which records must be implicitly deleted (due to FK constraints)\n     * 3. Database-only references that will prevent deletion\n     * 4. Correct deletion order (reverse topological sort)\n     * 5. Circular dependencies\n     *\n     * @param allRecords All flattened records from all metadata files\n     * @returns Complete deletion audit\n     */\n    async auditDeletions(allRecords: FlattenedRecord[]): Promise<DeletionAudit> {\n        // Step 1: Identify records explicitly marked for deletion\n        const explicitDeletes = this.findExplicitDeletes(allRecords);\n\n        // Step 2: Build reverse dependency map for all records\n        const analyzer = new RecordDependencyAnalyzer();\n        const reverseDependencies = analyzer.buildReverseDependencyMap(allRecords);\n\n        // Step 3: Find implicit deletes (records that depend on explicit deletes)\n        const implicitDeletes = this.findImplicitDeletes(\n            explicitDeletes,\n            reverseDependencies,\n            allRecords\n        );\n\n        // Step 4: Check which records actually exist in the database\n        const allDeletes = new Map([...explicitDeletes, ...implicitDeletes]);\n        const { existingRecords, alreadyDeleted } = await this.checkRecordExistence(\n            Array.from(allDeletes.values())\n        );\n\n        // Step 5: Scan database for existing references (only for records that still exist)\n        const reverseFKMap = EntityForeignKeyHelper.buildReverseFKMap(this.metadata);\n        const scanner = new DatabaseReferenceScanner(this.metadata, this.contextUser);\n\n        const databaseReferences = await scanner.scanForReferences(\n            existingRecords,\n            reverseFKMap,\n            allRecords  // Pass all metadata records for correct exists-in-metadata check\n        );\n\n        // Step 6: Identify orphaned references (DB records not in metadata)\n        const orphanedReferences = this.findOrphanedReferences(\n            databaseReferences,\n            allRecords\n        );\n\n        // Step 7: Calculate deletion order (reverse topological sort) - only for existing records\n        const deletionLevels = analyzer.reverseTopologicalSort(\n            existingRecords,\n            reverseDependencies\n        );\n\n        // Step 8: Check for circular dependencies among records to delete\n        const circularDependencies = this.findCircularDependencies(existingRecords);\n\n        return {\n            explicitDeletes,\n            implicitDeletes,\n            alreadyDeleted,\n            databaseOnlyReferences: databaseReferences,\n            reverseDependencies,\n            deletionLevels,\n            circularDependencies,\n            orphanedReferences\n        };\n    }\n\n    /**\n     * Find all records marked with delete: true\n     */\n    private findExplicitDeletes(records: FlattenedRecord[]): Map<string, FlattenedRecord> {\n        const deletes = new Map<string, FlattenedRecord>();\n\n        for (const record of records) {\n            if (record.record.deleteRecord?.delete === true) {\n                deletes.set(record.id, record);\n            }\n        }\n\n        return deletes;\n    }\n\n    /**\n     * Find all records that depend on records being deleted (implicit deletes)\n     * Uses BFS to find transitive dependents\n     */\n    private findImplicitDeletes(\n        explicitDeletes: Map<string, FlattenedRecord>,\n        reverseDependencies: Map<string, ReverseDependency[]>,\n        allRecords: FlattenedRecord[]\n    ): Map<string, FlattenedRecord> {\n        const implicitDeletes = new Map<string, FlattenedRecord>();\n        const visited = new Set<string>();\n\n        // BFS to find all transitive dependents\n        const queue = Array.from(explicitDeletes.keys());\n\n        while (queue.length > 0) {\n            const recordId = queue.shift()!;\n            if (visited.has(recordId)) continue;\n            visited.add(recordId);\n\n            const dependents = reverseDependencies.get(recordId) || [];\n\n            for (const dep of dependents) {\n                // Add dependent to implicit deletes if not already explicit\n                if (!explicitDeletes.has(dep.dependentId) &&\n                    !implicitDeletes.has(dep.dependentId)) {\n\n                    const record = allRecords.find(r => r.id === dep.dependentId);\n                    if (record) {\n                        implicitDeletes.set(dep.dependentId, record);\n                        queue.push(dep.dependentId);\n                    }\n                }\n            }\n        }\n\n        return implicitDeletes;\n    }\n\n    /**\n     * Check which records actually exist in the database\n     * Returns records separated into existing (need deletion) and already deleted\n     */\n    private async checkRecordExistence(\n        records: FlattenedRecord[]\n    ): Promise<{ existingRecords: FlattenedRecord[]; alreadyDeleted: Map<string, FlattenedRecord> }> {\n        const existingRecords: FlattenedRecord[] = [];\n        const alreadyDeleted = new Map<string, FlattenedRecord>();\n\n        // Import SyncEngine to check record existence\n        const syncEngine = new SyncEngine(this.contextUser);\n\n        for (const record of records) {\n            try {\n                // Check if record exists in database\n                const existingEntity = await syncEngine.loadEntity(\n                    record.entityName,\n                    record.record.primaryKey || {}\n                );\n\n                if (existingEntity) {\n                    existingRecords.push(record);\n                } else {\n                    alreadyDeleted.set(record.id, record);\n                }\n            } catch (error) {\n                // If we can't check, assume it exists to be safe\n                existingRecords.push(record);\n            }\n        }\n\n        return { existingRecords, alreadyDeleted };\n    }\n\n    /**\n     * Find orphaned references (database records not in metadata files)\n     * These will prevent deletion unless handled\n     */\n    private findOrphanedReferences(\n        databaseReferences: DatabaseReference[],\n        allRecords: FlattenedRecord[]\n    ): ReverseDependency[] {\n        const orphaned: ReverseDependency[] = [];\n\n        for (const ref of databaseReferences) {\n            if (!ref.existsInMetadata) {\n                orphaned.push({\n                    recordId: ref.referencedKey.ToConcatenatedString(),\n                    dependentId: ref.primaryKey.ToConcatenatedString(),\n                    entityName: ref.entityName,\n                    fieldName: ref.referencingField,\n                    filePath: '<DATABASE ONLY>'\n                });\n            }\n        }\n\n        return orphaned;\n    }\n\n    /**\n     * Check for circular dependencies among records to delete\n     * This would prevent safe deletion order\n     */\n    private findCircularDependencies(records: FlattenedRecord[]): string[][] {\n        const cycles: string[][] = [];\n        const visited = new Set<string>();\n        const recursionStack = new Set<string>();\n\n        const detectCycle = (record: FlattenedRecord, path: string[]): boolean => {\n            visited.add(record.id);\n            recursionStack.add(record.id);\n            path.push(`${record.entityName}:${this.getRecordDisplayName(record)}`);\n\n            for (const depId of record.dependencies) {\n                // Only check dependencies among records being deleted\n                const depRecord = records.find(r => r.id === depId);\n                if (!depRecord) continue;\n\n                if (!visited.has(depId)) {\n                    if (detectCycle(depRecord, [...path])) {\n                        return true;\n                    }\n                } else if (recursionStack.has(depId)) {\n                    // Found a cycle\n                    const cycleStart = path.findIndex(p => p.startsWith(depRecord.entityName));\n                    const cycle = path.slice(cycleStart);\n                    cycle.push(`${depRecord.entityName}:${this.getRecordDisplayName(depRecord)}`);\n                    cycles.push(cycle);\n                    return true;\n                }\n            }\n\n            recursionStack.delete(record.id);\n            return false;\n        };\n\n        // Check all records for cycles\n        for (const record of records) {\n            if (!visited.has(record.id)) {\n                detectCycle(record, []);\n            }\n        }\n\n        return cycles;\n    }\n\n    /**\n     * Get a display name for a record (for error messages)\n     */\n    private getRecordDisplayName(record: FlattenedRecord): string {\n        return record.record.fields?.Name ||\n               record.record.primaryKey?.ID ||\n               record.record.fields?.ID ||\n               record.id;\n    }\n\n    /**\n     * Check if deletion audit has blocking issues\n     */\n    isValid(audit: DeletionAudit): boolean {\n        return audit.orphanedReferences.length === 0 &&\n               audit.circularDependencies.length === 0;\n    }\n\n    /**\n     * Check if deletion audit requires user confirmation\n     * (due to implicit deletes)\n     */\n    requiresConfirmation(audit: DeletionAudit): boolean {\n        return audit.implicitDeletes.size > 0;\n    }\n}\n"]}

package/dist/lib/deletion-report-generator.d.ts

@@ -0,0 +1,58 @@
+import { DeletionAudit } from './deletion-auditor';
+/**
+ * Generates human-readable reports for deletion audits
+ */
+export declare class DeletionReportGenerator {
+    /**
+     * Generate comprehensive deletion plan report
+     */
+    static generateReport(audit: DeletionAudit, verbose?: boolean): string;
+    /**
+     * Generate summary section
+     */
+    private static addSummary;
+    /**
+     * Add explicit deletes section
+     */
+    private static addExplicitDeletes;
+    /**
+     * Add implicit deletes section
+     */
+    private static addImplicitDeletes;
+    /**
+     * Add already deleted records section
+     */
+    private static addAlreadyDeleted;
+    /**
+     * Add orphaned references section
+     */
+    private static addOrphanedReferences;
+    /**
+     * Add deletion order section
+     */
+    private static addDeletionOrder;
+    /**
+     * Add circular dependencies section
+     */
+    private static addCircularDependencies;
+    /**
+     * Add conclusion section
+     */
+    private static addConclusion;
+    /**
+     * Format a record ID for display
+     */
+    private static formatRecordId;
+    /**
+     * Group records by entity name
+     */
+    private static groupByEntity;
+    /**
+     * Find what an implicit delete depends on (for display)
+     */
+    private static findDependencies;
+    /**
+     * Generate a concise summary for logging
+     */
+    static generateSummary(audit: DeletionAudit): string;
+}

package/dist/lib/deletion-report-generator.js

@@ -0,0 +1,287 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DeletionReportGenerator = void 0;
+/**
+ * Generates human-readable reports for deletion audits
+ */
+class DeletionReportGenerator {
+    /**
+     * Generate comprehensive deletion plan report
+     */
+    static generateReport(audit, verbose = false) {
+        const lines = [];
+        lines.push('═'.repeat(80));
+        lines.push('DELETION AUDIT REPORT');
+        lines.push('═'.repeat(80));
+        lines.push('');
+        // Summary
+        this.addSummary(lines, audit);
+        // Explicit deletes (verbose only)
+        if (verbose && audit.explicitDeletes.size > 0) {
+            this.addExplicitDeletes(lines, audit);
+        }
+        // Implicit deletes
+        if (audit.implicitDeletes.size > 0) {
+            this.addImplicitDeletes(lines, audit);
+        }
+        // Already deleted records
+        if (audit.alreadyDeleted.size > 0) {
+            this.addAlreadyDeleted(lines, audit);
+        }
+        // Database-only references
+        if (audit.orphanedReferences.length > 0) {
+            this.addOrphanedReferences(lines, audit);
+        }
+        // Deletion order (verbose only)
+        if (verbose && audit.deletionLevels.length > 0) {
+            this.addDeletionOrder(lines, audit);
+        }
+        // Circular dependencies
+        if (audit.circularDependencies.length > 0) {
+            this.addCircularDependencies(lines, audit);
+        }
+        // Conclusion
+        this.addConclusion(lines, audit);
+        return lines.join('\n');
+    }
+    /**
+     * Generate summary section
+     */
+    static addSummary(lines, audit) {
+        const totalMarkedForDeletion = audit.explicitDeletes.size + audit.implicitDeletes.size;
+        const needDeletion = totalMarkedForDeletion - audit.alreadyDeleted.size;
+        lines.push('SUMMARY:');
+        lines.push(`  Records Marked for Deletion: ${totalMarkedForDeletion}`);
+        lines.push(`    • Will be deleted: ${needDeletion}`);
+        lines.push(`    • Already deleted: ${audit.alreadyDeleted.size}`);
+        lines.push(`  Explicit Deletes (marked in metadata): ${audit.explicitDeletes.size}`);
+        lines.push(`  Implicit Deletes (required by FK): ${audit.implicitDeletes.size}`);
+        lines.push(`  Database-Only References: ${audit.orphanedReferences.length}`);
+        lines.push(`  Deletion Levels: ${audit.deletionLevels.length}`);
+        lines.push('');
+    }
+    /**
+     * Add explicit deletes section
+     */
+    static addExplicitDeletes(lines, audit) {
+        lines.push('EXPLICIT DELETES (marked with delete: true):');
+        // Group by entity
+        const byEntity = this.groupByEntity(Array.from(audit.explicitDeletes.values()));
+        for (const [entityName, records] of byEntity) {
+            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);
+            for (const record of records) {
+                lines.push(`    ✓ ${this.formatRecordId(record)}`);
+                lines.push(`      File: ${record.path}`);
+            }
+        }
+        lines.push('');
+    }
+    /**
+     * Add implicit deletes section
+     */
+    static addImplicitDeletes(lines, audit) {
+        lines.push('⚠️  IMPLICIT DELETES (required to satisfy FK constraints):');
+        lines.push('   These records will be deleted because they depend on explicitly deleted records.');
+        lines.push('');
+        // Group by entity
+        const byEntity = this.groupByEntity(Array.from(audit.implicitDeletes.values()));
+        for (const [entityName, records] of byEntity) {
+            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);
+            for (const record of records) {
+                lines.push(`    → ${this.formatRecordId(record)}`);
+                lines.push(`      File: ${record.path}`);
+                // Show what it depends on
+                const deps = this.findDependencies(record, audit);
+                if (deps.length > 0) {
+                    lines.push(`      Depends on: ${deps.join(', ')}`);
+                }
+            }
+        }
+        lines.push('');
+    }
+    /**
+     * Add already deleted records section
+     */
+    static addAlreadyDeleted(lines, audit) {
+        lines.push('ℹ️  ALREADY DELETED (exist in metadata but not in database):');
+        lines.push('   These records are marked for deletion but already don\'t exist in the database.');
+        lines.push('   No action will be taken for these records.');
+        lines.push('');
+        // Group by entity
+        const byEntity = this.groupByEntity(Array.from(audit.alreadyDeleted.values()));
+        for (const [entityName, records] of byEntity) {
+            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);
+            for (const record of records) {
+                lines.push(`    ✓ ${this.formatRecordId(record)}`);
+            }
+        }
+        lines.push('');
+    }
+    /**
+     * Add orphaned references section
+     */
+    static addOrphanedReferences(lines, audit) {
+        lines.push('⚠️  DATABASE-ONLY REFERENCES (not in metadata files):');
+        lines.push('   These records exist in the database but not in metadata.');
+        lines.push('   May be handled by database cascade delete rules.');
+        lines.push('   If not, deletion will fail with FK constraint errors.');
+        lines.push('');
+        // Group by entity
+        const byEntity = new Map();
+        for (const ref of audit.orphanedReferences) {
+            if (!byEntity.has(ref.entityName)) {
+                byEntity.set(ref.entityName, []);
+            }
+            byEntity.get(ref.entityName).push(ref);
+        }
+        for (const [entityName, refs] of byEntity) {
+            lines.push(`  ${entityName} (${refs.length} record${refs.length > 1 ? 's' : ''}):`);
+            for (const ref of refs) {
+                lines.push(`    ⚠️  ID: ${ref.dependentId}`);
+                lines.push(`       References: ${ref.recordId} via ${ref.fieldName}`);
+                lines.push(`       Note: May be handled by cascade delete OR require manual handling`);
+            }
+        }
+        lines.push('');
+    }
+    /**
+     * Add deletion order section
+     */
+    static addDeletionOrder(lines, audit) {
+        lines.push('DELETION ORDER (reverse topological sort):');
+        lines.push('Records will be deleted in this order (highest dependency level first):');
+        lines.push('');
+        for (let i = 0; i < audit.deletionLevels.length; i++) {
+            const level = audit.deletionLevels[i];
+            const levelNumber = audit.deletionLevels.length - i; // Reverse numbering for clarity
+            lines.push(`  Level ${levelNumber} (${level.length} record${level.length > 1 ? 's' : ''}):`);
+            // Group by entity within level
+            const byEntity = this.groupByEntity(level);
+            for (const [entityName, records] of byEntity) {
+                if (records.length === 1) {
+                    lines.push(`    - ${entityName}: ${this.formatRecordId(records[0])}`);
+                }
+                else {
+                    lines.push(`    - ${entityName} (${records.length} records):`);
+                    for (const record of records) {
+                        lines.push(`        ${this.formatRecordId(record)}`);
+                    }
+                }
+            }
+        }
+        lines.push('');
+    }
+    /**
+     * Add circular dependencies section
+     */
+    static addCircularDependencies(lines, audit) {
+        lines.push('❌ CIRCULAR DEPENDENCIES DETECTED:');
+        lines.push('   The following circular dependencies prevent safe deletion:');
+        lines.push('');
+        for (let i = 0; i < audit.circularDependencies.length; i++) {
+            const cycle = audit.circularDependencies[i];
+            lines.push(`  Cycle ${i + 1}:`);
+            lines.push(`    ${cycle.join(' → ')}`);
+        }
+        lines.push('');
+        lines.push('  To resolve:');
+        lines.push('  1. Review the relationships creating the cycle');
+        lines.push('  2. Break the cycle by removing one of the dependencies');
+        lines.push('  3. Consider using NULL values or restructuring relationships');
+        lines.push('');
+    }
+    /**
+     * Add conclusion section
+     */
+    static addConclusion(lines, audit) {
+        lines.push('═'.repeat(80));
+        if (audit.circularDependencies.length > 0) {
+            lines.push('STATUS: ❌ CANNOT PROCEED');
+            lines.push('');
+            lines.push('Circular dependencies detected. Please resolve the cycles above.');
+        }
+        else if (audit.implicitDeletes.size > 0 || audit.orphanedReferences.length > 0) {
+            lines.push('STATUS: ⚠️  REVIEW REQUIRED');
+            lines.push('');
+            if (audit.implicitDeletes.size > 0) {
+                lines.push(`${audit.implicitDeletes.size} implicit deletion${audit.implicitDeletes.size > 1 ? 's' : ''} will occur.`);
+                lines.push('Review the implicit deletes above and confirm this is intended.');
+            }
+            if (audit.orphanedReferences.length > 0) {
+                if (audit.implicitDeletes.size > 0) {
+                    lines.push('');
+                }
+                lines.push(`${audit.orphanedReferences.length} database-only reference${audit.orphanedReferences.length > 1 ? 's' : ''} detected.`);
+                lines.push('These may be handled by cascade delete rules or may cause FK errors.');
+            }
+        }
+        else {
+            lines.push('STATUS: ✓ SAFE TO PROCEED');
+            lines.push('');
+            lines.push('All deletions are explicitly marked and have no dependencies.');
+        }
+        lines.push('═'.repeat(80));
+    }
+    /**
+     * Format a record ID for display
+     */
+    static formatRecordId(record) {
+        return record.record.fields?.Name ||
+            record.record.primaryKey?.ID ||
+            record.record.fields?.ID ||
+            record.id;
+    }
+    /**
+     * Group records by entity name
+     */
+    static groupByEntity(records) {
+        const byEntity = new Map();
+        for (const record of records) {
+            if (!byEntity.has(record.entityName)) {
+                byEntity.set(record.entityName, []);
+            }
+            byEntity.get(record.entityName).push(record);
+        }
+        return byEntity;
+    }
+    /**
+     * Find what an implicit delete depends on (for display)
+     */
+    static findDependencies(record, audit) {
+        const deps = [];
+        for (const depId of record.dependencies) {
+            const explicitRecord = audit.explicitDeletes.get(depId);
+            if (explicitRecord) {
+                deps.push(`${explicitRecord.entityName}:${this.formatRecordId(explicitRecord)}`);
+            }
+            else {
+                const implicitRecord = audit.implicitDeletes.get(depId);
+                if (implicitRecord) {
+                    deps.push(`${implicitRecord.entityName}:${this.formatRecordId(implicitRecord)}`);
+                }
+            }
+        }
+        return deps;
+    }
+    /**
+     * Generate a concise summary for logging
+     */
+    static generateSummary(audit) {
+        const parts = [];
+        if (audit.explicitDeletes.size > 0) {
+            parts.push(`${audit.explicitDeletes.size} explicit`);
+        }
+        if (audit.implicitDeletes.size > 0) {
+            parts.push(`${audit.implicitDeletes.size} implicit`);
+        }
+        if (audit.orphanedReferences.length > 0) {
+            parts.push(`${audit.orphanedReferences.length} orphaned refs`);
+        }
+        if (audit.circularDependencies.length > 0) {
+            parts.push(`${audit.circularDependencies.length} cycles`);
+        }
+        return parts.length > 0 ? parts.join(', ') : 'no deletions';
+    }
+}
+exports.DeletionReportGenerator = DeletionReportGenerator;
+//# sourceMappingURL=deletion-report-generator.js.map

package/dist/lib/deletion-report-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deletion-report-generator.js","sourceRoot":"","sources":["../../src/lib/deletion-report-generator.ts"],"names":[],"mappings":";;;AAGA;;GAEG;AACH,MAAa,uBAAuB;IAChC;;OAEG;IACH,MAAM,CAAC,cAAc,CAAC,KAAoB,EAAE,OAAO,GAAG,KAAK;QACvD,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,UAAU;QACV,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE9B,kCAAkC;QAClC,IAAI,OAAO,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,mBAAmB;QACnB,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,0BAA0B;QAC1B,IAAI,KAAK,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;QAED,2BAA2B;QAC3B,IAAI,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,gCAAgC;QAChC,IAAI,OAAO,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7C,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QAED,wBAAwB;QACxB,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/C,CAAC;QAED,aAAa;QACb,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEjC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,UAAU,CAAC,KAAe,EAAE,KAAoB;QAC3D,MAAM,sBAAsB,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC;QACvF,MAAM,YAAY,GAAG,sBAAsB,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC;QAExE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,kCAAkC,sBAAsB,EAAE,CAAC,CAAC;QACvE,KAAK,CAAC,IAAI,CAAC,0BAA0B,YAAY,EAAE,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,0BAA0B,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC;QAClE,KAAK,CAAC,IAAI,CAAC,4CAA4C,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC;QACrF,KAAK,CAAC,IAAI,CAAC,wCAAwC,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC;QACjF,KAAK,CAAC,IAAI,CAAC,+BAA+B,KAAK,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7E,KAAK,CAAC,IAAI,CAAC,sBAAsB,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,kBAAkB,CAAC,KAAe,EAAE,KAAoB;QACnE,KAAK,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAE3D,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEhF,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,KAAK,OAAO,CAAC,MAAM,UAAU,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,eAAe,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,kBAAkB,CAAC,KAAe,EAAE,KAAoB;QACnE,KAAK,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;QACzE,KAAK,CAAC,IAAI,CAAC,qFAAqF,CAAC,CAAC;QAClG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEhF,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,KAAK,OAAO,CAAC,MAAM,UAAU,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,eAAe,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;gBAEzC,0BAA0B;gBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAClD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAClB,KAAK,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvD,CAAC;YACL,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,iBAAiB,CAAC,KAAe,EAAE,KAAoB;QAClE,KAAK,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;QAC3E,KAAK,CAAC,IAAI,CAAC,oFAAoF,CAAC,CAAC;QACjG,KAAK,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAE/E,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,KAAK,OAAO,CAAC,MAAM,UAAU,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvD,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAe,EAAE,KAAoB;QACtE,KAAK,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;QACpE,KAAK,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;QAC1E,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QAClE,KAAK,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;QACvE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2C,CAAC;QACpE,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,KAAK,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACpF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC7C,KAAK,CAAC,IAAI,CAAC,sBAAsB,GAAG,CAAC,QAAQ,QAAQ,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;gBACtE,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;YAC3F,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,gBAAgB,CAAC,KAAe,EAAE,KAAoB;QACjE,KAAK,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;QACtF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,WAAW,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gCAAgC;YAErF,KAAK,CAAC,IAAI,CAAC,WAAW,WAAW,KAAK,KAAK,CAAC,MAAM,UAAU,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAE7F,+BAA+B;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC3C,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,SAAS,UAAU,KAAK,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC1E,CAAC;qBAAM,CAAC;oBACJ,KAAK,CAAC,IAAI,CAAC,SAAS,UAAU,KAAK,OAAO,CAAC,MAAM,YAAY,CAAC,CAAC;oBAC/D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC3B,KAAK,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBACzD,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,uBAAuB,CAAC,KAAe,EAAE,KAAoB;QACxE,KAAK,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QAC5E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,oBAAoB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;QAC/D,KAAK,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;QACvE,KAAK,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QAC7E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,aAAa,CAAC,KAAe,EAAE,KAAoB;QAC9D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3B,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,kEAAkE,CAAC,CAAC;QACnF,CAAC;aAAM,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/E,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,qBAAqB,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;gBACtH,KAAK,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtC,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBACjC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,kBAAkB,CAAC,MAAM,2BAA2B,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;gBACpI,KAAK,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;YACvF,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QAChF,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,cAAc,CAAC,MAAuB;QACjD,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI;YAC1B,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE;YACxB,MAAM,CAAC,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,aAAa,CAAC,OAA0B;QACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;QAEtD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,gBAAgB,CAC3B,MAAuB,EACvB,KAAoB;QAEpB,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACtC,MAAM,cAAc,GAAG,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,cAAc,EAAE,CAAC;gBACjB,IAAI,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,UAAU,IAAI,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YACrF,CAAC;iBAAM,CAAC;gBACJ,MAAM,cAAc,GAAG,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACxD,IAAI,cAAc,EAAE,CAAC;oBACjB,IAAI,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,UAAU,IAAI,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;gBACrF,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAe,CAAC,KAAoB;QACvC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,WAAW,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,WAAW,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,kBAAkB,CAAC,MAAM,gBAAgB,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,oBAAoB,CAAC,MAAM,SAAS,CAAC,CAAC;QAC9D,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;IAChE,CAAC;CACJ;AApUD,0DAoUC","sourcesContent":["import { DeletionAudit } from './deletion-auditor';\nimport { FlattenedRecord } from './record-dependency-analyzer';\n\n/**\n * Generates human-readable reports for deletion audits\n */\nexport class DeletionReportGenerator {\n    /**\n     * Generate comprehensive deletion plan report\n     */\n    static generateReport(audit: DeletionAudit, verbose = false): string {\n        const lines: string[] = [];\n\n        lines.push('═'.repeat(80));\n        lines.push('DELETION AUDIT REPORT');\n        lines.push('═'.repeat(80));\n        lines.push('');\n\n        // Summary\n        this.addSummary(lines, audit);\n\n        // Explicit deletes (verbose only)\n        if (verbose && audit.explicitDeletes.size > 0) {\n            this.addExplicitDeletes(lines, audit);\n        }\n\n        // Implicit deletes\n        if (audit.implicitDeletes.size > 0) {\n            this.addImplicitDeletes(lines, audit);\n        }\n\n        // Already deleted records\n        if (audit.alreadyDeleted.size > 0) {\n            this.addAlreadyDeleted(lines, audit);\n        }\n\n        // Database-only references\n        if (audit.orphanedReferences.length > 0) {\n            this.addOrphanedReferences(lines, audit);\n        }\n\n        // Deletion order (verbose only)\n        if (verbose && audit.deletionLevels.length > 0) {\n            this.addDeletionOrder(lines, audit);\n        }\n\n        // Circular dependencies\n        if (audit.circularDependencies.length > 0) {\n            this.addCircularDependencies(lines, audit);\n        }\n\n        // Conclusion\n        this.addConclusion(lines, audit);\n\n        return lines.join('\\n');\n    }\n\n    /**\n     * Generate summary section\n     */\n    private static addSummary(lines: string[], audit: DeletionAudit): void {\n        const totalMarkedForDeletion = audit.explicitDeletes.size + audit.implicitDeletes.size;\n        const needDeletion = totalMarkedForDeletion - audit.alreadyDeleted.size;\n\n        lines.push('SUMMARY:');\n        lines.push(`  Records Marked for Deletion: ${totalMarkedForDeletion}`);\n        lines.push(`    • Will be deleted: ${needDeletion}`);\n        lines.push(`    • Already deleted: ${audit.alreadyDeleted.size}`);\n        lines.push(`  Explicit Deletes (marked in metadata): ${audit.explicitDeletes.size}`);\n        lines.push(`  Implicit Deletes (required by FK): ${audit.implicitDeletes.size}`);\n        lines.push(`  Database-Only References: ${audit.orphanedReferences.length}`);\n        lines.push(`  Deletion Levels: ${audit.deletionLevels.length}`);\n        lines.push('');\n    }\n\n    /**\n     * Add explicit deletes section\n     */\n    private static addExplicitDeletes(lines: string[], audit: DeletionAudit): void {\n        lines.push('EXPLICIT DELETES (marked with delete: true):');\n\n        // Group by entity\n        const byEntity = this.groupByEntity(Array.from(audit.explicitDeletes.values()));\n\n        for (const [entityName, records] of byEntity) {\n            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);\n            for (const record of records) {\n                lines.push(`    ✓ ${this.formatRecordId(record)}`);\n                lines.push(`      File: ${record.path}`);\n            }\n        }\n        lines.push('');\n    }\n\n    /**\n     * Add implicit deletes section\n     */\n    private static addImplicitDeletes(lines: string[], audit: DeletionAudit): void {\n        lines.push('⚠️  IMPLICIT DELETES (required to satisfy FK constraints):');\n        lines.push('   These records will be deleted because they depend on explicitly deleted records.');\n        lines.push('');\n\n        // Group by entity\n        const byEntity = this.groupByEntity(Array.from(audit.implicitDeletes.values()));\n\n        for (const [entityName, records] of byEntity) {\n            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);\n            for (const record of records) {\n                lines.push(`    → ${this.formatRecordId(record)}`);\n                lines.push(`      File: ${record.path}`);\n\n                // Show what it depends on\n                const deps = this.findDependencies(record, audit);\n                if (deps.length > 0) {\n                    lines.push(`      Depends on: ${deps.join(', ')}`);\n                }\n            }\n        }\n        lines.push('');\n    }\n\n    /**\n     * Add already deleted records section\n     */\n    private static addAlreadyDeleted(lines: string[], audit: DeletionAudit): void {\n        lines.push('ℹ️  ALREADY DELETED (exist in metadata but not in database):');\n        lines.push('   These records are marked for deletion but already don\\'t exist in the database.');\n        lines.push('   No action will be taken for these records.');\n        lines.push('');\n\n        // Group by entity\n        const byEntity = this.groupByEntity(Array.from(audit.alreadyDeleted.values()));\n\n        for (const [entityName, records] of byEntity) {\n            lines.push(`  ${entityName} (${records.length} record${records.length > 1 ? 's' : ''}):`);\n            for (const record of records) {\n                lines.push(`    ✓ ${this.formatRecordId(record)}`);\n            }\n        }\n        lines.push('');\n    }\n\n    /**\n     * Add orphaned references section\n     */\n    private static addOrphanedReferences(lines: string[], audit: DeletionAudit): void {\n        lines.push('⚠️  DATABASE-ONLY REFERENCES (not in metadata files):');\n        lines.push('   These records exist in the database but not in metadata.');\n        lines.push('   May be handled by database cascade delete rules.');\n        lines.push('   If not, deletion will fail with FK constraint errors.');\n        lines.push('');\n\n        // Group by entity\n        const byEntity = new Map<string, typeof audit.orphanedReferences>();\n        for (const ref of audit.orphanedReferences) {\n            if (!byEntity.has(ref.entityName)) {\n                byEntity.set(ref.entityName, []);\n            }\n            byEntity.get(ref.entityName)!.push(ref);\n        }\n\n        for (const [entityName, refs] of byEntity) {\n            lines.push(`  ${entityName} (${refs.length} record${refs.length > 1 ? 's' : ''}):`);\n            for (const ref of refs) {\n                lines.push(`    ⚠️  ID: ${ref.dependentId}`);\n                lines.push(`       References: ${ref.recordId} via ${ref.fieldName}`);\n                lines.push(`       Note: May be handled by cascade delete OR require manual handling`);\n            }\n        }\n        lines.push('');\n    }\n\n    /**\n     * Add deletion order section\n     */\n    private static addDeletionOrder(lines: string[], audit: DeletionAudit): void {\n        lines.push('DELETION ORDER (reverse topological sort):');\n        lines.push('Records will be deleted in this order (highest dependency level first):');\n        lines.push('');\n\n        for (let i = 0; i < audit.deletionLevels.length; i++) {\n            const level = audit.deletionLevels[i];\n            const levelNumber = audit.deletionLevels.length - i; // Reverse numbering for clarity\n\n            lines.push(`  Level ${levelNumber} (${level.length} record${level.length > 1 ? 's' : ''}):`);\n\n            // Group by entity within level\n            const byEntity = this.groupByEntity(level);\n            for (const [entityName, records] of byEntity) {\n                if (records.length === 1) {\n                    lines.push(`    - ${entityName}: ${this.formatRecordId(records[0])}`);\n                } else {\n                    lines.push(`    - ${entityName} (${records.length} records):`);\n                    for (const record of records) {\n                        lines.push(`        ${this.formatRecordId(record)}`);\n                    }\n                }\n            }\n        }\n        lines.push('');\n    }\n\n    /**\n     * Add circular dependencies section\n     */\n    private static addCircularDependencies(lines: string[], audit: DeletionAudit): void {\n        lines.push('❌ CIRCULAR DEPENDENCIES DETECTED:');\n        lines.push('   The following circular dependencies prevent safe deletion:');\n        lines.push('');\n\n        for (let i = 0; i < audit.circularDependencies.length; i++) {\n            const cycle = audit.circularDependencies[i];\n            lines.push(`  Cycle ${i + 1}:`);\n            lines.push(`    ${cycle.join(' → ')}`);\n        }\n        lines.push('');\n        lines.push('  To resolve:');\n        lines.push('  1. Review the relationships creating the cycle');\n        lines.push('  2. Break the cycle by removing one of the dependencies');\n        lines.push('  3. Consider using NULL values or restructuring relationships');\n        lines.push('');\n    }\n\n    /**\n     * Add conclusion section\n     */\n    private static addConclusion(lines: string[], audit: DeletionAudit): void {\n        lines.push('═'.repeat(80));\n\n        if (audit.circularDependencies.length > 0) {\n            lines.push('STATUS: ❌ CANNOT PROCEED');\n            lines.push('');\n            lines.push('Circular dependencies detected. Please resolve the cycles above.');\n        } else if (audit.implicitDeletes.size > 0 || audit.orphanedReferences.length > 0) {\n            lines.push('STATUS: ⚠️  REVIEW REQUIRED');\n            lines.push('');\n            if (audit.implicitDeletes.size > 0) {\n                lines.push(`${audit.implicitDeletes.size} implicit deletion${audit.implicitDeletes.size > 1 ? 's' : ''} will occur.`);\n                lines.push('Review the implicit deletes above and confirm this is intended.');\n            }\n            if (audit.orphanedReferences.length > 0) {\n                if (audit.implicitDeletes.size > 0) {\n                    lines.push('');\n                }\n                lines.push(`${audit.orphanedReferences.length} database-only reference${audit.orphanedReferences.length > 1 ? 's' : ''} detected.`);\n                lines.push('These may be handled by cascade delete rules or may cause FK errors.');\n            }\n        } else {\n            lines.push('STATUS: ✓ SAFE TO PROCEED');\n            lines.push('');\n            lines.push('All deletions are explicitly marked and have no dependencies.');\n        }\n\n        lines.push('═'.repeat(80));\n    }\n\n    /**\n     * Format a record ID for display\n     */\n    private static formatRecordId(record: FlattenedRecord): string {\n        return record.record.fields?.Name ||\n               record.record.primaryKey?.ID ||\n               record.record.fields?.ID ||\n               record.id;\n    }\n\n    /**\n     * Group records by entity name\n     */\n    private static groupByEntity(records: FlattenedRecord[]): Map<string, FlattenedRecord[]> {\n        const byEntity = new Map<string, FlattenedRecord[]>();\n\n        for (const record of records) {\n            if (!byEntity.has(record.entityName)) {\n                byEntity.set(record.entityName, []);\n            }\n            byEntity.get(record.entityName)!.push(record);\n        }\n\n        return byEntity;\n    }\n\n    /**\n     * Find what an implicit delete depends on (for display)\n     */\n    private static findDependencies(\n        record: FlattenedRecord,\n        audit: DeletionAudit\n    ): string[] {\n        const deps: string[] = [];\n\n        for (const depId of record.dependencies) {\n            const explicitRecord = audit.explicitDeletes.get(depId);\n            if (explicitRecord) {\n                deps.push(`${explicitRecord.entityName}:${this.formatRecordId(explicitRecord)}`);\n            } else {\n                const implicitRecord = audit.implicitDeletes.get(depId);\n                if (implicitRecord) {\n                    deps.push(`${implicitRecord.entityName}:${this.formatRecordId(implicitRecord)}`);\n                }\n            }\n        }\n\n        return deps;\n    }\n\n    /**\n     * Generate a concise summary for logging\n     */\n    static generateSummary(audit: DeletionAudit): string {\n        const parts: string[] = [];\n\n        if (audit.explicitDeletes.size > 0) {\n            parts.push(`${audit.explicitDeletes.size} explicit`);\n        }\n\n        if (audit.implicitDeletes.size > 0) {\n            parts.push(`${audit.implicitDeletes.size} implicit`);\n        }\n\n        if (audit.orphanedReferences.length > 0) {\n            parts.push(`${audit.orphanedReferences.length} orphaned refs`);\n        }\n\n        if (audit.circularDependencies.length > 0) {\n            parts.push(`${audit.circularDependencies.length} cycles`);\n        }\n\n        return parts.length > 0 ? parts.join(', ') : 'no deletions';\n    }\n}\n"]}