range.js 49 KB

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