| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415 |
- /**
- * @license Copyright (c) 2003-2020, CKSource - Frederico Knabben. All rights reserved.
- * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license
- */
- 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 Model from '../../src/model/model';
- import TreeWalker from '../../src/model/treewalker';
- import MarkerOperation from '../../src/model/operation/markeroperation';
- import AttributeOperation from '../../src/model/operation/attributeoperation';
- import InsertOperation from '../../src/model/operation/insertoperation';
- import MoveOperation from '../../src/model/operation/moveoperation';
- import RenameOperation from '../../src/model/operation/renameoperation';
- import MergeOperation from '../../src/model/operation/mergeoperation';
- import SplitOperation from '../../src/model/operation/splitoperation';
- import { expectToThrowCKEditorError } from '@ckeditor/ckeditor5-utils/tests/_utils/utils';
- describe( 'Range', () => {
- let doc, range, start, end, root, otherRoot, gy, model;
- beforeEach( () => {
- model = new Model();
- doc = model.document;
- root = doc.createRoot();
- otherRoot = doc.createRoot( '$root', 'otherRoot' );
- gy = doc.graveyard;
- 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( 'is()', () => {
- it( 'should return true for "range"', () => {
- expect( range.is( 'range' ) ).to.be.true;
- expect( range.is( 'model:range' ) ).to.be.true;
- } );
- it( 'should return false for incorrect values', () => {
- expect( range.is( 'model' ) ).to.be.false;
- expect( range.is( 'model:node' ) ).to.be.false;
- expect( range.is( 'text' ) ).to.be.false;
- expect( range.is( 'element', 'paragraph' ) ).to.be.false;
- } );
- } );
- 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', () => {
- const 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', () => {
- const sameStart = Position._createAt( start );
- const sameEnd = Position._createAt( end );
- const sameRange = new Range( sameStart, sameEnd );
- expect( range.isEqual( sameRange ) ).to.be.true;
- } );
- it( 'should return false if the start position is different', () => {
- const range = new Range( start, end );
- const diffStart = new Position( root, [ 0 ] );
- const sameEnd = Position._createAt( end );
- const diffRange = new Range( diffStart, sameEnd );
- expect( range.isEqual( diffRange ) ).to.be.false;
- } );
- it( 'should return false if the end position is different', () => {
- const sameStart = new Position( root, [ 0 ] );
- const diffEnd = new Position( root, [ 0 ] );
- const diffRange = new Range( sameStart, diffEnd );
- expect( range.isEqual( diffRange ) ).to.be.false;
- } );
- it( 'should return false if ranges are in different roots', () => {
- const otherRootStart = new Position( otherRoot, start.path.slice() );
- const otherRootEnd = new Position( otherRoot, end.path.slice() );
- const otherRootRange = new Range( otherRootStart, otherRootEnd );
- expect( range.isEqual( otherRootRange ) ).to.be.false;
- } );
- } );
- describe( 'isIntersecting()', () => {
- it( 'should return true if given range is equal', () => {
- const otherRange = range.clone();
- expect( range.isIntersecting( otherRange ) ).to.be.true;
- } );
- it( 'should return true if given range contains this range', () => {
- const 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', () => {
- const 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', () => {
- const 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', () => {
- const 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', () => {
- const 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', () => {
- const 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._insertChild( 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( '_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( 'clone()', () => {
- it( 'should create a new instance of Range that is equal to passed range', () => {
- const clone = range.clone();
- 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 ) {
- const ranges = [];
- for ( let i = 0; i < points.length; i += 2 ) {
- ranges.push( new Range( Position._createAt( root, points[ i ] ), Position._createAt( root, points[ i + 1 ] ) ) );
- }
- return ranges;
- }
- beforeEach( () => {
- root._appendChild( new Text( 'abcdefghijklmnopqrtuvwxyz' ) );
- } );
- it( 'should throw if empty array is passed', () => {
- expectToThrowCKEditorError( () => {
- Range._createFromRanges( [] );
- }, /^range-create-from-ranges-empty-array/ );
- } );
- it( 'should return a copy of the range if only one range was passed', () => {
- const original = new Range( Position._createAt( root, 2 ), Position._createAt( 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 );
- const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- const nodes = Array.from( range ).map( value => value.item );
- const lengths = Array.from( range ).map( value => value.length );
- const 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 ( const 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 );
- const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- const items = Array.from( range.getItems() );
- const 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._insertChild( 0, [ a, b ] );
- e2._insertChild( 0, [ x, y ] );
- root._insertChild( 0, [ e1, e2 ] );
- const range = new Range(
- new Position( root, [ 0, 1 ] ),
- new Position( root, [ 1, 1 ] )
- );
- const 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', () => {
- const expectedPaths = [
- [ 1, 2 ], [ 1, 3 ],
- [ 2 ], [ 2, 0 ], [ 2, 3 ],
- [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
- ];
- const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let i = 0;
- for ( const 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', () => {
- const 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 ]
- ];
- const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
- let i = 0;
- for ( const 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( 'containsRange()', () => {
- beforeEach( () => {
- range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
- } );
- it( 'should return true if ranges are equal and check is not strict', () => {
- const otherRange = range.clone();
- expect( range.containsRange( otherRange, true ) ).to.be.true;
- } );
- it( 'should return true if ranges start at the same position and check is not strict', () => {
- const otherRange = new Range( range.start, new Position( root, [ 2 ] ) );
- expect( range.containsRange( otherRange, true ) ).to.be.true;
- } );
- it( 'should return true if ranges end at the same position and check is not strict', () => {
- const otherRange = new Range( new Position( root, [ 2 ] ), range.end );
- expect( range.containsRange( otherRange, true ) ).to.be.true;
- } );
- it( 'should return false if given range is collapsed and starts or ends at another range boundary', () => {
- expect( range.containsRange( new Range( range.start, range.start ) ) ).to.be.false;
- expect( range.containsRange( new Range( range.end, range.end ) ) ).to.be.false;
- // Collapsed range should always be checked in strict mode.
- expect( range.containsRange( new Range( range.start, range.start ), true ) ).to.be.false;
- expect( range.containsRange( new Range( range.end, range.end ), true ) ).to.be.false;
- } );
- } );
- describe( 'containsItem()', () => {
- let a, b, c, d, xxx;
- beforeEach( () => {
- a = new Element( 'a' );
- b = new Element( 'b' );
- c = new Element( 'c' );
- d = new Element( 'd' );
- xxx = new Text( 'xxx' );
- b._appendChild( xxx );
- root._appendChild( [ a, b, c, d ] );
- } );
- it( 'should return true if element is inside range and false when it is not inside range', () => {
- const range = new Range( Position._createAt( root, 1 ), Position._createAt( root, 3 ) ); // Range over `b` and `c`.
- expect( range.containsItem( a ) ).to.be.false;
- expect( range.containsItem( b ) ).to.be.true;
- expect( range.containsItem( xxx ) ).to.be.true;
- expect( range.containsItem( c ) ).to.be.true;
- expect( range.containsItem( d ) ).to.be.false;
- } );
- } );
- 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 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 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 ] );
- } );
- } );
- 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( '_getTransformedByDeletion()', () => {
- it( 'should return a transformed range', () => {
- const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
- const transformed = range._getTransformedByDeletion( new Position( root, [ 1 ] ), 1 );
- expect( transformed.start.offset ).to.equal( 2 );
- expect( transformed.end.offset ).to.equal( 4 );
- } );
- it( 'should shrink the range if removed range was intersecting #1', () => {
- const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
- const transformed = range._getTransformedByDeletion( new Position( root, [ 2 ] ), 2 );
- expect( transformed.start.offset ).to.equal( 2 );
- expect( transformed.end.offset ).to.equal( 3 );
- } );
- it( 'should shrink the range if removed range was intersecting #2', () => {
- const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
- const transformed = range._getTransformedByDeletion( new Position( root, [ 4 ] ), 2 );
- expect( transformed.start.offset ).to.equal( 3 );
- expect( transformed.end.offset ).to.equal( 4 );
- } );
- it( 'should return null if the transformed range was contained in the removed range', () => {
- const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
- const transformed = range._getTransformedByDeletion( new Position( root, [ 2 ] ), 7 );
- expect( transformed ).to.be.null;
- } );
- } );
- 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 ] );
- } );
- it( 'should return a range equal to both ranges if both ranges are equal', () => {
- const otherRange = range.clone();
- const common = range.getIntersection( otherRange );
- expect( common.isEqual( range ) ).to.be.true;
- } );
- } );
- // Note: We don't create model element structure in these tests because this method
- // is used by OT so it must not check the structure.
- describe( 'getTransformedByOperation()', () => {
- let gyPos;
- beforeEach( () => {
- range = new Range( Position._createAt( root, 2 ), Position._createAt( root, 5 ) );
- gyPos = new Position( gy, [ 0 ] );
- } );
- function expectRange( range, startOffset, endOffset ) {
- expect( range.start.offset ).to.equal( startOffset );
- expect( range.end.offset ).to.equal( endOffset );
- }
- describe( 'by AttributeOperation', () => {
- it( 'nothing should change', () => {
- const opRange = new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) );
- const op = new AttributeOperation( opRange, 'key', true, false, 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by InsertOperation', () => {
- it( 'insert before range', () => {
- const op = new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 5, 8 );
- } );
- it( 'insert inside range', () => {
- const op = new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 8 );
- } );
- it( 'insert after range', () => {
- const op = new InsertOperation( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by MarkerOperation', () => {
- it( 'nothing should change', () => {
- const op = new MarkerOperation(
- 'marker', null, new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) ), model.markers, true, 1
- );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by MoveOperation', () => {
- it( 'move before range', () => {
- const start = new Position( root, [ 0 ] );
- const target = new Position( otherRoot, [ 0 ] );
- const op = new MoveOperation( start, 2, target, 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 op = new MoveOperation( start, 2, target, 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 op = new MoveOperation( start, 1, target, 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 4 );
- expectRange( transformed[ 1 ], 4, 5 );
- expectRange( transformed[ 2 ], 5, 6 );
- } );
- // #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>
- // <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 op = new MoveOperation( new Position( root, [ 0, 1 ] ), 1, new Position( root, [ 1 ] ), 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 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 op = new MoveOperation( new Position( root, [ 2 ] ), 1, new Position( root, [ 1 ] ), 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 ] );
- } );
- // #1358
- it( 'should not crash and not transform the range if move operation moves 0 nodes', () => {
- const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
- const op = new MoveOperation( new Position( root, [ 0, 1 ] ), 0, new Position( root, [ 0, 3 ] ), 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 4 ] );
- } );
- } );
- describe( 'by MoveOperation to graveyard', () => {
- it( 'remove before range', () => {
- const start = new Position( root, [ 0 ] );
- const op = new MoveOperation( start, 2, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 0, 3 );
- } );
- it( 'remove intersecting with range', () => {
- const start = new Position( root, [ 4 ] );
- const op = new MoveOperation( start, 2, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 op = new MoveOperation( start, 2, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 RenameOperation', () => {
- it( 'nothing should change', () => {
- const op = new RenameOperation( new Position( root, [ 3 ] ), 'old', 'new', 1 );
- const transformed = range.getTransformedByOperation( op );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'by SplitOperation', () => {
- it( 'split inside range', () => {
- range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
- const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- 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 ] );
- } );
- it( 'split at the beginning of multi-element range', () => {
- range = new Range( new Position( root, [ 0, 4 ] ), new Position( root, [ 1, 2 ] ) );
- const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 0 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 2 ] );
- } );
- it( 'split inside range which starts at the beginning of split element', () => {
- range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 4 ] ) );
- const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
- } );
- it( 'split inside range which end is at the end of split element', () => {
- range = new Range( new Position( root, [ 0, 3 ] ), new Position( root, [ 0, 6 ] ) );
- const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 2 ] );
- } );
- it( 'split element which has collapsed range at the end', () => {
- range = new Range( new Position( root, [ 0, 6 ] ), new Position( root, [ 0, 6 ] ) );
- const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 3 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 3 ] );
- } );
- it( 'split element which is the last element in the range', () => {
- range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
- const op = new SplitOperation( new Position( root, [ 2, 0 ] ), 6, gyPos, 1 );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4 ] );
- } );
- } );
- describe( 'by MergeOperation', () => {
- it( 'merge element with collapsed range', () => {
- range.start = new Position( root, [ 1, 0 ] );
- range.end = new Position( root, [ 1, 0 ] );
- const op = new MergeOperation(
- new Position( root, [ 1, 0 ] ),
- 4,
- new Position( root, [ 0, 3 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- 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 ] );
- } );
- it( 'merge element with collapsed range #2', () => {
- range.start = new Position( root, [ 1, 3 ] );
- range.end = new Position( root, [ 1, 3 ] );
- const op = new MergeOperation(
- new Position( root, [ 0, 0 ] ),
- 4,
- new Position( root, [ 1, 3 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- 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 op = new MergeOperation(
- new Position( root, [ 1, 0 ] ),
- 4,
- new Position( root, [ 0, 1 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- 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 ] );
- } );
- it( 'merge at the beginning of the range', () => {
- const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 2, 0 ] ),
- 4,
- new Position( root, [ 1, 1 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
- } );
- it( 'merge at the end of the range', () => {
- const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 3, 0 ] ),
- 4,
- new Position( root, [ 2, 1 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
- } );
- it( 'merged element is the only node in the range', () => {
- const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 3 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 2, 0 ] ),
- 4,
- new Position( root, [ 1, 1 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
- } );
- it( 'range start is between merged elements #1', () => {
- // <p>aa</p>{<p>b}b</p><p>cc</p>
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 1, 1 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 1, 0 ] ),
- 2,
- new Position( root, [ 0, 2 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- // <p>aa{b}b</p><p>cc</p>
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
- } );
- it( 'range start is between merged elements #2', () => {
- // <p>aa</p>{<p>cc</p><p>b}b</p>
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2, 1 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 2, 0 ] ),
- 2,
- new Position( root, [ 0, 2 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- // <p>aa{bb</p><p>cc</p>}
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
- } );
- it( 'range is set on closing tag of merge target element', () => {
- // <p>aa{</p>}<p>bb</p>
- const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 1 ] ) );
- const op = new MergeOperation(
- new Position( root, [ 1, 0 ] ),
- 2,
- new Position( root, [ 0, 2 ] ),
- gyPos,
- 1
- );
- const transformed = range.getTransformedByOperation( op );
- expect( transformed.length ).to.equal( 1 );
- // <p>aa{}bb</p>
- expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
- expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 2 ] );
- } );
- } );
- } );
- describe( 'getTransformedByOperations()', () => {
- beforeEach( () => {
- root._appendChild( new Text( 'foobar' ) );
- range = new Range( Position._createAt( root, 2 ), Position._createAt( 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 operations', () => {
- const transformed = range.getTransformedByOperations( [
- new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
- new InsertOperation( 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.getTransformedByOperations( [
- new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
- new MoveOperation( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
- new InsertOperation( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
- new MoveOperation( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
- new MoveOperation( 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 operation set', () => {
- const transformed = range.getTransformedByOperations( [] );
- expectRange( transformed[ 0 ], 2, 5 );
- } );
- } );
- describe( 'getMinimalFlatRanges()', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should return empty array if range is collapsed', () => {
- const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
- const flat = range.getMinimalFlatRanges();
- expect( flat.length ).to.equal( 0 );
- } );
- it( 'should return empty array if range does not contain any node', () => {
- const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
- const 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)', () => {
- const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
- const 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)', () => {
- const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
- const 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', () => {
- const 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', () => {
- const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
- expect( range.isFlat ).to.be.false;
- } );
- } );
- describe( 'toJSON()', () => {
- it( 'should serialize range', () => {
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
- const serialized = range.toJSON();
- expect( serialized ).to.deep.equal( {
- start: { root: 'main', path: [ 1 ], stickiness: 'toNext' },
- end: { root: 'main', path: [ 3 ], stickiness: 'toPrevious' }
- } );
- } );
- } );
- describe( 'fromJSON()', () => {
- it( 'should create range from given JSON object', () => {
- const serialized = range.toJSON();
- const deserialized = Range.fromJSON( serialized, doc );
- expect( deserialized ).to.deep.equal( range );
- } );
- } );
- describe( 'getCommonAncestor()', () => {
- it( 'should return common ancestor for positions from Range', () => {
- expect( range.getCommonAncestor() ).to.equal( root );
- } );
- } );
- describe( 'getContainedElement()', () => {
- beforeEach( () => {
- prepareRichRoot( root );
- } );
- it( 'should return an element when it is fully contained by the range', () => {
- // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p>]<p>bar</p><div><h>second</h><p>lorem</p></div>
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2 ] ) );
- expect( range.getContainedElement() ).to.equal( root.getNodeByPath( [ 1 ] ) );
- } );
- it( 'should return "null" if the range is collapsed', () => {
- // <div><h>first</h><p>lorem ipsum</p></div>[]<p>foo</p><p>bar</p><div><h>second</h><p>lorem</p></div>
- const range = new Range( new Position( root, [ 1 ] ) );
- expect( range.getContainedElement() ).to.be.null;
- } );
- it( 'should return "null" if it contains 2+ elements', () => {
- // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p><p>bar</p>]<div><h>second</h><p>lorem</p></div>
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
- expect( range.getContainedElement() ).to.be.null;
- } );
- it( 'should return "null" if it contains an element and some other nodes', () => {
- // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p><p>ba]r</p><div><h>second</h><p>lorem</p></div>
- const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2, 2 ] ) );
- expect( range.getContainedElement() ).to.be.null;
- } );
- it( 'should return "null" if it fully contains a node but the node is not an element', () => {
- // <div><h>first</h><p>lorem ipsum</p></div><p>foo</p><p>[bar]</p><div><h>second</h><p>lorem</p></div>
- const range = new Range( new Position( root, [ 2, 0 ] ), new Position( root, [ 2, 3 ] ) );
- expect( range.getContainedElement() ).to.be.null;
- } );
- } );
- function mapNodesToNames( nodes ) {
- return nodes.map( node => {
- return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
- } );
- }
- function prepareRichRoot() {
- root._insertChild( 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' ) )
- ] )
- ] );
- }
- } );
|