| 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219 |
- /**
- * @license Copyright (c) 2003-2017, CKSource - Frederico Knabben. All rights reserved.
- * For licensing, see LICENSE.md.
- */
- import Range from '../../src/model/range';
- import Position from '../../src/model/position';
- import Element from '../../src/model/element';
- import Text from '../../src/model/text';
- import Document from '../../src/model/document';
- import TreeWalker from '../../src/model/treewalker';
- import CKEditorError from '@ckeditor/ckeditor5-utils/src/ckeditorerror';
- import { jsonParseStringify } from '../../tests/model/_utils/utils';
- import {
- getAttributeDelta,
- getInsertDelta,
- getMoveDelta,
- getRemoveDelta,
- getRenameDelta,
- getSplitDelta,
- getMergeDelta,
- getWrapDelta,
- getUnwrapDelta
- } from '../../tests/model/delta/transform/_utils/utils';
- describe( 'Range', () => {
- let doc, range, start, end, root, otherRoot;
- beforeEach( () => {
- doc = new Document();
- root = doc.createRoot();
- otherRoot = doc.createRoot( '$root', 'otherRoot' );
- start = new Position( root, [ 1 ] );
- end = new Position( root, [ 2 ] );
- range = new Range( start, end );
- } );
- describe( 'constructor()', () => {
- it( 'should create a range with given positions', () => {
- expect( range.start.isEqual( start ) ).to.be.true;
- expect( range.end.isEqual( end ) ).to.be.true;
- } );
- it( 'should create collapsed range', () => {
- const collapsed = new Range( start );
- expect( collapsed.start.isEqual( start ) ).to.be.true;
- expect( collapsed.isCollapsed ).to.be.true;
- } );
- } );
- describe( 'root', () => {
- it( 'should be equal to start position root', () => {
- expect( range.root ).to.equal( start.root );
- } );
- } );
- describe( 'isCollapsed', () => {
- it( 'should be true if range start and end positions are equal', () => {
- let collapsedRange = new Range( start, start );
- expect( collapsedRange.isCollapsed ).to.be.true;
- } );
- it( 'should be false if range start and end positions are not equal', () => {
- expect( range.isCollapsed ).to.be.false;
- } );
- } );
- describe( 'isEqual', () => {
- it( 'should return true if the ranges are the same', () => {
- let sameStart = Position.createFromPosition( start );
- let sameEnd = Position.createFromPosition( end );
- let sameRange = new Range( sameStart, sameEnd );
- expect( range.isEqual( sameRange ) ).to.be.true;
- } );
- it( 'should return false if the start position is different', () => {
- let range = new Range( start, end );
- let diffStart = new Position( root, [ 0 ] );
- let sameEnd = Position.createFromPosition( end );
- let diffRange = new Range( diffStart, sameEnd );
- expect( range.isEqual( diffRange ) ).to.be.false;
- } );
- it( 'should return false if the end position is different', () => {
- let sameStart = new Position( root, [ 0 ] );
- let diffEnd = new Position( root, [ 0 ] );
- let diffRange = new Range( sameStart, diffEnd );
- expect( range.isEqual( diffRange ) ).to.be.false;
- } );
- it( 'should return false if ranges are in different roots', () => {
- let otherRootStart = new Position( otherRoot, start.path.slice() );
- let otherRootEnd = new Position( otherRoot, end.path.slice() );
- let otherRootRange = new Range( otherRootStart, otherRootEnd );
- expect( range.isEqual( otherRootRange ) ).to.be.false;
- } );
- } );
- describe( 'isIntersecting', () => {
- it( 'should return true if given range is equal', () => {
- let otherRange = Range.createFromRange( range );
- expect( range.isIntersecting( otherRange ) ).to.be.true;
- } );
- it( 'should return true if given range contains this range', () => {
- let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 3 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.true;
- } );
- it( 'should return true if given range ends in this range', () => {
- let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1, 4 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.true;
- } );
- it( 'should return true if given range starts in this range', () => {
- let otherRange = new Range( new Position( root, [ 1, 4 ] ), new Position( root, [ 3 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.true;
- } );
- it( 'should return false if given range is fully before this range', () => {
- let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.false;
- } );
- it( 'should return false if given range is fully after this range', () => {
- let otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 2, 0 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.false;
- } );
- it( 'should return false if ranges are in different roots', () => {
- let otherRange = new Range( new Position( otherRoot, [ 0 ] ), new Position( otherRoot, [ 1, 4 ] ) );
- expect( range.isIntersecting( otherRange ) ).to.be.false;
- } );
- } );
- describe( 'static constructors', () => {
- let p;
- // root
- // |- p
- // |- foz
- beforeEach( () => {
- p = new Element( 'p', [], new Text( 'foz' ) );
- root.insertChildren( 0, [ p ] );
- } );
- describe( 'createIn', () => {
- it( 'should return range', () => {
- const range = Range.createIn( p );
- expect( range.start.path ).to.deep.equal( [ 0, 0 ] );
- expect( range.end.path ).to.deep.equal( [ 0, 3 ] );
- } );
- } );
- describe( 'createOn', () => {
- it( 'should return range', () => {
- const range = Range.createOn( p );
- expect( range.start.path ).to.deep.equal( [ 0 ] );
- expect( range.end.path ).to.deep.equal( [ 1 ] );
- } );
- } );
- describe( 'createFromParentsAndOffsets', () => {
- it( 'should return range', () => {
- const range = Range.createFromParentsAndOffsets( root, 0, p, 2 );
- expect( range.start.path ).to.deep.equal( [ 0 ] );
- expect( range.end.path ).to.deep.equal( [ 0, 2 ] );
- } );
- } );
- describe( 'createFromPositionAndShift', () => {
- it( 'should make range from start position and offset', () => {
- const position = new Position( root, [ 1, 2, 3 ] );
- const range = Range.createFromPositionAndShift( position, 4 );
- expect( range ).to.be.instanceof( Range );
- expect( range.start.isEqual( position ) ).to.be.true;
- expect( range.end.root ).to.equal( range.start.root );
- expect( range.end.path ).to.deep.equal( [ 1, 2, 7 ] );
- } );
- } );
- describe( 'createFromRange', () => {
- it( 'should create a new instance of Range that is equal to passed range', () => {
- const clone = Range.createFromRange( range );
- expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
- expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
- } );
- } );
- describe( 'createFromRanges', () => {
- function makeRanges( root, ...points ) {
- let ranges = [];
- for ( let i = 0; i < points.length; i += 2 ) {
- ranges.push( Range.createFromParentsAndOffsets( root, points[ i ], root, points[ i + 1 ] ) );
- }
- return ranges;
- }
- beforeEach( () => {
- root.appendChildren( new Text( 'abcdefghijklmnopqrtuvwxyz' ) );
- } );
- it( 'should throw if empty array is passed', () => {
- expect( () => {
- Range.createFromRanges( [] );
- } ).to.throw( CKEditorError, /^range-create-from-ranges-empty-array/ );
- } );
- it( 'should return a copy of the range if only one range was passed', () => {
- const original = Range.createFromParentsAndOffsets( root, 2, root, 3 );
- const range = Range.createFromRanges( [ original ] );
- expect( range.isEqual( original ) ).to.be.true;
- expect( range ).not.to.be.equal( original );
- } );
- it( 'should combine ranges with reference range', () => {
- const range = Range.createFromRanges( makeRanges( root, 3, 7, 2, 3, 7, 9, 11, 14, 0, 1 ) );
- expect( range.start.offset ).to.equal( 2 );
- expect( range.end.offset ).to.equal( 9 );
- } );
- } );
- } );
- describe( 'iterator', () => {
- it( 'should iterate over the range returning tree walker values', () => {
- prepareRichRoot( root );
- let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let nodes = Array.from( range ).map( value => value.item );
- let lengths = Array.from( range ).map( value => value.length );
- let nodeNames = mapNodesToNames( nodes );
- expect( nodeNames ).to.deep.equal(
- [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
- expect( lengths ).to.deep.equal( [ 2, 1, 11, 1, 3, 1, 3, 1, 1, 2 ] );
- } );
- } );
- describe( 'getWalker', () => {
- it( 'should be possible to iterate using this method', () => {
- prepareRichRoot( root );
- const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- const items = [];
- const walker = range.getWalker();
- for ( let value of walker ) {
- items.push( value.item );
- }
- expect( mapNodesToNames( items ) ).to.deep.equal(
- [ 'T:st', 'E:h', 'E:p', 'T:lorem ipsum', 'E:p', 'E:div', 'E:p',
- 'T:foo', 'E:p', 'E:p', 'T:bar', 'E:p', 'E:div', 'E:h', 'T:se' ] );
- } );
- it( 'should return treewalker with given options', () => {
- prepareRichRoot( root );
- const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- const walker = range.getWalker( { singleCharacters: true } );
- expect( walker ).to.be.instanceof( TreeWalker );
- expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
- expect( walker ).to.have.property( 'boundaries' ).that.equals( range );
- expect( walker ).to.have.property( 'shallow' ).that.is.false;
- } );
- } );
- describe( 'getItems', () => {
- it( 'should iterate over all items in the range', () => {
- prepareRichRoot( root );
- let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let items = Array.from( range.getItems() );
- let nodeNames = mapNodesToNames( items );
- expect( nodeNames ).to.deep.equal(
- [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
- } );
- it( 'should iterate over all items in the range as single characters', () => {
- const a = new Text( 'a' );
- const b = new Text( 'b' );
- const x = new Text( 'x' );
- const y = new Text( 'y' );
- const e1 = new Element( 'e1' );
- const e2 = new Element( 'e2' );
- e1.insertChildren( 0, [ a, b ] );
- e2.insertChildren( 0, [ x, y ] );
- root.insertChildren( 0, [ e1, e2 ] );
- let range = new Range(
- new Position( root, [ 0, 1 ] ),
- new Position( root, [ 1, 1 ] )
- );
- let items = Array.from( range.getItems( { singleCharacters: true } ) );
- expect( items.length ).to.equal( 3 );
- expect( items[ 0 ].data ).to.equal( 'b' );
- expect( items[ 1 ] ).to.equal( e2 );
- expect( items[ 2 ].data ).to.equal( 'x' );
- } );
- } );
- describe( 'getPositions', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should iterate over all positions in this range', () => {
- let expectedPaths = [
- [ 1, 2 ], [ 1, 3 ],
- [ 2 ], [ 2, 0 ], [ 2, 3 ],
- [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
- ];
- let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let i = 0;
- for ( let position of range.getPositions() ) {
- expect( position.path ).to.deep.equal( expectedPaths[ i ] );
- i++;
- }
- expect( i ).to.equal( expectedPaths.length );
- } );
- it( 'should return single nodes iterating over all positions in this range', () => {
- let expectedPaths = [
- [ 1, 2 ], [ 1, 3 ],
- [ 2 ], [ 2, 0 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ],
- [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ]
- ];
- let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let i = 0;
- for ( let position of range.getPositions( { singleCharacters: true } ) ) {
- expect( position.path ).to.deep.equal( expectedPaths[ i ] );
- i++;
- }
- expect( i ).to.equal( expectedPaths.length );
- } );
- } );
- describe( 'containsPosition', () => {
- beforeEach( () => {
- range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
- } );
- it( 'should return false if position is before range', () => {
- const position = new Position( root, [ 0, 4 ] );
- expect( range.containsPosition( position ) ).to.be.false;
- } );
- it( 'should return false if position is after range', () => {
- const position = new Position( root, [ 3, 0 ] );
- expect( range.containsPosition( position ) ).to.be.false;
- } );
- it( 'should return true if position is inside range', () => {
- const position = new Position( root, [ 2, 2 ] );
- expect( range.containsPosition( position ) ).to.be.true;
- } );
- } );
- describe( '_getTransformedByInsertion', () => {
- it( 'should return an array of Range objects', () => {
- const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 2 ] ), 2 );
- expect( transformed ).to.be.instanceof( Array );
- expect( transformed[ 0 ] ).to.be.instanceof( Range );
- } );
- it( 'should update it\'s positions offsets if insertion is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 2 );
- expect( transformed[ 0 ].start.offset ).to.equal( 4 );
- expect( transformed[ 0 ].end.offset ).to.equal( 6 );
- } );
- it( 'should update it\'s positions paths if insertion is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 0 ] ), 2 );
- expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
- expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
- } );
- it( 'should expand range if insertion was in the middle of range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 5, 0 ] ), 4 );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
- } );
- it( 'should return array with two ranges if insertion was in the middle of range and spread flag was set', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 1, 6 ] ), 4, true );
- expect( transformed.length ).to.equal( 2 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 1, 6 ] );
- expect( transformed[ 1 ].start.path ).to.deep.equal( [ 4, 1, 10 ] );
- expect( transformed[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
- } );
- it( 'should not expand range if insertion is equal to start boundary of the range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
- } );
- it( 'should expand range if insertion is equal to start boundary of the range and sticky flag is set', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
- } );
- it( 'should not update positions if insertion is before range (but not equal to the start boundary)', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
- } );
- it( 'should not expand range if insertion is equal to end boundary of the range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
- } );
- it( 'should expand range if insertion is equal to end boundary of the range and sticky flag is set', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3, false, true );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
- } );
- it( 'should not update positions if insertion is after range (but not equal to the end boundary)', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 5 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
- } );
- it( 'should move after inserted nodes if the range is collapsed and isSticky is true', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
- const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 5 ] );
- } );
- } );
- describe( '_getTransformedByMove', () => {
- it( 'should return an array of Range objects', () => {
- const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 2 ] ), new Position( root, [ 5 ] ), 2 );
- expect( transformed ).to.be.instanceof( Array );
- expect( transformed[ 0 ] ).to.be.instanceof( Range );
- } );
- it( 'should update it\'s positions offsets if target is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 8, 1 ] ), new Position( root, [ 3, 1 ] ), 2 );
- expect( transformed[ 0 ].start.offset ).to.equal( 4 );
- expect( transformed[ 0 ].end.offset ).to.equal( 6 );
- } );
- it( 'should update it\'s positions paths if target is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 0 ] ), 2 );
- expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
- expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
- } );
- it( 'should expand range if target was in the middle of range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 5, 0 ] ), 4 );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
- } );
- it( 'should not expand range if insertion is equal to start boundary of the range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 8, 2 ] ), new Position( root, [ 3, 2 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
- } );
- it( 'should not expand range if insertion is equal to end boundary of the range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 8, 4 ] ), new Position( root, [ 4, 4 ] ), 3 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
- } );
- it( 'should update it\'s positions offsets if source is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 8, 1 ] ), 2 );
- expect( transformed[ 0 ].start.offset ).to.equal( 0 );
- expect( transformed[ 0 ].end.offset ).to.equal( 2 );
- } );
- it( 'should update it\'s positions paths if source is before range and they are affected', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 0 ] ), new Position( root, [ 8 ] ), 2 );
- expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 1 );
- expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 2 );
- } );
- it( 'should shrink range if source was in the middle of range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 5, 0 ] ), new Position( root, [ 8 ] ), 4 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 0 ] );
- } );
- it( 'should shrink range if source contained range start position', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 3, 1 ] ), new Position( root, [ 8 ] ), 2 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
- } );
- it( 'should shrink range if source contained range end position', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 5, 3 ] ), new Position( root, [ 8 ] ), 2 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 3 ] );
- } );
- it( 'should move range if it was contained in moved range', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 7 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ), 2 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 4, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
- } );
- it( 'should not stick to moved range, if the transformed range is collapsed #1', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 6 ] ), 2 );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 0 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 0 ] );
- } );
- it( 'should not stick to moved range, if the transformed range is collapsed #2', () => {
- const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
- const transformed = range._getTransformedByMove( new Position( root, [ 3, 2 ] ), new Position( root, [ 6 ] ), 2 );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
- } );
- } );
- describe( 'getDifference', () => {
- let range;
- beforeEach( () => {
- range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- } );
- it( 'should return an array of Range objects', () => {
- const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
- const diff = range.getDifference( otherRange );
- expect( diff ).to.be.instanceof( Array );
- expect( diff[ 0 ] ).to.be.instanceof( Range );
- } );
- it( 'should return original range if other range does not intersect with it', () => {
- const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
- const diff = range.getDifference( otherRange );
- expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( diff[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
- } );
- it( 'should return shrunken range if other range intersects with it', () => {
- const otherRange = new Range( new Position( root, [ 4, 1 ] ), new Position( root, [ 7 ] ) );
- const diff = range.getDifference( otherRange );
- expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( diff[ 0 ].end.path ).to.deep.equal( [ 4, 1 ] );
- } );
- it( 'should return an empty array if other range contains or is same as the original range', () => {
- const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 6 ] ) );
- const diff = range.getDifference( otherRange );
- expect( diff.length ).to.equal( 0 );
- } );
- it( 'should two ranges if other range is contained by the original range', () => {
- const otherRange = new Range( new Position( root, [ 3, 7 ] ), new Position( root, [ 4, 1 ] ) );
- const diff = range.getDifference( otherRange );
- expect( diff.length ).to.equal( 2 );
- expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( diff[ 0 ].end.path ).to.deep.equal( [ 3, 7 ] );
- expect( diff[ 1 ].start.path ).to.deep.equal( [ 4, 1 ] );
- expect( diff[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
- } );
- } );
- describe( 'getIntersection', () => {
- let range;
- beforeEach( () => {
- range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
- } );
- it( 'should return null if ranges do not intersect', () => {
- const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
- const common = range.getIntersection( otherRange );
- expect( common ).to.be.null;
- } );
- it( 'should return a range equal to the common part of ranges - original range contains the other range', () => {
- const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
- const common = range.getIntersection( otherRange );
- expect( common.isEqual( otherRange ) ).to.be.true;
- } );
- it( 'should return a range equal to the common part of ranges - original range is contained by the other range', () => {
- const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
- const common = range.getIntersection( otherRange );
- expect( common.isEqual( range ) ).to.be.true;
- } );
- it( 'should return a range equal to the common part of ranges - original range intersects with the other range', () => {
- const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
- const common = range.getIntersection( otherRange );
- expect( common.start.path ).to.deep.equal( [ 3, 2 ] );
- expect( common.end.path ).to.deep.equal( [ 4, 7 ] );
- } );
- } );
- describe( 'getTransformedByDelta', () => {
- beforeEach( () => {
- root.appendChildren( new Text( 'foobar' ) );
- range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
- } );
- function expectRange( range, startOffset, endOffset ) {
- expect( range.start.offset ).to.equal( startOffset );
- expect( range.end.offset ).to.equal( endOffset );
- }
- describe( 'by AttributeDelta', () => {
- it( 'nothing should change', () => {
- const delta = getAttributeDelta( Range.createFromParentsAndOffsets( root, 1, root, 6 ), 'key', true, false, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by InsertDelta', () => {
- it( 'insert before range', () => {
- const delta = getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 5, 8 );
- } );
- it( 'insert inside range', () => {
- const delta = getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 8 );
- } );
- it( 'insert after range', () => {
- const delta = getInsertDelta( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by MoveDelta', () => {
- it( 'move before range', () => {
- const start = new Position( root, [ 0 ] );
- const target = new Position( otherRoot, [ 0 ] );
- const delta = getMoveDelta( start, 2, target, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 0, 3 );
- } );
- it( 'move intersecting with range (and targeting before range)', () => {
- const start = new Position( root, [ 4 ] );
- const target = new Position( root, [ 0 ] );
- const delta = getMoveDelta( start, 2, target, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 4, 6 );
- expectRange( transformed[ 1 ], 0, 1 );
- } );
- it( 'move inside the range', () => {
- range.end.offset = 6;
- const start = new Position( root, [ 3 ] );
- const target = new Position( root, [ 5 ] );
- const delta = getMoveDelta( start, 1, target, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 4 );
- expectRange( transformed[ 1 ], 5, 6 );
- expectRange( transformed[ 2 ], 4, 5 );
- } );
- // #877.
- it( 'moved element contains range start and is moved towards inside of range', () => {
- // Initial state:
- // <w><p>abc</p><p>x[x</p></w><p>d]ef</p>
- // Expected state after moving `<p>` out of `<w>`:
- // <w><p>abc</p></w><p>x[x</p><p>d]ef</p>
- const range = new Range( new Position( root, [ 0, 1, 1 ] ), new Position( root, [ 1, 1 ] ) );
- const delta = getMoveDelta( new Position( root, [ 0, 1 ] ), 1, new Position( root, [ 1 ] ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
- } );
- it( 'moved element contains range start and is moved out of range', () => {
- // Initial state:
- // <p>abc</p><p>x[x</p><p>d]ef</p>
- // Expected state after moving:
- // <p>x[x</p><p>abc</p><p>d]ef</p>
- const range = new Range( new Position( root, [ 1, 1 ] ), new Position( root, [ 2, 1 ] ) );
- const delta = getMoveDelta( new Position( root, [ 1 ] ), 1, new Position( root, [ 0 ] ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
- } );
- it( 'moved element contains range end and is moved towards range', () => {
- // Initial state:
- // <p>a[bc</p><p>def</p><p>x]x</p>
- // Expected state after moving:
- // <p>a[bc</p><p>x]x</p><p>def</p>
- const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 2, 1 ] ) );
- const delta = getMoveDelta( new Position( root, [ 2 ] ), 1, new Position( root, [ 1 ] ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- } );
- it( 'moved element contains range end and is moved out of range', () => {
- // Initial state:
- // <p>a[bc</p><p>x]x</p><p>def</p>
- // Expected state after moving:
- // <p>a[bc</p><p>def</p><p>x]x</p>
- const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 1, 1 ] ) );
- const delta = getMoveDelta( new Position( root, [ 1 ] ), 1, new Position( root, [ 3 ] ), 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
- } );
- } );
- describe( 'by RemoveDelta', () => {
- it( 'remove before range', () => {
- const start = new Position( root, [ 0 ] );
- const delta = getRemoveDelta( start, 2, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 0, 3 );
- } );
- it( 'remove intersecting with range', () => {
- const start = new Position( root, [ 4 ] );
- const delta = getRemoveDelta( start, 2, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 4 );
- expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
- expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 1 );
- } );
- it( 'remove inside the range', () => {
- const start = new Position( root, [ 3 ] );
- const delta = getRemoveDelta( start, 2, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 3 );
- expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
- expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 2 );
- } );
- } );
- describe( 'by RenameDelta', () => {
- it( 'nothing should change', () => {
- const delta = getRenameDelta( new Position( root, [ 3 ] ), 'old', 'new', 1 );
- const transformed = range.getTransformedByDelta( delta );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by SplitDelta', () => {
- it( 'split inside range', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( new Element( 'p', null, new Text( 'foobar' ) ) );
- range.start = new Position( root, [ 0, 2 ] );
- range.end = new Position( root, [ 0, 4 ] );
- const delta = getSplitDelta( new Position( root, [ 0, 3 ] ), new Element( 'p' ), 3, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- } );
- describe( 'by MergeDelta', () => {
- it( 'merge element with collapsed range', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
- range.start = new Position( root, [ 1, 0 ] );
- range.end = new Position( root, [ 1, 0 ] );
- const delta = getMergeDelta( new Position( root, [ 1 ] ), 3, 3, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
- } );
- // #877.
- it( 'merge elements that contain elements with range boundaries', () => {
- // Initial state:
- // <w><p>x[x</p></w><w><p>y]y</p></w>
- // Expected state after merge:
- // <w><p>x[x</p><p>y]y</p></w>
- const range = new Range( new Position( root, [ 0, 0, 1 ] ), new Position( root, [ 1, 0, 1 ] ) );
- const delta = getMergeDelta( new Position( root, [ 1 ] ), 1, 1, 1 );
- const transformed = range.getTransformedByDelta( delta );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 1, 1 ] );
- } );
- } );
- describe( 'by WrapDelta', () => {
- it( 'maintans start position when wrapping element in which the range starts and ends', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
- // <p>f[o]o</p><p>bar</p>
- range.start = new Position( root, [ 0, 1 ] );
- range.end = new Position( root, [ 0, 2 ] );
- const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
- const wrapElement = new Element( 'w' );
- const delta = getWrapDelta( wrapRange, wrapElement, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <w><p>f[o]o</p></w><p>bar</p>
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 0, 2 ] );
- } );
- it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
- // <p>f[oo</p><p>b]ar</p>
- range.start = new Position( root, [ 0, 1 ] );
- range.end = new Position( root, [ 1, 1 ] );
- const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
- const wrapElement = new Element( 'w' );
- const delta = getWrapDelta( wrapRange, wrapElement, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <w><p>f[oo</p></w><p>b]ar</p>
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- } );
- it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
- // <p>f[oo</p><p>b]ar</p>
- range.start = new Position( root, [ 0, 1 ] );
- range.end = new Position( root, [ 1, 1 ] );
- const wrapRange = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2 ] ) );
- const wrapElement = new Element( 'w' );
- const delta = getWrapDelta( wrapRange, wrapElement, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <p>f[oo</p><w><p>b]ar</p></w>
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 0, 1 ] );
- } );
- } );
- describe( 'by UnwrapDelta', () => {
- it( 'maintans start position when wrapping element in which the range starts and ends', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [
- new Element( 'w', null, [
- new Element( 'p', null, new Text( 'foo' ) )
- ] ),
- new Element( 'p', null, new Text( 'bar' ) )
- ] );
- // <w><p>f[o]o</p></w><p>bar</p>
- range.start = new Position( root, [ 0, 0, 1 ] );
- range.end = new Position( root, [ 0, 0, 2 ] );
- const unwrapPosition = new Position( root, [ 0 ] );
- const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <p>f[o]o</p><p>bar</p>
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 2 ] );
- } );
- it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [
- new Element( 'w', null, [
- new Element( 'p', null, new Text( 'foo' ) )
- ] ),
- new Element( 'p', null, new Text( 'bar' ) )
- ] );
- // <w><p>f[oo</p></w><p>b]ar</p>
- range.start = new Position( root, [ 0, 0, 1 ] );
- range.end = new Position( root, [ 1, 1 ] );
- const unwrapPosition = new Position( root, [ 0 ] );
- const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <p>f[oo</p><p>b]ar</p>
- expect( transformed.length ).to.equal( 2 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- expect( transformed[ 1 ].root.rootName ).to.equal( '$graveyard' );
- } );
- it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
- root.removeChildren( root.childCount );
- root.appendChildren( [
- new Element( 'p', null, new Text( 'foo' ) ),
- new Element( 'w', null, [
- new Element( 'p', null, new Text( 'bar' ) )
- ] )
- ] );
- // <p>f[oo</p><w><p>b]ar</p></w>
- range.start = new Position( root, [ 0, 1 ] );
- range.end = new Position( root, [ 1, 0, 1 ] );
- const unwrapPosition = new Position( root, [ 1 ] );
- const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
- const transformed = range.getTransformedByDelta( delta );
- // <p>f[oo</p><p>b]ar</p>
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- } );
- } );
- } );
- } );
- describe( 'getTransformedByDeltas', () => {
- beforeEach( () => {
- root.appendChildren( new Text( 'foobar' ) );
- range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
- } );
- function expectRange( range, startOffset, endOffset ) {
- expect( range.start.offset ).to.equal( startOffset );
- expect( range.end.offset ).to.equal( endOffset );
- }
- it( 'should return a range transformed by multiple deltas', () => {
- const transformed = range.getTransformedByDeltas( [
- getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
- getInsertDelta( new Position( root, [ 6 ] ), new Text( 'xx' ), 2 ) // Range becomes 5..10.
- ] );
- expectRange( transformed[ 0 ], 5, 10 );
- } );
- it( 'should correctly handle breaking transformed range and all range "pieces"', () => {
- const transformed = range.getTransformedByDeltas( [
- getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
- getMoveDelta( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
- getInsertDelta( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
- getMoveDelta( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
- getMoveDelta( new Position( root, [ 6 ] ), 1, new Position( root, [ 1 ] ), 5 ) // Range becomes 1..2, 4..7 and 8..10.
- ] );
- expect( transformed.length ).to.equal( 3 );
- expectRange( transformed[ 0 ], 4, 7 );
- expectRange( transformed[ 1 ], 1, 2 );
- expectRange( transformed[ 2 ], 8, 10 );
- } );
- it( 'should return range equal to original range for empty delta set', () => {
- const transformed = range.getTransformedByDeltas( [] );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'getMinimalFlatRanges', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should return empty array if range is collapsed', () => {
- let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
- let flat = range.getMinimalFlatRanges();
- expect( flat.length ).to.equal( 0 );
- } );
- it( 'should return empty array if range does not contain any node', () => {
- let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
- let flat = range.getMinimalFlatRanges();
- expect( flat.length ).to.equal( 0 );
- } );
- it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
- let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let flat = range.getMinimalFlatRanges();
- expect( flat.length ).to.equal( 4 );
- expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
- expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
- expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
- expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
- expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
- expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
- expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
- expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
- } );
- it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
- let range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
- let flat = range.getMinimalFlatRanges();
- expect( flat.length ).to.equal( 2 );
- expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
- expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
- expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
- expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
- } );
- } );
- describe( 'isFlat', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should be true if start and end position are in the same parent', () => {
- let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
- expect( range.isFlat ).to.be.true;
- } );
- it( 'should be false if start and end position are in different parents', () => {
- let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
- expect( range.isFlat ).to.be.false;
- } );
- } );
- describe( 'fromJSON', () => {
- it( 'should create range from given JSON object', () => {
- const serialized = jsonParseStringify( range );
- const deserialized = Range.fromJSON( serialized, doc );
- expect( deserialized ).to.deep.equal( range );
- } );
- } );
- function mapNodesToNames( nodes ) {
- return nodes.map( ( node ) => {
- return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
- } );
- }
- function prepareRichRoot() {
- root.insertChildren( 0, [
- new Element( 'div', [], [
- new Element( 'h', [], new Text( 'first' ) ),
- new Element( 'p', [], new Text( 'lorem ipsum' ) )
- ] ),
- new Element( 'p', [], new Text( 'foo' ) ),
- new Element( 'p', [], new Text( 'bar' ) ),
- new Element( 'div', [], [
- new Element( 'h', [], new Text( 'second' ) ),
- new Element( 'p', [], new Text( 'lorem' ) )
- ] )
- ] );
- }
- } );
|