8
0

range.js 50 KB

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