{"version":3,"sources":["webpack:///./node_modules/@ckeditor/ckeditor5-engine/src/model/treewalker.js"],"names":["TreeWalker","options","arguments","length","undefined","Object","D_Projects_UA_repo_Source_Client_UA_User_Web_node_modules_babel_runtime_helpers_esm_classCallCheck_js__WEBPACK_IMPORTED_MODULE_2__","this","boundaries","startPosition","CKEditorError","direction","position","clone","Position","_createAt","stickiness","singleCharacters","shallow","ignoreElementEnd","_boundaryStartParent","start","parent","_boundaryEndParent","end","_visitedParent","skip","done","value","prevPosition","prevVisitedParent","_this$next","next","_next","_previous","previousPosition","offset","maxOffset","positionParent","textNodeAtPosition","getTextNodeAtPosition","node","getNodeAfterPosition","Element","path","push","formatReturnValue","Text","charactersCount","endOffset","offsetInTextNode","startOffset","item","TextProxy","pop","getNodeBeforePosition","Symbol","iterator","type","nextPosition"],"mappings":"8PAuBqBA,cAmBpB,SAAAA,IAA4B,IAAfC,EAAeC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,MAC3B,GAD2BG,OAAAC,EAAA,KAAAD,CAAAE,KAAAP,IACrBC,EAAQO,aAAeP,EAAQQ,cAMpC,MAAM,IAAIC,OACT,sCACA,MAIF,IAAMC,EAAYV,EAAQU,WAAa,UAEvC,GAAkB,WAAbA,GAAuC,YAAbA,EAM9B,MAAM,IAAID,OAAe,sCAAuCT,GAAWU,cAS5EJ,KAAKI,UAAYA,EAajBJ,KAAKC,WAAaP,EAAQO,YAAc,KAWnCP,EAAQQ,cACZF,KAAKK,SAAWX,EAAQQ,cAAcI,QAEtCN,KAAKK,SAAWE,OAASC,UAAWR,KAAKC,WAA8B,YAAlBD,KAAKI,UAA0B,MAAQ,UAI7FJ,KAAKK,SAASI,WAAa,SAS3BT,KAAKU,mBAAqBhB,EAAQgB,iBASlCV,KAAKW,UAAYjB,EAAQiB,QAWzBX,KAAKY,mBAAqBlB,EAAQkB,iBAQlCZ,KAAKa,qBAAuBb,KAAKC,WAAaD,KAAKC,WAAWa,MAAMC,OAAS,KAQ7Ef,KAAKgB,mBAAqBhB,KAAKC,WAAaD,KAAKC,WAAWgB,IAAIF,OAAS,KASzEf,KAAKkB,eAAiBlB,KAAKK,SAASU,6CAQrC,WACC,OAAOf,yBAeR,SAAMmB,GACL,IAAIC,EAAMC,EAAOC,EAAcC,EAE/B,EAAG,CACFD,EAAetB,KAAKK,SACpBkB,EAAoBvB,KAAKkB,eAFvB,IAAAM,EAIkBxB,KAAKyB,OAArBL,EAJFI,EAIEJ,KAAMC,EAJRG,EAIQH,aACAD,GAAQD,EAAME,IAEnBD,IACLpB,KAAKK,SAAWiB,EAChBtB,KAAKkB,eAAiBK,uBASxB,WACC,MAAuB,WAAlBvB,KAAKI,UACFJ,KAAK0B,QAEL1B,KAAK2B,iCAYd,WACC,IAAMC,EAAmB5B,KAAKK,SACxBA,EAAWL,KAAKK,SAASC,QACzBS,EAASf,KAAKkB,eAGpB,GAAuB,OAAlBH,EAAOA,QAAmBV,EAASwB,SAAWd,EAAOe,UACzD,OAASV,MAAM,GAIhB,GAAKL,IAAWf,KAAKgB,oBAAsBX,EAASwB,QAAU7B,KAAKC,WAAWgB,IAAIY,OACjF,OAAST,MAAM,GAKhB,IAAMW,EAAiB1B,EAASU,OAC1BiB,EAAqBC,eAAuB5B,EAAU0B,GACtDG,EAAOF,GAA0CG,eAAsB9B,EAAU0B,EAAgBC,GAEvG,GAAKE,aAAgBE,OAWpB,OAVMpC,KAAKW,QAKVN,EAASwB,UAHTxB,EAASgC,KAAKC,KAAM,GACpBtC,KAAKkB,eAAiBgB,GAKvBlC,KAAKK,SAAWA,EAETkC,EAAmB,eAAgBL,EAAMN,EAAkBvB,EAAU,GACtE,GAAK6B,aAAgBM,OAAO,CAClC,IAAIC,EAEJ,GAAKzC,KAAKU,iBACT+B,EAAkB,MACZ,CACN,IAAIZ,EAASK,EAAKQ,UAEb1C,KAAKgB,oBAAsBD,GAAUf,KAAKC,WAAWgB,IAAIY,OAASA,IACtEA,EAAS7B,KAAKC,WAAWgB,IAAIY,QAG9BY,EAAkBZ,EAASxB,EAASwB,OAGrC,IAAMc,EAAmBtC,EAASwB,OAASK,EAAKU,YAC1CC,EAAO,IAAIC,OAAWZ,EAAMS,EAAkBF,GAKpD,OAHApC,EAASwB,QAAUY,EACnBzC,KAAKK,SAAWA,EAETkC,EAAmB,OAAQM,EAAMjB,EAAkBvB,EAAUoC,GAQpE,OALApC,EAASgC,KAAKU,MACd1C,EAASwB,SACT7B,KAAKK,SAAWA,EAChBL,KAAKkB,eAAiBH,EAAOA,OAExBf,KAAKY,iBACFZ,KAAK0B,QAELa,EAAmB,aAAcxB,EAAQa,EAAkBvB,4BAarE,WACC,IAAMuB,EAAmB5B,KAAKK,SACxBA,EAAWL,KAAKK,SAASC,QACzBS,EAASf,KAAKkB,eAGpB,GAAuB,OAAlBH,EAAOA,QAAuC,IAApBV,EAASwB,OACvC,OAAST,MAAM,GAIhB,GAAKL,GAAUf,KAAKa,sBAAwBR,EAASwB,QAAU7B,KAAKC,WAAWa,MAAMe,OACpF,OAAST,MAAM,GAKhB,IAAMW,EAAiB1B,EAASU,OAC1BiB,EAAqBC,eAAuB5B,EAAU0B,GACtDG,EAAOF,GAA0CgB,eAAuB3C,EAAU0B,EAAgBC,GAExG,GAAKE,aAAgBE,OAGpB,OAFA/B,EAASwB,SAEH7B,KAAKW,SAWVX,KAAKK,SAAWA,EAETkC,EAAmB,eAAgBL,EAAMN,EAAkBvB,EAAU,KAZ5EA,EAASgC,KAAKC,KAAMJ,EAAKJ,WACzB9B,KAAKK,SAAWA,EAChBL,KAAKkB,eAAiBgB,EAEjBlC,KAAKY,iBACFZ,KAAK2B,YAELY,EAAmB,aAAcL,EAAMN,EAAkBvB,IAO5D,GAAK6B,aAAgBM,OAAO,CAClC,IAAIC,EAEJ,GAAKzC,KAAKU,iBACT+B,EAAkB,MACZ,CACN,IAAIZ,EAASK,EAAKU,YAEb5C,KAAKa,sBAAwBE,GAAUf,KAAKC,WAAWa,MAAMe,OAASA,IAC1EA,EAAS7B,KAAKC,WAAWa,MAAMe,QAGhCY,EAAkBpC,EAASwB,OAASA,EAGrC,IAAMc,EAAmBtC,EAASwB,OAASK,EAAKU,YAC1CC,EAAO,IAAIC,OAAWZ,EAAMS,EAAmBF,EAAiBA,GAKtE,OAHApC,EAASwB,QAAUY,EACnBzC,KAAKK,SAAWA,EAETkC,EAAmB,OAAQM,EAAMjB,EAAkBvB,EAAUoC,GAOpE,OAJApC,EAASgC,KAAKU,MACd/C,KAAKK,SAAWA,EAChBL,KAAKkB,eAAiBH,EAAOA,OAEtBwB,EAAmB,eAAgBxB,EAAQa,EAAkBvB,EAAU,UAtM9E4C,OAAOC,UA2MV,SAASX,EAAmBY,EAAMN,EAAMjB,EAAkBwB,EAAcxD,GACvE,OACCwB,MAAM,EACNC,OACC8B,OACAN,OACAjB,mBACAwB,eACAxD","file":"js/chunk-2d0ddd95.d2b386ec.js","sourcesContent":["/**\n * @license Copyright (c) 2003-2021, CKSource - Frederico Knabben. All rights reserved.\n * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license\n */\n\n/**\n * @module engine/model/treewalker\n */\n\nimport Text from './text';\nimport TextProxy from './textproxy';\nimport Element from './element';\nimport {\n\tdefault as Position,\n\tgetTextNodeAtPosition,\n\tgetNodeAfterPosition,\n\tgetNodeBeforePosition\n} from './position';\nimport CKEditorError from '@ckeditor/ckeditor5-utils/src/ckeditorerror';\n\n/**\n * Position iterator class. It allows to iterate forward and backward over the document.\n */\nexport default class TreeWalker {\n\t/**\n\t * Creates a range iterator. All parameters are optional, but you have to specify either `boundaries` or `startPosition`.\n\t *\n\t * @constructor\n\t * @param {Object} [options={}] Object with configuration.\n\t * @param {'forward'|'backward'} [options.direction='forward'] Walking direction.\n\t * @param {module:engine/model/range~Range} [options.boundaries=null] Range to define boundaries of the iterator.\n\t * @param {module:engine/model/position~Position} [options.startPosition] Starting position.\n\t * @param {Boolean} [options.singleCharacters=false] Flag indicating whether all consecutive characters with the same attributes\n\t * should be returned one by one as multiple {@link module:engine/model/textproxy~TextProxy} (`true`) objects or as one\n\t * {@link module:engine/model/textproxy~TextProxy} (`false`).\n\t * @param {Boolean} [options.shallow=false] Flag indicating whether iterator should enter elements or not. If the\n\t * iterator is shallow child nodes of any iterated node will not be returned along with `elementEnd` tag.\n\t * @param {Boolean} [options.ignoreElementEnd=false] Flag indicating whether iterator should ignore `elementEnd`\n\t * tags. If the option is true walker will not return a parent node of start position. If this option is `true`\n\t * each {@link module:engine/model/element~Element} will be returned once, while if the option is `false` they might be returned\n\t * twice: for `'elementStart'` and `'elementEnd'`.\n\t */\n\tconstructor( options = {} ) {\n\t\tif ( !options.boundaries && !options.startPosition ) {\n\t\t\t/**\n\t\t\t * Neither boundaries nor starting position of a `TreeWalker` have been defined.\n\t\t\t *\n\t\t\t * @error model-tree-walker-no-start-position\n\t\t\t */\n\t\t\tthrow new CKEditorError(\n\t\t\t\t'model-tree-walker-no-start-position',\n\t\t\t\tnull\n\t\t\t);\n\t\t}\n\n\t\tconst direction = options.direction || 'forward';\n\n\t\tif ( direction != 'forward' && direction != 'backward' ) {\n\t\t\t/**\n\t\t\t * Only `backward` and `forward` direction allowed.\n\t\t\t *\n\t\t\t * @error model-tree-walker-unknown-direction\n\t\t\t */\n\t\t\tthrow new CKEditorError( 'model-tree-walker-unknown-direction', options, { direction } );\n\t\t}\n\n\t\t/**\n\t\t * Walking direction. Defaults `'forward'`.\n\t\t *\n\t\t * @readonly\n\t\t * @member {'backward'|'forward'} module:engine/model/treewalker~TreeWalker#direction\n\t\t */\n\t\tthis.direction = direction;\n\n\t\t/**\n\t\t * Iterator boundaries.\n\t\t *\n\t\t * When the iterator is walking `'forward'` on the end of boundary or is walking `'backward'`\n\t\t * on the start of boundary, then `{ done: true }` is returned.\n\t\t *\n\t\t * If boundaries are not defined they are set before first and after last child of the root node.\n\t\t *\n\t\t * @readonly\n\t\t * @member {module:engine/model/range~Range} module:engine/model/treewalker~TreeWalker#boundaries\n\t\t */\n\t\tthis.boundaries = options.boundaries || null;\n\n\t\t/**\n\t\t * Iterator position. This is always static position, even if the initial position was a\n\t\t * {@link module:engine/model/liveposition~LivePosition live position}. If start position is not defined then position depends\n\t\t * on {@link #direction}. If direction is `'forward'` position starts form the beginning, when direction\n\t\t * is `'backward'` position starts from the end.\n\t\t *\n\t\t * @readonly\n\t\t * @member {module:engine/model/position~Position} module:engine/model/treewalker~TreeWalker#position\n\t\t */\n\t\tif ( options.startPosition ) {\n\t\t\tthis.position = options.startPosition.clone();\n\t\t} else {\n\t\t\tthis.position = Position._createAt( this.boundaries[ this.direction == 'backward' ? 'end' : 'start' ] );\n\t\t}\n\n\t\t// Reset position stickiness in case it was set to other value, as the stickiness is kept after cloning.\n\t\tthis.position.stickiness = 'toNone';\n\n\t\t/**\n\t\t * Flag indicating whether all consecutive characters with the same attributes should be\n\t\t * returned as one {@link module:engine/model/textproxy~TextProxy} (`true`) or one by one (`false`).\n\t\t *\n\t\t * @readonly\n\t\t * @member {Boolean} module:engine/model/treewalker~TreeWalker#singleCharacters\n\t\t */\n\t\tthis.singleCharacters = !!options.singleCharacters;\n\n\t\t/**\n\t\t * Flag indicating whether iterator should enter elements or not. If the iterator is shallow child nodes of any\n\t\t * iterated node will not be returned along with `elementEnd` tag.\n\t\t *\n\t\t * @readonly\n\t\t * @member {Boolean} module:engine/model/treewalker~TreeWalker#shallow\n\t\t */\n\t\tthis.shallow = !!options.shallow;\n\n\t\t/**\n\t\t * Flag indicating whether iterator should ignore `elementEnd` tags. If the option is true walker will not\n\t\t * return a parent node of the start position. If this option is `true` each {@link module:engine/model/element~Element} will\n\t\t * be returned once, while if the option is `false` they might be returned twice:\n\t\t * for `'elementStart'` and `'elementEnd'`.\n\t\t *\n\t\t * @readonly\n\t\t * @member {Boolean} module:engine/model/treewalker~TreeWalker#ignoreElementEnd\n\t\t */\n\t\tthis.ignoreElementEnd = !!options.ignoreElementEnd;\n\n\t\t/**\n\t\t * Start boundary cached for optimization purposes.\n\t\t *\n\t\t * @private\n\t\t * @member {module:engine/model/element~Element} module:engine/model/treewalker~TreeWalker#_boundaryStartParent\n\t\t */\n\t\tthis._boundaryStartParent = this.boundaries ? this.boundaries.start.parent : null;\n\n\t\t/**\n\t\t * End boundary cached for optimization purposes.\n\t\t *\n\t\t * @private\n\t\t * @member {module:engine/model/element~Element} module:engine/model/treewalker~TreeWalker#_boundaryEndParent\n\t\t */\n\t\tthis._boundaryEndParent = this.boundaries ? this.boundaries.end.parent : null;\n\n\t\t/**\n\t\t * Parent of the most recently visited node. Cached for optimization purposes.\n\t\t *\n\t\t * @private\n\t\t * @member {module:engine/model/element~Element|module:engine/model/documentfragment~DocumentFragment}\n\t\t * module:engine/model/treewalker~TreeWalker#_visitedParent\n\t\t */\n\t\tthis._visitedParent = this.position.parent;\n\t}\n\n\t/**\n\t * Iterable interface.\n\t *\n\t * @returns {Iterable.<module:engine/model/treewalker~TreeWalkerValue>}\n\t */\n\t[ Symbol.iterator ]() {\n\t\treturn this;\n\t}\n\n\t/**\n\t * Moves {@link #position} in the {@link #direction} skipping values as long as the callback function returns `true`.\n\t *\n\t * For example:\n\t *\n\t * \t\twalker.skip( value => value.type == 'text' ); // <paragraph>[]foo</paragraph> -> <paragraph>foo[]</paragraph>\n\t * \t\twalker.skip( () => true ); // Move the position to the end: <paragraph>[]foo</paragraph> -> <paragraph>foo</paragraph>[]\n\t * \t\twalker.skip( () => false ); // Do not move the position.\n\t *\n\t * @param {Function} skip Callback function. Gets {@link module:engine/model/treewalker~TreeWalkerValue} and should\n\t * return `true` if the value should be skipped or `false` if not.\n\t */\n\tskip( skip ) {\n\t\tlet done, value, prevPosition, prevVisitedParent;\n\n\t\tdo {\n\t\t\tprevPosition = this.position;\n\t\t\tprevVisitedParent = this._visitedParent;\n\n\t\t\t( { done, value } = this.next() );\n\t\t} while ( !done && skip( value ) );\n\n\t\tif ( !done ) {\n\t\t\tthis.position = prevPosition;\n\t\t\tthis._visitedParent = prevVisitedParent;\n\t\t}\n\t}\n\n\t/**\n\t * Gets the next tree walker's value.\n\t *\n\t * @returns {module:engine/model/treewalker~TreeWalkerValue} Next tree walker's value.\n\t */\n\tnext() {\n\t\tif ( this.direction == 'forward' ) {\n\t\t\treturn this._next();\n\t\t} else {\n\t\t\treturn this._previous();\n\t\t}\n\t}\n\n\t/**\n\t * Makes a step forward in model. Moves the {@link #position} to the next position and returns the encountered value.\n\t *\n\t * @private\n\t * @returns {Object}\n\t * @returns {Boolean} return.done True if iterator is done.\n\t * @returns {module:engine/model/treewalker~TreeWalkerValue} return.value Information about taken step.\n\t */\n\t_next() {\n\t\tconst previousPosition = this.position;\n\t\tconst position = this.position.clone();\n\t\tconst parent = this._visitedParent;\n\n\t\t// We are at the end of the root.\n\t\tif ( parent.parent === null && position.offset === parent.maxOffset ) {\n\t\t\treturn { done: true };\n\t\t}\n\n\t\t// We reached the walker boundary.\n\t\tif ( parent === this._boundaryEndParent && position.offset == this.boundaries.end.offset ) {\n\t\t\treturn { done: true };\n\t\t}\n\n\t\t// Get node just after the current position.\n\t\t// Use a highly optimized version instead of checking the text node first and then getting the node after. See #6582.\n\t\tconst positionParent = position.parent;\n\t\tconst textNodeAtPosition = getTextNodeAtPosition( position, positionParent );\n\t\tconst node = textNodeAtPosition ? textNodeAtPosition : getNodeAfterPosition( position, positionParent, textNodeAtPosition );\n\n\t\tif ( node instanceof Element ) {\n\t\t\tif ( !this.shallow ) {\n\t\t\t\t// Manual operations on path internals for optimization purposes. Here and in the rest of the method.\n\t\t\t\tposition.path.push( 0 );\n\t\t\t\tthis._visitedParent = node;\n\t\t\t} else {\n\t\t\t\tposition.offset++;\n\t\t\t}\n\n\t\t\tthis.position = position;\n\n\t\t\treturn formatReturnValue( 'elementStart', node, previousPosition, position, 1 );\n\t\t} else if ( node instanceof Text ) {\n\t\t\tlet charactersCount;\n\n\t\t\tif ( this.singleCharacters ) {\n\t\t\t\tcharactersCount = 1;\n\t\t\t} else {\n\t\t\t\tlet offset = node.endOffset;\n\n\t\t\t\tif ( this._boundaryEndParent == parent && this.boundaries.end.offset < offset ) {\n\t\t\t\t\toffset = this.boundaries.end.offset;\n\t\t\t\t}\n\n\t\t\t\tcharactersCount = offset - position.offset;\n\t\t\t}\n\n\t\t\tconst offsetInTextNode = position.offset - node.startOffset;\n\t\t\tconst item = new TextProxy( node, offsetInTextNode, charactersCount );\n\n\t\t\tposition.offset += charactersCount;\n\t\t\tthis.position = position;\n\n\t\t\treturn formatReturnValue( 'text', item, previousPosition, position, charactersCount );\n\t\t} else {\n\t\t\t// `node` is not set, we reached the end of current `parent`.\n\t\t\tposition.path.pop();\n\t\t\tposition.offset++;\n\t\t\tthis.position = position;\n\t\t\tthis._visitedParent = parent.parent;\n\n\t\t\tif ( this.ignoreElementEnd ) {\n\t\t\t\treturn this._next();\n\t\t\t} else {\n\t\t\t\treturn formatReturnValue( 'elementEnd', parent, previousPosition, position );\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Makes a step backward in model. Moves the {@link #position} to the previous position and returns the encountered value.\n\t *\n\t * @private\n\t * @returns {Object}\n\t * @returns {Boolean} return.done True if iterator is done.\n\t * @returns {module:engine/model/treewalker~TreeWalkerValue} return.value Information about taken step.\n\t */\n\t_previous() {\n\t\tconst previousPosition = this.position;\n\t\tconst position = this.position.clone();\n\t\tconst parent = this._visitedParent;\n\n\t\t// We are at the beginning of the root.\n\t\tif ( parent.parent === null && position.offset === 0 ) {\n\t\t\treturn { done: true };\n\t\t}\n\n\t\t// We reached the walker boundary.\n\t\tif ( parent == this._boundaryStartParent && position.offset == this.boundaries.start.offset ) {\n\t\t\treturn { done: true };\n\t\t}\n\n\t\t// Get node just before the current position.\n\t\t// Use a highly optimized version instead of checking the text node first and then getting the node before. See #6582.\n\t\tconst positionParent = position.parent;\n\t\tconst textNodeAtPosition = getTextNodeAtPosition( position, positionParent );\n\t\tconst node = textNodeAtPosition ? textNodeAtPosition : getNodeBeforePosition( position, positionParent, textNodeAtPosition );\n\n\t\tif ( node instanceof Element ) {\n\t\t\tposition.offset--;\n\n\t\t\tif ( !this.shallow ) {\n\t\t\t\tposition.path.push( node.maxOffset );\n\t\t\t\tthis.position = position;\n\t\t\t\tthis._visitedParent = node;\n\n\t\t\t\tif ( this.ignoreElementEnd ) {\n\t\t\t\t\treturn this._previous();\n\t\t\t\t} else {\n\t\t\t\t\treturn formatReturnValue( 'elementEnd', node, previousPosition, position );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthis.position = position;\n\n\t\t\t\treturn formatReturnValue( 'elementStart', node, previousPosition, position, 1 );\n\t\t\t}\n\t\t} else if ( node instanceof Text ) {\n\t\t\tlet charactersCount;\n\n\t\t\tif ( this.singleCharacters ) {\n\t\t\t\tcharactersCount = 1;\n\t\t\t} else {\n\t\t\t\tlet offset = node.startOffset;\n\n\t\t\t\tif ( this._boundaryStartParent == parent && this.boundaries.start.offset > offset ) {\n\t\t\t\t\toffset = this.boundaries.start.offset;\n\t\t\t\t}\n\n\t\t\t\tcharactersCount = position.offset - offset;\n\t\t\t}\n\n\t\t\tconst offsetInTextNode = position.offset - node.startOffset;\n\t\t\tconst item = new TextProxy( node, offsetInTextNode - charactersCount, charactersCount );\n\n\t\t\tposition.offset -= charactersCount;\n\t\t\tthis.position = position;\n\n\t\t\treturn formatReturnValue( 'text', item, previousPosition, position, charactersCount );\n\t\t} else {\n\t\t\t// `node` is not set, we reached the beginning of current `parent`.\n\t\t\tposition.path.pop();\n\t\t\tthis.position = position;\n\t\t\tthis._visitedParent = parent.parent;\n\n\t\t\treturn formatReturnValue( 'elementStart', parent, previousPosition, position, 1 );\n\t\t}\n\t}\n}\n\nfunction formatReturnValue( type, item, previousPosition, nextPosition, length ) {\n\treturn {\n\t\tdone: false,\n\t\tvalue: {\n\t\t\ttype,\n\t\t\titem,\n\t\t\tpreviousPosition,\n\t\t\tnextPosition,\n\t\t\tlength\n\t\t}\n\t};\n}\n\n/**\n * Type of the step made by {@link module:engine/model/treewalker~TreeWalker}.\n * Possible values: `'elementStart'` if walker is at the beginning of a node, `'elementEnd'` if walker is at the end of node,\n * or `'text'` if walker traversed over text.\n *\n * @typedef {'elementStart'|'elementEnd'|'text'} module:engine/model/treewalker~TreeWalkerValueType\n */\n\n/**\n * Object returned by {@link module:engine/model/treewalker~TreeWalker} when traversing tree model.\n *\n * @typedef {Object} module:engine/model/treewalker~TreeWalkerValue\n * @property {module:engine/model/treewalker~TreeWalkerValueType} type\n * @property {module:engine/model/item~Item} item Item between old and new positions of {@link module:engine/model/treewalker~TreeWalker}.\n * @property {module:engine/model/position~Position} previousPosition Previous position of the iterator.\n * * Forward iteration: For `'elementEnd'` it is the last position inside the element. For all other types it is the\n * position before the item.\n * * Backward iteration: For `'elementStart'` it is the first position inside the element. For all other types it is\n * the position after item.\n * @property {module:engine/model/position~Position} nextPosition Next position of the iterator.\n * * Forward iteration: For `'elementStart'` it is the first position inside the element. For all other types it is\n * the position after the item.\n * * Backward iteration: For `'elementEnd'` it is last position inside element. For all other types it is the position\n * before the item.\n * @property {Number} [length] Length of the item. For `'elementStart'` it is 1. For `'text'` it is\n * the length of the text. For `'elementEnd'` it is `undefined`.\n */\n\n/**\n * Tree walking directions.\n *\n * @typedef {'forward'|'backward'} module:engine/model/treewalker~TreeWalkerDirection\n */\n"],"sourceRoot":""}