range.js 48 KB

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