@quoreadmin/ui 1.8.8 → 1.8.10
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/dist/index.css +1 -1
- package/dist/index142.js +241 -230
- package/dist/index144.js +1 -1
- package/dist/index186.js +17 -5
- package/dist/index189.js +36 -1190
- package/dist/index191.js +1190 -36
- package/dist/index193.js +19 -19
- package/dist/index194.js +1 -1
- package/dist/index195.js +1 -1
- package/dist/index198.js +2 -2
- package/dist/index200.js +14 -14
- package/dist/index201.js +1 -1
- package/dist/index202.js +1 -1
- package/dist/index203.js +3 -3
- package/dist/index204.js +6 -6
- package/dist/index211.js +2 -2
- package/dist/index212.js +1 -1
- package/dist/index214.js +4 -4
- package/dist/index216.js +1 -1
- package/dist/index217.js +1 -1
- package/dist/index218.js +1 -1
- package/dist/index219.js +4 -4
- package/dist/index221.js +1 -1
- package/dist/index230.js +1 -1
- package/dist/index233.js +1 -1
- package/dist/index241.js +3636 -22
- package/dist/index242.js +55 -22
- package/dist/index243.js +77 -20
- package/dist/index244.js +39 -823
- package/dist/index245.js +198 -685
- package/dist/index246.js +9 -175
- package/dist/index247.js +57 -22
- package/dist/index248.js +61 -20
- package/dist/index249.js +54 -20
- package/dist/index250.js +75 -3
- package/dist/index251.js +709 -170
- package/dist/index252.js +37 -128
- package/dist/index253.js +55 -1214
- package/dist/index254.js +11 -20
- package/dist/index255.js +705 -22
- package/dist/index256.js +820 -22
- package/dist/index257.js +15 -22
- package/dist/index258.js +15 -13
- package/dist/index259.js +12 -12
- package/dist/index260.js +836 -2
- package/dist/index261.js +702 -2
- package/dist/index262.js +170 -3630
- package/dist/index263.js +22 -55
- package/dist/index264.js +20 -77
- package/dist/index265.js +20 -52
- package/dist/index266.js +3 -215
- package/dist/index267.js +187 -10
- package/dist/index268.js +128 -52
- package/dist/index269.js +1214 -52
- package/dist/index270.js +20 -54
- package/dist/index271.js +22 -75
- package/dist/index272.js +21 -725
- package/dist/index273.js +29 -42
- package/dist/index274.js +20 -64
- package/dist/index275.js +20 -11
- package/dist/index276.js +2 -705
- package/dist/index277.js +2 -820
- package/dist/index3.js +4 -66
- package/dist/index308.js +1534 -3
- package/dist/index309.js +382 -23
- package/dist/index310.js +2486 -1289
- package/dist/index311.js +70 -370
- package/dist/index312.js +3470 -2409
- package/dist/index313.js +51 -77
- package/dist/index314.js +13 -3790
- package/dist/index315.js +79 -55
- package/dist/index316.js +202 -15
- package/dist/index317.js +232 -70
- package/dist/index318.js +3 -202
- package/dist/index319.js +21 -240
- package/dist/index333.js +1 -1
- package/dist/index335.js +1 -1
- package/dist/index336.js +2 -2
- package/dist/index340.js +2 -2
- package/dist/index343.js +4 -4
- package/dist/index344.js +5 -5
- package/dist/index345.js +9 -8
- package/dist/index346.js +10 -13
- package/dist/index347.js +13 -54
- package/dist/index348.js +10 -12
- package/dist/index349.js +15 -12
- package/dist/index350.js +8 -57
- package/dist/index351.js +12 -51
- package/dist/index352.js +49 -25
- package/dist/index353.js +12 -2
- package/dist/index354.js +14 -5
- package/dist/index355.js +58 -2
- package/dist/index356.js +52 -23
- package/dist/index357.js +28 -38
- package/dist/index358.js +2 -2
- package/dist/index359.js +4 -10
- package/dist/index360.js +2 -20
- package/dist/index361.js +22 -9
- package/dist/index362.js +40 -9
- package/dist/index363.js +2 -17
- package/dist/index364.js +11 -2
- package/dist/index365.js +20 -9
- package/dist/index366.js +2 -10
- package/dist/index367.js +8 -13
- package/dist/index372.js +30 -12
- package/dist/index373.js +11 -7
- package/dist/index374.js +3 -11
- package/dist/index375.js +3 -4
- package/dist/index376.js +13 -33
- package/dist/index377.js +7 -31
- package/dist/index378.js +12 -28
- package/dist/index379.js +5 -61
- package/dist/index380.js +33 -31
- package/dist/index381.js +31 -11
- package/dist/index382.js +28 -4
- package/dist/index383.js +61 -4
- package/dist/index388.js +1 -1
- package/dist/index44.js +304 -293
- package/dist/index45.js +31 -24
- package/dist/index64.js +86 -48
- package/dist/src/components/activity-item/activity-item.stories.d.ts +3 -0
- package/dist/src/components/activity-item/activity-item.vue.d.ts +35 -2
- package/dist/src/components/comment/comment.d.ts +2 -2
- package/dist/src/components/comment/comment.stories.d.ts +2 -2
- package/dist/src/components/comment-section/comment-section.d.ts +2 -2
- package/dist/src/components/comment-section/comment-section.stories.d.ts +2 -2
- package/dist/src/components/room-details-popover/room-details-popover.d.ts +79 -83
- package/package.json +1 -1
- package/dist/src/components/activity-item/activity-item.d.ts +0 -85
- /package/dist/{index192.js → index190.js} +0 -0
package/dist/index318.js
CHANGED
|
@@ -1,204 +1,5 @@
|
|
|
1
|
-
|
|
2
|
-
import { Plugin as w, TextSelection as m, NodeSelection as x, Selection as u } from "./index277.js";
|
|
3
|
-
import { Fragment as h, Slice as g } from "./index312.js";
|
|
4
|
-
import { DecorationSet as S, Decoration as A } from "./index314.js";
|
|
5
|
-
class i extends u {
|
|
6
|
-
/**
|
|
7
|
-
Create a gap cursor.
|
|
8
|
-
*/
|
|
9
|
-
constructor(e) {
|
|
10
|
-
super(e, e);
|
|
11
|
-
}
|
|
12
|
-
map(e, t) {
|
|
13
|
-
let o = e.resolve(t.map(this.head));
|
|
14
|
-
return i.valid(o) ? new i(o) : u.near(o);
|
|
15
|
-
}
|
|
16
|
-
content() {
|
|
17
|
-
return g.empty;
|
|
18
|
-
}
|
|
19
|
-
eq(e) {
|
|
20
|
-
return e instanceof i && e.head == this.head;
|
|
21
|
-
}
|
|
22
|
-
toJSON() {
|
|
23
|
-
return { type: "gapcursor", pos: this.head };
|
|
24
|
-
}
|
|
25
|
-
/**
|
|
26
|
-
@internal
|
|
27
|
-
*/
|
|
28
|
-
static fromJSON(e, t) {
|
|
29
|
-
if (typeof t.pos != "number")
|
|
30
|
-
throw new RangeError("Invalid input for GapCursor.fromJSON");
|
|
31
|
-
return new i(e.resolve(t.pos));
|
|
32
|
-
}
|
|
33
|
-
/**
|
|
34
|
-
@internal
|
|
35
|
-
*/
|
|
36
|
-
getBookmark() {
|
|
37
|
-
return new d(this.anchor);
|
|
38
|
-
}
|
|
39
|
-
/**
|
|
40
|
-
@internal
|
|
41
|
-
*/
|
|
42
|
-
static valid(e) {
|
|
43
|
-
let t = e.parent;
|
|
44
|
-
if (t.isTextblock || !b(e) || !y(e))
|
|
45
|
-
return !1;
|
|
46
|
-
let o = t.type.spec.allowGapCursor;
|
|
47
|
-
if (o != null)
|
|
48
|
-
return o;
|
|
49
|
-
let r = t.contentMatchAt(e.index()).defaultType;
|
|
50
|
-
return r && r.isTextblock;
|
|
51
|
-
}
|
|
52
|
-
/**
|
|
53
|
-
@internal
|
|
54
|
-
*/
|
|
55
|
-
static findGapCursorFrom(e, t, o = !1) {
|
|
56
|
-
e: for (; ; ) {
|
|
57
|
-
if (!o && i.valid(e))
|
|
58
|
-
return e;
|
|
59
|
-
let r = e.pos, s = null;
|
|
60
|
-
for (let l = e.depth; ; l--) {
|
|
61
|
-
let a = e.node(l);
|
|
62
|
-
if (t > 0 ? e.indexAfter(l) < a.childCount : e.index(l) > 0) {
|
|
63
|
-
s = a.child(t > 0 ? e.indexAfter(l) : e.index(l) - 1);
|
|
64
|
-
break;
|
|
65
|
-
} else if (l == 0)
|
|
66
|
-
return null;
|
|
67
|
-
r += t;
|
|
68
|
-
let f = e.doc.resolve(r);
|
|
69
|
-
if (i.valid(f))
|
|
70
|
-
return f;
|
|
71
|
-
}
|
|
72
|
-
for (; ; ) {
|
|
73
|
-
let l = t > 0 ? s.firstChild : s.lastChild;
|
|
74
|
-
if (!l) {
|
|
75
|
-
if (s.isAtom && !s.isText && !x.isSelectable(s)) {
|
|
76
|
-
e = e.doc.resolve(r + s.nodeSize * t), o = !1;
|
|
77
|
-
continue e;
|
|
78
|
-
}
|
|
79
|
-
break;
|
|
80
|
-
}
|
|
81
|
-
s = l, r += t;
|
|
82
|
-
let a = e.doc.resolve(r);
|
|
83
|
-
if (i.valid(a))
|
|
84
|
-
return a;
|
|
85
|
-
}
|
|
86
|
-
return null;
|
|
87
|
-
}
|
|
88
|
-
}
|
|
89
|
-
}
|
|
90
|
-
i.prototype.visible = !1;
|
|
91
|
-
i.findFrom = i.findGapCursorFrom;
|
|
92
|
-
u.jsonID("gapcursor", i);
|
|
93
|
-
class d {
|
|
94
|
-
constructor(e) {
|
|
95
|
-
this.pos = e;
|
|
96
|
-
}
|
|
97
|
-
map(e) {
|
|
98
|
-
return new d(e.map(this.pos));
|
|
99
|
-
}
|
|
100
|
-
resolve(e) {
|
|
101
|
-
let t = e.resolve(this.pos);
|
|
102
|
-
return i.valid(t) ? new i(t) : u.near(t);
|
|
103
|
-
}
|
|
104
|
-
}
|
|
105
|
-
function C(n) {
|
|
106
|
-
return n.isAtom || n.spec.isolating || n.spec.createGapCursor;
|
|
107
|
-
}
|
|
108
|
-
function b(n) {
|
|
109
|
-
for (let e = n.depth; e >= 0; e--) {
|
|
110
|
-
let t = n.index(e), o = n.node(e);
|
|
111
|
-
if (t == 0) {
|
|
112
|
-
if (o.type.spec.isolating)
|
|
113
|
-
return !0;
|
|
114
|
-
continue;
|
|
115
|
-
}
|
|
116
|
-
for (let r = o.child(t - 1); ; r = r.lastChild) {
|
|
117
|
-
if (r.childCount == 0 && !r.inlineContent || C(r.type))
|
|
118
|
-
return !0;
|
|
119
|
-
if (r.inlineContent)
|
|
120
|
-
return !1;
|
|
121
|
-
}
|
|
122
|
-
}
|
|
123
|
-
return !0;
|
|
124
|
-
}
|
|
125
|
-
function y(n) {
|
|
126
|
-
for (let e = n.depth; e >= 0; e--) {
|
|
127
|
-
let t = n.indexAfter(e), o = n.node(e);
|
|
128
|
-
if (t == o.childCount) {
|
|
129
|
-
if (o.type.spec.isolating)
|
|
130
|
-
return !0;
|
|
131
|
-
continue;
|
|
132
|
-
}
|
|
133
|
-
for (let r = o.child(t); ; r = r.firstChild) {
|
|
134
|
-
if (r.childCount == 0 && !r.inlineContent || C(r.type))
|
|
135
|
-
return !0;
|
|
136
|
-
if (r.inlineContent)
|
|
137
|
-
return !1;
|
|
138
|
-
}
|
|
139
|
-
}
|
|
140
|
-
return !0;
|
|
141
|
-
}
|
|
142
|
-
function B() {
|
|
143
|
-
return new w({
|
|
144
|
-
props: {
|
|
145
|
-
decorations: F,
|
|
146
|
-
createSelectionBetween(n, e, t) {
|
|
147
|
-
return e.pos == t.pos && i.valid(t) ? new i(t) : null;
|
|
148
|
-
},
|
|
149
|
-
handleClick: T,
|
|
150
|
-
handleKeyDown: k,
|
|
151
|
-
handleDOMEvents: { beforeinput: D }
|
|
152
|
-
}
|
|
153
|
-
});
|
|
154
|
-
}
|
|
155
|
-
const k = v({
|
|
156
|
-
ArrowLeft: c("horiz", -1),
|
|
157
|
-
ArrowRight: c("horiz", 1),
|
|
158
|
-
ArrowUp: c("vert", -1),
|
|
159
|
-
ArrowDown: c("vert", 1)
|
|
160
|
-
});
|
|
161
|
-
function c(n, e) {
|
|
162
|
-
const t = n == "vert" ? e > 0 ? "down" : "up" : e > 0 ? "right" : "left";
|
|
163
|
-
return function(o, r, s) {
|
|
164
|
-
let l = o.selection, a = e > 0 ? l.$to : l.$from, f = l.empty;
|
|
165
|
-
if (l instanceof m) {
|
|
166
|
-
if (!s.endOfTextblock(t) || a.depth == 0)
|
|
167
|
-
return !1;
|
|
168
|
-
f = !1, a = o.doc.resolve(e > 0 ? a.after() : a.before());
|
|
169
|
-
}
|
|
170
|
-
let p = i.findGapCursorFrom(a, e, f);
|
|
171
|
-
return p ? (r && r(o.tr.setSelection(new i(p))), !0) : !1;
|
|
172
|
-
};
|
|
173
|
-
}
|
|
174
|
-
function T(n, e, t) {
|
|
175
|
-
if (!n || !n.editable)
|
|
176
|
-
return !1;
|
|
177
|
-
let o = n.state.doc.resolve(e);
|
|
178
|
-
if (!i.valid(o))
|
|
179
|
-
return !1;
|
|
180
|
-
let r = n.posAtCoords({ left: t.clientX, top: t.clientY });
|
|
181
|
-
return r && r.inside > -1 && x.isSelectable(n.state.doc.nodeAt(r.inside)) ? !1 : (n.dispatch(n.state.tr.setSelection(new i(o))), !0);
|
|
182
|
-
}
|
|
183
|
-
function D(n, e) {
|
|
184
|
-
if (e.inputType != "insertCompositionText" || !(n.state.selection instanceof i))
|
|
185
|
-
return !1;
|
|
186
|
-
let { $from: t } = n.state.selection, o = t.parent.contentMatchAt(t.index()).findWrapping(n.state.schema.nodes.text);
|
|
187
|
-
if (!o)
|
|
188
|
-
return !1;
|
|
189
|
-
let r = h.empty;
|
|
190
|
-
for (let l = o.length - 1; l >= 0; l--)
|
|
191
|
-
r = h.from(o[l].createAndFill(null, r));
|
|
192
|
-
let s = n.state.tr.replace(t.pos, t.pos, new g(r, 0, 0));
|
|
193
|
-
return s.setSelection(m.near(s.doc.resolve(t.pos + 1))), n.dispatch(s), !1;
|
|
194
|
-
}
|
|
195
|
-
function F(n) {
|
|
196
|
-
if (!(n.selection instanceof i))
|
|
197
|
-
return null;
|
|
198
|
-
let e = document.createElement("div");
|
|
199
|
-
return e.className = "ProseMirror-gapcursor", S.create(n.doc, [A.widget(n.selection.head, e, { key: "gapcursor" })]);
|
|
200
|
-
}
|
|
1
|
+
const n = 16.666666666666668, t = typeof performance < "u" ? () => performance.now() : () => Date.now(), o = typeof window < "u" ? (e) => window.requestAnimationFrame(e) : (e) => setTimeout(() => e(t()), n);
|
|
201
2
|
export {
|
|
202
|
-
|
|
203
|
-
|
|
3
|
+
n as defaultTimestep,
|
|
4
|
+
o as onNextFrame
|
|
204
5
|
};
|
package/dist/index319.js
CHANGED
|
@@ -1,248 +1,29 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
for (; ; i--)
|
|
16
|
-
if (this.items.get(i - 1).selection) {
|
|
17
|
-
--i;
|
|
18
|
-
break;
|
|
19
|
-
}
|
|
20
|
-
let s, p;
|
|
21
|
-
e && (s = this.remapping(i, this.items.length), p = s.maps.length);
|
|
22
|
-
let l = t.tr, r, m, u = [], f = [];
|
|
23
|
-
return this.items.forEach((a, o) => {
|
|
24
|
-
if (!a.step) {
|
|
25
|
-
s || (s = this.remapping(i, o + 1), p = s.maps.length), p--, f.push(a);
|
|
1
|
+
function p(h) {
|
|
2
|
+
let n = [], s = [], i = 0, f = !1, o = !1;
|
|
3
|
+
const l = /* @__PURE__ */ new WeakSet(), u = {
|
|
4
|
+
schedule: (e, t = !1, r = !1) => {
|
|
5
|
+
const d = r && f, c = d ? n : s;
|
|
6
|
+
return t && l.add(e), c.indexOf(e) === -1 && (c.push(e), d && f && (i = n.length)), e;
|
|
7
|
+
},
|
|
8
|
+
cancel: (e) => {
|
|
9
|
+
const t = s.indexOf(e);
|
|
10
|
+
t !== -1 && s.splice(t, 1), l.delete(e);
|
|
11
|
+
},
|
|
12
|
+
process: (e) => {
|
|
13
|
+
if (f) {
|
|
14
|
+
o = !0;
|
|
26
15
|
return;
|
|
27
16
|
}
|
|
28
|
-
if (s)
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
} else
|
|
33
|
-
l.maybeStep(a.step);
|
|
34
|
-
if (a.selection)
|
|
35
|
-
return r = s ? a.selection.map(s.slice(p)) : a.selection, m = new c(this.items.slice(0, i).append(f.reverse().concat(u)), this.eventCount - 1), !1;
|
|
36
|
-
}, this.items.length, 0), { remaining: m, transform: l, selection: r };
|
|
37
|
-
}
|
|
38
|
-
// Create a new branch with the given transform added.
|
|
39
|
-
addTransform(t, e, i, s) {
|
|
40
|
-
let p = [], l = this.eventCount, r = this.items, m = !s && r.length ? r.get(r.length - 1) : null;
|
|
41
|
-
for (let f = 0; f < t.steps.length; f++) {
|
|
42
|
-
let a = t.steps[f].invert(t.docs[f]), o = new g(t.mapping.maps[f], a, e), d;
|
|
43
|
-
(d = m && m.merge(o)) && (o = d, f ? p.pop() : r = r.slice(0, r.length - 1)), p.push(o), e && (l++, e = void 0), s || (m = o);
|
|
44
|
-
}
|
|
45
|
-
let u = l - i.depth;
|
|
46
|
-
return u > y && (r = x(r, u), l -= u), new c(r.append(p), l);
|
|
47
|
-
}
|
|
48
|
-
remapping(t, e) {
|
|
49
|
-
let i = new k();
|
|
50
|
-
return this.items.forEach((s, p) => {
|
|
51
|
-
let l = s.mirrorOffset != null && p - s.mirrorOffset >= t ? i.maps.length - s.mirrorOffset : void 0;
|
|
52
|
-
i.appendMap(s.map, l);
|
|
53
|
-
}, t, e), i;
|
|
54
|
-
}
|
|
55
|
-
addMaps(t) {
|
|
56
|
-
return this.eventCount == 0 ? this : new c(this.items.append(t.map((e) => new g(e))), this.eventCount);
|
|
57
|
-
}
|
|
58
|
-
// When the collab module receives remote changes, the history has
|
|
59
|
-
// to know about those, so that it can adjust the steps that were
|
|
60
|
-
// rebased on top of the remote changes, and include the position
|
|
61
|
-
// maps for the remote changes in its array of items.
|
|
62
|
-
rebased(t, e) {
|
|
63
|
-
if (!this.eventCount)
|
|
64
|
-
return this;
|
|
65
|
-
let i = [], s = Math.max(0, this.items.length - e), p = t.mapping, l = t.steps.length, r = this.eventCount;
|
|
66
|
-
this.items.forEach((o) => {
|
|
67
|
-
o.selection && r--;
|
|
68
|
-
}, s);
|
|
69
|
-
let m = e;
|
|
70
|
-
this.items.forEach((o) => {
|
|
71
|
-
let d = p.getMirror(--m);
|
|
72
|
-
if (d == null)
|
|
73
|
-
return;
|
|
74
|
-
l = Math.min(l, d);
|
|
75
|
-
let v = p.maps[d];
|
|
76
|
-
if (o.step) {
|
|
77
|
-
let S = t.steps[d].invert(t.docs[d]), E = o.selection && o.selection.map(p.slice(m + 1, d));
|
|
78
|
-
E && r++, i.push(new g(v, S, E));
|
|
79
|
-
} else
|
|
80
|
-
i.push(new g(v));
|
|
81
|
-
}, s);
|
|
82
|
-
let u = [];
|
|
83
|
-
for (let o = e; o < l; o++)
|
|
84
|
-
u.push(new g(p.maps[o]));
|
|
85
|
-
let f = this.items.slice(0, s).append(u).append(i), a = new c(f, r);
|
|
86
|
-
return a.emptyItemCount() > D && (a = a.compress(this.items.length - i.length)), a;
|
|
87
|
-
}
|
|
88
|
-
emptyItemCount() {
|
|
89
|
-
let t = 0;
|
|
90
|
-
return this.items.forEach((e) => {
|
|
91
|
-
e.step || t++;
|
|
92
|
-
}), t;
|
|
93
|
-
}
|
|
94
|
-
// Compressing a branch means rewriting it to push the air (map-only
|
|
95
|
-
// items) out. During collaboration, these naturally accumulate
|
|
96
|
-
// because each remote change adds one. The `upto` argument is used
|
|
97
|
-
// to ensure that only the items below a given level are compressed,
|
|
98
|
-
// because `rebased` relies on a clean, untouched set of items in
|
|
99
|
-
// order to associate old items with rebased steps.
|
|
100
|
-
compress(t = this.items.length) {
|
|
101
|
-
let e = this.remapping(0, t), i = e.maps.length, s = [], p = 0;
|
|
102
|
-
return this.items.forEach((l, r) => {
|
|
103
|
-
if (r >= t)
|
|
104
|
-
s.push(l), l.selection && p++;
|
|
105
|
-
else if (l.step) {
|
|
106
|
-
let m = l.step.map(e.slice(i)), u = m && m.getMap();
|
|
107
|
-
if (i--, u && e.appendMap(u, i), m) {
|
|
108
|
-
let f = l.selection && l.selection.map(e.slice(i));
|
|
109
|
-
f && p++;
|
|
110
|
-
let a = new g(u.invert(), m, f), o, d = s.length - 1;
|
|
111
|
-
(o = s.length && s[d].merge(a)) ? s[d] = o : s.push(a);
|
|
17
|
+
if (f = !0, [n, s] = [s, n], s.length = 0, i = n.length, i)
|
|
18
|
+
for (let t = 0; t < i; t++) {
|
|
19
|
+
const r = n[t];
|
|
20
|
+
r(e), l.has(r) && (u.schedule(r), h());
|
|
112
21
|
}
|
|
113
|
-
|
|
114
|
-
}, this.items.length, 0), new c(P.from(s.reverse()), p);
|
|
115
|
-
}
|
|
116
|
-
}
|
|
117
|
-
c.empty = new c(P.empty, 0);
|
|
118
|
-
function x(n, t) {
|
|
119
|
-
let e;
|
|
120
|
-
return n.forEach((i, s) => {
|
|
121
|
-
if (i.selection && t-- == 0)
|
|
122
|
-
return e = s, !1;
|
|
123
|
-
}), n.slice(e);
|
|
124
|
-
}
|
|
125
|
-
class g {
|
|
126
|
-
constructor(t, e, i, s) {
|
|
127
|
-
this.map = t, this.step = e, this.selection = i, this.mirrorOffset = s;
|
|
128
|
-
}
|
|
129
|
-
merge(t) {
|
|
130
|
-
if (this.step && t.step && !t.selection) {
|
|
131
|
-
let e = t.step.merge(this.step);
|
|
132
|
-
if (e)
|
|
133
|
-
return new g(e.getMap().invert(), e, this.selection);
|
|
134
|
-
}
|
|
135
|
-
}
|
|
136
|
-
}
|
|
137
|
-
class h {
|
|
138
|
-
constructor(t, e, i, s, p) {
|
|
139
|
-
this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
|
|
140
|
-
}
|
|
141
|
-
}
|
|
142
|
-
const y = 20;
|
|
143
|
-
function F(n, t, e, i) {
|
|
144
|
-
let s = e.getMeta(w), p;
|
|
145
|
-
if (s)
|
|
146
|
-
return s.historyState;
|
|
147
|
-
e.getMeta(j) && (n = new h(n.done, n.undone, null, 0, -1));
|
|
148
|
-
let l = e.getMeta("appendedTransaction");
|
|
149
|
-
if (e.steps.length == 0)
|
|
150
|
-
return n;
|
|
151
|
-
if (l && l.getMeta(w))
|
|
152
|
-
return l.getMeta(w).redo ? new h(n.done.addTransform(e, void 0, i, M(t)), n.undone, I(e.mapping.maps), n.prevTime, n.prevComposition) : new h(n.done, n.undone.addTransform(e, void 0, i, M(t)), null, n.prevTime, n.prevComposition);
|
|
153
|
-
if (e.getMeta("addToHistory") !== !1 && !(l && l.getMeta("addToHistory") === !1)) {
|
|
154
|
-
let r = e.getMeta("composition"), m = n.prevTime == 0 || !l && n.prevComposition != r && (n.prevTime < (e.time || 0) - i.newGroupDelay || !G(e, n.prevRanges)), u = l ? C(n.prevRanges, e.mapping) : I(e.mapping.maps);
|
|
155
|
-
return new h(n.done.addTransform(e, m ? t.selection.getBookmark() : void 0, i, M(t)), c.empty, u, e.time, r ?? n.prevComposition);
|
|
156
|
-
} else return (p = e.getMeta("rebased")) ? new h(n.done.rebased(e, p), n.undone.rebased(e, p), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition) : new h(n.done.addMaps(e.mapping.maps), n.undone.addMaps(e.mapping.maps), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition);
|
|
157
|
-
}
|
|
158
|
-
function G(n, t) {
|
|
159
|
-
if (!t)
|
|
160
|
-
return !1;
|
|
161
|
-
if (!n.docChanged)
|
|
162
|
-
return !0;
|
|
163
|
-
let e = !1;
|
|
164
|
-
return n.mapping.maps[0].forEach((i, s) => {
|
|
165
|
-
for (let p = 0; p < t.length; p += 2)
|
|
166
|
-
i <= t[p + 1] && s >= t[p] && (e = !0);
|
|
167
|
-
}), e;
|
|
168
|
-
}
|
|
169
|
-
function I(n) {
|
|
170
|
-
let t = [];
|
|
171
|
-
for (let e = n.length - 1; e >= 0 && t.length == 0; e--)
|
|
172
|
-
n[e].forEach((i, s, p, l) => t.push(p, l));
|
|
173
|
-
return t;
|
|
174
|
-
}
|
|
175
|
-
function C(n, t) {
|
|
176
|
-
if (!n)
|
|
177
|
-
return null;
|
|
178
|
-
let e = [];
|
|
179
|
-
for (let i = 0; i < n.length; i += 2) {
|
|
180
|
-
let s = t.map(n[i], 1), p = t.map(n[i + 1], -1);
|
|
181
|
-
s <= p && e.push(s, p);
|
|
182
|
-
}
|
|
183
|
-
return e;
|
|
184
|
-
}
|
|
185
|
-
function K(n, t, e) {
|
|
186
|
-
let i = M(t), s = w.get(t).spec.config, p = (e ? n.undone : n.done).popEvent(t, i);
|
|
187
|
-
if (!p)
|
|
188
|
-
return null;
|
|
189
|
-
let l = p.selection.resolve(p.transform.doc), r = (e ? n.done : n.undone).addTransform(p.transform, t.selection.getBookmark(), s, i), m = new h(e ? r : p.remaining, e ? p.remaining : r, null, 0, -1);
|
|
190
|
-
return p.transform.setSelection(l).setMeta(w, { redo: e, historyState: m });
|
|
191
|
-
}
|
|
192
|
-
let T = !1, b = null;
|
|
193
|
-
function M(n) {
|
|
194
|
-
let t = n.plugins;
|
|
195
|
-
if (b != t) {
|
|
196
|
-
T = !1, b = t;
|
|
197
|
-
for (let e = 0; e < t.length; e++)
|
|
198
|
-
if (t[e].spec.historyPreserveItems) {
|
|
199
|
-
T = !0;
|
|
200
|
-
break;
|
|
201
|
-
}
|
|
202
|
-
}
|
|
203
|
-
return T;
|
|
204
|
-
}
|
|
205
|
-
const w = new O("history"), j = new O("closeHistory");
|
|
206
|
-
function W(n = {}) {
|
|
207
|
-
return n = {
|
|
208
|
-
depth: n.depth || 100,
|
|
209
|
-
newGroupDelay: n.newGroupDelay || 500
|
|
210
|
-
}, new H({
|
|
211
|
-
key: w,
|
|
212
|
-
state: {
|
|
213
|
-
init() {
|
|
214
|
-
return new h(c.empty, c.empty, null, 0, -1);
|
|
215
|
-
},
|
|
216
|
-
apply(t, e, i) {
|
|
217
|
-
return F(e, i, t, n);
|
|
218
|
-
}
|
|
219
|
-
},
|
|
220
|
-
config: n,
|
|
221
|
-
props: {
|
|
222
|
-
handleDOMEvents: {
|
|
223
|
-
beforeinput(t, e) {
|
|
224
|
-
let i = e.inputType, s = i == "historyUndo" ? A : i == "historyRedo" ? U : null;
|
|
225
|
-
return !s || !t.editable ? !1 : (e.preventDefault(), s(t.state, t.dispatch));
|
|
226
|
-
}
|
|
227
|
-
}
|
|
228
|
-
}
|
|
229
|
-
});
|
|
230
|
-
}
|
|
231
|
-
function R(n, t) {
|
|
232
|
-
return (e, i) => {
|
|
233
|
-
let s = w.getState(e);
|
|
234
|
-
if (!s || (n ? s.undone : s.done).eventCount == 0)
|
|
235
|
-
return !1;
|
|
236
|
-
if (i) {
|
|
237
|
-
let p = K(s, e, n);
|
|
238
|
-
p && i(t ? p.scrollIntoView() : p);
|
|
22
|
+
f = !1, o && (o = !1, u.process(e));
|
|
239
23
|
}
|
|
240
|
-
return !0;
|
|
241
24
|
};
|
|
25
|
+
return u;
|
|
242
26
|
}
|
|
243
|
-
const A = R(!1, !0), U = R(!0, !0);
|
|
244
27
|
export {
|
|
245
|
-
|
|
246
|
-
U as redo,
|
|
247
|
-
A as undo
|
|
28
|
+
p as createRenderStep
|
|
248
29
|
};
|
package/dist/index333.js
CHANGED
package/dist/index335.js
CHANGED
package/dist/index336.js
CHANGED
package/dist/index340.js
CHANGED
package/dist/index343.js
CHANGED
|
@@ -1,13 +1,13 @@
|
|
|
1
1
|
import H from "./index291.js";
|
|
2
|
-
import D from "./
|
|
2
|
+
import D from "./index378.js";
|
|
3
3
|
import L from "./index338.js";
|
|
4
4
|
import n from "./index302.js";
|
|
5
5
|
import y from "./index297.js";
|
|
6
|
-
import O from "./
|
|
6
|
+
import O from "./index379.js";
|
|
7
7
|
import U from "./index340.js";
|
|
8
8
|
import q from "./index305.js";
|
|
9
|
-
import { progressEventReducer as A } from "./
|
|
10
|
-
import v from "./
|
|
9
|
+
import { progressEventReducer as A } from "./index380.js";
|
|
10
|
+
import v from "./index381.js";
|
|
11
11
|
const N = typeof XMLHttpRequest < "u", Q = N && function(s) {
|
|
12
12
|
return new Promise(function(C, i) {
|
|
13
13
|
const t = v(s);
|
package/dist/index344.js
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
1
|
import K from "./index340.js";
|
|
2
2
|
import t from "./index291.js";
|
|
3
3
|
import b from "./index302.js";
|
|
4
|
-
import ee from "./
|
|
5
|
-
import { trackStream as z } from "./
|
|
4
|
+
import ee from "./index382.js";
|
|
5
|
+
import { trackStream as z } from "./index383.js";
|
|
6
6
|
import te from "./index305.js";
|
|
7
|
-
import { progressEventDecorator as I, progressEventReducer as M, asyncDecorator as j } from "./
|
|
8
|
-
import se from "./
|
|
9
|
-
import re from "./
|
|
7
|
+
import { progressEventDecorator as I, progressEventReducer as M, asyncDecorator as j } from "./index380.js";
|
|
8
|
+
import se from "./index381.js";
|
|
9
|
+
import re from "./index378.js";
|
|
10
10
|
const J = 64 * 1024, { isFunction: P } = t, ne = (({ Request: n, Response: o }) => ({
|
|
11
11
|
Request: n,
|
|
12
12
|
Response: o
|
package/dist/index345.js
CHANGED
|
@@ -1,11 +1,12 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
if (e != null && typeof Object.getOwnPropertySymbols == "function")
|
|
5
|
-
for (var r = 0, t = Object.getOwnPropertySymbols(e); r < t.length; r++)
|
|
6
|
-
n.indexOf(t[r]) < 0 && Object.prototype.propertyIsEnumerable.call(e, t[r]) && (o[t[r]] = e[t[r]]);
|
|
7
|
-
return o;
|
|
1
|
+
const a = (s, t) => (o) => Math.max(Math.min(o, t), s), e = (s) => s % 1 ? Number(s.toFixed(5)) : s, n = /(-)?([\d]*\.?[\d])+/g, i = /(#[0-9a-f]{6}|#[0-9a-f]{3}|#(?:[0-9a-f]{2}){2,4}|(rgb|hsl)a?\((-?[\d\.]+%?[,\s]+){2}(-?[\d\.]+%?)\s*[\,\/]?\s*[\d\.]*%?\))/gi, g = /^(#[0-9a-f]{3}|#(?:[0-9a-f]{2}){2,4}|(rgb|hsl)a?\((-?[\d\.]+%?[,\s]+){2}(-?[\d\.]+%?)\s*[\,\/]?\s*[\d\.]*%?\))$/i;
|
|
2
|
+
function r(s) {
|
|
3
|
+
return typeof s == "string";
|
|
8
4
|
}
|
|
9
5
|
export {
|
|
10
|
-
|
|
6
|
+
a as clamp,
|
|
7
|
+
i as colorRegex,
|
|
8
|
+
n as floatRegex,
|
|
9
|
+
r as isString,
|
|
10
|
+
e as sanitize,
|
|
11
|
+
g as singleColorRegex
|
|
11
12
|
};
|
package/dist/index346.js
CHANGED
|
@@ -1,15 +1,12 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import {
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
const e = new Set(Object.keys(t));
|
|
11
|
-
return e.has("ease") || e.has("duration") && !e.has("dampingRatio") ? s : e.has("dampingRatio") || e.has("stiffness") || e.has("mass") || e.has("damping") || e.has("restSpeed") || e.has("restDelta") ? a : s;
|
|
12
|
-
}
|
|
1
|
+
import { alpha as n } from "./index216.js";
|
|
2
|
+
import { percent as t } from "./index218.js";
|
|
3
|
+
import { sanitize as r } from "./index345.js";
|
|
4
|
+
import { splitColor as i, isColorString as e } from "./index347.js";
|
|
5
|
+
const u = {
|
|
6
|
+
test: e("hsl", "hue"),
|
|
7
|
+
parse: i("hue", "saturation", "lightness"),
|
|
8
|
+
transform: ({ hue: o, saturation: s, lightness: a, alpha: m = 1 }) => "hsla(" + Math.round(o) + ", " + t.transform(r(s)) + ", " + t.transform(r(a)) + ", " + r(n.transform(m)) + ")"
|
|
9
|
+
};
|
|
13
10
|
export {
|
|
14
|
-
|
|
11
|
+
u as hsla
|
|
15
12
|
};
|
package/dist/index347.js
CHANGED
|
@@ -1,57 +1,16 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
if (typeof r == "number")
|
|
12
|
-
return A;
|
|
13
|
-
if (typeof r == "string")
|
|
14
|
-
return d.test(r) ? x : g;
|
|
15
|
-
if (Array.isArray(r))
|
|
16
|
-
return h;
|
|
17
|
-
if (typeof r == "object")
|
|
18
|
-
return y;
|
|
19
|
-
}
|
|
20
|
-
function I(r, e, i) {
|
|
21
|
-
const t = [], f = i || u(r[0]), n = r.length - 1;
|
|
22
|
-
for (let o = 0; o < n; o++) {
|
|
23
|
-
let m = f(r[o], r[o + 1]);
|
|
24
|
-
if (e) {
|
|
25
|
-
const s = Array.isArray(e) ? e[o] : e;
|
|
26
|
-
m = b(s, m);
|
|
27
|
-
}
|
|
28
|
-
t.push(m);
|
|
29
|
-
}
|
|
30
|
-
return t;
|
|
31
|
-
}
|
|
32
|
-
function M([r, e], [i]) {
|
|
33
|
-
return (t) => i(c(r, e, t));
|
|
34
|
-
}
|
|
35
|
-
function F(r, e) {
|
|
36
|
-
const i = r.length, t = i - 1;
|
|
37
|
-
return (f) => {
|
|
38
|
-
let n = 0, o = !1;
|
|
39
|
-
if (f <= r[0] ? o = !0 : f >= r[t] && (n = t - 1, o = !0), !o) {
|
|
40
|
-
let s = 1;
|
|
41
|
-
for (; s < i && !(r[s] > f || s === t); s++)
|
|
42
|
-
;
|
|
43
|
-
n = s - 1;
|
|
44
|
-
}
|
|
45
|
-
const m = c(r[n], r[n + 1], f);
|
|
46
|
-
return e[n](m);
|
|
1
|
+
import { isString as l, floatRegex as i, singleColorRegex as c } from "./index345.js";
|
|
2
|
+
const h = (r, o) => (t) => !!(l(t) && c.test(t) && t.startsWith(r) || o && Object.prototype.hasOwnProperty.call(t, o)), f = (r, o, t) => (a) => {
|
|
3
|
+
if (!l(a))
|
|
4
|
+
return a;
|
|
5
|
+
const [s, n, p, e] = a.match(i);
|
|
6
|
+
return {
|
|
7
|
+
[r]: parseFloat(s),
|
|
8
|
+
[o]: parseFloat(n),
|
|
9
|
+
[t]: parseFloat(p),
|
|
10
|
+
alpha: e !== void 0 ? parseFloat(e) : 1
|
|
47
11
|
};
|
|
48
|
-
}
|
|
49
|
-
function R(r, e, { clamp: i = !0, ease: t, mixer: f } = {}) {
|
|
50
|
-
const n = r.length;
|
|
51
|
-
l(n === e.length, "Both input and output ranges must be the same length"), l(!t || !Array.isArray(t) || t.length === n - 1, "Array of easing functions must be of length `input.length - 1`, as it applies to the transitions **between** the defined values."), r[0] > r[n - 1] && (r = [].concat(r), e = [].concat(e), r.reverse(), e.reverse());
|
|
52
|
-
const o = I(e, t, f), m = n === 2 ? M(r, o) : F(r, o);
|
|
53
|
-
return i ? (s) => m(p(r[0], r[n - 1], s)) : m;
|
|
54
|
-
}
|
|
12
|
+
};
|
|
55
13
|
export {
|
|
56
|
-
|
|
14
|
+
h as isColorString,
|
|
15
|
+
f as splitColor
|
|
57
16
|
};
|