editate 0.6.26 → 0.7.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +22 -16
- package/lib/commands.d.ts +4 -4
- package/lib/doc/node.d.ts +10 -2
- package/lib/doc/operation.d.ts +7 -10
- package/lib/doc/types.d.ts +2 -0
- package/lib/editor.d.ts +6 -4
- package/lib/index.cjs +694 -680
- package/lib/index.cjs.map +1 -1
- package/lib/index.d.ts +1 -1
- package/lib/index.js +630 -613
- package/lib/index.js.map +1 -1
- package/lib/plugins/blockLock.d.ts +1 -2
- package/lib/plugins/index.d.ts +1 -0
- package/lib/plugins/nodeId.d.ts +13 -0
- package/lib/plugins/singleline.d.ts +1 -1
- package/lib/queries.d.ts +10 -2
- package/package.json +32 -30
package/lib/index.js
CHANGED
|
@@ -1,16 +1,16 @@
|
|
|
1
1
|
var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typeof t, c = t => "function" == typeof t, s = c(queueMicrotask) ? queueMicrotask : t => {
|
|
2
2
|
Promise.resolve().then(t);
|
|
3
|
-
}, i = t => "text" in t, l = t => "children" in t, a = t => t.some(l),
|
|
4
|
-
let r = 0
|
|
5
|
-
for (let
|
|
6
|
-
const
|
|
7
|
-
r += d(
|
|
3
|
+
}, i = t => "text" in t, l = t => "children" in t, a = t => t.some(l), f = /* @__PURE__ */ new WeakMap, u = ({children: t}, e = 0, n = t.length) => {
|
|
4
|
+
let r = 0;
|
|
5
|
+
for (let o = e; o < n; o++) {
|
|
6
|
+
const n = t[o];
|
|
7
|
+
r += d(n), o !== e && l(n) && r++;
|
|
8
8
|
}
|
|
9
9
|
return r;
|
|
10
10
|
}, d = t => {
|
|
11
11
|
if (l(t)) {
|
|
12
|
-
let e =
|
|
13
|
-
return null == e &&
|
|
12
|
+
let e = f.get(t);
|
|
13
|
+
return null == e && f.set(t, e = u(t)), e;
|
|
14
14
|
}
|
|
15
15
|
return i(t) ? t.text.length : 1;
|
|
16
16
|
}, p = ({children: t}, e, n) => {
|
|
@@ -23,226 +23,308 @@ var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typ
|
|
|
23
23
|
e -= s;
|
|
24
24
|
}
|
|
25
25
|
return null;
|
|
26
|
-
},
|
|
26
|
+
}, y = (t, e) => {
|
|
27
27
|
const n = [];
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
if (!r) break;
|
|
31
|
-
const o = r[0];
|
|
32
|
-
if (!l(o)) break;
|
|
33
|
-
e = r[1], t = o, n.push(r[2]);
|
|
34
|
-
}
|
|
28
|
+
let r;
|
|
29
|
+
for (;(r = p(t, e)) && l(r[0]); ) e = r[1], t = r[0], n.push(r[2]);
|
|
35
30
|
return [ t, e, n ];
|
|
36
|
-
},
|
|
37
|
-
const [r, o, c] =
|
|
31
|
+
}, h = (t, e, n) => {
|
|
32
|
+
const [r, o, c] = y(t, e), s = p(r, o, n);
|
|
38
33
|
return s ? (c.push(s[2]), [ s[0], s[1], c ]) : null;
|
|
39
|
-
},
|
|
34
|
+
}, g = (t, e) => {
|
|
40
35
|
let n = 0, r = 0;
|
|
41
36
|
for (const o of t.children) {
|
|
42
37
|
const t = l(o);
|
|
43
38
|
if (t && 0 !== r && n++, o === e) return n;
|
|
44
39
|
if (t) {
|
|
45
|
-
const t =
|
|
40
|
+
const t = g(o, e);
|
|
46
41
|
if (null != t) return n + t;
|
|
47
42
|
}
|
|
48
43
|
n += d(o), r++;
|
|
49
44
|
}
|
|
50
45
|
return null;
|
|
51
|
-
}, m = (t, e) => {
|
|
52
|
-
const
|
|
53
|
-
if (
|
|
54
|
-
const
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
...
|
|
59
|
-
|
|
60
|
-
}
|
|
61
|
-
|
|
62
|
-
children: l
|
|
63
|
-
} ];
|
|
64
|
-
}
|
|
65
|
-
{
|
|
66
|
-
const r = n.slice(0, c), s = n.slice(c + 1);
|
|
67
|
-
if (i(e)) {
|
|
68
|
-
const t = e.text.slice(0, o), n = e.text.slice(o);
|
|
69
|
-
!t && r.length || r.push({
|
|
70
|
-
...e,
|
|
71
|
-
text: t
|
|
72
|
-
}), !n && s.length || s.unshift({
|
|
73
|
-
...e,
|
|
74
|
-
text: n
|
|
75
|
-
});
|
|
76
|
-
} else s.unshift(e);
|
|
77
|
-
return [ {
|
|
78
|
-
...t,
|
|
79
|
-
children: r
|
|
80
|
-
}, {
|
|
81
|
-
...t,
|
|
82
|
-
children: s
|
|
83
|
-
} ];
|
|
84
|
-
}
|
|
46
|
+
}, m = (t, e, n = !0) => {
|
|
47
|
+
const r = t.children, o = p(t, e);
|
|
48
|
+
if (!o) {
|
|
49
|
+
const e = r[r.length - 1];
|
|
50
|
+
return [ t, {
|
|
51
|
+
...t,
|
|
52
|
+
children: n && i(e) ? [ {
|
|
53
|
+
...e,
|
|
54
|
+
text: ""
|
|
55
|
+
} ] : []
|
|
56
|
+
} ];
|
|
85
57
|
}
|
|
86
|
-
const o =
|
|
87
|
-
|
|
58
|
+
const [c, s, a] = o, f = r.slice(0, a), u = r.slice(a + 1);
|
|
59
|
+
if (l(c)) {
|
|
60
|
+
const [t, e] = m(c, s, n);
|
|
61
|
+
f.push(t), u.unshift(e);
|
|
62
|
+
} else if (i(c)) {
|
|
63
|
+
const t = c.text.slice(0, s), e = c.text.slice(s);
|
|
64
|
+
!t && f.length || f.push({
|
|
65
|
+
...c,
|
|
66
|
+
text: t
|
|
67
|
+
}), (e || n && !u.length) && u.unshift({
|
|
68
|
+
...c,
|
|
69
|
+
text: e
|
|
70
|
+
});
|
|
71
|
+
} else u.unshift(c);
|
|
72
|
+
return [ {
|
|
88
73
|
...t,
|
|
89
|
-
children:
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
74
|
+
children: f
|
|
75
|
+
}, {
|
|
76
|
+
...t,
|
|
77
|
+
children: u
|
|
93
78
|
} ];
|
|
94
|
-
},
|
|
79
|
+
}, k = (t, [e, n]) => {
|
|
95
80
|
let r = 0;
|
|
96
|
-
for (const o of e) r +=
|
|
81
|
+
for (const o of e) r += u(t, 0, o), 0 !== o && r++, t = t.children[o];
|
|
97
82
|
return r + n;
|
|
98
|
-
},
|
|
99
|
-
const [, n, r] =
|
|
83
|
+
}, x = (t, e) => {
|
|
84
|
+
const [, n, r] = y(t, e);
|
|
100
85
|
return [ r, n ];
|
|
101
|
-
},
|
|
86
|
+
}, v = (t, [e, n]) => [ k(t, e), k(t, n) ];
|
|
102
87
|
|
|
103
|
-
function*
|
|
104
|
-
if (
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
yield [ t, o ], c++, o += d(t), l(t) && o++;
|
|
88
|
+
function* _(n, [r, o]) {
|
|
89
|
+
if (r > o || !l(n)) return;
|
|
90
|
+
const c = p(n, r) || p(n, r, !0);
|
|
91
|
+
if (c) {
|
|
92
|
+
let s = r - c[1], i = c[2];
|
|
93
|
+
const a = n.children, f = a.length;
|
|
94
|
+
for (;s <= o && i < f; ) {
|
|
95
|
+
const n = a[i], c = d(n);
|
|
96
|
+
yield [ n, s, i, [ e(r, s) - s, t(o, s + c) - s ] ], i++, s += c, l(n) && s++;
|
|
113
97
|
}
|
|
114
98
|
}
|
|
115
99
|
}
|
|
116
100
|
|
|
117
|
-
function*
|
|
118
|
-
if (!l(t) || a(t.children)) for (const n of
|
|
119
|
-
|
|
120
|
-
for (const n of v(t, [ 0, d(t) ])) n[1] += e, yield n;
|
|
121
|
-
} else yield [ t, 0 ];
|
|
101
|
+
function* b(t, e) {
|
|
102
|
+
if (!l(t) || a(t.children)) for (const [n, r, , o] of _(t, e)) for (const t of b(n, o)) t[1] += r,
|
|
103
|
+
yield t; else yield [ t, 0, e ];
|
|
122
104
|
}
|
|
123
105
|
|
|
124
106
|
function* T(t, e) {
|
|
125
|
-
if (l(t)) for (const [n, r] of
|
|
126
|
-
yield t; else yield [ t, 0 ];
|
|
107
|
+
if (l(t)) for (const [n, r, , o] of _(t, e)) for (const t of T(n, o)) t[1] += r,
|
|
108
|
+
yield t; else yield [ t, 0, e ];
|
|
127
109
|
}
|
|
128
110
|
|
|
129
|
-
var
|
|
130
|
-
let
|
|
131
|
-
for (const [a,
|
|
132
|
-
for (let t =
|
|
133
|
-
|
|
134
|
-
if (i(a)) {
|
|
135
|
-
const c = e(u, r) - u, i = t(f, o) - u;
|
|
136
|
-
s += 0 === c && i === n ? a.text : a.text.slice(c, i);
|
|
137
|
-
} else c && (s += c(a));
|
|
138
|
-
l = f;
|
|
111
|
+
var w = (e, n = 0, r = 1 / 0, o) => {
|
|
112
|
+
let c = "", s = n;
|
|
113
|
+
for (const [t, l, [a, f]] of T(e, [ n, r ])) {
|
|
114
|
+
for (let t = l - s; t > 0; t--) c += "\n";
|
|
115
|
+
i(t) ? c += t.text.slice(a, f) : o && a < f && (c += o(t)), s = l + d(t);
|
|
139
116
|
}
|
|
140
|
-
for (let
|
|
141
|
-
return
|
|
142
|
-
},
|
|
117
|
+
for (let i = t(r, d(e)) - s; i > 0; i--) c += "\n";
|
|
118
|
+
return c;
|
|
119
|
+
}, E = (t, e, n) => e >= n ? [] : m(m(t, n)[0], e)[1].children, M = ([t, e]) => t > e ? [ e, t ] : [ t, e ], S = ([t, e]) => t === e, A = ([t, e], n) => n ? t < e : t <= e, O = (t, e, n) => t.split("\n").map(t => ({
|
|
143
120
|
...n,
|
|
144
121
|
children: [ {
|
|
145
122
|
...e,
|
|
146
123
|
text: t
|
|
147
124
|
} ]
|
|
148
|
-
})),
|
|
125
|
+
})), R = "delete", D = "insert_text", B = "insert_node", I = "format", L = ({type: t}) => t !== D && t !== R, P = (t, e) => {
|
|
149
126
|
const o = n(t);
|
|
150
127
|
return o.length === n(e).length && o.every(n => n in e && ("text" === n || r(t[n], e[n])));
|
|
151
|
-
},
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
i(e) && i(o) && R(e, o) ? (t[r - 1] = {
|
|
167
|
-
...e,
|
|
168
|
-
text: e.text + o.text
|
|
169
|
-
}, t.splice(r, 1), n--) : r++;
|
|
170
|
-
}
|
|
171
|
-
for (r = e; r <= n; ) {
|
|
172
|
-
const e = t[r];
|
|
173
|
-
i(e) && !e.text && t.length > 1 ? (t.splice(r, 1), n--) : r++;
|
|
174
|
-
}
|
|
175
|
-
})(t, n - 1, n);
|
|
128
|
+
}, H = t => {
|
|
129
|
+
const e = [];
|
|
130
|
+
let n;
|
|
131
|
+
for (let r of t) i(r) && !r.text || (n && i(n) && i(r) && P(n, r) && (r = {
|
|
132
|
+
...n,
|
|
133
|
+
text: n.text + r.text
|
|
134
|
+
}, e.pop()), e.push(n = r));
|
|
135
|
+
return e.length ? e : t.slice(-1);
|
|
136
|
+
}, N = (t, e) => {
|
|
137
|
+
const n = t.length - 1, r = t.concat(e);
|
|
138
|
+
if (n >= 0 && e.length) {
|
|
139
|
+
const e = l(r[n]);
|
|
140
|
+
if (e === l(r[n + 1])) {
|
|
141
|
+
if (!e) return t.slice(0, n).concat(H(r.slice(n)));
|
|
142
|
+
r.splice(n, 2, W(r.slice(n, n + 2)));
|
|
176
143
|
}
|
|
177
144
|
}
|
|
178
|
-
|
|
145
|
+
return r.length || r.push({
|
|
179
146
|
text: ""
|
|
180
|
-
});
|
|
181
|
-
},
|
|
147
|
+
}), r;
|
|
148
|
+
}, W = t => ({
|
|
182
149
|
...t[0],
|
|
183
|
-
children: t.reduce((t, e) => (
|
|
184
|
-
}),
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
150
|
+
children: t.reduce((t, e) => N(t, e.children), [])
|
|
151
|
+
}), C = (t, {range: e, depth: n = -1}, r) => {
|
|
152
|
+
const o = S(e), c = (t, e) => n < 0 ? !!(t & 1 << -n - 1) : n === e, s = (t, e, n, a) => {
|
|
153
|
+
let f = 0, u = !1, p = 0, y = 0;
|
|
154
|
+
const h = [];
|
|
155
|
+
for (const [m, k, x, v] of _(t, e)) {
|
|
156
|
+
h.length || (p = x);
|
|
157
|
+
const t = A(v, d(m)), e = a + k;
|
|
158
|
+
let g = m;
|
|
159
|
+
if (l(m)) {
|
|
160
|
+
let t;
|
|
161
|
+
[g, t] = s(m, v, n + 1, e), f |= t << 1;
|
|
162
|
+
} else if ((t || o) && (f |= 2), t && c(1, n + 1)) {
|
|
163
|
+
const [t, o] = v, c = [ e + t, e + o ];
|
|
164
|
+
i(m) ? (t > 0 && h.push({
|
|
165
|
+
...m,
|
|
166
|
+
text: m.text.slice(0, t)
|
|
167
|
+
}), g = r({
|
|
168
|
+
...m,
|
|
169
|
+
text: m.text.slice(t, o)
|
|
170
|
+
}, n + 1, c), o < m.text.length && (h.push(g), g = {
|
|
171
|
+
...m,
|
|
172
|
+
text: m.text.slice(o)
|
|
173
|
+
})) : g = r(m, n + 1, c);
|
|
174
|
+
}
|
|
175
|
+
g !== m && (u = !0), h.push(g), y = x;
|
|
176
|
+
}
|
|
177
|
+
let g = t;
|
|
178
|
+
if (u) {
|
|
179
|
+
const {children: e} = t, n = e.slice(0, p).concat(h, e.slice(y + 1));
|
|
180
|
+
g = {
|
|
181
|
+
...t,
|
|
182
|
+
children: H(n)
|
|
183
|
+
};
|
|
184
|
+
}
|
|
185
|
+
return c(f, n) && (g = r(g, n, [ a + e[0], a + e[1] ])), [ g, f ];
|
|
186
|
+
};
|
|
187
|
+
return s(t, e, 0, 0)[0];
|
|
188
|
+
}, F = (t, e, n, r) => {
|
|
189
|
+
const o = !r.length, [c, s] = m(t, e, o), i = e < n ? m(t, n, o)[1] : s, l = a(r);
|
|
190
|
+
return l !== a(t.children) && (r = l ? W(r).children : [ {
|
|
196
191
|
children: r
|
|
197
|
-
} ])
|
|
198
|
-
const l = o.children.slice();
|
|
199
|
-
return D(l, r), D(l, s.children), {
|
|
192
|
+
} ]), {
|
|
200
193
|
...t,
|
|
201
|
-
children:
|
|
194
|
+
children: N(N(c.children, r), i.children)
|
|
202
195
|
};
|
|
203
|
-
},
|
|
196
|
+
}, U = (t, e) => e >= 0 && e <= d(t), V = (t, e) => e.reduce((t, e) => q(t, e), t), q = (t, e, n) => {
|
|
204
197
|
switch (e.type) {
|
|
205
|
-
case
|
|
198
|
+
case R:
|
|
206
199
|
{
|
|
207
200
|
const [n, r] = e.range;
|
|
208
201
|
if (t >= n) return r >= t ? n : t + n - r;
|
|
209
202
|
break;
|
|
210
203
|
}
|
|
211
204
|
|
|
212
|
-
case
|
|
205
|
+
case D:
|
|
206
|
+
case B:
|
|
207
|
+
{
|
|
208
|
+
const {at: r} = e;
|
|
209
|
+
if (n ? t > r : t >= r) return t + (e.type === D ? e.text.length : d({
|
|
210
|
+
children: e.fragment
|
|
211
|
+
}));
|
|
212
|
+
break;
|
|
213
|
+
}
|
|
214
|
+
}
|
|
215
|
+
return t;
|
|
216
|
+
}, z = ([t, e], n) => [ q(t, n), q(e, n) ], G = (t, [e, n]) => U(t, e) && U(t, n), J = (t, e, n) => {
|
|
217
|
+
switch (n.type) {
|
|
218
|
+
case R:
|
|
213
219
|
{
|
|
214
|
-
const
|
|
215
|
-
|
|
220
|
+
const [r, o] = n.range;
|
|
221
|
+
G(t, n.range) && r < o && (t = F(t, r, o, []), e = z(e, n));
|
|
216
222
|
break;
|
|
217
223
|
}
|
|
218
224
|
|
|
219
|
-
case
|
|
225
|
+
case D:
|
|
220
226
|
{
|
|
221
|
-
const {at: r,
|
|
222
|
-
if (
|
|
223
|
-
|
|
224
|
-
|
|
227
|
+
const {at: r, text: o} = n;
|
|
228
|
+
if (U(t, r) && o) {
|
|
229
|
+
const [c, s] = y(t, r), l = p(c, s, !0);
|
|
230
|
+
t = F(t, r, r, O(o, l && i(l[0]) ? l[0] : void 0, c)), e = z(e, n);
|
|
231
|
+
}
|
|
232
|
+
break;
|
|
233
|
+
}
|
|
234
|
+
|
|
235
|
+
case B:
|
|
236
|
+
{
|
|
237
|
+
const {at: r, fragment: o} = n;
|
|
238
|
+
U(t, r) && o.length && (t = F(t, r, r, o), e = z(e, n));
|
|
239
|
+
break;
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
case I:
|
|
243
|
+
{
|
|
244
|
+
const {range: e, key: r, value: o, depth: c} = n;
|
|
245
|
+
"text" !== r && ("children" !== r || 0 === c) && G(t, e) && e[0] <= e[1] && (t = C(t, n, t => {
|
|
246
|
+
if (void 0 !== o) return {
|
|
247
|
+
...t,
|
|
248
|
+
[r]: o
|
|
249
|
+
};
|
|
250
|
+
const {[r]: e, ...n} = t;
|
|
251
|
+
return n;
|
|
252
|
+
}));
|
|
225
253
|
break;
|
|
226
254
|
}
|
|
227
255
|
}
|
|
228
|
-
return t;
|
|
229
|
-
},
|
|
256
|
+
return [ t, e ];
|
|
257
|
+
}, X = (t, e) => {
|
|
258
|
+
switch (e.type) {
|
|
259
|
+
case R:
|
|
260
|
+
{
|
|
261
|
+
const {range: n} = e;
|
|
262
|
+
return [ {
|
|
263
|
+
type: B,
|
|
264
|
+
at: n[0],
|
|
265
|
+
fragment: E(t, ...n)
|
|
266
|
+
} ];
|
|
267
|
+
}
|
|
230
268
|
|
|
231
|
-
|
|
232
|
-
|
|
233
|
-
|
|
269
|
+
case D:
|
|
270
|
+
case B:
|
|
271
|
+
{
|
|
272
|
+
const {at: n} = e, r = [ {
|
|
273
|
+
type: R,
|
|
274
|
+
range: [ n, q(n, e) ]
|
|
275
|
+
} ], [o] = y(t, n);
|
|
276
|
+
return d(o) || r.push({
|
|
277
|
+
type: B,
|
|
278
|
+
at: n,
|
|
279
|
+
fragment: o.children
|
|
280
|
+
}), r;
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
case I:
|
|
284
|
+
{
|
|
285
|
+
const {key: n} = e, o = [];
|
|
286
|
+
let c;
|
|
287
|
+
return C(t, e, (t, e, s) => {
|
|
288
|
+
const i = t[n];
|
|
289
|
+
return c && c.depth === e && r(c.value, i) && s[0] - c.range[1] <= 1 && (s = [ c.range[0], s[1] ],
|
|
290
|
+
o.pop()), c = {
|
|
291
|
+
type: I,
|
|
292
|
+
range: s,
|
|
293
|
+
key: n,
|
|
294
|
+
value: i,
|
|
295
|
+
depth: e
|
|
296
|
+
}, o.push(c), t;
|
|
297
|
+
}), o;
|
|
298
|
+
}
|
|
299
|
+
|
|
300
|
+
default:
|
|
301
|
+
return e;
|
|
302
|
+
}
|
|
303
|
+
};
|
|
304
|
+
|
|
305
|
+
function* Y(t, e = M(t.selection)) {
|
|
306
|
+
if (S(e)) {
|
|
307
|
+
const n = h(t.doc, e[0])?.[0];
|
|
234
308
|
n && (yield n);
|
|
235
|
-
} else for (const [n, r] of T(t.doc, e))
|
|
309
|
+
} else for (const [n, , r] of T(t.doc, e)) A(r, d(n)) && (yield n);
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
function* Z(t, e = M(t.selection)) {
|
|
313
|
+
const n = t.doc;
|
|
314
|
+
if (S(e)) {
|
|
315
|
+
const [t, r] = y(n, e[0]);
|
|
316
|
+
yield [ t, e[0] - r, [ r, r ] ];
|
|
317
|
+
} else for (const r of b(n, e)) A(r[2], d(r[0])) && (yield r);
|
|
236
318
|
}
|
|
237
319
|
|
|
238
|
-
function
|
|
320
|
+
function j(t, e = M(t.selection)) {
|
|
239
321
|
t.apply({
|
|
240
322
|
type: "delete",
|
|
241
323
|
range: e
|
|
242
324
|
});
|
|
243
325
|
}
|
|
244
326
|
|
|
245
|
-
function
|
|
327
|
+
function K(t, e, n = t.selection[0]) {
|
|
246
328
|
t.apply({
|
|
247
329
|
type: "insert_text",
|
|
248
330
|
at: n,
|
|
@@ -250,7 +332,7 @@ function z(t, e, n = t.selection[0]) {
|
|
|
250
332
|
});
|
|
251
333
|
}
|
|
252
334
|
|
|
253
|
-
function
|
|
335
|
+
function Q(t, e, n = t.selection[0]) {
|
|
254
336
|
t.apply({
|
|
255
337
|
type: "insert_node",
|
|
256
338
|
at: n,
|
|
@@ -260,96 +342,113 @@ function G(t, e, n = t.selection[0]) {
|
|
|
260
342
|
});
|
|
261
343
|
}
|
|
262
344
|
|
|
263
|
-
function
|
|
264
|
-
t.apply({
|
|
345
|
+
function $(t, e, n = M(t.selection)) {
|
|
346
|
+
t.apply([ {
|
|
265
347
|
type: "delete",
|
|
266
348
|
range: n
|
|
267
|
-
}
|
|
349
|
+
}, {
|
|
268
350
|
type: "insert_text",
|
|
269
351
|
at: n[0],
|
|
270
352
|
text: e
|
|
271
|
-
});
|
|
353
|
+
} ]);
|
|
272
354
|
}
|
|
273
355
|
|
|
274
|
-
function
|
|
356
|
+
function tt(t, e) {
|
|
275
357
|
t.apply({
|
|
276
|
-
type: "
|
|
277
|
-
|
|
358
|
+
type: "format",
|
|
359
|
+
range: [ 0, 0 ],
|
|
278
360
|
key: "children",
|
|
279
|
-
value: e
|
|
361
|
+
value: e,
|
|
362
|
+
depth: 0
|
|
280
363
|
});
|
|
281
364
|
}
|
|
282
365
|
|
|
283
|
-
function
|
|
284
|
-
|
|
366
|
+
function* et(t, [e, n]) {
|
|
367
|
+
if (e >= n) return void (yield [ e, n ]);
|
|
368
|
+
let r = e;
|
|
369
|
+
for (const [o, c, s] of T(t.doc, [ e, n ])) !i(o) && A(s, d(o)) && (r < c && (yield [ r, c ]),
|
|
370
|
+
r = c + 1);
|
|
371
|
+
r < n && (yield [ r, n ]);
|
|
372
|
+
}
|
|
373
|
+
|
|
374
|
+
function nt(t, e, n, r = M(t.selection)) {
|
|
375
|
+
for (const o of et(t, r)) t.apply({
|
|
285
376
|
type: "format",
|
|
286
|
-
range:
|
|
377
|
+
range: o,
|
|
287
378
|
key: e,
|
|
288
379
|
value: n
|
|
289
380
|
});
|
|
290
381
|
}
|
|
291
382
|
|
|
292
|
-
function
|
|
383
|
+
function rt(t, e, n = M(t.selection)) {
|
|
293
384
|
let r = !1, o = !1;
|
|
294
|
-
for (const c of t.exec(
|
|
385
|
+
for (const c of t.exec(Y, n)) if (i(c) && (o = !0, !c[e])) {
|
|
295
386
|
r = !0;
|
|
296
387
|
break;
|
|
297
388
|
}
|
|
298
|
-
o
|
|
389
|
+
if (o) for (const c of et(t, n)) t.apply({
|
|
299
390
|
type: "format",
|
|
300
|
-
range:
|
|
391
|
+
range: c,
|
|
301
392
|
key: e,
|
|
302
393
|
value: r
|
|
303
394
|
});
|
|
304
395
|
}
|
|
305
396
|
|
|
306
|
-
function
|
|
307
|
-
const o = h(t.doc, r)[2];
|
|
397
|
+
function ot(t, e, n, r = M(t.selection)) {
|
|
308
398
|
t.apply({
|
|
309
|
-
type: "
|
|
310
|
-
|
|
399
|
+
type: "format",
|
|
400
|
+
range: r,
|
|
311
401
|
key: e,
|
|
312
|
-
value: n
|
|
402
|
+
value: n,
|
|
403
|
+
depth: -2
|
|
313
404
|
});
|
|
314
405
|
}
|
|
315
406
|
|
|
316
|
-
function
|
|
317
|
-
|
|
407
|
+
function ct(t, e, n, r, o = M(t.selection)) {
|
|
408
|
+
let c = !1;
|
|
409
|
+
for (const [s] of t.exec(Z, o)) if (s[e] !== n) {
|
|
410
|
+
c = !0;
|
|
411
|
+
break;
|
|
412
|
+
}
|
|
318
413
|
t.apply({
|
|
319
|
-
type: "
|
|
320
|
-
|
|
414
|
+
type: "format",
|
|
415
|
+
range: o,
|
|
321
416
|
key: e,
|
|
322
|
-
value: c
|
|
417
|
+
value: c ? n : r,
|
|
418
|
+
depth: -2
|
|
323
419
|
});
|
|
324
420
|
}
|
|
325
421
|
|
|
326
|
-
function
|
|
327
|
-
const o =
|
|
328
|
-
o && !i(o[0])
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
422
|
+
function st(t, e, n, r = t.selection[0]) {
|
|
423
|
+
const o = h(t.doc, r, !0);
|
|
424
|
+
if (o && !i(o[0])) {
|
|
425
|
+
const c = r - o[1];
|
|
426
|
+
t.apply({
|
|
427
|
+
type: "format",
|
|
428
|
+
range: [ c, c + 1 ],
|
|
429
|
+
key: e,
|
|
430
|
+
value: n
|
|
431
|
+
});
|
|
432
|
+
}
|
|
334
433
|
}
|
|
335
434
|
|
|
336
|
-
var
|
|
435
|
+
var it = t => 1 === t.nodeType, lt = t => 8 === t.nodeType, at = /* @__PURE__ */ new Map([ [ "BR", 1 ], [ "WBR", 1 ], [ "AREA", 2 ], [ "BASE", 2 ], [ "DATALIST", 2 ], [ "HEAD", 2 ], [ "LINK", 2 ], [ "META", 2 ], [ "RP", 2 ], [ "SCRIPT", 2 ], [ "STYLE", 2 ], [ "TEMPLATE", 2 ], [ "TITLE", 2 ], [ "COLGROUP", 2 ], [ "HR", 3 ], [ "AUDIO", 3 ], [ "CANVAS", 3 ], [ "EMBED", 3 ], [ "IFRAME", 3 ], [ "IMG", 3 ], [ "OBJECT", 3 ], [ "PICTURE", 3 ], [ "VIDEO", 3 ], [ "SVG", 3 ], [ "MATH", 3 ], [ "BUTTON", 3 ], [ "INPUT", 3 ], [ "METER", 3 ], [ "PROGRESS", 3 ], [ "SELECT", 3 ], [ "TEXTAREA", 3 ] ]), ft = /* @__PURE__ */ new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TH", "TD" ]), ut = t => ft.has(t.tagName), dt = (t, e) => t.compareDocumentPosition(e), pt = t => t.ownerDocument, yt = t => pt(t).getSelection(), ht = (t, e) => {
|
|
337
436
|
if (t.rangeCount) {
|
|
338
437
|
const n = t.getRangeAt(0);
|
|
339
438
|
if (e.contains(n.commonAncestorContainer)) return n;
|
|
340
439
|
}
|
|
341
|
-
},
|
|
342
|
-
const [o, c] = ((t, [e, n]) => [
|
|
343
|
-
return
|
|
344
|
-
|
|
440
|
+
}, gt = (t, e, n, r) => {
|
|
441
|
+
const [o, c] = ((t, [e, n]) => [ x(t, e), x(t, n) ])(n, r), s = pt(t), i = S(r), l = r[0] - r[1] > 0, a = l ? o : c, f = kt(t, e, l ? c : o), u = i ? f : kt(t, e, a), d = s.createRange(), [p, y] = f, [h, g] = u;
|
|
442
|
+
return it(p) && t !== p ? y < 1 ? d.setStartBefore(p) : d.setStartAfter(p) : d.setStart(p, y),
|
|
443
|
+
it(h) && t !== h ? g < 1 ? d.setEndBefore(h) : d.setEndAfter(h) : d.setEnd(h, g),
|
|
345
444
|
d;
|
|
346
|
-
},
|
|
347
|
-
const c =
|
|
348
|
-
if (o ||
|
|
349
|
-
const o =
|
|
445
|
+
}, mt = (t, e, n, r, o) => {
|
|
446
|
+
const c = yt(t);
|
|
447
|
+
if (o || ht(c, t)) {
|
|
448
|
+
const o = gt(t, e, n, r), s = r[0] - r[1] > 0;
|
|
350
449
|
c.removeAllRanges(), c.addRange(o), s && (c.collapseToEnd(), c.extend(o.startContainer, o.startOffset));
|
|
351
450
|
}
|
|
352
|
-
},
|
|
451
|
+
}, kt = (t, e, [n, r]) => e(({t: e, o, i: c, l: s}) => {
|
|
353
452
|
let i, l = 0;
|
|
354
453
|
for (;i = e(); ) if (4 === i) {
|
|
355
454
|
if (l < n.length) for (let t = n[l++]; t > 0; t--) o();
|
|
@@ -359,38 +458,38 @@ var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = new Map([ [ "BR"
|
|
|
359
458
|
r -= t;
|
|
360
459
|
}
|
|
361
460
|
return [ t, 0 ];
|
|
362
|
-
}, t),
|
|
461
|
+
}, t), xt = (e, n, r, o) => {
|
|
363
462
|
let c = !0;
|
|
364
463
|
if (e === r && !r.hasChildNodes()) return [ [], 0 ];
|
|
365
|
-
if (
|
|
464
|
+
if (it(r) && r.hasChildNodes()) {
|
|
366
465
|
const e = t(o, r.childNodes.length - 1);
|
|
367
466
|
r = r.childNodes[e], c = e === o, o = 0;
|
|
368
467
|
}
|
|
369
|
-
return n(({t, u: s, p: i, h: l, i: a, l:
|
|
370
|
-
s(r), 4 !==
|
|
468
|
+
return n(({t, u: s, p: i, h: l, i: a, l: f, m: u}) => {
|
|
469
|
+
s(r), 4 !== u() && i();
|
|
371
470
|
const d = n(() => {
|
|
372
471
|
const t = [];
|
|
373
|
-
for (;
|
|
472
|
+
for (;u() && a() !== e; ) {
|
|
374
473
|
let e = 0;
|
|
375
|
-
for (;l(),
|
|
474
|
+
for (;l(), u(); ) e++;
|
|
376
475
|
t.unshift(e), i();
|
|
377
476
|
}
|
|
378
477
|
return t;
|
|
379
478
|
});
|
|
380
479
|
let p = 0;
|
|
381
480
|
for (;t(); ) {
|
|
382
|
-
const t =
|
|
481
|
+
const t = dt(r, a());
|
|
383
482
|
if (0 === t || 16 & t) {
|
|
384
483
|
if (c) break;
|
|
385
484
|
} else if (4 & t) break;
|
|
386
|
-
p +=
|
|
485
|
+
p += f();
|
|
387
486
|
}
|
|
388
487
|
return [ d, p + o ];
|
|
389
488
|
}, e);
|
|
390
|
-
},
|
|
391
|
-
const s =
|
|
392
|
-
return [ s, r === c && n === o ? s :
|
|
393
|
-
},
|
|
489
|
+
}, vt = (t, e, {startOffset: n, startContainer: r, endOffset: o, endContainer: c}) => {
|
|
490
|
+
const s = xt(t, e, r, n);
|
|
491
|
+
return [ s, r === c && n === o ? s : xt(t, e, c, o) ];
|
|
492
|
+
}, _t = "undefined" != typeof navigator && /Mac|iP(hone|od|ad)/.test(navigator.platform), bt = (t, e) => {
|
|
394
493
|
const n = t.endsWith("+"), r = (n ? t.slice(0, -2) : t).split("+"), o = n ? "+" : r.pop(), c = "Space" === o ? " " : o.toLowerCase();
|
|
395
494
|
let s = !1, i = !1, l = !1, a = !1;
|
|
396
495
|
return r.forEach(t => {
|
|
@@ -404,7 +503,7 @@ var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = new Map([ [ "BR"
|
|
|
404
503
|
break;
|
|
405
504
|
|
|
406
505
|
case "Mod":
|
|
407
|
-
|
|
506
|
+
_t ? l = !0 : i = !0;
|
|
408
507
|
break;
|
|
409
508
|
|
|
410
509
|
case "Alt":
|
|
@@ -419,257 +518,178 @@ var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = new Map([ [ "BR"
|
|
|
419
518
|
};
|
|
420
519
|
};
|
|
421
520
|
|
|
422
|
-
function
|
|
423
|
-
let e = 0,
|
|
424
|
-
const
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
for (const c of n(o)) "children" === c || c in r || t.apply({
|
|
434
|
-
type: "patch_node",
|
|
435
|
-
path: [],
|
|
436
|
-
key: c,
|
|
437
|
-
value: void 0
|
|
438
|
-
});
|
|
439
|
-
}, f = () => {
|
|
440
|
-
if (l()) {
|
|
441
|
-
const n = i()[1];
|
|
442
|
-
e--;
|
|
443
|
-
const r = t.doc;
|
|
444
|
-
o = !0, u(i()[0]), o = !1, r !== t.doc && (t.selection = n);
|
|
521
|
+
function Tt(t) {
|
|
522
|
+
let e = 0, n = /* @__PURE__ */ new WeakMap;
|
|
523
|
+
const r = Date.now, o = [], c = [], s = ([t, e], [, n]) => [ t, n.concat(e) ], i = () => {
|
|
524
|
+
const e = n.get(t.doc);
|
|
525
|
+
return n = /* @__PURE__ */ new WeakMap, e;
|
|
526
|
+
}, l = () => {
|
|
527
|
+
let t = i();
|
|
528
|
+
if (t) {
|
|
529
|
+
const n = r();
|
|
530
|
+
o.length && n - e < 500 && (t = s(o.pop(), t)), e = n, o.push(t), c.length = 0,
|
|
531
|
+
o.length > 100 && o.shift();
|
|
445
532
|
}
|
|
446
|
-
},
|
|
447
|
-
if (
|
|
448
|
-
e
|
|
449
|
-
|
|
450
|
-
|
|
533
|
+
}, a = (e, n) => {
|
|
534
|
+
if (l(), e.length) {
|
|
535
|
+
const [r, o] = e[e.length - 1];
|
|
536
|
+
t.apply(o);
|
|
537
|
+
const c = i();
|
|
538
|
+
c && (e.pop(), n.push(c), t.selection = r);
|
|
451
539
|
}
|
|
540
|
+
}, f = () => {
|
|
541
|
+
a(o, c);
|
|
542
|
+
}, u = () => {
|
|
543
|
+
a(c, o);
|
|
452
544
|
};
|
|
453
|
-
t.hook("apply", (
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
if (l !== u) {
|
|
459
|
-
const t = c();
|
|
460
|
-
if (0 === e || t - r >= 500) {
|
|
461
|
-
e++;
|
|
462
|
-
const t = [ l, a, [] ];
|
|
463
|
-
e >= s.length ? s.push(t) : s[e] = t;
|
|
464
|
-
}
|
|
465
|
-
r = t, s[e][0] = u, s[e][2].push(n), s.length > e + 1 && (s.length = e + 1), e > 500 && (e--,
|
|
466
|
-
s.shift());
|
|
545
|
+
t.hook("apply", (e, r) => {
|
|
546
|
+
const o = t.doc, c = t.selection, i = r(e), l = t.doc;
|
|
547
|
+
if (i && o !== l) {
|
|
548
|
+
const t = [ c, X(o, i) ], e = n.get(o);
|
|
549
|
+
n.set(l, e ? s(e, t) : t);
|
|
467
550
|
}
|
|
468
|
-
}), t.hook("keyboard",
|
|
469
|
-
t.set(
|
|
551
|
+
}), t.on("change", l), t.hook("keyboard", bt("Mod+Z", f)), t.hook("keyboard", bt("Shift+Mod+Z", u)),
|
|
552
|
+
t.set(Tt, {
|
|
470
553
|
undo: f,
|
|
471
|
-
redo:
|
|
472
|
-
|
|
473
|
-
redoable: a,
|
|
474
|
-
clear: () => {
|
|
475
|
-
s.length = 0, s.push([ t.doc, t.selection, [] ]), e = 0, r = 0;
|
|
476
|
-
}
|
|
554
|
+
redo: u,
|
|
555
|
+
stack: t => (l(), t ? c : o)
|
|
477
556
|
});
|
|
478
557
|
}
|
|
479
558
|
|
|
480
|
-
function
|
|
481
|
-
t.get(
|
|
559
|
+
function wt(t) {
|
|
560
|
+
t.get(Tt).undo();
|
|
482
561
|
}
|
|
483
562
|
|
|
484
|
-
function
|
|
485
|
-
t.get(
|
|
563
|
+
function Et(t) {
|
|
564
|
+
t.get(Tt).redo();
|
|
486
565
|
}
|
|
487
566
|
|
|
488
|
-
function
|
|
489
|
-
return t.get(
|
|
567
|
+
function Mt(t) {
|
|
568
|
+
return !!t.get(Tt).stack().length;
|
|
490
569
|
}
|
|
491
570
|
|
|
492
|
-
function
|
|
493
|
-
return t.get(
|
|
571
|
+
function St(t) {
|
|
572
|
+
return !!t.get(Tt).stack(!0).length;
|
|
494
573
|
}
|
|
495
574
|
|
|
496
|
-
function
|
|
497
|
-
t.get(
|
|
575
|
+
function At(t) {
|
|
576
|
+
const {stack: e} = t.get(Tt);
|
|
577
|
+
e().length = 0, e(!0).length = 0;
|
|
498
578
|
}
|
|
499
579
|
|
|
500
|
-
var
|
|
580
|
+
var Ot = [], Rt = () => {}, Dt = t => {
|
|
501
581
|
throw Error(t);
|
|
502
|
-
},
|
|
503
|
-
let
|
|
504
|
-
const
|
|
505
|
-
if (!n) return
|
|
582
|
+
}, Bt = ({doc: t, readonly: e = !1, schema: n, isBlock: r = ut, onWarn: i = console.warn, onError: l = Dt}) => {
|
|
583
|
+
let a = [ 0, 0 ];
|
|
584
|
+
const f = t => {
|
|
585
|
+
if (!n) return i("An unsafe operation was detected. We recommend using schema option."),
|
|
506
586
|
!0;
|
|
507
587
|
const e = n["~standard"].validate(t);
|
|
508
|
-
if (e instanceof Promise)
|
|
588
|
+
if (e instanceof Promise) l("async validate is not supported"); else {
|
|
509
589
|
if (!e.issues) return !0;
|
|
510
|
-
|
|
590
|
+
i(e.issues.map(t => t.message).join("\n"));
|
|
511
591
|
}
|
|
512
592
|
return !1;
|
|
513
593
|
};
|
|
514
|
-
n && !
|
|
515
|
-
const
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
594
|
+
n && !f(t) && l("Invalid document");
|
|
595
|
+
const u = /* @__PURE__ */ new Map, d = /* @__PURE__ */ new WeakMap, p = t => u.get(t) || Ot, y = /* @__PURE__ */ new Map;
|
|
596
|
+
let h = /* @__PURE__ */ new Set;
|
|
597
|
+
const g = t => {
|
|
598
|
+
const e = y.get(t);
|
|
599
|
+
e && (h.size || s(() => {
|
|
600
|
+
const t = h;
|
|
601
|
+
h = /* @__PURE__ */ new Set, t.forEach(t => {
|
|
519
602
|
t();
|
|
520
|
-
})
|
|
603
|
+
});
|
|
521
604
|
}), e.forEach(t => {
|
|
522
|
-
|
|
605
|
+
h.add(t);
|
|
523
606
|
}));
|
|
524
|
-
},
|
|
525
|
-
if (!e)
|
|
526
|
-
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
|
|
535
|
-
|
|
536
|
-
|
|
537
|
-
|
|
538
|
-
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
543
|
-
break;
|
|
544
|
-
}
|
|
545
|
-
|
|
546
|
-
case A:
|
|
547
|
-
{
|
|
548
|
-
const {at: r, text: o} = n;
|
|
549
|
-
if (P(t, r) && o) {
|
|
550
|
-
const [c, s] = h(t, r), l = p(c, s, !0);
|
|
551
|
-
let a;
|
|
552
|
-
if (l) {
|
|
553
|
-
const t = l[0];
|
|
554
|
-
i(t) && (a = t);
|
|
555
|
-
}
|
|
556
|
-
t = L(t, r, r, M(o, a, c)), e = C(e, n);
|
|
557
|
-
}
|
|
558
|
-
break;
|
|
559
|
-
}
|
|
560
|
-
|
|
561
|
-
case O:
|
|
562
|
-
{
|
|
563
|
-
const {at: r, fragment: o} = n;
|
|
564
|
-
P(t, r) && o.length && (t = L(t, r, r, o), e = C(e, n));
|
|
565
|
-
break;
|
|
566
|
-
}
|
|
567
|
-
|
|
568
|
-
case "format":
|
|
569
|
-
{
|
|
570
|
-
const {range: [e, r], key: o, value: c} = n;
|
|
571
|
-
if (P(t, e) && P(t, r) && e <= r) if (e === r) {
|
|
572
|
-
const [{children: n}, , r] = h(t, e);
|
|
573
|
-
if (1 === n.length) {
|
|
574
|
-
const e = n[0];
|
|
575
|
-
i(e) && !e.text && (t = I(t, [ ...r, 0 ], {
|
|
576
|
-
...e,
|
|
577
|
-
[o]: c
|
|
578
|
-
}));
|
|
579
|
-
}
|
|
580
|
-
} else {
|
|
581
|
-
const n = t => l(t) ? {
|
|
582
|
-
...t,
|
|
583
|
-
children: t.children.map(n)
|
|
584
|
-
} : i(t) ? {
|
|
585
|
-
...t,
|
|
586
|
-
[o]: c
|
|
587
|
-
} : t;
|
|
588
|
-
t = L(t, e, r, w(t, e, r).map(n));
|
|
589
|
-
}
|
|
590
|
-
break;
|
|
591
|
-
}
|
|
592
|
-
|
|
593
|
-
case "patch_node":
|
|
594
|
-
{
|
|
595
|
-
const {path: e, key: r, value: o} = n, c = ((t, e) => {
|
|
596
|
-
for (let n = 0; n < e.length; n++) t = t.children[e[n]];
|
|
597
|
-
return t;
|
|
598
|
-
})(t, e);
|
|
599
|
-
c && (t = I(t, e, {
|
|
600
|
-
...c,
|
|
601
|
-
[r]: o
|
|
602
|
-
}));
|
|
603
|
-
break;
|
|
607
|
+
}, m = n => {
|
|
608
|
+
if (!e) {
|
|
609
|
+
const e = p("apply"), r = e.length, o = t, c = a;
|
|
610
|
+
let s = !1;
|
|
611
|
+
try {
|
|
612
|
+
let o = !1;
|
|
613
|
+
for (let c of Array.isArray(n) ? n : [ n ]) {
|
|
614
|
+
let n = 0, s = null;
|
|
615
|
+
const l = () => {
|
|
616
|
+
if (n < r) {
|
|
617
|
+
const t = n;
|
|
618
|
+
e[n](c, f), t === n && f(c);
|
|
619
|
+
} else if (n === r) {
|
|
620
|
+
n++;
|
|
621
|
+
try {
|
|
622
|
+
const [e, n] = J(t, a, c);
|
|
623
|
+
t = e, x(n), s = c, L(c) && (o = !0);
|
|
624
|
+
} catch (l) {
|
|
625
|
+
i("rollback operation: " + l);
|
|
604
626
|
}
|
|
605
627
|
}
|
|
606
|
-
|
|
607
|
-
|
|
608
|
-
(({type: t}) => t !== A && t !== S)(e) && !d(n) || (t = n, R(r));
|
|
609
|
-
} catch (n) {
|
|
610
|
-
a("rollback operation: " + n);
|
|
628
|
+
}, f = t => (null == t ? n = r + 1 : (c = t, n++, l()), s);
|
|
629
|
+
if (l(), !s) return _;
|
|
611
630
|
}
|
|
631
|
+
s = !o || f(t);
|
|
632
|
+
} finally {
|
|
633
|
+
s || (t = o, a = c);
|
|
612
634
|
}
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
|
|
619
|
-
v("selectionchange"));
|
|
620
|
-
}, D = {
|
|
635
|
+
t !== o && g("change");
|
|
636
|
+
}
|
|
637
|
+
return _;
|
|
638
|
+
}, x = e => {
|
|
639
|
+
!G(t, e) || a[0] === e[0] && a[1] === e[1] || (a = e, g("selectionchange"));
|
|
640
|
+
}, _ = {
|
|
621
641
|
get doc() {
|
|
622
642
|
return t;
|
|
623
643
|
},
|
|
624
644
|
get selection() {
|
|
625
|
-
return
|
|
645
|
+
return a;
|
|
626
646
|
},
|
|
627
647
|
set selection(t) {
|
|
628
|
-
|
|
648
|
+
x(t);
|
|
629
649
|
},
|
|
630
650
|
get readonly() {
|
|
631
651
|
return e;
|
|
632
652
|
},
|
|
633
653
|
set readonly(t) {
|
|
634
|
-
e = t,
|
|
654
|
+
e = t, g("readonly");
|
|
635
655
|
},
|
|
636
|
-
apply:
|
|
656
|
+
apply: m,
|
|
637
657
|
on: (t, e) => {
|
|
638
|
-
let n =
|
|
639
|
-
return n ||
|
|
658
|
+
let n = y.get(t);
|
|
659
|
+
return n || y.set(t, n = /* @__PURE__ */ new Set), n.add(e), () => {
|
|
640
660
|
n.delete(e);
|
|
641
661
|
};
|
|
642
662
|
},
|
|
643
663
|
hook: (t, e) => {
|
|
644
|
-
let n =
|
|
645
|
-
return n ||
|
|
664
|
+
let n = u.get(t);
|
|
665
|
+
return n || u.set(t, n = []), n.push(e), () => {
|
|
646
666
|
const t = n.indexOf(e);
|
|
647
667
|
-1 !== t && n.splice(t, 1);
|
|
648
668
|
};
|
|
649
669
|
},
|
|
650
670
|
exec: (t, ...e) => {
|
|
651
|
-
const n = t(
|
|
652
|
-
return void 0 === n ?
|
|
671
|
+
const n = t(_, ...e);
|
|
672
|
+
return void 0 === n ? _ : n;
|
|
653
673
|
},
|
|
654
|
-
get: t => (
|
|
655
|
-
set: (t, e) => (
|
|
674
|
+
get: t => (d.has(t) || l("No value found for key"), d.get(t)),
|
|
675
|
+
set: (t, e) => (d.set(t, e), _),
|
|
656
676
|
input: n => {
|
|
657
|
-
if (!window.InputEvent || !c(InputEvent.prototype.getTargetRanges)) return
|
|
658
|
-
|
|
659
|
-
const {contentEditable: s, role:
|
|
677
|
+
if (!window.InputEvent || !c(InputEvent.prototype.getTargetRanges)) return i("beforeinput event is not supported."),
|
|
678
|
+
Rt;
|
|
679
|
+
const {contentEditable: s, role: l, ariaMultiLine: f, ariaReadOnly: u} = n, d = n.style.whiteSpace;
|
|
660
680
|
n.role = "textbox", n.style.whiteSpace = "pre-wrap", n.ariaMultiLine = "true";
|
|
661
|
-
let
|
|
662
|
-
const
|
|
681
|
+
let y = !1, h = null, g = !1, b = !1, T = !1, w = a, E = null;
|
|
682
|
+
const A = pt(n), O = ((t, e) => {
|
|
663
683
|
let n = null, r = null, o = null;
|
|
664
684
|
const c = () => {
|
|
665
685
|
if (null != o) return o;
|
|
666
686
|
if (r) if ((t => 3 === t.nodeType)(r)) {
|
|
667
687
|
const t = r.data;
|
|
668
688
|
if (t) return o = "\n" === t ? i() ? 3 : 5 : 1;
|
|
669
|
-
} else if (
|
|
689
|
+
} else if (it(r)) {
|
|
670
690
|
if ("false" === r.contentEditable) return o = 2;
|
|
671
691
|
{
|
|
672
|
-
const t =
|
|
692
|
+
const t = at.get(r.tagName);
|
|
673
693
|
if (null != t) return o = 1 === t ? i() ? 3 : 5 : 3 === t ? 2 : 6;
|
|
674
694
|
if (e(r)) return o = 4;
|
|
675
695
|
}
|
|
@@ -685,7 +705,7 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
685
705
|
return r = n.nextNode();
|
|
686
706
|
}, i = () => {
|
|
687
707
|
const t = r.parentNode;
|
|
688
|
-
return
|
|
708
|
+
return u(() => {
|
|
689
709
|
for (o = 0; s(); ) {
|
|
690
710
|
if (c()) return !0;
|
|
691
711
|
if (!t.contains(r)) break;
|
|
@@ -698,14 +718,14 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
698
718
|
}, a = (t, e) => {
|
|
699
719
|
for (;(o = null) || (r = t ? n.previousSibling() : n.nextSibling()); ) if (e ? 4 === c() : !l()) return !0;
|
|
700
720
|
return !1;
|
|
701
|
-
},
|
|
721
|
+
}, f = {
|
|
702
722
|
t: () => {
|
|
703
723
|
for (;s(); ) {
|
|
704
724
|
const t = c();
|
|
705
725
|
if (t && 6 !== t) return t;
|
|
706
726
|
}
|
|
707
727
|
},
|
|
708
|
-
|
|
728
|
+
m: c,
|
|
709
729
|
i: () => r,
|
|
710
730
|
l: () => {
|
|
711
731
|
const t = c();
|
|
@@ -724,41 +744,41 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
724
744
|
p: () => {
|
|
725
745
|
for (;(o = null) || (r = n.parentNode()); ) if (4 === c()) return;
|
|
726
746
|
}
|
|
727
|
-
},
|
|
747
|
+
}, u = (e, c) => {
|
|
728
748
|
const s = n, i = r, l = o;
|
|
729
749
|
try {
|
|
730
|
-
return n || (n = t.createTreeWalker(r = c, 5)), e(
|
|
750
|
+
return n || (n = t.createTreeWalker(r = c, 5)), e(f);
|
|
731
751
|
} finally {
|
|
732
752
|
n = s, r = i, o = l, n && i && (n.currentNode = i);
|
|
733
753
|
}
|
|
734
754
|
};
|
|
735
|
-
return
|
|
736
|
-
})(
|
|
755
|
+
return u;
|
|
756
|
+
})(A, r), R = () => {
|
|
737
757
|
n.contentEditable = e ? "false" : "true", n.ariaReadOnly = e ? "true" : null;
|
|
738
758
|
};
|
|
739
|
-
|
|
740
|
-
const
|
|
741
|
-
|
|
759
|
+
R();
|
|
760
|
+
const D = () => {
|
|
761
|
+
b || (mt(n, O, t, a, !0), w = a, n.focus({
|
|
742
762
|
preventScroll: !0
|
|
743
|
-
});
|
|
744
|
-
},
|
|
745
|
-
|
|
746
|
-
},
|
|
747
|
-
null !=
|
|
748
|
-
},
|
|
749
|
-
|
|
750
|
-
}),
|
|
751
|
-
|
|
752
|
-
}),
|
|
753
|
-
for (const e of
|
|
763
|
+
}));
|
|
764
|
+
}, B = () => {
|
|
765
|
+
E = null, a[0] === w[0] && a[1] === w[1] || (mt(n, O, t, a), w = a);
|
|
766
|
+
}, I = () => {
|
|
767
|
+
null != E && clearTimeout(E);
|
|
768
|
+
}, L = _.on("change", () => {
|
|
769
|
+
b || requestAnimationFrame(D);
|
|
770
|
+
}), P = _.on("selectionchange", () => {
|
|
771
|
+
a[0] === w[0] && a[1] === w[1] || (I(), E = setTimeout(B, 50));
|
|
772
|
+
}), H = _.on("readonly", R), N = t => {
|
|
773
|
+
for (const e of p("paste")) {
|
|
754
774
|
const n = e(t);
|
|
755
775
|
if (n) {
|
|
756
776
|
if (!0 === n) return;
|
|
757
777
|
return n;
|
|
758
778
|
}
|
|
759
779
|
}
|
|
760
|
-
|
|
761
|
-
},
|
|
780
|
+
i("failed to serialize pasted data");
|
|
781
|
+
}, W = ((t, e) => {
|
|
762
782
|
let n = !1, r = [];
|
|
763
783
|
const o = t => {
|
|
764
784
|
n && r.push(...t);
|
|
@@ -777,7 +797,7 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
777
797
|
childList: !0,
|
|
778
798
|
subtree: !0
|
|
779
799
|
}), {
|
|
780
|
-
|
|
800
|
+
k: t => {
|
|
781
801
|
let e;
|
|
782
802
|
for (;e = t.pop(); ) if ("childList" === e.type) {
|
|
783
803
|
const {target: t, removedNodes: n, addedNodes: r, nextSibling: o} = e;
|
|
@@ -786,37 +806,37 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
786
806
|
} else e.target.data = e.oldValue;
|
|
787
807
|
i();
|
|
788
808
|
},
|
|
789
|
-
|
|
809
|
+
v: t => {
|
|
790
810
|
!n && t && s(), n = t;
|
|
791
811
|
},
|
|
792
|
-
|
|
812
|
+
_: i,
|
|
793
813
|
T: () => {
|
|
794
814
|
r.length = 0, c.disconnect();
|
|
795
815
|
}
|
|
796
816
|
};
|
|
797
817
|
})(n, () => {
|
|
798
|
-
|
|
818
|
+
I(), mt(n, O, t, a);
|
|
799
819
|
}), C = () => {
|
|
800
|
-
|
|
801
|
-
const n =
|
|
820
|
+
x(w = v(t, ((t, e) => {
|
|
821
|
+
const n = yt(t), r = ht(n, t);
|
|
802
822
|
if (!r) return [ [ [ 0 ], 0 ], [ [ 0 ], 0 ] ];
|
|
803
|
-
const o =
|
|
823
|
+
const o = vt(t, e, r), c = dt(n.anchorNode, n.focusNode);
|
|
804
824
|
return (0 === c ? n.anchorOffset > n.focusOffset : 2 & c) ? [ o[1], o[0] ] : o;
|
|
805
|
-
})(n,
|
|
806
|
-
},
|
|
807
|
-
const e =
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
},
|
|
811
|
-
if (!
|
|
825
|
+
})(n, O)));
|
|
826
|
+
}, F = () => {
|
|
827
|
+
const e = W._();
|
|
828
|
+
W.v(!1), e.length && (W.k(e), A.removeEventListener("selectionchange", Z), mt(n, O, t, a, !0),
|
|
829
|
+
A.addEventListener("selectionchange", Z)), h && (x(h[1]), m(h[0]), h = null), g = !1;
|
|
830
|
+
}, U = t => {
|
|
831
|
+
if (!g) for (const e of p("keyboard")) if (e(t)) return t.preventDefault(), void W.v(!1);
|
|
812
832
|
}, q = () => {
|
|
813
|
-
|
|
833
|
+
g || F();
|
|
814
834
|
}, z = e => {
|
|
815
835
|
e.preventDefault();
|
|
816
836
|
const r = e.inputType;
|
|
817
837
|
if (r.startsWith("format")) return;
|
|
818
838
|
if ("historyUndo" === r || "historyRedo" === r) return;
|
|
819
|
-
|
|
839
|
+
g ? W.v(!0) : C();
|
|
820
840
|
const o = e.getTargetRanges()[0];
|
|
821
841
|
if (o) {
|
|
822
842
|
let c = "insertParagraph" === r || "insertLineBreak" === r ? "\n" : e.data;
|
|
@@ -824,9 +844,9 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
824
844
|
const t = e.dataTransfer;
|
|
825
845
|
t && (c = t.getData("text/plain"));
|
|
826
846
|
}
|
|
827
|
-
h || (h = [ [],
|
|
828
|
-
const s = h[0], i =
|
|
829
|
-
|
|
847
|
+
h || (h = [ [], a ]);
|
|
848
|
+
const s = h[0], i = v(t, vt(n, O, o));
|
|
849
|
+
S(i) || s.push({
|
|
830
850
|
type: "delete",
|
|
831
851
|
range: i
|
|
832
852
|
}), c && s.push({
|
|
@@ -835,31 +855,31 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
835
855
|
text: c
|
|
836
856
|
});
|
|
837
857
|
}
|
|
838
|
-
|
|
858
|
+
g || F();
|
|
839
859
|
}, G = () => {
|
|
840
|
-
|
|
860
|
+
g || C(), g = !0;
|
|
841
861
|
}, J = () => {
|
|
842
|
-
|
|
862
|
+
F();
|
|
843
863
|
}, X = () => {
|
|
844
|
-
|
|
864
|
+
b = !0, C();
|
|
845
865
|
}, Y = () => {
|
|
846
|
-
|
|
866
|
+
b = !1;
|
|
847
867
|
}, Z = () => {
|
|
848
|
-
!
|
|
868
|
+
!b || g || T || C();
|
|
849
869
|
}, j = t => {
|
|
850
|
-
if (C(), !
|
|
870
|
+
if (C(), !S(a)) for (const e of p("copy")) e(t);
|
|
851
871
|
}, K = t => {
|
|
852
872
|
t.preventDefault(), j(t.clipboardData);
|
|
853
873
|
}, Q = t => {
|
|
854
|
-
t.preventDefault(), e || (j(t.clipboardData),
|
|
874
|
+
t.preventDefault(), e || (j(t.clipboardData), m({
|
|
855
875
|
type: "delete",
|
|
856
|
-
range:
|
|
876
|
+
range: M(a)
|
|
857
877
|
}));
|
|
858
|
-
},
|
|
878
|
+
}, $ = t => {
|
|
859
879
|
t.preventDefault();
|
|
860
|
-
const e =
|
|
880
|
+
const e = N(t.clipboardData);
|
|
861
881
|
if (e) {
|
|
862
|
-
const t =
|
|
882
|
+
const t = M(a), n = t[0], r = [ {
|
|
863
883
|
type: "delete",
|
|
864
884
|
range: t
|
|
865
885
|
} ];
|
|
@@ -871,30 +891,30 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
871
891
|
type: "insert_node",
|
|
872
892
|
at: n,
|
|
873
893
|
fragment: e
|
|
874
|
-
}),
|
|
894
|
+
}), m(r);
|
|
875
895
|
}
|
|
876
|
-
},
|
|
896
|
+
}, tt = e => {
|
|
877
897
|
e.preventDefault();
|
|
878
898
|
const r = e.dataTransfer, c = ((t, e, {clientX: n, clientY: r}) => {
|
|
879
|
-
const o =
|
|
899
|
+
const o = pt(t);
|
|
880
900
|
if (o.caretPositionFromPoint) {
|
|
881
901
|
const c = o.caretPositionFromPoint(n, r);
|
|
882
|
-
if (c) return
|
|
902
|
+
if (c) return xt(t, e, c.offsetNode, c.offset);
|
|
883
903
|
} else if (o.caretRangeFromPoint) {
|
|
884
904
|
const c = o.caretRangeFromPoint(n, r);
|
|
885
|
-
if (c) return
|
|
905
|
+
if (c) return xt(t, e, c.startContainer, c.startOffset);
|
|
886
906
|
}
|
|
887
|
-
})(n,
|
|
907
|
+
})(n, O, e);
|
|
888
908
|
if (r && c) {
|
|
889
909
|
let e;
|
|
890
910
|
const n = [];
|
|
891
|
-
|
|
911
|
+
T && n.push({
|
|
892
912
|
type: "delete",
|
|
893
|
-
range:
|
|
913
|
+
range: M(a)
|
|
894
914
|
});
|
|
895
|
-
const s =
|
|
915
|
+
const s = N(r);
|
|
896
916
|
if (s) {
|
|
897
|
-
const r =
|
|
917
|
+
const r = k(t, c), i = V(r, n);
|
|
898
918
|
n.push(o(s) ? {
|
|
899
919
|
type: "insert_text",
|
|
900
920
|
at: i,
|
|
@@ -903,40 +923,40 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
903
923
|
type: "insert_node",
|
|
904
924
|
at: i,
|
|
905
925
|
fragment: s
|
|
906
|
-
}), e = [ i,
|
|
926
|
+
}), e = [ i, V(r, n) ];
|
|
907
927
|
}
|
|
908
|
-
|
|
928
|
+
m(n), e && x(e);
|
|
909
929
|
}
|
|
910
|
-
|
|
911
|
-
},
|
|
912
|
-
|
|
913
|
-
},
|
|
914
|
-
|
|
930
|
+
T = !1;
|
|
931
|
+
}, et = t => {
|
|
932
|
+
T = !0, j(t.dataTransfer);
|
|
933
|
+
}, nt = () => {
|
|
934
|
+
T = !1;
|
|
915
935
|
};
|
|
916
|
-
|
|
936
|
+
A.addEventListener("selectionchange", Z), n.addEventListener("keydown", U), n.addEventListener("input", q),
|
|
917
937
|
n.addEventListener("beforeinput", z), n.addEventListener("compositionstart", G),
|
|
918
938
|
n.addEventListener("compositionend", J), n.addEventListener("focus", X), n.addEventListener("blur", Y),
|
|
919
|
-
n.addEventListener("copy", K), n.addEventListener("cut", Q), n.addEventListener("paste",
|
|
920
|
-
n.addEventListener("drop",
|
|
921
|
-
const
|
|
922
|
-
return
|
|
923
|
-
const e = t(n,
|
|
924
|
-
e &&
|
|
939
|
+
n.addEventListener("copy", K), n.addEventListener("cut", Q), n.addEventListener("paste", $),
|
|
940
|
+
n.addEventListener("drop", tt), n.addEventListener("dragstart", et), n.addEventListener("dragend", nt);
|
|
941
|
+
const rt = [];
|
|
942
|
+
return p("mount").forEach(t => {
|
|
943
|
+
const e = t(n, O);
|
|
944
|
+
e && rt.push(e);
|
|
925
945
|
}), () => {
|
|
926
|
-
|
|
927
|
-
n.ariaReadOnly = u, n.style.whiteSpace = d,
|
|
928
|
-
n.removeEventListener("keydown",
|
|
946
|
+
y || (y = !0, L(), P(), H(), n.contentEditable = s, n.role = l, n.ariaMultiLine = f,
|
|
947
|
+
n.ariaReadOnly = u, n.style.whiteSpace = d, W.T(), A.removeEventListener("selectionchange", Z),
|
|
948
|
+
n.removeEventListener("keydown", U), n.removeEventListener("input", q), n.removeEventListener("beforeinput", z),
|
|
929
949
|
n.removeEventListener("compositionstart", G), n.removeEventListener("compositionend", J),
|
|
930
950
|
n.removeEventListener("focus", X), n.removeEventListener("blur", Y), n.removeEventListener("copy", K),
|
|
931
|
-
n.removeEventListener("cut", Q), n.removeEventListener("paste",
|
|
932
|
-
n.removeEventListener("dragstart",
|
|
951
|
+
n.removeEventListener("cut", Q), n.removeEventListener("paste", $), n.removeEventListener("drop", tt),
|
|
952
|
+
n.removeEventListener("dragstart", et), n.removeEventListener("dragend", nt), rt.forEach(t => {
|
|
933
953
|
t();
|
|
934
954
|
}));
|
|
935
955
|
};
|
|
936
956
|
}
|
|
937
957
|
};
|
|
938
|
-
return
|
|
939
|
-
},
|
|
958
|
+
return _.exec(Tt), _;
|
|
959
|
+
}, It = (t, e) => {
|
|
940
960
|
t.hook("paste", t => {
|
|
941
961
|
for (const n of t.items) if ("file" === n.kind) {
|
|
942
962
|
const t = e[n.type];
|
|
@@ -951,18 +971,18 @@ var bt = [], vt = () => {}, Tt = t => {
|
|
|
951
971
|
});
|
|
952
972
|
};
|
|
953
973
|
|
|
954
|
-
function
|
|
974
|
+
function Lt(t, e) {
|
|
955
975
|
const n = e && e.voidToString;
|
|
956
976
|
t.hook("copy", e => {
|
|
957
|
-
e.setData("text/plain",
|
|
977
|
+
e.setData("text/plain", w(t.doc, ...M(t.selection), n));
|
|
958
978
|
}), t.hook("paste", t => t.getData("text/plain"));
|
|
959
979
|
}
|
|
960
980
|
|
|
961
|
-
function
|
|
981
|
+
function Pt(t, e) {
|
|
962
982
|
t.hook("mount", (n, r) => {
|
|
963
983
|
const o = t.hook("copy", t => {
|
|
964
984
|
const e = document.createElement("div");
|
|
965
|
-
e.appendChild(
|
|
985
|
+
e.appendChild(ht(yt(n), n).cloneContents()), t.setData("text/html", e.innerHTML);
|
|
966
986
|
}), c = t.hook("paste", t => {
|
|
967
987
|
const n = t.getData("text/html");
|
|
968
988
|
return n ? ((t, e, n) => {
|
|
@@ -974,23 +994,23 @@ function St(t, e) {
|
|
|
974
994
|
}
|
|
975
995
|
};
|
|
976
996
|
let c = (new DOMParser).parseFromString(t, "text/html").body, s = !1;
|
|
977
|
-
for (const i of [ ...c.childNodes ])
|
|
997
|
+
for (const i of [ ...c.childNodes ]) lt(i) ? "StartFragment" === i.data ? (s = !0,
|
|
978
998
|
c = new DocumentFragment) : "EndFragment" === i.data && (s = !1) : s && c.appendChild(i);
|
|
979
999
|
return e(({t, i: e}) => {
|
|
980
1000
|
let n, c = null, s = "", i = !1;
|
|
981
1001
|
const l = [], a = () => {
|
|
982
1002
|
s && (c || (c = []), c.push(r(s)), s = "");
|
|
983
|
-
},
|
|
1003
|
+
}, f = () => {
|
|
984
1004
|
a(), !c && i && (c = []), c && l.push({
|
|
985
1005
|
children: c
|
|
986
1006
|
}), c = null, i = !1;
|
|
987
1007
|
};
|
|
988
|
-
for (;n = t(); ) if (4 === n)
|
|
1008
|
+
for (;n = t(); ) if (4 === n) f(); else if (i = !0, 1 === n) s += e().data; else if (2 === n) {
|
|
989
1009
|
a();
|
|
990
1010
|
const t = o(e());
|
|
991
1011
|
t && c.push(t);
|
|
992
|
-
} else 3 === n &&
|
|
993
|
-
return
|
|
1012
|
+
} else 3 === n && f();
|
|
1013
|
+
return f(), l.length || l.push({
|
|
994
1014
|
children: []
|
|
995
1015
|
}), l;
|
|
996
1016
|
}, c);
|
|
@@ -1002,10 +1022,10 @@ function St(t, e) {
|
|
|
1002
1022
|
});
|
|
1003
1023
|
}
|
|
1004
1024
|
|
|
1005
|
-
function
|
|
1025
|
+
function Ht(t, e) {
|
|
1006
1026
|
const n = e && e.mime || "application/x-editate-editor";
|
|
1007
1027
|
t.hook("copy", e => {
|
|
1008
|
-
e.setData(n, JSON.stringify(
|
|
1028
|
+
e.setData(n, JSON.stringify(E(t.doc, ...M(t.selection))));
|
|
1009
1029
|
}), t.hook("paste", t => {
|
|
1010
1030
|
try {
|
|
1011
1031
|
return JSON.parse(t.getData(n));
|
|
@@ -1015,64 +1035,31 @@ function At(t, e) {
|
|
|
1015
1035
|
});
|
|
1016
1036
|
}
|
|
1017
1037
|
|
|
1018
|
-
function
|
|
1019
|
-
const n = e.isLocked, r = e =>
|
|
1020
|
-
const [
|
|
1021
|
-
for (const [s, i] of v(t.doc, e)) {
|
|
1022
|
-
const t = i + d(s);
|
|
1023
|
-
if ((r ? c >= i && o <= t : c > i && o < t) && n(s)) return !0;
|
|
1024
|
-
}
|
|
1038
|
+
function Nt(t, e) {
|
|
1039
|
+
const n = e.isLocked, r = e => {
|
|
1040
|
+
for (const [r] of b(t.doc, e)) if (n(r)) return !0;
|
|
1025
1041
|
return !1;
|
|
1026
1042
|
};
|
|
1027
|
-
|
|
1028
|
-
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
|
|
1033
|
-
|
|
1034
|
-
}), i(null);
|
|
1035
|
-
break;
|
|
1036
|
-
|
|
1037
|
-
case "insert_text":
|
|
1038
|
-
case "insert_node":
|
|
1039
|
-
if (a || r(e.at)) return i(null);
|
|
1040
|
-
break;
|
|
1041
|
-
|
|
1042
|
-
case "format":
|
|
1043
|
-
{
|
|
1044
|
-
const t = W(e.range);
|
|
1045
|
-
if (F(t) ? r(t[0]) : o(t, !1)) return i(null);
|
|
1046
|
-
break;
|
|
1043
|
+
t.hook("apply", (e, o) => {
|
|
1044
|
+
o((e => {
|
|
1045
|
+
if ("format" !== e.type) return r("delete" === e.type ? M(e.range) : [ e.at, e.at ]);
|
|
1046
|
+
const o = t.doc, c = 0 === e.depth ? [ 0, d(o) ] : M(e.range), s = b(J(o, t.selection, e)[0], c);
|
|
1047
|
+
for (const [t] of b(o, c)) {
|
|
1048
|
+
const e = s.next().value?.[0];
|
|
1049
|
+
if (e && t !== e && n(t) && n(e)) return !0;
|
|
1047
1050
|
}
|
|
1048
|
-
|
|
1049
|
-
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
let o = t.doc;
|
|
1053
|
-
for (let t = 0; t < r.length; t++) {
|
|
1054
|
-
const e = o.children?.[r[t]];
|
|
1055
|
-
if (!e) break;
|
|
1056
|
-
if (o = e, t < r.length - 1 && l(o) && n(o)) return i(null);
|
|
1057
|
-
}
|
|
1058
|
-
if (o !== t.doc && l(o) && n(o) && n({
|
|
1059
|
-
...o,
|
|
1060
|
-
[e.key]: e.value
|
|
1061
|
-
})) return i(null);
|
|
1062
|
-
break;
|
|
1063
|
-
}
|
|
1064
|
-
}
|
|
1065
|
-
i(e);
|
|
1066
|
-
}), t.set(Ot, {
|
|
1067
|
-
locked: t => F(t) ? r(t[0]) : o(t, !0)
|
|
1051
|
+
return !1;
|
|
1052
|
+
})(e) ? null : e);
|
|
1053
|
+
}), t.set(Nt, {
|
|
1054
|
+
locked: r
|
|
1068
1055
|
});
|
|
1069
1056
|
}
|
|
1070
1057
|
|
|
1071
|
-
function
|
|
1072
|
-
return t.get(
|
|
1058
|
+
function Wt(t, e = M(t.selection)) {
|
|
1059
|
+
return t.get(Nt).locked(e);
|
|
1073
1060
|
}
|
|
1074
1061
|
|
|
1075
|
-
function
|
|
1062
|
+
function Ct(t) {
|
|
1076
1063
|
t.hook("apply", t => {
|
|
1077
1064
|
console.log("apply", t);
|
|
1078
1065
|
}), t.on("change", () => {
|
|
@@ -1082,89 +1069,119 @@ function Dt(t) {
|
|
|
1082
1069
|
});
|
|
1083
1070
|
}
|
|
1084
1071
|
|
|
1085
|
-
function
|
|
1072
|
+
function Ft(t, e) {
|
|
1086
1073
|
n(e).forEach(n => {
|
|
1087
1074
|
const r = e[n];
|
|
1088
|
-
t.hook("keyboard",
|
|
1075
|
+
t.hook("keyboard", bt(n, r));
|
|
1089
1076
|
});
|
|
1090
1077
|
}
|
|
1091
1078
|
|
|
1092
|
-
var
|
|
1079
|
+
var Ut = (t, e) => {
|
|
1093
1080
|
const n = parseFloat(t);
|
|
1094
1081
|
return n ? t.endsWith("%") ? n / 100 * e : n : 0;
|
|
1095
|
-
},
|
|
1096
|
-
const
|
|
1097
|
-
return
|
|
1098
|
-
},
|
|
1082
|
+
}, Vt = (t, e, n, r) => [ t + Ut(n, e), t + e - Ut(r, e) ], qt = t => "auto" === t || "scroll" === t || "overlay" === t, zt = (t, e, [n, r]) => t < n ? t - n : e > r ? e - r : 0, Gt = (n, r, o, c) => {
|
|
1083
|
+
const s = c ? -o : 0;
|
|
1084
|
+
return e(s - r, t(n, s + o - r));
|
|
1085
|
+
}, Jt = (t, e, n) => {
|
|
1099
1086
|
(n || e) && t.scrollBy({
|
|
1100
1087
|
top: n,
|
|
1101
1088
|
left: e,
|
|
1102
|
-
behavior:
|
|
1089
|
+
behavior: "auto"
|
|
1103
1090
|
});
|
|
1104
|
-
},
|
|
1105
|
-
|
|
1106
|
-
|
|
1107
|
-
|
|
1108
|
-
|
|
1109
|
-
|
|
1110
|
-
|
|
1111
|
-
|
|
1112
|
-
|
|
1113
|
-
c = c.parentElement;
|
|
1091
|
+
}, Xt = t => {
|
|
1092
|
+
t.hook("mount", (e, n) => {
|
|
1093
|
+
const r = pt(e), o = r.defaultView, {body: c, documentElement: s} = r;
|
|
1094
|
+
let i, l;
|
|
1095
|
+
for (let t = e; t && t !== c && t !== s; t = t.parentElement) {
|
|
1096
|
+
const e = o.getComputedStyle(t);
|
|
1097
|
+
if (qt(e.overflowX) || qt(e.overflowY)) {
|
|
1098
|
+
i = t, l = e;
|
|
1099
|
+
break;
|
|
1114
1100
|
}
|
|
1115
|
-
|
|
1116
|
-
|
|
1117
|
-
let
|
|
1118
|
-
const
|
|
1119
|
-
null ==
|
|
1120
|
-
|
|
1121
|
-
const
|
|
1122
|
-
let
|
|
1123
|
-
if (!
|
|
1124
|
-
const t =
|
|
1125
|
-
e && (
|
|
1101
|
+
}
|
|
1102
|
+
const a = o.getComputedStyle(s);
|
|
1103
|
+
let f = null;
|
|
1104
|
+
const u = t.on("change", () => {
|
|
1105
|
+
null == f && (f = setTimeout(() => {
|
|
1106
|
+
f = null;
|
|
1107
|
+
const r = gt(e, n, t.doc, t.selection);
|
|
1108
|
+
let c = r.getBoundingClientRect();
|
|
1109
|
+
if (!c.width && !c.height) {
|
|
1110
|
+
const t = r.startContainer, e = it(t) ? t : t.parentElement;
|
|
1111
|
+
e && (c = e.getBoundingClientRect());
|
|
1126
1112
|
}
|
|
1127
|
-
|
|
1128
|
-
|
|
1129
|
-
|
|
1130
|
-
|
|
1131
|
-
|
|
1132
|
-
|
|
1133
|
-
|
|
1134
|
-
|
|
1135
|
-
|
|
1136
|
-
return [ !1, e ];
|
|
1113
|
+
let u = 0, d = 0;
|
|
1114
|
+
if (i && l) {
|
|
1115
|
+
const {scrollLeft: t, scrollTop: e, scrollWidth: n, scrollHeight: r, clientLeft: o, clientTop: s, clientWidth: a, clientHeight: f} = i, p = i.getBoundingClientRect(), y = "rtl" === l.direction;
|
|
1116
|
+
let h = y, g = !1;
|
|
1117
|
+
switch (l.writingMode) {
|
|
1118
|
+
case "vertical-rl":
|
|
1119
|
+
case "sideways-rl":
|
|
1120
|
+
h = !0, g = y;
|
|
1121
|
+
break;
|
|
1137
1122
|
|
|
1138
|
-
|
|
1139
|
-
|
|
1123
|
+
case "vertical-lr":
|
|
1124
|
+
h = !1, g = y;
|
|
1125
|
+
break;
|
|
1140
1126
|
|
|
1141
|
-
|
|
1142
|
-
|
|
1143
|
-
|
|
1144
|
-
|
|
1145
|
-
|
|
1146
|
-
}
|
|
1147
|
-
|
|
1148
|
-
|
|
1149
|
-
})(s, a, f, d);
|
|
1150
|
-
i && Ct(i, d, e), Ct(c, p, e);
|
|
1127
|
+
case "sideways-lr":
|
|
1128
|
+
h = !1, g = !y;
|
|
1129
|
+
}
|
|
1130
|
+
d = Gt(zt(c.top, c.bottom, Vt(p.top + s, f, l.scrollPaddingTop, l.scrollPaddingBottom)), e, r - f, g),
|
|
1131
|
+
u = Gt(zt(c.left, c.right, Vt(p.left + o, a, l.scrollPaddingLeft, l.scrollPaddingRight)), t, n - a, h);
|
|
1132
|
+
}
|
|
1133
|
+
const {clientWidth: p, clientHeight: y} = s, h = zt(c.top - d, c.bottom - d, Vt(0, y, a.scrollPaddingTop, a.scrollPaddingBottom)), g = zt(c.left - u, c.right - u, Vt(0, p, a.scrollPaddingLeft, a.scrollPaddingRight));
|
|
1134
|
+
i && Jt(i, u, d), Jt(o, g, h);
|
|
1151
1135
|
}, 50));
|
|
1152
1136
|
});
|
|
1153
1137
|
return () => {
|
|
1154
|
-
null !=
|
|
1138
|
+
null != f && clearTimeout(f), u();
|
|
1155
1139
|
};
|
|
1156
1140
|
});
|
|
1141
|
+
}, Yt = (t, e, n) => {
|
|
1142
|
+
let r = e;
|
|
1143
|
+
for (let o = e + 1; o < n; o++) d(t[o]) > d(t[r]) && (r = o);
|
|
1144
|
+
return r;
|
|
1157
1145
|
};
|
|
1158
1146
|
|
|
1159
|
-
function
|
|
1147
|
+
function Zt(t) {
|
|
1148
|
+
let e = 0, n = t.doc;
|
|
1149
|
+
const r = /* @__PURE__ */ new WeakMap, o = (t, e) => {
|
|
1150
|
+
if (t === e) return;
|
|
1151
|
+
let n = 0, c = t.length, s = e.length;
|
|
1152
|
+
for (;n < c && n < s && t[n] === e[n]; ) n++;
|
|
1153
|
+
for (;n < c && n < s && t[c - 1] === e[s - 1]; ) c--, s--;
|
|
1154
|
+
const i = new Set(e.slice(n, s)), a = c - n, f = s - n;
|
|
1155
|
+
for (let u = n; u < c && u < s; u++) {
|
|
1156
|
+
const d = t[1 === f ? Yt(t, n, c) : u], p = e[1 === a ? Yt(e, n, s) : u];
|
|
1157
|
+
if (i.has(d) || r.has(p)) continue;
|
|
1158
|
+
const y = r.get(d);
|
|
1159
|
+
null != y && (r.delete(d), r.set(p, y)), l(d) && l(p) && o(d.children, p.children);
|
|
1160
|
+
}
|
|
1161
|
+
};
|
|
1162
|
+
t.set(Zt, {
|
|
1163
|
+
id: c => {
|
|
1164
|
+
const s = t.doc;
|
|
1165
|
+
if (s !== n) {
|
|
1166
|
+
const t = n;
|
|
1167
|
+
n = s, o(t.children, s.children);
|
|
1168
|
+
}
|
|
1169
|
+
let i = r.get(c);
|
|
1170
|
+
return null == i && r.set(c, i = ++e + ""), i;
|
|
1171
|
+
}
|
|
1172
|
+
});
|
|
1173
|
+
}
|
|
1174
|
+
|
|
1175
|
+
function jt(t, e) {
|
|
1176
|
+
return t.get(Zt).id(e);
|
|
1177
|
+
}
|
|
1178
|
+
|
|
1179
|
+
function Kt(t, e) {
|
|
1160
1180
|
t.hook("mount", (n, r) => {
|
|
1161
1181
|
let o = !0, c = !1;
|
|
1162
1182
|
const s = t.on("selectionchange", () => {
|
|
1163
1183
|
c || (c = !0, requestAnimationFrame(() => {
|
|
1164
|
-
c = !1, o && e(() =>
|
|
1165
|
-
const e = t.selection;
|
|
1166
|
-
return lt(n, r, t.doc, e).getBoundingClientRect();
|
|
1167
|
-
});
|
|
1184
|
+
c = !1, o && e(() => gt(n, r, t.doc, t.selection).getBoundingClientRect());
|
|
1168
1185
|
}));
|
|
1169
1186
|
});
|
|
1170
1187
|
return () => {
|
|
@@ -1173,7 +1190,7 @@ function Ft(t, e) {
|
|
|
1173
1190
|
});
|
|
1174
1191
|
}
|
|
1175
1192
|
|
|
1176
|
-
function
|
|
1193
|
+
function Qt(t) {
|
|
1177
1194
|
t.hook("mount", t => {
|
|
1178
1195
|
t.ariaMultiLine = null;
|
|
1179
1196
|
}), t.hook("apply", (t, e) => {
|
|
@@ -1184,24 +1201,24 @@ function Ut(t) {
|
|
|
1184
1201
|
const e = t.fragment;
|
|
1185
1202
|
t = {
|
|
1186
1203
|
...t,
|
|
1187
|
-
fragment: a(e) ? [
|
|
1204
|
+
fragment: a(e) ? [ W(e) ] : e
|
|
1188
1205
|
};
|
|
1189
1206
|
}
|
|
1190
1207
|
e(t);
|
|
1191
1208
|
});
|
|
1192
1209
|
}
|
|
1193
1210
|
|
|
1194
|
-
var
|
|
1195
|
-
const o =
|
|
1211
|
+
var $t = ({text: t, singleline: e, onChange: n, ...r}) => {
|
|
1212
|
+
const o = Bt({
|
|
1196
1213
|
...r,
|
|
1197
1214
|
doc: {
|
|
1198
|
-
children:
|
|
1215
|
+
children: O(t)
|
|
1199
1216
|
}
|
|
1200
|
-
}).exec(
|
|
1201
|
-
return e && o.exec(
|
|
1202
|
-
n(
|
|
1217
|
+
}).exec(Lt);
|
|
1218
|
+
return e && o.exec(Qt), o.on("change", () => {
|
|
1219
|
+
n(w(o.doc));
|
|
1203
1220
|
}), o;
|
|
1204
1221
|
};
|
|
1205
1222
|
|
|
1206
|
-
export {
|
|
1223
|
+
export { Z as BlocksInRange, At as ClearHistory, j as Delete, nt as Format, Q as InsertNode, K as InsertText, Y as LeavesInRange, Wt as LockedInRange, jt as NodeId, Et as Redo, St as Redoable, tt as ReplaceDoc, $ as ReplaceText, ot as SetBlockAttr, st as SetVoidAttr, ct as ToggleBlockAttr, rt as ToggleFormat, wt as Undo, Mt as Undoable, Nt as blockLockPlugin, Bt as createEditor, $t as createPlainEditor, Ct as debugPlugin, It as fileTransferPlugin, p as getChildAt, h as getLeafAt, y as getLeafBlockAt, g as getNodeOffset, d as getNodeSize, Pt as htmlTransferPlugin, Ht as internalTransferPlugin, b as iterLeafBlocks, T as iterLeaves, Ft as keymapPlugin, q as mapPosition, Zt as nodeIdPlugin, Lt as plainTransferPlugin, Xt as scrollToSelectionPlugin, Kt as selectionRectPlugin, Qt as singlelinePlugin, w as sliceText };
|
|
1207
1224
|
//# sourceMappingURL=index.js.map
|