@cloudpss/expression 0.6.0-alpha.1

package/src/migrator/node.ts

@@ -0,0 +1,131 @@
+import { serialize, serializePropName } from '@mirascript/mirascript/subtle';
+import {
+    type MathNode,
+    isAccessorNode,
+    isConstantNode,
+    isArrayNode,
+    isObjectNode,
+    isConditionalNode,
+    isFunctionNode,
+    isOperatorNode,
+    isParenthesisNode,
+    isRelationalNode,
+    type OperatorNodeFn,
+    isSymbolNode,
+} from 'mathjs';
+import type { State } from './state.js';
+import type { Options, Result } from './interface.js';
+import type { VmConst } from '@mirascript/mirascript';
+import { unsupportedNode } from './utils.js';
+import { migrateAccess } from './access.js';
+import { migrateCall } from './call.js';
+import { migrateOperator } from './operator.js';
+import { migrateSymbol } from './symbol.js';
+import { migrateCondition } from './condition.js';
+
+/** 转换 AST */
+export function migrateAtomic(state: State, node: MathNode): Result {
+    return migrateNode(state, node, { format: 'no-paren' });
+}
+/** 转换 AST */
+export function migrateParen(state: State, node: MathNode): Result {
+    return migrateNode(state, node, { format: 'paren' });
+}
+/** 转换 AST */
+export function migrateExpr(state: State, node: MathNode): Result {
+    return migrateNode(state, node, { format: 'expr' });
+}
+
+/** 转换 AST */
+export function migrateNode(state: State, node: MathNode, options: Options): Result {
+    if (isConstantNode(node)) {
+        const { value } = node;
+        if (value == null) return { code: 'nil', literal: null, type: 'nil' };
+        return {
+            code: serialize(value),
+            literal: value,
+            type: typeof value as Result['type'],
+        };
+    }
+    if (isArrayNode(node)) {
+        const { items } = node;
+        const literals = [];
+        const code = [];
+        let literal = true;
+        for (const itemNode of items) {
+            const item = migrateAtomic(state, itemNode);
+            if (item.literal === undefined) {
+                literal = false;
+            } else {
+                literals.push(item.literal);
+            }
+            code.push(item.code);
+        }
+        return {
+            type: 'array',
+            code: `[${code.join(', ')}]`,
+            literal: literal ? literals : undefined,
+        };
+    }
+    if (isObjectNode(node)) {
+        const { properties } = node;
+        const literals: Record<string, VmConst> = {};
+        const code = [];
+        let literal = true;
+        for (const [key, itemNode] of Object.entries(properties)) {
+            const item = migrateAtomic(state, itemNode);
+            if (item.literal === undefined) {
+                literal = false;
+            } else {
+                literals[key] = item.literal;
+            }
+            code.push(`${serializePropName(key)}: ${item.code}`);
+        }
+        return {
+            type: 'record',
+            code: `(${code.join(', ')})`,
+            literal: literal ? literals : undefined,
+        };
+    }
+    if (isSymbolNode(node)) {
+        return migrateSymbol(state, node, true);
+    }
+    if (isAccessorNode(node)) {
+        return migrateAccess(state, node);
+    }
+    if (isConditionalNode(node)) {
+        return migrateCondition(state, node, options);
+    }
+    if (isFunctionNode(node)) {
+        return migrateCall(state, node, options);
+    }
+    if (isOperatorNode(node)) {
+        return migrateOperator(state, node, options);
+    }
+    if (isParenthesisNode(node)) {
+        const { content } = node;
+        const ret = migrateAtomic(state, content);
+        if (options.format === 'no-paren') return ret;
+        return { ...ret, code: `(${ret.code})` };
+    }
+    if (isRelationalNode(node)) {
+        const { conditionals, params } = node;
+        const exprs = [];
+        for (let i = 0; i < conditionals.length; i++) {
+            const fn = conditionals[i]! as OperatorNodeFn;
+            const l = params[i]!;
+            const r = params[i + 1]!;
+            exprs.push(migrateOperator(state, { fn, args: [l, r] }, options));
+        }
+        let code = exprs.join(' && ');
+        if (options.format !== 'no-paren') code = `(${code})`;
+        return {
+            type: 'boolean',
+            code,
+        };
+    }
+    // if (isRangeNode(node)) {
+    // if (isIndexNode(node)) {
+    // if (isFunctionAssignmentNode(node)) {
+    return unsupportedNode(state, node);
+}

package/src/migrator/operator.ts

@@ -0,0 +1,339 @@
+import {
+    type OperatorNodeFn,
+    type OperatorNode,
+    type OperatorNodeMap,
+    isFunctionNode,
+    isSymbolNode,
+    type MathNode,
+    isOperatorNode,
+    isNode,
+} from 'mathjs';
+import { symbolName, constantValue, equalText, scalar } from './utils.js';
+import type { State } from './state.js';
+import type { Options, Result } from './interface.js';
+import { migrateAtomic, migrateExpr } from './node.js';
+import { toBoolean, toNumber } from './to-type.js';
+import { migrateSymbol } from './symbol.js';
+import { operations, serialize } from '@mirascript/mirascript/subtle';
+
+const BINARY_MATH_OPERATORS = {
+    add: [
+        ' + ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.add(${l.code}, ${r.code})`,
+        }),
+    ],
+    subtract: [
+        ' - ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.subtract(${l.code}, ${r.code})`,
+        }),
+    ],
+    multiply: [
+        ' * ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.multiply(${l.code}, ${r.code})`,
+        }),
+    ],
+    dotMultiply: [
+        ' * ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.entrywise_multiply(${l.code}, ${r.code})`,
+        }),
+    ],
+    divide: [
+        ' / ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.multiply(${l.code}, matrix.invert(${r.code}))`,
+        }),
+    ],
+    dotDivide: [
+        ' / ',
+        (l, r) => ({
+            type: l.type === 'array' || r.type === 'array' ? 'array' : l.type && r.type ? 'number' : undefined,
+            code: `matrix.entrywise_divide(${l.code}, ${r.code})`,
+        }),
+    ],
+    mod: [' % '],
+    pow: ['^', false],
+    dotPow: ['^'],
+} satisfies Record<string, [op: string, alt?: ((l: Result, r: Result) => Result) | false]>;
+
+const MATH_FUNCTIONS = {
+    factorial: 'factorial',
+    bitAnd: 'b_and',
+    bitOr: 'b_or',
+    bitNot: 'b_not',
+    bitXor: 'b_xor',
+    leftShift: 'shl',
+    rightArithShift: 'sar',
+    rightLogShift: 'shr',
+} as const;
+
+const BIT_OPS_TO_BOOL_OPS = {
+    bitAnd: '&&',
+    bitOr: '||',
+    bitXor: '!=',
+} as const;
+
+const COMPARE_OPERATORS = {
+    smaller: '<',
+    smallerEq: '<=',
+    larger: '>',
+    largerEq: '>=',
+} as const;
+
+/** 转换为 boolean */
+function b(op: string, state: State, node: MathNode): string {
+    const re = migrateExpr(state, node);
+    return toBoolean(state, scalar(op, state, re)).code;
+}
+
+/** 二元操作 */
+function binary(
+    state: State,
+    l: Result,
+    r: Result,
+    op: (l: Result, r: Result) => Result,
+    alt?: (l: Result, r: Result) => Result,
+): Result {
+    if (l.type && r.type && l.type !== 'array' && r.type !== 'array') {
+        return op(l, r);
+    }
+    if (Array.isArray(l.literal) && l.literal.every((e) => !Array.isArray(e))) {
+        return {
+            type: 'array',
+            code: `${l.code}::map(fn { ${op({ code: 'it' }, r).code} })`,
+        };
+    }
+    if (Array.isArray(r.literal) && r.literal.every((e) => !Array.isArray(e))) {
+        return {
+            type: 'array',
+            code: `${r.code}::map(fn { ${op(l, { code: 'it' }).code} })`,
+        };
+    }
+    if (alt) {
+        return alt(l, r);
+    }
+    return {
+        type: l.type === 'array' || r.type === 'array' ? 'array' : undefined,
+        code: `matrix.entrywise(${l.code}, ${r.code}, fn (a, b) { ${op({ code: 'a' }, { code: 'b' }).code} })`,
+    };
+}
+
+/** 一元操作 */
+function unary(state: State, v: Result, op: (v: Result) => Result): Result {
+    if (v.type && v.type !== 'array') {
+        return op(v);
+    }
+    if (Array.isArray(v.literal) && v.literal.every((e) => !Array.isArray(e))) {
+        return {
+            type: 'array',
+            code: `${v.code}::map(fn { ${op({ code: 'it' }).code} })`,
+        };
+    }
+    return {
+        type: 'array',
+        code: `matrix.entrywise(${v.code}, nil, fn { ${op({ code: 'it' }).code} })`,
+    };
+}
+
+/** 转换 AST */
+export function migrateOperator(
+    state: State,
+    node: Pick<OperatorNode<OperatorNodeMap[OperatorNodeFn], OperatorNodeFn>, 'fn' | 'args'>,
+    options: Options,
+): Result {
+    const fn = node.fn as string;
+    const { args } = node;
+    const a0 = args[0]!;
+    const a1 = args[1]!;
+    const open = options.format === 'paren' ? '(' : '';
+    const close = options.format === 'paren' ? ')' : '';
+
+    switch (fn) {
+        case 'add':
+        case 'subtract':
+        case 'multiply':
+        case 'divide':
+        case 'mod':
+        case 'pow':
+        case 'dotMultiply':
+        case 'dotDivide':
+        case 'dotPow': {
+            const [op, alt] = BINARY_MATH_OPERATORS[fn];
+            return binary(
+                state,
+                migrateExpr(state, a0),
+                migrateExpr(state, a1),
+                (l, r) => ({
+                    type: 'number',
+                    code: `${l.code}${op}${r.code}`,
+                }),
+                alt === false
+                    ? (l, r) => {
+                          state.warn(`'${op.trim()}' 不支持矩阵，计算结果可能不一致`);
+                          return { code: `${l.code} ^ ${r.code}` };
+                      }
+                    : alt,
+            );
+        }
+
+        case 'unaryMinus':
+        case 'unaryPlus': {
+            const op = fn === 'unaryMinus' ? '-' : '+';
+            const f = fn === 'unaryMinus' ? operations.$Neg : operations.$Pos;
+            const exp = migrateExpr(state, a0);
+            if (typeof exp.literal == 'number') {
+                const v = f(exp.literal);
+                return {
+                    type: 'number',
+                    literal: v,
+                    code: serialize(v),
+                };
+            }
+            return unary(state, migrateExpr(state, a0), (v) => ({
+                type: 'number',
+                code: `${op}${v.code}`,
+            }));
+        }
+
+        case 'factorial':
+        case 'bitAnd':
+        case 'bitOr':
+        case 'bitXor':
+        case 'bitNot':
+        case 'leftShift':
+        case 'rightArithShift':
+        case 'rightLogShift': {
+            const f = MATH_FUNCTIONS[fn];
+            const codes = args.map((a) => {
+                const r = migrateAtomic(state, a);
+                return scalar(f, state, r);
+            });
+            if (codes.every((c) => c.type === 'boolean' || c.as_boolean) && fn in BIT_OPS_TO_BOOL_OPS) {
+                const boolOp = BIT_OPS_TO_BOOL_OPS[fn as keyof typeof BIT_OPS_TO_BOOL_OPS];
+                const code = codes.map((c) => toBoolean(state, c).code).join(` ${boolOp} `);
+                return {
+                    type: 'number',
+                    code: `to_number(${code})`,
+                    as_boolean: `${open}${code}${close}`,
+                };
+            }
+            return {
+                type: 'number',
+                code: `${f}(${codes.map((c) => c.code).join(', ')})`,
+            };
+        }
+
+        case 'ctranspose': {
+            const p = migrateAtomic(state, a0);
+            state.loose();
+            return {
+                type: 'array',
+                code: `transpose(${p.code})`,
+            };
+        }
+
+        case 'and':
+            return {
+                type: 'boolean',
+                code: `${open}${b('&&', state, a0)} && ${b('&&', state, a1)}${close}`,
+            };
+        case 'or':
+            return {
+                type: 'boolean',
+                code: `${open}${b('||', state, a0)} || ${b('||', state, a1)}${close}`,
+            };
+        case 'xor': {
+            return {
+                type: 'boolean',
+                code: `${open}${b('!=', state, a0)} != ${b('!=', state, a1)}${close}`,
+            };
+        }
+        case 'not': {
+            if (isFunctionNode(a0) && symbolName(a0.fn) === 'equalText' && a0.args.length === 2) {
+                const p = equalText(state, '!=', a0.args[0]!, a0.args[1]!);
+                return {
+                    type: p.type,
+                    code: `${open}${p.code}${close}`,
+                };
+            }
+            if (isOperatorNode(a0) && (a0.op === '==' || a0.op === '!=')) {
+                const c = a0.clone();
+                c.op = a0.op === '==' ? '!=' : '==';
+                return migrateOperator(state, c, {
+                    ...options,
+                    format: options.format === 'no-paren' ? 'no-paren' : 'paren',
+                });
+            }
+            return {
+                type: 'boolean',
+                code: `${open}!${b('!', state, a0)}${close}`,
+            };
+        }
+
+        case 'equal':
+        case 'unequal': {
+            const op = fn === 'equal' ? '==' : '!=';
+            const c0 = constantValue(a0);
+            const c1 = constantValue(a1);
+            if (c0 === null || c1 === null) {
+                state.loose();
+                const p0 = c0 === null ? { code: `nil` } : scalar(op, state, migrateExpr(state, a0));
+                const p1 = c1 === null ? { code: `nil` } : scalar(op, state, migrateExpr(state, a1));
+                return {
+                    type: 'boolean',
+                    code: `${open}${p0.code} ${op} ${p1.code}${close}`,
+                };
+            }
+            // PI, E 与常量比较时，不进行转换
+            const preserveConst = typeof c0 == 'number' || typeof c1 == 'number';
+
+            const a = (a: MathNode | Result) => {
+                let r;
+                if (!isNode(a)) {
+                    r = a;
+                } else if (isSymbolNode(a)) {
+                    r = migrateSymbol(state, a, !preserveConst);
+                } else {
+                    r = migrateExpr(state, a);
+                }
+                return r;
+            };
+
+            return binary(state, a(a0), a(a1), (l, r) => {
+                return {
+                    type: 'boolean',
+                    code: `${toNumber(state, l).code} ${op} ${toNumber(state, r).code}`,
+                };
+            });
+        }
+        case 'smaller':
+        case 'smallerEq':
+        case 'larger':
+        case 'largerEq': {
+            const op = COMPARE_OPERATORS[fn];
+            return {
+                type: 'boolean',
+                code: `${open}${scalar(op, state, migrateExpr(state, a0)).code} ${op} ${scalar(op, state, migrateExpr(state, a1)).code}${close}`,
+            };
+        }
+
+        default: {
+            state.err(`不支持的运算符: ${fn}`);
+            if (a1) {
+                return {
+                    code: `${open}${migrateExpr(state, a0).code} /* ${fn} */ ${migrateExpr(state, a1).code}${close}`,
+                };
+            } else {
+                return { code: `${open}${migrateExpr(state, a0).code} /* ${fn} */${close}` };
+            }
+        }
+    }
+}

package/src/migrator/parser.ts

@@ -0,0 +1,106 @@
+import { create, parseDependencies, type ParseFunction } from 'mathjs';
+
+/** Allow unicode [_$\p{L}\p{Nl}] as symbol */
+function patchParse(parse: ParseFunction): void {
+    parse.isValidLatinOrGreek = function (c) {
+        // eslint-disable-next-line unicorn/no-hex-escape
+        return /^[A-Z_a-z$\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u08A0-\u08B4\u08B6-\u08C7\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C88\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\u9FFC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7BF\uA7C2-\uA7CA\uA7F5-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]$/.test(
+            c,
+        );
+    };
+
+    parse.isValidMathSymbol = function (high, low) {
+        switch (high) {
+            case '\uD800':
+                return /^[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]$/.test(
+                    low,
+                );
+            case '\uD801':
+                return /^[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]$/.test(
+                    low,
+                );
+            case '\uD802':
+                return /^[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]$/.test(
+                    low,
+                );
+            case '\uD803':
+                return /^[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDE80-\uDEA9\uDEB0\uDEB1\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDFB0-\uDFC4\uDFE0-\uDFF6]$/.test(
+                    low,
+                );
+            case '\uD804':
+                return /^[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61]$/.test(
+                    low,
+                );
+            case '\uD805':
+                return /^[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A]$/.test(
+                    low,
+                );
+            case '\uD806':
+                return /^[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEC0-\uDEF8]$/.test(
+                    low,
+                );
+            case '\uD807':
+                return /^[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDFB0]$/.test(
+                    low,
+                );
+            case '\uD808':
+                return /^[\uDC00-\uDF99]$/.test(low);
+            case '\uD809':
+                return /^[\uDC00-\uDC6E\uDC80-\uDD43]$/.test(low);
+            case '\uD80D':
+                return /^[\uDC00-\uDC2E]$/.test(low);
+            case '\uD811':
+                return /^[\uDC00-\uDE46]$/.test(low);
+            case '\uD81A':
+                return /^[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]$/.test(
+                    low,
+                );
+            case '\uD81B':
+                return /^[\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]$/.test(low);
+            case '\uD821':
+                return /^[\uDC00-\uDFF7]$/.test(low);
+            case '\uD823':
+                return /^[\uDC00-\uDCD5\uDD00-\uDD08]$/.test(low);
+            case '\uD82C':
+                return /^[\uDC00-\uDD1E\uDD50-\uDD52\uDD64-\uDD67\uDD70-\uDEFB]$/.test(low);
+            case '\uD82F':
+                return /^[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]$/.test(low);
+            case '\uD835':
+                return /^[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]$/.test(
+                    low,
+                );
+            case '\uD838':
+                return /^[\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDEC0-\uDEEB]$/.test(low);
+            case '\uD83A':
+                return /^[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]$/.test(low);
+            case '\uD83B':
+                return /^[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]$/.test(
+                    low,
+                );
+            case '\uD869':
+                return /^[\uDC00-\uDEDD\uDF00-\uDFFF]$/.test(low);
+            case '\uD86D':
+                return /^[\uDC00-\uDF34\uDF40-\uDFFF]$/.test(low);
+            case '\uD86E':
+                return /^[\uDC00-\uDC1D\uDC20-\uDFFF]$/.test(low);
+            case '\uD873':
+                return /^[\uDC00-\uDEA1\uDEB0-\uDFFF]$/.test(low);
+            case '\uD87A':
+                return /^[\uDC00-\uDFE0]$/.test(low);
+            case '\uD87E':
+                return /^[\uDC00-\uDE1D]$/.test(low);
+            case '\uD884':
+                return /^[\uDC00-\uDF4A]$/.test(low);
+            default:
+                return (
+                    /^[\uDC00-\uDFFF]$/.test(low) &&
+                    /^[\uD80C\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883]$/.test(
+                        high,
+                    )
+                );
+        }
+    };
+}
+
+export const { parse } = create(parseDependencies!, { matrix: 'Array' });
+patchParse(parse);

package/src/migrator/special.ts

@@ -0,0 +1,30 @@
+import type { MathNode } from 'mathjs';
+import { parse } from './parser.js';
+
+const pairs: ReadonlyArray<{ find: string; mathjs: MathNode; mira: string }> = (
+    [
+        [
+            'subset',
+            `subset(subset(subset(subset(zeros(6, 6), index([1, 2, 3], [1, 2, 3]), $yp * diag(ones(3))), index([4, 5, 6], [4, 5, 6]), $ys * diag(ones(3))), index([4, 5, 6], [1, 2, 3]), $yc * diag(ones(3))), index([1, 2, 3], [4, 5, 6]), $yc * diag(ones(3)))`,
+            `
+            let d0 = matrix.diagonal([$yp, $yp, $yp, $ys, $ys, $ys]);
+            let d1 = matrix.diagonal([$yc, $yc, $yc], -3);
+            let d2 = matrix.diagonal([$yc, $yc, $yc], +3);
+            d0::matrix.add(d1)::matrix.add(d2)`,
+        ],
+    ] satisfies ReadonlyArray<[find: string, mathjs: string, mira: string]>
+).map(([find, mathjs, mira]) => ({
+    find,
+    mathjs: parse(mathjs),
+    mira: mira.trimStart().replaceAll(/^\s+/gm, ''),
+}));
+
+/** 特殊转换逻辑 */
+export function specialMigrate(expression: string, node: MathNode): string | undefined {
+    for (const pair of pairs) {
+        if (expression.includes(pair.find) && pair.mathjs.equals(node)) {
+            return pair.mira;
+        }
+    }
+    return undefined;
+}