feat: 使用LCS对比+12

src/assets/file/Trans-Convert.xml

@@ -9,8 +9,7 @@
     <CEP>
         <EFFECT EFFRG="001999"></EFFECT>
         <TITLEC>发动机QEC拆卸（V2500-A5系列）</TITLEC>
-        <TITLE>Remove the Engine's QEC(V2500-A5 series)XXXX</TITLE>
-        <TITLE>Remove the Engine's QEC(V2500-A5 series)XXXX</TITLE>
+        <TITLE>Remove the Engine's QEC(V2500-A5 series)xxx</TITLE>
         <TOPIC CK-LEVEL="C">
             <TITLEC>飞机/发动机基本信息</TITLEC>
             <TITLE>AIRCRAFT/ENGINE INFORMATION</TITLE>

src/lib/XMLProcessor/src/core/Processing.ts

 // 引入 TreeRenderResult 类型，该类型定义在 @/lib/XMLProcessor/src/typing 模块中
 import { NewTreeModification, OldTreeModification, TreeRenderResult, TreeRenderResultFlatted } from '@/lib/XMLProcessor/src/typing'
 import { md5 } from 'js-md5'
-import {getUUID} from '../utils/uuid.ts'
-import {dualCompare} from '@/lib/XMLProcessor/src/core/dualCompare.ts'
+import { getUUID } from '../utils/uuid.ts'
+import { dualCompare } from '@/lib/XMLProcessor/src/core/dualCompare.ts'
 
 // 定义 Processing 类，用于处理 XML 数据
 export class Processing {
@@ -60,23 +60,32 @@ export class Processing {
         treeA.documentElement.querySelectorAll(':not([data-key])').forEach((node) => node.remove())
         treeB.documentElement.querySelectorAll(':not([data-key])').forEach((node) => node.remove())
         // 扁平化所有节点
-        const resultAFlatted = this.flattenTree(resultA).filter((item) => {
+        const resultAFlatted = this.flattenTree(resultA)
+            .filter((item) => {
                 return contentHoldNode.includes(item.label)
             })
-        const resultBFlatted = this.flattenTree(resultB).filter((item) => {
+            .map((item, index) => ({
+                ...item,
+                index
+            }))
+        const resultBFlatted = this.flattenTree(resultB)
+            .filter((item) => {
                 return contentHoldNode.includes(item.label)
             })
+            .map((item, index) => ({
+                ...item,
+                index
+            }))
 
-        const results = dualCompare(resultAFlatted, resultBFlatted)
-            .filter(a=>a.type !=='same');
+        const results = dualCompare(resultAFlatted, resultBFlatted).filter((a) => a.type !== 'same')
 
         console.log('results here', results)
 
         const dataForOld: OldTreeModification = {
-            Deleted: results.filter(item => item.type === 'deleted').map(a=>a.item)
+            Deleted: results.filter((item) => item.type === 'deleted').map((a) => a.item)
         }
         const dataForNew: NewTreeModification = {
-            Added: results.filter(item => item.type === 'added').map(a=>a.item)
+            Added: results.filter((item) => item.type === 'added').map((a) => a.item)
         }
 
         return {
@@ -88,7 +97,7 @@ export class Processing {
             treeNew: resultB,
             xmlContentOld: this.serializeXML(treeA),
             xmlContentNew: this.serializeXML(treeB)
-        };
+        }
     }
 
     // 处理 XML 字符串的方法，返回树形数据和 XML DOM 对象

src/lib/XMLProcessor/src/core/dualCompare.ts

@@ -5,6 +5,8 @@ export function dualCompare(oldItems: TreeRenderResultFlatted[], newItems: TreeR
     const oldItemsCount = oldItems.length
     const newItemsCount = newItems.length
 
+    console.log('old and new', { oldItems, newItems })
+
     const dp: number[][] = Array.from({ length: oldItemsCount + 1 }, () => Array(newItemsCount + 1).fill(0))
 
     for (let i = 1; i <= oldItemsCount; i++) {
@@ -19,10 +21,10 @@ export function dualCompare(oldItems: TreeRenderResultFlatted[], newItems: TreeR
 
     let i = oldItemsCount,
         j = newItemsCount
-    const result: Array<{ type: 'same' | 'deleted' | 'added'; item: TreeRenderResultFlatted }> = []
+    const result: Array<{ type: 'same' | 'deleted' | 'added' | 'changedOld' | 'changedNew'; item: TreeRenderResultFlatted }> = []
     while (i > 0 && j > 0) {
         if (oldItems[i - 1].hash === newItems[j - 1].hash && oldItems[i - 1].label === newItems[j - 1].label) {
-            result.unshift({ type: 'same', item: cloneDeep(oldItems[i - 1]) })
+            // result.unshift({ type: 'same', item: cloneDeep(oldItems[i - 1]) })
             i--
             j--
         } else if (dp[i - 1][j] > dp[i][j - 1]) {