@tiptap/extension-list-keymap 2.1.0-rc.13
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 +14 -0
- package/dist/index.cjs +416 -0
- package/dist/index.cjs.map +1 -0
- package/dist/index.js +410 -0
- package/dist/index.js.map +1 -0
- package/dist/index.umd.js +420 -0
- package/dist/index.umd.js.map +1 -0
- package/dist/packages/core/src/helpers/findParentNode.d.ts +8 -0
- package/dist/packages/core/src/helpers/findParentNodeClosestToPos.d.ts +8 -0
- package/dist/packages/core/src/helpers/getNodeAtPosition.d.ts +11 -0
- package/dist/packages/core/src/helpers/getNodeType.d.ts +2 -0
- package/dist/packages/core/src/helpers/isAtEndOfNode.d.ts +2 -0
- package/dist/packages/core/src/helpers/isAtStartOfNode.d.ts +2 -0
- package/dist/packages/core/src/helpers/isNodeActive.d.ts +3 -0
- package/dist/packages/core/src/utilities/isRegExp.d.ts +1 -0
- package/dist/packages/core/src/utilities/objectIncludes.d.ts +8 -0
- package/dist/packages/extension-list-keymap/src/index.d.ts +4 -0
- package/dist/packages/extension-list-keymap/src/list-keymap.d.ts +8 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/findListItemPos.d.ts +6 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/getNextListDepth.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/handleBackspace.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/handleDelete.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/hasListBefore.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/hasListItemAfter.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/hasListItemBefore.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/index.d.ts +10 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/listItemHasSubList.d.ts +3 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/nextListIsDeeper.d.ts +2 -0
- package/dist/packages/extension-list-keymap/src/listHelpers/nextListIsHigher.d.ts +2 -0
- package/package.json +46 -0
- package/src/index.ts +6 -0
- package/src/list-keymap.ts +94 -0
- package/src/listHelpers/findListItemPos.ts +31 -0
- package/src/listHelpers/getNextListDepth.ts +16 -0
- package/src/listHelpers/handleBackspace.ts +76 -0
- package/src/listHelpers/handleDelete.ts +38 -0
- package/src/listHelpers/hasListBefore.ts +15 -0
- package/src/listHelpers/hasListItemAfter.ts +17 -0
- package/src/listHelpers/hasListItemBefore.ts +17 -0
- package/src/listHelpers/index.ts +10 -0
- package/src/listHelpers/listItemHasSubList.ts +22 -0
- package/src/listHelpers/nextListIsDeeper.ts +19 -0
- package/src/listHelpers/nextListIsHigher.ts +19 -0
package/README.md
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
# @tiptap/extension-list-keymap
|
|
2
|
+
[](https://www.npmjs.com/package/@tiptap/extension-list-keymap)
|
|
3
|
+
[](https://npmcharts.com/compare/tiptap?minimal=true)
|
|
4
|
+
[](https://www.npmjs.com/package/@tiptap/extension-list-keymap)
|
|
5
|
+
[](https://github.com/sponsors/ueberdosis)
|
|
6
|
+
|
|
7
|
+
## Introduction
|
|
8
|
+
Tiptap is a headless wrapper around [ProseMirror](https://ProseMirror.net) – a toolkit for building rich text WYSIWYG editors, which is already in use at many well-known companies such as *New York Times*, *The Guardian* or *Atlassian*.
|
|
9
|
+
|
|
10
|
+
## Official Documentation
|
|
11
|
+
Documentation can be found on the [Tiptap website](https://tiptap.dev).
|
|
12
|
+
|
|
13
|
+
## License
|
|
14
|
+
Tiptap is open sourced software licensed under the [MIT license](https://github.com/ueberdosis/tiptap/blob/main/LICENSE.md).
|
package/dist/index.cjs
ADDED
|
@@ -0,0 +1,416 @@
|
|
|
1
|
+
'use strict';
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, '__esModule', { value: true });
|
|
4
|
+
|
|
5
|
+
var core = require('@tiptap/core');
|
|
6
|
+
|
|
7
|
+
function getNodeType(nameOrType, schema) {
|
|
8
|
+
if (typeof nameOrType === 'string') {
|
|
9
|
+
if (!schema.nodes[nameOrType]) {
|
|
10
|
+
throw Error(`There is no node type named '${nameOrType}'. Maybe you forgot to add the extension?`);
|
|
11
|
+
}
|
|
12
|
+
return schema.nodes[nameOrType];
|
|
13
|
+
}
|
|
14
|
+
return nameOrType;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
const findListItemPos = (typeOrName, state) => {
|
|
18
|
+
const { $from } = state.selection;
|
|
19
|
+
const nodeType = getNodeType(typeOrName, state.schema);
|
|
20
|
+
let currentNode = null;
|
|
21
|
+
let currentDepth = $from.depth;
|
|
22
|
+
let currentPos = $from.pos;
|
|
23
|
+
let targetDepth = null;
|
|
24
|
+
while (currentDepth > 0 && targetDepth === null) {
|
|
25
|
+
currentNode = $from.node(currentDepth);
|
|
26
|
+
if (currentNode.type === nodeType) {
|
|
27
|
+
targetDepth = currentDepth;
|
|
28
|
+
}
|
|
29
|
+
else {
|
|
30
|
+
currentDepth -= 1;
|
|
31
|
+
currentPos -= 1;
|
|
32
|
+
}
|
|
33
|
+
}
|
|
34
|
+
if (targetDepth === null) {
|
|
35
|
+
return null;
|
|
36
|
+
}
|
|
37
|
+
return { $pos: state.doc.resolve(currentPos), depth: targetDepth };
|
|
38
|
+
};
|
|
39
|
+
|
|
40
|
+
/**
|
|
41
|
+
* Finds the first node of a given type or name in the current selection.
|
|
42
|
+
* @param state The editor state.
|
|
43
|
+
* @param typeOrName The node type or name.
|
|
44
|
+
* @param pos The position to start searching from.
|
|
45
|
+
* @param maxDepth The maximum depth to search.
|
|
46
|
+
* @returns The node and the depth as an array.
|
|
47
|
+
*/
|
|
48
|
+
const getNodeAtPosition = (state, typeOrName, pos, maxDepth = 20) => {
|
|
49
|
+
const $pos = state.doc.resolve(pos);
|
|
50
|
+
let currentDepth = maxDepth;
|
|
51
|
+
let node = null;
|
|
52
|
+
while (currentDepth > 0 && node === null) {
|
|
53
|
+
const currentNode = $pos.node(currentDepth);
|
|
54
|
+
if ((currentNode === null || currentNode === void 0 ? void 0 : currentNode.type.name) === typeOrName) {
|
|
55
|
+
node = currentNode;
|
|
56
|
+
}
|
|
57
|
+
else {
|
|
58
|
+
currentDepth -= 1;
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
return [node, currentDepth];
|
|
62
|
+
};
|
|
63
|
+
|
|
64
|
+
const getNextListDepth = (typeOrName, state) => {
|
|
65
|
+
const listItemPos = findListItemPos(typeOrName, state);
|
|
66
|
+
if (!listItemPos) {
|
|
67
|
+
return false;
|
|
68
|
+
}
|
|
69
|
+
const [, depth] = getNodeAtPosition(state, typeOrName, listItemPos.$pos.pos + 4);
|
|
70
|
+
return depth;
|
|
71
|
+
};
|
|
72
|
+
|
|
73
|
+
const isAtStartOfNode = (state) => {
|
|
74
|
+
const { $from, $to } = state.selection;
|
|
75
|
+
if ($from.parentOffset > 0 || $from.pos !== $to.pos) {
|
|
76
|
+
return false;
|
|
77
|
+
}
|
|
78
|
+
return true;
|
|
79
|
+
};
|
|
80
|
+
|
|
81
|
+
function isRegExp(value) {
|
|
82
|
+
return Object.prototype.toString.call(value) === '[object RegExp]';
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
/**
|
|
86
|
+
* Check if object1 includes object2
|
|
87
|
+
* @param object1 Object
|
|
88
|
+
* @param object2 Object
|
|
89
|
+
*/
|
|
90
|
+
function objectIncludes(object1, object2, options = { strict: true }) {
|
|
91
|
+
const keys = Object.keys(object2);
|
|
92
|
+
if (!keys.length) {
|
|
93
|
+
return true;
|
|
94
|
+
}
|
|
95
|
+
return keys.every(key => {
|
|
96
|
+
if (options.strict) {
|
|
97
|
+
return object2[key] === object1[key];
|
|
98
|
+
}
|
|
99
|
+
if (isRegExp(object2[key])) {
|
|
100
|
+
return object2[key].test(object1[key]);
|
|
101
|
+
}
|
|
102
|
+
return object2[key] === object1[key];
|
|
103
|
+
});
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
function isNodeActive(state, typeOrName, attributes = {}) {
|
|
107
|
+
const { from, to, empty } = state.selection;
|
|
108
|
+
const type = typeOrName ? getNodeType(typeOrName, state.schema) : null;
|
|
109
|
+
const nodeRanges = [];
|
|
110
|
+
state.doc.nodesBetween(from, to, (node, pos) => {
|
|
111
|
+
if (node.isText) {
|
|
112
|
+
return;
|
|
113
|
+
}
|
|
114
|
+
const relativeFrom = Math.max(from, pos);
|
|
115
|
+
const relativeTo = Math.min(to, pos + node.nodeSize);
|
|
116
|
+
nodeRanges.push({
|
|
117
|
+
node,
|
|
118
|
+
from: relativeFrom,
|
|
119
|
+
to: relativeTo,
|
|
120
|
+
});
|
|
121
|
+
});
|
|
122
|
+
const selectionRange = to - from;
|
|
123
|
+
const matchedNodeRanges = nodeRanges
|
|
124
|
+
.filter(nodeRange => {
|
|
125
|
+
if (!type) {
|
|
126
|
+
return true;
|
|
127
|
+
}
|
|
128
|
+
return type.name === nodeRange.node.type.name;
|
|
129
|
+
})
|
|
130
|
+
.filter(nodeRange => objectIncludes(nodeRange.node.attrs, attributes, { strict: false }));
|
|
131
|
+
if (empty) {
|
|
132
|
+
return !!matchedNodeRanges.length;
|
|
133
|
+
}
|
|
134
|
+
const range = matchedNodeRanges.reduce((sum, nodeRange) => sum + nodeRange.to - nodeRange.from, 0);
|
|
135
|
+
return range >= selectionRange;
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
const hasListBefore = (editorState, name, parentListTypes) => {
|
|
139
|
+
const { $anchor } = editorState.selection;
|
|
140
|
+
const previousNodePos = Math.max(0, $anchor.pos - 2);
|
|
141
|
+
const previousNode = editorState.doc.resolve(previousNodePos).node();
|
|
142
|
+
if (!previousNode || !parentListTypes.includes(previousNode.type.name)) {
|
|
143
|
+
return false;
|
|
144
|
+
}
|
|
145
|
+
return true;
|
|
146
|
+
};
|
|
147
|
+
|
|
148
|
+
const hasListItemBefore = (typeOrName, state) => {
|
|
149
|
+
var _a;
|
|
150
|
+
const { $anchor } = state.selection;
|
|
151
|
+
const $targetPos = state.doc.resolve($anchor.pos - 2);
|
|
152
|
+
if ($targetPos.index() === 0) {
|
|
153
|
+
return false;
|
|
154
|
+
}
|
|
155
|
+
if (((_a = $targetPos.nodeBefore) === null || _a === void 0 ? void 0 : _a.type.name) !== typeOrName) {
|
|
156
|
+
return false;
|
|
157
|
+
}
|
|
158
|
+
return true;
|
|
159
|
+
};
|
|
160
|
+
|
|
161
|
+
const listItemHasSubList = (typeOrName, state, node) => {
|
|
162
|
+
if (!node) {
|
|
163
|
+
return false;
|
|
164
|
+
}
|
|
165
|
+
const nodeType = getNodeType(typeOrName, state.schema);
|
|
166
|
+
let hasSubList = false;
|
|
167
|
+
node.descendants(child => {
|
|
168
|
+
if (child.type === nodeType) {
|
|
169
|
+
hasSubList = true;
|
|
170
|
+
}
|
|
171
|
+
});
|
|
172
|
+
return hasSubList;
|
|
173
|
+
};
|
|
174
|
+
|
|
175
|
+
const handleBackspace = (editor, name, parentListTypes) => {
|
|
176
|
+
// this is required to still handle the undo handling
|
|
177
|
+
if (editor.commands.undoInputRule()) {
|
|
178
|
+
return true;
|
|
179
|
+
}
|
|
180
|
+
// if the current item is NOT inside a list item &
|
|
181
|
+
// the previous item is a list (orderedList or bulletList)
|
|
182
|
+
// move the cursor into the list and delete the current item
|
|
183
|
+
if (!isNodeActive(editor.state, name) && hasListBefore(editor.state, name, parentListTypes)) {
|
|
184
|
+
const { $anchor } = editor.state.selection;
|
|
185
|
+
const $listPos = editor.state.doc.resolve($anchor.before() - 1);
|
|
186
|
+
const listDescendants = [];
|
|
187
|
+
$listPos.node().descendants((node, pos) => {
|
|
188
|
+
if (node.type.name === name) {
|
|
189
|
+
listDescendants.push({ node, pos });
|
|
190
|
+
}
|
|
191
|
+
});
|
|
192
|
+
const lastItem = listDescendants.at(-1);
|
|
193
|
+
if (!lastItem) {
|
|
194
|
+
return false;
|
|
195
|
+
}
|
|
196
|
+
const $lastItemPos = editor.state.doc.resolve($listPos.start() + lastItem.pos + 1);
|
|
197
|
+
return editor.chain().cut({ from: $anchor.start() - 1, to: $anchor.end() + 1 }, $lastItemPos.end()).joinForward().run();
|
|
198
|
+
}
|
|
199
|
+
// if the cursor is not inside the current node type
|
|
200
|
+
// do nothing and proceed
|
|
201
|
+
if (!isNodeActive(editor.state, name)) {
|
|
202
|
+
return false;
|
|
203
|
+
}
|
|
204
|
+
// if the cursor is not at the start of a node
|
|
205
|
+
// do nothing and proceed
|
|
206
|
+
if (!isAtStartOfNode(editor.state)) {
|
|
207
|
+
return false;
|
|
208
|
+
}
|
|
209
|
+
const listItemPos = findListItemPos(name, editor.state);
|
|
210
|
+
if (!listItemPos) {
|
|
211
|
+
return false;
|
|
212
|
+
}
|
|
213
|
+
const $prev = editor.state.doc.resolve(listItemPos.$pos.pos - 2);
|
|
214
|
+
const prevNode = $prev.node(listItemPos.depth);
|
|
215
|
+
const previousListItemHasSubList = listItemHasSubList(name, editor.state, prevNode);
|
|
216
|
+
// if the previous item is a list item and doesn't have a sublist, join the list items
|
|
217
|
+
if (hasListItemBefore(name, editor.state) && !previousListItemHasSubList) {
|
|
218
|
+
return editor.commands.joinItemBackward();
|
|
219
|
+
}
|
|
220
|
+
// otherwise in the end, a backspace should
|
|
221
|
+
// always just lift the list item if
|
|
222
|
+
// joining / merging is not possible
|
|
223
|
+
return editor.chain().liftListItem(name).run();
|
|
224
|
+
};
|
|
225
|
+
|
|
226
|
+
function findParentNodeClosestToPos($pos, predicate) {
|
|
227
|
+
for (let i = $pos.depth; i > 0; i -= 1) {
|
|
228
|
+
const node = $pos.node(i);
|
|
229
|
+
if (predicate(node)) {
|
|
230
|
+
return {
|
|
231
|
+
pos: i > 0 ? $pos.before(i) : 0,
|
|
232
|
+
start: $pos.start(i),
|
|
233
|
+
depth: i,
|
|
234
|
+
node,
|
|
235
|
+
};
|
|
236
|
+
}
|
|
237
|
+
}
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
function findParentNode(predicate) {
|
|
241
|
+
return (selection) => findParentNodeClosestToPos(selection.$from, predicate);
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
const isAtEndOfNode = (state, nodeType) => {
|
|
245
|
+
const { $from, $to, $anchor } = state.selection;
|
|
246
|
+
if (nodeType) {
|
|
247
|
+
const parentNode = findParentNode(node => node.type.name === nodeType)(state.selection);
|
|
248
|
+
if (!parentNode) {
|
|
249
|
+
return false;
|
|
250
|
+
}
|
|
251
|
+
const $parentPos = state.doc.resolve(parentNode.pos + 1);
|
|
252
|
+
if ($anchor.pos + 1 === $parentPos.end()) {
|
|
253
|
+
return true;
|
|
254
|
+
}
|
|
255
|
+
return false;
|
|
256
|
+
}
|
|
257
|
+
if ($to.parentOffset < $to.parent.nodeSize - 2 || $from.pos !== $to.pos) {
|
|
258
|
+
return false;
|
|
259
|
+
}
|
|
260
|
+
return true;
|
|
261
|
+
};
|
|
262
|
+
|
|
263
|
+
const nextListIsDeeper = (typeOrName, state) => {
|
|
264
|
+
const listDepth = getNextListDepth(typeOrName, state);
|
|
265
|
+
const listItemPos = findListItemPos(typeOrName, state);
|
|
266
|
+
if (!listItemPos || !listDepth) {
|
|
267
|
+
return false;
|
|
268
|
+
}
|
|
269
|
+
if (listDepth > listItemPos.depth) {
|
|
270
|
+
return true;
|
|
271
|
+
}
|
|
272
|
+
return false;
|
|
273
|
+
};
|
|
274
|
+
|
|
275
|
+
const nextListIsHigher = (typeOrName, state) => {
|
|
276
|
+
const listDepth = getNextListDepth(typeOrName, state);
|
|
277
|
+
const listItemPos = findListItemPos(typeOrName, state);
|
|
278
|
+
if (!listItemPos || !listDepth) {
|
|
279
|
+
return false;
|
|
280
|
+
}
|
|
281
|
+
if (listDepth < listItemPos.depth) {
|
|
282
|
+
return true;
|
|
283
|
+
}
|
|
284
|
+
return false;
|
|
285
|
+
};
|
|
286
|
+
|
|
287
|
+
const handleDelete = (editor, name) => {
|
|
288
|
+
// if the cursor is not inside the current node type
|
|
289
|
+
// do nothing and proceed
|
|
290
|
+
if (!isNodeActive(editor.state, name)) {
|
|
291
|
+
return false;
|
|
292
|
+
}
|
|
293
|
+
// if the cursor is not at the end of a node
|
|
294
|
+
// do nothing and proceed
|
|
295
|
+
if (!isAtEndOfNode(editor.state, name)) {
|
|
296
|
+
return false;
|
|
297
|
+
}
|
|
298
|
+
// check if the next node is a list with a deeper depth
|
|
299
|
+
if (nextListIsDeeper(name, editor.state)) {
|
|
300
|
+
return editor
|
|
301
|
+
.chain()
|
|
302
|
+
.focus(editor.state.selection.from + 4)
|
|
303
|
+
.lift(name)
|
|
304
|
+
.joinBackward()
|
|
305
|
+
.run();
|
|
306
|
+
}
|
|
307
|
+
if (nextListIsHigher(name, editor.state)) {
|
|
308
|
+
return editor.chain()
|
|
309
|
+
.joinForward()
|
|
310
|
+
.joinBackward()
|
|
311
|
+
.run();
|
|
312
|
+
}
|
|
313
|
+
return editor.commands.joinItemForward();
|
|
314
|
+
};
|
|
315
|
+
|
|
316
|
+
const hasListItemAfter = (typeOrName, state) => {
|
|
317
|
+
var _a;
|
|
318
|
+
const { $anchor } = state.selection;
|
|
319
|
+
const $targetPos = state.doc.resolve($anchor.pos - $anchor.parentOffset - 2);
|
|
320
|
+
if ($targetPos.index() === $targetPos.parent.childCount - 1) {
|
|
321
|
+
return false;
|
|
322
|
+
}
|
|
323
|
+
if (((_a = $targetPos.nodeAfter) === null || _a === void 0 ? void 0 : _a.type.name) !== typeOrName) {
|
|
324
|
+
return false;
|
|
325
|
+
}
|
|
326
|
+
return true;
|
|
327
|
+
};
|
|
328
|
+
|
|
329
|
+
var index = /*#__PURE__*/Object.freeze({
|
|
330
|
+
__proto__: null,
|
|
331
|
+
findListItemPos: findListItemPos,
|
|
332
|
+
getNextListDepth: getNextListDepth,
|
|
333
|
+
handleBackspace: handleBackspace,
|
|
334
|
+
handleDelete: handleDelete,
|
|
335
|
+
hasListBefore: hasListBefore,
|
|
336
|
+
hasListItemAfter: hasListItemAfter,
|
|
337
|
+
hasListItemBefore: hasListItemBefore,
|
|
338
|
+
listItemHasSubList: listItemHasSubList,
|
|
339
|
+
nextListIsDeeper: nextListIsDeeper,
|
|
340
|
+
nextListIsHigher: nextListIsHigher
|
|
341
|
+
});
|
|
342
|
+
|
|
343
|
+
const ListKeymap = core.Extension.create({
|
|
344
|
+
name: 'listKeymap',
|
|
345
|
+
addOptions() {
|
|
346
|
+
return {
|
|
347
|
+
listTypes: [
|
|
348
|
+
{
|
|
349
|
+
itemName: 'listItem',
|
|
350
|
+
wrapperNames: ['bulletList', 'orderedList'],
|
|
351
|
+
},
|
|
352
|
+
{
|
|
353
|
+
itemName: 'taskItem',
|
|
354
|
+
wrapperNames: ['taskList'],
|
|
355
|
+
},
|
|
356
|
+
],
|
|
357
|
+
};
|
|
358
|
+
},
|
|
359
|
+
addKeyboardShortcuts() {
|
|
360
|
+
return {
|
|
361
|
+
Delete: ({ editor }) => {
|
|
362
|
+
let handled = false;
|
|
363
|
+
this.options.listTypes.forEach(({ itemName }) => {
|
|
364
|
+
if (editor.state.schema.nodes[itemName] === undefined) {
|
|
365
|
+
return;
|
|
366
|
+
}
|
|
367
|
+
if (handleDelete(editor, itemName)) {
|
|
368
|
+
handled = true;
|
|
369
|
+
}
|
|
370
|
+
});
|
|
371
|
+
return handled;
|
|
372
|
+
},
|
|
373
|
+
'Mod-Delete': ({ editor }) => {
|
|
374
|
+
let handled = false;
|
|
375
|
+
this.options.listTypes.forEach(({ itemName }) => {
|
|
376
|
+
if (editor.state.schema.nodes[itemName] === undefined) {
|
|
377
|
+
return;
|
|
378
|
+
}
|
|
379
|
+
if (handleDelete(editor, itemName)) {
|
|
380
|
+
handled = true;
|
|
381
|
+
}
|
|
382
|
+
});
|
|
383
|
+
return handled;
|
|
384
|
+
},
|
|
385
|
+
Backspace: ({ editor }) => {
|
|
386
|
+
let handled = false;
|
|
387
|
+
this.options.listTypes.forEach(({ itemName, wrapperNames }) => {
|
|
388
|
+
if (editor.state.schema.nodes[itemName] === undefined) {
|
|
389
|
+
return;
|
|
390
|
+
}
|
|
391
|
+
if (handleBackspace(editor, itemName, wrapperNames)) {
|
|
392
|
+
handled = true;
|
|
393
|
+
}
|
|
394
|
+
});
|
|
395
|
+
return handled;
|
|
396
|
+
},
|
|
397
|
+
'Mod-Backspace': ({ editor }) => {
|
|
398
|
+
let handled = false;
|
|
399
|
+
this.options.listTypes.forEach(({ itemName, wrapperNames }) => {
|
|
400
|
+
if (editor.state.schema.nodes[itemName] === undefined) {
|
|
401
|
+
return;
|
|
402
|
+
}
|
|
403
|
+
if (handleBackspace(editor, itemName, wrapperNames)) {
|
|
404
|
+
handled = true;
|
|
405
|
+
}
|
|
406
|
+
});
|
|
407
|
+
return handled;
|
|
408
|
+
},
|
|
409
|
+
};
|
|
410
|
+
},
|
|
411
|
+
});
|
|
412
|
+
|
|
413
|
+
exports.ListKeymap = ListKeymap;
|
|
414
|
+
exports["default"] = ListKeymap;
|
|
415
|
+
exports.listHelpers = index;
|
|
416
|
+
//# sourceMappingURL=index.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.cjs","sources":["../../core/src/helpers/getNodeType.ts","../src/listHelpers/findListItemPos.ts","../../core/src/helpers/getNodeAtPosition.ts","../src/listHelpers/getNextListDepth.ts","../../core/src/helpers/isAtStartOfNode.ts","../../core/src/utilities/isRegExp.ts","../../core/src/utilities/objectIncludes.ts","../../core/src/helpers/isNodeActive.ts","../src/listHelpers/hasListBefore.ts","../src/listHelpers/hasListItemBefore.ts","../src/listHelpers/listItemHasSubList.ts","../src/listHelpers/handleBackspace.ts","../../core/src/helpers/findParentNodeClosestToPos.ts","../../core/src/helpers/findParentNode.ts","../../core/src/helpers/isAtEndOfNode.ts","../src/listHelpers/nextListIsDeeper.ts","../src/listHelpers/nextListIsHigher.ts","../src/listHelpers/handleDelete.ts","../src/listHelpers/hasListItemAfter.ts","../src/list-keymap.ts"],"sourcesContent":["import { NodeType, Schema } from '@tiptap/pm/model'\n\nexport function getNodeType(nameOrType: string | NodeType, schema: Schema): NodeType {\n if (typeof nameOrType === 'string') {\n if (!schema.nodes[nameOrType]) {\n throw Error(\n `There is no node type named '${nameOrType}'. Maybe you forgot to add the extension?`,\n )\n }\n\n return schema.nodes[nameOrType]\n }\n\n return nameOrType\n}\n","import { NodeType } from '@tiptap/pm/model'\nimport { EditorState } from '@tiptap/pm/state'\n\nimport { getNodeType } from '../../../core/src/helpers/getNodeType.js'\n\nexport const findListItemPos = (typeOrName: string | NodeType, state: EditorState) => {\n const { $from } = state.selection\n const nodeType = getNodeType(typeOrName, state.schema)\n\n let currentNode = null\n let currentDepth = $from.depth\n let currentPos = $from.pos\n let targetDepth: number | null = null\n\n while (currentDepth > 0 && targetDepth === null) {\n currentNode = $from.node(currentDepth)\n\n if (currentNode.type === nodeType) {\n targetDepth = currentDepth\n } else {\n currentDepth -= 1\n currentPos -= 1\n }\n }\n\n if (targetDepth === null) {\n return null\n }\n\n return { $pos: state.doc.resolve(currentPos), depth: targetDepth }\n}\n","import { Node, NodeType } from '@tiptap/pm/model'\nimport { EditorState } from '@tiptap/pm/state'\n\n/**\n * Finds the first node of a given type or name in the current selection.\n * @param state The editor state.\n * @param typeOrName The node type or name.\n * @param pos The position to start searching from.\n * @param maxDepth The maximum depth to search.\n * @returns The node and the depth as an array.\n */\nexport const getNodeAtPosition = (state: EditorState, typeOrName: string | NodeType, pos: number, maxDepth = 20) => {\n const $pos = state.doc.resolve(pos)\n\n let currentDepth = maxDepth\n let node: Node | null = null\n\n while (currentDepth > 0 && node === null) {\n const currentNode = $pos.node(currentDepth)\n\n if (currentNode?.type.name === typeOrName) {\n node = currentNode\n } else {\n currentDepth -= 1\n }\n }\n\n return [node, currentDepth] as [Node | null, number]\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nimport { getNodeAtPosition } from '../../../core/src/helpers/getNodeAtPosition.js'\nimport { findListItemPos } from './findListItemPos.js'\n\nexport const getNextListDepth = (typeOrName: string, state: EditorState) => {\n const listItemPos = findListItemPos(typeOrName, state)\n\n if (!listItemPos) {\n return false\n }\n\n const [, depth] = getNodeAtPosition(state, typeOrName, listItemPos.$pos.pos + 4)\n\n return depth\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nexport const isAtStartOfNode = (state: EditorState) => {\n const { $from, $to } = state.selection\n\n if ($from.parentOffset > 0 || $from.pos !== $to.pos) {\n return false\n }\n\n return true\n}\n","export function isRegExp(value: any): value is RegExp {\n return Object.prototype.toString.call(value) === '[object RegExp]'\n}\n","import { isRegExp } from './isRegExp.js'\n\n/**\n * Check if object1 includes object2\n * @param object1 Object\n * @param object2 Object\n */\nexport function objectIncludes(\n object1: Record<string, any>,\n object2: Record<string, any>,\n options: { strict: boolean } = { strict: true },\n): boolean {\n const keys = Object.keys(object2)\n\n if (!keys.length) {\n return true\n }\n\n return keys.every(key => {\n if (options.strict) {\n return object2[key] === object1[key]\n }\n\n if (isRegExp(object2[key])) {\n return object2[key].test(object1[key])\n }\n\n return object2[key] === object1[key]\n })\n}\n","import { NodeType } from '@tiptap/pm/model'\nimport { EditorState } from '@tiptap/pm/state'\n\nimport { NodeRange } from '../types.js'\nimport { objectIncludes } from '../utilities/objectIncludes.js'\nimport { getNodeType } from './getNodeType.js'\n\nexport function isNodeActive(\n state: EditorState,\n typeOrName: NodeType | string | null,\n attributes: Record<string, any> = {},\n): boolean {\n const { from, to, empty } = state.selection\n const type = typeOrName ? getNodeType(typeOrName, state.schema) : null\n\n const nodeRanges: NodeRange[] = []\n\n state.doc.nodesBetween(from, to, (node, pos) => {\n if (node.isText) {\n return\n }\n\n const relativeFrom = Math.max(from, pos)\n const relativeTo = Math.min(to, pos + node.nodeSize)\n\n nodeRanges.push({\n node,\n from: relativeFrom,\n to: relativeTo,\n })\n })\n\n const selectionRange = to - from\n const matchedNodeRanges = nodeRanges\n .filter(nodeRange => {\n if (!type) {\n return true\n }\n\n return type.name === nodeRange.node.type.name\n })\n .filter(nodeRange => objectIncludes(nodeRange.node.attrs, attributes, { strict: false }))\n\n if (empty) {\n return !!matchedNodeRanges.length\n }\n\n const range = matchedNodeRanges.reduce((sum, nodeRange) => sum + nodeRange.to - nodeRange.from, 0)\n\n return range >= selectionRange\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nexport const hasListBefore = (editorState: EditorState, name: string, parentListTypes: string[]) => {\n const { $anchor } = editorState.selection\n\n const previousNodePos = Math.max(0, $anchor.pos - 2)\n\n const previousNode = editorState.doc.resolve(previousNodePos).node()\n\n if (!previousNode || !parentListTypes.includes(previousNode.type.name)) {\n return false\n }\n\n return true\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nexport const hasListItemBefore = (typeOrName: string, state: EditorState): boolean => {\n const { $anchor } = state.selection\n\n const $targetPos = state.doc.resolve($anchor.pos - 2)\n\n if ($targetPos.index() === 0) {\n return false\n }\n\n if ($targetPos.nodeBefore?.type.name !== typeOrName) {\n return false\n }\n\n return true\n}\n","import { Node } from '@tiptap/pm/model'\nimport { EditorState } from '@tiptap/pm/state'\n\nimport { getNodeType } from '../../../core/src/helpers/getNodeType.js'\n\nexport const listItemHasSubList = (typeOrName: string, state: EditorState, node?: Node) => {\n if (!node) {\n return false\n }\n\n const nodeType = getNodeType(typeOrName, state.schema)\n\n let hasSubList = false\n\n node.descendants(child => {\n if (child.type === nodeType) {\n hasSubList = true\n }\n })\n\n return hasSubList\n}\n","import { Node } from '@tiptap/pm/model'\n\nimport { Editor } from '../../../core/src/Editor.js'\nimport { isAtStartOfNode } from '../../../core/src/helpers/isAtStartOfNode.js'\nimport { isNodeActive } from '../../../core/src/helpers/isNodeActive.js'\nimport { findListItemPos } from './findListItemPos.js'\nimport { hasListBefore } from './hasListBefore.js'\nimport { hasListItemBefore } from './hasListItemBefore.js'\nimport { listItemHasSubList } from './listItemHasSubList.js'\n\nexport const handleBackspace = (editor: Editor, name: string, parentListTypes: string[]) => {\n // this is required to still handle the undo handling\n if (editor.commands.undoInputRule()) {\n return true\n }\n\n // if the current item is NOT inside a list item &\n // the previous item is a list (orderedList or bulletList)\n // move the cursor into the list and delete the current item\n if (!isNodeActive(editor.state, name) && hasListBefore(editor.state, name, parentListTypes)) {\n const { $anchor } = editor.state.selection\n\n const $listPos = editor.state.doc.resolve($anchor.before() - 1)\n\n const listDescendants: Array<{ node: Node, pos: number }> = []\n\n $listPos.node().descendants((node, pos) => {\n if (node.type.name === name) {\n listDescendants.push({ node, pos })\n }\n })\n\n const lastItem = listDescendants.at(-1)\n\n if (!lastItem) {\n return false\n }\n\n const $lastItemPos = editor.state.doc.resolve($listPos.start() + lastItem.pos + 1)\n\n return editor.chain().cut({ from: $anchor.start() - 1, to: $anchor.end() + 1 }, $lastItemPos.end()).joinForward().run()\n }\n\n // if the cursor is not inside the current node type\n // do nothing and proceed\n if (!isNodeActive(editor.state, name)) {\n return false\n }\n\n // if the cursor is not at the start of a node\n // do nothing and proceed\n if (!isAtStartOfNode(editor.state)) {\n return false\n }\n\n const listItemPos = findListItemPos(name, editor.state)\n\n if (!listItemPos) {\n return false\n }\n\n const $prev = editor.state.doc.resolve(listItemPos.$pos.pos - 2)\n const prevNode = $prev.node(listItemPos.depth)\n\n const previousListItemHasSubList = listItemHasSubList(name, editor.state, prevNode)\n\n // if the previous item is a list item and doesn't have a sublist, join the list items\n if (hasListItemBefore(name, editor.state) && !previousListItemHasSubList) {\n return editor.commands.joinItemBackward()\n }\n\n // otherwise in the end, a backspace should\n // always just lift the list item if\n // joining / merging is not possible\n return editor.chain().liftListItem(name).run()\n}\n","import { Node as ProseMirrorNode, ResolvedPos } from '@tiptap/pm/model'\n\nimport { Predicate } from '../types.js'\n\nexport function findParentNodeClosestToPos(\n $pos: ResolvedPos,\n predicate: Predicate,\n):\n | {\n pos: number\n start: number\n depth: number\n node: ProseMirrorNode\n }\n | undefined {\n for (let i = $pos.depth; i > 0; i -= 1) {\n const node = $pos.node(i)\n\n if (predicate(node)) {\n return {\n pos: i > 0 ? $pos.before(i) : 0,\n start: $pos.start(i),\n depth: i,\n node,\n }\n }\n }\n}\n","import { Selection } from '@tiptap/pm/state'\n\nimport { Predicate } from '../types.js'\nimport { findParentNodeClosestToPos } from './findParentNodeClosestToPos.js'\n\nexport function findParentNode(predicate: Predicate) {\n return (selection: Selection) => findParentNodeClosestToPos(selection.$from, predicate)\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nimport { findParentNode } from './findParentNode.js'\n\nexport const isAtEndOfNode = (state: EditorState, nodeType?: string) => {\n const { $from, $to, $anchor } = state.selection\n\n if (nodeType) {\n const parentNode = findParentNode(node => node.type.name === nodeType)(state.selection)\n\n if (!parentNode) {\n return false\n }\n\n const $parentPos = state.doc.resolve(parentNode.pos + 1)\n\n if ($anchor.pos + 1 === $parentPos.end()) {\n return true\n }\n\n return false\n }\n\n if ($to.parentOffset < $to.parent.nodeSize - 2 || $from.pos !== $to.pos) {\n return false\n }\n\n return true\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nimport { findListItemPos } from './findListItemPos.js'\nimport { getNextListDepth } from './getNextListDepth.js'\n\nexport const nextListIsDeeper = (typeOrName: string, state: EditorState) => {\n const listDepth = getNextListDepth(typeOrName, state)\n const listItemPos = findListItemPos(typeOrName, state)\n\n if (!listItemPos || !listDepth) {\n return false\n }\n\n if (listDepth > listItemPos.depth) {\n return true\n }\n\n return false\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nimport { findListItemPos } from './findListItemPos.js'\nimport { getNextListDepth } from './getNextListDepth.js'\n\nexport const nextListIsHigher = (typeOrName: string, state: EditorState) => {\n const listDepth = getNextListDepth(typeOrName, state)\n const listItemPos = findListItemPos(typeOrName, state)\n\n if (!listItemPos || !listDepth) {\n return false\n }\n\n if (listDepth < listItemPos.depth) {\n return true\n }\n\n return false\n}\n","import { Editor } from '../../../core/src/Editor.js'\nimport { isAtEndOfNode } from '../../../core/src/helpers/isAtEndOfNode.js'\nimport { isNodeActive } from '../../../core/src/helpers/isNodeActive.js'\nimport { nextListIsDeeper } from './nextListIsDeeper.js'\nimport { nextListIsHigher } from './nextListIsHigher.js'\n\nexport const handleDelete = (editor: Editor, name: string) => {\n // if the cursor is not inside the current node type\n // do nothing and proceed\n if (!isNodeActive(editor.state, name)) {\n return false\n }\n\n // if the cursor is not at the end of a node\n // do nothing and proceed\n if (!isAtEndOfNode(editor.state, name)) {\n return false\n }\n\n // check if the next node is a list with a deeper depth\n if (nextListIsDeeper(name, editor.state)) {\n return editor\n .chain()\n .focus(editor.state.selection.from + 4)\n .lift(name)\n .joinBackward()\n .run()\n }\n\n if (nextListIsHigher(name, editor.state)) {\n return editor.chain()\n .joinForward()\n .joinBackward()\n .run()\n }\n\n return editor.commands.joinItemForward()\n}\n","import { EditorState } from '@tiptap/pm/state'\n\nexport const hasListItemAfter = (typeOrName: string, state: EditorState): boolean => {\n const { $anchor } = state.selection\n\n const $targetPos = state.doc.resolve($anchor.pos - $anchor.parentOffset - 2)\n\n if ($targetPos.index() === $targetPos.parent.childCount - 1) {\n return false\n }\n\n if ($targetPos.nodeAfter?.type.name !== typeOrName) {\n return false\n }\n\n return true\n}\n","import { Extension } from '@tiptap/core'\n\nimport { handleBackspace, handleDelete } from './listHelpers/index.js'\n\nexport type ListKeymapOptions = {\n listTypes: Array<{\n itemName: string,\n wrapperNames: string[],\n }>\n}\n\nexport const ListKeymap = Extension.create<ListKeymapOptions>({\n name: 'listKeymap',\n\n addOptions() {\n return {\n listTypes: [\n {\n itemName: 'listItem',\n wrapperNames: ['bulletList', 'orderedList'],\n },\n {\n itemName: 'taskItem',\n wrapperNames: ['taskList'],\n },\n ],\n }\n },\n\n addKeyboardShortcuts() {\n return {\n Delete: ({ editor }) => {\n let handled = false\n\n this.options.listTypes.forEach(({ itemName }) => {\n if (editor.state.schema.nodes[itemName] === undefined) {\n return\n }\n\n if (handleDelete(editor, itemName)) {\n handled = true\n }\n })\n\n return handled\n },\n 'Mod-Delete': ({ editor }) => {\n let handled = false\n\n this.options.listTypes.forEach(({ itemName }) => {\n if (editor.state.schema.nodes[itemName] === undefined) {\n return\n }\n\n if (handleDelete(editor, itemName)) {\n handled = true\n }\n })\n\n return handled\n },\n Backspace: ({ editor }) => {\n let handled = false\n\n this.options.listTypes.forEach(({ itemName, wrapperNames }) => {\n if (editor.state.schema.nodes[itemName] === undefined) {\n return\n }\n\n if (handleBackspace(editor, itemName, wrapperNames)) {\n handled = true\n }\n })\n\n return handled\n },\n 'Mod-Backspace': ({ editor }) => {\n let handled = false\n\n this.options.listTypes.forEach(({ itemName, wrapperNames }) => {\n if (editor.state.schema.nodes[itemName] === undefined) {\n return\n }\n\n if (handleBackspace(editor, itemName, wrapperNames)) {\n handled = true\n }\n })\n\n return handled\n },\n }\n },\n})\n"],"names":["Extension"],"mappings":";;;;;;AAEgB,SAAA,WAAW,CAAC,UAA6B,EAAE,MAAc,EAAA;AACvE,IAAA,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE;AAClC,QAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE;AAC7B,YAAA,MAAM,KAAK,CACT,CAAA,6BAAA,EAAgC,UAAU,CAAA,yCAAA,CAA2C,CACtF,CAAA;AACF,SAAA;AAED,QAAA,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;AAChC,KAAA;AAED,IAAA,OAAO,UAAU,CAAA;AACnB;;ACTO,MAAM,eAAe,GAAG,CAAC,UAA6B,EAAE,KAAkB,KAAI;AACnF,IAAA,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;IACjC,MAAM,QAAQ,GAAG,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IAEtD,IAAI,WAAW,GAAG,IAAI,CAAA;AACtB,IAAA,IAAI,YAAY,GAAG,KAAK,CAAC,KAAK,CAAA;AAC9B,IAAA,IAAI,UAAU,GAAG,KAAK,CAAC,GAAG,CAAA;IAC1B,IAAI,WAAW,GAAkB,IAAI,CAAA;AAErC,IAAA,OAAO,YAAY,GAAG,CAAC,IAAI,WAAW,KAAK,IAAI,EAAE;AAC/C,QAAA,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;AAEtC,QAAA,IAAI,WAAW,CAAC,IAAI,KAAK,QAAQ,EAAE;YACjC,WAAW,GAAG,YAAY,CAAA;AAC3B,SAAA;AAAM,aAAA;YACL,YAAY,IAAI,CAAC,CAAA;YACjB,UAAU,IAAI,CAAC,CAAA;AAChB,SAAA;AACF,KAAA;IAED,IAAI,WAAW,KAAK,IAAI,EAAE;AACxB,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AAED,IAAA,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;AACpE,CAAC;;AC3BD;;;;;;;AAOG;AACI,MAAM,iBAAiB,GAAG,CAAC,KAAkB,EAAE,UAA6B,EAAE,GAAW,EAAE,QAAQ,GAAG,EAAE,KAAI;IACjH,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAEnC,IAAI,YAAY,GAAG,QAAQ,CAAA;IAC3B,IAAI,IAAI,GAAgB,IAAI,CAAA;AAE5B,IAAA,OAAO,YAAY,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,EAAE;QACxC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;AAE3C,QAAA,IAAI,CAAA,WAAW,KAAX,IAAA,IAAA,WAAW,KAAX,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,WAAW,CAAE,IAAI,CAAC,IAAI,MAAK,UAAU,EAAE;YACzC,IAAI,GAAG,WAAW,CAAA;AACnB,SAAA;AAAM,aAAA;YACL,YAAY,IAAI,CAAC,CAAA;AAClB,SAAA;AACF,KAAA;AAED,IAAA,OAAO,CAAC,IAAI,EAAE,YAAY,CAA0B,CAAA;AACtD,CAAC;;ACvBM,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,KAAkB,KAAI;IACzE,MAAM,WAAW,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IAEtD,IAAI,CAAC,WAAW,EAAE;AAChB,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,MAAM,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AAEhF,IAAA,OAAO,KAAK,CAAA;AACd,CAAC;;ACbM,MAAM,eAAe,GAAG,CAAC,KAAkB,KAAI;IACpD,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;AAEtC,IAAA,IAAI,KAAK,CAAC,YAAY,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,EAAE;AACnD,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;;ACVK,SAAU,QAAQ,CAAC,KAAU,EAAA;AACjC,IAAA,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,iBAAiB,CAAA;AACpE;;ACAA;;;;AAIG;AACa,SAAA,cAAc,CAC5B,OAA4B,EAC5B,OAA4B,EAC5B,OAAA,GAA+B,EAAE,MAAM,EAAE,IAAI,EAAE,EAAA;IAE/C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AAEjC,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AAED,IAAA,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,IAAG;QACtB,IAAI,OAAO,CAAC,MAAM,EAAE;YAClB,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;AACrC,SAAA;AAED,QAAA,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE;AAC1B,YAAA,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;AACvC,SAAA;QAED,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;AACtC,KAAC,CAAC,CAAA;AACJ;;ACtBM,SAAU,YAAY,CAC1B,KAAkB,EAClB,UAAoC,EACpC,aAAkC,EAAE,EAAA;IAEpC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;AAC3C,IAAA,MAAM,IAAI,GAAG,UAAU,GAAG,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAA;IAEtE,MAAM,UAAU,GAAgB,EAAE,CAAA;AAElC,IAAA,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,KAAI;QAC7C,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,OAAM;AACP,SAAA;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;AACxC,QAAA,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAA;QAEpD,UAAU,CAAC,IAAI,CAAC;YACd,IAAI;AACJ,YAAA,IAAI,EAAE,YAAY;AAClB,YAAA,EAAE,EAAE,UAAU;AACf,SAAA,CAAC,CAAA;AACJ,KAAC,CAAC,CAAA;AAEF,IAAA,MAAM,cAAc,GAAG,EAAE,GAAG,IAAI,CAAA;IAChC,MAAM,iBAAiB,GAAG,UAAU;SACjC,MAAM,CAAC,SAAS,IAAG;QAClB,IAAI,CAAC,IAAI,EAAE;AACT,YAAA,OAAO,IAAI,CAAA;AACZ,SAAA;QAED,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;AAC/C,KAAC,CAAC;SACD,MAAM,CAAC,SAAS,IAAI,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;AAE3F,IAAA,IAAI,KAAK,EAAE;AACT,QAAA,OAAO,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAA;AAClC,KAAA;IAED,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,SAAS,KAAK,GAAG,GAAG,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IAElG,OAAO,KAAK,IAAI,cAAc,CAAA;AAChC;;AChDO,MAAM,aAAa,GAAG,CAAC,WAAwB,EAAE,IAAY,EAAE,eAAyB,KAAI;AACjG,IAAA,MAAM,EAAE,OAAO,EAAE,GAAG,WAAW,CAAC,SAAS,CAAA;AAEzC,IAAA,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AAEpD,IAAA,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,CAAA;AAEpE,IAAA,IAAI,CAAC,YAAY,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AACtE,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;;ACZM,MAAM,iBAAiB,GAAG,CAAC,UAAkB,EAAE,KAAkB,KAAa;;AACnF,IAAA,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;AAEnC,IAAA,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AAErD,IAAA,IAAI,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;AAC5B,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;IAED,IAAI,CAAA,CAAA,EAAA,GAAA,UAAU,CAAC,UAAU,MAAE,IAAA,IAAA,EAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAAA,IAAI,CAAC,IAAI,MAAK,UAAU,EAAE;AACnD,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;;ACXM,MAAM,kBAAkB,GAAG,CAAC,UAAkB,EAAE,KAAkB,EAAE,IAAW,KAAI;IACxF,IAAI,CAAC,IAAI,EAAE;AACT,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IAEtD,IAAI,UAAU,GAAG,KAAK,CAAA;AAEtB,IAAA,IAAI,CAAC,WAAW,CAAC,KAAK,IAAG;AACvB,QAAA,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE;YAC3B,UAAU,GAAG,IAAI,CAAA;AAClB,SAAA;AACH,KAAC,CAAC,CAAA;AAEF,IAAA,OAAO,UAAU,CAAA;AACnB,CAAC;;ACXM,MAAM,eAAe,GAAG,CAAC,MAAc,EAAE,IAAY,EAAE,eAAyB,KAAI;;AAEzF,IAAA,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE;AACnC,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;;;;IAKD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE;QAC3F,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,CAAA;AAE1C,QAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;QAE/D,MAAM,eAAe,GAAuC,EAAE,CAAA;QAE9D,QAAQ,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,GAAG,KAAI;AACxC,YAAA,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;gBAC3B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA;AACpC,aAAA;AACH,SAAC,CAAC,CAAA;QAEF,MAAM,QAAQ,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAEvC,IAAI,CAAC,QAAQ,EAAE;AACb,YAAA,OAAO,KAAK,CAAA;AACb,SAAA;QAED,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AAElF,QAAA,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,CAAA;AACxH,KAAA;;;IAID,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;AACrC,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;;;AAID,IAAA,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;AAClC,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;IAED,MAAM,WAAW,GAAG,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAA;IAEvD,IAAI,CAAC,WAAW,EAAE;AAChB,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;IAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;AAE9C,IAAA,MAAM,0BAA0B,GAAG,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;;IAGnF,IAAI,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE;AACxE,QAAA,OAAO,MAAM,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAA;AAC1C,KAAA;;;;AAKD,IAAA,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAA;AAChD,CAAC;;ACvEe,SAAA,0BAA0B,CACxC,IAAiB,EACjB,SAAoB,EAAA;AASpB,IAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAEzB,QAAA,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,OAAO;AACL,gBAAA,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;AAC/B,gBAAA,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACpB,gBAAA,KAAK,EAAE,CAAC;gBACR,IAAI;aACL,CAAA;AACF,SAAA;AACF,KAAA;AACH;;ACtBM,SAAU,cAAc,CAAC,SAAoB,EAAA;AACjD,IAAA,OAAO,CAAC,SAAoB,KAAK,0BAA0B,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;AACzF;;ACHO,MAAM,aAAa,GAAG,CAAC,KAAkB,EAAE,QAAiB,KAAI;IACrE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;AAE/C,IAAA,IAAI,QAAQ,EAAE;QACZ,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;QAEvF,IAAI,CAAC,UAAU,EAAE;AACf,YAAA,OAAO,KAAK,CAAA;AACb,SAAA;AAED,QAAA,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QAExD,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC,KAAK,UAAU,CAAC,GAAG,EAAE,EAAE;AACxC,YAAA,OAAO,IAAI,CAAA;AACZ,SAAA;AAED,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,IAAI,GAAG,CAAC,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,EAAE;AACvE,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;;ACvBM,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,KAAkB,KAAI;IACzE,MAAM,SAAS,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IACrD,MAAM,WAAW,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;AAEtD,IAAA,IAAI,CAAC,WAAW,IAAI,CAAC,SAAS,EAAE;AAC9B,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,IAAI,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE;AACjC,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AAED,IAAA,OAAO,KAAK,CAAA;AACd,CAAC;;ACbM,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,KAAkB,KAAI;IACzE,MAAM,SAAS,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IACrD,MAAM,WAAW,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;AAEtD,IAAA,IAAI,CAAC,WAAW,IAAI,CAAC,SAAS,EAAE;AAC9B,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,IAAI,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE;AACjC,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AAED,IAAA,OAAO,KAAK,CAAA;AACd,CAAC;;ACZM,MAAM,YAAY,GAAG,CAAC,MAAc,EAAE,IAAY,KAAI;;;IAG3D,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;AACrC,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;;;IAID,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;AACtC,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;;IAGD,IAAI,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE;AACxC,QAAA,OAAO,MAAM;AACV,aAAA,KAAK,EAAE;aACP,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC;aACtC,IAAI,CAAC,IAAI,CAAC;AACV,aAAA,YAAY,EAAE;AACd,aAAA,GAAG,EAAE,CAAA;AACT,KAAA;IAED,IAAI,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE;QACxC,OAAO,MAAM,CAAC,KAAK,EAAE;AAClB,aAAA,WAAW,EAAE;AACb,aAAA,YAAY,EAAE;AACd,aAAA,GAAG,EAAE,CAAA;AACT,KAAA;AAED,IAAA,OAAO,MAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAA;AAC1C,CAAC;;ACnCM,MAAM,gBAAgB,GAAG,CAAC,UAAkB,EAAE,KAAkB,KAAa;;AAClF,IAAA,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,SAAS,CAAA;AAEnC,IAAA,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC,CAAA;AAE5E,IAAA,IAAI,UAAU,CAAC,KAAK,EAAE,KAAK,UAAU,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE;AAC3D,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;IAED,IAAI,CAAA,CAAA,EAAA,GAAA,UAAU,CAAC,SAAS,MAAE,IAAA,IAAA,EAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAAA,IAAI,CAAC,IAAI,MAAK,UAAU,EAAE;AAClD,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;;;;;;;;;;;;;;;;ACLY,MAAA,UAAU,GAAGA,cAAS,CAAC,MAAM,CAAoB;AAC5D,IAAA,IAAI,EAAE,YAAY;IAElB,UAAU,GAAA;QACR,OAAO;AACL,YAAA,SAAS,EAAE;AACT,gBAAA;AACE,oBAAA,QAAQ,EAAE,UAAU;AACpB,oBAAA,YAAY,EAAE,CAAC,YAAY,EAAE,aAAa,CAAC;AAC5C,iBAAA;AACD,gBAAA;AACE,oBAAA,QAAQ,EAAE,UAAU;oBACpB,YAAY,EAAE,CAAC,UAAU,CAAC;AAC3B,iBAAA;AACF,aAAA;SACF,CAAA;KACF;IAED,oBAAoB,GAAA;QAClB,OAAO;AACL,YAAA,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAI;gBACrB,IAAI,OAAO,GAAG,KAAK,CAAA;AAEnB,gBAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAI;AAC9C,oBAAA,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;wBACrD,OAAM;AACP,qBAAA;AAED,oBAAA,IAAI,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE;wBAClC,OAAO,GAAG,IAAI,CAAA;AACf,qBAAA;AACH,iBAAC,CAAC,CAAA;AAEF,gBAAA,OAAO,OAAO,CAAA;aACf;AACD,YAAA,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,KAAI;gBAC3B,IAAI,OAAO,GAAG,KAAK,CAAA;AAEnB,gBAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAI;AAC9C,oBAAA,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;wBACrD,OAAM;AACP,qBAAA;AAED,oBAAA,IAAI,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE;wBAClC,OAAO,GAAG,IAAI,CAAA;AACf,qBAAA;AACH,iBAAC,CAAC,CAAA;AAEF,gBAAA,OAAO,OAAO,CAAA;aACf;AACD,YAAA,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,KAAI;gBACxB,IAAI,OAAO,GAAG,KAAK,CAAA;AAEnB,gBAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAI;AAC5D,oBAAA,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;wBACrD,OAAM;AACP,qBAAA;oBAED,IAAI,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,YAAY,CAAC,EAAE;wBACnD,OAAO,GAAG,IAAI,CAAA;AACf,qBAAA;AACH,iBAAC,CAAC,CAAA;AAEF,gBAAA,OAAO,OAAO,CAAA;aACf;AACD,YAAA,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,KAAI;gBAC9B,IAAI,OAAO,GAAG,KAAK,CAAA;AAEnB,gBAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAI;AAC5D,oBAAA,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;wBACrD,OAAM;AACP,qBAAA;oBAED,IAAI,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,YAAY,CAAC,EAAE;wBACnD,OAAO,GAAG,IAAI,CAAA;AACf,qBAAA;AACH,iBAAC,CAAC,CAAA;AAEF,gBAAA,OAAO,OAAO,CAAA;aACf;SACF,CAAA;KACF;AACF,CAAA;;;;;;"}
|