@lofcz/edix 0.3.0

package/lib/index.js

@@ -0,0 +1,737 @@
+const t = Math.min, {keys: n, is: e} = Object, r = t => "string" == typeof t, o = t => "function" == typeof t, s = o(queueMicrotask) ? queueMicrotask : t => {
+    Promise.resolve().then(t);
+}, i = (n, e) => {
+    const r = t(n.length, e.length);
+    for (let t = 0; t < r; t++) {
+        const r = n[t], o = e[t];
+        if (r < o) return -1;
+        if (r > o) return 1;
+    }
+    return 0;
+}, c = ([t, n], [e, r]) => {
+    const o = i(t, e);
+    return 0 === o ? n === r ? 0 : n < r ? -1 : 1 : o;
+}, u = ([t, n]) => 1 === c(t, n) ? [ n, t ] : [ t, n ], f = (t, n = t => g(t) ? t.text : "") => t.children.reduce((t, e, r) => (0 !== r && (t += "\n"), 
+t + e.reduce((t, e) => t + n(e), "")), ""), l = (t, n) => t.split("\n").map(t => [ {
+    ...n,
+    text: t
+} ]), a = "delete", d = "insert_text", h = "insert_node", p = "set_attr", m = ({type: t}) => t === h || t === p;
+
+class y {
+    t;
+    selection;
+    constructor(t) {
+        this.t = t ? t.slice() : [];
+    }
+    get ops() {
+        return this.t;
+    }
+    insertText(t, n) {
+        return this.t.push({
+            type: d,
+            at: t,
+            text: n
+        }), this;
+    }
+    insertFragment(t, n) {
+        return this.t.push({
+            type: h,
+            at: t,
+            fragment: n
+        }), this;
+    }
+    delete(t, n) {
+        return this.t.push({
+            type: a,
+            start: t,
+            end: n
+        }), this;
+    }
+    attr(t, n, e, r) {
+        return this.t.push({
+            type: p,
+            start: t,
+            end: n,
+            key: e,
+            value: r
+        }), this;
+    }
+    transform(t) {
+        return this.t.reduce((t, n) => C(t, n), t);
+    }
+}
+
+const g = t => "text" in t, w = (t, r) => {
+    const o = n(t);
+    return o.length === n(r).length && o.every(n => n in r && ("text" === n || e(t[n], r[n])));
+}, x = t => g(t) ? t.text.length : 1, k = t => t.reduce((t, n) => t + x(n), 0), b = (...t) => t.reduce((t, n) => (((t, n) => {
+    if (n.length) {
+        const e = t.length;
+        t.push(...n), e && ((t, n = 0, e = t.length - 1) => {
+            let r = n + 1;
+            for (;r <= e; ) {
+                const n = t[r - 1], o = t[r];
+                g(n) && g(o) && w(n, o) ? (t[r - 1] = {
+                    ...n,
+                    text: n.text + o.text
+                }, t.splice(r, 1), e--) : r++;
+            }
+            for (r = n; r <= e; ) {
+                const n = t[r];
+                g(n) && !n.text && t.length > 1 ? (t.splice(r, 1), e--) : r++;
+            }
+        })(t, e - 1, e);
+    }
+})(t, n), t), []), E = (t, n) => {
+    for (let e = 0; e < t.length; e++) {
+        const r = t[e], o = x(r);
+        if (o > n) {
+            const o = t.slice(0, e), s = t.slice(e + 1);
+            if (g(r)) {
+                const t = r.text.slice(0, n), e = r.text.slice(n);
+                !t && o.length || o.push({
+                    ...r,
+                    text: t
+                }), !e && s.length || s.unshift({
+                    ...r,
+                    text: e
+                });
+            } else s.unshift(r);
+            return [ o, s ];
+        }
+        n -= o;
+    }
+    return [ t, [] ];
+}, D = t => t.length ? t[0] : 0, O = (t, n) => t.children[D(n)], S = (t, n) => [ D(t) + n ], _ = (t, n, e, o) => {
+    const [s, i] = n, [u, f] = e, [a, d] = E(O(t, s), i), h = -1 === c(n, e) ? E(O(t, u), f)[1] : d;
+    if (r(o)) {
+        const t = a.length;
+        let n;
+        if (t) {
+            const e = a[t - 1];
+            g(e) && (n = e);
+        }
+        o = l(o, n);
+    }
+    let p;
+    o.length ? (p = o.slice(), p[p.length - 1] = b(p[p.length - 1], h)) : p = [ h ], 
+    p[0] = b(a, p[0]);
+    const m = t.children.slice();
+    return m.splice(D(s), D(u) - D(s) + 1, ...p), {
+        ...t,
+        children: m
+    };
+}, v = (t, n, e) => {
+    if (-1 !== c(n, e)) return [];
+    const r = t.children.slice(D(n[0]), D(e[0]) + 1), o = r.length - 1;
+    return r[o] = E(r[o], e[1])[0], r[0] = E(r[0], n[1])[1], r;
+}, M = (t, [n, e]) => (!n.length || n[0] >= 0 && n[0] < t.children.length) && e >= 0 && e <= k(O(t, n)), C = (t, n) => {
+    switch (n.type) {
+      case a:
+        {
+            const {start: e, end: r} = n;
+            if (-1 !== c(t, e)) return -1 === c(r, t) ? [ S(t[0], D(e[0]) - D(r[0])), t[1] + (0 === i(r[0], t[0]) ? e[1] - r[1] : 0) ] : e;
+            break;
+        }
+
+      case d:
+      case h:
+        {
+            const e = n.at, r = n.type === d ? l(n.text) : n.fragment, o = r.length, s = o - 1;
+            if (-1 !== c(t, e)) return [ S(t[0], s), t[1] + (0 === i(t[0], e[0]) ? k(r[o - 1]) - (0 === s ? 0 : e[1]) : 0) ];
+            break;
+        }
+    }
+    return t;
+}, A = (t, n) => [ C(t[0], n), C(t[1], n) ], I = (t, n, e) => {
+    switch (e.type) {
+      case a:
+        {
+            const {start: r, end: o} = e;
+            M(t, r) && M(t, o) && -1 === c(r, o) && (t = _(t, r, o, []), n = A(n, e));
+            break;
+        }
+
+      case d:
+        {
+            const {at: r, text: o} = e;
+            M(t, r) && o && (t = _(t, r, r, o), n = A(n, e));
+            break;
+        }
+
+      case h:
+        {
+            const {at: r, fragment: o} = e;
+            M(t, r) && o.length && (t = _(t, r, r, o), n = A(n, e));
+            break;
+        }
+
+      case p:
+        {
+            const {start: n, end: r, key: o, value: s} = e;
+            M(t, n) && M(t, r) && -1 === c(n, r) && (t = _(t, n, r, v(t, n, r).map(t => t.map(t => g(t) ? {
+                ...t,
+                [o]: s
+            } : t))));
+            break;
+        }
+    }
+    return [ t, n ];
+};
+
+function F(t = u(this.selection)) {
+    this.apply((new y).delete(...t));
+}
+
+function H(t, n = this.selection[0]) {
+    this.apply((new y).insertText(n, t));
+}
+
+function P(t, n = this.selection[0]) {
+    this.apply((new y).insertFragment(n, [ [ t ] ]));
+}
+
+function R(t, n = this.selection[0], e = !0) {
+    const r = (new y).insertFragment(n, [ t ]);
+    if (e) {
+        const t = r.transform(n);
+        r.selection = [ t, t ];
+    }
+    this.apply(r);
+}
+
+function B(t) {
+    const [n, e] = u(this.selection);
+    this.apply((new y).delete(n, e).insertText(n, t));
+}
+
+function T(t) {
+    const n = this.doc;
+    this.apply((new y).delete([ [], 0 ], [ [ n.children.length - 1 ], k(n.children[n.children.length - 1]) ]).insertText([ [], 0 ], t));
+}
+
+function V(t, n, e = u(this.selection)) {
+    this.apply((new y).attr(...e, t, n));
+}
+
+function L(t, n = u(this.selection)) {
+    const e = v(this.doc, ...n).flatMap(t => t.filter(g));
+    e.length && this.apply((new y).attr(...n, t, !!e.some(n => !n[t])));
+}
+
+const N = t => "at" in t ? [ t.at, t.at ] : [ t.start, t.end ];
+
+let q = null, z = null, J = null, U = null;
+
+const G = t => 1 === t.nodeType, j = t => 8 === t.nodeType, W = () => z, X = () => {
+    const t = Y();
+    return 1 === t ? z.data.length : 2 === t ? 1 : 0;
+}, Y = () => {
+    if (null != J) return J;
+    if (z) if ((t => 3 === t.nodeType)(z)) {
+        const t = z.data;
+        if (t) return J = "\n" === t ? $() ? 3 : 6 : 1;
+    } else if (G(z)) {
+        if ("BR" === z.tagName) return J = $() ? 3 : 5;
+        if (U.o(z)) return J = 2;
+        if (U.i(z)) return J = 4;
+    }
+    return J = 0;
+}, K = () => (J = null, z = q.nextNode()), Q = () => {
+    for (;(J = null) || (z = q.nextSibling()); ) if (4 === Y()) return;
+}, Z = () => {
+    for (;(J = null) || (z = q.parentNode()); ) if (4 === Y()) return;
+}, $ = () => {
+    const t = z.parentNode;
+    return nt(() => {
+        for (;K(); ) {
+            if (Y()) return !0;
+            if (!t.contains(z)) break;
+        }
+        return !1;
+    });
+}, tt = () => {
+    for (;;) {
+        if (2 === Y()) {
+            const t = z;
+            for (;K() && t.contains(z); ) ;
+        } else K();
+        if (!z) break;
+        const t = Y();
+        if (t) return t;
+    }
+}, nt = (t, n, e, r) => {
+    const o = U, s = q, i = z, c = J;
+    try {
+        return e && (U = e, q = U.u.createTreeWalker(n, 5)), r && (q.currentNode = z = r), 
+        t();
+    } finally {
+        U = o, q = s, z = i, J = c, q && i && (q.currentNode = i);
+    }
+}, et = new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TR" ]), rt = t => et.has(t.tagName), ot = new Set([ "EMBED", "IMG", "PICTURE", "AUDIO", "VIDEO", "SVG", "CANVAS", "MATH", "IFRAME", "OBJECT" ]), st = t => "false" === t.contentEditable || ot.has(t.tagName), it = (t, n) => t.compareDocumentPosition(n), ct = t => t.ownerDocument, ut = t => ct(t).getSelection(), ft = (t, n) => {
+    if (t.rangeCount) {
+        const e = t.getRangeAt(0);
+        if (n.contains(e.commonAncestorContainer)) return e;
+    }
+}, lt = (t, n, e, r) => {
+    const o = ut(t);
+    return !(!e && !ft(o, t) || (o.removeAllRanges(), o.addRange(n), r && (o.collapseToEnd(), 
+    o.extend(n.startContainer, n.startOffset)), 0));
+}, at = (t, n, [e, r], o, s) => {
+    const i = c(e, r), u = 0 === i, f = 1 === i, l = f ? r : e, a = f ? e : r;
+    if (0 === l[0].length && 0 === l[1] && u && !n.hasChildNodes()) {
+        const e = t.createRange();
+        return e.setStart(n, 0), e.setEnd(n, 0), lt(n, e, s);
+    }
+    const d = dt(n, l, o);
+    if (!d) return !1;
+    const h = u ? d : dt(n, a, o);
+    if (!h) return !1;
+    const p = t.createRange(), [m, y] = d, [g, w] = h;
+    return G(m) ? y < 1 ? p.setStartBefore(m) : p.setStartAfter(m) : p.setStart(m, y), 
+    G(g) ? w < 1 ? p.setEndBefore(g) : p.setEndAfter(g) : p.setEnd(g, w), lt(n, p, s, f);
+}, dt = (t, [n, e], r) => nt(() => {
+    let t, r = 0;
+    for (;t = tt(); ) if (4 === t) {
+        if (r < n.length) for (let t = n[r++]; t > 0; t--) Q();
+    } else {
+        const t = X();
+        if (e <= t) return [ W(), e ];
+        e -= t;
+    }
+}, t, r), ht = (n, e, r, o) => {
+    let s = !0;
+    if (n === e && !e.hasChildNodes()) return [ [], 0 ];
+    if (G(e) && !o.o(e) && e.hasChildNodes()) {
+        const n = t(r, e.childNodes.length - 1);
+        e = e.childNodes[n], s = n === r, r = 0;
+    }
+    return nt(() => {
+        4 !== Y() && Z();
+        const t = nt(() => {
+            const t = [];
+            let e;
+            for (;(e = W()) && e !== n; ) t.unshift(e), Z();
+            if (!t.length) return [];
+            let r = 0, o = t[t.length - 1];
+            for (;o = o.previousElementSibling; ) r++;
+            return [ r ];
+        });
+        let o = 0;
+        for (;tt(); ) {
+            const t = it(e, W());
+            if (0 === t || 16 & t) {
+                if (s) break;
+            } else if (4 & t) break;
+            o += X();
+        }
+        return [ t, o + r ];
+    }, n, o, e);
+}, pt = (t, n, {startOffset: e, startContainer: r, endOffset: o, endContainer: s}) => {
+    const i = ht(t, r, e, n);
+    return [ i, r === s && e === o ? i : ht(t, s, o, n) ];
+}, mt = t => (n, e) => {
+    n.setData("text/plain", f({
+        children: e
+    }, t));
+}, yt = () => (t, n, e) => {
+    const r = document.createElement("div");
+    r.appendChild(ft(ut(e), e).cloneContents()), t.setData("text/html", r.innerHTML);
+}, gt = "application/x-edix-editor", wt = ({key: t = gt} = {}) => (n, e) => {
+    n.setData(t, JSON.stringify(e));
+}, xt = t => n => {
+    for (const e of n.items) if ("file" === e.kind) {
+        const n = t[e.type];
+        if (n) {
+            const t = e.getAsFile();
+            if (t) return [ [ n(t) ] ];
+        }
+    }
+    return null;
+}, kt = () => t => t.getData("text/plain"), bt = (t, n = []) => (e, r) => {
+    const o = e.getData("text/html");
+    if (o) {
+        let e = (new DOMParser).parseFromString(o, "text/html").body, s = !1;
+        for (const t of [ ...e.childNodes ]) j(t) ? "StartFragment" === t.data ? (s = !0, 
+        e = new DocumentFragment) : "EndFragment" === t.data && (s = !1) : s && e.appendChild(t);
+        return ((t, n, e, r) => nt(() => {
+            let t, n = null, o = "", s = !1;
+            const i = [], c = () => {
+                o && (n || (n = []), n.push(e(o)), o = "");
+            }, u = () => {
+                c(), !n && s && (n = []), n && i.push(n), n = null, s = !1;
+            };
+            for (;t = tt(); ) if (4 === t) u(); else if (s = !0, 1 === t) o += W().data; else if (2 === t) {
+                c();
+                const t = r(W());
+                t && n.push(t);
+            } else 3 === t && u();
+            return u(), i.length || i.push([]), i;
+        }, t, n))(e, r, t, t => {
+            for (const e of n) {
+                const n = e(t);
+                if (n) return n;
+            }
+        });
+    }
+    return null;
+}, Et = ({key: t = gt} = {}) => n => {
+    try {
+        return JSON.parse(n.getData(t));
+    } catch (t) {
+        return null;
+    }
+}, Dt = (t, n, {mod: e, shift: r = !1, alt: o = !1} = {}) => (t = t.toLowerCase(), 
+s => {
+    if (s.key.toLowerCase() === t && (!e || s.ctrlKey || s.metaKey) && r === s.shiftKey && o === s.altKey) return n(s), 
+    !0;
+}), Ot = () => {}, St = ({doc: t, readonly: n = !1, schema: i, plugins: f, keyboard: l, copy: a = [ mt() ], paste: d = [ t => t.getData("text/plain") ], isBlock: h = rt, autoScroll: p = !1, onChange: w, onError: x = console.error}) => {
+    let k = [ [ [], 0 ], [ [], 0 ] ], b = Ot, E = null, D = 0;
+    const O = () => {
+        if (E && !D) {
+            const t = E;
+            D = requestAnimationFrame(() => {
+                D = 0, t.scrollTop = t.scrollHeight;
+            });
+        }
+    }, S = t => {
+        for (const n of t.children) for (const t of n) if (!g(t) || t.text.length > 0) return !1;
+        return !0;
+    };
+    let _ = S(t);
+    const A = (t, n) => {
+        if (!i) return n("An unsafe operation was detected. We recommend using schema option."), 
+        !0;
+        const e = i["~standard"].validate(t);
+        if (e instanceof Promise) n("async validate is not supported."); else {
+            if (!e.issues) return !0;
+            n(e.issues.map(t => t.message).join("\n"));
+        }
+        return !1;
+    };
+    let F;
+    if (!A(t, t => {
+        F = t;
+    }) && F) throw Error(F);
+    const H = [ Dt("z", () => {
+        if (!n) {
+            const n = z.undo();
+            n && (t = n[0], _ = S(t), L(n[1]), w(t), p && O());
+        }
+    }, {
+        mod: !0
+    }), Dt("z", () => {
+        if (!n) {
+            const n = z.redo();
+            n && (t = n[0], _ = S(t), L(n[1]), w(t), p && O());
+        }
+    }, {
+        mod: !0,
+        shift: !0
+    }) ];
+    l && H.push(...l);
+    const P = [], R = [];
+    f && (f.forEach(({apply: t, mount: n}) => {
+        t && P.push(t), n && R.push(n);
+    }), f = void 0);
+    const B = [], T = (t, e) => {
+        if (!n) {
+            const n = !B.length;
+            B.unshift(t), e ? V() : n && s(V);
+        }
+    }, V = () => {
+        if (B.length) {
+            const n = t, r = [], o = P.length;
+            let s;
+            for (;s = B.pop(); ) {
+                for (let n of s.ops) {
+                    let e = 0;
+                    const s = () => {
+                        if (e < o) {
+                            const t = e;
+                            P[e](n, i), t === e && i();
+                        } else if (e === o) {
+                            e++;
+                            try {
+                                const [e, o] = I(t, k, n);
+                                m(n) && !A(e, x) || (t = e, k = o, r.push(n));
+                            } catch (t) {
+                                x("rollback operation: " + t);
+                            }
+                        }
+                    }, i = t => {
+                        t && (n = t), e++, s();
+                    };
+                    s();
+                }
+                s.selection && L(s.selection);
+            }
+            e(n, t) || (_ = S(t), z.change(t, r), w(t), p && O());
+        }
+    }, L = n => {
+        ((t, [n, e]) => M(t, n) && M(t, e))(t, n) && (k = n);
+    }, q = {
+        get doc() {
+            return t;
+        },
+        get isEmpty() {
+            return _;
+        },
+        get selection() {
+            return k;
+        },
+        set selection(t) {
+            L(t);
+        },
+        get readonly() {
+            return n;
+        },
+        set readonly(t) {
+            n = t, b();
+        },
+        get autoScroll() {
+            return p;
+        },
+        set autoScroll(t) {
+            p = t;
+        },
+        apply: (t, ...n) => (o(t) ? t.call(q, ...n) : T(t, n[0]), q),
+        input: e => {
+            if (E = e, !window.InputEvent || !o(InputEvent.prototype.getTargetRanges)) return x("beforeinput event is not supported."), 
+            Ot;
+            const {contentEditable: s, role: i, ariaMultiLine: f, ariaReadOnly: l} = e, p = e.style.whiteSpace;
+            e.role = "textbox", e.style.whiteSpace = "pre-wrap", e.ariaMultiLine = "true";
+            let m = !1, g = !1, w = null, O = !1, S = !1, _ = !1;
+            const M = ct(e), C = {
+                u: M,
+                i: h,
+                o: st
+            };
+            b = () => {
+                e.contentEditable = n ? "false" : "true", e.ariaReadOnly = n ? "true" : null;
+            }, b();
+            const A = t => {
+                for (const n of d) {
+                    const e = n(t, C);
+                    if (e) return e;
+                }
+                x("failed to serialize pasted data");
+            }, I = ((t, n) => {
+                let e = !1;
+                const r = [], o = t => {
+                    e && r.push(...t);
+                }, s = new MutationObserver(t => {
+                    o(t), e || n();
+                }), i = () => {
+                    o(s.takeRecords());
+                };
+                return s.observe(t, {
+                    characterData: !0,
+                    characterDataOldValue: !0,
+                    childList: !0,
+                    subtree: !0
+                }), {
+                    l(t) {
+                        !e && t && i(), e = t;
+                    },
+                    h: () => (i(), r.splice(0)),
+                    p() {
+                        r.splice(0), s.disconnect();
+                    }
+                };
+            })(e, () => {
+                at(M, e, k, C);
+            }), F = () => {
+                L(((t, n) => {
+                    const e = ut(t), r = ft(e, t);
+                    if (!r) return [ [ [], 0 ], [ [], 0 ] ];
+                    const o = pt(t, n, r), s = it(e.anchorNode, e.focusNode);
+                    return (0 === s ? e.anchorOffset > e.focusOffset : 2 & s) ? [ o[1], o[0] ] : o;
+                })(e, C));
+            }, P = () => {
+                const t = I.h();
+                if (I.l(!1), t.length) {
+                    let n;
+                    for (;n = t.pop(); ) if ("childList" === n.type) {
+                        const {target: t, removedNodes: e, addedNodes: r, nextSibling: o} = n;
+                        for (let n = e.length - 1; n >= 0; n--) t.insertBefore(e[n], o);
+                        for (let n = r.length - 1; n >= 0; n--) t.removeChild(r[n]);
+                    } else n.target.nodeValue = n.oldValue;
+                    I.h(), g = at(M, e, k, C, !0);
+                }
+                w && (L(w[1]), T(w[0]), w = null), O = !1;
+            }, B = t => {
+                if (!O) for (const n of H) if (n(t)) return t.preventDefault(), void I.l(!1);
+            }, V = () => {
+                O || P();
+            }, N = t => {
+                t.preventDefault();
+                const n = t.inputType;
+                if (n.startsWith("format")) return;
+                if ("historyUndo" === n || "historyRedo" === n) return;
+                O ? I.l(!0) : F();
+                const r = t.getTargetRanges()[0];
+                if (r) {
+                    const o = pt(e, C, r);
+                    let s, i = "insertParagraph" === n || "insertLineBreak" === n ? "\n" : t.data;
+                    if (null == i) {
+                        const n = t.dataTransfer;
+                        n && (i = n.getData("text/plain"));
+                    }
+                    w || (w = [ new y, k ]), s = w[0], 0 !== c(...o) && s.delete(...o), i && s.insertText(o[0], i);
+                }
+                O || P();
+            }, q = () => {
+                O || F(), O = !0;
+            }, z = () => {
+                P();
+            }, J = () => {
+                S = !0, F();
+            }, U = () => {
+                S = !1;
+            }, G = () => {
+                g ? g = !1 : !S || O || _ || F();
+            }, j = n => {
+                F(), 0 !== c(...k) && ((t, n) => {
+                    for (const r of a) r(t, n, e);
+                })(n, v(t, ...u(k)));
+            }, W = t => {
+                t.preventDefault(), j(t.clipboardData);
+            }, X = t => {
+                t.preventDefault(), n || (j(t.clipboardData), T((new y).delete(...u(k))));
+            }, Y = t => {
+                t.preventDefault();
+                const n = A(t.clipboardData);
+                if (n) {
+                    const [t, e] = u(k), o = (new y).delete(t, e);
+                    r(n) ? o.insertText(t, n) : o.insertFragment(t, n), T(o);
+                }
+            }, K = t => {
+                t.preventDefault();
+                const n = t.dataTransfer, o = ((t, n, {clientX: e, clientY: r}, o) => {
+                    if (t.caretPositionFromPoint) {
+                        const s = t.caretPositionFromPoint(e, r);
+                        if (s) return ht(n, s.offsetNode, s.offset, o);
+                    } else if (t.caretRangeFromPoint) {
+                        const s = t.caretRangeFromPoint(e, r);
+                        if (s) return ht(n, s.startContainer, s.startOffset, o);
+                    }
+                })(M, e, t, C);
+                if (n && o) {
+                    const t = new y;
+                    _ && t.delete(...u(k));
+                    const s = A(n);
+                    if (s) {
+                        const n = t.transform(o);
+                        r(s) ? t.insertText(n, s) : t.insertFragment(n, s), t.selection = [ n, t.transform(o) ];
+                    }
+                    T(t), e.focus({
+                        preventScroll: !0
+                    });
+                }
+            }, Q = t => {
+                _ = !0, j(t.dataTransfer);
+            }, Z = () => {
+                _ = !1;
+            };
+            M.addEventListener("selectionchange", G), e.addEventListener("keydown", B), e.addEventListener("input", V), 
+            e.addEventListener("beforeinput", N), e.addEventListener("compositionstart", q), 
+            e.addEventListener("compositionend", z), e.addEventListener("focus", J), e.addEventListener("blur", U), 
+            e.addEventListener("copy", W), e.addEventListener("cut", X), e.addEventListener("paste", Y), 
+            e.addEventListener("drop", K), e.addEventListener("dragstart", Q), e.addEventListener("dragend", Z);
+            const $ = [];
+            return R.forEach(t => {
+                const n = t(e);
+                n && $.push(n);
+            }), () => {
+                m || (m = !0, D && (cancelAnimationFrame(D), D = 0), E = null, b = Ot, e.contentEditable = s, 
+                e.role = i, e.ariaMultiLine = f, e.ariaReadOnly = l, e.style.whiteSpace = p, I.p(), 
+                M.removeEventListener("selectionchange", G), e.removeEventListener("keydown", B), 
+                e.removeEventListener("input", V), e.removeEventListener("beforeinput", N), e.removeEventListener("compositionstart", q), 
+                e.removeEventListener("compositionend", z), e.removeEventListener("focus", J), e.removeEventListener("blur", U), 
+                e.removeEventListener("copy", W), e.removeEventListener("cut", X), e.removeEventListener("paste", Y), 
+                e.removeEventListener("drop", K), e.removeEventListener("dragstart", Q), e.removeEventListener("dragend", Z), 
+                $.forEach(t => {
+                    t();
+                }));
+            };
+        }
+    }, z = (t => {
+        let n = 0, e = 0;
+        const r = Date.now, o = [ [ t, [] ] ], s = () => o[n];
+        return {
+            change: (t, s) => {
+                const i = r();
+                (0 === n || i - e >= 500) && (n++, n >= o.length ? o.push([ t, [] ]) : o[n][1].splice(0)), 
+                e = i, o[n][0] = t, o[n][1].push(...s), o.splice(n + 1), n > 500 && (n--, o.shift());
+            },
+            undo: () => {
+                if (n > 0) {
+                    const t = s()[1];
+                    return n--, [ s()[0], N(t[0]) ];
+                }
+            },
+            redo: () => {
+                if (n < o.length - 1) {
+                    n++;
+                    const [t, e] = s(), r = e[e.length - 1], o = N(r);
+                    return [ t, [ C(o[0], r), C(o[1], r) ] ];
+                }
+            }
+        };
+    })(t);
+    return q;
+}, _t = () => ({
+    mount: t => {
+        t.ariaMultiLine = null;
+    },
+    apply: (t, n) => {
+        "insert_text" === t.type ? t = {
+            ...t,
+            text: t.text.replaceAll("\n", "")
+        } : "insert_node" === t.type && (t = {
+            ...t,
+            fragment: [ b(...t.fragment) ]
+        }), n(t);
+    }
+}), vt = t => {
+    let n = "";
+    for (let e = 0; e < t.length; e++) {
+        const r = t[e];
+        g(r) && (n += r.text);
+    }
+    return n;
+}, Mt = ({text: t, singleline: n, plugins: e = [], onChange: r, ...o}) => {
+    const s = [ ...e ];
+    n && s.unshift(_t());
+    const i = l(t);
+    let c = i;
+    return St({
+        ...o,
+        doc: {
+            children: i
+        },
+        plugins: s,
+        onChange: t => {
+            const n = ((t, n) => {
+                const e = t.length, r = n.length, o = Math.min(e, r);
+                let s = 0;
+                for (;s < o && t[s] === n[s]; ) s++;
+                let i = e, c = r;
+                for (;i > s && c > s && t[i - 1] === n[c - 1]; ) i--, c--;
+                const u = c - s, f = Array(u);
+                for (let t = 0; t < u; t++) f[t] = vt(n[s + t]);
+                return {
+                    start: s,
+                    oldCount: i - s,
+                    newCount: u,
+                    lines: f
+                };
+            })(c, t.children);
+            c = t.children, r(f(t), n);
+        }
+    });
+};
+
+export { F as Delete, V as Format, P as InsertNode, R as InsertNodes, H as InsertText, T as ReplaceAll, B as ReplaceText, L as ToggleFormat, y as Transaction, St as createEditor, Mt as createPlainEditor, xt as filePaste, Dt as hotkey, yt as htmlCopy, bt as htmlPaste, wt as internalCopy, Et as internalPaste, mt as plainCopy, kt as plainPaste, _t as singlelinePlugin };
+//# sourceMappingURL=index.js.map