Files
Agent-n8n/web_frontend/food-order-demo/node_modules/graphemer/lib/GraphemerHelper.js
Yep_Q c3eb7125cc feat: 创建食品订单班演示系统基础框架
详细说明:
- 基于文旅订单班框架复制创建food-order-demo项目
- 修改端口配置为4174避免冲突
- 更新LandingPage为青莳轻食主题(绿色健康风格)
- 重新定义7个食品行业专业Agent:
  * 市场研究专家:轻食市场分析、客群画像
  * 营养配方师:营养成分配比、低卡高蛋白设计
  * 供应链管理专家:有机食材供应、溯源体系
  * 品牌策划师:品牌定位、店铺空间布局
  * 财务分析师:投资预算、ROI分析
  * 运营管理专家:运营流程、品控标准
  * 食品创业导师:中央协调、方案整合
- 创建专用启动脚本start.sh
- 验证系统可正常运行在端口4174
- 实现代码复用率90%,符合预期目标

影响文件: web_frontend/food-order-demo/
技术栈: React 18 + TypeScript + Tailwind CSS + Zustand
2025-09-28 10:32:44 +08:00

170 lines
6.5 KiB
JavaScript
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
const boundaries_1 = require("./boundaries");
// BreakTypes
// @type {BreakType}
const NotBreak = 0;
const BreakStart = 1;
const Break = 2;
const BreakLastRegional = 3;
const BreakPenultimateRegional = 4;
class GraphemerHelper {
/**
* Check if the the character at the position {pos} of the string is surrogate
* @param str {string}
* @param pos {number}
* @returns {boolean}
*/
static isSurrogate(str, pos) {
return (0xd800 <= str.charCodeAt(pos) &&
str.charCodeAt(pos) <= 0xdbff &&
0xdc00 <= str.charCodeAt(pos + 1) &&
str.charCodeAt(pos + 1) <= 0xdfff);
}
/**
* The String.prototype.codePointAt polyfill
* Private function, gets a Unicode code point from a JavaScript UTF-16 string
* handling surrogate pairs appropriately
* @param str {string}
* @param idx {number}
* @returns {number}
*/
static codePointAt(str, idx) {
if (idx === undefined) {
idx = 0;
}
const code = str.charCodeAt(idx);
// if a high surrogate
if (0xd800 <= code && code <= 0xdbff && idx < str.length - 1) {
const hi = code;
const low = str.charCodeAt(idx + 1);
if (0xdc00 <= low && low <= 0xdfff) {
return (hi - 0xd800) * 0x400 + (low - 0xdc00) + 0x10000;
}
return hi;
}
// if a low surrogate
if (0xdc00 <= code && code <= 0xdfff && idx >= 1) {
const hi = str.charCodeAt(idx - 1);
const low = code;
if (0xd800 <= hi && hi <= 0xdbff) {
return (hi - 0xd800) * 0x400 + (low - 0xdc00) + 0x10000;
}
return low;
}
// just return the char if an unmatched surrogate half or a
// single-char codepoint
return code;
}
//
/**
* Private function, returns whether a break is allowed between the two given grapheme breaking classes
* Implemented the UAX #29 3.1.1 Grapheme Cluster Boundary Rules on extended grapheme clusters
* @param start {number}
* @param mid {Array<number>}
* @param end {number}
* @param startEmoji {number}
* @param midEmoji {Array<number>}
* @param endEmoji {number}
* @returns {number}
*/
static shouldBreak(start, mid, end, startEmoji, midEmoji, endEmoji) {
const all = [start].concat(mid).concat([end]);
const allEmoji = [startEmoji].concat(midEmoji).concat([endEmoji]);
const previous = all[all.length - 2];
const next = end;
const nextEmoji = endEmoji;
// Lookahead terminator for:
// GB12. ^ (RI RI)* RI ? RI
// GB13. [^RI] (RI RI)* RI ? RI
const rIIndex = all.lastIndexOf(boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR);
if (rIIndex > 0 &&
all.slice(1, rIIndex).every(function (c) {
return c === boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR;
}) &&
[boundaries_1.CLUSTER_BREAK.PREPEND, boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR].indexOf(previous) === -1) {
if (all.filter(function (c) {
return c === boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR;
}).length %
2 ===
1) {
return BreakLastRegional;
}
else {
return BreakPenultimateRegional;
}
}
// GB3. CR × LF
if (previous === boundaries_1.CLUSTER_BREAK.CR && next === boundaries_1.CLUSTER_BREAK.LF) {
return NotBreak;
}
// GB4. (Control|CR|LF) ÷
else if (previous === boundaries_1.CLUSTER_BREAK.CONTROL ||
previous === boundaries_1.CLUSTER_BREAK.CR ||
previous === boundaries_1.CLUSTER_BREAK.LF) {
return BreakStart;
}
// GB5. ÷ (Control|CR|LF)
else if (next === boundaries_1.CLUSTER_BREAK.CONTROL ||
next === boundaries_1.CLUSTER_BREAK.CR ||
next === boundaries_1.CLUSTER_BREAK.LF) {
return BreakStart;
}
// GB6. L × (L|V|LV|LVT)
else if (previous === boundaries_1.CLUSTER_BREAK.L &&
(next === boundaries_1.CLUSTER_BREAK.L ||
next === boundaries_1.CLUSTER_BREAK.V ||
next === boundaries_1.CLUSTER_BREAK.LV ||
next === boundaries_1.CLUSTER_BREAK.LVT)) {
return NotBreak;
}
// GB7. (LV|V) × (V|T)
else if ((previous === boundaries_1.CLUSTER_BREAK.LV || previous === boundaries_1.CLUSTER_BREAK.V) &&
(next === boundaries_1.CLUSTER_BREAK.V || next === boundaries_1.CLUSTER_BREAK.T)) {
return NotBreak;
}
// GB8. (LVT|T) × (T)
else if ((previous === boundaries_1.CLUSTER_BREAK.LVT || previous === boundaries_1.CLUSTER_BREAK.T) &&
next === boundaries_1.CLUSTER_BREAK.T) {
return NotBreak;
}
// GB9. × (Extend|ZWJ)
else if (next === boundaries_1.CLUSTER_BREAK.EXTEND || next === boundaries_1.CLUSTER_BREAK.ZWJ) {
return NotBreak;
}
// GB9a. × SpacingMark
else if (next === boundaries_1.CLUSTER_BREAK.SPACINGMARK) {
return NotBreak;
}
// GB9b. Prepend ×
else if (previous === boundaries_1.CLUSTER_BREAK.PREPEND) {
return NotBreak;
}
// GB11. \p{Extended_Pictographic} Extend* ZWJ × \p{Extended_Pictographic}
const previousNonExtendIndex = allEmoji
.slice(0, -1)
.lastIndexOf(boundaries_1.EXTENDED_PICTOGRAPHIC);
if (previousNonExtendIndex !== -1 &&
allEmoji[previousNonExtendIndex] === boundaries_1.EXTENDED_PICTOGRAPHIC &&
all.slice(previousNonExtendIndex + 1, -2).every(function (c) {
return c === boundaries_1.CLUSTER_BREAK.EXTEND;
}) &&
previous === boundaries_1.CLUSTER_BREAK.ZWJ &&
nextEmoji === boundaries_1.EXTENDED_PICTOGRAPHIC) {
return NotBreak;
}
// GB12. ^ (RI RI)* RI × RI
// GB13. [^RI] (RI RI)* RI × RI
if (mid.indexOf(boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR) !== -1) {
return Break;
}
if (previous === boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR &&
next === boundaries_1.CLUSTER_BREAK.REGIONAL_INDICATOR) {
return NotBreak;
}
// GB999. Any ? Any
return BreakStart;
}
}
exports.default = GraphemerHelper;