range.js 51 KB

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