| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756 |
- /**
- * @license Copyright (c) 2003-2016, CKSource - Frederico Knabben. All rights reserved.
- * For licensing, see LICENSE.md.
- */
- /* bender-tags: model */
- import Range from 'ckeditor5/engine/model/range.js';
- import Position from 'ckeditor5/engine/model/position.js';
- import Element from 'ckeditor5/engine/model/element.js';
- import Text from 'ckeditor5/engine/model/text.js';
- import Document from 'ckeditor5/engine/model/document.js';
- import TreeWalker from 'ckeditor5/engine/model/treewalker.js';
- import { jsonParseStringify } from 'tests/engine/model/_utils/utils.js';
- 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( '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 not change if the range is collapsed and isSticky is false', () => {
- 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, false );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
- } );
- 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 ] );
- } );
- } );
- 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( '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 );
- } );
- } );
- describe( 'isEmpty', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should be true if there are no nodes between range start and end', () => {
- let range = new Range( new Position( root, [ 0, 0, 5 ] ), new Position( root, [ 0, 1, 0 ] ) );
- expect( range.isEmpty ).to.be.true;
- } );
- it( 'should be false if there are nodes between range start and end', () => {
- let range = new Range( new Position( root, [ 0, 0, 5 ] ), new Position( root, [ 0, 1, 1 ] ) );
- expect( range.isEmpty ).to.be.false;
- } );
- } );
- 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' ) )
- ] )
- ] );
- }
- } );
|