zcw-shared 1.32.0 → 1.32.2

package/dist/functions/algorithm/lcsVisual.js

@@ -1,88 +0,0 @@
-export function lcsVisual(str1, str2) {
-    const steps = [];
-    let stepNumber = 0;
-    const m = str1.length;
-    const n = str2.length;
-    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
-    steps.push({
-        stepNumber: stepNumber++,
-        description: '初始化DP表',
-        dpTable: dp.map(row => [...row])
-    });
-    for (let i = 1; i <= m; i++) {
-        for (let j = 1; j <= n; j++) {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `处理 str1[${i - 1}]='${str1[i - 1]}' 和 str2[${j - 1}]='${str2[j - 1]}'`,
-                dpTable: dp.map(row => [...row]),
-                currentCell: { row: i, col: j }
-            });
-            if (str1[i - 1] === str2[j - 1]) {
-                dp[i][j] = dp[i - 1][j - 1] + 1;
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `字符相同！dp[${i}][${j}] = dp[${i - 1}][${j - 1}] + 1 = ${dp[i][j]}`,
-                    dpTable: dp.map(row => [...row]),
-                    currentCell: { row: i, col: j },
-                    dependencies: [{ row: i - 1, col: j - 1 }],
-                    currentValue: dp[i][j]
-                });
-            }
-            else {
-                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `字符不同，取最大值: dp[${i}][${j}] = max(${dp[i - 1][j]}, ${dp[i][j - 1]}) = ${dp[i][j]}`,
-                    dpTable: dp.map(row => [...row]),
-                    currentCell: { row: i, col: j },
-                    dependencies: [{ row: i - 1, col: j }, { row: i, col: j - 1 }],
-                    currentValue: dp[i][j]
-                });
-            }
-        }
-    }
-    let i = m, j = n;
-    const lcs = [];
-    while (i > 0 && j > 0) {
-        if (str1[i - 1] === str2[j - 1]) {
-            lcs.unshift(str1[i - 1]);
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `回溯: 字符'${str1[i - 1]}'是LCS的一部分`,
-                dpTable: dp.map(row => [...row]),
-                currentCell: { row: i, col: j }
-            });
-            i--;
-            j--;
-        }
-        else if (dp[i - 1][j] > dp[i][j - 1]) {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `回溯: 向上移动`,
-                dpTable: dp.map(row => [...row]),
-                currentCell: { row: i, col: j }
-            });
-            i--;
-        }
-        else {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `回溯: 向左移动`,
-                dpTable: dp.map(row => [...row]),
-                currentCell: { row: i, col: j }
-            });
-            j--;
-        }
-    }
-    steps.push({
-        stepNumber: stepNumber++,
-        description: `LCS构建完成: "${lcs.join('')}", 长度 ${dp[m][n]}`,
-        dpTable: dp.map(row => [...row])
-    });
-    return {
-        steps,
-        length: dp[m][n],
-        sequence: lcs.join('')
-    };
-}
-//# sourceMappingURL=lcsVisual.js.map

package/dist/functions/algorithm/lcsVisual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lcsVisual.js","sourceRoot":"","sources":["../../../src/functions/algorithm/lcsVisual.ts"],"names":[],"mappings":"AAKA,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,IAAY;IAKlD,MAAM,KAAK,GAAwB,EAAE,CAAA;IACrC,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IAErB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAEhF,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,QAAQ;QACrB,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;KACjC,CAAC,CAAA;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG;gBACnF,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aAChC,CAAC,CAAA;YAEF,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAChC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC/B,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7E,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;oBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBAC/B,YAAY,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1C,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACvB,CAAC,CAAA;YACJ,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBAC/C,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,iBAAiB,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC9F,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;oBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBAC/B,YAAY,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC9D,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACvB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAGD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;IAChB,MAAM,GAAG,GAAa,EAAE,CAAA;IAExB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACxB,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW;gBAC7C,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aAChC,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,UAAU;gBACvB,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aAChC,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,UAAU;gBACvB,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAChC,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aAChC,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,aAAa,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QACzD,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;KACjC,CAAC,CAAA;IAEF,OAAO;QACL,KAAK;QACL,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;KACvB,CAAA;AACH,CAAC"}

package/dist/functions/algorithm/mergeSortVisual.d.ts

@@ -1,5 +0,0 @@
-import type { ArrayVisualStep } from '../../../types/algorithm-visual';
-export declare function mergeSortVisual(arr: number[]): {
-    steps: ArrayVisualStep[];
-    result: number[];
-};

package/dist/functions/algorithm/mergeSortVisual.js

@@ -1,103 +0,0 @@
-export function mergeSortVisual(arr) {
-    const steps = [];
-    let stepNumber = 0;
-    const result = [...arr];
-    steps.push({
-        stepNumber: stepNumber++,
-        description: '开始归并排序',
-        array: [...result],
-        highlights: {}
-    });
-    function merge(arr, left, mid, right) {
-        const leftArr = arr.slice(left, mid + 1);
-        const rightArr = arr.slice(mid + 1, right + 1);
-        steps.push({
-            stepNumber: stepNumber++,
-            description: `合并两个已排序数组: [${left}..${mid}] 和 [${mid + 1}..${right}]`,
-            array: [...arr],
-            highlights: { primary: [mid], secondary: Array.from({ length: right - left + 1 }, (_, i) => left + i) },
-            range: { left, right }
-        });
-        let i = 0, j = 0, k = left;
-        while (i < leftArr.length && j < rightArr.length) {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `比较 ${leftArr[i]} 和 ${rightArr[j]}`,
-                array: [...arr],
-                highlights: { comparing: [left + i, mid + 1 + j] },
-                range: { left, right }
-            });
-            if (leftArr[i] <= rightArr[j]) {
-                arr[k] = leftArr[i];
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `选择 ${leftArr[i]},放入位置 ${k}`,
-                    array: [...arr],
-                    highlights: { completed: [k] },
-                    range: { left, right }
-                });
-                i++;
-            }
-            else {
-                arr[k] = rightArr[j];
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `选择 ${rightArr[j]},放入位置 ${k}`,
-                    array: [...arr],
-                    highlights: { completed: [k] },
-                    range: { left, right }
-                });
-                j++;
-            }
-            k++;
-        }
-        while (i < leftArr.length) {
-            arr[k] = leftArr[i];
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `复制剩余元素 ${leftArr[i]} 到位置 ${k}`,
-                array: [...arr],
-                highlights: { completed: [k] },
-                range: { left, right }
-            });
-            i++;
-            k++;
-        }
-        while (j < rightArr.length) {
-            arr[k] = rightArr[j];
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `复制剩余元素 ${rightArr[j]} 到位置 ${k}`,
-                array: [...arr],
-                highlights: { completed: [k] },
-                range: { left, right }
-            });
-            j++;
-            k++;
-        }
-    }
-    function mergeSortHelper(arr, left, right) {
-        if (left >= right)
-            return;
-        const mid = Math.floor((left + right) / 2);
-        steps.push({
-            stepNumber: stepNumber++,
-            description: `分割数组 [${left}..${right}] 为 [${left}..${mid}] 和 [${mid + 1}..${right}]`,
-            array: [...arr],
-            highlights: { primary: [mid] },
-            range: { left, right }
-        });
-        mergeSortHelper(arr, left, mid);
-        mergeSortHelper(arr, mid + 1, right);
-        merge(arr, left, mid, right);
-    }
-    mergeSortHelper(result, 0, result.length - 1);
-    steps.push({
-        stepNumber: stepNumber++,
-        description: '归并排序完成！',
-        array: [...result],
-        highlights: { completed: result.map((_, i) => i) }
-    });
-    return { steps, result };
-}
-//# sourceMappingURL=mergeSortVisual.js.map

package/dist/functions/algorithm/mergeSortVisual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mergeSortVisual.js","sourceRoot":"","sources":["../../../src/functions/algorithm/mergeSortVisual.ts"],"names":[],"mappings":"AAKA,MAAM,UAAU,eAAe,CAAC,GAAa;IAC3C,MAAM,KAAK,GAAsB,EAAE,CAAA;IACnC,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IAEvB,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,QAAQ;QACrB,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;QAClB,UAAU,EAAE,EAAE;KACf,CAAC,CAAA;IAEF,SAAS,KAAK,CAAC,GAAa,EAAE,IAAY,EAAE,GAAW,EAAE,KAAa;QACpE,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;QACxC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QAE9C,KAAK,CAAC,IAAI,CAAC;YACT,UAAU,EAAE,UAAU,EAAE;YACxB,WAAW,EAAE,eAAe,IAAI,KAAK,GAAG,QAAQ,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG;YACpE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE;YACvG,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;SACvB,CAAC,CAAA;QAEF,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;QAE1B,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,EAAE;gBAChD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;gBAClD,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAAA;YAEF,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBACnB,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;oBACzC,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;oBACf,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE;oBAC9B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;iBACvB,CAAC,CAAA;gBACF,CAAC,EAAE,CAAA;YACL,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;gBACpB,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;oBAC1C,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;oBACf,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE;oBAC9B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;iBACvB,CAAC,CAAA;gBACF,CAAC,EAAE,CAAA;YACL,CAAC;YACD,CAAC,EAAE,CAAA;QACL,CAAC;QAED,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACnB,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,UAAU,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE;gBAC5C,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC9B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;QACL,CAAC;QAED,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YACpB,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE;gBAC7C,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC9B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAAA;YACF,CAAC,EAAE,CAAA;YACH,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,SAAS,eAAe,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;QACjE,IAAI,IAAI,IAAI,KAAK;YAAE,OAAM;QAEzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1C,KAAK,CAAC,IAAI,CAAC;YACT,UAAU,EAAE,UAAU,EAAE;YACxB,WAAW,EAAE,SAAS,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,QAAQ,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG;YACpF,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE;YAC9B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;SACvB,CAAC,CAAA;QAEF,eAAe,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;QAC/B,eAAe,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;QACpC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAE7C,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,SAAS;QACtB,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;QAClB,UAAU,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;KACnD,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AAC1B,CAAC"}

package/dist/functions/algorithm/nQueensVisual.d.ts

@@ -1,14 +0,0 @@
-import type { BacktrackVisualStep } from '../../../types/algorithm-visual';
-export interface NQueensVisualStep extends BacktrackVisualStep {
-    board: string[][];
-    currentRow: number;
-    tryingCol?: number;
-    conflicts?: Array<{
-        row: number;
-        col: number;
-    }>;
-}
-export declare function nQueensVisual(n: number): {
-    steps: NQueensVisualStep[];
-    solutions: string[][];
-};

package/dist/functions/algorithm/nQueensVisual.js

@@ -1,94 +0,0 @@
-export function nQueensVisual(n) {
-    const steps = [];
-    let stepNumber = 0;
-    const solutions = [];
-    const board = Array.from({ length: n }, () => Array(n).fill('.'));
-    const cols = new Set();
-    const diag1 = new Set();
-    const diag2 = new Set();
-    steps.push({
-        stepNumber: stepNumber++,
-        description: `开始解决${n}皇后问题`,
-        path: [],
-        board: board.map(r => [...r]),
-        currentRow: 0
-    });
-    function backtrack(row) {
-        if (row === n) {
-            solutions.push(board.map(r => r.join('')));
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `找到一个解决方案！(第${solutions.length}个)`,
-                path: Array.from({ length: n }, (_, i) => board[i].indexOf('Q')),
-                board: board.map(r => [...r]),
-                currentRow: row,
-                isBacktracking: false
-            });
-            return;
-        }
-        for (let col = 0; col < n; col++) {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `第${row}行: 尝试在第${col}列放置皇后`,
-                path: Array.from({ length: row }, (_, i) => board[i].indexOf('Q')),
-                board: board.map(r => [...r]),
-                currentRow: row,
-                tryingCol: col
-            });
-            const hasConflict = cols.has(col) || diag1.has(row - col) || diag2.has(row + col);
-            if (hasConflict) {
-                const conflicts = [];
-                for (let i = 0; i < row; i++) {
-                    const queenCol = board[i].indexOf('Q');
-                    if (queenCol === col || i - queenCol === row - col || i + queenCol === row + col) {
-                        conflicts.push({ row: i, col: queenCol });
-                    }
-                }
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `冲突！该位置会与已放置的皇后冲突`,
-                    path: [],
-                    board: board.map(r => [...r]),
-                    currentRow: row,
-                    tryingCol: col,
-                    conflicts
-                });
-                continue;
-            }
-            board[row][col] = 'Q';
-            cols.add(col);
-            diag1.add(row - col);
-            diag2.add(row + col);
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `在(${row}, ${col})放置皇后，继续下一行`,
-                path: Array.from({ length: row + 1 }, (_, i) => board[i].indexOf('Q')),
-                board: board.map(r => [...r]),
-                currentRow: row
-            });
-            backtrack(row + 1);
-            board[row][col] = '.';
-            cols.delete(col);
-            diag1.delete(row - col);
-            diag2.delete(row + col);
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `回溯：移除(${row}, ${col})的皇后`,
-                path: Array.from({ length: row }, (_, i) => board[i].indexOf('Q')),
-                board: board.map(r => [...r]),
-                currentRow: row,
-                isBacktracking: true
-            });
-        }
-    }
-    backtrack(0);
-    steps.push({
-        stepNumber: stepNumber++,
-        description: `完成！共找到${solutions.length}个解决方案`,
-        path: [],
-        board: board.map(r => [...r]),
-        currentRow: n
-    });
-    return { steps, solutions };
-}
-//# sourceMappingURL=nQueensVisual.js.map

package/dist/functions/algorithm/nQueensVisual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nQueensVisual.js","sourceRoot":"","sources":["../../../src/functions/algorithm/nQueensVisual.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,aAAa,CAAC,CAAS;IAIrC,MAAM,KAAK,GAAwB,EAAE,CAAA;IACrC,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,MAAM,SAAS,GAAe,EAAE,CAAA;IAChC,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IAE7E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAE/B,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,OAAO,CAAC,MAAM;QAC3B,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,UAAU,EAAE,CAAC;KACd,CAAC,CAAA;IAEF,SAAS,SAAS,CAAC,GAAW;QAC5B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YAC1C,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,cAAc,SAAS,CAAC,MAAM,IAAI;gBAC/C,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,UAAU,EAAE,GAAG;gBACf,cAAc,EAAE,KAAK;aACtB,CAAC,CAAA;YACF,OAAM;QACR,CAAC;QAED,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,IAAI,GAAG,UAAU,GAAG,OAAO;gBACxC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAClE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,UAAU,EAAE,GAAG;gBACf,SAAS,EAAE,GAAG;aACf,CAAC,CAAA;YAEF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YAEjF,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,SAAS,GAAwC,EAAE,CAAA;gBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;oBACtC,IAAI,QAAQ,KAAK,GAAG,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC;wBACjF,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAA;oBAC3C,CAAC;gBACH,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,kBAAkB;oBAC/B,IAAI,EAAE,EAAE;oBACR,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7B,UAAU,EAAE,GAAG;oBACf,SAAS,EAAE,GAAG;oBACd,SAAS;iBACV,CAAC,CAAA;gBACF,SAAQ;YACV,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAA;YACrB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACb,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YACpB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YAEpB,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,KAAK,GAAG,KAAK,GAAG,aAAa;gBAC1C,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACtE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,UAAU,EAAE,GAAG;aAChB,CAAC,CAAA;YAEF,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YAElB,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAA;YACrB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAChB,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YACvB,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YAEvB,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,SAAS,GAAG,KAAK,GAAG,MAAM;gBACvC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAClE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,UAAU,EAAE,GAAG;gBACf,cAAc,EAAE,IAAI;aACrB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,SAAS,CAAC,CAAC,CAAC,CAAA;IAEZ,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,SAAS,SAAS,CAAC,MAAM,OAAO;QAC7C,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,UAAU,EAAE,CAAC;KACd,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;AAC7B,CAAC"}

package/dist/functions/algorithm/numIslandsVisual.d.ts

@@ -1,17 +0,0 @@
-import type { GraphVisualStep } from '../../../types/algorithm-visual';
-export interface IslandVisualStep extends GraphVisualStep {
-    grid: string[][];
-    currentPos?: {
-        row: number;
-        col: number;
-    };
-    islandCount: number;
-    stack?: Array<{
-        row: number;
-        col: number;
-    }>;
-}
-export declare function numIslandsVisual(grid: string[][]): {
-    steps: IslandVisualStep[];
-    count: number;
-};

package/dist/functions/algorithm/numIslandsVisual.js

@@ -1,102 +0,0 @@
-export function numIslandsVisual(grid) {
-    const steps = [];
-    let stepNumber = 0;
-    const gridCopy = grid.map(row => [...row]);
-    const m = gridCopy.length;
-    const n = gridCopy[0].length;
-    let count = 0;
-    steps.push({
-        stepNumber: stepNumber++,
-        description: '开始搜索岛屿',
-        graph: [],
-        visited: [],
-        grid: gridCopy.map(r => [...r]),
-        islandCount: 0
-    });
-    function dfs(i, j, islandId) {
-        if (i < 0 || i >= m || j < 0 || j >= n || gridCopy[i][j] === '0') {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `位置(${i},${j})越界或是水域，返回`,
-                graph: [],
-                visited: [],
-                grid: gridCopy.map(r => [...r]),
-                currentPos: { row: i, col: j },
-                islandCount: count
-            });
-            return;
-        }
-        steps.push({
-            stepNumber: stepNumber++,
-            description: `访问陆地(${i},${j})，标记为岛屿${islandId}的一部分`,
-            graph: [],
-            visited: [],
-            grid: gridCopy.map(r => [...r]),
-            currentPos: { row: i, col: j },
-            islandCount: count
-        });
-        gridCopy[i][j] = '0';
-        steps.push({
-            stepNumber: stepNumber++,
-            description: `标记(${i},${j})为已访问`,
-            graph: [],
-            visited: [],
-            grid: gridCopy.map(r => [...r]),
-            currentPos: { row: i, col: j },
-            islandCount: count
-        });
-        const directions = [
-            { name: '下', dr: 1, dc: 0 },
-            { name: '上', dr: -1, dc: 0 },
-            { name: '右', dr: 0, dc: 1 },
-            { name: '左', dr: 0, dc: -1 }
-        ];
-        for (const dir of directions) {
-            steps.push({
-                stepNumber: stepNumber++,
-                description: `从(${i},${j})向${dir.name}搜索`,
-                graph: [],
-                visited: [],
-                grid: gridCopy.map(r => [...r]),
-                currentPos: { row: i, col: j },
-                islandCount: count
-            });
-            dfs(i + dir.dr, j + dir.dc, islandId);
-        }
-    }
-    for (let i = 0; i < m; i++) {
-        for (let j = 0; j < n; j++) {
-            if (gridCopy[i][j] === '1') {
-                count++;
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `发现新岛屿${count}！起点(${i},${j})`,
-                    graph: [],
-                    visited: [],
-                    grid: gridCopy.map(r => [...r]),
-                    currentPos: { row: i, col: j },
-                    islandCount: count
-                });
-                dfs(i, j, count);
-                steps.push({
-                    stepNumber: stepNumber++,
-                    description: `岛屿${count}搜索完成`,
-                    graph: [],
-                    visited: [],
-                    grid: gridCopy.map(r => [...r]),
-                    islandCount: count
-                });
-            }
-        }
-    }
-    steps.push({
-        stepNumber: stepNumber++,
-        description: `搜索完成！共找到${count}个岛屿`,
-        graph: [],
-        visited: [],
-        grid: gridCopy.map(r => [...r]),
-        islandCount: count
-    });
-    return { steps, count };
-}
-//# sourceMappingURL=numIslandsVisual.js.map

package/dist/functions/algorithm/numIslandsVisual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"numIslandsVisual.js","sourceRoot":"","sources":["../../../src/functions/algorithm/numIslandsVisual.ts"],"names":[],"mappings":"AAmBA,MAAM,UAAU,gBAAgB,CAAC,IAAgB;IAI/C,MAAM,KAAK,GAAuB,EAAE,CAAA;IACpC,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;IAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAA;IACzB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAC5B,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,QAAQ;QACrB,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,WAAW,EAAE,CAAC;KACf,CAAC,CAAA;IAEF,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,QAAgB;QACjD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACjE,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;gBACrC,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC9B,WAAW,EAAE,KAAK;aACnB,CAAC,CAAA;YACF,OAAM;QACR,CAAC;QAED,KAAK,CAAC,IAAI,CAAC;YACT,UAAU,EAAE,UAAU,EAAE;YACxB,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,QAAQ,MAAM;YACnD,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;YAC9B,WAAW,EAAE,KAAK;SACnB,CAAC,CAAA;QAEF,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;QAEpB,KAAK,CAAC,IAAI,CAAC;YACT,UAAU,EAAE,UAAU,EAAE;YACxB,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO;YAChC,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;YAC9B,WAAW,EAAE,KAAK;SACnB,CAAC,CAAA;QAEF,MAAM,UAAU,GAAG;YACjB,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC3B,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC5B,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YAC3B,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE;SAC7B,CAAA;QAED,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE;gBACxB,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI;gBACzC,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC9B,WAAW,EAAE,KAAK;aACnB,CAAC,CAAA;YACF,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC3B,KAAK,EAAE,CAAA;gBACP,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,QAAQ,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG;oBAC1C,KAAK,EAAE,EAAE;oBACT,OAAO,EAAE,EAAE;oBACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/B,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBAC9B,WAAW,EAAE,KAAK;iBACnB,CAAC,CAAA;gBACF,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBAChB,KAAK,CAAC,IAAI,CAAC;oBACT,UAAU,EAAE,UAAU,EAAE;oBACxB,WAAW,EAAE,KAAK,KAAK,MAAM;oBAC7B,KAAK,EAAE,EAAE;oBACT,OAAO,EAAE,EAAE;oBACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/B,WAAW,EAAE,KAAK;iBACnB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC;QACT,UAAU,EAAE,UAAU,EAAE;QACxB,WAAW,EAAE,WAAW,KAAK,KAAK;QAClC,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,WAAW,EAAE,KAAK;KACnB,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;AACzB,CAAC"}

package/dist/functions/algorithm/quickSortVisual.d.ts

@@ -1,18 +0,0 @@
-export interface SortStep {
-    description: string;
-    array: number[];
-    highlights: {
-        pivot?: number;
-        comparing?: number[];
-        swapping?: number[];
-        sorted?: number[];
-    };
-    range?: {
-        left: number;
-        right: number;
-    };
-}
-export declare function quickSortVisual(arr: number[]): {
-    steps: SortStep[];
-    result: number[];
-};

package/dist/functions/algorithm/quickSortVisual.js

@@ -1,104 +0,0 @@
-export function quickSortVisual(arr) {
-    const steps = [];
-    const result = [...arr];
-    steps.push({
-        description: '开始排序',
-        array: [...result],
-        highlights: {}
-    });
-    function partition(arr, left, right) {
-        const pivot = arr[right];
-        const pivotIndex = right;
-        steps.push({
-            description: `选择基准值 arr[${right}] = ${pivot}`,
-            array: [...arr],
-            highlights: { pivot: right },
-            range: { left, right }
-        });
-        let i = left - 1;
-        for (let j = left; j < right; j++) {
-            steps.push({
-                description: `比较 arr[${j}] = ${arr[j]} 与基准值 ${pivot}`,
-                array: [...arr],
-                highlights: { pivot: pivotIndex, comparing: [j] },
-                range: { left, right }
-            });
-            if (arr[j] <= pivot) {
-                i++;
-                if (i !== j) {
-                    steps.push({
-                        description: `交换 arr[${i}] = ${arr[i]} 与 arr[${j}] = ${arr[j]}`,
-                        array: [...arr],
-                        highlights: { pivot: pivotIndex, swapping: [i, j] },
-                        range: { left, right }
-                    });
-                    [arr[i], arr[j]] = [arr[j], arr[i]];
-                    steps.push({
-                        description: `交换后: arr[${i}] = ${arr[i]}, arr[${j}] = ${arr[j]}`,
-                        array: [...arr],
-                        highlights: { pivot: pivotIndex },
-                        range: { left, right }
-                    });
-                }
-            }
-        }
-        const newPivotIndex = i + 1;
-        if (newPivotIndex !== right) {
-            steps.push({
-                description: `将基准值放到正确位置: 交换 arr[${newPivotIndex}] 与 arr[${right}]`,
-                array: [...arr],
-                highlights: { swapping: [newPivotIndex, right] },
-                range: { left, right }
-            });
-            [arr[newPivotIndex], arr[right]] = [arr[right], arr[newPivotIndex]];
-            steps.push({
-                description: `基准值 ${pivot} 已就位于索引 ${newPivotIndex}`,
-                array: [...arr],
-                highlights: { sorted: [newPivotIndex] },
-                range: { left, right }
-            });
-        }
-        return newPivotIndex;
-    }
-    function quickSortHelper(arr, left, right) {
-        if (left >= right) {
-            if (left === right) {
-                steps.push({
-                    description: `单个元素 arr[${left}] = ${arr[left]} 已有序`,
-                    array: [...arr],
-                    highlights: { sorted: [left] }
-                });
-            }
-            return;
-        }
-        steps.push({
-            description: `处理子数组 [${left}..${right}]`,
-            array: [...arr],
-            highlights: {},
-            range: { left, right }
-        });
-        const pivotIndex = partition(arr, left, right);
-        steps.push({
-            description: `递归处理左半部分 [${left}..${pivotIndex - 1}]`,
-            array: [...arr],
-            highlights: {},
-            range: { left, right: pivotIndex - 1 }
-        });
-        quickSortHelper(arr, left, pivotIndex - 1);
-        steps.push({
-            description: `递归处理右半部分 [${pivotIndex + 1}..${right}]`,
-            array: [...arr],
-            highlights: {},
-            range: { left: pivotIndex + 1, right }
-        });
-        quickSortHelper(arr, pivotIndex + 1, right);
-    }
-    quickSortHelper(result, 0, result.length - 1);
-    steps.push({
-        description: '排序完成！',
-        array: [...result],
-        highlights: { sorted: result.map((_, i) => i) }
-    });
-    return { steps, result };
-}
-//# sourceMappingURL=quickSortVisual.js.map

package/dist/functions/algorithm/quickSortVisual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quickSortVisual.js","sourceRoot":"","sources":["../../../src/functions/algorithm/quickSortVisual.ts"],"names":[],"mappings":"AA0BA,MAAM,UAAU,eAAe,CAAC,GAAa;IAC3C,MAAM,KAAK,GAAe,EAAE,CAAA;IAC5B,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IAEvB,KAAK,CAAC,IAAI,CAAC;QACT,WAAW,EAAE,MAAM;QACnB,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;QAClB,UAAU,EAAE,EAAE;KACf,CAAC,CAAA;IAEF,SAAS,SAAS,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;QAC3D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAA;QACxB,MAAM,UAAU,GAAG,KAAK,CAAA;QAExB,KAAK,CAAC,IAAI,CAAC;YACT,WAAW,EAAE,aAAa,KAAK,OAAO,KAAK,EAAE;YAC7C,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE;YAC5B,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;SACvB,CAAC,CAAA;QAEF,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAA;QAEhB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC;gBACT,WAAW,EAAE,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE;gBACrD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE;gBACjD,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAAA;YAEF,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,CAAC,EAAE,CAAA;gBACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC;wBACT,WAAW,EAAE,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE;wBAC/D,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;wBACf,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;wBACnD,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;qBACvB,CAAC,CAED;oBAAA,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;oBAEpC,KAAK,CAAC,IAAI,CAAC;wBACT,WAAW,EAAE,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE;wBAChE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;wBACf,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE;wBACjC,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;qBACvB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,CAAA;QAC3B,IAAI,aAAa,KAAK,KAAK,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC;gBACT,WAAW,EAAE,sBAAsB,aAAa,WAAW,KAAK,GAAG;gBACnE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,QAAQ,EAAE,CAAC,aAAa,EAAE,KAAK,CAAC,EAAE;gBAChD,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAED;YAAA,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,CAAA;YAEpE,KAAK,CAAC,IAAI,CAAC;gBACT,WAAW,EAAE,OAAO,KAAK,WAAW,aAAa,EAAE;gBACnD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;gBACf,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,aAAa,CAAC,EAAE;gBACvC,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,aAAa,CAAA;IACtB,CAAC;IAED,SAAS,eAAe,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;QACjE,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YAClB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC;oBACT,WAAW,EAAE,YAAY,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM;oBACnD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;oBACf,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;iBAC/B,CAAC,CAAA;YACJ,CAAC;YACD,OAAM;QACR,CAAC;QAED,KAAK,CAAC,IAAI,CAAC;YACT,WAAW,EAAE,UAAU,IAAI,KAAK,KAAK,GAAG;YACxC,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;SACvB,CAAC,CAAA;QAEF,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QAE9C,KAAK,CAAC,IAAI,CAAC;YACT,WAAW,EAAE,aAAa,IAAI,KAAK,UAAU,GAAG,CAAC,GAAG;YACpD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,GAAG,CAAC,EAAE;SACvC,CAAC,CAAA;QACF,eAAe,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC,CAAA;QAE1C,KAAK,CAAC,IAAI,CAAC;YACT,WAAW,EAAE,aAAa,UAAU,GAAG,CAAC,KAAK,KAAK,GAAG;YACrD,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;YACf,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,EAAE;SACvC,CAAC,CAAA;QACF,eAAe,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;IAC7C,CAAC;IAED,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAE7C,KAAK,CAAC,IAAI,CAAC;QACT,WAAW,EAAE,OAAO;QACpB,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;QAClB,UAAU,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;KAChD,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AAC1B,CAAC"}

package/dist/functions/browser/detectDevice.d.ts

@@ -1,10 +0,0 @@
-import type { Navigator } from '../../../references/browser.d';
-export interface DetectDeviceDeps {
-    userAgent: Navigator['userAgent'];
-}
-export interface DeviceInfo {
-    type: 'mobile' | 'tablet' | 'desktop';
-    vendor: string;
-    model: string;
-}
-export declare function detectDevice(deps: DetectDeviceDeps): DeviceInfo;

package/dist/functions/browser/detectDevice.js

@@ -1,49 +0,0 @@
-export function detectDevice(deps) {
-    const ua = deps.userAgent;
-    let type = 'desktop';
-    let vendor = 'Unknown';
-    let model = 'Unknown';
-    if (/iPad/.test(ua)) {
-        type = 'tablet';
-        vendor = 'Apple';
-        model = 'iPad';
-    }
-    else if (/iPhone/.test(ua)) {
-        type = 'mobile';
-        vendor = 'Apple';
-        model = 'iPhone';
-    }
-    else if (/Android/.test(ua)) {
-        type = /Mobile/.test(ua) ? 'mobile' : 'tablet';
-        vendor = 'Android';
-        const modelMatch = ua.match(/Android.*;\s*([^)]+)\s*Build/);
-        if (modelMatch) {
-            model = modelMatch[1].trim();
-        }
-    }
-    else if (/Windows Phone/.test(ua)) {
-        type = 'mobile';
-        vendor = 'Microsoft';
-        model = 'Windows Phone';
-    }
-    if (type === 'desktop') {
-        if (/Mac/.test(ua)) {
-            vendor = 'Apple';
-            model = 'Macintosh';
-        }
-        else if (/Windows/.test(ua)) {
-            vendor = 'Microsoft';
-            model = 'Windows PC';
-        }
-        else if (/Linux/.test(ua)) {
-            vendor = 'Linux';
-            model = 'Linux PC';
-        }
-    }
-    return {
-        type,
-        vendor,
-        model
-    };
-}
-//# sourceMappingURL=detectDevice.js.map