range.js 50 KB

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