@ckeditor/ckeditor5-engine 44.0.0-alpha.9 → 44.1.0-alpha.0

package/dist/index.js

@@ -2,8 +2,8 @@
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
  * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
  */
-import { logWarning, EmitterMixin, CKEditorError, compareArrays, toArray, toMap, isIterable, ObservableMixin, count, EventInfo, Collection, keyCodes, isText, env, remove as remove$1, insertAt, diff, fastDiff, isNode, isComment, indexOf, global, isValidAttributeName, first, getAncestors, DomEmitterMixin, getCode, isArrowKeyCode, scrollViewportToShowTarget, spliceArray, uid, priorities, isInsideSurrogatePair, isInsideCombinedSymbol, isInsideEmojiSequence } from '@ckeditor/ckeditor5-utils/dist/index.js';
-import { clone, isPlainObject, isObject, unset, get, merge, set, extend, debounce, isEqualWith, cloneDeep, isEqual } from 'lodash-es';
+import { logWarning, EmitterMixin, CKEditorError, compareArrays, toArray, toMap, isIterable, ObservableMixin, count, EventInfo, Collection, keyCodes, isText, env, remove as remove$1, insertAt, diff, fastDiff, isNode, isComment, indexOf, global, isValidAttributeName, first, getAncestors, DomEmitterMixin, getCode, isArrowKeyCode, scrollViewportToShowTarget, uid, spliceArray, priorities, isInsideSurrogatePair, isInsideCombinedSymbol, isInsideEmojiSequence } from '@ckeditor/ckeditor5-utils/dist/index.js';
+import { clone, isObject, unset, get, merge, set, isPlainObject, extend, debounce, isEqualWith, cloneDeep, isEqual } from 'lodash-es';
 
 // Each document stores information about its placeholder elements and check functions.
 const documentPlaceholders = new WeakMap();
@@ -255,7 +255,7 @@ let hasDisplayedPlaceholderDeprecationWarning = false;
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/view/typecheckable
  */ let TypeCheckable$1 = class TypeCheckable {
@@ -1005,33 +1005,42 @@ TextProxy$1.prototype.is = function(type) {
  */ function normalizePatterns(patterns) {
     if (Array.isArray(patterns)) {
         return patterns.map((pattern)=>{
-            if (isPlainObject(pattern)) {
-                if (pattern.key === undefined || pattern.value === undefined) {
-                    // Documented at the end of matcher.js.
-                    logWarning('matcher-pattern-missing-key-or-value', pattern);
-                }
+            if (typeof pattern !== 'object' || pattern instanceof RegExp) {
                 return [
-                    pattern.key,
-                    pattern.value
+                    pattern,
+                    true
                 ];
             }
-            // Assume the pattern is either String or RegExp.
+            if (pattern.key === undefined || pattern.value === undefined) {
+                // Documented at the end of matcher.js.
+                logWarning('matcher-pattern-missing-key-or-value', pattern);
+            }
             return [
-                pattern,
-                true
+                pattern.key,
+                pattern.value
             ];
         });
     }
-    if (isPlainObject(patterns)) {
-        return Object.entries(patterns);
+    if (typeof patterns !== 'object' || patterns instanceof RegExp) {
+        return [
+            [
+                patterns,
+                true
+            ]
+        ];
     }
-    // Other cases (true, string or regexp).
-    return [
-        [
-            patterns,
-            true
-        ]
-    ];
+    // Below we do what Object.entries() does, but faster.
+    const normalizedPatterns = [];
+    for(const key in patterns){
+        // Replace with Object.hasOwn() when we upgrade to es2022.
+        if (Object.prototype.hasOwnProperty.call(patterns, key)) {
+            normalizedPatterns.push([
+                key,
+                patterns[key]
+            ]);
+        }
+    }
+    return normalizedPatterns;
 }
 /**
  * @param patternKey A pattern representing a key we want to match.
@@ -1064,7 +1073,7 @@ TextProxy$1.prototype.is = function(type) {
     const attributeKeys = new Set(element.getAttributeKeys());
     // `style` and `class` attribute keys are deprecated. Only allow them in object pattern
     // for backward compatibility.
-    if (isPlainObject(patterns)) {
+    if (typeof patterns === 'object' && !(patterns instanceof RegExp) && !Array.isArray(patterns)) {
         if (patterns.style !== undefined) {
             // Documented at the end of matcher.js.
             logWarning('matcher-pattern-deprecated-attributes-style-key', patterns);
@@ -1176,6 +1185,12 @@ TextProxy$1.prototype.is = function(type) {
 	 *
 	 * When no style processor rules are defined it acts as simple key-value storage.
 	 */ _styles;
+    /**
+	 * Cached list of style names for faster access.
+	 */ _cachedStyleNames = null;
+    /**
+	 * Cached list of expanded style names for faster access.
+	 */ _cachedExpandedStyleNames = null;
     /**
 	 * An instance of the {@link module:engine/view/stylesmap~StylesProcessor}.
 	 */ _styleProcessor;
@@ -1252,6 +1267,8 @@ TextProxy$1.prototype.is = function(type) {
         return Array.isArray(propertyDescriptor);
     }
     set(nameOrObject, valueOrObject) {
+        this._cachedStyleNames = null;
+        this._cachedExpandedStyleNames = null;
         if (isObject(nameOrObject)) {
             for (const [key, value] of Object.entries(nameOrObject)){
                 this._styleProcessor.toNormalizedForm(key, value, this._styles);
@@ -1288,6 +1305,8 @@ TextProxy$1.prototype.is = function(type) {
 	 *
 	 * @param name Style name.
 	 */ remove(name) {
+        this._cachedStyleNames = null;
+        this._cachedExpandedStyleNames = null;
         const path = toPath(name);
         unset(this._styles, path);
         delete this._styles[name];
@@ -1441,15 +1460,18 @@ TextProxy$1.prototype.is = function(type) {
             return [];
         }
         if (expand) {
-            return this._styleProcessor.getStyleNames(this._styles);
+            this._cachedExpandedStyleNames = this._cachedExpandedStyleNames || this._styleProcessor.getStyleNames(this._styles);
+            return this._cachedExpandedStyleNames;
         }
-        const entries = this.getStylesEntries();
-        return entries.map(([key])=>key);
+        this._cachedStyleNames = this._cachedStyleNames || this.getStylesEntries().map(([key])=>key);
+        return this._cachedStyleNames;
     }
     /**
 	 * Removes all styles.
 	 */ clear() {
         this._styles = {};
+        this._cachedStyleNames = null;
+        this._cachedExpandedStyleNames = null;
     }
     /**
 	 * Returns normalized styles entries for further processing.
@@ -2584,16 +2606,17 @@ Element$1.prototype.is = function(type, name) {
             nodes
         ];
     }
-    // Array.from to enable .map() on non-arrays.
-    return Array.from(nodes).map((node)=>{
+    const normalizedNodes = [];
+    for (const node of nodes){
         if (typeof node == 'string') {
-            return new Text$1(document, node);
-        }
-        if (node instanceof TextProxy$1) {
-            return new Text$1(document, node.data);
+            normalizedNodes.push(new Text$1(document, node));
+        } else if (node instanceof TextProxy$1) {
+            normalizedNodes.push(new Text$1(document, node.data));
+        } else {
+            normalizedNodes.push(node);
         }
-        return node;
-    });
+    }
+    return normalizedNodes;
 }
 
 /**
@@ -2901,7 +2924,7 @@ RootEditableElement.prototype.is = function(type, name) {
         // Get node just after current position.
         let node;
         // Text is a specific parent because it contains string instead of child nodes.
-        if (parent instanceof Text$1) {
+        if (parent && parent.is('view:$text')) {
             if (position.isAtEnd) {
                 // Prevent returning "elementEnd" for Text node. Skip that value and return the next walker step.
                 this._position = Position$1._createAfter(parent);
@@ -2911,7 +2934,21 @@ RootEditableElement.prototype.is = function(type, name) {
         } else {
             node = parent.getChild(position.offset);
         }
-        if (node instanceof Element$1) {
+        if (typeof node == 'string') {
+            let textLength;
+            if (this.singleCharacters) {
+                textLength = 1;
+            } else {
+                // Check if text stick out of walker range.
+                const endOffset = parent === this._boundaryEndParent ? this.boundaries.end.offset : parent.data.length;
+                textLength = endOffset - position.offset;
+            }
+            const textProxy = new TextProxy$1(parent, position.offset, textLength);
+            position.offset += textLength;
+            this._position = position;
+            return this._formatReturnValue('text', textProxy, previousPosition, position, textLength);
+        }
+        if (node && node.is('view:element')) {
             if (!this.shallow) {
                 position = new Position$1(node, 0);
             } else {
@@ -2927,7 +2964,7 @@ RootEditableElement.prototype.is = function(type, name) {
             this._position = position;
             return this._formatReturnValue('elementStart', node, previousPosition, position, 1);
         }
-        if (node instanceof Text$1) {
+        if (node && node.is('view:$text')) {
             if (this.singleCharacters) {
                 position = new Position$1(node, 0);
                 this._position = position;
@@ -2948,20 +2985,6 @@ RootEditableElement.prototype.is = function(type, name) {
             this._position = position;
             return this._formatReturnValue('text', item, previousPosition, position, charactersCount);
         }
-        if (typeof node == 'string') {
-            let textLength;
-            if (this.singleCharacters) {
-                textLength = 1;
-            } else {
-                // Check if text stick out of walker range.
-                const endOffset = parent === this._boundaryEndParent ? this.boundaries.end.offset : parent.data.length;
-                textLength = endOffset - position.offset;
-            }
-            const textProxy = new TextProxy$1(parent, position.offset, textLength);
-            position.offset += textLength;
-            this._position = position;
-            return this._formatReturnValue('text', textProxy, previousPosition, position, textLength);
-        }
         // `node` is not set, we reached the end of current `parent`.
         position = Position$1._createAfter(parent);
         this._position = position;
@@ -2993,7 +3016,7 @@ RootEditableElement.prototype.is = function(type, name) {
         // Get node just before current position.
         let node;
         // Text {@link module:engine/view/text~Text} element is a specific parent because contains string instead of child nodes.
-        if (parent instanceof Text$1) {
+        if (parent.is('view:$text')) {
             if (position.isAtStart) {
                 // Prevent returning "elementStart" for Text node. Skip that value and return the next walker step.
                 this._position = Position$1._createBefore(parent);
@@ -3003,7 +3026,21 @@ RootEditableElement.prototype.is = function(type, name) {
         } else {
             node = parent.getChild(position.offset - 1);
         }
-        if (node instanceof Element$1) {
+        if (typeof node == 'string') {
+            let textLength;
+            if (!this.singleCharacters) {
+                // Check if text stick out of walker range.
+                const startOffset = parent === this._boundaryStartParent ? this.boundaries.start.offset : 0;
+                textLength = position.offset - startOffset;
+            } else {
+                textLength = 1;
+            }
+            position.offset -= textLength;
+            const textProxy = new TextProxy$1(parent, position.offset, textLength);
+            this._position = position;
+            return this._formatReturnValue('text', textProxy, previousPosition, position, textLength);
+        }
+        if (node && node.is('view:element')) {
             if (this.shallow) {
                 position.offset--;
                 this._position = position;
@@ -3016,7 +3053,7 @@ RootEditableElement.prototype.is = function(type, name) {
             }
             return this._formatReturnValue('elementEnd', node, previousPosition, position);
         }
-        if (node instanceof Text$1) {
+        if (node && node.is('view:$text')) {
             if (this.singleCharacters) {
                 position = new Position$1(node, node.data.length);
                 this._position = position;
@@ -3038,20 +3075,6 @@ RootEditableElement.prototype.is = function(type, name) {
             this._position = position;
             return this._formatReturnValue('text', item, previousPosition, position, charactersCount);
         }
-        if (typeof node == 'string') {
-            let textLength;
-            if (!this.singleCharacters) {
-                // Check if text stick out of walker range.
-                const startOffset = parent === this._boundaryStartParent ? this.boundaries.start.offset : 0;
-                textLength = position.offset - startOffset;
-            } else {
-                textLength = 1;
-            }
-            position.offset -= textLength;
-            const textProxy = new TextProxy$1(parent, position.offset, textLength);
-            this._position = position;
-            return this._formatReturnValue('text', textProxy, previousPosition, position, textLength);
-        }
         // `node` is not set, we reached the beginning of current `parent`.
         position = Position$1._createBefore(parent);
         this._position = position;
@@ -3070,7 +3093,7 @@ RootEditableElement.prototype.is = function(type, name) {
         // Walker doesn't enter to the Text except situations when walker is iterating over every single character,
         // or the bound starts/ends inside the Text. So when the position is at the beginning or at the end of the Text
         // we move it just before or just after Text.
-        if (item instanceof TextProxy$1) {
+        if (item.is('view:$textProxy')) {
             // Position is at the end of Text.
             if (item.offsetInText + item.data.length == item.textNode.data.length) {
                 if (this.direction == 'forward' && !(this.boundaries && this.boundaries.end.isEqual(this.position))) {
@@ -6669,7 +6692,7 @@ DocumentFragment$1.prototype.is = function(type) {
         // If position is placed between text nodes - merge them and return position inside.
         const nodeBefore = newPosition.nodeBefore;
         const nodeAfter = newPosition.nodeAfter;
-        if (nodeBefore instanceof Text$1 && nodeAfter instanceof Text$1) {
+        if (nodeBefore && nodeBefore.is('view:$text') && nodeAfter && nodeAfter.is('view:$text')) {
             return mergeTextNodes(nodeBefore, nodeAfter);
         }
         // If position is next to text node - move position inside.
@@ -10699,7 +10722,7 @@ function sameNodes(child1, child2) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/view/datatransfer
  */ /**
@@ -11516,7 +11539,7 @@ function getFiles(nativeDataTransfer) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/model/typecheckable
  */ class TypeCheckable {
@@ -11531,601 +11554,6 @@ function getFiles(nativeDataTransfer) {
     }
 }
 
-/**
- * Model node. Most basic structure of model tree.
- *
- * This is an abstract class that is a base for other classes representing different nodes in model.
- *
- * **Note:** If a node is detached from the model tree, you can manipulate it using it's API.
- * However, it is **very important** that nodes already attached to model tree should be only changed through
- * {@link module:engine/model/writer~Writer Writer API}.
- *
- * Changes done by `Node` methods, like {@link module:engine/model/element~Element#_insertChild _insertChild} or
- * {@link module:engine/model/node~Node#_setAttribute _setAttribute}
- * do not generate {@link module:engine/model/operation/operation~Operation operations}
- * which are essential for correct editor work if you modify nodes in {@link module:engine/model/document~Document document} root.
- *
- * The flow of working on `Node` (and classes that inherits from it) is as such:
- * 1. You can create a `Node` instance, modify it using it's API.
- * 2. Add `Node` to the model using `Batch` API.
- * 3. Change `Node` that was already added to the model using `Batch` API.
- *
- * Similarly, you cannot use `Batch` API on a node that has not been added to the model tree, with the exception
- * of {@link module:engine/model/writer~Writer#insert inserting} that node to the model tree.
- *
- * Be aware that using {@link module:engine/model/writer~Writer#remove remove from Batch API} does not allow to use `Node` API because
- * the information about `Node` is still kept in model document.
- *
- * In case of {@link module:engine/model/element~Element element node}, adding and removing children also counts as changing a node and
- * follows same rules.
- */ let Node$1 = class Node extends TypeCheckable {
-    /**
-	 * Parent of this node. It could be {@link module:engine/model/element~Element}
-	 * or {@link module:engine/model/documentfragment~DocumentFragment}.
-	 * Equals to `null` if the node has no parent.
-	 */ parent = null;
-    /**
-	 * Attributes set on this node.
-	 */ _attrs;
-    /**
-	 * Index of this node in its parent or `null` if the node has no parent.
-	 *
-	 * @internal
-	 */ _index = null;
-    /**
-	 * Offset at which this node starts in its parent or `null` if the node has no parent.
-	 *
-	 * @internal
-	 */ _startOffset = null;
-    /**
-	 * Creates a model node.
-	 *
-	 * This is an abstract class, so this constructor should not be used directly.
-	 *
-	 * @param attrs Node's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
-	 */ constructor(attrs){
-        super();
-        this._attrs = toMap(attrs);
-    }
-    /**
-	 * {@link module:engine/model/document~Document Document} that owns this root element.
-	 */ get document() {
-        return null;
-    }
-    /**
-	 * Index of this node in its parent or `null` if the node has no parent.
-	 */ get index() {
-        return this._index;
-    }
-    /**
-	 * Offset at which this node starts in its parent. It is equal to the sum of {@link #offsetSize offsetSize}
-	 * of all its previous siblings. Equals to `null` if node has no parent.
-	 */ get startOffset() {
-        return this._startOffset;
-    }
-    /**
-	 * Offset size of this node.
-	 *
-	 * Represents how much "offset space" is occupied by the node in its parent. It is important for
-	 * {@link module:engine/model/position~Position position}. When node has `offsetSize` greater than `1`, position can be placed between
-	 * that node start and end. `offsetSize` greater than `1` is for nodes that represents more than one entity, i.e.
-	 * a {@link module:engine/model/text~Text text node}.
-	 */ get offsetSize() {
-        return 1;
-    }
-    /**
-	 * Offset at which this node ends in its parent. It is equal to the sum of this node's
-	 * {@link module:engine/model/node~Node#startOffset start offset} and {@link #offsetSize offset size}.
-	 * Equals to `null` if the node has no parent.
-	 */ get endOffset() {
-        if (this.startOffset === null) {
-            return null;
-        }
-        return this.startOffset + this.offsetSize;
-    }
-    /**
-	 * Node's next sibling or `null` if the node is a last child of it's parent or if the node has no parent.
-	 */ get nextSibling() {
-        const index = this.index;
-        return index !== null && this.parent.getChild(index + 1) || null;
-    }
-    /**
-	 * Node's previous sibling or `null` if the node is a first child of it's parent or if the node has no parent.
-	 */ get previousSibling() {
-        const index = this.index;
-        return index !== null && this.parent.getChild(index - 1) || null;
-    }
-    /**
-	 * The top-most ancestor of the node. If node has no parent it is the root itself. If the node is a part
-	 * of {@link module:engine/model/documentfragment~DocumentFragment}, it's `root` is equal to that `DocumentFragment`.
-	 */ get root() {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
-        let root = this;
-        while(root.parent){
-            root = root.parent;
-        }
-        return root;
-    }
-    /**
-	 * Returns `true` if the node is inside a document root that is attached to the document.
-	 */ isAttached() {
-        // If the node has no parent it means that it is a root.
-        // But this is not a `RootElement`, so it means that it is not attached.
-        //
-        // If this is not the root, check if this element's root is attached.
-        return this.parent === null ? false : this.root.isAttached();
-    }
-    /**
-	 * Gets path to the node. The path is an array containing starting offsets of consecutive ancestors of this node,
-	 * beginning from {@link module:engine/model/node~Node#root root}, down to this node's starting offset. The path can be used to
-	 * create {@link module:engine/model/position~Position Position} instance.
-	 *
-	 * ```ts
-	 * const abc = new Text( 'abc' );
-	 * const foo = new Text( 'foo' );
-	 * const h1 = new Element( 'h1', null, new Text( 'header' ) );
-	 * const p = new Element( 'p', null, [ abc, foo ] );
-	 * const div = new Element( 'div', null, [ h1, p ] );
-	 * foo.getPath(); // Returns [ 1, 3 ]. `foo` is in `p` which is in `div`. `p` starts at offset 1, while `foo` at 3.
-	 * h1.getPath(); // Returns [ 0 ].
-	 * div.getPath(); // Returns [].
-	 * ```
-	 */ getPath() {
-        const path = [];
-        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
-        let node = this;
-        while(node.parent){
-            path.unshift(node.startOffset);
-            node = node.parent;
-        }
-        return path;
-    }
-    /**
-	 * Returns ancestors array of this node.
-	 *
-	 * @param options Options object.
-	 * @param options.includeSelf When set to `true` this node will be also included in parent's array.
-	 * @param options.parentFirst When set to `true`, array will be sorted from node's parent to root element,
-	 * otherwise root element will be the first item in the array.
-	 * @returns Array with ancestors.
-	 */ getAncestors(options = {}) {
-        const ancestors = [];
-        let parent = options.includeSelf ? this : this.parent;
-        while(parent){
-            ancestors[options.parentFirst ? 'push' : 'unshift'](parent);
-            parent = parent.parent;
-        }
-        return ancestors;
-    }
-    /**
-	 * Returns a {@link module:engine/model/element~Element} or {@link module:engine/model/documentfragment~DocumentFragment}
-	 * which is a common ancestor of both nodes.
-	 *
-	 * @param node The second node.
-	 * @param options Options object.
-	 * @param options.includeSelf When set to `true` both nodes will be considered "ancestors" too.
-	 * Which means that if e.g. node A is inside B, then their common ancestor will be B.
-	 */ getCommonAncestor(node, options = {}) {
-        const ancestorsA = this.getAncestors(options);
-        const ancestorsB = node.getAncestors(options);
-        let i = 0;
-        while(ancestorsA[i] == ancestorsB[i] && ancestorsA[i]){
-            i++;
-        }
-        return i === 0 ? null : ancestorsA[i - 1];
-    }
-    /**
-	 * Returns whether this node is before given node. `false` is returned if nodes are in different trees (for example,
-	 * in different {@link module:engine/model/documentfragment~DocumentFragment}s).
-	 *
-	 * @param node Node to compare with.
-	 */ isBefore(node) {
-        // Given node is not before this node if they are same.
-        if (this == node) {
-            return false;
-        }
-        // Return `false` if it is impossible to compare nodes.
-        if (this.root !== node.root) {
-            return false;
-        }
-        const thisPath = this.getPath();
-        const nodePath = node.getPath();
-        const result = compareArrays(thisPath, nodePath);
-        switch(result){
-            case 'prefix':
-                return true;
-            case 'extension':
-                return false;
-            default:
-                return thisPath[result] < nodePath[result];
-        }
-    }
-    /**
-	 * Returns whether this node is after given node. `false` is returned if nodes are in different trees (for example,
-	 * in different {@link module:engine/model/documentfragment~DocumentFragment}s).
-	 *
-	 * @param node Node to compare with.
-	 */ isAfter(node) {
-        // Given node is not before this node if they are same.
-        if (this == node) {
-            return false;
-        }
-        // Return `false` if it is impossible to compare nodes.
-        if (this.root !== node.root) {
-            return false;
-        }
-        // In other cases, just check if the `node` is before, and return the opposite.
-        return !this.isBefore(node);
-    }
-    /**
-	 * Checks if the node has an attribute with given key.
-	 *
-	 * @param key Key of attribute to check.
-	 * @returns `true` if attribute with given key is set on node, `false` otherwise.
-	 */ hasAttribute(key) {
-        return this._attrs.has(key);
-    }
-    /**
-	 * Gets an attribute value for given key or `undefined` if that attribute is not set on node.
-	 *
-	 * @param key Key of attribute to look for.
-	 * @returns Attribute value or `undefined`.
-	 */ getAttribute(key) {
-        return this._attrs.get(key);
-    }
-    /**
-	 * Returns iterator that iterates over this node's attributes.
-	 *
-	 * Attributes are returned as arrays containing two items. First one is attribute key and second is attribute value.
-	 * This format is accepted by native `Map` object and also can be passed in `Node` constructor.
-	 */ getAttributes() {
-        return this._attrs.entries();
-    }
-    /**
-	 * Returns iterator that iterates over this node's attribute keys.
-	 */ getAttributeKeys() {
-        return this._attrs.keys();
-    }
-    /**
-	 * Converts `Node` to plain object and returns it.
-	 *
-	 * @returns `Node` converted to plain object.
-	 */ toJSON() {
-        const json = {};
-        // Serializes attributes to the object.
-        // attributes = { a: 'foo', b: 1, c: true }.
-        if (this._attrs.size) {
-            json.attributes = Array.from(this._attrs).reduce((result, attr)=>{
-                result[attr[0]] = attr[1];
-                return result;
-            }, {});
-        }
-        return json;
-    }
-    /**
-	 * Creates a copy of this node, that is a node with exactly same attributes, and returns it.
-	 *
-	 * @internal
-	 * @returns Node with same attributes as this node.
-	 */ _clone(_deep) {
-        return new this.constructor(this._attrs);
-    }
-    /**
-	 * Removes this node from its parent.
-	 *
-	 * @internal
-	 * @see module:engine/model/writer~Writer#remove
-	 */ _remove() {
-        this.parent._removeChildren(this.index);
-    }
-    /**
-	 * Sets attribute on the node. If attribute with the same key already is set, it's value is overwritten.
-	 *
-	 * @see module:engine/model/writer~Writer#setAttribute
-	 * @internal
-	 * @param key Key of attribute to set.
-	 * @param value Attribute value.
-	 */ _setAttribute(key, value) {
-        this._attrs.set(key, value);
-    }
-    /**
-	 * Removes all attributes from the node and sets given attributes.
-	 *
-	 * @see module:engine/model/writer~Writer#setAttributes
-	 * @internal
-	 * @param attrs Attributes to set. See {@link module:utils/tomap~toMap} for a list of accepted values.
-	 */ _setAttributesTo(attrs) {
-        this._attrs = toMap(attrs);
-    }
-    /**
-	 * Removes an attribute with given key from the node.
-	 *
-	 * @see module:engine/model/writer~Writer#removeAttribute
-	 * @internal
-	 * @param key Key of attribute to remove.
-	 * @returns `true` if the attribute was set on the element, `false` otherwise.
-	 */ _removeAttribute(key) {
-        return this._attrs.delete(key);
-    }
-    /**
-	 * Removes all attributes from the node.
-	 *
-	 * @see module:engine/model/writer~Writer#clearAttributes
-	 * @internal
-	 */ _clearAttributes() {
-        this._attrs.clear();
-    }
-};
-// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
-// Proper overload would interfere with that.
-Node$1.prototype.is = function(type) {
-    return type === 'node' || type === 'model:node';
-};
-
-/**
- * Provides an interface to operate on a list of {@link module:engine/model/node~Node nodes}. `NodeList` is used internally
- * in classes like {@link module:engine/model/element~Element Element}
- * or {@link module:engine/model/documentfragment~DocumentFragment DocumentFragment}.
- */ class NodeList {
-    /**
-	 * Nodes contained in this node list.
-	 */ _nodes = [];
-    /**
-	 * This array maps numbers (offsets) to node that is placed at that offset.
-	 *
-	 * This array is similar to `_nodes` with the difference that one node may occupy multiple consecutive items in the array.
-	 *
-	 * This array is needed to quickly retrieve a node that is placed at given offset.
-	 */ _offsetToNode = [];
-    /**
-	 * Creates a node list.
-	 *
-	 * @internal
-	 * @param nodes Nodes contained in this node list.
-	 */ constructor(nodes){
-        if (nodes) {
-            this._insertNodes(0, nodes);
-        }
-    }
-    /**
-	 * Iterable interface.
-	 *
-	 * Iterates over all nodes contained inside this node list.
-	 */ [Symbol.iterator]() {
-        return this._nodes[Symbol.iterator]();
-    }
-    /**
-	 * Number of nodes contained inside this node list.
-	 */ get length() {
-        return this._nodes.length;
-    }
-    /**
-	 * Sum of {@link module:engine/model/node~Node#offsetSize offset sizes} of all nodes contained inside this node list.
-	 */ get maxOffset() {
-        return this._offsetToNode.length;
-    }
-    /**
-	 * Gets the node at the given index. Returns `null` if incorrect index was passed.
-	 */ getNode(index) {
-        return this._nodes[index] || null;
-    }
-    /**
-	 * Gets the node at the given offset. Returns `null` if incorrect offset was passed.
-	 */ getNodeAtOffset(offset) {
-        return this._offsetToNode[offset] || null;
-    }
-    /**
-	 * Returns an index of the given node or `null` if given node does not have a parent.
-	 *
-	 * This is an alias to {@link module:engine/model/node~Node#index}.
-	 */ getNodeIndex(node) {
-        return node.index;
-    }
-    /**
-	 * Returns the offset at which given node is placed in its parent or `null` if given node does not have a parent.
-	 *
-	 * This is an alias to {@link module:engine/model/node~Node#startOffset}.
-	 */ getNodeStartOffset(node) {
-        return node.startOffset;
-    }
-    /**
-	 * Converts index to offset in node list.
-	 *
-	 * Throws {@link module:utils/ckeditorerror~CKEditorError CKEditorError} `model-nodelist-index-out-of-bounds` if given index is less
-	 * than `0` or more than {@link #length}.
-	 */ indexToOffset(index) {
-        if (index == this._nodes.length) {
-            return this.maxOffset;
-        }
-        const node = this._nodes[index];
-        if (!node) {
-            /**
-			 * Given index cannot be found in the node list.
-			 *
-			 * @error model-nodelist-index-out-of-bounds
-			 */ throw new CKEditorError('model-nodelist-index-out-of-bounds', this);
-        }
-        return this.getNodeStartOffset(node);
-    }
-    /**
-	 * Converts offset in node list to index.
-	 *
-	 * Throws {@link module:utils/ckeditorerror~CKEditorError CKEditorError} `model-nodelist-offset-out-of-bounds` if given offset is less
-	 * than `0` or more than {@link #maxOffset}.
-	 */ offsetToIndex(offset) {
-        if (offset == this._offsetToNode.length) {
-            return this._nodes.length;
-        }
-        const node = this._offsetToNode[offset];
-        if (!node) {
-            /**
-			 * Given offset cannot be found in the node list.
-			 *
-			 * @error model-nodelist-offset-out-of-bounds
-			 * @param offset
-			 * @param nodeList Stringified node list.
-			 */ throw new CKEditorError('model-nodelist-offset-out-of-bounds', this, {
-                offset,
-                nodeList: this
-            });
-        }
-        return this.getNodeIndex(node);
-    }
-    /**
-	 * Inserts given nodes at given index.
-	 *
-	 * @internal
-	 * @param index Index at which nodes should be inserted.
-	 * @param nodes Nodes to be inserted.
-	 */ _insertNodes(index, nodes) {
-        // Validation.
-        for (const node of nodes){
-            if (!(node instanceof Node$1)) {
-                /**
-				 * Trying to insert an object which is not a Node instance.
-				 *
-				 * @error model-nodelist-insertnodes-not-node
-				 */ throw new CKEditorError('model-nodelist-insertnodes-not-node', this);
-            }
-        }
-        const nodesArray = Array.from(nodes);
-        const offsetsArray = makeOffsetsArray(nodesArray);
-        let offset = this.indexToOffset(index);
-        // Splice nodes array and offsets array into the nodelist.
-        this._nodes = spliceArray(this._nodes, nodesArray, index, 0);
-        this._offsetToNode = spliceArray(this._offsetToNode, offsetsArray, offset, 0);
-        // Refresh indexes and offsets for nodes inside this node list. We need to do this for all inserted nodes and all nodes after them.
-        for(let i = index; i < this._nodes.length; i++){
-            this._nodes[i]._index = i;
-            this._nodes[i]._startOffset = offset;
-            offset += this._nodes[i].offsetSize;
-        }
-    }
-    /**
-	 * Removes one or more nodes starting at the given index.
-	 *
-	 * @internal
-	 * @param indexStart Index of the first node to remove.
-	 * @param howMany Number of nodes to remove.
-	 * @returns Array containing removed nodes.
-	 */ _removeNodes(indexStart, howMany = 1) {
-        if (howMany == 0) {
-            return [];
-        }
-        // Remove nodes from this nodelist.
-        let offset = this.indexToOffset(indexStart);
-        const nodes = this._nodes.splice(indexStart, howMany);
-        const lastNode = nodes[nodes.length - 1];
-        const removedOffsetSum = lastNode.startOffset + lastNode.offsetSize - offset;
-        this._offsetToNode.splice(offset, removedOffsetSum);
-        // Reset index and start offset properties for the removed nodes -- they do not have a parent anymore.
-        for (const node of nodes){
-            node._index = null;
-            node._startOffset = null;
-        }
-        for(let i = indexStart; i < this._nodes.length; i++){
-            this._nodes[i]._index = i;
-            this._nodes[i]._startOffset = offset;
-            offset += this._nodes[i].offsetSize;
-        }
-        return nodes;
-    }
-    /**
-	 * Converts `NodeList` instance to an array containing nodes that were inserted in the node list. Nodes
-	 * are also converted to their plain object representation.
-	 *
-	 * @returns `NodeList` instance converted to `Array`.
-	 */ toJSON() {
-        return this._nodes.map((node)=>node.toJSON());
-    }
-}
-/**
- * Creates an array of nodes in the format as in {@link module:engine/model/nodelist~NodeList#_offsetToNode}, i.e. one node will
- * occupy multiple items if its offset size is greater than one.
- */ function makeOffsetsArray(nodes) {
-    const offsets = [];
-    for (const node of nodes){
-        const start = offsets.length;
-        offsets.length += node.offsetSize;
-        offsets.fill(node, start);
-    }
-    return offsets;
-}
-
-// @if CK_DEBUG_ENGINE // const { convertMapToStringifiedObject } = require( '../dev-utils/utils' );
-/**
- * Model text node. Type of {@link module:engine/model/node~Node node} that contains {@link module:engine/model/text~Text#data text data}.
- *
- * **Important:** see {@link module:engine/model/node~Node} to read about restrictions using `Text` and `Node` API.
- *
- * **Note:** keep in mind that `Text` instances might indirectly got removed from model tree when model is changed.
- * This happens when {@link module:engine/model/writer~Writer model writer} is used to change model and the text node is merged with
- * another text node. Then, both text nodes are removed and a new text node is inserted into the model. Because of
- * this behavior, keeping references to `Text` is not recommended. Instead, consider creating
- * {@link module:engine/model/liveposition~LivePosition live position} placed before the text node.
- */ class Text extends Node$1 {
-    /**
-	 * Text data contained in this text node.
-	 *
-	 * @internal
-	 */ _data;
-    /**
-	 * Creates a text node.
-	 *
-	 * **Note:** Constructor of this class shouldn't be used directly in the code.
-	 * Use the {@link module:engine/model/writer~Writer#createText} method instead.
-	 *
-	 * @internal
-	 * @param data Node's text.
-	 * @param attrs Node's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
-	 */ constructor(data, attrs){
-        super(attrs);
-        this._data = data || '';
-    }
-    /**
-	 * @inheritDoc
-	 */ get offsetSize() {
-        return this.data.length;
-    }
-    /**
-	 * Returns a text data contained in the node.
-	 */ get data() {
-        return this._data;
-    }
-    /**
-	 * Converts `Text` instance to plain object and returns it.
-	 *
-	 * @returns`Text` instance converted to plain object.
-	 */ toJSON() {
-        const json = super.toJSON();
-        json.data = this.data;
-        return json;
-    }
-    /**
-	 * Creates a copy of this text node and returns it. Created text node has same text data and attributes as original text node.
-	 *
-	 * @internal
-	 * @returns `Text` instance created using given plain object.
-	 */ _clone() {
-        return new Text(this.data, this.getAttributes());
-    }
-    /**
-	 * Creates a `Text` instance from given plain object (i.e. parsed JSON string).
-	 *
-	 * @param json Plain object to be converted to `Text`.
-	 * @returns `Text` instance created using given plain object.
-	 */ static fromJSON(json) {
-        return new Text(json.data, json.attributes);
-    }
-}
-// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
-// Proper overload would interfere with that.
-Text.prototype.is = function(type) {
-    return type === '$text' || type === 'model:$text' || // This are legacy values kept for backward compatibility.
-    type === 'text' || type === 'model:text' || // From super.is(). This is highly utilised method and cannot call super. See ckeditor/ckeditor5#6529.
-    type === 'node' || type === 'model:node';
-};
-
 // @if CK_DEBUG_ENGINE // const { convertMapToStringifiedObject } = require( '../dev-utils/utils' );
 /**
  * `TextProxy` represents a part of {@link module:engine/model/text~Text text node}.
@@ -12299,271 +11727,6 @@ TextProxy.prototype.is = function(type) {
     type === 'textProxy' || type === 'model:textProxy';
 };
 
-// @if CK_DEBUG_ENGINE // const { stringifyMap, convertMapToStringifiedObject, convertMapToTags } = require( '../dev-utils/utils' );
-/**
- * Model element. Type of {@link module:engine/model/node~Node node} that has a {@link module:engine/model/element~Element#name name} and
- * {@link module:engine/model/element~Element#getChildren child nodes}.
- *
- * **Important**: see {@link module:engine/model/node~Node} to read about restrictions using `Element` and `Node` API.
- */ class Element extends Node$1 {
-    /**
-	 * Element name.
-	 */ name;
-    /**
-	 * List of children nodes.
-	 */ _children = new NodeList();
-    /**
-	 * Creates a model element.
-	 *
-	 * **Note:** Constructor of this class shouldn't be used directly in the code.
-	 * Use the {@link module:engine/model/writer~Writer#createElement} method instead.
-	 *
-	 * @internal
-	 * @param name Element's name.
-	 * @param attrs Element's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
-	 * @param children One or more nodes to be inserted as children of created element.
-	 */ constructor(name, attrs, children){
-        super(attrs);
-        this.name = name;
-        if (children) {
-            this._insertChild(0, children);
-        }
-    }
-    /**
-	 * Number of this element's children.
-	 */ get childCount() {
-        return this._children.length;
-    }
-    /**
-	 * Sum of {@link module:engine/model/node~Node#offsetSize offset sizes} of all of this element's children.
-	 */ get maxOffset() {
-        return this._children.maxOffset;
-    }
-    /**
-	 * Is `true` if there are no nodes inside this element, `false` otherwise.
-	 */ get isEmpty() {
-        return this.childCount === 0;
-    }
-    /**
-	 * Gets the child at the given index. Returns `null` if incorrect index was passed.
-	 *
-	 * @param index Index in this element.
-	 * @returns Child node.
-	 */ getChild(index) {
-        return this._children.getNode(index);
-    }
-    /**
-	 * Gets the child at the given offset. Returns `null` if incorrect index was passed.
-	 *
-	 * @param offset Offset in this element.
-	 * @returns Child node.
-	 */ getChildAtOffset(offset) {
-        return this._children.getNodeAtOffset(offset);
-    }
-    /**
-	 * Returns an iterator that iterates over all of this element's children.
-	 */ getChildren() {
-        return this._children[Symbol.iterator]();
-    }
-    /**
-	 * Returns an index of the given child node. Returns `null` if given node is not a child of this element.
-	 *
-	 * @param node Child node to look for.
-	 * @returns Child node's index in this element.
-	 */ getChildIndex(node) {
-        return this._children.getNodeIndex(node);
-    }
-    /**
-	 * Returns the starting offset of given child. Starting offset is equal to the sum of
-	 * {@link module:engine/model/node~Node#offsetSize offset sizes} of all node's siblings that are before it. Returns `null` if
-	 * given node is not a child of this element.
-	 *
-	 * @param node Child node to look for.
-	 * @returns Child node's starting offset.
-	 */ getChildStartOffset(node) {
-        return this._children.getNodeStartOffset(node);
-    }
-    /**
-	 * Returns index of a node that occupies given offset. If given offset is too low, returns `0`. If given offset is
-	 * too high, returns {@link module:engine/model/element~Element#getChildIndex index after last child}.
-	 *
-	 * ```ts
-	 * const textNode = new Text( 'foo' );
-	 * const pElement = new Element( 'p' );
-	 * const divElement = new Element( [ textNode, pElement ] );
-	 * divElement.offsetToIndex( -1 ); // Returns 0, because offset is too low.
-	 * divElement.offsetToIndex( 0 ); // Returns 0, because offset 0 is taken by `textNode` which is at index 0.
-	 * divElement.offsetToIndex( 1 ); // Returns 0, because `textNode` has `offsetSize` equal to 3, so it occupies offset 1 too.
-	 * divElement.offsetToIndex( 2 ); // Returns 0.
-	 * divElement.offsetToIndex( 3 ); // Returns 1.
-	 * divElement.offsetToIndex( 4 ); // Returns 2. There are no nodes at offset 4, so last available index is returned.
-	 * ```
-	 */ offsetToIndex(offset) {
-        return this._children.offsetToIndex(offset);
-    }
-    /**
-	 * Returns a descendant node by its path relative to this element.
-	 *
-	 * ```ts
-	 * // <this>a<b>c</b></this>
-	 * this.getNodeByPath( [ 0 ] );     // -> "a"
-	 * this.getNodeByPath( [ 1 ] );     // -> <b>
-	 * this.getNodeByPath( [ 1, 0 ] );  // -> "c"
-	 * ```
-	 *
-	 * @param relativePath Path of the node to find, relative to this element.
-	 */ getNodeByPath(relativePath) {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
-        let node = this;
-        for (const offset of relativePath){
-            node = node.getChildAtOffset(offset);
-        }
-        return node;
-    }
-    /**
-	 * Returns the parent element of the given name. Returns null if the element is not inside the desired parent.
-	 *
-	 * @param parentName The name of the parent element to find.
-	 * @param options Options object.
-	 * @param options.includeSelf When set to `true` this node will be also included while searching.
-	 */ findAncestor(parentName, options = {}) {
-        let parent = options.includeSelf ? this : this.parent;
-        while(parent){
-            if (parent.name === parentName) {
-                return parent;
-            }
-            parent = parent.parent;
-        }
-        return null;
-    }
-    /**
-	 * Converts `Element` instance to plain object and returns it. Takes care of converting all of this element's children.
-	 *
-	 * @returns `Element` instance converted to plain object.
-	 */ toJSON() {
-        const json = super.toJSON();
-        json.name = this.name;
-        if (this._children.length > 0) {
-            json.children = [];
-            for (const node of this._children){
-                json.children.push(node.toJSON());
-            }
-        }
-        return json;
-    }
-    /**
-	 * Creates a copy of this element and returns it. Created element has the same name and attributes as the original element.
-	 * If clone is deep, the original element's children are also cloned. If not, then empty element is returned.
-	 *
-	 * @internal
-	 * @param deep If set to `true` clones element and all its children recursively. When set to `false`,
-	 * element will be cloned without any child.
-	 */ _clone(deep = false) {
-        const children = deep ? Array.from(this._children).map((node)=>node._clone(true)) : undefined;
-        return new Element(this.name, this.getAttributes(), children);
-    }
-    /**
-	 * {@link module:engine/model/element~Element#_insertChild Inserts} one or more nodes at the end of this element.
-	 *
-	 * @see module:engine/model/writer~Writer#append
-	 * @internal
-	 * @param nodes Nodes to be inserted.
-	 */ _appendChild(nodes) {
-        this._insertChild(this.childCount, nodes);
-    }
-    /**
-	 * Inserts one or more nodes at the given index and sets {@link module:engine/model/node~Node#parent parent} of these nodes
-	 * to this element.
-	 *
-	 * @see module:engine/model/writer~Writer#insert
-	 * @internal
-	 * @param index Index at which nodes should be inserted.
-	 * @param items Items to be inserted.
-	 */ _insertChild(index, items) {
-        const nodes = normalize$1(items);
-        for (const node of nodes){
-            // If node that is being added to this element is already inside another element, first remove it from the old parent.
-            if (node.parent !== null) {
-                node._remove();
-            }
-            node.parent = this;
-        }
-        this._children._insertNodes(index, nodes);
-    }
-    /**
-	 * Removes one or more nodes starting at the given index and sets
-	 * {@link module:engine/model/node~Node#parent parent} of these nodes to `null`.
-	 *
-	 * @see module:engine/model/writer~Writer#remove
-	 * @internal
-	 * @param index Index of the first node to remove.
-	 * @param howMany Number of nodes to remove.
-	 * @returns Array containing removed nodes.
-	 */ _removeChildren(index, howMany = 1) {
-        const nodes = this._children._removeNodes(index, howMany);
-        for (const node of nodes){
-            node.parent = null;
-        }
-        return nodes;
-    }
-    /**
-	 * Creates an `Element` instance from given plain object (i.e. parsed JSON string).
-	 * Converts `Element` children to proper nodes.
-	 *
-	 * @param json Plain object to be converted to `Element`.
-	 * @returns `Element` instance created using given plain object.
-	 */ static fromJSON(json) {
-        let children;
-        if (json.children) {
-            children = [];
-            for (const child of json.children){
-                if (child.name) {
-                    // If child has name property, it is an Element.
-                    children.push(Element.fromJSON(child));
-                } else {
-                    // Otherwise, it is a Text node.
-                    children.push(Text.fromJSON(child));
-                }
-            }
-        }
-        return new Element(json.name, json.attributes, children);
-    }
-}
-// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
-// Proper overload would interfere with that.
-Element.prototype.is = function(type, name) {
-    if (!name) {
-        return type === 'element' || type === 'model:element' || // From super.is(). This is highly utilised method and cannot call super. See ckeditor/ckeditor5#6529.
-        type === 'node' || type === 'model:node';
-    }
-    return name === this.name && (type === 'element' || type === 'model:element');
-};
-/**
- * Converts strings to Text and non-iterables to arrays.
- */ function normalize$1(nodes) {
-    // Separate condition because string is iterable.
-    if (typeof nodes == 'string') {
-        return [
-            new Text(nodes)
-        ];
-    }
-    if (!isIterable(nodes)) {
-        nodes = [
-            nodes
-        ];
-    }
-    // Array.from to enable .map() on non-arrays.
-    return Array.from(nodes).map((node)=>{
-        if (typeof node == 'string') {
-            return new Text(node);
-        }
-        if (node instanceof TextProxy) {
-            return new Text(node.data, node.getAttributes());
-        }
-        return node;
-    });
-}
-
 /**
  * Position iterator class. It allows to iterate forward and backward over the document.
  */ class TreeWalker {
@@ -12718,7 +11881,7 @@ Element.prototype.is = function(type, name) {
         // Use a highly optimized version instead of checking the text node first and then getting the node after. See #6582.
         const textNodeAtPosition = getTextNodeAtPosition(position, parent);
         const node = textNodeAtPosition || getNodeAfterPosition(position, parent, textNodeAtPosition);
-        if (node instanceof Element) {
+        if (node && node.is('model:element')) {
             if (!this.shallow) {
                 // Manual operations on path internals for optimization purposes. Here and in the rest of the method.
                 position.path.push(0);
@@ -12736,7 +11899,7 @@ Element.prototype.is = function(type, name) {
             this._position = position;
             return formatReturnValue('elementStart', node, previousPosition, position, 1);
         }
-        if (node instanceof Text) {
+        if (node && node.is('model:$text')) {
             let charactersCount;
             if (this.singleCharacters) {
                 charactersCount = 1;
@@ -12788,7 +11951,7 @@ Element.prototype.is = function(type, name) {
         const positionParent = position.parent;
         const textNodeAtPosition = getTextNodeAtPosition(position, positionParent);
         const node = textNodeAtPosition || getNodeBeforePosition(position, positionParent, textNodeAtPosition);
-        if (node instanceof Element) {
+        if (node && node.is('model:element')) {
             position.offset--;
             if (this.shallow) {
                 this._position = position;
@@ -12802,7 +11965,7 @@ Element.prototype.is = function(type, name) {
             }
             return formatReturnValue('elementEnd', node, previousPosition, position);
         }
-        if (node instanceof Text) {
+        if (node && node.is('model:$text')) {
             let charactersCount;
             if (this.singleCharacters) {
                 charactersCount = 1;
@@ -12920,7 +12083,7 @@ function formatReturnValue(type, item, previousPosition, nextPosition, length) {
 			 * @error model-position-root-invalid
 			 */ throw new CKEditorError('model-position-root-invalid', root);
         }
-        if (!(path instanceof Array) || path.length === 0) {
+        if (!Array.isArray(path) || path.length === 0) {
             /**
 			 * Position path must be an array with at least one item.
 			 *
@@ -13560,7 +12723,7 @@ function formatReturnValue(type, item, previousPosition, nextPosition, length) {
 	 * @param offset Offset or one of the flags. Used only when the first parameter is a {@link module:engine/model/item~Item model item}.
 	 * @param stickiness Position stickiness. Used only when the first parameter is a {@link module:engine/model/item~Item model item}.
 	 */ static _createAt(itemOrPosition, offset, stickiness = 'toNone') {
-        if (itemOrPosition instanceof Position) {
+        if (itemOrPosition.is('model:position')) {
             return new Position(itemOrPosition.root, itemOrPosition.path, itemOrPosition.stickiness);
         } else {
             const node = itemOrPosition;
@@ -15046,22 +14209,28 @@ Range.prototype.is = function(type) {
 	 * @param viewNode View node.
 	 * @returns Length of the node in the tree model.
 	 */ getModelLength(viewNode) {
-        if (this._viewToModelLengthCallbacks.get(viewNode.name)) {
-            const callback = this._viewToModelLengthCallbacks.get(viewNode.name);
-            return callback(viewNode);
-        } else if (this._viewToModelMapping.has(viewNode)) {
-            return 1;
-        } else if (viewNode.is('$text')) {
-            return viewNode.data.length;
-        } else if (viewNode.is('uiElement')) {
-            return 0;
-        } else {
-            let len = 0;
-            for (const child of viewNode.getChildren()){
-                len += this.getModelLength(child);
+        const stack = [
+            viewNode
+        ];
+        let len = 0;
+        while(stack.length > 0){
+            const node = stack.pop();
+            const callback = node.name && this._viewToModelLengthCallbacks.size > 0 && this._viewToModelLengthCallbacks.get(node.name);
+            if (callback) {
+                len += callback(node);
+            } else if (this._viewToModelMapping.has(node)) {
+                len += 1;
+            } else if (node.is('$text')) {
+                len += node.data.length;
+            } else if (node.is('uiElement')) {
+                continue;
+            } else {
+                for (const child of node.getChildren()){
+                    stack.push(child);
+                }
             }
-            return len;
         }
+        return len;
     }
     /**
 	 * Finds the position in the view node (or in its children) with the expected model offset.
@@ -15133,9 +14302,9 @@ Range.prototype.is = function(type) {
         // If the position is just before a text node, put it at the beginning of that text node.
         const nodeBefore = viewPosition.nodeBefore;
         const nodeAfter = viewPosition.nodeAfter;
-        if (nodeBefore instanceof Text$1) {
+        if (nodeBefore && nodeBefore.is('view:$text')) {
             return new Position$1(nodeBefore, nodeBefore.data.length);
-        } else if (nodeAfter instanceof Text$1) {
+        } else if (nodeAfter && nodeAfter.is('view:$text')) {
             return new Position$1(nodeAfter, 0);
         }
         // Otherwise, just return the given position.
@@ -15714,10 +14883,10 @@ Range.prototype.is = function(type) {
             this._addConsumablesForInsert(conversionApi.consumable, range);
         }
         // Fire a separate insert event for each node and text fragment contained in the range.
-        for (const data of Array.from(range.getWalker({
+        for (const data of range.getWalker({
             shallow: true
-        })).map(walkerValueToEventData)){
-            this._testAndFire('insert', data, conversionApi);
+        })){
+            this._testAndFire('insert', walkerValueToEventData(data), conversionApi);
         }
     }
     /**
@@ -16003,14 +15172,343 @@ function getEventName(type, data) {
     return `${type}:${name}`;
 }
 function walkerValueToEventData(value) {
-    const item = value.item;
-    const itemRange = Range._createFromPositionAndShift(value.previousPosition, value.length);
     return {
-        item,
-        range: itemRange
+        item: value.item,
+        range: Range._createFromPositionAndShift(value.previousPosition, value.length)
     };
 }
 
+/**
+ * Model node. Most basic structure of model tree.
+ *
+ * This is an abstract class that is a base for other classes representing different nodes in model.
+ *
+ * **Note:** If a node is detached from the model tree, you can manipulate it using it's API.
+ * However, it is **very important** that nodes already attached to model tree should be only changed through
+ * {@link module:engine/model/writer~Writer Writer API}.
+ *
+ * Changes done by `Node` methods, like {@link module:engine/model/element~Element#_insertChild _insertChild} or
+ * {@link module:engine/model/node~Node#_setAttribute _setAttribute}
+ * do not generate {@link module:engine/model/operation/operation~Operation operations}
+ * which are essential for correct editor work if you modify nodes in {@link module:engine/model/document~Document document} root.
+ *
+ * The flow of working on `Node` (and classes that inherits from it) is as such:
+ * 1. You can create a `Node` instance, modify it using it's API.
+ * 2. Add `Node` to the model using `Batch` API.
+ * 3. Change `Node` that was already added to the model using `Batch` API.
+ *
+ * Similarly, you cannot use `Batch` API on a node that has not been added to the model tree, with the exception
+ * of {@link module:engine/model/writer~Writer#insert inserting} that node to the model tree.
+ *
+ * Be aware that using {@link module:engine/model/writer~Writer#remove remove from Batch API} does not allow to use `Node` API because
+ * the information about `Node` is still kept in model document.
+ *
+ * In case of {@link module:engine/model/element~Element element node}, adding and removing children also counts as changing a node and
+ * follows same rules.
+ */ let Node$1 = class Node extends TypeCheckable {
+    /**
+	 * Parent of this node. It could be {@link module:engine/model/element~Element}
+	 * or {@link module:engine/model/documentfragment~DocumentFragment}.
+	 * Equals to `null` if the node has no parent.
+	 */ parent = null;
+    /**
+	 * Attributes set on this node.
+	 */ _attrs;
+    /**
+	 * Index of this node in its parent or `null` if the node has no parent.
+	 *
+	 * @internal
+	 */ _index = null;
+    /**
+	 * Offset at which this node starts in its parent or `null` if the node has no parent.
+	 *
+	 * @internal
+	 */ _startOffset = null;
+    /**
+	 * Creates a model node.
+	 *
+	 * This is an abstract class, so this constructor should not be used directly.
+	 *
+	 * @param attrs Node's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
+	 */ constructor(attrs){
+        super();
+        this._attrs = toMap(attrs);
+    }
+    /**
+	 * {@link module:engine/model/document~Document Document} that owns this root element.
+	 */ get document() {
+        return null;
+    }
+    /**
+	 * Index of this node in its parent or `null` if the node has no parent.
+	 */ get index() {
+        return this._index;
+    }
+    /**
+	 * Offset at which this node starts in its parent. It is equal to the sum of {@link #offsetSize offsetSize}
+	 * of all its previous siblings. Equals to `null` if node has no parent.
+	 */ get startOffset() {
+        return this._startOffset;
+    }
+    /**
+	 * Offset size of this node.
+	 *
+	 * Represents how much "offset space" is occupied by the node in its parent. It is important for
+	 * {@link module:engine/model/position~Position position}. When node has `offsetSize` greater than `1`, position can be placed between
+	 * that node start and end. `offsetSize` greater than `1` is for nodes that represents more than one entity, i.e.
+	 * a {@link module:engine/model/text~Text text node}.
+	 */ get offsetSize() {
+        return 1;
+    }
+    /**
+	 * Offset at which this node ends in its parent. It is equal to the sum of this node's
+	 * {@link module:engine/model/node~Node#startOffset start offset} and {@link #offsetSize offset size}.
+	 * Equals to `null` if the node has no parent.
+	 */ get endOffset() {
+        if (this.startOffset === null) {
+            return null;
+        }
+        return this.startOffset + this.offsetSize;
+    }
+    /**
+	 * Node's next sibling or `null` if the node is a last child of it's parent or if the node has no parent.
+	 */ get nextSibling() {
+        const index = this.index;
+        return index !== null && this.parent.getChild(index + 1) || null;
+    }
+    /**
+	 * Node's previous sibling or `null` if the node is a first child of it's parent or if the node has no parent.
+	 */ get previousSibling() {
+        const index = this.index;
+        return index !== null && this.parent.getChild(index - 1) || null;
+    }
+    /**
+	 * The top-most ancestor of the node. If node has no parent it is the root itself. If the node is a part
+	 * of {@link module:engine/model/documentfragment~DocumentFragment}, it's `root` is equal to that `DocumentFragment`.
+	 */ get root() {
+        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
+        let root = this;
+        while(root.parent){
+            root = root.parent;
+        }
+        return root;
+    }
+    /**
+	 * Returns `true` if the node is inside a document root that is attached to the document.
+	 */ isAttached() {
+        // If the node has no parent it means that it is a root.
+        // But this is not a `RootElement`, so it means that it is not attached.
+        //
+        // If this is not the root, check if this element's root is attached.
+        return this.parent === null ? false : this.root.isAttached();
+    }
+    /**
+	 * Gets path to the node. The path is an array containing starting offsets of consecutive ancestors of this node,
+	 * beginning from {@link module:engine/model/node~Node#root root}, down to this node's starting offset. The path can be used to
+	 * create {@link module:engine/model/position~Position Position} instance.
+	 *
+	 * ```ts
+	 * const abc = new Text( 'abc' );
+	 * const foo = new Text( 'foo' );
+	 * const h1 = new Element( 'h1', null, new Text( 'header' ) );
+	 * const p = new Element( 'p', null, [ abc, foo ] );
+	 * const div = new Element( 'div', null, [ h1, p ] );
+	 * foo.getPath(); // Returns [ 1, 3 ]. `foo` is in `p` which is in `div`. `p` starts at offset 1, while `foo` at 3.
+	 * h1.getPath(); // Returns [ 0 ].
+	 * div.getPath(); // Returns [].
+	 * ```
+	 */ getPath() {
+        const path = [];
+        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
+        let node = this;
+        while(node.parent){
+            path.unshift(node.startOffset);
+            node = node.parent;
+        }
+        return path;
+    }
+    /**
+	 * Returns ancestors array of this node.
+	 *
+	 * @param options Options object.
+	 * @param options.includeSelf When set to `true` this node will be also included in parent's array.
+	 * @param options.parentFirst When set to `true`, array will be sorted from node's parent to root element,
+	 * otherwise root element will be the first item in the array.
+	 * @returns Array with ancestors.
+	 */ getAncestors(options = {}) {
+        const ancestors = [];
+        let parent = options.includeSelf ? this : this.parent;
+        while(parent){
+            ancestors[options.parentFirst ? 'push' : 'unshift'](parent);
+            parent = parent.parent;
+        }
+        return ancestors;
+    }
+    /**
+	 * Returns a {@link module:engine/model/element~Element} or {@link module:engine/model/documentfragment~DocumentFragment}
+	 * which is a common ancestor of both nodes.
+	 *
+	 * @param node The second node.
+	 * @param options Options object.
+	 * @param options.includeSelf When set to `true` both nodes will be considered "ancestors" too.
+	 * Which means that if e.g. node A is inside B, then their common ancestor will be B.
+	 */ getCommonAncestor(node, options = {}) {
+        const ancestorsA = this.getAncestors(options);
+        const ancestorsB = node.getAncestors(options);
+        let i = 0;
+        while(ancestorsA[i] == ancestorsB[i] && ancestorsA[i]){
+            i++;
+        }
+        return i === 0 ? null : ancestorsA[i - 1];
+    }
+    /**
+	 * Returns whether this node is before given node. `false` is returned if nodes are in different trees (for example,
+	 * in different {@link module:engine/model/documentfragment~DocumentFragment}s).
+	 *
+	 * @param node Node to compare with.
+	 */ isBefore(node) {
+        // Given node is not before this node if they are same.
+        if (this == node) {
+            return false;
+        }
+        // Return `false` if it is impossible to compare nodes.
+        if (this.root !== node.root) {
+            return false;
+        }
+        const thisPath = this.getPath();
+        const nodePath = node.getPath();
+        const result = compareArrays(thisPath, nodePath);
+        switch(result){
+            case 'prefix':
+                return true;
+            case 'extension':
+                return false;
+            default:
+                return thisPath[result] < nodePath[result];
+        }
+    }
+    /**
+	 * Returns whether this node is after given node. `false` is returned if nodes are in different trees (for example,
+	 * in different {@link module:engine/model/documentfragment~DocumentFragment}s).
+	 *
+	 * @param node Node to compare with.
+	 */ isAfter(node) {
+        // Given node is not before this node if they are same.
+        if (this == node) {
+            return false;
+        }
+        // Return `false` if it is impossible to compare nodes.
+        if (this.root !== node.root) {
+            return false;
+        }
+        // In other cases, just check if the `node` is before, and return the opposite.
+        return !this.isBefore(node);
+    }
+    /**
+	 * Checks if the node has an attribute with given key.
+	 *
+	 * @param key Key of attribute to check.
+	 * @returns `true` if attribute with given key is set on node, `false` otherwise.
+	 */ hasAttribute(key) {
+        return this._attrs.has(key);
+    }
+    /**
+	 * Gets an attribute value for given key or `undefined` if that attribute is not set on node.
+	 *
+	 * @param key Key of attribute to look for.
+	 * @returns Attribute value or `undefined`.
+	 */ getAttribute(key) {
+        return this._attrs.get(key);
+    }
+    /**
+	 * Returns iterator that iterates over this node's attributes.
+	 *
+	 * Attributes are returned as arrays containing two items. First one is attribute key and second is attribute value.
+	 * This format is accepted by native `Map` object and also can be passed in `Node` constructor.
+	 */ getAttributes() {
+        return this._attrs.entries();
+    }
+    /**
+	 * Returns iterator that iterates over this node's attribute keys.
+	 */ getAttributeKeys() {
+        return this._attrs.keys();
+    }
+    /**
+	 * Converts `Node` to plain object and returns it.
+	 *
+	 * @returns `Node` converted to plain object.
+	 */ toJSON() {
+        const json = {};
+        // Serializes attributes to the object.
+        // attributes = { a: 'foo', b: 1, c: true }.
+        if (this._attrs.size) {
+            json.attributes = Array.from(this._attrs).reduce((result, attr)=>{
+                result[attr[0]] = attr[1];
+                return result;
+            }, {});
+        }
+        return json;
+    }
+    /**
+	 * Creates a copy of this node, that is a node with exactly same attributes, and returns it.
+	 *
+	 * @internal
+	 * @returns Node with same attributes as this node.
+	 */ _clone(_deep) {
+        return new this.constructor(this._attrs);
+    }
+    /**
+	 * Removes this node from its parent.
+	 *
+	 * @internal
+	 * @see module:engine/model/writer~Writer#remove
+	 */ _remove() {
+        this.parent._removeChildren(this.index);
+    }
+    /**
+	 * Sets attribute on the node. If attribute with the same key already is set, it's value is overwritten.
+	 *
+	 * @see module:engine/model/writer~Writer#setAttribute
+	 * @internal
+	 * @param key Key of attribute to set.
+	 * @param value Attribute value.
+	 */ _setAttribute(key, value) {
+        this._attrs.set(key, value);
+    }
+    /**
+	 * Removes all attributes from the node and sets given attributes.
+	 *
+	 * @see module:engine/model/writer~Writer#setAttributes
+	 * @internal
+	 * @param attrs Attributes to set. See {@link module:utils/tomap~toMap} for a list of accepted values.
+	 */ _setAttributesTo(attrs) {
+        this._attrs = toMap(attrs);
+    }
+    /**
+	 * Removes an attribute with given key from the node.
+	 *
+	 * @see module:engine/model/writer~Writer#removeAttribute
+	 * @internal
+	 * @param key Key of attribute to remove.
+	 * @returns `true` if the attribute was set on the element, `false` otherwise.
+	 */ _removeAttribute(key) {
+        return this._attrs.delete(key);
+    }
+    /**
+	 * Removes all attributes from the node.
+	 *
+	 * @see module:engine/model/writer~Writer#clearAttributes
+	 * @internal
+	 */ _clearAttributes() {
+        this._attrs.clear();
+    }
+};
+// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
+// Proper overload would interfere with that.
+Node$1.prototype.is = function(type) {
+    return type === 'node' || type === 'model:node';
+};
+
 /**
  * Selection is a set of {@link module:engine/model/range~Range ranges}. It has a direction specified by its
  * {@link module:engine/model/selection~Selection#anchor anchor} and {@link module:engine/model/selection~Selection#focus focus}
@@ -16876,6 +16374,80 @@ LiveRange.prototype.is = function(type) {
     return false;
 }
 
+// @if CK_DEBUG_ENGINE // const { convertMapToStringifiedObject } = require( '../dev-utils/utils' );
+/**
+ * Model text node. Type of {@link module:engine/model/node~Node node} that contains {@link module:engine/model/text~Text#data text data}.
+ *
+ * **Important:** see {@link module:engine/model/node~Node} to read about restrictions using `Text` and `Node` API.
+ *
+ * **Note:** keep in mind that `Text` instances might indirectly got removed from model tree when model is changed.
+ * This happens when {@link module:engine/model/writer~Writer model writer} is used to change model and the text node is merged with
+ * another text node. Then, both text nodes are removed and a new text node is inserted into the model. Because of
+ * this behavior, keeping references to `Text` is not recommended. Instead, consider creating
+ * {@link module:engine/model/liveposition~LivePosition live position} placed before the text node.
+ */ class Text extends Node$1 {
+    /**
+	 * Text data contained in this text node.
+	 *
+	 * @internal
+	 */ _data;
+    /**
+	 * Creates a text node.
+	 *
+	 * **Note:** Constructor of this class shouldn't be used directly in the code.
+	 * Use the {@link module:engine/model/writer~Writer#createText} method instead.
+	 *
+	 * @internal
+	 * @param data Node's text.
+	 * @param attrs Node's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
+	 */ constructor(data, attrs){
+        super(attrs);
+        this._data = data || '';
+    }
+    /**
+	 * @inheritDoc
+	 */ get offsetSize() {
+        return this.data.length;
+    }
+    /**
+	 * Returns a text data contained in the node.
+	 */ get data() {
+        return this._data;
+    }
+    /**
+	 * Converts `Text` instance to plain object and returns it.
+	 *
+	 * @returns`Text` instance converted to plain object.
+	 */ toJSON() {
+        const json = super.toJSON();
+        json.data = this.data;
+        return json;
+    }
+    /**
+	 * Creates a copy of this text node and returns it. Created text node has same text data and attributes as original text node.
+	 *
+	 * @internal
+	 * @returns `Text` instance created using given plain object.
+	 */ _clone() {
+        return new Text(this.data, this.getAttributes());
+    }
+    /**
+	 * Creates a `Text` instance from given plain object (i.e. parsed JSON string).
+	 *
+	 * @param json Plain object to be converted to `Text`.
+	 * @returns `Text` instance created using given plain object.
+	 */ static fromJSON(json) {
+        return new Text(json.data, json.attributes);
+    }
+}
+// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
+// Proper overload would interfere with that.
+Text.prototype.is = function(type) {
+    return type === '$text' || type === 'model:$text' || // This are legacy values kept for backward compatibility.
+    type === 'text' || type === 'model:text' || // From super.is(). This is highly utilised method and cannot call super. See ckeditor/ckeditor5#6529.
+    type === 'node' || type === 'model:node';
+};
+
 const storePrefix = 'selection:';
 /**
  * `DocumentSelection` is a special selection which is used as the
@@ -17833,9 +17405,513 @@ DocumentSelection.prototype.is = function(type) {
     }
 }
 
+/**
+ * Provides an interface to operate on a list of {@link module:engine/model/node~Node nodes}. `NodeList` is used internally
+ * in classes like {@link module:engine/model/element~Element Element}
+ * or {@link module:engine/model/documentfragment~DocumentFragment DocumentFragment}.
+ */ class NodeList {
+    /**
+	 * Nodes contained in this node list.
+	 */ _nodes = [];
+    /**
+	 * This array maps numbers (offsets) to node that is placed at that offset.
+	 *
+	 * This array is similar to `_nodes` with the difference that one node may occupy multiple consecutive items in the array.
+	 *
+	 * This array is needed to quickly retrieve a node that is placed at given offset.
+	 */ _offsetToNode = [];
+    /**
+	 * Creates a node list.
+	 *
+	 * @internal
+	 * @param nodes Nodes contained in this node list.
+	 */ constructor(nodes){
+        if (nodes) {
+            this._insertNodes(0, nodes);
+        }
+    }
+    /**
+	 * Iterable interface.
+	 *
+	 * Iterates over all nodes contained inside this node list.
+	 */ [Symbol.iterator]() {
+        return this._nodes[Symbol.iterator]();
+    }
+    /**
+	 * Number of nodes contained inside this node list.
+	 */ get length() {
+        return this._nodes.length;
+    }
+    /**
+	 * Sum of {@link module:engine/model/node~Node#offsetSize offset sizes} of all nodes contained inside this node list.
+	 */ get maxOffset() {
+        return this._offsetToNode.length;
+    }
+    /**
+	 * Gets the node at the given index. Returns `null` if incorrect index was passed.
+	 */ getNode(index) {
+        return this._nodes[index] || null;
+    }
+    /**
+	 * Gets the node at the given offset. Returns `null` if incorrect offset was passed.
+	 */ getNodeAtOffset(offset) {
+        return this._offsetToNode[offset] || null;
+    }
+    /**
+	 * Returns an index of the given node or `null` if given node does not have a parent.
+	 *
+	 * This is an alias to {@link module:engine/model/node~Node#index}.
+	 */ getNodeIndex(node) {
+        return node.index;
+    }
+    /**
+	 * Returns the offset at which given node is placed in its parent or `null` if given node does not have a parent.
+	 *
+	 * This is an alias to {@link module:engine/model/node~Node#startOffset}.
+	 */ getNodeStartOffset(node) {
+        return node.startOffset;
+    }
+    /**
+	 * Converts index to offset in node list.
+	 *
+	 * Throws {@link module:utils/ckeditorerror~CKEditorError CKEditorError} `model-nodelist-index-out-of-bounds` if given index is less
+	 * than `0` or more than {@link #length}.
+	 */ indexToOffset(index) {
+        if (index == this._nodes.length) {
+            return this.maxOffset;
+        }
+        const node = this._nodes[index];
+        if (!node) {
+            /**
+			 * Given index cannot be found in the node list.
+			 *
+			 * @error model-nodelist-index-out-of-bounds
+			 */ throw new CKEditorError('model-nodelist-index-out-of-bounds', this);
+        }
+        return this.getNodeStartOffset(node);
+    }
+    /**
+	 * Converts offset in node list to index.
+	 *
+	 * Throws {@link module:utils/ckeditorerror~CKEditorError CKEditorError} `model-nodelist-offset-out-of-bounds` if given offset is less
+	 * than `0` or more than {@link #maxOffset}.
+	 */ offsetToIndex(offset) {
+        if (offset == this._offsetToNode.length) {
+            return this._nodes.length;
+        }
+        const node = this._offsetToNode[offset];
+        if (!node) {
+            /**
+			 * Given offset cannot be found in the node list.
+			 *
+			 * @error model-nodelist-offset-out-of-bounds
+			 * @param offset
+			 * @param nodeList Stringified node list.
+			 */ throw new CKEditorError('model-nodelist-offset-out-of-bounds', this, {
+                offset,
+                nodeList: this
+            });
+        }
+        return this.getNodeIndex(node);
+    }
+    /**
+	 * Inserts given nodes at given index.
+	 *
+	 * @internal
+	 * @param index Index at which nodes should be inserted.
+	 * @param nodes Nodes to be inserted.
+	 */ _insertNodes(index, nodes) {
+        const nodesArray = [];
+        // Validation.
+        for (const node of nodes){
+            if (!(node instanceof Node$1)) {
+                /**
+				 * Trying to insert an object which is not a Node instance.
+				 *
+				 * @error model-nodelist-insertnodes-not-node
+				 */ throw new CKEditorError('model-nodelist-insertnodes-not-node', this);
+            }
+            nodesArray.push(node);
+        }
+        let offset = this.indexToOffset(index);
+        // Splice nodes array and offsets array into the nodelist.
+        spliceArray(this._nodes, nodesArray, index);
+        spliceArray(this._offsetToNode, makeOffsetsArray(nodesArray), offset);
+        // Refresh indexes and offsets for nodes inside this node list. We need to do this for all inserted nodes and all nodes after them.
+        for(let i = index; i < this._nodes.length; i++){
+            this._nodes[i]._index = i;
+            this._nodes[i]._startOffset = offset;
+            offset += this._nodes[i].offsetSize;
+        }
+    }
+    /**
+	 * Removes one or more nodes starting at the given index.
+	 *
+	 * @internal
+	 * @param indexStart Index of the first node to remove.
+	 * @param howMany Number of nodes to remove.
+	 * @returns Array containing removed nodes.
+	 */ _removeNodes(indexStart, howMany = 1) {
+        if (howMany == 0) {
+            return [];
+        }
+        // Remove nodes from this nodelist.
+        let offset = this.indexToOffset(indexStart);
+        const nodes = this._nodes.splice(indexStart, howMany);
+        const lastNode = nodes[nodes.length - 1];
+        const removedOffsetSum = lastNode.startOffset + lastNode.offsetSize - offset;
+        this._offsetToNode.splice(offset, removedOffsetSum);
+        // Reset index and start offset properties for the removed nodes -- they do not have a parent anymore.
+        for (const node of nodes){
+            node._index = null;
+            node._startOffset = null;
+        }
+        for(let i = indexStart; i < this._nodes.length; i++){
+            this._nodes[i]._index = i;
+            this._nodes[i]._startOffset = offset;
+            offset += this._nodes[i].offsetSize;
+        }
+        return nodes;
+    }
+    /**
+	 * Removes children nodes provided as an array. These nodes do not need to be direct siblings.
+	 *
+	 * This method is faster than removing nodes one by one, as it recalculates offsets only once.
+	 *
+	 * @internal
+	 * @param nodes Array of nodes.
+	 */ _removeNodesArray(nodes) {
+        if (nodes.length == 0) {
+            return;
+        }
+        for (const node of nodes){
+            node._index = null;
+            node._startOffset = null;
+        }
+        this._nodes = this._nodes.filter((node)=>node.index !== null);
+        this._offsetToNode = this._offsetToNode.filter((node)=>node.index !== null);
+        let offset = 0;
+        for(let i = 0; i < this._nodes.length; i++){
+            this._nodes[i]._index = i;
+            this._nodes[i]._startOffset = offset;
+            offset += this._nodes[i].offsetSize;
+        }
+    }
+    /**
+	 * Converts `NodeList` instance to an array containing nodes that were inserted in the node list. Nodes
+	 * are also converted to their plain object representation.
+	 *
+	 * @returns `NodeList` instance converted to `Array`.
+	 */ toJSON() {
+        return this._nodes.map((node)=>node.toJSON());
+    }
+}
+/**
+ * Creates an array of nodes in the format as in {@link module:engine/model/nodelist~NodeList#_offsetToNode}, i.e. one node will
+ * occupy multiple items if its offset size is greater than one.
+ */ function makeOffsetsArray(nodes) {
+    const offsets = [];
+    let index = 0;
+    for (const node of nodes){
+        for(let i = 0; i < node.offsetSize; i++){
+            offsets[index++] = node;
+        }
+    }
+    return offsets;
+}
+
+// @if CK_DEBUG_ENGINE // const { stringifyMap, convertMapToStringifiedObject, convertMapToTags } = require( '../dev-utils/utils' );
+/**
+ * Model element. Type of {@link module:engine/model/node~Node node} that has a {@link module:engine/model/element~Element#name name} and
+ * {@link module:engine/model/element~Element#getChildren child nodes}.
+ *
+ * **Important**: see {@link module:engine/model/node~Node} to read about restrictions using `Element` and `Node` API.
+ */ class Element extends Node$1 {
+    /**
+	 * Element name.
+	 */ name;
+    /**
+	 * List of children nodes.
+	 */ _children = new NodeList();
+    /**
+	 * Creates a model element.
+	 *
+	 * **Note:** Constructor of this class shouldn't be used directly in the code.
+	 * Use the {@link module:engine/model/writer~Writer#createElement} method instead.
+	 *
+	 * @internal
+	 * @param name Element's name.
+	 * @param attrs Element's attributes. See {@link module:utils/tomap~toMap} for a list of accepted values.
+	 * @param children One or more nodes to be inserted as children of created element.
+	 */ constructor(name, attrs, children){
+        super(attrs);
+        this.name = name;
+        if (children) {
+            this._insertChild(0, children);
+        }
+    }
+    /**
+	 * Number of this element's children.
+	 */ get childCount() {
+        return this._children.length;
+    }
+    /**
+	 * Sum of {@link module:engine/model/node~Node#offsetSize offset sizes} of all of this element's children.
+	 */ get maxOffset() {
+        return this._children.maxOffset;
+    }
+    /**
+	 * Is `true` if there are no nodes inside this element, `false` otherwise.
+	 */ get isEmpty() {
+        return this.childCount === 0;
+    }
+    /**
+	 * Gets the child at the given index. Returns `null` if incorrect index was passed.
+	 *
+	 * @param index Index in this element.
+	 * @returns Child node.
+	 */ getChild(index) {
+        return this._children.getNode(index);
+    }
+    /**
+	 * Gets the child at the given offset. Returns `null` if incorrect index was passed.
+	 *
+	 * @param offset Offset in this element.
+	 * @returns Child node.
+	 */ getChildAtOffset(offset) {
+        return this._children.getNodeAtOffset(offset);
+    }
+    /**
+	 * Returns an iterator that iterates over all of this element's children.
+	 */ getChildren() {
+        return this._children[Symbol.iterator]();
+    }
+    /**
+	 * Returns an index of the given child node. Returns `null` if given node is not a child of this element.
+	 *
+	 * @param node Child node to look for.
+	 * @returns Child node's index in this element.
+	 */ getChildIndex(node) {
+        return this._children.getNodeIndex(node);
+    }
+    /**
+	 * Returns the starting offset of given child. Starting offset is equal to the sum of
+	 * {@link module:engine/model/node~Node#offsetSize offset sizes} of all node's siblings that are before it. Returns `null` if
+	 * given node is not a child of this element.
+	 *
+	 * @param node Child node to look for.
+	 * @returns Child node's starting offset.
+	 */ getChildStartOffset(node) {
+        return this._children.getNodeStartOffset(node);
+    }
+    /**
+	 * Returns index of a node that occupies given offset. If given offset is too low, returns `0`. If given offset is
+	 * too high, returns {@link module:engine/model/element~Element#getChildIndex index after last child}.
+	 *
+	 * ```ts
+	 * const textNode = new Text( 'foo' );
+	 * const pElement = new Element( 'p' );
+	 * const divElement = new Element( [ textNode, pElement ] );
+	 * divElement.offsetToIndex( -1 ); // Returns 0, because offset is too low.
+	 * divElement.offsetToIndex( 0 ); // Returns 0, because offset 0 is taken by `textNode` which is at index 0.
+	 * divElement.offsetToIndex( 1 ); // Returns 0, because `textNode` has `offsetSize` equal to 3, so it occupies offset 1 too.
+	 * divElement.offsetToIndex( 2 ); // Returns 0.
+	 * divElement.offsetToIndex( 3 ); // Returns 1.
+	 * divElement.offsetToIndex( 4 ); // Returns 2. There are no nodes at offset 4, so last available index is returned.
+	 * ```
+	 */ offsetToIndex(offset) {
+        return this._children.offsetToIndex(offset);
+    }
+    /**
+	 * Returns a descendant node by its path relative to this element.
+	 *
+	 * ```ts
+	 * // <this>a<b>c</b></this>
+	 * this.getNodeByPath( [ 0 ] );     // -> "a"
+	 * this.getNodeByPath( [ 1 ] );     // -> <b>
+	 * this.getNodeByPath( [ 1, 0 ] );  // -> "c"
+	 * ```
+	 *
+	 * @param relativePath Path of the node to find, relative to this element.
+	 */ getNodeByPath(relativePath) {
+        // eslint-disable-next-line @typescript-eslint/no-this-alias, consistent-this
+        let node = this;
+        for (const offset of relativePath){
+            node = node.getChildAtOffset(offset);
+        }
+        return node;
+    }
+    /**
+	 * Returns the parent element of the given name. Returns null if the element is not inside the desired parent.
+	 *
+	 * @param parentName The name of the parent element to find.
+	 * @param options Options object.
+	 * @param options.includeSelf When set to `true` this node will be also included while searching.
+	 */ findAncestor(parentName, options = {}) {
+        let parent = options.includeSelf ? this : this.parent;
+        while(parent){
+            if (parent.name === parentName) {
+                return parent;
+            }
+            parent = parent.parent;
+        }
+        return null;
+    }
+    /**
+	 * Converts `Element` instance to plain object and returns it. Takes care of converting all of this element's children.
+	 *
+	 * @returns `Element` instance converted to plain object.
+	 */ toJSON() {
+        const json = super.toJSON();
+        json.name = this.name;
+        if (this._children.length > 0) {
+            json.children = [];
+            for (const node of this._children){
+                json.children.push(node.toJSON());
+            }
+        }
+        return json;
+    }
+    /**
+	 * Creates a copy of this element and returns it. Created element has the same name and attributes as the original element.
+	 * If clone is deep, the original element's children are also cloned. If not, then empty element is returned.
+	 *
+	 * @internal
+	 * @param deep If set to `true` clones element and all its children recursively. When set to `false`,
+	 * element will be cloned without any child.
+	 */ _clone(deep = false) {
+        const children = deep ? cloneNodes(this._children) : undefined;
+        return new Element(this.name, this.getAttributes(), children);
+    }
+    /**
+	 * {@link module:engine/model/element~Element#_insertChild Inserts} one or more nodes at the end of this element.
+	 *
+	 * @see module:engine/model/writer~Writer#append
+	 * @internal
+	 * @param nodes Nodes to be inserted.
+	 */ _appendChild(nodes) {
+        this._insertChild(this.childCount, nodes);
+    }
+    /**
+	 * Inserts one or more nodes at the given index and sets {@link module:engine/model/node~Node#parent parent} of these nodes
+	 * to this element.
+	 *
+	 * @see module:engine/model/writer~Writer#insert
+	 * @internal
+	 * @param index Index at which nodes should be inserted.
+	 * @param items Items to be inserted.
+	 */ _insertChild(index, items) {
+        const nodes = normalize$1(items);
+        for (const node of nodes){
+            // If node that is being added to this element is already inside another element, first remove it from the old parent.
+            if (node.parent !== null) {
+                node._remove();
+            }
+            node.parent = this;
+        }
+        this._children._insertNodes(index, nodes);
+    }
+    /**
+	 * Removes one or more nodes starting at the given index and sets
+	 * {@link module:engine/model/node~Node#parent parent} of these nodes to `null`.
+	 *
+	 * @see module:engine/model/writer~Writer#remove
+	 * @internal
+	 * @param index Index of the first node to remove.
+	 * @param howMany Number of nodes to remove.
+	 * @returns Array containing removed nodes.
+	 */ _removeChildren(index, howMany = 1) {
+        const nodes = this._children._removeNodes(index, howMany);
+        for (const node of nodes){
+            node.parent = null;
+        }
+        return nodes;
+    }
+    /**
+	 * Removes children nodes provided as an array and sets
+	 * the {@link module:engine/model/node~Node#parent parent} of these nodes to `null`.
+	 *
+	 * These nodes do not need to be direct siblings.
+	 *
+	 * This method is faster than removing nodes one by one, as it recalculates offsets only once.
+	 *
+	 * @internal
+	 * @param nodes Array of nodes.
+	 */ _removeChildrenArray(nodes) {
+        this._children._removeNodesArray(nodes);
+        for (const node of nodes){
+            node.parent = null;
+        }
+    }
+    /**
+	 * Creates an `Element` instance from given plain object (i.e. parsed JSON string).
+	 * Converts `Element` children to proper nodes.
+	 *
+	 * @param json Plain object to be converted to `Element`.
+	 * @returns `Element` instance created using given plain object.
+	 */ static fromJSON(json) {
+        let children;
+        if (json.children) {
+            children = [];
+            for (const child of json.children){
+                if (child.name) {
+                    // If child has name property, it is an Element.
+                    children.push(Element.fromJSON(child));
+                } else {
+                    // Otherwise, it is a Text node.
+                    children.push(Text.fromJSON(child));
+                }
+            }
+        }
+        return new Element(json.name, json.attributes, children);
+    }
+}
+// The magic of type inference using `is` method is centralized in `TypeCheckable` class.
+// Proper overload would interfere with that.
+Element.prototype.is = function(type, name) {
+    if (!name) {
+        return type === 'element' || type === 'model:element' || // From super.is(). This is highly utilised method and cannot call super. See ckeditor/ckeditor5#6529.
+        type === 'node' || type === 'model:node';
+    }
+    return name === this.name && (type === 'element' || type === 'model:element');
+};
+/**
+ * Converts strings to Text and non-iterables to arrays.
+ */ function normalize$1(nodes) {
+    // Separate condition because string is iterable.
+    if (typeof nodes == 'string') {
+        return [
+            new Text(nodes)
+        ];
+    }
+    if (!isIterable(nodes)) {
+        nodes = [
+            nodes
+        ];
+    }
+    const normalizedNodes = [];
+    for (const node of nodes){
+        if (typeof node == 'string') {
+            normalizedNodes.push(new Text(node));
+        } else if (node instanceof TextProxy) {
+            normalizedNodes.push(new Text(node.data, node.getAttributes()));
+        } else {
+            normalizedNodes.push(node);
+        }
+    }
+    return normalizedNodes;
+}
+function cloneNodes(nodes) {
+    const clonedNodes = [];
+    for (const node of nodes){
+        clonedNodes.push(node._clone(true));
+    }
+    return clonedNodes;
+}
+
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/conversion/conversionhelpers
  */ /**
@@ -19989,7 +20065,7 @@ function getFromAttributeCreator(config) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/model/utils/autoparagraphing
  */ /**
@@ -23608,9 +23684,9 @@ function removeDisallowedAttributeFromNode(schema, node, writer) {
             // Remove all empty elements that were created while splitting.
             this._removeEmptyElements();
             // Move all items that were converted in context tree to the document fragment.
-            for (const item of Array.from(this._modelCursor.parent.getChildren())){
-                writer.append(item, documentFragment);
-            }
+            const parent = this._modelCursor.parent;
+            const children = parent._removeChildren(0, parent.childCount);
+            documentFragment._insertChild(0, children);
             // Extract temporary markers elements from model and set as static markers collection.
             documentFragment.markers = extractMarkersFromModelFragment(documentFragment, writer);
         }
@@ -23809,15 +23885,21 @@ function removeDisallowedAttributeFromNode(schema, node, writer) {
 	 * This method works recursively to re-check empty elements again after at least one element was removed in the initial call,
 	 * as some elements might have become empty after other empty elements were removed from them.
 	 */ _removeEmptyElements() {
-        let anyRemoved = false;
+        // For every parent, prepare an array of children (empty elements) to remove from it.
+        // Then, in next step, we will remove all children together, which is faster than removing them one by one.
+        const toRemove = new Map();
         for (const element of this._splitParts.keys()){
             if (element.isEmpty && !this._emptyElementsToKeep.has(element)) {
-                this.conversionApi.writer.remove(element);
+                const children = toRemove.get(element.parent) || [];
+                children.push(element);
                 this._splitParts.delete(element);
-                anyRemoved = true;
+                toRemove.set(element.parent, children);
             }
         }
-        if (anyRemoved) {
+        for (const [parent, children] of toRemove){
+            parent._removeChildrenArray(children);
+        }
+        if (toRemove.size) {
             this._removeEmptyElements();
         }
     }
@@ -25187,7 +25269,7 @@ function* _getUpcastDefinition(model, view, upcastAlso) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /* eslint-disable @typescript-eslint/no-unused-vars */ /**
  * @module engine/model/operation/operation
  */ /**
@@ -31625,6 +31707,22 @@ Marker.prototype.is = function(type) {
         }
         return nodes;
     }
+    /**
+	 * Removes children nodes provided as an array and sets
+	 * the {@link module:engine/model/node~Node#parent parent} of these nodes to `null`.
+	 *
+	 * These nodes do not need to be direct siblings.
+	 *
+	 * This method is faster than removing nodes one by one, as it recalculates offsets only once.
+	 *
+	 * @internal
+	 * @param nodes Array of nodes.
+	 */ _removeChildrenArray(nodes) {
+        this._children._removeNodesArray(nodes);
+        for (const node of nodes){
+            node.parent = null;
+        }
+    }
 }
 // The magic of type inference using `is` method is centralized in `TypeCheckable` class.
 // Proper overload would interfere with that.
@@ -31815,7 +31913,8 @@ DocumentFragment.prototype.is = function(type) {
             }
         }
         const version = position.root.document ? position.root.document.version : null;
-        const insert = new InsertOperation(position, item, version);
+        const children = item instanceof DocumentFragment ? item._removeChildren(0, item.childCount) : item;
+        const insert = new InsertOperation(position, children, version);
         if (item instanceof Text) {
             insert.shouldReceiveAttributes = true;
         }
@@ -33348,7 +33447,7 @@ function replaceEntireContentWithParagraph(writer, selection) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/model/utils/getselectedcontent
  */ /**
@@ -35592,7 +35691,7 @@ function getSearchRange(start, isForward) {
 
 /**
  * @license Copyright (c) 2003-2024, CKSource Holding sp. z o.o. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
+ * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-licensing-options
  */ /**
  * @module engine/view/styles/utils
  */ const HEX_COLOR_REGEXP = /^#([0-9a-f]{3,4}|[0-9a-f]{6}|[0-9a-f]{8})$/i;