@lexical/utils 0.4.1 → 0.5.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/LexicalUtils.dev.js +10 -3
- package/LexicalUtils.js.flow +6 -1
- package/LexicalUtils.prod.js +2 -2
- package/index.d.ts +2 -1
- package/package.json +4 -4
package/LexicalUtils.dev.js
CHANGED
|
@@ -316,13 +316,13 @@ function $restoreEditorState(editor, editorState) {
|
|
|
316
316
|
const selection = editorState._selection;
|
|
317
317
|
lexical.$setSelection(selection === null ? null : selection.clone());
|
|
318
318
|
}
|
|
319
|
-
function $
|
|
319
|
+
function $insertNodeToNearestRoot(node) {
|
|
320
320
|
const selection = lexical.$getSelection();
|
|
321
321
|
|
|
322
322
|
if (lexical.$isRangeSelection(selection)) {
|
|
323
323
|
const focusNode = selection.focus.getNode();
|
|
324
324
|
focusNode.getTopLevelElementOrThrow().insertAfter(node);
|
|
325
|
-
} else if (lexical.$isNodeSelection(selection) || lexical
|
|
325
|
+
} else if (lexical.$isNodeSelection(selection) || lexical.DEPRECATED_$isGridSelection(selection)) {
|
|
326
326
|
const nodes = selection.getNodes();
|
|
327
327
|
nodes[nodes.length - 1].getTopLevelElementOrThrow().insertAfter(node);
|
|
328
328
|
} else {
|
|
@@ -335,13 +335,20 @@ function $insertBlockNode(node) {
|
|
|
335
335
|
paragraphNode.select();
|
|
336
336
|
return node.getLatest();
|
|
337
337
|
}
|
|
338
|
+
function $wrapNodeInElement(node, createElementNode) {
|
|
339
|
+
const elementNode = createElementNode();
|
|
340
|
+
node.replace(elementNode);
|
|
341
|
+
elementNode.append(node);
|
|
342
|
+
return elementNode;
|
|
343
|
+
}
|
|
338
344
|
|
|
339
345
|
exports.$dfs = $dfs;
|
|
340
346
|
exports.$findMatchingParent = $findMatchingParent;
|
|
341
347
|
exports.$getNearestBlockElementAncestorOrThrow = $getNearestBlockElementAncestorOrThrow;
|
|
342
348
|
exports.$getNearestNodeOfType = $getNearestNodeOfType;
|
|
343
|
-
exports.$
|
|
349
|
+
exports.$insertNodeToNearestRoot = $insertNodeToNearestRoot;
|
|
344
350
|
exports.$restoreEditorState = $restoreEditorState;
|
|
351
|
+
exports.$wrapNodeInElement = $wrapNodeInElement;
|
|
345
352
|
exports.addClassNamesToElement = addClassNamesToElement;
|
|
346
353
|
exports.mergeRegister = mergeRegister;
|
|
347
354
|
exports.registerNestedElementResolver = registerNestedElementResolver;
|
package/LexicalUtils.js.flow
CHANGED
|
@@ -64,4 +64,9 @@ declare export function $restoreEditorState(
|
|
|
64
64
|
editorState: EditorState,
|
|
65
65
|
): void;
|
|
66
66
|
|
|
67
|
-
declare export function $
|
|
67
|
+
declare export function $insertNodeToNearestRoot<T: LexicalNode>(node: T): T;
|
|
68
|
+
|
|
69
|
+
declare export function $wrapNodeInElement(
|
|
70
|
+
node: LexicalNode,
|
|
71
|
+
createElementNode: () => ElementNode,
|
|
72
|
+
): ElementNode;
|
package/LexicalUtils.prod.js
CHANGED
|
@@ -10,7 +10,7 @@ c.__indent=a.__indent;c.__format=a.__format;c.__dir=a.__dir}else l.$isTextNode(c
|
|
|
10
10
|
function t(a,b){let e=b._editorState.constructor,f=new Map,d=new e(f),c=new Map(a._nodeMap),h=c.get("root");a=b._updating;try{b._updating=!1,b.update(()=>{let k=b._dirtyElements,g=b._dirtyLeaves,m=b._dirtyType;b._dirtyElements=new Map;b._dirtyLeaves=new Set;b._dirtyType=0;try{q(h,c,b,null,d)}finally{b._dirtyElements=k,b._dirtyLeaves=g,b._dirtyType=m}})}finally{b._updating=a}d._readOnly=!0;return d}function r(a,b){b="string"===typeof b?JSON.parse(b):b;return t(b,a)}
|
|
11
11
|
exports.$dfs=function(a,b){let e=[];a=(a||l.$getRoot()).getLatest();b=b||(l.$isElementNode(a)?a.getLastDescendant():a);for(var f=a,d=0;null!==(f=f.getParent());)d++;for(f=d;null!==a&&!a.is(b);)if(e.push({depth:f,node:a}),l.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),f++;else for(d=null;null===d&&null!==a;)d=a.getNextSibling(),null===d?(a=a.getParent(),f--):a=d;null!==a&&a.is(b)&&e.push({depth:f,node:a});return e};exports.$findMatchingParent=p;
|
|
12
12
|
exports.$getNearestBlockElementAncestorOrThrow=function(a){a=p(a,b=>l.$isElementNode(b)&&!b.isInline());l.$isElementNode(a)||n(4);return a};exports.$getNearestNodeOfType=function(a,b){for(;null!=a;){if(a instanceof b)return a;a=a.getParent()}return null};
|
|
13
|
-
exports.$
|
|
14
|
-
exports.$restoreEditorState=function(a,b){let e=new Map(b._nodeMap),f=a._pendingEditorState;f&&(f._nodeMap=e);a._dirtyType=2;a=b._selection;l.$setSelection(null===a?null:a.clone())};exports.addClassNamesToElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.add(...e.split(" "))})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
|
|
13
|
+
exports.$insertNodeToNearestRoot=function(a){var b=l.$getSelection();l.$isRangeSelection(b)?b.focus.getNode().getTopLevelElementOrThrow().insertAfter(a):l.$isNodeSelection(b)||l.DEPRECATED_$isGridSelection(b)?(b=b.getNodes(),b[b.length-1].getTopLevelElementOrThrow().insertAfter(a)):l.$getRoot().append(a);b=l.$createParagraphNode();a.insertAfter(b);b.select();return a.getLatest()};
|
|
14
|
+
exports.$restoreEditorState=function(a,b){let e=new Map(b._nodeMap),f=a._pendingEditorState;f&&(f._nodeMap=e);a._dirtyType=2;a=b._selection;l.$setSelection(null===a?null:a.clone())};exports.$wrapNodeInElement=function(a,b){b=b();a.replace(b);b.append(a);return b};exports.addClassNamesToElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.add(...e.split(" "))})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
|
|
15
15
|
exports.registerNestedElementResolver=function(a,b,e,f){return a.registerNodeTransform(b,d=>{a:{var c=d.getChildren();for(var h=0;h<c.length;h++)if(c[h]instanceof b){c=null;break a}for(c=d;null!==c;)if(h=c,c=c.getParent(),c instanceof b){c={child:h,parent:c};break a}c=null}if(null!==c){const {child:k,parent:g}=c;if(k.is(d)){f(g,d);d=k.getNextSiblings();c=d.length;g.insertAfter(k);if(0!==c){h=e(g);k.insertAfter(h);for(let m=0;m<c;m++)h.append(d[m])}g.canBeEmpty()||0!==g.getChildrenSize()||g.remove()}}})};
|
|
16
16
|
exports.removeClassNamesFromElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.remove(...e.split(" "))})};exports.unstable_convertLegacyJSONEditorState=r
|
package/index.d.ts
CHANGED
|
@@ -24,5 +24,6 @@ export declare function mergeRegister(...func: Array<Func>): () => void;
|
|
|
24
24
|
export declare function registerNestedElementResolver<N extends ElementNode>(editor: LexicalEditor, targetNode: Klass<N>, cloneNode: (from: N) => N, handleOverlap: (from: N, to: N) => void): () => void;
|
|
25
25
|
export declare function unstable_convertLegacyJSONEditorState(editor: LexicalEditor, maybeStringifiedEditorState: string): EditorState;
|
|
26
26
|
export declare function $restoreEditorState(editor: LexicalEditor, editorState: EditorState): void;
|
|
27
|
-
export declare function $
|
|
27
|
+
export declare function $insertNodeToNearestRoot<T extends LexicalNode>(node: T): T;
|
|
28
|
+
export declare function $wrapNodeInElement(node: LexicalNode, createElementNode: () => ElementNode): ElementNode;
|
|
28
29
|
export {};
|
package/package.json
CHANGED
|
@@ -8,14 +8,14 @@
|
|
|
8
8
|
"utils"
|
|
9
9
|
],
|
|
10
10
|
"license": "MIT",
|
|
11
|
-
"version": "0.
|
|
11
|
+
"version": "0.5.0",
|
|
12
12
|
"main": "LexicalUtils.js",
|
|
13
13
|
"peerDependencies": {
|
|
14
|
-
"lexical": "0.
|
|
14
|
+
"lexical": "0.5.0"
|
|
15
15
|
},
|
|
16
16
|
"dependencies": {
|
|
17
|
-
"@lexical/list": "0.
|
|
18
|
-
"@lexical/table": "0.
|
|
17
|
+
"@lexical/list": "0.5.0",
|
|
18
|
+
"@lexical/table": "0.5.0"
|
|
19
19
|
},
|
|
20
20
|
"repository": {
|
|
21
21
|
"type": "git",
|