range.js 50 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338
  1. /**
  2. * @license Copyright (c) 2003-2018, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. import Range from '../../src/model/range';
  6. import Position from '../../src/model/position';
  7. import Element from '../../src/model/element';
  8. import Text from '../../src/model/text';
  9. import Model from '../../src/model/model';
  10. import TreeWalker from '../../src/model/treewalker';
  11. import MarkerOperation from '../../src/model/operation/markeroperation';
  12. import AttributeOperation from '../../src/model/operation/attributeoperation';
  13. import InsertOperation from '../../src/model/operation/insertoperation';
  14. import MoveOperation from '../../src/model/operation/moveoperation';
  15. import RenameOperation from '../../src/model/operation/renameoperation';
  16. import MergeOperation from '../../src/model/operation/mergeoperation';
  17. import SplitOperation from '../../src/model/operation/splitoperation';
  18. import CKEditorError from '@ckeditor/ckeditor5-utils/src/ckeditorerror';
  19. describe( 'Range', () => {
  20. let doc, range, start, end, root, otherRoot, gy, model;
  21. beforeEach( () => {
  22. model = new Model();
  23. doc = model.document;
  24. root = doc.createRoot();
  25. otherRoot = doc.createRoot( '$root', 'otherRoot' );
  26. gy = doc.graveyard;
  27. start = new Position( root, [ 1 ] );
  28. end = new Position( root, [ 2 ] );
  29. range = new Range( start, end );
  30. } );
  31. describe( 'constructor()', () => {
  32. it( 'should create a range with given positions', () => {
  33. expect( range.start.isEqual( start ) ).to.be.true;
  34. expect( range.end.isEqual( end ) ).to.be.true;
  35. } );
  36. it( 'should create collapsed range', () => {
  37. const collapsed = new Range( start );
  38. expect( collapsed.start.isEqual( start ) ).to.be.true;
  39. expect( collapsed.isCollapsed ).to.be.true;
  40. } );
  41. } );
  42. describe( 'root', () => {
  43. it( 'should be equal to start position root', () => {
  44. expect( range.root ).to.equal( start.root );
  45. } );
  46. } );
  47. describe( 'isCollapsed', () => {
  48. it( 'should be true if range start and end positions are equal', () => {
  49. const collapsedRange = new Range( start, start );
  50. expect( collapsedRange.isCollapsed ).to.be.true;
  51. } );
  52. it( 'should be false if range start and end positions are not equal', () => {
  53. expect( range.isCollapsed ).to.be.false;
  54. } );
  55. } );
  56. describe( 'isEqual()', () => {
  57. it( 'should return true if the ranges are the same', () => {
  58. const sameStart = Position._createAt( start );
  59. const sameEnd = Position._createAt( end );
  60. const sameRange = new Range( sameStart, sameEnd );
  61. expect( range.isEqual( sameRange ) ).to.be.true;
  62. } );
  63. it( 'should return false if the start position is different', () => {
  64. const range = new Range( start, end );
  65. const diffStart = new Position( root, [ 0 ] );
  66. const sameEnd = Position._createAt( end );
  67. const diffRange = new Range( diffStart, sameEnd );
  68. expect( range.isEqual( diffRange ) ).to.be.false;
  69. } );
  70. it( 'should return false if the end position is different', () => {
  71. const sameStart = new Position( root, [ 0 ] );
  72. const diffEnd = new Position( root, [ 0 ] );
  73. const diffRange = new Range( sameStart, diffEnd );
  74. expect( range.isEqual( diffRange ) ).to.be.false;
  75. } );
  76. it( 'should return false if ranges are in different roots', () => {
  77. const otherRootStart = new Position( otherRoot, start.path.slice() );
  78. const otherRootEnd = new Position( otherRoot, end.path.slice() );
  79. const otherRootRange = new Range( otherRootStart, otherRootEnd );
  80. expect( range.isEqual( otherRootRange ) ).to.be.false;
  81. } );
  82. } );
  83. describe( 'isIntersecting()', () => {
  84. it( 'should return true if given range is equal', () => {
  85. const otherRange = range.clone();
  86. expect( range.isIntersecting( otherRange ) ).to.be.true;
  87. } );
  88. it( 'should return true if given range contains this range', () => {
  89. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 3 ] ) );
  90. expect( range.isIntersecting( otherRange ) ).to.be.true;
  91. } );
  92. it( 'should return true if given range ends in this range', () => {
  93. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1, 4 ] ) );
  94. expect( range.isIntersecting( otherRange ) ).to.be.true;
  95. } );
  96. it( 'should return true if given range starts in this range', () => {
  97. const otherRange = new Range( new Position( root, [ 1, 4 ] ), new Position( root, [ 3 ] ) );
  98. expect( range.isIntersecting( otherRange ) ).to.be.true;
  99. } );
  100. it( 'should return false if given range is fully before this range', () => {
  101. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  102. expect( range.isIntersecting( otherRange ) ).to.be.false;
  103. } );
  104. it( 'should return false if given range is fully after this range', () => {
  105. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 2, 0 ] ) );
  106. expect( range.isIntersecting( otherRange ) ).to.be.false;
  107. } );
  108. it( 'should return false if ranges are in different roots', () => {
  109. const otherRange = new Range( new Position( otherRoot, [ 0 ] ), new Position( otherRoot, [ 1, 4 ] ) );
  110. expect( range.isIntersecting( otherRange ) ).to.be.false;
  111. } );
  112. } );
  113. describe( 'static constructors', () => {
  114. let p;
  115. // root
  116. // |- p
  117. // |- foz
  118. beforeEach( () => {
  119. p = new Element( 'p', [], new Text( 'foz' ) );
  120. root._insertChild( 0, [ p ] );
  121. } );
  122. describe( '_createIn()', () => {
  123. it( 'should return range', () => {
  124. const range = Range._createIn( p );
  125. expect( range.start.path ).to.deep.equal( [ 0, 0 ] );
  126. expect( range.end.path ).to.deep.equal( [ 0, 3 ] );
  127. } );
  128. } );
  129. describe( '_createOn()', () => {
  130. it( 'should return range', () => {
  131. const range = Range._createOn( p );
  132. expect( range.start.path ).to.deep.equal( [ 0 ] );
  133. expect( range.end.path ).to.deep.equal( [ 1 ] );
  134. } );
  135. } );
  136. describe( '_createFromPositionAndShift()', () => {
  137. it( 'should make range from start position and offset', () => {
  138. const position = new Position( root, [ 1, 2, 3 ] );
  139. const range = Range._createFromPositionAndShift( position, 4 );
  140. expect( range ).to.be.instanceof( Range );
  141. expect( range.start.isEqual( position ) ).to.be.true;
  142. expect( range.end.root ).to.equal( range.start.root );
  143. expect( range.end.path ).to.deep.equal( [ 1, 2, 7 ] );
  144. } );
  145. } );
  146. describe( '_createFromRange()', () => {
  147. it( 'should create a new instance of Range that is equal to passed range', () => {
  148. const clone = range.clone();
  149. expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
  150. expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
  151. } );
  152. } );
  153. describe( '_createFromRanges()', () => {
  154. function makeRanges( root, ...points ) {
  155. const ranges = [];
  156. for ( let i = 0; i < points.length; i += 2 ) {
  157. ranges.push( new Range( Position._createAt( root, points[ i ] ), Position._createAt( root, points[ i + 1 ] ) ) );
  158. }
  159. return ranges;
  160. }
  161. beforeEach( () => {
  162. root._appendChild( new Text( 'abcdefghijklmnopqrtuvwxyz' ) );
  163. } );
  164. it( 'should throw if empty array is passed', () => {
  165. expect( () => {
  166. Range._createFromRanges( [] );
  167. } ).to.throw( CKEditorError, /^range-create-from-ranges-empty-array/ );
  168. } );
  169. it( 'should return a copy of the range if only one range was passed', () => {
  170. const original = new Range( Position._createAt( root, 2 ), Position._createAt( root, 3 ) );
  171. const range = Range._createFromRanges( [ original ] );
  172. expect( range.isEqual( original ) ).to.be.true;
  173. expect( range ).not.to.be.equal( original );
  174. } );
  175. it( 'should combine ranges with reference range', () => {
  176. const range = Range._createFromRanges( makeRanges( root, 3, 7, 2, 3, 7, 9, 11, 14, 0, 1 ) );
  177. expect( range.start.offset ).to.equal( 2 );
  178. expect( range.end.offset ).to.equal( 9 );
  179. } );
  180. } );
  181. } );
  182. describe( 'iterator', () => {
  183. it( 'should iterate over the range returning tree walker values', () => {
  184. prepareRichRoot( root );
  185. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  186. const nodes = Array.from( range ).map( value => value.item );
  187. const lengths = Array.from( range ).map( value => value.length );
  188. const nodeNames = mapNodesToNames( nodes );
  189. expect( nodeNames ).to.deep.equal(
  190. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  191. expect( lengths ).to.deep.equal( [ 2, 1, 11, 1, 3, 1, 3, 1, 1, 2 ] );
  192. } );
  193. } );
  194. describe( 'getWalker()', () => {
  195. it( 'should be possible to iterate using this method', () => {
  196. prepareRichRoot( root );
  197. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  198. const items = [];
  199. const walker = range.getWalker();
  200. for ( const value of walker ) {
  201. items.push( value.item );
  202. }
  203. expect( mapNodesToNames( items ) ).to.deep.equal(
  204. [ 'T:st', 'E:h', 'E:p', 'T:lorem ipsum', 'E:p', 'E:div', 'E:p',
  205. 'T:foo', 'E:p', 'E:p', 'T:bar', 'E:p', 'E:div', 'E:h', 'T:se' ] );
  206. } );
  207. it( 'should return treewalker with given options', () => {
  208. prepareRichRoot( root );
  209. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  210. const walker = range.getWalker( { singleCharacters: true } );
  211. expect( walker ).to.be.instanceof( TreeWalker );
  212. expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
  213. expect( walker ).to.have.property( 'boundaries' ).that.equals( range );
  214. expect( walker ).to.have.property( 'shallow' ).that.is.false;
  215. } );
  216. } );
  217. describe( 'getItems()', () => {
  218. it( 'should iterate over all items in the range', () => {
  219. prepareRichRoot( root );
  220. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  221. const items = Array.from( range.getItems() );
  222. const nodeNames = mapNodesToNames( items );
  223. expect( nodeNames ).to.deep.equal(
  224. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  225. } );
  226. it( 'should iterate over all items in the range as single characters', () => {
  227. const a = new Text( 'a' );
  228. const b = new Text( 'b' );
  229. const x = new Text( 'x' );
  230. const y = new Text( 'y' );
  231. const e1 = new Element( 'e1' );
  232. const e2 = new Element( 'e2' );
  233. e1._insertChild( 0, [ a, b ] );
  234. e2._insertChild( 0, [ x, y ] );
  235. root._insertChild( 0, [ e1, e2 ] );
  236. const range = new Range(
  237. new Position( root, [ 0, 1 ] ),
  238. new Position( root, [ 1, 1 ] )
  239. );
  240. const items = Array.from( range.getItems( { singleCharacters: true } ) );
  241. expect( items.length ).to.equal( 3 );
  242. expect( items[ 0 ].data ).to.equal( 'b' );
  243. expect( items[ 1 ] ).to.equal( e2 );
  244. expect( items[ 2 ].data ).to.equal( 'x' );
  245. } );
  246. } );
  247. describe( 'getPositions()', () => {
  248. beforeEach( () => {
  249. prepareRichRoot( root );
  250. } );
  251. it( 'should iterate over all positions in this range', () => {
  252. const expectedPaths = [
  253. [ 1, 2 ], [ 1, 3 ],
  254. [ 2 ], [ 2, 0 ], [ 2, 3 ],
  255. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
  256. ];
  257. const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  258. let i = 0;
  259. for ( const position of range.getPositions() ) {
  260. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  261. i++;
  262. }
  263. expect( i ).to.equal( expectedPaths.length );
  264. } );
  265. it( 'should return single nodes iterating over all positions in this range', () => {
  266. const expectedPaths = [
  267. [ 1, 2 ], [ 1, 3 ],
  268. [ 2 ], [ 2, 0 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ],
  269. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ]
  270. ];
  271. const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  272. let i = 0;
  273. for ( const position of range.getPositions( { singleCharacters: true } ) ) {
  274. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  275. i++;
  276. }
  277. expect( i ).to.equal( expectedPaths.length );
  278. } );
  279. } );
  280. describe( 'containsPosition()', () => {
  281. beforeEach( () => {
  282. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  283. } );
  284. it( 'should return false if position is before range', () => {
  285. const position = new Position( root, [ 0, 4 ] );
  286. expect( range.containsPosition( position ) ).to.be.false;
  287. } );
  288. it( 'should return false if position is after range', () => {
  289. const position = new Position( root, [ 3, 0 ] );
  290. expect( range.containsPosition( position ) ).to.be.false;
  291. } );
  292. it( 'should return true if position is inside range', () => {
  293. const position = new Position( root, [ 2, 2 ] );
  294. expect( range.containsPosition( position ) ).to.be.true;
  295. } );
  296. } );
  297. describe( 'containsRange()', () => {
  298. beforeEach( () => {
  299. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  300. } );
  301. it( 'should return true if ranges are equal and check is not strict', () => {
  302. const otherRange = range.clone();
  303. expect( range.containsRange( otherRange, true ) ).to.be.true;
  304. } );
  305. it( 'should return true if ranges start at the same position and check is not strict', () => {
  306. const otherRange = new Range( range.start, new Position( root, [ 2 ] ) );
  307. expect( range.containsRange( otherRange, true ) ).to.be.true;
  308. } );
  309. it( 'should return true if ranges end at the same position and check is not strict', () => {
  310. const otherRange = new Range( new Position( root, [ 2 ] ), range.end );
  311. expect( range.containsRange( otherRange, true ) ).to.be.true;
  312. } );
  313. it( 'should return false if given range is collapsed and starts or ends at another range boundary', () => {
  314. expect( range.containsRange( new Range( range.start, range.start ) ) ).to.be.false;
  315. expect( range.containsRange( new Range( range.end, range.end ) ) ).to.be.false;
  316. // Collapsed range should always be checked in strict mode.
  317. expect( range.containsRange( new Range( range.start, range.start ), true ) ).to.be.false;
  318. expect( range.containsRange( new Range( range.end, range.end ), true ) ).to.be.false;
  319. } );
  320. } );
  321. describe( 'containsItem()', () => {
  322. let a, b, c, d, xxx;
  323. beforeEach( () => {
  324. a = new Element( 'a' );
  325. b = new Element( 'b' );
  326. c = new Element( 'c' );
  327. d = new Element( 'd' );
  328. xxx = new Text( 'xxx' );
  329. b._appendChild( xxx );
  330. root._appendChild( [ a, b, c, d ] );
  331. } );
  332. it( 'should return true if element is inside range and false when it is not inside range', () => {
  333. const range = new Range( Position._createAt( root, 1 ), Position._createAt( root, 3 ) ); // Range over `b` and `c`.
  334. expect( range.containsItem( a ) ).to.be.false;
  335. expect( range.containsItem( b ) ).to.be.true;
  336. expect( range.containsItem( xxx ) ).to.be.true;
  337. expect( range.containsItem( c ) ).to.be.true;
  338. expect( range.containsItem( d ) ).to.be.false;
  339. } );
  340. } );
  341. describe( '_getTransformedByInsertion()', () => {
  342. it( 'should return an array of Range objects', () => {
  343. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  344. const transformed = range._getTransformedByInsertion( new Position( root, [ 2 ] ), 2 );
  345. expect( transformed ).to.be.instanceof( Array );
  346. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  347. } );
  348. it( 'should update it\'s positions offsets if insertion is before range and they are affected', () => {
  349. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  350. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 2 );
  351. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  352. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  353. } );
  354. it( 'should update it\'s positions paths if insertion is before range and they are affected', () => {
  355. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  356. const transformed = range._getTransformedByInsertion( new Position( root, [ 0 ] ), 2 );
  357. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  358. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  359. } );
  360. it( 'should expand range if insertion was in the middle of range', () => {
  361. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  362. const transformed = range._getTransformedByInsertion( new Position( root, [ 5, 0 ] ), 4 );
  363. expect( transformed.length ).to.equal( 1 );
  364. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  365. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  366. } );
  367. it( 'should return array with two ranges if insertion was in the middle of range and spread flag was set', () => {
  368. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  369. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 1, 6 ] ), 4, true );
  370. expect( transformed.length ).to.equal( 2 );
  371. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  372. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 1, 6 ] );
  373. expect( transformed[ 1 ].start.path ).to.deep.equal( [ 4, 1, 10 ] );
  374. expect( transformed[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  375. } );
  376. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  377. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  378. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3 );
  379. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  380. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  381. } );
  382. it( 'should not update positions if insertion is before range (but not equal to the start boundary)', () => {
  383. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  384. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 3 );
  385. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  386. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  387. } );
  388. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  389. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  390. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3 );
  391. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  392. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  393. } );
  394. it( 'should not update positions if insertion is after range (but not equal to the end boundary)', () => {
  395. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  396. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 5 ] ), 3 );
  397. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  398. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  399. } );
  400. } );
  401. describe( '_getTransformedByMove()', () => {
  402. it( 'should return an array of Range objects', () => {
  403. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  404. const transformed = range._getTransformedByMove( new Position( root, [ 2 ] ), new Position( root, [ 5 ] ), 2 );
  405. expect( transformed ).to.be.instanceof( Array );
  406. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  407. } );
  408. it( 'should update it\'s positions offsets if target is before range and they are affected', () => {
  409. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  410. const transformed = range._getTransformedByMove( new Position( root, [ 8, 1 ] ), new Position( root, [ 3, 1 ] ), 2 );
  411. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  412. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  413. } );
  414. it( 'should update it\'s positions paths if target is before range and they are affected', () => {
  415. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  416. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 0 ] ), 2 );
  417. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  418. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  419. } );
  420. it( 'should expand range if target was in the middle of range', () => {
  421. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  422. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 5, 0 ] ), 4 );
  423. expect( transformed.length ).to.equal( 1 );
  424. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  425. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  426. } );
  427. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  428. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  429. const transformed = range._getTransformedByMove( new Position( root, [ 8, 2 ] ), new Position( root, [ 3, 2 ] ), 3 );
  430. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  431. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  432. } );
  433. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  434. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  435. const transformed = range._getTransformedByMove( new Position( root, [ 8, 4 ] ), new Position( root, [ 4, 4 ] ), 3 );
  436. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  437. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  438. } );
  439. it( 'should update it\'s positions offsets if source is before range and they are affected', () => {
  440. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  441. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 8, 1 ] ), 2 );
  442. expect( transformed[ 0 ].start.offset ).to.equal( 0 );
  443. expect( transformed[ 0 ].end.offset ).to.equal( 2 );
  444. } );
  445. it( 'should update it\'s positions paths if source is before range and they are affected', () => {
  446. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  447. const transformed = range._getTransformedByMove( new Position( root, [ 0 ] ), new Position( root, [ 8 ] ), 2 );
  448. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 1 );
  449. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 2 );
  450. } );
  451. it( 'should shrink range if source was in the middle of range', () => {
  452. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  453. const transformed = range._getTransformedByMove( new Position( root, [ 5, 0 ] ), new Position( root, [ 8 ] ), 4 );
  454. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  455. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 0 ] );
  456. } );
  457. it( 'should shrink range if source contained range start position', () => {
  458. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  459. const transformed = range._getTransformedByMove( new Position( root, [ 3, 1 ] ), new Position( root, [ 8 ] ), 2 );
  460. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 1 ] );
  461. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  462. } );
  463. it( 'should shrink range if source contained range end position', () => {
  464. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  465. const transformed = range._getTransformedByMove( new Position( root, [ 5, 3 ] ), new Position( root, [ 8 ] ), 2 );
  466. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  467. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 3 ] );
  468. } );
  469. it( 'should move range if it was contained in moved range', () => {
  470. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 7 ] ) );
  471. const transformed = range._getTransformedByMove( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ), 2 );
  472. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 4, 2 ] );
  473. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  474. } );
  475. it( 'should not stick to moved range, if the transformed range is collapsed #1', () => {
  476. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  477. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 6 ] ), 2 );
  478. expect( transformed.length ).to.equal( 1 );
  479. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 0 ] );
  480. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 0 ] );
  481. } );
  482. it( 'should not stick to moved range, if the transformed range is collapsed #2', () => {
  483. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  484. const transformed = range._getTransformedByMove( new Position( root, [ 3, 2 ] ), new Position( root, [ 6 ] ), 2 );
  485. expect( transformed.length ).to.equal( 1 );
  486. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  487. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
  488. } );
  489. } );
  490. describe( '_getTransformedByDeletion()', () => {
  491. it( 'should return a transformed range', () => {
  492. const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
  493. const transformed = range._getTransformedByDeletion( new Position( root, [ 1 ] ), 1 );
  494. expect( transformed.start.offset ).to.equal( 2 );
  495. expect( transformed.end.offset ).to.equal( 4 );
  496. } );
  497. it( 'should shrink the range if removed range was intersecting #1', () => {
  498. const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
  499. const transformed = range._getTransformedByDeletion( new Position( root, [ 2 ] ), 2 );
  500. expect( transformed.start.offset ).to.equal( 2 );
  501. expect( transformed.end.offset ).to.equal( 3 );
  502. } );
  503. it( 'should shrink the range if removed range was intersecting #2', () => {
  504. const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
  505. const transformed = range._getTransformedByDeletion( new Position( root, [ 4 ] ), 2 );
  506. expect( transformed.start.offset ).to.equal( 3 );
  507. expect( transformed.end.offset ).to.equal( 4 );
  508. } );
  509. it( 'should return null if the transformed range was contained in the removed range', () => {
  510. const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 5 ] ) );
  511. const transformed = range._getTransformedByDeletion( new Position( root, [ 2 ] ), 7 );
  512. expect( transformed ).to.be.null;
  513. } );
  514. } );
  515. describe( 'getDifference()', () => {
  516. let range;
  517. beforeEach( () => {
  518. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  519. } );
  520. it( 'should return an array of Range objects', () => {
  521. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  522. const diff = range.getDifference( otherRange );
  523. expect( diff ).to.be.instanceof( Array );
  524. expect( diff[ 0 ] ).to.be.instanceof( Range );
  525. } );
  526. it( 'should return original range if other range does not intersect with it', () => {
  527. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  528. const diff = range.getDifference( otherRange );
  529. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  530. expect( diff[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  531. } );
  532. it( 'should return shrunken range if other range intersects with it', () => {
  533. const otherRange = new Range( new Position( root, [ 4, 1 ] ), new Position( root, [ 7 ] ) );
  534. const diff = range.getDifference( otherRange );
  535. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  536. expect( diff[ 0 ].end.path ).to.deep.equal( [ 4, 1 ] );
  537. } );
  538. it( 'should return an empty array if other range contains or is same as the original range', () => {
  539. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 6 ] ) );
  540. const diff = range.getDifference( otherRange );
  541. expect( diff.length ).to.equal( 0 );
  542. } );
  543. it( 'should two ranges if other range is contained by the original range', () => {
  544. const otherRange = new Range( new Position( root, [ 3, 7 ] ), new Position( root, [ 4, 1 ] ) );
  545. const diff = range.getDifference( otherRange );
  546. expect( diff.length ).to.equal( 2 );
  547. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  548. expect( diff[ 0 ].end.path ).to.deep.equal( [ 3, 7 ] );
  549. expect( diff[ 1 ].start.path ).to.deep.equal( [ 4, 1 ] );
  550. expect( diff[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  551. } );
  552. } );
  553. describe( 'getIntersection()', () => {
  554. let range;
  555. beforeEach( () => {
  556. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  557. } );
  558. it( 'should return null if ranges do not intersect', () => {
  559. const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
  560. const common = range.getIntersection( otherRange );
  561. expect( common ).to.be.null;
  562. } );
  563. it( 'should return a range equal to the common part of ranges - original range contains the other range', () => {
  564. const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
  565. const common = range.getIntersection( otherRange );
  566. expect( common.isEqual( otherRange ) ).to.be.true;
  567. } );
  568. it( 'should return a range equal to the common part of ranges - original range is contained by the other range', () => {
  569. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
  570. const common = range.getIntersection( otherRange );
  571. expect( common.isEqual( range ) ).to.be.true;
  572. } );
  573. it( 'should return a range equal to the common part of ranges - original range intersects with the other range', () => {
  574. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
  575. const common = range.getIntersection( otherRange );
  576. expect( common.start.path ).to.deep.equal( [ 3, 2 ] );
  577. expect( common.end.path ).to.deep.equal( [ 4, 7 ] );
  578. } );
  579. it( 'should return a range equal to both ranges if both ranges are equal', () => {
  580. const otherRange = range.clone();
  581. const common = range.getIntersection( otherRange );
  582. expect( common.isEqual( range ) ).to.be.true;
  583. } );
  584. } );
  585. // Note: We don't create model element structure in these tests because this method
  586. // is used by OT so it must not check the structure.
  587. describe( 'getTransformedByOperation()', () => {
  588. let gyPos;
  589. beforeEach( () => {
  590. range = new Range( Position._createAt( root, 2 ), Position._createAt( root, 5 ) );
  591. gyPos = new Position( gy, [ 0 ] );
  592. } );
  593. function expectRange( range, startOffset, endOffset ) {
  594. expect( range.start.offset ).to.equal( startOffset );
  595. expect( range.end.offset ).to.equal( endOffset );
  596. }
  597. describe( 'by AttributeOperation', () => {
  598. it( 'nothing should change', () => {
  599. const opRange = new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) );
  600. const op = new AttributeOperation( opRange, 'key', true, false, 1 );
  601. const transformed = range.getTransformedByOperation( op );
  602. expectRange( transformed[ 0 ], 2, 5 );
  603. } );
  604. } );
  605. describe( 'by InsertOperation', () => {
  606. it( 'insert before range', () => {
  607. const op = new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
  608. const transformed = range.getTransformedByOperation( op );
  609. expectRange( transformed[ 0 ], 5, 8 );
  610. } );
  611. it( 'insert inside range', () => {
  612. const op = new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
  613. const transformed = range.getTransformedByOperation( op );
  614. expectRange( transformed[ 0 ], 2, 8 );
  615. } );
  616. it( 'insert after range', () => {
  617. const op = new InsertOperation( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
  618. const transformed = range.getTransformedByOperation( op );
  619. expectRange( transformed[ 0 ], 2, 5 );
  620. } );
  621. } );
  622. describe( 'by MarkerOperation', () => {
  623. it( 'nothing should change', () => {
  624. const op = new MarkerOperation(
  625. 'marker', null, new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) ), model.markers, true, 1
  626. );
  627. const transformed = range.getTransformedByOperation( op );
  628. expectRange( transformed[ 0 ], 2, 5 );
  629. } );
  630. } );
  631. describe( 'by MoveOperation', () => {
  632. it( 'move before range', () => {
  633. const start = new Position( root, [ 0 ] );
  634. const target = new Position( otherRoot, [ 0 ] );
  635. const op = new MoveOperation( start, 2, target, 1 );
  636. const transformed = range.getTransformedByOperation( op );
  637. expectRange( transformed[ 0 ], 0, 3 );
  638. } );
  639. it( 'move intersecting with range (and targeting before range)', () => {
  640. const start = new Position( root, [ 4 ] );
  641. const target = new Position( root, [ 0 ] );
  642. const op = new MoveOperation( start, 2, target, 1 );
  643. const transformed = range.getTransformedByOperation( op );
  644. expectRange( transformed[ 0 ], 4, 6 );
  645. expectRange( transformed[ 1 ], 0, 1 );
  646. } );
  647. it( 'move inside the range', () => {
  648. range.end.offset = 6;
  649. const start = new Position( root, [ 3 ] );
  650. const target = new Position( root, [ 5 ] );
  651. const op = new MoveOperation( start, 1, target, 1 );
  652. const transformed = range.getTransformedByOperation( op );
  653. expectRange( transformed[ 0 ], 2, 4 );
  654. expectRange( transformed[ 1 ], 4, 5 );
  655. expectRange( transformed[ 2 ], 5, 6 );
  656. } );
  657. // #877.
  658. it( 'moved element contains range start and is moved towards inside of range', () => {
  659. // Initial state:
  660. // <w><p>abc</p><p>x[x</p></w><p>d]ef</p>
  661. // Expected state after moving `<p>` out of `<w>`:
  662. // <w><p>abc</p></w><p>x[x</p><p>d]ef</p>
  663. // <w><p>abc</p>{</w>}<p>x[x</p><p>d]ef</p>
  664. const range = new Range( new Position( root, [ 0, 1, 1 ] ), new Position( root, [ 1, 1 ] ) );
  665. const op = new MoveOperation( new Position( root, [ 0, 1 ] ), 1, new Position( root, [ 1 ] ), 1 );
  666. const transformed = range.getTransformedByOperation( op );
  667. expect( transformed.length ).to.equal( 1 );
  668. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 1 ] );
  669. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
  670. } );
  671. it( 'moved element contains range end and is moved towards range', () => {
  672. // Initial state:
  673. // <p>a[bc</p><p>def</p><p>x]x</p>
  674. // Expected state after moving:
  675. // <p>a[bc</p><p>x]x</p><p>def</p>
  676. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 2, 1 ] ) );
  677. const op = new MoveOperation( new Position( root, [ 2 ] ), 1, new Position( root, [ 1 ] ), 1 );
  678. const transformed = range.getTransformedByOperation( op );
  679. expect( transformed.length ).to.equal( 1 );
  680. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  681. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  682. } );
  683. // #1358
  684. it( 'should not crash and not transform the range if move operation moves 0 nodes', () => {
  685. const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
  686. const op = new MoveOperation( new Position( root, [ 0, 1 ] ), 0, new Position( root, [ 0, 3 ] ), 1 );
  687. const transformed = range.getTransformedByOperation( op );
  688. expect( transformed.length ).to.equal( 1 );
  689. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  690. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 4 ] );
  691. } );
  692. } );
  693. describe( 'by MoveOperation to graveyard', () => {
  694. it( 'remove before range', () => {
  695. const start = new Position( root, [ 0 ] );
  696. const op = new MoveOperation( start, 2, gyPos, 1 );
  697. const transformed = range.getTransformedByOperation( op );
  698. expectRange( transformed[ 0 ], 0, 3 );
  699. } );
  700. it( 'remove intersecting with range', () => {
  701. const start = new Position( root, [ 4 ] );
  702. const op = new MoveOperation( start, 2, gyPos, 1 );
  703. const transformed = range.getTransformedByOperation( op );
  704. expectRange( transformed[ 0 ], 2, 4 );
  705. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  706. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 1 );
  707. } );
  708. it( 'remove inside the range', () => {
  709. const start = new Position( root, [ 3 ] );
  710. const op = new MoveOperation( start, 2, gyPos, 1 );
  711. const transformed = range.getTransformedByOperation( op );
  712. expectRange( transformed[ 0 ], 2, 3 );
  713. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  714. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 2 );
  715. } );
  716. } );
  717. describe( 'by RenameOperation', () => {
  718. it( 'nothing should change', () => {
  719. const op = new RenameOperation( new Position( root, [ 3 ] ), 'old', 'new', 1 );
  720. const transformed = range.getTransformedByOperation( op );
  721. expectRange( transformed[ 0 ], 2, 5 );
  722. } );
  723. } );
  724. describe( 'by SplitOperation', () => {
  725. it( 'split inside range', () => {
  726. range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
  727. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  728. const transformed = range.getTransformedByOperation( op );
  729. expect( transformed.length ).to.equal( 1 );
  730. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  731. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  732. } );
  733. it( 'split at the beginning of multi-element range', () => {
  734. range = new Range( new Position( root, [ 0, 4 ] ), new Position( root, [ 1, 2 ] ) );
  735. const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
  736. const transformed = range.getTransformedByOperation( op );
  737. expect( transformed.length ).to.equal( 1 );
  738. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 0 ] );
  739. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 2 ] );
  740. } );
  741. it( 'split inside range which starts at the beginning of split element', () => {
  742. range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 4 ] ) );
  743. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  744. const transformed = range.getTransformedByOperation( op );
  745. expect( transformed.length ).to.equal( 1 );
  746. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  747. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  748. } );
  749. it( 'split inside range which end is at the end of split element', () => {
  750. range = new Range( new Position( root, [ 0, 3 ] ), new Position( root, [ 0, 6 ] ) );
  751. const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
  752. const transformed = range.getTransformedByOperation( op );
  753. expect( transformed.length ).to.equal( 1 );
  754. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  755. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 2 ] );
  756. } );
  757. it( 'split element which has collapsed range at the end', () => {
  758. range = new Range( new Position( root, [ 0, 6 ] ), new Position( root, [ 0, 6 ] ) );
  759. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  760. const transformed = range.getTransformedByOperation( op );
  761. expect( transformed.length ).to.equal( 1 );
  762. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 3 ] );
  763. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 3 ] );
  764. } );
  765. it( 'split element which is the last element in the range', () => {
  766. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  767. const op = new SplitOperation( new Position( root, [ 2, 0 ] ), 6, gyPos, 1 );
  768. const transformed = range.getTransformedByOperation( op );
  769. expect( transformed.length ).to.equal( 1 );
  770. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1 ] );
  771. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4 ] );
  772. } );
  773. } );
  774. describe( 'by MergeOperation', () => {
  775. it( 'merge element with collapsed range', () => {
  776. range.start = new Position( root, [ 1, 0 ] );
  777. range.end = new Position( root, [ 1, 0 ] );
  778. const op = new MergeOperation(
  779. new Position( root, [ 1, 0 ] ),
  780. 4,
  781. new Position( root, [ 0, 3 ] ),
  782. gyPos,
  783. 1
  784. );
  785. const transformed = range.getTransformedByOperation( op );
  786. expect( transformed.length ).to.equal( 1 );
  787. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  788. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  789. } );
  790. it( 'merge element with collapsed range #2', () => {
  791. range.start = new Position( root, [ 1, 3 ] );
  792. range.end = new Position( root, [ 1, 3 ] );
  793. const op = new MergeOperation(
  794. new Position( root, [ 0, 0 ] ),
  795. 4,
  796. new Position( root, [ 1, 3 ] ),
  797. gyPos,
  798. 1
  799. );
  800. const transformed = range.getTransformedByOperation( op );
  801. expect( transformed.length ).to.equal( 1 );
  802. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  803. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  804. } );
  805. // #877.
  806. it( 'merge elements that contain elements with range boundaries', () => {
  807. // Initial state:
  808. // <w><p>x[x</p></w><w><p>y]y</p></w>
  809. // Expected state after merge:
  810. // <w><p>x[x</p><p>y]y</p></w>
  811. const range = new Range( new Position( root, [ 0, 0, 1 ] ), new Position( root, [ 1, 0, 1 ] ) );
  812. const op = new MergeOperation(
  813. new Position( root, [ 1, 0 ] ),
  814. 4,
  815. new Position( root, [ 0, 1 ] ),
  816. gyPos,
  817. 1
  818. );
  819. const transformed = range.getTransformedByOperation( op );
  820. expect( transformed.length ).to.equal( 1 );
  821. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  822. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 1, 1 ] );
  823. } );
  824. it( 'merge at the beginning of the range', () => {
  825. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
  826. const op = new MergeOperation(
  827. new Position( root, [ 2, 0 ] ),
  828. 4,
  829. new Position( root, [ 1, 1 ] ),
  830. gyPos,
  831. 1
  832. );
  833. const transformed = range.getTransformedByOperation( op );
  834. expect( transformed.length ).to.equal( 1 );
  835. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  836. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
  837. } );
  838. it( 'merge at the end of the range', () => {
  839. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
  840. const op = new MergeOperation(
  841. new Position( root, [ 3, 0 ] ),
  842. 4,
  843. new Position( root, [ 2, 1 ] ),
  844. gyPos,
  845. 1
  846. );
  847. const transformed = range.getTransformedByOperation( op );
  848. expect( transformed.length ).to.equal( 1 );
  849. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  850. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
  851. } );
  852. it( 'merged element is the only node in the range', () => {
  853. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 3 ] ) );
  854. const op = new MergeOperation(
  855. new Position( root, [ 2, 0 ] ),
  856. 4,
  857. new Position( root, [ 1, 1 ] ),
  858. gyPos,
  859. 1
  860. );
  861. const transformed = range.getTransformedByOperation( op );
  862. expect( transformed.length ).to.equal( 1 );
  863. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  864. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
  865. } );
  866. it( 'range start is between merged elements #1', () => {
  867. // <p>aa</p>{<p>b}b</p><p>cc</p>
  868. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 1, 1 ] ) );
  869. const op = new MergeOperation(
  870. new Position( root, [ 1, 0 ] ),
  871. 2,
  872. new Position( root, [ 0, 2 ] ),
  873. gyPos,
  874. 1
  875. );
  876. const transformed = range.getTransformedByOperation( op );
  877. expect( transformed.length ).to.equal( 1 );
  878. // <p>aa{b}b</p><p>cc</p>
  879. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  880. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  881. } );
  882. it( 'range start is between merged elements #2', () => {
  883. // <p>aa</p>{<p>cc</p><p>b}b</p>
  884. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2, 1 ] ) );
  885. const op = new MergeOperation(
  886. new Position( root, [ 2, 0 ] ),
  887. 2,
  888. new Position( root, [ 0, 2 ] ),
  889. gyPos,
  890. 1
  891. );
  892. const transformed = range.getTransformedByOperation( op );
  893. expect( transformed.length ).to.equal( 1 );
  894. // <p>aa{bb</p><p>cc</p>}
  895. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  896. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
  897. } );
  898. } );
  899. } );
  900. describe( 'getTransformedByOperations()', () => {
  901. beforeEach( () => {
  902. root._appendChild( new Text( 'foobar' ) );
  903. range = new Range( Position._createAt( root, 2 ), Position._createAt( root, 5 ) );
  904. } );
  905. function expectRange( range, startOffset, endOffset ) {
  906. expect( range.start.offset ).to.equal( startOffset );
  907. expect( range.end.offset ).to.equal( endOffset );
  908. }
  909. it( 'should return a range transformed by multiple operations', () => {
  910. const transformed = range.getTransformedByOperations( [
  911. new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
  912. new InsertOperation( new Position( root, [ 6 ] ), new Text( 'xx' ), 2 ) // Range becomes 5..10.
  913. ] );
  914. expectRange( transformed[ 0 ], 5, 10 );
  915. } );
  916. it( 'should correctly handle breaking transformed range and all range "pieces"', () => {
  917. const transformed = range.getTransformedByOperations( [
  918. new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
  919. new MoveOperation( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
  920. new InsertOperation( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
  921. new MoveOperation( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
  922. new MoveOperation( new Position( root, [ 6 ] ), 1, new Position( root, [ 1 ] ), 5 ) // Range becomes 1..2, 4..7 and 8..10.
  923. ] );
  924. expect( transformed.length ).to.equal( 3 );
  925. expectRange( transformed[ 0 ], 4, 7 );
  926. expectRange( transformed[ 1 ], 1, 2 );
  927. expectRange( transformed[ 2 ], 8, 10 );
  928. } );
  929. it( 'should return range equal to original range for empty operation set', () => {
  930. const transformed = range.getTransformedByOperations( [] );
  931. expectRange( transformed[ 0 ], 2, 5 );
  932. } );
  933. } );
  934. describe( 'getMinimalFlatRanges()', () => {
  935. beforeEach( () => {
  936. prepareRichRoot( root );
  937. } );
  938. it( 'should return empty array if range is collapsed', () => {
  939. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
  940. const flat = range.getMinimalFlatRanges();
  941. expect( flat.length ).to.equal( 0 );
  942. } );
  943. it( 'should return empty array if range does not contain any node', () => {
  944. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
  945. const flat = range.getMinimalFlatRanges();
  946. expect( flat.length ).to.equal( 0 );
  947. } );
  948. it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
  949. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  950. const flat = range.getMinimalFlatRanges();
  951. expect( flat.length ).to.equal( 4 );
  952. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
  953. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
  954. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
  955. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
  956. expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
  957. expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
  958. expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
  959. expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
  960. } );
  961. it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
  962. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
  963. const flat = range.getMinimalFlatRanges();
  964. expect( flat.length ).to.equal( 2 );
  965. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  966. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
  967. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
  968. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
  969. } );
  970. } );
  971. describe( 'isFlat', () => {
  972. beforeEach( () => {
  973. prepareRichRoot( root );
  974. } );
  975. it( 'should be true if start and end position are in the same parent', () => {
  976. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
  977. expect( range.isFlat ).to.be.true;
  978. } );
  979. it( 'should be false if start and end position are in different parents', () => {
  980. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
  981. expect( range.isFlat ).to.be.false;
  982. } );
  983. } );
  984. describe( 'toJSON()', () => {
  985. it( 'should serialize range', () => {
  986. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  987. const serialized = range.toJSON();
  988. expect( serialized ).to.deep.equal( {
  989. start: { root: 'main', path: [ 1 ], stickiness: 'toNext' },
  990. end: { root: 'main', path: [ 3 ], stickiness: 'toPrevious' }
  991. } );
  992. } );
  993. } );
  994. describe( 'fromJSON()', () => {
  995. it( 'should create range from given JSON object', () => {
  996. const serialized = range.toJSON();
  997. const deserialized = Range.fromJSON( serialized, doc );
  998. expect( deserialized ).to.deep.equal( range );
  999. } );
  1000. } );
  1001. describe( 'getCommonAncestor()', () => {
  1002. it( 'should return common ancestor for positions from Range', () => {
  1003. expect( range.getCommonAncestor() ).to.equal( root );
  1004. } );
  1005. } );
  1006. function mapNodesToNames( nodes ) {
  1007. return nodes.map( node => {
  1008. return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
  1009. } );
  1010. }
  1011. function prepareRichRoot() {
  1012. root._insertChild( 0, [
  1013. new Element( 'div', [], [
  1014. new Element( 'h', [], new Text( 'first' ) ),
  1015. new Element( 'p', [], new Text( 'lorem ipsum' ) )
  1016. ] ),
  1017. new Element( 'p', [], new Text( 'foo' ) ),
  1018. new Element( 'p', [], new Text( 'bar' ) ),
  1019. new Element( 'div', [], [
  1020. new Element( 'h', [], new Text( 'second' ) ),
  1021. new Element( 'p', [], new Text( 'lorem' ) )
  1022. ] )
  1023. ] );
  1024. }
  1025. } );