xmmath 1.0.8 → 1.0.9

package/src/main.ts

@@ -28,13 +28,16 @@ const Segmenter = Intl.Segmenter;
 const segmenter = new Segmenter("emoji", { granularity: "grapheme" });
 
 type vtype = "" | "str" | "v" | "f" | "blank" | "group" | "group1" | "sharp"; // group1组合基本类型，提高优先级
-type tree = { type: vtype; value: string; children?: tree; esc?: boolean }[];
+type tree = { type: vtype; value: string; children?: tree; esc?: boolean; kh?: string; src?: string }[];
 
 function ast(str: string) {
     let v = /[a-zA-Z]/;
-    let kh = /[\(\)]/;
-    let blank = /[ \t\n\r]+/;
+    let kh = /[\(\)\{\}\[\]]/;
+    const khl = /[\(\{\[]/;
+    const khr = /[\)\}\]]/;
+    let blank = /^[ \t\n\r]+$/;
     let type: vtype = "";
+    let ignore: false | "line" | "block" = false;
     let o: tree = [];
     let p_tree: { tree: tree; close: boolean }[] = [];
     let now_tree = o;
@@ -49,8 +52,9 @@ function ast(str: string) {
     let rkh_stack: number[] = [];
     for (let i = 0; i < str.length; i++) {
         const t = str[i];
+        const last = str[i - 1];
         // 字符
-        if (t == '"' && str[i - 1] != "\\") {
+        if (t === '"' && last != "\\" && !ignore) {
             if (type != "str") {
                 type = "str";
             } else {
@@ -58,31 +62,71 @@ function ast(str: string) {
             }
             continue;
         }
-        if (type == "str") {
+        if (type === "str") {
             continue;
+        } else {
+            const next = str[i + 1];
+            if (t === "/" && next === "/") ignore = "line";
+            if (ignore === "line" && t === "\n") {
+                i++;
+                ignore = false;
+                continue;
+            }
+            if (t === "/" && next === "*") ignore = "block";
+            if (ignore === "block" && t === "*" && next === "/") {
+                i++;
+                ignore = false;
+                continue;
+            }
         }
 
-        if (t == "(") {
+        if (t.match(khl) && !ignore && last != "\\") {
             lkh_stack.push(i);
         }
-        if (t == ")") {
-            if (lkh_stack.length == 0) {
+        if (t.match(khr) && !ignore && last != "\\") {
+            if (lkh_stack.length === 0) {
                 rkh_stack.push(i);
             } else {
-                if (str[i - 1] != "\\") lkh_stack.pop();
+                lkh_stack.pop();
             }
         }
     }
+    ignore = false;
+
+    let strl = init_c.emoji ? init_c.emoji(str) : Array.from(segmenter.segment(str)).map((w) => w.segment);
+    let strl2 = [];
+    for (let i of strl) {
+        if (i.length > 1 && i.includes(",")) strl2.push(...i);
+        else strl2.push(i);
+    }
+    strl = strl2;
 
-    let strl = init_c.emoji
-        ? typeof init_c.emoji === "boolean"
-            ? Array.from(segmenter.segment(str)).map((w) => w.segment)
-            : init_c.emoji(str)
-        : [...str];
     for (let i = 0; i < strl.length; i++) {
         const t = strl[i];
+        const next = strl[i + 1];
+        // 注释
+        if (t === "/" && next === "/") ignore = "line";
+        if (ignore === "line" && t === "\n") {
+            i++;
+            ignore = false;
+            continue;
+        }
+        if (t === "/" && next === "*") ignore = "block";
+        if (ignore === "block" && t === "*" && next === "/") {
+            i++;
+            ignore = false;
+            continue;
+        }
+
+        if (ignore) continue;
+
+        // 空白
+        if (type === "blank" && !t.match(blank)) {
+            now_tree.push({ type, value: "" });
+            type = "";
+        }
         // 字符
-        if (t == '"' && strl[i - 1] != "\\") {
+        if (t === '"' && strl[i - 1] != "\\") {
             if (type != "str") {
                 type = "str";
             } else {
@@ -101,13 +145,9 @@ function ast(str: string) {
         if (t.match(blank)) {
             type = "blank";
         }
-        if (type == "blank" && !t.match(blank)) {
-            now_tree.push({ type, value: "" });
-            type = "";
-        }
 
         if (t === "#") {
-            now_tree.push({ type: "sharp", value: t });
+            now_tree.push({ type: "sharp", value: "" });
             continue;
         }
 
@@ -139,22 +179,27 @@ function ast(str: string) {
             tmp_str = "";
         }
 
-        if (t == "(") {
-            if (lkh_stack.includes(i) || strl[i - 1] == "\\") {
+        if (t.match(khl)) {
+            if (strl[i - 1] === "\\") {
+                now_tree.push({ type: "v", value: t, esc: true });
+            } else if (lkh_stack.includes(i)) {
                 now_tree.push({ type: "v", value: t });
             } else {
                 p_tree.push({ tree: now_tree, close: false });
-                now_tree.push({ type: "group", value: tmp_str, children: [] });
+                now_tree.push({ type: "group", value: tmp_str, children: [], kh: t });
                 now_tree = now_tree.at(-1).children;
                 tmp_str = "";
                 continue;
             }
         }
-        if (t == ")") {
-            if (p_tree.at(-1)) {
-                if (p_tree.at(-1).close == false) {
+        if (t.match(khr)) {
+            if (strl[i - 1] === "\\") {
+                now_tree.push({ type: "v", value: t, esc: true });
+            } else if (p_tree.at(-1)) {
+                if (p_tree.at(-1).close === false) {
                     p_tree.at(-1).close = true;
                     now_tree = p_tree.at(-1).tree;
+                    now_tree.at(-1).kh += t;
                     p_tree.pop();
                     continue;
                 }
@@ -172,33 +217,42 @@ import symbols from "./symbols.json?raw";
 let s = JSON.parse(symbols);
 
 // symbols路径简写
-let ss: { [id: string]: string } = {};
-for (let i in s) {
-    if (typeof s[i] == "string") {
-        ss[i] = s[i];
-    } else {
-        for (let objOrStr of s[i]) {
-            // 第二层的array
-            if (typeof objOrStr == "string") {
-                ss[i] = objOrStr;
-            } else {
-                if (!ss[i]) ss[i] = objOrStr[Object.keys(objOrStr)[0]];
-                for (let j in objOrStr) {
-                    // 第三层的obj
-                    ss[`${i}.${j}`] = objOrStr[j];
-                    // 允许部分索引，但要保证唯一
-                    let l = j.split(".");
-                    for (let n = 1; n < l.length; n++) {
-                        let shotKey = l.slice(0, n).join(".");
-                        if (!objOrStr[shotKey]) {
-                            ss[`${i}.${shotKey}`] = objOrStr[j];
+
+function simple_dot(s: any) {
+    const ss: { [id: string]: string } = {};
+    for (let i in s) {
+        if (typeof s[i] == "string") {
+            ss[i] = s[i];
+        } else {
+            for (let objOrStr of s[i]) {
+                // 第二层的array
+                if (typeof objOrStr == "string") {
+                    ss[i] = objOrStr;
+                } else {
+                    if (!ss[i]) ss[i] = objOrStr[Object.keys(objOrStr)[0]];
+                    for (let j in objOrStr) {
+                        // 第三层的obj
+                        ss[`${i}.${j}`] = objOrStr[j];
+                        // 允许部分索引，但要保证唯一
+                        let l = j.split(".");
+                        for (let n = 1; n < l.length; n++) {
+                            let shotKey = l.slice(0, n).join(".");
+                            if (!objOrStr[shotKey]) {
+                                ss[`${i}.${shotKey}`] = objOrStr[j];
+                            }
                         }
                     }
                 }
             }
         }
     }
+    return ss;
 }
+let ss = simple_dot(s);
+
+import emoji from "./emoji.json?raw";
+/** @see https://github.com/typst/typst/blob/v0.11.1/crates/typst/src/symbols/emoji.rs */
+let emojix = simple_dot(JSON.parse(emoji));
 
 let shorthand = {
     "->": "arrow.r",
@@ -251,33 +305,50 @@ for (let i in shorthand) {
     }
 }
 
-const delimPair = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] };
+const delimPair = {
+    "(": ["(", ")"],
+    "[": ["[", "]"],
+    "{": ["{", "}"],
+    "|": ["|", "|"],
+    "||": ["‖", "‖"],
+    "": ["", ""],
+};
+
+function delim(dic: fdic, _default: string) {
+    const d = get_value(dic, "delim") as string;
+    let x = "";
+    if (d !== null)
+        if (d === undefined) x = _default;
+        else x = d;
+    return delimPair[x] as [string, string];
+}
 
 let f: {
-    [name: string]: (attr?: tree[], dic?: fdic, array?: tree[][], e?: fonts) => MathMLElement | DocumentFragment;
+    [name: string]: (attr: tree[], dic?: fdic, e?: fonts) => MathMLElement | DocumentFragment;
 } = {
-    accent: (attr: tree[], dic: fdic) => {
+    accent: (attr: tree[], dic: fdic, e) => {
         let base = createMath("mrow");
-        base.append(render(attr[0]));
+        base.append(render(attr[0], e));
         let a = createMath("mrow");
-        a.append(render(attr[1]));
+        a.append(render(attr[1], e));
+        a.children[0].innerHTML = accent_match_str(a.children[0].innerHTML);
         let over = createMath("mover");
         over.setAttribute("accent", "true");
         over.append(base, a);
         return over;
     },
-    attach: (attr: tree[], dic: fdic) => {
+    attach: (attr: tree[], dic: fdic, e) => {
         let base = createMath("mrow");
         base.append(render(attr[0]));
         let el: MathMLElement;
         let tl = createMath("mrow");
-        if (dic.tl) tl.append(render(dic.tl));
+        if (dic.tl) tl.append(render(dic.tl, e));
         let bl = createMath("mrow");
-        if (dic.bl) bl.append(render(dic.bl));
+        if (dic.bl) bl.append(render(dic.bl, e));
         let tr = createMath("mrow");
-        if (dic.tr) tr.append(render(dic.tr));
+        if (dic.tr) tr.append(render(dic.tr, e));
         let br = createMath("mrow");
-        if (dic.br) br.append(render(dic.br));
+        if (dic.br) br.append(render(dic.br, e));
         if (dic.tl || dic.bl || dic.tr || dic.br) {
             if (dic.tl || dic.bl) {
                 el = createMath("mmultiscripts");
@@ -301,28 +372,28 @@ let f: {
                 uo.append(el);
             }
             let t = createMath("mrow");
-            if (dic.t) t.append(render(dic.t));
+            if (dic.t) t.append(render(dic.t, e));
             let b = createMath("mrow");
-            if (dic.b) b.append(render(dic.b));
+            if (dic.b) b.append(render(dic.b, e));
             uo.append(b, t);
             el = uo;
         }
         return el;
     },
-    scripts: (attr: tree[], dic: fdic) => {
-        return render(attr[0]);
+    scripts: (attr: tree[], dic: fdic, e) => {
+        return render(attr[0], e);
     },
-    limits: (attr: tree[], dic: fdic) => {
-        return render(attr[0]);
+    limits: (attr: tree[], dic: fdic, e) => {
+        return render(attr[0], e);
     },
-    binom: (attr: tree[], dic: fdic) => {
+    binom: (attr: tree[], dic: fdic, e) => {
         let row = createMath("mrow");
         let a = createMath("mrow");
-        a.append(render(attr[0]));
+        a.append(render(attr[0], e));
         let b = createMath("mrow");
         const s: tree = [];
         for (let x of attr.slice(1)) s.push(...x, dh);
-        b.append(render(s.slice(0, -1)));
+        b.append(render(s.slice(0, -1), e));
         let f = createMath("mfrac", null, { linethickness: "0" });
         f.append(a, b);
         let l = createMath("mo", "(");
@@ -330,7 +401,7 @@ let f: {
         row.append(l, f, r);
         return row;
     },
-    cancel: (attr: tree[], dic: fdic) => {
+    cancel: (attr: tree[], dic: fdic, e) => {
         let r = createMath("mrow");
         const bg = (x: boolean) =>
             `linear-gradient(to ${
@@ -345,85 +416,74 @@ let f: {
             s = bg(true);
         }
         r.style.backgroundImage = s;
-        r.append(render(attr[0]));
+        r.append(render(attr[0], e));
         return r;
     },
-    cases: (attr: tree[], dic: fdic) => {
+    cases: (attr: tree[], dic: fdic, e) => {
         let r = createMath("mrow");
-        const d = dic?.delim?.[0]?.value || "{";
-        let t = f.x_table(attr, { cases: [] }) as MathMLElement;
-        const gap = dic?.gap?.[0]?.value || "0.5em";
+        const d = delim(dic, "{");
+        let t = f.x_table(attr, { cases: [] }, e) as MathMLElement;
+        const gap = (get_value(dic, "gap") as string) || "0.5em";
         t.setAttribute("rowspacing", gap);
         if (is_true(dic?.reverse)) {
-            const l = createMath("mo", delimPair[d][1]);
+            const l = createMath("mo", d[1]);
             r.append(t, l);
         } else {
-            const l = createMath("mo", d);
+            const l = createMath("mo", d[0]);
             r.append(l, t);
         }
         return r;
     },
-    frac: (attr: tree[], dic: fdic) => {
-        console.log(attr);
-
+    frac: (attr: tree[], dic: fdic, e) => {
         let a = createMath("mrow");
-        a.append(render(attr[0]));
+        a.append(render(attr[0], e));
         let b = createMath("mrow");
-        b.append(render(attr[1]));
+        b.append(render(attr[1], e));
         let f = createMath("mfrac");
         f.append(a, b);
         return f;
     },
-    lr: (attr: tree[], dic: fdic) => {
-        let list = attr[0];
-        let start: { c: tree; n: number }, end: { c: tree; n: number };
-        for (let i = 0; i < list.length; i++) {
-            const el = list[i];
-            if (el.type == "blank") continue;
-            start = { c: [el], n: i };
-            break;
-        }
-        for (let i = list.length - 1; i >= 0; i--) {
-            const el = list[i];
-            if (el.type == "blank") continue;
-            end = { c: [el], n: i };
-            break;
-        }
-        const size = dic?.size?.[0]?.value;
-        const l = render(start.c);
-        const r = render(end.c);
-        if (size && size != "auto") {
-            const lm = l.querySelector("mo");
-            const rm = r.querySelector("mo");
-            lm.setAttribute("maxsize", size);
-            lm.setAttribute("minsize", size);
-            rm.setAttribute("maxsize", size);
-            rm.setAttribute("minsize", size);
-        }
-        const c = render(list.slice(start.n + 1, end.n));
+    lr: (attr: tree[], dic: fdic, e) => {
+        let list = attr_join(attr.map((i) => transfer_kh(i)));
+        const tList = trim(list);
+
+        const size = get_value(dic, "size") as string;
+        const c = render(tList, e);
         const row = createMath("mrow");
-        row.append(l, c, r);
+        row.append(c);
+        if (size && size != "auto") {
+            const lm = row.children[0];
+            const rm = row.children[row.children.length - 1];
+            lm?.setAttribute("maxsize", size);
+            lm?.setAttribute("minsize", size);
+            rm?.setAttribute("maxsize", size);
+            rm?.setAttribute("minsize", size);
+        }
         return row;
     },
     mid: (attr: tree[], dic: fdic) => {
         const o = createMath("mo", attr?.[0]?.[0]?.value, { stretchy: "true" });
         return o;
     },
-    mat: (attr: tree[], dic: fdic, array: tree[][]) => {
-        let d = dic?.delim?.[0]?.value || "(";
-        let o = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] };
+    mat: (attr: tree[] | tree[][], dic: fdic, e) => {
+        let d = delim(dic, "(");
         let row = createMath("mrow");
-        let l = createMath("mo", o[d][0]);
-        let r = createMath("mo", o[d][1]);
+        let l = createMath("mo", d[0]);
+        let r = createMath("mo", d[1]);
         let t = createMath("mtable");
-        let augment = lan_dic(dic?.augment?.[0].children);
+        let array: tree[][];
+        if ((attr[0][0] as tree[0])?.type) array = [attr as tree[]];
+        else array = attr as tree[][];
+
+        let augment = get_value(dic, "augment");
         if (augment) {
             let xa = NaN;
             let ya = NaN;
-            if (Array.isArray(augment)) {
-                xa = Number((augment as tree).map((i) => i.value).join(""));
+            if (typeof augment != "object") {
+                xa = Number(augment);
             } else {
-                ya = Number((augment["hline"] as tree).map((i) => i.value).join(""));
+                if (augment["hline"]) ya = Number((augment["hline"] as tree).map((i) => i.value).join(""));
+                if (augment["vline"]) xa = Number((augment["vline"] as tree).map((i) => i.value).join(""));
             }
             if (xa < 0) xa = array[0].length + xa;
             if (ya < 0) ya = array.length + ya;
@@ -439,18 +499,17 @@ let f: {
                 t.setAttribute("columnlines", l.map((i) => (i ? "solid" : "none")).join(" "));
             }
         }
-        const gap = dic?.gap?.[0]?.value;
-        const rowgap = dic?.["row-gap"]?.[0]?.value;
-        const colgap = dic?.["column-gap"]?.[0]?.value;
+        const gap = get_value(dic, "gap") as string;
+        const rowgap = get_value(dic, "row-gap") as string;
+        const colgap = get_value(dic, "column-gap") as string;
         t.setAttribute("columnspacing", colgap || gap || "0.5em");
         t.setAttribute("rowspacing", rowgap || gap || "0.5em");
 
         for (let i of array) {
             let tr = createMath("mtr");
-            if (!i.length) continue;
             for (let j of i) {
                 let td = createMath("mtd");
-                td.append(render(j));
+                td.append(render(j, e));
                 tr.append(td);
             }
             t.append(tr);
@@ -458,41 +517,41 @@ let f: {
         row.append(l, t, r);
         return row;
     },
-    root: (attr: tree[], dic: fdic) => {
+    root: (attr: tree[], dic: fdic, e) => {
         let row = createMath("mrow");
-        row.append(render(attr[0]));
+        row.append(render(attr[0], e));
         let base = createMath("mrow");
-        base.append(render(attr[1]));
+        base.append(render(attr[1], e));
         let root = createMath("mroot");
         root.append(base, row);
         return root;
     },
-    sqrt: (attr: tree[], dic: fdic) => {
-        return f.root([[], attr[0]], null);
+    sqrt: (attr: tree[], dic: fdic, e) => {
+        return f.root([[], attr[0]], null, e);
     },
-    display: (attr: tree[], dic: fdic) => {
+    display: (attr: tree[], dic: fdic, e) => {
         let m = createMath("mrow", null, { displaystyle: "true" });
-        m.append(render(attr[0]));
+        m.append(render(attr[0], e));
         return m;
     },
-    inline: (attr: tree[], dic: fdic) => {
+    inline: (attr: tree[], dic: fdic, e) => {
         let m = createMath("mrow", null, { displaystyle: "false", scriptlevel: "0" });
-        m.append(render(attr[0]));
+        m.append(render(attr[0], e));
         return m;
     },
-    script: (attr: tree[], dic: fdic) => {
+    script: (attr: tree[], dic: fdic, e) => {
         let m = createMath("mrow", null, { displaystyle: "false", scriptlevel: "1" });
-        m.append(render(attr[0]));
+        m.append(render(attr[0], e));
         return m;
     },
-    sscript: (attr: tree[], dic: fdic) => {
+    sscript: (attr: tree[], dic: fdic, e) => {
         let m = createMath("mrow", null, { displaystyle: "false", scriptlevel: "2" });
-        m.append(render(attr[0]));
+        m.append(render(attr[0], e));
         return m;
     },
-    upright: (attr: tree[], dic: fdic) => {
+    upright: (attr: tree[], dic: fdic, e) => {
         let r = createMath("mrow");
-        r.append(render(attr[0]));
+        r.append(render(attr[0], e));
         r.querySelectorAll("mi").forEach((el) => {
             if (!el.getAttribute(mathvariant)) el.setAttribute(mathvariant, "normal");
         });
@@ -501,80 +560,75 @@ let f: {
         });
         return r;
     },
-    italic: (attr: tree[], dic: fdic) => {
+    italic: (attr: tree[], dic: fdic, e) => {
         let r = createMath("mrow");
+        r.append(render(attr[0], e));
         r.querySelectorAll("mi").forEach((el) => {
             if (!el.getAttribute(mathvariant)) el.setAttribute(mathvariant, "italic");
         });
         r.querySelectorAll("ms").forEach((el) => {
             if (!el.getAttribute(mathvariant)) el.setAttribute(mathvariant, "italic");
         });
-        r.append(render(attr[0]));
         return r;
     },
-    bold: (attr: tree[], dic: fdic) => {
+    bold: (attr: tree[], dic: fdic, e) => {
         let r = createMath("mrow");
         r.style.fontWeight = "bold";
-        r.append(render(attr[0]));
+        r.append(render(attr[0], e));
         return r;
     },
-    op: (attr: tree[], dic: fdic, a, e) => {
+    op: (attr: tree[], dic: fdic, e) => {
         let f = createMath("mrow");
         let str = createMath("ms");
         str.append(render(attr[0], e));
         f.append(str);
         return f;
     },
-    underline: (attr: tree[], dic: fdic) => {
-        return underover_f("under", attr[0], "_", attr?.[1]);
+    underline: (attr: tree[], dic: fdic, e) => {
+        return underover_line_f("under", attr[0], e);
     },
-    overline: (attr: tree[], dic: fdic) => {
-        return underover_f("over", attr[0], "‾", attr?.[1]);
+    overline: (attr: tree[], dic: fdic, e) => {
+        return underover_line_f("over", attr[0], e);
     },
-    underbrace: (attr: tree[], dic: fdic) => {
-        return underover_f("under", attr[0], "⏟", attr?.[1]);
+    underbrace: (attr: tree[], dic: fdic, e) => {
+        return underover_f("under", attr[0], "⏟", attr?.[1], e);
     },
-    overbrace: (attr: tree[], dic: fdic) => {
-        return underover_f("over", attr[0], "⏞", attr?.[1]);
+    overbrace: (attr: tree[], dic: fdic, e) => {
+        return underover_f("over", attr[0], "⏞", attr?.[1], e);
     },
-    underbracket: (attr: tree[], dic: fdic) => {
-        return underover_f("under", attr[0], "⎵", attr?.[1]);
+    underbracket: (attr: tree[], dic: fdic, e) => {
+        return underover_f("under", attr[0], "⎵", attr?.[1], e);
     },
-    overbracket: (attr: tree[], dic: fdic) => {
-        return underover_f("over", attr[0], "⎴", attr?.[1]);
+    overbracket: (attr: tree[], dic: fdic, e) => {
+        return underover_f("over", attr[0], "⎴", attr?.[1], e);
     },
-    serif: (attr: tree[], dic: fdic) => {
+    serif: (attr: tree[]) => {
         return render(attr[0], "serif");
     },
-    sans: (attr: tree[], dic: fdic) => {
+    sans: (attr: tree[]) => {
         return render(attr[0], "sans");
     },
-    frak: (attr: tree[], dic: fdic) => {
+    frak: (attr: tree[]) => {
         return render(attr[0], "frak");
     },
-    mono: (attr: tree[], dic: fdic) => {
+    mono: (attr: tree[]) => {
         return render(attr[0], "mono");
     },
-    bb: (attr: tree[], dic: fdic) => {
+    bb: (attr: tree[]) => {
         return render(attr[0], "bb");
     },
-    cal: (attr: tree[], dic: fdic) => {
+    cal: (attr: tree[]) => {
         return render(attr[0], "cal");
     },
-    vec: (attr: tree[], dic: fdic) => {
-        let d = dic?.delim?.[0]?.value || "(";
-        let o = delimPair;
+    vec: (attr: tree[], dic: fdic, e) => {
+        let d = delim(dic, "(");
         let row = createMath("mrow");
-        let l = createMath("mo", o[d][0]);
-        let r = createMath("mo", o[d][1]);
-        let t = createMath("mtable");
-        const gap = dic?.gap?.[0]?.value || "0.5em";
+        let l = createMath("mo", d[0]);
+        let r = createMath("mo", d[1]);
+        let t = x_table(attr, e);
+        const gap = (get_value(dic, "gap") as string) || "0.5em";
         t.setAttribute("rowspacing", gap);
-        for (let i of attr) {
-            let tr = createMath("mtr");
-            tr.append(render(i));
-            t.append(tr);
-        }
+        t.setAttribute("columnspacing", "0.5em");
         row.append(l, t, r);
         return row;
     },
@@ -584,56 +638,52 @@ let f: {
     // 额外
     //
     x_table: (attr: tree[], dic: fdic) => {
-        let max = 0;
-        let t = createMath("mtable");
-        for (let i of attr) {
-            let r = createMath("mtr");
-
-            // 按&拆分
-            let result: tree[] = [];
-            let tmp_group: tree = [];
-            for (let n = 0; n < i.length; n++) {
-                if (!i[n].esc && i[n].value == "&") {
-                    if (tmp_group.length > 0) {
-                        result.push(tmp_group);
-                        tmp_group = [];
-                    }
-                } else {
-                    tmp_group.push(i[n]);
-                }
-            }
-            if (tmp_group.length > 0) {
-                result.push(tmp_group);
-            }
-
-            if (result.length > max) max = result.length;
+        let t = x_table(attr);
+        if (dic.cases) t.setAttribute("columnalign", "left");
+        return t;
+    },
+};
 
-            for (let i of result) {
-                let d = createMath("mtd");
-                r.append(d);
-                d.append(render(i));
+function x_table(trees: tree[], e?: fonts) {
+    let max = 0;
+    let t = createMath("mtable");
+    for (let i of trees) {
+        const n = i.filter((x) => eqq(x, v_f("&"))).length;
+        if (n > max) max = n;
+    }
+    for (let i of trees) {
+        let r = createMath("mtr");
+
+        // 按&拆分
+        let result: tree[] = [[]];
+        for (let n = 0; n < i.length; n++) {
+            if (eqq(i[n], v_f("&"))) {
+                result.push([]);
+            } else {
+                result.at(-1).push(i[n]);
             }
-
-            t.append(r);
         }
-        let al = [];
-        if (dic.cases) {
-            // cases
-            al.push("left");
-        } else {
-            // 其他换行对齐 交替
-            for (let i = 0; i < max; i++) {
-                if (i % 2 == 0) {
-                    al.push("right");
-                } else {
-                    al.push("left");
-                }
+        for (let i of result) {
+            let d = createMath("mtd");
+            r.append(d);
+            d.append(render(i, e));
+        }
+
+        // 交替对齐
+        const al = [];
+        for (let i = 0; i <= max; i++) {
+            if (i % 2 === 0) {
+                al.push("right");
+            } else {
+                al.push("left");
             }
         }
         t.setAttribute("columnalign", al.join(" "));
-        return t;
-    },
-};
+        t.setAttribute("columnspacing", "0");
+        t.append(r);
+    }
+    return t;
+}
 
 let opl: { id: string; str?: string; limits?: boolean }[] = [
     { id: "arccos" },
@@ -677,14 +727,16 @@ let opl: { id: string; str?: string; limits?: boolean }[] = [
     { id: "tanh" },
     { id: "liminf", str: "lim inf", limits: true },
     { id: "limsup", str: "lim sup", limits: true },
+    { id: "dif", str: "d" },
+    { id: "Dif", str: "D" },
 ];
 function op_f() {
     for (let i of opl) {
-        f[i.id] = (attr: tree[], a, b, e) => {
-            let s = f.op([[{ type: "str", value: i.str || i.id }]], {}, null, e);
+        f[i.id] = (attr: tree[], a, e) => {
+            let s = f.op([[{ type: "str", value: i.str || i.id }]], {}, e);
             if (attr) {
                 let f = document.createDocumentFragment();
-                f.append(s, kh(attr[0]));
+                f.append(s, kh(attr_join(attr)));
                 return f;
             } else {
                 return s;
@@ -718,6 +770,78 @@ for (let i in ss) {
     }
 }
 
+function accent_match_str(c: string) {
+    switch (c) {
+        case "\u{0300}":
+        case "`":
+            return "\u{0300}";
+        case "\u{0301}":
+        case "´":
+            return "\u{0301}";
+        case "\u{0302}":
+        case "^":
+        case "ˆ":
+            return "\u{0302}";
+        case "\u{0303}":
+        case "~":
+        case "∼":
+        case "˜":
+            return "\u{0303}";
+        case "\u{0304}":
+        case "¯":
+            return "\u{0304}";
+        case "\u{0305}":
+        case "-":
+        case "‾":
+        case "−":
+            return "\u{0305}";
+        case "\u{0306}":
+        case "˘":
+            return "\u{0306}";
+        case "\u{0307}":
+        case ".":
+        case "˙":
+        case "⋅":
+            return "\u{0307}";
+        case "\u{0308}":
+        case "¨":
+            return "\u{0308}";
+        case "\u{20db}":
+            return "\u{20db}";
+        case "\u{20dc}":
+            return "\u{20dc}";
+        case "\u{030a}":
+        case "∘":
+        case "○":
+            return "\u{030a}";
+        case "\u{030b}":
+        case "˝":
+            return "\u{030b}";
+        case "\u{030c}":
+        case "ˇ":
+            return "\u{030c}";
+        case "\u{20d6}":
+        case "←":
+            return "\u{20d6}";
+        case "\u{20d7}":
+        case "→":
+        case "⟶":
+            return "\u{20d7}";
+        case "\u{20e1}":
+        case "↔":
+        case "⟷":
+            return "\u{20e1}";
+        case "\u{20d0}":
+        case "↼":
+            return "\u{20d0}";
+        case "\u{20d1}":
+        case "⇀":
+            return "\u{20d1}";
+        default:
+            return c;
+    }
+}
+
 function accent_f() {
     const l = [
         "grave",
@@ -743,8 +867,8 @@ function accent_f() {
         "harpoon.lt",
     ];
     for (let i of l) {
-        f[i] = (attr: tree[]) => {
-            let s = f.accent([attr[0], [{ type: "f", value: i }]], {});
+        f[i] = (attr: tree[], dic, e) => {
+            let s = f.accent([attr[0], [{ type: "f", value: i }]], {}, e);
             return s;
         };
     }
@@ -760,25 +884,25 @@ function lr_f() {
         { name: "round", l: v_f("⌊"), r: v_f("⌉") },
     ];
     for (let i of l) {
-        f[i.name] = (attr: tree[], dic) => {
-            let s = f.lr([[i.l, ...attr[0], i.r]], dic);
+        f[i.name] = (attr: tree[], dic, e) => {
+            let s = f.lr([[i.l, ...attr[0], i.r]], dic, e);
             return s;
         };
     }
 }
 lr_f();
 
-function underover_f(type: "under" | "over", tree: tree, x: string, str?: tree) {
+function underover_f(type: "under" | "over", tree: tree, x: string, str: tree, e: fonts) {
     let m =
-        type == "under"
+        type === "under"
             ? createMath("munder", null, { accentunder: "true" })
             : createMath("mover", null, { accent: "true" });
     let base = createMath("mrow");
-    base.append(render(tree));
+    base.append(render(tree, e));
     if (str) {
         let s = createMath("mrow");
-        s.append(render(str));
-        let mm = type == "under" ? createMath("munder") : createMath("mover");
+        s.append(render(str, e));
+        let mm = type === "under" ? createMath("munder") : createMath("mover");
         let xx = createMath("mo", x);
         mm.append(xx, s);
         m.append(base, mm);
@@ -789,6 +913,25 @@ function underover_f(type: "under" | "over", tree: tree, x: string, str?: tree)
     return m;
 }
 
+function underover_line_f(type: "under" | "over", tree: tree, e: fonts) {
+    let m =
+        type === "under"
+            ? createMath("munder", null, { accentunder: "true" })
+            : createMath("mover", null, { accent: "true" });
+    let base = createMath("mrow");
+    base.append(render(tree, e));
+    if (type === "under") base.style.borderBottom = "1px solid black";
+    if (type === "over") base.style.borderTop = "1px solid black";
+    m.append(base);
+    return m;
+}
+
+const ff: typeof f = {
+    "√": f["sqrt"],
+    "∛": (attr, _, e) => f.root([[v_f("3")], attr[0]], null, e),
+    "∜": (attr, _, e) => f.root([[v_f("4")], attr[0]], null, e),
+};
+
 function kh(tree: tree) {
     let f = createMath("mrow");
     let l = createMath("mo");
@@ -801,15 +944,22 @@ function kh(tree: tree) {
 }
 
 function out_kh(x: tree[0]) {
-    if (x.type == "group") {
-        return x.children;
+    if (x.type === "group") {
+        if (x.kh === "()") return x.children;
+        else return [x];
     } else {
         return [x];
     }
 }
 
+function transfer_kh(list: tree) {
+    if (list.length === 1 && list[0].type === "group")
+        list = [v_f(list[0].kh[0]), ...list[0].children, v_f(list[0].kh[1])];
+    return list;
+}
+
 function in_kh(x: tree) {
-    let k: tree = [{ type: "group", value: "", children: x }];
+    let k: tree = [{ type: "group", value: "", children: x, kh: "()" }];
     return k;
 }
 
@@ -842,8 +992,9 @@ function is_limit(tree: tree) {
                     return true;
                 }
             }
-            if (x.value == "scripts") return false;
-            if (x.value == "op") {
+            if (x.value === "scripts") return false;
+            if (x.value === "limits") return true;
+            if (x.value === "op") {
                 let { dic } = f_attr(x);
                 return is_true(dic.limits);
             }
@@ -888,15 +1039,17 @@ function eqq(x0: tree[0], x1: tree[0]) {
     return x0.type === x1.type && x0.value === x1.value && x0?.esc === x1?.esc;
 }
 
+function is_type(x: tree[0], ...type: vtype[]) {
+    return type.includes(x?.type);
+}
+
 function trim(tree: tree) {
-    if (!tree) return [];
-    while (tree.length > 0 && tree[0].type === "blank") {
-        tree.shift();
-    }
-    while (tree.length > 0 && tree.at(-1).type === "blank") {
-        tree.pop();
-    }
-    return tree;
+    if (!tree || !tree[0]) return [];
+    let start = 0;
+    let end = tree.length;
+    if (tree[0].type === "blank") start = 1;
+    if (tree.at(-1).type === "blank") end--;
+    return tree.slice(start, end);
 }
 
 type fdic = { [id: string]: tree };
@@ -919,7 +1072,6 @@ function dic_to_ast(dic: { [id: string]: tree }) {
 
 function lan_dic(tree: tree) {
     tree = trim(tree);
-    if (!tree.find((v) => eqq(v, v_f(":")))) return tree;
     const o = new Object();
     let key = "";
     let value: tree = [];
@@ -944,6 +1096,21 @@ function lan_dic(tree: tree) {
     return o;
 }
 
+function get_value(dic: fdic, o: string) {
+    if (!dic?.[o]?.[0]) return undefined;
+    const x = dic[o][0];
+    if (x.type === "sharp") {
+        if (x.value === "true") return true;
+        if (x.value === "false") return false;
+        if (x.value === "none") return null;
+        if (x.children) {
+            if (!x.children.find((v) => eqq(v, v_f(":")))) return x.children.map((v) => v.value).join("");
+            return lan_dic(x.children);
+        }
+    }
+    return dic[o].map((i) => i.value).join("");
+}
+
 function is_true(t: tree) {
     return eqq(trim(t)?.[0], { type: "sharp", value: "true" });
 }
@@ -979,16 +1146,16 @@ function ast2(tree: tree) {
         for (let n = 0; n < tree.length; n++) {
             let x = tree[n];
 
-            if (x.value == "\\" && x.type == "v") {
+            if (eqq(x, v_f("\\"))) {
                 if (tree?.[n + 1]) {
                     let next = tree[n + 1];
-                    if (next.value == "\\" && next.type == "v") {
-                        t.push({ type: "v", value: "\\" });
+                    if (eq(next, v_f("\\"))) {
+                        t.push({ type: "v", value: "\\", esc: true });
                         n++;
-                    } else if (next.type == "blank") {
+                    } else if (next.type === "blank") {
                         t.push({ type: "v", value: "br", esc: true });
                         n++;
-                    } else if (next.type == "f") {
+                    } else if (next.type === "f") {
                         let v = next.value;
                         t.push({ type: "v", value: v[0] });
                         t.push({ type: v.length == 2 ? "v" : "f", value: v.slice(1) });
@@ -1010,44 +1177,10 @@ function ast2(tree: tree) {
         tree = t;
     }
 
-    // 处理#
-    {
-        const t: tree = [];
-        for (let n = 0; n < tree.length; n++) {
-            const x = tree[n];
-            if (x.type === "sharp") {
-                if (tree[n + 1]?.type === "group") {
-                    x.children = tree[n + 1].children;
-                    for (let i in x.children) {
-                        if (x.children[i].value === "\\" && x.children[i].type === "v") {
-                            if (x.children[Number(i) + 1]) {
-                                x.children[Number(i) + 1]["esc"] = true;
-                            }
-                        }
-                    }
-                    const v = x.children.map((i) => i.value).join("");
-                    if (v.match(/^[0-9\+\-\*\/()]+$/)) {
-                        x.value = v; // todo 数学运算
-                    } else {
-                        x.value = v;
-                    }
-                } else {
-                    x.value = tree[n + 1]?.value;
-                    if (tree[n + 2]?.type === "f") {
-                        x.value += tree[n + 2].value;
-                        n++;
-                    }
-                }
-                t.push(x);
-                n++;
-                continue;
-            } else {
-                t.push(x);
-            }
-        }
-        tree = t;
-    }
+    return tree;
+}
 
+function ast3(tree: tree) {
     // 处理符号简写（shorthand）
     {
         let t: tree = [];
@@ -1067,7 +1200,7 @@ function ast2(tree: tree) {
                         nn++;
                     }
                     if (l.length) {
-                        let nx: tree[0] = { type: "f", value: shorthand[l.at(-1)] };
+                        let nx: tree[0] = { type: "f", value: shorthand[l.at(-1)], src: l.at(-1) };
                         t.push(nx);
 
                         // 不处理已经后面连起来的字符
@@ -1154,25 +1287,161 @@ function ast2(tree: tree) {
         }
         tree = t;
     }
+    // 处理后面直接跟参数的f
+    {
+        const t: tree = [];
+        for (let n = 0; n < tree.length; n++) {
+            const x = tree[n];
+            if (x.type === "v" && ff[x.value] && tree[n + 1]) {
+                x.type = "f";
+                if (!(is_type(tree[n + 1], "group") && tree[n + 1].kh === "()")) {
+                    t.push(x);
+                    t.push({ type: "group", children: [tree[n + 1]], value: "", kh: "()" });
+                    n++;
+                    continue;
+                }
+            }
+            t.push(x);
+        }
+        tree = t;
+    }
     // 处理f
     {
         let t: tree = [];
         for (let n = 0; n < tree.length; n++) {
             let x = tree[n];
+            const next = tree[n + 1];
 
             // 带有括号（参数）的函数
-            if (x.type == "f" && tree[n + 1] && tree[n + 1].type == "group") {
-                x.children = tree[n + 1].children;
-                for (let i in x.children) {
-                    if (x.children[i].value == "\\" && x.children[i].type == "v") {
+            if (x.type === "f" && next && next.type === "group") {
+                if (next.kh === "()") {
+                    x.children = tree[n + 1].children;
+                    t.push(x);
+
+                    // 不处理group
+                    n++;
+                    continue;
+                } else {
+                    if (next.kh[0] === "(") {
+                        // 向后找
+                        const tt: tree = [];
+                        tt.push(...next.children);
+                        tt.push(v_f(next.kh[1]));
+                        for (let i = n + 2; i < tree.length; i++) {
+                            if (tree[i]) {
+                                if (eqq(tree[i], v_f(")"))) {
+                                    n = i;
+                                    break;
+                                } else {
+                                    tt.push(tree[i]);
+                                }
+                            }
+                        }
+                        x.children = tt;
+                        t.push(x);
+                    } else {
+                        t.push(x);
+                    }
+                }
+                for (let i in x.children || []) {
+                    if (x.children[i].value === "\\" && x.children[i].type === "v") {
                         if (x.children[Number(i) + 1]) {
                             x.children[Number(i) + 1]["esc"] = true;
                         }
                     }
                 }
+            } else {
                 t.push(x);
+            }
+        }
+        tree = t;
+    }
+
+    // sin[]/2=(sin[])/2 a_i()=a_(i()) 之类的
+    {
+        const t: tree = [];
+        const un_list_str = [
+            "`",
+            "~",
+            "!",
+            "@",
+            "%",
+            "*",
+            "(",
+            ")",
+            "-",
+            "+",
+            "=",
+            "[",
+            "]",
+            "{",
+            "}",
+            "|",
+            ":",
+            ";",
+            "<",
+            ",",
+            ">",
+            ".",
+            "?",
+        ]; // typst 似乎是直接排除了这些字符，不排除转义，shorthand之类的
+        for (let n = 0; n < tree.length; n++) {
+            const x = tree[n];
+            const next = tree[n + 1];
+            if (
+                is_type(next, "group") &&
+                next.kh != "()" &&
+                is_type(x, "f", "str", "v") &&
+                !x.value.match(/[0-9]/) &&
+                !is_sub(x) &&
+                !is_sup(x) &&
+                (!(
+                    (is_type(x, "f") && un_list_str.includes(x.src)) ||
+                    (is_type(x, "v") && un_list_str.includes(x.value))
+                ) ||
+                    x.esc)
+            ) {
+                t.push({ type: "group1", value: "", children: [x, next] });
+                n++;
+                continue;
+            }
+            t.push(x);
+        }
+        tree = t;
+    }
 
-                // 不处理group
+    // 处理#
+    {
+        const t: tree = [];
+        for (let n = 0; n < tree.length; n++) {
+            const x = tree[n];
+            if (x.type === "sharp") {
+                if (!x.value)
+                    if (tree[n + 1]?.type === "group") {
+                        x.children = tree[n + 1].children;
+                        for (let i in x.children) {
+                            if (x.children[i].value === "\\" && x.children[i].type === "v") {
+                                if (x.children[Number(i) + 1]) {
+                                    x.children[Number(i) + 1]["esc"] = true;
+                                }
+                            }
+                        }
+                        const v = x.children.map((i) => i.value).join("");
+                        if (v.match(/^[0-9\+\-\*\/()]+$/)) {
+                            x.value = v; // todo 数学运算
+                        } else {
+                            x.value = v;
+                        }
+                    } else {
+                        console.log("+1", tree[n + 1]);
+
+                        x.value = tree[n + 1]?.value;
+                        if (tree[n + 2]?.type === "f") {
+                            x.value += tree[n + 2].value;
+                            n++;
+                        }
+                    }
+                t.push(x);
                 n++;
                 continue;
             } else {
@@ -1186,24 +1455,29 @@ function ast2(tree: tree) {
     {
         let t: tree = [];
         for (let n = 0; n < tree.length; n++) {
-            let x = tree[n];
-            let nn = n;
-            if (eqq(x, { type: "f", value: "prime" })) {
-                while (tree[nn] && eqq(tree[nn], { type: "f", value: "prime" })) {
-                    nn++;
-                }
-                const primes = nn - n;
-                if (
-                    tree[n - 1] &&
-                    !is_sup(tree[n - 1]) &&
-                    !is_sub(tree[n - 1]) &&
-                    !eq(tree[n - 1], { type: "f", value: "prime" }) &&
-                    tree[n - 1].type != "blank"
-                ) {
-                    t.push({ type: "v", value: "^" });
+            const next = tree[n + 1];
+            const x = tree[n];
+            let nn = n + 1;
+            if (eqq(next, { type: "f", value: "prime" })) {
+                while (tree[nn] && eqq(tree[nn], { type: "f", value: "prime" })) nn++;
+                const primes = nn - (n + 1);
+                if (!is_sup(x) && !is_sub(x) && x.type != "blank") {
+                    t.push({
+                        type: "f",
+                        value: "attach",
+                        children: [
+                            x,
+                            dh,
+                            ...dic_to_ast({
+                                tr: [{ type: "v", value: "'".repeat(primes) }],
+                            }),
+                        ],
+                    });
+                } else {
+                    t.push(x);
+                    for (let i = 0; i < primes; i++) t.push({ type: "f", value: "prime" });
                 }
-                t.push({ type: "v", value: "'".repeat(primes), children: [{ type: "v", value: String(primes) }] });
-                n += primes - 1;
+                n += primes;
                 continue;
             }
             t.push(x);
@@ -1353,54 +1627,52 @@ function ast2(tree: tree) {
 }
 
 function f_attr(x: tree[0]) {
-    let type: "dic" | "array" | "attr" = "array";
-    let attr: tree[] = [];
-    let dicl: tree[] = [];
-    let array: tree[][] = [];
-    let l: tree = [];
-    for (let i in x.children) {
-        const t = x.children[i];
-        if (Number(i) + 1 == x.children.length) {
-            if (t.type == "blank" && x.children[Number(i) - 1].value.match(/[,;]/)) break;
-            if (!is_f_mark(t, ",") && !is_f_mark(t, ";")) l.push(t);
-            if (type == "dic") {
-                dicl.push(l);
-                l = [];
-            } else {
-                attr.push(l);
-            }
-            if (array.length) {
-                array.push(attr);
-                attr = [];
-            }
-            l = [];
+    const list: (tree | "," | ";")[] = [[]];
+    for (let i of x.children) {
+        if (eqq(i, { type: "v", value: "," }) || eqq(i, { type: "v", value: ";" })) {
+            list.push(i.value as "," | ";");
+            list.push([]);
         } else {
-            if (is_f_mark(t, ",")) {
-                if (type == "dic") {
-                    dicl.push(l);
-                    type = "array";
-                } else {
-                    attr.push(l);
-                }
-                l = [];
-            } else if (is_f_mark(t, ";")) {
-                // 存在; 则存好的attr为array的一个子元素
-                type == "array";
-                attr.push(l);
-                l = [];
-                array.push(attr);
-                attr = [];
+            (list.at(-1) as tree).push(i);
+        }
+    }
+    const dicl: tree[] = [];
+    const xattr: typeof list = [];
+    for (let x of list) {
+        if (typeof x === "string") {
+            xattr.push(x);
+        } else {
+            if (x.find((v, i) => is_type(x[i - 1], "f", "v") && eqq(v, { type: "v", value: ":" }))) {
+                dicl.push(x);
             } else {
-                // 按,拆分成段
-                l.push(t);
-                // 段中有: 为dic
-                if (is_f_mark(t, ":")) {
-                    type = "dic";
-                }
+                xattr.push(x);
             }
         }
     }
 
+    let nl: typeof xattr = [];
+    for (let i = 0; i < xattr.length; i++) {
+        const n = xattr[i],
+            next = xattr[i + 1];
+        if ((n === "," && next === ";") || (n === ";" && next === ",")) {
+            nl.push(";");
+            i++;
+        } else {
+            nl.push(xattr[i]);
+        }
+    }
+
+    let attr: tree[] | tree[][];
+    if (typeof nl.at(-1) === "string") nl = nl.slice(0, -1);
+    const has_fenhao = nl.includes(";");
+    if (has_fenhao) {
+        let x = array_split(nl, (x) => x === ";");
+        if (x.at(-1)[0].length === 0) x = x.slice(0, -1);
+        attr = x.map((x) => x.filter((i) => typeof i != "string")) as tree[][];
+    } else {
+        attr = (nl.filter((i) => typeof i != "string") as tree[]).map((i) => trim(i));
+    }
+
     // 将dicl的tree转为键对
     let dic: fdic = {};
     for (let i of dicl) {
@@ -1408,7 +1680,7 @@ function f_attr(x: tree[0]) {
         let n = "";
         let t: tree = [];
         for (let el of i) {
-            if (el.value === ":") {
+            if (eqq(el, { type: "v", value: ":" })) {
                 x = true;
                 continue;
             }
@@ -1418,9 +1690,29 @@ function f_attr(x: tree[0]) {
                 t.push(el);
             }
         }
-        dic[n] = ast2(t);
+        dic[n] = ast3(ast2(t));
     }
-    return { attr, dic, array };
+    return { attr, dic };
+}
+
+function array_split<i>(list: i[], f: (i: i) => boolean) {
+    const l: i[][] = [[]];
+    for (let x of list) {
+        if (f(x)) {
+            l.push([]);
+        } else {
+            l.at(-1).push(x);
+        }
+    }
+    return l;
+}
+
+function attr_join(attr: tree[]) {
+    const t: tree = [];
+    for (let i of attr) {
+        t.push(...i, v_f(","));
+    }
+    return t.slice(0, -1);
 }
 
 type fonts = "serif" | "sans" | "frak" | "mono" | "bb" | "cal";
@@ -1429,46 +1721,38 @@ function font(str: string, type: fonts = "serif") {
         const l = "abcdefghijklmnopqrstuvwxyz";
         return l.indexOf(c.toLowerCase());
     }
-    switch (type) {
-        case "serif":
-            return str;
-        case "sans":
-            const s0 = [..."𝟢𝟣𝟤𝟥𝟦𝟧𝟨𝟩𝟪𝟫"];
-            const s1 = [..."𝖺𝖻𝖼𝖽𝖾𝖿𝗀𝗁𝗂𝗃𝗄𝗅𝗆𝗇𝗈𝗉𝗊𝗋𝗌𝗍𝗎𝗏𝗐𝗑𝗒𝗓"];
-            const s2 = [..."𝖠𝖡𝖢𝖣𝖤𝖥𝖦𝖧𝖨𝖩𝖪𝖫𝖬𝖭𝖮𝖯𝖰𝖱𝖲𝖳𝖴𝖵𝖶𝖷𝖸𝖹"];
-            str = str.replace(/[0-9]+/g, (s) => s0[s]);
-            str = str.replace(/[a-z]/g, (s) => s1[index_c(s)]);
-            str = str.replace(/[A-Z]/g, (s) => s2[index_c(s)]);
-            return str;
-        case "frak":
-            const frak1 = [..."𝔞𝔟𝔠𝔡𝔢𝔣𝔤𝔥𝔦𝔧𝔨𝔩𝔪𝔫𝔬𝔭𝔮𝔯𝔰𝔱𝔲𝔳𝔴𝔵𝔶𝔷"];
-            const frak2 = [..."𝔄𝔅ℭ𝔇𝔈𝔉𝔊ℌℑ𝔍𝔎𝔏𝔐𝔑𝔒𝔓𝔔ℜ𝔖𝔗𝔘𝔙𝔚𝔛𝔜ℨ"];
-            str = str.replace(/[a-z]/g, (s) => frak1[index_c(s)]);
-            str = str.replace(/[A-Z]/g, (s) => frak2[index_c(s)]);
-            return str;
-        case "mono":
-            const m0 = [..."0𝟷𝟸𝟹𝟺𝟻𝟼𝟽𝟾𝟿"];
-            const m1 = [..."𝚊𝚋𝚌𝚍𝚎𝚏𝚐𝚑𝚒𝚓𝚔𝚕𝚖𝚗𝚘𝚙𝚚𝚛𝚜𝚝𝚞𝚟𝚠𝚡𝚢𝚣"];
-            const m2 = [..."𝙰𝙱𝙲𝙳𝙴𝙵𝙶𝙷𝙸𝙹𝙺𝙻𝙼𝙽𝙾𝙿𝚀𝚁𝚂𝚃𝚄𝚅𝚆𝚇𝚈𝚉"];
-            str = str.replace(/[0-9]+/g, (s) => m0[s]);
-            str = str.replace(/[a-z]/g, (s) => m1[index_c(s)]);
-            str = str.replace(/[A-Z]/g, (s) => m2[index_c(s)]);
-            return str;
-        case "bb":
-            const bb0 = [..."𝟘𝟙𝟚𝟛𝟜𝟝𝟞𝟟𝟠𝟡"];
-            const bb1 = [..."𝕒𝕓𝕔𝕕𝕖𝕗𝕘𝕙𝕚𝕛𝕜𝕝𝕞𝕟𝕠𝕡𝕢𝕣𝕤𝕥𝕦𝕧𝕨𝕩𝕪𝕫"];
-            const bb2 = [..."𝔸𝔹ℂ𝔻𝔼𝔽𝔾ℍ𝕀𝕁𝕂𝕃𝕄ℕ𝕆ℙℚℝ𝕊𝕋𝕌𝕍𝕎𝕏𝕐ℤ"];
-            str = str.replace(/[0-9]+/g, (s) => bb0[s]);
-            str = str.replace(/[a-z]/g, (s) => bb1[index_c(s)]);
-            str = str.replace(/[A-Z]/g, (s) => bb2[index_c(s)]);
-            return str;
-        case "cal":
-            const c1 = [..."𝒶𝒷𝒸𝒹ℯ𝒻ℊ𝒽𝒾𝒿𝓀𝓁𝓂𝓃ℴ𝓅𝓆𝓇𝓈𝓉𝓊𝓋𝓌𝓍𝓎𝓏"];
-            const c2 = [..."𝒜ℬ𝒞𝒟ℰℱ𝒢ℋℐ𝒥𝒦ℒℳ𝒩𝒪𝒫𝒬ℛ𝒮𝒯𝒰𝒱𝒲𝒳𝒴𝒵"];
-            str = str.replace(/[a-z]/g, (s) => c1[index_c(s)]);
-            str = str.replace(/[A-Z]/g, (s) => c2[index_c(s)]);
-            return str;
+    const map: { [font in "sans" | "frak" | "mono" | "bb" | "cal"]: { num?: string; up: string; low: string } } = {
+        sans: {
+            num: "𝟢𝟣𝟤𝟥𝟦𝟧𝟨𝟩𝟪𝟫",
+            low: "𝖺𝖻𝖼𝖽𝖾𝖿𝗀𝗁𝗂𝗃𝗄𝗅𝗆𝗇𝗈𝗉𝗊𝗋𝗌𝗍𝗎𝗏𝗐𝗑𝗒𝗓",
+            up: "𝖠𝖡𝖢𝖣𝖤𝖥𝖦𝖧𝖨𝖩𝖪𝖫𝖬𝖭𝖮𝖯𝖰𝖱𝖲𝖳𝖴𝖵𝖶𝖷𝖸𝖹",
+        },
+        frak: {
+            low: "𝔞𝔟𝔠𝔡𝔢𝔣𝔤𝔥𝔦𝔧𝔨𝔩𝔪𝔫𝔬𝔭𝔮𝔯𝔰𝔱𝔲𝔳𝔴𝔵𝔶𝔷",
+            up: "𝔄𝔅ℭ𝔇𝔈𝔉𝔊ℌℑ𝔍𝔎𝔏𝔐𝔑𝔒𝔓𝔔ℜ𝔖𝔗𝔘𝔙𝔚𝔛𝔜ℨ",
+        },
+        mono: {
+            num: "𝟶𝟷𝟸𝟹𝟺𝟻𝟼𝟽𝟾𝟿",
+            low: "𝚊𝚋𝚌𝚍𝚎𝚏𝚐𝚑𝚒𝚓𝚔𝚕𝚖𝚗𝚘𝚙𝚚𝚛𝚜𝚝𝚞𝚟𝚠𝚡𝚢𝚣",
+            up: "𝙰𝙱𝙲𝙳𝙴𝙵𝙶𝙷𝙸𝙹𝙺𝙻𝙼𝙽𝙾𝙿𝚀𝚁𝚂𝚃𝚄𝚅𝚆𝚇𝚈𝚉",
+        },
+        bb: {
+            num: "𝟘𝟙𝟚𝟛𝟜𝟝𝟞𝟟𝟠𝟡",
+            low: "𝕒𝕓𝕔𝕕𝕖𝕗𝕘𝕙𝕚𝕛𝕜𝕝𝕞𝕟𝕠𝕡𝕢𝕣𝕤𝕥𝕦𝕧𝕨𝕩𝕪𝕫",
+            up: "𝔸𝔹ℂ𝔻𝔼𝔽𝔾ℍ𝕀𝕁𝕂𝕃𝕄ℕ𝕆ℙℚℝ𝕊𝕋𝕌𝕍𝕎𝕏𝕐ℤ",
+        },
+        cal: {
+            low: "𝒶𝒷𝒸𝒹ℯ𝒻ℊ𝒽𝒾𝒿𝓀𝓁𝓂𝓃ℴ𝓅𝓆𝓇𝓈𝓉𝓊𝓋𝓌𝓍𝓎𝓏",
+            up: "𝒜ℬ𝒞𝒟ℰℱ𝒢ℋℐ𝒥𝒦ℒℳ𝒩𝒪𝒫𝒬ℛ𝒮𝒯𝒰𝒱𝒲𝒳𝒴𝒵",
+        },
+    };
+    if (type === "serif") return str;
+    else {
+        str = str.replace(/[0-9]/g, (s) => [...map[type].num][s]);
+        str = str.replace(/[a-z]/g, (s) => [...map[type].low][index_c(s)]);
+        str = str.replace(/[A-Z]/g, (s) => [...map[type].up][index_c(s)]);
     }
+    return str;
 }
 
 function render(tree: tree, e?: fonts) {
@@ -1476,59 +1760,44 @@ function render(tree: tree, e?: fonts) {
 
     tree = ast2(tree);
 
+    // 多行
     // 处理\ 换行
     {
         let xx = false;
-        let w = (tree: tree) => {
-            for (let i of tree) {
-                if (is_br(i)) {
-                    xx = true;
-                    return;
-                }
-                if (i.type == "group") {
-                    w(i.children);
-                }
+        for (let n in tree) {
+            const i = tree[n];
+            if (is_br(i)) {
+                xx = true;
+                break;
             }
-        };
-        w(tree);
+        }
         if (xx) {
-            // 移除group
-            {
-                let t: tree = [];
-                for (let i in tree) {
-                    let x = tree[i];
-                    // 不作为group，只是数学上显示的括号对
-                    if (x.type == "group") {
-                        t.push(v_f("("));
-                        t.push(...ast2(x.children));
-                        t.push(v_f(")"));
-                    } else {
-                        t.push(x);
-                    }
-                }
-                tree = t;
-            }
-            // 将换行替换成逗号传入函数
+            const trees: tree[] = [[]];
             for (let n = 0; n < tree.length; n++) {
-                const x = tree[n];
-                if (is_br(x)) {
-                    tree[n] = dh;
+                const i = tree[n];
+                if (is_br(i)) {
+                    trees.push([]);
+                } else {
+                    trees.at(-1).push(i);
                 }
             }
+            return x_table(trees);
+        }
+    }
 
-            let t: tree = [];
-            t.push({ type: "f", value: "x_table", children: tree });
-            tree = t;
-        } else {
-            let t: tree = [];
-            for (let x of tree) {
-                // 移除&
-                if (!(x.type == "v" && x.value == "&" && !x.esc)) {
-                    t.push(x);
-                }
+    // 单行
+
+    tree = ast3(tree);
+
+    {
+        let t: tree = [];
+        for (let x of tree) {
+            // 移除&
+            if (!(x.type == "v" && x.value == "&" && !x.esc)) {
+                t.push(x);
             }
-            tree = t;
         }
+        tree = t;
     }
 
     // 移除group1
@@ -1544,54 +1813,59 @@ function render(tree: tree, e?: fonts) {
         tree = t;
     }
 
+    console.log("ast3", structuredClone(tree));
     for (let i in tree) {
         let n = Number(i);
         let x = tree[n];
 
-        // 带有括号（参数）的函数
-        if (x.type == "f" && x.children) {
-            let { attr, dic, array }: { attr: tree[]; dic: fdic; array: tree[][] } = f_attr(x);
-
-            if (f[x.value]) {
-                console.log(attr, dic, array);
-                let el = f[x.value](attr, dic, array, e);
-                fragment.append(el);
-            } else if (ss[x.value]) {
-                let el = createMath("mi", ss[x.value]);
-                fragment.append(el, render(in_kh(x.children)));
-            }
-        }
+        // 函数
+        if (x.type === "f") {
+            // 带有括号（参数）的函数
+            if (x.children && (x.kh === "()" || !x.kh)) {
+                let { attr, dic } = f_attr(x);
 
-        if (x.type == "f" && !x.children) {
-            if (ss[x.value]) {
-                let tag: keyof MathMLElementTagNameMap;
-                let space_w = null;
-                const space_width = {
-                    " ": "0.36em",
-                    "\u2002": "0.5em",
-                    "\u2003": "1em",
-                    "\u2004": "0.333em",
-                    "\u2005": "0.25em",
-                    "\u2006": "0.166em",
-                    "\u205f": "0.222em",
-                    "\u2007": "1ch",
-                    "\u2008": "0.27em",
-                    "\u2009": "0.17em",
-                    "\u200a": "0.09em",
-                };
-                if (ss[x.value].match(/[a-zA-Z\u0391-\u03C9]/)) {
-                    tag = "mi";
-                } else if (space_width[ss[x.value]]) {
-                    tag = "mspace";
-                    space_w = { width: space_width[ss[x.value]] };
-                } else {
-                    tag = "mo";
+                if (f[x.value]) {
+                    let el = f[x.value](attr as tree[], dic, e);
+                    fragment.append(el);
+                } else if (ss[x.value]) {
+                    let el = createMath("mi", ss[x.value]);
+                    fragment.append(el, render(in_kh(x.children), e));
+                } else if (ff[x.value]) {
+                    let el = ff[x.value](attr as tree[], dic, e);
+                    fragment.append(el);
                 }
-                let el = createMath(tag, ss[x.value], space_w);
-                fragment.append(el);
             } else {
-                if (f[x.value]) {
-                    let el = f[x.value](null, null, null, e);
+                if (ss[x.value]) {
+                    let tag: keyof MathMLElementTagNameMap;
+                    let space_w = null;
+                    const space_width = {
+                        " ": "0.36em",
+                        "\u2002": "0.5em",
+                        "\u2003": "1em",
+                        "\u2004": "0.333em",
+                        "\u2005": "0.25em",
+                        "\u2006": "0.166em",
+                        "\u205f": "0.222em",
+                        "\u2007": "1ch",
+                        "\u2008": "0.27em",
+                        "\u2009": "0.17em",
+                        "\u200a": "0.09em",
+                    };
+                    if (ss[x.value].match(/[a-zA-Z\u0391-\u03C9]/)) {
+                        tag = "mi";
+                    } else if (space_width[ss[x.value]]) {
+                        tag = "mspace";
+                        space_w = { width: space_width[ss[x.value]] };
+                    } else {
+                        tag = "mo";
+                    }
+                    let el = createMath(tag, ss[x.value], space_w);
+                    fragment.append(el);
+                } else if (f[x.value]) {
+                    let el = f[x.value](null, null, e);
+                    fragment.append(el);
+                } else if (ff[x.value]) {
+                    let el = ff[x.value]([x.children], null, e);
                     fragment.append(el);
                 }
             }
@@ -1604,30 +1878,37 @@ function render(tree: tree, e?: fonts) {
 
         if (x.type === "v" || x.type === "sharp") {
             let tag: keyof MathMLElementTagNameMap;
+            let value = x.value;
             if (x.value.match(/[0-9.]+/)) {
                 tag = "mn";
             } else if (x.value.match(/[a-zA-Z\u0391-\u03C9]/)) {
                 tag = "mi";
             } else if (x.value.match(/^'+$/)) {
-                if (x.value.length > 1) x.value = x.value.replaceAll("'", ss["prime"]);
+                if (!x.esc) value = x.value.replaceAll("'", ss["prime"]);
                 tag = "mo";
             } else {
                 tag = "mo";
             }
-            let el = createMath(tag, font(x.value, e));
+            if (x.type === "sharp") {
+                if (x.value.startsWith("emoji.")) {
+                    tag = "mi";
+                    value = emojix[x.value.replace("emoji.", "")];
+                }
+            }
+            let el = createMath(tag, font(value, e));
             fragment.append(el);
         }
 
-        if (x.type == "group") {
-            fragment.append(kh(x.children));
+        if (x.type === "group") {
+            fragment.append(f.lr([[x]], null, e));
         }
     }
 
     return fragment;
 }
 
-var init_c: { emoji: boolean | ((str: string) => string) } = {
-    emoji: false,
+var init_c: { emoji: (str: string) => string } = {
+    emoji: null,
 };
 
 function init(p: { emoji: boolean }) {
@@ -1636,12 +1917,12 @@ function init(p: { emoji: boolean }) {
     }
 }
 
-function toMML(str: string) {
+function toMML(str: string, inline?: boolean) {
     let obj = ast(str);
-    console.log(obj);
+    console.log("ast1", obj);
 
     let mathEl = createMath("math");
-    mathEl.setAttribute("display", "block");
+    if (!inline) mathEl.setAttribute("display", "block");
     let f = render(obj);
     mathEl.append(f);
     return mathEl;