| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637 |
- /**
- * @license Copyright (c) 2003-2017, CKSource - Frederico Knabben. All rights reserved.
- * For licensing, see LICENSE.md.
- */
- /**
- * @module engine/model/delta/basic-transformations
- */
- import deltaTransform from './transform';
- const addTransformationCase = deltaTransform.addTransformationCase;
- const defaultTransform = deltaTransform.defaultTransform;
- import Range from '../range';
- import Position from '../position';
- import NoOperation from '../operation/nooperation';
- import AttributeOperation from '../operation/attributeoperation';
- import InsertOperation from '../operation/insertoperation';
- import ReinsertOperation from '../operation/reinsertoperation';
- import Delta from './delta';
- import AttributeDelta from './attributedelta';
- import InsertDelta from './insertdelta';
- import MarkerDelta from './markerdelta';
- import MergeDelta from './mergedelta';
- import MoveDelta from './movedelta';
- import SplitDelta from './splitdelta';
- import WeakInsertDelta from './weakinsertdelta';
- import WrapDelta from './wrapdelta';
- import UnwrapDelta from './unwrapdelta';
- import RenameDelta from './renamedelta';
- import RemoveDelta from './removedelta';
- import compareArrays from '@ckeditor/ckeditor5-utils/src/comparearrays';
- // Provide transformations for default deltas.
- // Add special case for AttributeDelta x WeakInsertDelta transformation.
- addTransformationCase( AttributeDelta, WeakInsertDelta, ( a, b, context ) => {
- // If nodes are weak-inserted into attribute delta range, we need to apply changes from attribute delta on them.
- // So first we do the normal transformation and if this special cases happens, we will add an extra delta.
- const deltas = defaultTransform( a, b, context );
- if ( a.range.containsPosition( b.position ) ) {
- deltas.push( _getComplementaryAttrDelta( b, a ) );
- }
- return deltas;
- } );
- // Add special case for AttributeDelta x SplitDelta transformation.
- addTransformationCase( AttributeDelta, SplitDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !b.position ) {
- return defaultTransform( a, b, context );
- }
- const undoMode = context.undoMode;
- const splitPosition = new Position( b.position.root, b.position.path.slice( 0, -1 ) );
- const deltas = defaultTransform( a, b, context );
- // Special case applies only if undo is not a context and only if `SplitDelta` has `InsertOperation` (not `ReinsertOperation`).
- if ( undoMode || !( b._cloneOperation instanceof InsertOperation ) ) {
- return deltas;
- }
- for ( const operation of a.operations ) {
- // If a node that has been split has it's attribute updated, we should also update attribute of
- // the node created during splitting.
- if ( operation.range.containsPosition( splitPosition ) || operation.range.start.isEqual( splitPosition ) ) {
- const additionalAttributeDelta = new AttributeDelta();
- const rangeStart = splitPosition.getShiftedBy( 1 );
- const rangeEndPath = rangeStart.path.slice();
- rangeEndPath.push( 0 );
- const rangeEnd = new Position( rangeStart.root, rangeEndPath );
- const oldValue = b._cloneOperation.nodes.getNode( 0 ).getAttribute( operation.key );
- additionalAttributeDelta.addOperation( new AttributeOperation(
- new Range( rangeStart, rangeEnd ),
- operation.key,
- oldValue === undefined ? null : oldValue,
- operation.newValue,
- 0
- ) );
- deltas.push( additionalAttributeDelta );
- break;
- }
- }
- return deltas;
- } );
- // Add special case for InsertDelta x MergeDelta transformation.
- addTransformationCase( InsertDelta, MergeDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `MergeDelta` has `NoOperation` as the second operation.
- if ( !b.position ) {
- return defaultTransform( a, b, context );
- }
- const undoMode = context.undoMode;
- // If insert is applied at the same position where merge happened, we reverse the merge (we treat it like it
- // didn't happen) and then apply the original insert operation. This is "mirrored" in MergeDelta x InsertDelta
- // transformation below, where we simply do not apply MergeDelta.
- if ( !undoMode && a.position.isEqual( b.position ) ) {
- return [
- b.getReversed(),
- a.clone()
- ];
- }
- return defaultTransform( a, b, context );
- } );
- function transformMarkerDelta( a, b ) {
- const transformedDelta = a.clone();
- const transformedOp = transformedDelta.operations[ 0 ];
- if ( transformedOp.oldRange ) {
- transformedOp.oldRange = transformedOp.oldRange.getTransformedByDelta( b )[ 0 ];
- }
- if ( transformedOp.newRange ) {
- transformedOp.newRange = transformedOp.newRange.getTransformedByDelta( b )[ 0 ];
- }
- return [ transformedDelta ];
- }
- addTransformationCase( MarkerDelta, SplitDelta, transformMarkerDelta );
- addTransformationCase( MarkerDelta, MergeDelta, transformMarkerDelta );
- addTransformationCase( MarkerDelta, WrapDelta, transformMarkerDelta );
- addTransformationCase( MarkerDelta, UnwrapDelta, transformMarkerDelta );
- addTransformationCase( MarkerDelta, MoveDelta, transformMarkerDelta );
- addTransformationCase( MarkerDelta, RenameDelta, transformMarkerDelta );
- // Add special case for MoveDelta x MergeDelta transformation.
- addTransformationCase( MoveDelta, MergeDelta, ( a, b, context ) => {
- const undoMode = context.undoMode;
- // Do not apply special transformation case in undo mode or if `MergeDelta` has `NoOperation` as the second operation.
- if ( undoMode || !b.position ) {
- return defaultTransform( a, b, context );
- }
- // If move delta is supposed to move a node that has been merged, we reverse the merge (we treat it like it
- // didn't happen) and then apply the original move operation. This is "mirrored" in MergeDelta x MoveDelta
- // transformation below, where we simply do not apply MergeDelta.
- const operateInSameParent =
- a.sourcePosition.root == b.position.root &&
- compareArrays( a.sourcePosition.getParentPath(), b.position.getParentPath() ) === 'same';
- const mergeInsideMoveRange = a.sourcePosition.offset <= b.position.offset && a.sourcePosition.offset + a.howMany > b.position.offset;
- if ( operateInSameParent && mergeInsideMoveRange ) {
- return [
- b.getReversed(),
- a.clone()
- ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for MergeDelta x InsertDelta transformation.
- addTransformationCase( MergeDelta, InsertDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `MergeDelta` has `NoOperation` as the second operation.
- if ( !a.position ) {
- return defaultTransform( a, b, context );
- }
- const undoMode = context.undoMode;
- // If merge is applied at the same position where we inserted a range of nodes we cancel the merge as it's results
- // may be unexpected and very weird. Even if we do some "magic" we don't know what really are users' expectations.
- if ( !undoMode && a.position.isEqual( b.position ) ) {
- return [ noDelta() ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for MergeDelta x MoveDelta transformation.
- addTransformationCase( MergeDelta, MoveDelta, ( a, b, context ) => {
- const undoMode = context.undoMode;
- // Do not apply special transformation case in undo mode or if `MergeDelta` has `NoOperation` as the second operation.
- if ( undoMode || !a.position ) {
- return defaultTransform( a, b, context );
- }
- // If merge is applied at the position between moved nodes we cancel the merge as it's results may be unexpected and
- // very weird. Even if we do some "magic" we don't know what really are users' expectations.
- const operateInSameParent =
- a.position.root == b.sourcePosition.root &&
- compareArrays( a.position.getParentPath(), b.sourcePosition.getParentPath() ) === 'same';
- const mergeInsideMoveRange = b.sourcePosition.offset <= a.position.offset && b.sourcePosition.offset + b.howMany > a.position.offset;
- if ( operateInSameParent && mergeInsideMoveRange ) {
- return [ noDelta() ];
- }
- return defaultTransform( a, b, context );
- } );
- addTransformationCase( SplitDelta, SplitDelta, ( a, b, context ) => {
- const undoMode = context.undoMode;
- // Do not apply special transformation case if transformation is in undo mode.
- if ( undoMode ) {
- return defaultTransform( a, b, context );
- }
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !a.position || !b.position ) {
- return defaultTransform( a, b, context );
- }
- const pathA = a.position.getParentPath();
- const pathB = b.position.getParentPath();
- // The special case is for splits inside the same parent.
- if ( a.position.root == b.position.root && compareArrays( pathA, pathB ) == 'same' ) {
- a = a.clone();
- if ( a.position.offset < b.position.offset || ( a.position.offset == b.position.offset && context.isStrong ) ) {
- // If both first operations are `ReinsertOperation`s, we might need to transform `a._cloneOperation`,
- // so it will take correct node from graveyard.
- if (
- a._cloneOperation instanceof ReinsertOperation && b._cloneOperation instanceof ReinsertOperation &&
- a._cloneOperation.sourcePosition.offset > b._cloneOperation.sourcePosition.offset
- ) {
- a._cloneOperation.sourcePosition = a._cloneOperation.sourcePosition.getShiftedBy( -1 );
- }
- // `a` splits closer or at same offset.
- // Change how many nodes are moved. Do not move nodes that were moved by delta `b`.
- const aRange = Range.createFromPositionAndShift( a.position, a._moveOperation.howMany );
- const bRange = Range.createFromPositionAndShift( b.position, b._moveOperation.howMany );
- const diff = aRange.getDifference( bRange );
- let newHowMany = 0;
- for ( const range of diff ) {
- newHowMany += range.end.offset - range.start.offset;
- }
- if ( newHowMany === 0 ) {
- a.operations.pop(); // Remove last operation (`MoveOperation`).
- a.addOperation( new NoOperation( a.operations[ 0 ].baseVersion + 1 ) ); // Add `NoOperation` instead.
- } else {
- a.operations[ 1 ].howMany = newHowMany;
- }
- return [ a ];
- } else {
- // `a` splits further.
- // This is more complicated case, thankfully we can solve it using default transformation and setting proper context.
- const newContext = Object.assign( {}, context );
- newContext.isStrong = true;
- newContext.insertBefore = true;
- return defaultTransform( a, b, newContext );
- }
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for SplitDelta x UnwrapDelta transformation.
- addTransformationCase( SplitDelta, UnwrapDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !a.position ) {
- return defaultTransform( a, b, context );
- }
- // If incoming split delta tries to split a node that just got unwrapped, there is actually nothing to split,
- // so we discard that delta.
- if ( a.position.root == b.position.root && compareArrays( b.position.path, a.position.getParentPath() ) === 'same' ) {
- return [ noDelta() ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for SplitDelta x WrapDelta transformation.
- addTransformationCase( SplitDelta, WrapDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !a.position ) {
- return defaultTransform( a, b, context );
- }
- // If split is applied at the position between wrapped nodes, we cancel the split as it's results may be unexpected and
- // very weird. Even if we do some "magic" we don't know what really are users' expectations.
- const sameRoot = a.position.root == b.range.start.root;
- const operateInSameParent = sameRoot && compareArrays( a.position.getParentPath(), b.range.start.getParentPath() ) === 'same';
- const splitInsideWrapRange = b.range.start.offset < a.position.offset && b.range.end.offset >= a.position.offset;
- if ( operateInSameParent && splitInsideWrapRange ) {
- return [ noDelta() ];
- } else if ( sameRoot && compareArrays( a.position.getParentPath(), b.range.end.getShiftedBy( -1 ).path ) === 'same' ) {
- // Split position is directly inside the last node from wrap range.
- // If that's the case, we manually change split delta so it will "target" inside the wrapping element.
- // By doing so we will be inserting split node right to the original node which feels natural and is a good UX.
- const delta = a.clone();
- // 1. Fix insert operation position.
- // Node to split is the last children of the wrapping element.
- // Wrapping element is the element inserted by WrapDelta (re)insert operation.
- // It is inserted after the wrapped range, but the wrapped range will be moved inside it.
- // Having this in mind, it is correct to use wrapped range start position as the position before wrapping element.
- // Now, `splitNodePos` points before wrapping element.
- // To get a position before last children of that element, we expand position's `path` member by proper offset.
- const splitPath = b.range.start.path.slice();
- splitPath.push( b.howMany - 1 );
- const splitNodePos = new Position( b.range.start.root, splitPath );
- // SplitDelta insert operation position should be right after the node we split.
- delta._cloneOperation.position = splitNodePos.getShiftedBy( 1 );
- // 2. Fix move operation source position.
- // Nodes moved by SplitDelta will be moved from new position, modified by WrapDelta.
- // To obtain that new position, `splitNodePos` will be used, as this is the node we are extracting children from.
- // Nothing changed inside split node so it is correct to use the original split position offset.
- const sourcePath = splitNodePos.path.slice();
- sourcePath.push( a.position.offset );
- delta._moveOperation.sourcePosition = new Position( splitNodePos.root, sourcePath );
- // 3. Fix move operation target position.
- // SplitDelta move operation target position should be inside the node inserted by operation above.
- // Since the node is empty, we will insert at offset 0.
- const targetPath = splitNodePos.getShiftedBy( 1 ).path.slice();
- targetPath.push( 0 );
- delta._moveOperation.targetPosition = new Position( splitNodePos.root, targetPath );
- return [ delta ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for SplitDelta x WrapDelta transformation.
- addTransformationCase( SplitDelta, AttributeDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !a.position ) {
- return defaultTransform( a, b, context );
- }
- a = a.clone();
- const undoMode = context.undoMode;
- const splitPosition = new Position( a.position.root, a.position.path.slice( 0, -1 ) );
- // Special case applies only if undo is not a context and only if `SplitDelta` has `InsertOperation` (not `ReinsertOperation`).
- if ( undoMode || !( a._cloneOperation instanceof InsertOperation ) ) {
- return [ a ];
- }
- // If element to split had it's attribute changed, we have to reflect this change in an element
- // that is in SplitDelta's InsertOperation.
- for ( const operation of b.operations ) {
- if ( operation.range.containsPosition( splitPosition ) || operation.range.start.isEqual( splitPosition ) ) {
- if ( operation.newValue !== null ) {
- a._cloneOperation.nodes.getNode( 0 ).setAttribute( operation.key, operation.newValue );
- } else {
- a._cloneOperation.nodes.getNode( 0 ).removeAttribute( operation.key );
- }
- break;
- }
- }
- return [ a ];
- } );
- // Add special case for UnwrapDelta x SplitDelta transformation.
- addTransformationCase( UnwrapDelta, SplitDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !b.position ) {
- return defaultTransform( a, b, context );
- }
- // If incoming unwrap delta tries to unwrap node that got split we should unwrap the original node and the split copy.
- // This can be achieved either by reverting split and applying unwrap to singular node, or creating additional unwrap delta.
- if ( a.position.root == b.position.root && compareArrays( a.position.path, b.position.getParentPath() ) === 'same' ) {
- return [
- b.getReversed(),
- a.clone()
- ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for WeakInsertDelta x AttributeDelta transformation.
- addTransformationCase( WeakInsertDelta, AttributeDelta, ( a, b ) => {
- // If nodes are weak-inserted into attribute delta range, we need to apply changes from attribute delta on them.
- const deltas = [ a.clone() ];
- if ( b.range.containsPosition( a.position ) ) {
- deltas.push( _getComplementaryAttrDelta( a, b ) );
- }
- return deltas;
- } );
- // Add special case for WrapDelta x SplitDelta transformation.
- addTransformationCase( WrapDelta, SplitDelta, ( a, b, context ) => {
- // Do not apply special transformation case if `SplitDelta` has `NoOperation` as the second operation.
- if ( !b.position ) {
- return defaultTransform( a, b, context );
- }
- // If incoming wrap delta tries to wrap range that contains split position, we have to cancel the split and apply
- // the wrap. Since split was already applied, we have to revert it.
- const sameRoot = a.range.start.root == b.position.root;
- const operateInSameParent = sameRoot && compareArrays( a.range.start.getParentPath(), b.position.getParentPath() ) === 'same';
- const splitInsideWrapRange = a.range.start.offset < b.position.offset && a.range.end.offset >= b.position.offset;
- if ( operateInSameParent && splitInsideWrapRange ) {
- return [
- b.getReversed(),
- a.clone()
- ];
- } else if ( sameRoot && compareArrays( b.position.getParentPath(), a.range.end.getShiftedBy( -1 ).path ) === 'same' ) {
- const delta = a.clone();
- // Move wrapping element insert position one node further so it is after the split node insertion.
- delta._insertOperation.position = delta._insertOperation.position.getShiftedBy( 1 );
- // Include the split node copy.
- delta._moveOperation.howMany++;
- // Change the path to wrapping element in move operation.
- const index = delta._moveOperation.targetPosition.path.length - 2;
- const path = delta._moveOperation.targetPosition.path.slice();
- path[ index ] += 1;
- delta._moveOperation.targetPosition = new Position( delta._moveOperation.targetPosition.root, path );
- return [ delta ];
- }
- return defaultTransform( a, b, context );
- } );
- // Add special case for RenameDelta x SplitDelta transformation.
- addTransformationCase( RenameDelta, SplitDelta, ( a, b, context ) => {
- const undoMode = context.undoMode;
- const deltas = defaultTransform( a, b, context );
- // Special case applies only if undo is not a context and only if `SplitDelta` has `InsertOperation` (not `ReinsertOperation`).
- if ( undoMode || !( b._cloneOperation instanceof InsertOperation ) ) {
- return deltas;
- }
- const insertPosition = b._cloneOperation.position.getShiftedBy( -1 );
- if ( insertPosition && a.operations[ 0 ].position.isEqual( insertPosition ) ) {
- // If a node that has been split has it's name changed, we should also change name of
- // the node created during splitting.
- const additionalRenameDelta = a.clone();
- additionalRenameDelta.operations[ 0 ].position = insertPosition.getShiftedBy( 1 );
- deltas.push( additionalRenameDelta );
- }
- return deltas;
- } );
- // Add special case for SplitDelta x RenameDelta transformation.
- addTransformationCase( SplitDelta, RenameDelta, ( a, b, context ) => {
- a = a.clone();
- const undoMode = context.undoMode;
- // Special case applies only if undo is not a context and only if `SplitDelta` has `InsertOperation` (not `ReinsertOperation`).
- if ( undoMode || !( a._cloneOperation instanceof InsertOperation ) ) {
- return [ a ];
- }
- const insertPosition = a._cloneOperation.position.getShiftedBy( -1 );
- // If element to split had it's name changed, we have to reflect this by creating additional rename operation.
- if ( insertPosition && !undoMode && b.operations[ 0 ].position.isEqual( insertPosition ) ) {
- const additionalRenameDelta = b.clone();
- additionalRenameDelta.operations[ 0 ].position = insertPosition.getShiftedBy( 1 );
- additionalRenameDelta.operations[ 0 ].oldName = a._cloneOperation.nodes.getNode( 0 ).name;
- return [ a, additionalRenameDelta ];
- }
- return [ a ];
- } );
- // Add special case for RemoveDelta x SplitDelta transformation.
- addTransformationCase( RemoveDelta, SplitDelta, ( a, b, context ) => {
- const deltas = defaultTransform( a, b, context );
- // The "clone operation" may be InsertOperation, ReinsertOperation, MoveOperation or NoOperation.
- const insertPosition = b._cloneOperation.position || b._cloneOperation.targetPosition;
- // NoOperation.
- if ( !insertPosition ) {
- return defaultTransform( a, b, context );
- }
- const undoMode = context.undoMode;
- // Special case applies only if undo is not a context.
- if ( undoMode ) {
- return deltas;
- }
- // In case if `defaultTransform` returned more than one delta.
- for ( const delta of deltas ) {
- // "No delta" may be returned in some cases.
- if ( delta instanceof RemoveDelta ) {
- const operation = delta._moveOperation;
- const rangeEnd = operation.sourcePosition.getShiftedBy( operation.howMany );
- if ( rangeEnd.isEqual( insertPosition ) ) {
- operation.howMany += 1;
- }
- }
- }
- return deltas;
- } );
- // Add special case for SplitDelta x RemoveDelta transformation.
- addTransformationCase( SplitDelta, RemoveDelta, ( a, b, context ) => {
- const undoMode = context.undoMode;
- // Special case applies only if undo is not a context.
- if ( undoMode ) {
- return defaultTransform( a, b, context );
- }
- // This case is very trickily solved.
- // Instead of fixing `a` delta, we change `b` delta for a while and fire default transformation with fixed `b` delta.
- // Thanks to that fixing `a` delta will be differently (correctly) transformed.
- //
- // The "clone operation" may be InsertOperation, ReinsertOperation, MoveOperation or NoOperation.
- const insertPosition = a._cloneOperation.position || a._cloneOperation.targetPosition;
- // NoOperation.
- if ( !insertPosition ) {
- return defaultTransform( a, b, context );
- }
- b = b.clone();
- const operation = b._moveOperation;
- const rangeEnd = operation.sourcePosition.getShiftedBy( operation.howMany );
- if ( rangeEnd.isEqual( insertPosition ) ) {
- operation.howMany += 1;
- }
- return defaultTransform( a, b, context );
- } );
- // Helper function for `AttributeDelta` class transformations.
- // Creates an attribute delta that sets attribute from given `attributeDelta` on nodes from given `weakInsertDelta`.
- function _getComplementaryAttrDelta( weakInsertDelta, attributeDelta ) {
- const complementaryAttrDelta = new AttributeDelta();
- const nodes = weakInsertDelta.nodes;
- // At the beginning we store the attribute value from the first node on `weakInsertDelta` node list.
- let val = nodes.getNode( 0 ).getAttribute( attributeDelta.key );
- // This stores the last index of `weakInsertDelta` node list where the attribute value was different
- // than in the previous node. We need it to create separate `AttributeOperation`s for nodes with different attributes.
- let lastOffset = 0;
- // Sum of offsets of already processed nodes.
- let offsetSum = nodes.getNode( 0 ).offsetSize;
- for ( let i = 1; i < nodes.length; i++ ) {
- const node = nodes.getNode( i );
- const nodeAttrVal = node.getAttribute( attributeDelta.key );
- // If previous node has different attribute value, we will create an operation to the point before current node.
- // So all nodes with the same attributes up to this point will be included in one `AttributeOperation`.
- if ( nodeAttrVal != val ) {
- // New operation is created only when it is needed. If given node already has proper value for this
- // attribute we simply skip it without adding a new operation.
- if ( val != attributeDelta.value ) {
- addOperation();
- }
- val = nodeAttrVal;
- lastOffset = offsetSum;
- }
- offsetSum = offsetSum + node.offsetSize;
- }
- // At the end we have to add additional `AttributeOperation` for the last part of node list. If all nodes on the
- // node list had same attributes, this will be the only operation added to the delta.
- addOperation();
- return complementaryAttrDelta;
- function addOperation() {
- const range = new Range(
- weakInsertDelta.position.getShiftedBy( lastOffset ),
- weakInsertDelta.position.getShiftedBy( offsetSum )
- );
- const attrOperation = new AttributeOperation( range, attributeDelta.key, val, attributeDelta.value, 0 );
- complementaryAttrDelta.addOperation( attrOperation );
- }
- }
- // This is "no-op" delta, it has no type and only no-operation, it basically does nothing.
- // It is used when we don't want to apply changes but still we need to return a delta.
- function noDelta() {
- const noDelta = new Delta();
- // BaseVersion will be fixed later anyway.
- noDelta.addOperation( new NoOperation( 0 ) );
- return noDelta;
- }
|