range.js 50 KB

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