67f5dfbe50
主要功能: - 修改RequirementModal支持12个订单班选择 - 添加OrderClassIconMap图标映射组件 - Store中添加selectedOrderClass状态管理 - WorkflowPage支持传递orderClass参数 - web_result添加URL参数切换功能 - 创建order-class-handler.js动态处理页面主题 技术改进: - 创建软链接关联订单班数据目录 - 生成wenlu.json和food.json数据结构 - 删除重复的web_result目录 - 添加测试页面test-order-class.html 影响范围: - 展会策划系统现支持12个订单班 - 结果展示页面自动适配不同订单班主题 - 用户可选择不同行业生成对应方案 🤖 Generated with Claude Code Co-Authored-By: Claude <noreply@anthropic.com>
40 lines
743 B
JavaScript
40 lines
743 B
JavaScript
"use strict";
|
|
|
|
Object.defineProperty(exports, "__esModule", {
|
|
value: true
|
|
});
|
|
exports.findSuggestion = findSuggestion;
|
|
const {
|
|
min
|
|
} = Math;
|
|
function levenshtein(a, b) {
|
|
let t = [],
|
|
u = [],
|
|
i,
|
|
j;
|
|
const m = a.length,
|
|
n = b.length;
|
|
if (!m) {
|
|
return n;
|
|
}
|
|
if (!n) {
|
|
return m;
|
|
}
|
|
for (j = 0; j <= n; j++) {
|
|
t[j] = j;
|
|
}
|
|
for (i = 1; i <= m; i++) {
|
|
for (u = [i], j = 1; j <= n; j++) {
|
|
u[j] = a[i - 1] === b[j - 1] ? t[j - 1] : min(t[j - 1], t[j], u[j - 1]) + 1;
|
|
}
|
|
t = u;
|
|
}
|
|
return u[n];
|
|
}
|
|
function findSuggestion(str, arr) {
|
|
const distances = arr.map(el => levenshtein(el, str));
|
|
return arr[distances.indexOf(min(...distances))];
|
|
}
|
|
|
|
//# sourceMappingURL=find-suggestion.js.map
|