8
0

range.js 47 KB

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