@examind/block-types 0.1.18

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.
Files changed (59) hide show
  1. package/README.md +40 -0
  2. package/package.json +21 -0
  3. package/types/examind/index.d.ts +12 -0
  4. package/types/examind/nodes/EssayQuestionNode.ts +16 -0
  5. package/types/examind/nodes/FillInTheBlankQuestionNode.ts +14 -0
  6. package/types/examind/nodes/FillInTheBlankSpaceNode.ts +21 -0
  7. package/types/examind/nodes/FinancialStatementQuestionNode.ts +46 -0
  8. package/types/examind/nodes/HorizontalRuleNode.ts +3 -0
  9. package/types/examind/nodes/ImageNode.ts +18 -0
  10. package/types/examind/nodes/JournalEntryQuestionNode.ts +32 -0
  11. package/types/examind/nodes/MatchingQuestionNode.ts +21 -0
  12. package/types/examind/nodes/MultipleOptionQuestionNode.ts +29 -0
  13. package/types/examind/nodes/ShortAnswerQuestionNode.ts +15 -0
  14. package/types/examind/nodes/SimulationQuestionNode.ts +15 -0
  15. package/types/examind/nodes/VariableNode.ts +24 -0
  16. package/types/index.ts +2 -0
  17. package/types/lexical/LexicalCommands.ts +159 -0
  18. package/types/lexical/LexicalConstants.ts +51 -0
  19. package/types/lexical/LexicalEditor.ts +597 -0
  20. package/types/lexical/LexicalEditorState.ts +30 -0
  21. package/types/lexical/LexicalEvents.ts +13 -0
  22. package/types/lexical/LexicalGC.ts +13 -0
  23. package/types/lexical/LexicalMutations.ts +10 -0
  24. package/types/lexical/LexicalNode.ts +460 -0
  25. package/types/lexical/LexicalNodeState.ts +379 -0
  26. package/types/lexical/LexicalNormalization.ts +9 -0
  27. package/types/lexical/LexicalReconciler.ts +13 -0
  28. package/types/lexical/LexicalSelection.ts +295 -0
  29. package/types/lexical/LexicalUpdateTags.ts +51 -0
  30. package/types/lexical/LexicalUpdates.ts +31 -0
  31. package/types/lexical/LexicalUtils.ts +304 -0
  32. package/types/lexical/index.ts +35 -0
  33. package/types/lexical/link/index.ts +125 -0
  34. package/types/lexical/list/LexicalListItemNode.ts +65 -0
  35. package/types/lexical/list/LexicalListNode.ts +56 -0
  36. package/types/lexical/list/checkList.ts +9 -0
  37. package/types/lexical/list/formatList.ts +69 -0
  38. package/types/lexical/list/index.ts +11 -0
  39. package/types/lexical/list/utils.ts +64 -0
  40. package/types/lexical/nodes/ArtificialNode.ts +12 -0
  41. package/types/lexical/nodes/LexicalDecoratorNode.ts +26 -0
  42. package/types/lexical/nodes/LexicalElementNode.ts +207 -0
  43. package/types/lexical/nodes/LexicalLineBreakNode.ts +25 -0
  44. package/types/lexical/nodes/LexicalParagraphNode.ts +31 -0
  45. package/types/lexical/nodes/LexicalRootNode.ts +30 -0
  46. package/types/lexical/nodes/LexicalTabNode.ts +28 -0
  47. package/types/lexical/nodes/LexicalTextNode.ts +288 -0
  48. package/types/lexical/rich-text/index.ts +53 -0
  49. package/types/lexical/table/LexicalTableCellNode.ts +72 -0
  50. package/types/lexical/table/LexicalTableCommands.ts +17 -0
  51. package/types/lexical/table/LexicalTableNode.ts +65 -0
  52. package/types/lexical/table/LexicalTableObserver.ts +108 -0
  53. package/types/lexical/table/LexicalTablePluginHelpers.ts +25 -0
  54. package/types/lexical/table/LexicalTableRowNode.ts +34 -0
  55. package/types/lexical/table/LexicalTableSelection.ts +74 -0
  56. package/types/lexical/table/LexicalTableSelectionHelpers.ts +40 -0
  57. package/types/lexical/table/LexicalTableUtils.ts +112 -0
  58. package/types/lexical/table/constants.ts +8 -0
  59. package/types/lexical/table/index.ts +16 -0
@@ -0,0 +1,460 @@
1
+ // THIS FILE IS AUTO-GENERATED
2
+ // To regenerate, run: pnpm build (from the root of the project)
3
+
4
+ // Type definitions based on Lexical
5
+ // Original copyright: Meta Platforms, Inc. and affiliates.
6
+
7
+ import type { EditorConfig, Klass, KlassConstructor, LexicalEditor } from './LexicalEditor';
8
+ import type { BaseSelection, RangeSelection } from './LexicalSelection';
9
+ import { type DecoratorNode, ElementNode, NODE_STATE_KEY } from '.';
10
+ import { type NodeState } from './LexicalNodeState';
11
+ export type NodeMap = Map<NodeKey, LexicalNode>;
12
+ /**
13
+ * The base type for all serialized nodes
14
+ */
15
+ export type SerializedLexicalNode = {
16
+ /** The type string used by the Node class */
17
+ type: string;
18
+ /** A numeric version for this schema, defaulting to 1, but not generally recommended for use */
19
+ version: number;
20
+ [NODE_STATE_KEY]?: Record<string, unknown>;
21
+ };
22
+ /**
23
+ * Omit the children, type, and version properties from the given SerializedLexicalNode definition.
24
+ */
25
+ export type LexicalUpdateJSON<T extends SerializedLexicalNode> = Omit<T, 'children' | 'type' | 'version'>;
26
+ /** @internal */
27
+ export interface LexicalPrivateDOM {
28
+ __lexicalTextContent?: string | undefined | null;
29
+ __lexicalLineBreak?: HTMLBRElement | HTMLImageElement | undefined | null;
30
+ __lexicalDirTextContent?: string | undefined | null;
31
+ __lexicalDir?: 'ltr' | 'rtl' | null | undefined;
32
+ __lexicalUnmanaged?: boolean | undefined;
33
+ }
34
+ export declare function $removeNode(nodeToRemove: LexicalNode, restoreSelection: boolean, preserveEmptyParent?: boolean): void;
35
+ export type DOMConversion<T extends HTMLElement = HTMLElement> = {
36
+ conversion: DOMConversionFn<T>;
37
+ priority?: 0 | 1 | 2 | 3 | 4;
38
+ };
39
+ export type DOMConversionFn<T extends HTMLElement = HTMLElement> = (element: T) => DOMConversionOutput | null;
40
+ export type DOMChildConversion = (lexicalNode: LexicalNode, parentLexicalNode: LexicalNode | null | undefined) => LexicalNode | null | undefined;
41
+ export type DOMConversionMap<T extends HTMLElement = HTMLElement> = Record<NodeName, (node: T) => DOMConversion<T> | null>;
42
+ type NodeName = string;
43
+ export type DOMConversionOutput = {
44
+ after?: (childLexicalNodes: Array<LexicalNode>) => Array<LexicalNode>;
45
+ forChild?: DOMChildConversion;
46
+ node: null | LexicalNode | Array<LexicalNode>;
47
+ };
48
+ export type DOMExportOutputMap = Map<Klass<LexicalNode>, (editor: LexicalEditor, target: LexicalNode) => DOMExportOutput>;
49
+ export type DOMExportOutput = {
50
+ after?: (generatedElement: HTMLElement | DocumentFragment | Text | null | undefined) => HTMLElement | DocumentFragment | Text | null | undefined;
51
+ element: HTMLElement | DocumentFragment | Text | null;
52
+ };
53
+ export type NodeKey = string;
54
+ export declare class LexicalNode {
55
+ ['constructor']: KlassConstructor<typeof LexicalNode>;
56
+ /** @internal */
57
+ __type: string;
58
+ /** @internal */
59
+ __key: string;
60
+ /** @internal */
61
+ __parent: null | NodeKey;
62
+ /** @internal */
63
+ __prev: null | NodeKey;
64
+ /** @internal */
65
+ __next: null | NodeKey;
66
+ /** @internal */
67
+ __state?: NodeState<this>;
68
+ /**
69
+ * Returns the string type of this node. Every node must
70
+ * implement this and it MUST BE UNIQUE amongst nodes registered
71
+ * on the editor.
72
+ *
73
+ */
74
+ static getType(): string;
75
+ /**
76
+ * Clones this node, creating a new node with a different key
77
+ * and adding it to the EditorState (but not attaching it anywhere!). All nodes must
78
+ * implement this method.
79
+ *
80
+ */
81
+ static clone(_data: unknown): LexicalNode;
82
+ /**
83
+ * Perform any state updates on the clone of prevNode that are not already
84
+ * handled by the constructor call in the static clone method. If you have
85
+ * state to update in your clone that is not handled directly by the
86
+ * constructor, it is advisable to override this method but it is required
87
+ * to include a call to `super.afterCloneFrom(prevNode)` in your
88
+ * implementation. This is only intended to be called by
89
+ * {@link $cloneWithProperties} function or via a super call.
90
+ *
91
+ * @example
92
+ * ```ts
93
+ * class ClassesTextNode extends TextNode {
94
+ * // Not shown: static getType, static importJSON, exportJSON, createDOM, updateDOM
95
+ * __classes = new Set<string>();
96
+ * static clone(node: ClassesTextNode): ClassesTextNode {
97
+ * // The inherited TextNode constructor is used here, so
98
+ * // classes is not set by this method.
99
+ * return new ClassesTextNode(node.__text, node.__key);
100
+ * }
101
+ * afterCloneFrom(node: this): void {
102
+ * // This calls TextNode.afterCloneFrom and LexicalNode.afterCloneFrom
103
+ * // for necessary state updates
104
+ * super.afterCloneFrom(node);
105
+ * this.__addClasses(node.__classes);
106
+ * }
107
+ * // This method is a private implementation detail, it is not
108
+ * // suitable for the public API because it does not call getWritable
109
+ * __addClasses(classNames: Iterable<string>): this {
110
+ * for (const className of classNames) {
111
+ * this.__classes.add(className);
112
+ * }
113
+ * return this;
114
+ * }
115
+ * addClass(...classNames: string[]): this {
116
+ * return this.getWritable().__addClasses(classNames);
117
+ * }
118
+ * removeClass(...classNames: string[]): this {
119
+ * const node = this.getWritable();
120
+ * for (const className of classNames) {
121
+ * this.__classes.delete(className);
122
+ * }
123
+ * return this;
124
+ * }
125
+ * getClasses(): Set<string> {
126
+ * return this.getLatest().__classes;
127
+ * }
128
+ * }
129
+ * ```
130
+ *
131
+ */
132
+ afterCloneFrom(prevNode: this): void;
133
+ static importDOM?: () => DOMConversionMap<any> | null;
134
+ constructor(key?: NodeKey);
135
+ /**
136
+ * Returns the string type of this node.
137
+ */
138
+ getType(): string;
139
+ isInline(): boolean;
140
+ /**
141
+ * Returns true if there is a path between this node and the RootNode, false otherwise.
142
+ * This is a way of determining if the node is "attached" EditorState. Unattached nodes
143
+ * won't be reconciled and will ultimately be cleaned up by the Lexical GC.
144
+ */
145
+ isAttached(): boolean;
146
+ /**
147
+ * Returns true if this node is contained within the provided Selection., false otherwise.
148
+ * Relies on the algorithms implemented in {@link BaseSelection.getNodes} to determine
149
+ * what's included.
150
+ *
151
+ * @param selection - The selection that we want to determine if the node is in.
152
+ */
153
+ isSelected(selection?: null | BaseSelection): boolean;
154
+ /**
155
+ * Returns this nodes key.
156
+ */
157
+ getKey(): NodeKey;
158
+ /**
159
+ * Returns the zero-based index of this node within the parent.
160
+ */
161
+ getIndexWithinParent(): number;
162
+ /**
163
+ * Returns the parent of this node, or null if none is found.
164
+ */
165
+ getParent<T extends ElementNode>(): T | null;
166
+ /**
167
+ * Returns the parent of this node, or throws if none is found.
168
+ */
169
+ getParentOrThrow<T extends ElementNode>(): T;
170
+ /**
171
+ * Returns the highest (in the EditorState tree)
172
+ * non-root ancestor of this node, or null if none is found. See {@link lexical!$isRootOrShadowRoot}
173
+ * for more information on which Elements comprise "roots".
174
+ */
175
+ getTopLevelElement(): ElementNode | DecoratorNode<unknown> | null;
176
+ /**
177
+ * Returns the highest (in the EditorState tree)
178
+ * non-root ancestor of this node, or throws if none is found. See {@link lexical!$isRootOrShadowRoot}
179
+ * for more information on which Elements comprise "roots".
180
+ */
181
+ getTopLevelElementOrThrow(): ElementNode | DecoratorNode<unknown>;
182
+ /**
183
+ * Returns a list of the every ancestor of this node,
184
+ * all the way up to the RootNode.
185
+ *
186
+ */
187
+ getParents(): Array<ElementNode>;
188
+ /**
189
+ * Returns a list of the keys of every ancestor of this node,
190
+ * all the way up to the RootNode.
191
+ *
192
+ */
193
+ getParentKeys(): Array<NodeKey>;
194
+ /**
195
+ * Returns the "previous" siblings - that is, the node that comes
196
+ * before this one in the same parent.
197
+ *
198
+ */
199
+ getPreviousSibling<T extends LexicalNode>(): T | null;
200
+ /**
201
+ * Returns the "previous" siblings - that is, the nodes that come between
202
+ * this one and the first child of it's parent, inclusive.
203
+ *
204
+ */
205
+ getPreviousSiblings<T extends LexicalNode>(): Array<T>;
206
+ /**
207
+ * Returns the "next" siblings - that is, the node that comes
208
+ * after this one in the same parent
209
+ *
210
+ */
211
+ getNextSibling<T extends LexicalNode>(): T | null;
212
+ /**
213
+ * Returns all "next" siblings - that is, the nodes that come between this
214
+ * one and the last child of it's parent, inclusive.
215
+ *
216
+ */
217
+ getNextSiblings<T extends LexicalNode>(): Array<T>;
218
+ /**
219
+ * @deprecated use {@link $getCommonAncestor}
220
+ *
221
+ * Returns the closest common ancestor of this node and the provided one or null
222
+ * if one cannot be found.
223
+ *
224
+ * @param node - the other node to find the common ancestor of.
225
+ */
226
+ getCommonAncestor<T extends ElementNode = ElementNode>(node: LexicalNode): T | null;
227
+ /**
228
+ * Returns true if the provided node is the exact same one as this node, from Lexical's perspective.
229
+ * Always use this instead of referential equality.
230
+ *
231
+ * @param object - the node to perform the equality comparison on.
232
+ */
233
+ is(object: LexicalNode | null | undefined): boolean;
234
+ /**
235
+ * Returns true if this node logically precedes the target node in the
236
+ * editor state, false otherwise (including if there is no common ancestor).
237
+ *
238
+ * Note that this notion of isBefore is based on post-order; a descendant
239
+ * node is always before its ancestors. See also
240
+ * {@link $getCommonAncestor} and {@link $comparePointCaretNext} for
241
+ * more flexible ways to determine the relative positions of nodes.
242
+ *
243
+ * @param targetNode - the node we're testing to see if it's after this one.
244
+ */
245
+ isBefore(targetNode: LexicalNode): boolean;
246
+ /**
247
+ * Returns true if this node is an ancestor of and distinct from the target node, false otherwise.
248
+ *
249
+ * @param targetNode - the would-be child node.
250
+ */
251
+ isParentOf(targetNode: LexicalNode): boolean;
252
+ /**
253
+ * Returns a list of nodes that are between this node and
254
+ * the target node in the EditorState.
255
+ *
256
+ * @param targetNode - the node that marks the other end of the range of nodes to be returned.
257
+ */
258
+ getNodesBetween(targetNode: LexicalNode): Array<LexicalNode>;
259
+ /**
260
+ * Returns true if this node has been marked dirty during this update cycle.
261
+ *
262
+ */
263
+ isDirty(): boolean;
264
+ /**
265
+ * Returns the latest version of the node from the active EditorState.
266
+ * This is used to avoid getting values from stale node references.
267
+ *
268
+ */
269
+ getLatest(): this;
270
+ /**
271
+ * Returns a mutable version of the node using {@link $cloneWithProperties}
272
+ * if necessary. Will throw an error if called outside of a Lexical Editor
273
+ * {@link LexicalEditor.update} callback.
274
+ *
275
+ */
276
+ getWritable(): this;
277
+ /**
278
+ * Returns the text content of the node. Override this for
279
+ * custom nodes that should have a representation in plain text
280
+ * format (for copy + paste, for example)
281
+ *
282
+ */
283
+ getTextContent(): string;
284
+ /**
285
+ * Returns the length of the string produced by calling getTextContent on this node.
286
+ *
287
+ */
288
+ getTextContentSize(): number;
289
+ /**
290
+ * Called during the reconciliation process to determine which nodes
291
+ * to insert into the DOM for this Lexical Node.
292
+ *
293
+ * This method must return exactly one HTMLElement. Nested elements are not supported.
294
+ *
295
+ * Do not attempt to update the Lexical EditorState during this phase of the update lifecycle.
296
+ *
297
+ * @param _config - allows access to things like the EditorTheme (to apply classes) during reconciliation.
298
+ * @param _editor - allows access to the editor for context during reconciliation.
299
+ *
300
+ * */
301
+ createDOM(_config: EditorConfig, _editor: LexicalEditor): HTMLElement;
302
+ /**
303
+ * Called when a node changes and should update the DOM
304
+ * in whatever way is necessary to make it align with any changes that might
305
+ * have happened during the update.
306
+ *
307
+ * Returning "true" here will cause lexical to unmount and recreate the DOM node
308
+ * (by calling createDOM). You would need to do this if the element tag changes,
309
+ * for instance.
310
+ *
311
+ * */
312
+ updateDOM(_prevNode: unknown, _dom: HTMLElement, _config: EditorConfig): boolean;
313
+ /**
314
+ * Controls how the this node is serialized to HTML. This is important for
315
+ * copy and paste between Lexical and non-Lexical editors, or Lexical editors with different namespaces,
316
+ * in which case the primary transfer format is HTML. It's also important if you're serializing
317
+ * to HTML for any other reason via {@link @lexical/html!$generateHtmlFromNodes}. You could
318
+ * also use this method to build your own HTML renderer.
319
+ *
320
+ * */
321
+ exportDOM(editor: LexicalEditor): DOMExportOutput;
322
+ /**
323
+ * Controls how the this node is serialized to JSON. This is important for
324
+ * copy and paste between Lexical editors sharing the same namespace. It's also important
325
+ * if you're serializing to JSON for persistent storage somewhere.
326
+ * See [Serialization & Deserialization](https://lexical.dev/docs/concepts/serialization#lexical---html).
327
+ *
328
+ * */
329
+ exportJSON(): SerializedLexicalNode;
330
+ /**
331
+ * Controls how the this node is deserialized from JSON. This is usually boilerplate,
332
+ * but provides an abstraction between the node implementation and serialized interface that can
333
+ * be important if you ever make breaking changes to a node schema (by adding or removing properties).
334
+ * See [Serialization & Deserialization](https://lexical.dev/docs/concepts/serialization#lexical---html).
335
+ *
336
+ * */
337
+ static importJSON(_serializedNode: SerializedLexicalNode): LexicalNode;
338
+ /**
339
+ * Update this LexicalNode instance from serialized JSON. It's recommended
340
+ * to implement as much logic as possible in this method instead of the
341
+ * static importJSON method, so that the functionality can be inherited in subclasses.
342
+ *
343
+ * The LexicalUpdateJSON utility type should be used to ignore any type, version,
344
+ * or children properties in the JSON so that the extended JSON from subclasses
345
+ * are acceptable parameters for the super call.
346
+ *
347
+ * If overridden, this method must call super.
348
+ *
349
+ * @example
350
+ * ```ts
351
+ * class MyTextNode extends TextNode {
352
+ * // ...
353
+ * static importJSON(serializedNode: SerializedMyTextNode): MyTextNode {
354
+ * return $createMyTextNode()
355
+ * .updateFromJSON(serializedNode);
356
+ * }
357
+ * updateFromJSON(
358
+ * serializedNode: LexicalUpdateJSON<SerializedMyTextNode>,
359
+ * ): this {
360
+ * return super.updateFromJSON(serializedNode)
361
+ * .setMyProperty(serializedNode.myProperty);
362
+ * }
363
+ * }
364
+ * ```
365
+ **/
366
+ updateFromJSON(serializedNode: LexicalUpdateJSON<SerializedLexicalNode>): this;
367
+ /**
368
+ * @experimental
369
+ *
370
+ * Registers the returned function as a transform on the node during
371
+ * Editor initialization. Most such use cases should be addressed via
372
+ * the {@link LexicalEditor.registerNodeTransform} API.
373
+ *
374
+ * Experimental - use at your own risk.
375
+ */
376
+ static transform(): ((node: LexicalNode) => void) | null;
377
+ /**
378
+ * Removes this LexicalNode from the EditorState. If the node isn't re-inserted
379
+ * somewhere, the Lexical garbage collector will eventually clean it up.
380
+ *
381
+ * @param preserveEmptyParent - If falsy, the node's parent will be removed if
382
+ * it's empty after the removal operation. This is the default behavior, subject to
383
+ * other node heuristics such as {@link ElementNode#canBeEmpty}
384
+ * */
385
+ remove(preserveEmptyParent?: boolean): void;
386
+ /**
387
+ * Replaces this LexicalNode with the provided node, optionally transferring the children
388
+ * of the replaced node to the replacing node.
389
+ *
390
+ * @param replaceWith - The node to replace this one with.
391
+ * @param includeChildren - Whether or not to transfer the children of this node to the replacing node.
392
+ * */
393
+ replace<N extends LexicalNode>(replaceWith: N, includeChildren?: boolean): N;
394
+ /**
395
+ * Inserts a node after this LexicalNode (as the next sibling).
396
+ *
397
+ * @param nodeToInsert - The node to insert after this one.
398
+ * @param restoreSelection - Whether or not to attempt to resolve the
399
+ * selection to the appropriate place after the operation is complete.
400
+ * */
401
+ insertAfter(nodeToInsert: LexicalNode, restoreSelection?: boolean): LexicalNode;
402
+ /**
403
+ * Inserts a node before this LexicalNode (as the previous sibling).
404
+ *
405
+ * @param nodeToInsert - The node to insert before this one.
406
+ * @param restoreSelection - Whether or not to attempt to resolve the
407
+ * selection to the appropriate place after the operation is complete.
408
+ * */
409
+ insertBefore(nodeToInsert: LexicalNode, restoreSelection?: boolean): LexicalNode;
410
+ /**
411
+ * Whether or not this node has a required parent. Used during copy + paste operations
412
+ * to normalize nodes that would otherwise be orphaned. For example, ListItemNodes without
413
+ * a ListNode parent or TextNodes with a ParagraphNode parent.
414
+ *
415
+ * */
416
+ isParentRequired(): boolean;
417
+ /**
418
+ * The creation logic for any required parent. Should be implemented if {@link isParentRequired} returns true.
419
+ *
420
+ * */
421
+ createParentElementNode(): ElementNode;
422
+ selectStart(): RangeSelection;
423
+ selectEnd(): RangeSelection;
424
+ /**
425
+ * Moves selection to the previous sibling of this node, at the specified offsets.
426
+ *
427
+ * @param anchorOffset - The anchor offset for selection.
428
+ * @param focusOffset - The focus offset for selection
429
+ * */
430
+ selectPrevious(anchorOffset?: number, focusOffset?: number): RangeSelection;
431
+ /**
432
+ * Moves selection to the next sibling of this node, at the specified offsets.
433
+ *
434
+ * @param anchorOffset - The anchor offset for selection.
435
+ * @param focusOffset - The focus offset for selection
436
+ * */
437
+ selectNext(anchorOffset?: number, focusOffset?: number): RangeSelection;
438
+ /**
439
+ * Marks a node dirty, triggering transforms and
440
+ * forcing it to be reconciled during the update cycle.
441
+ *
442
+ * */
443
+ markDirty(): void;
444
+ /**
445
+ * @internal
446
+ *
447
+ * When the reconciler detects that a node was mutated, this method
448
+ * may be called to restore the node to a known good state.
449
+ */
450
+ reconcileObservedMutation(dom: HTMLElement, editor: LexicalEditor): void;
451
+ }
452
+ /**
453
+ * Insert a series of nodes after this LexicalNode (as next siblings)
454
+ *
455
+ * @param firstToInsert - The first node to insert after this one.
456
+ * @param lastToInsert - The last node to insert after this one. Must be a
457
+ * later sibling of FirstNode. If not provided, it will be its last sibling.
458
+ */
459
+ export declare function insertRangeAfter(node: LexicalNode, firstToInsert: LexicalNode, lastToInsert?: LexicalNode): void;
460
+ export {};