range.js 43 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137
  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. let 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. let sameStart = Position.createFromPosition( start );
  62. let sameEnd = Position.createFromPosition( end );
  63. let 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. let range = new Range( start, end );
  68. let diffStart = new Position( root, [ 0 ] );
  69. let sameEnd = Position.createFromPosition( end );
  70. let 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. let sameStart = new Position( root, [ 0 ] );
  75. let diffEnd = new Position( root, [ 0 ] );
  76. let 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. let otherRootStart = new Position( otherRoot, start.path.slice() );
  81. let otherRootEnd = new Position( otherRoot, end.path.slice() );
  82. let 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. let 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. let 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. let 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. let 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. let 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. let 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. let 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( 'createFromParentsAndOffsets', () => {
  140. it( 'should return range', () => {
  141. const range = Range.createFromParentsAndOffsets( root, 0, p, 2 );
  142. expect( range.start.path ).to.deep.equal( [ 0 ] );
  143. expect( range.end.path ).to.deep.equal( [ 0, 2 ] );
  144. } );
  145. } );
  146. describe( 'createFromPositionAndShift', () => {
  147. it( 'should make range from start position and offset', () => {
  148. const position = new Position( root, [ 1, 2, 3 ] );
  149. const range = Range.createFromPositionAndShift( position, 4 );
  150. expect( range ).to.be.instanceof( Range );
  151. expect( range.start.isEqual( position ) ).to.be.true;
  152. expect( range.end.root ).to.equal( range.start.root );
  153. expect( range.end.path ).to.deep.equal( [ 1, 2, 7 ] );
  154. } );
  155. } );
  156. describe( 'createFromRange', () => {
  157. it( 'should create a new instance of Range that is equal to passed range', () => {
  158. const clone = Range.createFromRange( range );
  159. expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
  160. expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
  161. } );
  162. } );
  163. describe( 'createFromRanges', () => {
  164. function makeRanges( root, ...points ) {
  165. let ranges = [];
  166. for ( let i = 0; i < points.length; i += 2 ) {
  167. ranges.push( Range.createFromParentsAndOffsets( root, points[ i ], root, points[ i + 1 ] ) );
  168. }
  169. return ranges;
  170. }
  171. beforeEach( () => {
  172. root.appendChildren( new Text( 'abcdefghijklmnopqrtuvwxyz' ) );
  173. } );
  174. it( 'should throw if empty array is passed', () => {
  175. expect( () => {
  176. Range.createFromRanges( [] );
  177. } ).to.throw( CKEditorError, /^range-create-from-ranges-empty-array/ );
  178. } );
  179. it( 'should return a copy of the range if only one range was passed', () => {
  180. const original = Range.createFromParentsAndOffsets( root, 2, root, 3 );
  181. const range = Range.createFromRanges( [ original ] );
  182. expect( range.isEqual( original ) ).to.be.true;
  183. expect( range ).not.to.be.equal( original );
  184. } );
  185. it( 'should combine ranges with reference range', () => {
  186. const range = Range.createFromRanges( makeRanges( root, 3, 7, 2, 3, 7, 9, 11, 14, 0, 1 ) );
  187. expect( range.start.offset ).to.equal( 2 );
  188. expect( range.end.offset ).to.equal( 9 );
  189. } );
  190. } );
  191. } );
  192. describe( 'iterator', () => {
  193. it( 'should iterate over the range returning tree walker values', () => {
  194. prepareRichRoot( root );
  195. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  196. let nodes = Array.from( range ).map( value => value.item );
  197. let lengths = Array.from( range ).map( value => value.length );
  198. let nodeNames = mapNodesToNames( nodes );
  199. expect( nodeNames ).to.deep.equal(
  200. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  201. expect( lengths ).to.deep.equal( [ 2, 1, 11, 1, 3, 1, 3, 1, 1, 2 ] );
  202. } );
  203. } );
  204. describe( 'getWalker', () => {
  205. it( 'should be possible to iterate using this method', () => {
  206. prepareRichRoot( root );
  207. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  208. const items = [];
  209. const walker = range.getWalker();
  210. for ( let value of walker ) {
  211. items.push( value.item );
  212. }
  213. expect( mapNodesToNames( items ) ).to.deep.equal(
  214. [ 'T:st', 'E:h', 'E:p', 'T:lorem ipsum', 'E:p', 'E:div', 'E:p',
  215. 'T:foo', 'E:p', 'E:p', 'T:bar', 'E:p', 'E:div', 'E:h', 'T:se' ] );
  216. } );
  217. it( 'should return treewalker with given options', () => {
  218. prepareRichRoot( root );
  219. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  220. const walker = range.getWalker( { singleCharacters: true } );
  221. expect( walker ).to.be.instanceof( TreeWalker );
  222. expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
  223. expect( walker ).to.have.property( 'boundaries' ).that.equals( range );
  224. expect( walker ).to.have.property( 'shallow' ).that.is.false;
  225. } );
  226. } );
  227. describe( 'getItems', () => {
  228. it( 'should iterate over all items in the range', () => {
  229. prepareRichRoot( root );
  230. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  231. let items = Array.from( range.getItems() );
  232. let nodeNames = mapNodesToNames( items );
  233. expect( nodeNames ).to.deep.equal(
  234. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  235. } );
  236. it( 'should iterate over all items in the range as single characters', () => {
  237. const a = new Text( 'a' );
  238. const b = new Text( 'b' );
  239. const x = new Text( 'x' );
  240. const y = new Text( 'y' );
  241. const e1 = new Element( 'e1' );
  242. const e2 = new Element( 'e2' );
  243. e1.insertChildren( 0, [ a, b ] );
  244. e2.insertChildren( 0, [ x, y ] );
  245. root.insertChildren( 0, [ e1, e2 ] );
  246. let range = new Range(
  247. new Position( root, [ 0, 1 ] ),
  248. new Position( root, [ 1, 1 ] )
  249. );
  250. let items = Array.from( range.getItems( { singleCharacters: true } ) );
  251. expect( items.length ).to.equal( 3 );
  252. expect( items[ 0 ].data ).to.equal( 'b' );
  253. expect( items[ 1 ] ).to.equal( e2 );
  254. expect( items[ 2 ].data ).to.equal( 'x' );
  255. } );
  256. } );
  257. describe( 'getPositions', () => {
  258. beforeEach( () => {
  259. prepareRichRoot( root );
  260. } );
  261. it( 'should iterate over all positions in this range', () => {
  262. let expectedPaths = [
  263. [ 1, 2 ], [ 1, 3 ],
  264. [ 2 ], [ 2, 0 ], [ 2, 3 ],
  265. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
  266. ];
  267. let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  268. let i = 0;
  269. for ( let position of range.getPositions() ) {
  270. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  271. i++;
  272. }
  273. expect( i ).to.equal( expectedPaths.length );
  274. } );
  275. it( 'should return single nodes iterating over all positions in this range', () => {
  276. let expectedPaths = [
  277. [ 1, 2 ], [ 1, 3 ],
  278. [ 2 ], [ 2, 0 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ],
  279. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ]
  280. ];
  281. let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  282. let i = 0;
  283. for ( let position of range.getPositions( { singleCharacters: true } ) ) {
  284. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  285. i++;
  286. }
  287. expect( i ).to.equal( expectedPaths.length );
  288. } );
  289. } );
  290. describe( 'containsPosition', () => {
  291. beforeEach( () => {
  292. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  293. } );
  294. it( 'should return false if position is before range', () => {
  295. const position = new Position( root, [ 0, 4 ] );
  296. expect( range.containsPosition( position ) ).to.be.false;
  297. } );
  298. it( 'should return false if position is after range', () => {
  299. const position = new Position( root, [ 3, 0 ] );
  300. expect( range.containsPosition( position ) ).to.be.false;
  301. } );
  302. it( 'should return true if position is inside range', () => {
  303. const position = new Position( root, [ 2, 2 ] );
  304. expect( range.containsPosition( position ) ).to.be.true;
  305. } );
  306. } );
  307. describe( '_getTransformedByInsertion', () => {
  308. it( 'should return an array of Range objects', () => {
  309. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  310. const transformed = range._getTransformedByInsertion( new Position( root, [ 2 ] ), 2 );
  311. expect( transformed ).to.be.instanceof( Array );
  312. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  313. } );
  314. it( 'should update it\'s positions offsets if insertion is before range and they are affected', () => {
  315. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  316. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 2 );
  317. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  318. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  319. } );
  320. it( 'should update it\'s positions paths if insertion is before range and they are affected', () => {
  321. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  322. const transformed = range._getTransformedByInsertion( new Position( root, [ 0 ] ), 2 );
  323. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  324. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  325. } );
  326. it( 'should expand range if insertion was in the middle of range', () => {
  327. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  328. const transformed = range._getTransformedByInsertion( new Position( root, [ 5, 0 ] ), 4 );
  329. expect( transformed.length ).to.equal( 1 );
  330. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  331. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  332. } );
  333. it( 'should return array with two ranges if insertion was in the middle of range and spread flag was set', () => {
  334. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  335. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 1, 6 ] ), 4, true );
  336. expect( transformed.length ).to.equal( 2 );
  337. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  338. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 1, 6 ] );
  339. expect( transformed[ 1 ].start.path ).to.deep.equal( [ 4, 1, 10 ] );
  340. expect( transformed[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  341. } );
  342. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  343. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  344. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3 );
  345. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  346. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  347. } );
  348. it( 'should expand range if insertion is equal to start boundary of the range and sticky flag is set', () => {
  349. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  350. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  351. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  352. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  353. } );
  354. it( 'should not update positions if insertion is before range (but not equal to the start boundary)', () => {
  355. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  356. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 3 );
  357. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  358. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  359. } );
  360. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  361. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  362. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3 );
  363. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  364. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  365. } );
  366. it( 'should expand range if insertion is equal to end boundary of the range and sticky flag is set', () => {
  367. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  368. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3, false, true );
  369. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  370. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  371. } );
  372. it( 'should not update positions if insertion is after range (but not equal to the end boundary)', () => {
  373. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  374. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 5 ] ), 3 );
  375. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  376. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  377. } );
  378. it( 'should move after inserted nodes if the range is collapsed and isSticky is true', () => {
  379. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  380. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  381. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  382. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 5 ] );
  383. } );
  384. } );
  385. describe( '_getTransformedByMove', () => {
  386. it( 'should return an array of Range objects', () => {
  387. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  388. const transformed = range._getTransformedByMove( new Position( root, [ 2 ] ), new Position( root, [ 5 ] ), 2 );
  389. expect( transformed ).to.be.instanceof( Array );
  390. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  391. } );
  392. it( 'should update it\'s positions offsets if target is before range and they are affected', () => {
  393. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  394. const transformed = range._getTransformedByMove( new Position( root, [ 8, 1 ] ), new Position( root, [ 3, 1 ] ), 2 );
  395. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  396. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  397. } );
  398. it( 'should update it\'s positions paths if target is before range and they are affected', () => {
  399. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  400. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 0 ] ), 2 );
  401. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  402. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  403. } );
  404. it( 'should expand range if target was in the middle of range', () => {
  405. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  406. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 5, 0 ] ), 4 );
  407. expect( transformed.length ).to.equal( 1 );
  408. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  409. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  410. } );
  411. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  412. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  413. const transformed = range._getTransformedByMove( new Position( root, [ 8, 2 ] ), new Position( root, [ 3, 2 ] ), 3 );
  414. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  415. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  416. } );
  417. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  418. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  419. const transformed = range._getTransformedByMove( new Position( root, [ 8, 4 ] ), new Position( root, [ 4, 4 ] ), 3 );
  420. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  421. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  422. } );
  423. it( 'should update it\'s positions offsets if source is before range and they are affected', () => {
  424. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  425. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 8, 1 ] ), 2 );
  426. expect( transformed[ 0 ].start.offset ).to.equal( 0 );
  427. expect( transformed[ 0 ].end.offset ).to.equal( 2 );
  428. } );
  429. it( 'should update it\'s positions paths if source is before range and they are affected', () => {
  430. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  431. const transformed = range._getTransformedByMove( new Position( root, [ 0 ] ), new Position( root, [ 8 ] ), 2 );
  432. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 1 );
  433. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 2 );
  434. } );
  435. it( 'should shrink range if source was in the middle of range', () => {
  436. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  437. const transformed = range._getTransformedByMove( new Position( root, [ 5, 0 ] ), new Position( root, [ 8 ] ), 4 );
  438. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  439. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 0 ] );
  440. } );
  441. it( 'should shrink range if source contained range start position', () => {
  442. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  443. const transformed = range._getTransformedByMove( new Position( root, [ 3, 1 ] ), new Position( root, [ 8 ] ), 2 );
  444. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 1 ] );
  445. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  446. } );
  447. it( 'should shrink range if source contained range end position', () => {
  448. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  449. const transformed = range._getTransformedByMove( new Position( root, [ 5, 3 ] ), new Position( root, [ 8 ] ), 2 );
  450. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  451. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 3 ] );
  452. } );
  453. it( 'should move range if it was contained in moved range', () => {
  454. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 7 ] ) );
  455. const transformed = range._getTransformedByMove( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ), 2 );
  456. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 4, 2 ] );
  457. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  458. } );
  459. it( 'should not stick to moved range, if the transformed range is collapsed #1', () => {
  460. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  461. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 6 ] ), 2 );
  462. expect( transformed.length ).to.equal( 1 );
  463. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 0 ] );
  464. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 0 ] );
  465. } );
  466. it( 'should not stick to moved range, if the transformed range is collapsed #2', () => {
  467. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  468. const transformed = range._getTransformedByMove( new Position( root, [ 3, 2 ] ), new Position( root, [ 6 ] ), 2 );
  469. expect( transformed.length ).to.equal( 1 );
  470. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  471. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
  472. } );
  473. } );
  474. describe( 'getDifference', () => {
  475. let range;
  476. beforeEach( () => {
  477. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  478. } );
  479. it( 'should return an array of Range objects', () => {
  480. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  481. const diff = range.getDifference( otherRange );
  482. expect( diff ).to.be.instanceof( Array );
  483. expect( diff[ 0 ] ).to.be.instanceof( Range );
  484. } );
  485. it( 'should return original range if other range does not intersect with it', () => {
  486. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  487. const diff = range.getDifference( otherRange );
  488. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  489. expect( diff[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  490. } );
  491. it( 'should return shrunken range if other range intersects with it', () => {
  492. const otherRange = new Range( new Position( root, [ 4, 1 ] ), new Position( root, [ 7 ] ) );
  493. const diff = range.getDifference( otherRange );
  494. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  495. expect( diff[ 0 ].end.path ).to.deep.equal( [ 4, 1 ] );
  496. } );
  497. it( 'should return an empty array if other range contains or is same as the original range', () => {
  498. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 6 ] ) );
  499. const diff = range.getDifference( otherRange );
  500. expect( diff.length ).to.equal( 0 );
  501. } );
  502. it( 'should two ranges if other range is contained by the original range', () => {
  503. const otherRange = new Range( new Position( root, [ 3, 7 ] ), new Position( root, [ 4, 1 ] ) );
  504. const diff = range.getDifference( otherRange );
  505. expect( diff.length ).to.equal( 2 );
  506. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  507. expect( diff[ 0 ].end.path ).to.deep.equal( [ 3, 7 ] );
  508. expect( diff[ 1 ].start.path ).to.deep.equal( [ 4, 1 ] );
  509. expect( diff[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  510. } );
  511. } );
  512. describe( 'getIntersection', () => {
  513. let range;
  514. beforeEach( () => {
  515. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  516. } );
  517. it( 'should return null if ranges do not intersect', () => {
  518. const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
  519. const common = range.getIntersection( otherRange );
  520. expect( common ).to.be.null;
  521. } );
  522. it( 'should return a range equal to the common part of ranges - original range contains the other range', () => {
  523. const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
  524. const common = range.getIntersection( otherRange );
  525. expect( common.isEqual( otherRange ) ).to.be.true;
  526. } );
  527. it( 'should return a range equal to the common part of ranges - original range is contained by the other range', () => {
  528. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
  529. const common = range.getIntersection( otherRange );
  530. expect( common.isEqual( range ) ).to.be.true;
  531. } );
  532. it( 'should return a range equal to the common part of ranges - original range intersects with the other range', () => {
  533. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
  534. const common = range.getIntersection( otherRange );
  535. expect( common.start.path ).to.deep.equal( [ 3, 2 ] );
  536. expect( common.end.path ).to.deep.equal( [ 4, 7 ] );
  537. } );
  538. } );
  539. describe( 'getTransformedByDelta', () => {
  540. beforeEach( () => {
  541. root.appendChildren( new Text( 'foobar' ) );
  542. range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
  543. } );
  544. function expectRange( range, startOffset, endOffset ) {
  545. expect( range.start.offset ).to.equal( startOffset );
  546. expect( range.end.offset ).to.equal( endOffset );
  547. }
  548. describe( 'by AttributeDelta', () => {
  549. it( 'nothing should change', () => {
  550. const delta = getAttributeDelta( Range.createFromParentsAndOffsets( root, 1, root, 6 ), 'key', true, false, 1 );
  551. const transformed = range.getTransformedByDelta( delta );
  552. expectRange( transformed[ 0 ], 2, 5 );
  553. } );
  554. } );
  555. describe( 'by InsertDelta', () => {
  556. it( 'insert before range', () => {
  557. const delta = getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
  558. const transformed = range.getTransformedByDelta( delta );
  559. expectRange( transformed[ 0 ], 5, 8 );
  560. } );
  561. it( 'insert inside range', () => {
  562. const delta = getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
  563. const transformed = range.getTransformedByDelta( delta );
  564. expectRange( transformed[ 0 ], 2, 8 );
  565. } );
  566. it( 'insert after range', () => {
  567. const delta = getInsertDelta( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
  568. const transformed = range.getTransformedByDelta( delta );
  569. expectRange( transformed[ 0 ], 2, 5 );
  570. } );
  571. } );
  572. describe( 'by MoveDelta', () => {
  573. it( 'move before range', () => {
  574. const start = new Position( root, [ 0 ] );
  575. const end = new Position( otherRoot, [ 0 ] );
  576. const delta = getMoveDelta( start, 2, end, 1 );
  577. const transformed = range.getTransformedByDelta( delta );
  578. expectRange( transformed[ 0 ], 0, 3 );
  579. } );
  580. it( 'move intersecting with range (and targeting before range)', () => {
  581. const start = new Position( root, [ 4 ] );
  582. const end = new Position( root, [ 0 ] );
  583. const delta = getMoveDelta( start, 2, end, 1 );
  584. const transformed = range.getTransformedByDelta( delta );
  585. expectRange( transformed[ 0 ], 4, 6 );
  586. expectRange( transformed[ 1 ], 0, 1 );
  587. } );
  588. it( 'move inside the range', () => {
  589. range.end.offset = 6;
  590. const start = new Position( root, [ 3 ] );
  591. const end = new Position( root, [ 5 ] );
  592. const delta = getMoveDelta( start, 1, end, 1 );
  593. const transformed = range.getTransformedByDelta( delta );
  594. expectRange( transformed[ 0 ], 2, 4 );
  595. expectRange( transformed[ 1 ], 5, 6 );
  596. expectRange( transformed[ 2 ], 4, 5 );
  597. } );
  598. } );
  599. describe( 'by RemoveDelta', () => {
  600. it( 'remove before range', () => {
  601. const start = new Position( root, [ 0 ] );
  602. const delta = getRemoveDelta( start, 2, 1 );
  603. const transformed = range.getTransformedByDelta( delta );
  604. expectRange( transformed[ 0 ], 0, 3 );
  605. } );
  606. it( 'remove intersecting with range', () => {
  607. const start = new Position( root, [ 4 ] );
  608. const delta = getRemoveDelta( start, 2, 1 );
  609. const transformed = range.getTransformedByDelta( delta );
  610. expectRange( transformed[ 0 ], 2, 4 );
  611. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  612. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 1 );
  613. } );
  614. it( 'remove inside the range', () => {
  615. const start = new Position( root, [ 3 ] );
  616. const delta = getRemoveDelta( start, 2, 1 );
  617. const transformed = range.getTransformedByDelta( delta );
  618. expectRange( transformed[ 0 ], 2, 3 );
  619. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  620. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 2 );
  621. } );
  622. } );
  623. describe( 'by RenameDelta', () => {
  624. it( 'nothing should change', () => {
  625. const delta = getRenameDelta( new Position( root, [ 3 ] ), 'old', 'new', 1 );
  626. const transformed = range.getTransformedByDelta( delta );
  627. expectRange( transformed[ 0 ], 2, 5 );
  628. } );
  629. } );
  630. describe( 'by SplitDelta', () => {
  631. it( 'split inside range', () => {
  632. root.removeChildren( root.childCount );
  633. root.appendChildren( new Element( 'p', null, new Text( 'foobar' ) ) );
  634. range.start = new Position( root, [ 0, 2 ] );
  635. range.end = new Position( root, [ 0, 4 ] );
  636. const delta = getSplitDelta( new Position( root, [ 0, 3 ] ), new Element( 'p' ), 3, 1 );
  637. const transformed = range.getTransformedByDelta( delta );
  638. expect( transformed.length ).to.equal( 1 );
  639. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  640. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  641. } );
  642. describe( 'by MergeDelta', () => {
  643. it( 'merge element with collapsed range', () => {
  644. root.removeChildren( root.childCount );
  645. root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
  646. range.start = new Position( root, [ 1, 0 ] );
  647. range.end = new Position( root, [ 1, 0 ] );
  648. const delta = getMergeDelta( new Position( root, [ 1 ] ), 3, 3, 1 );
  649. const transformed = range.getTransformedByDelta( delta );
  650. expect( transformed.length ).to.equal( 1 );
  651. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  652. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  653. } );
  654. } );
  655. describe( 'by WrapDelta', () => {
  656. it( 'maintans start position when wrapping element in which the range starts and ends', () => {
  657. root.removeChildren( root.childCount );
  658. root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
  659. // <p>f[o]o</p><p>bar</p>
  660. range.start = new Position( root, [ 0, 1 ] );
  661. range.end = new Position( root, [ 0, 2 ] );
  662. const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  663. const wrapElement = new Element( 'w' );
  664. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  665. const transformed = range.getTransformedByDelta( delta );
  666. // <w><p>f[o]o</p></w><p>bar</p>
  667. expect( transformed.length ).to.equal( 1 );
  668. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  669. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 0, 2 ] );
  670. } );
  671. it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
  672. root.removeChildren( root.childCount );
  673. root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
  674. // <p>f[oo</p><p>b]ar</p>
  675. range.start = new Position( root, [ 0, 1 ] );
  676. range.end = new Position( root, [ 1, 1 ] );
  677. const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  678. const wrapElement = new Element( 'w' );
  679. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  680. const transformed = range.getTransformedByDelta( delta );
  681. // <w><p>f[oo</p></w><p>b]ar</p>
  682. expect( transformed.length ).to.equal( 1 );
  683. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  684. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  685. } );
  686. it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
  687. root.removeChildren( root.childCount );
  688. root.appendChildren( [ new Element( 'p', null, new Text( 'foo' ) ), new Element( 'p', null, new Text( 'bar' ) ) ] );
  689. // <p>f[oo</p><p>b]ar</p>
  690. range.start = new Position( root, [ 0, 1 ] );
  691. range.end = new Position( root, [ 1, 1 ] );
  692. const wrapRange = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2 ] ) );
  693. const wrapElement = new Element( 'w' );
  694. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  695. const transformed = range.getTransformedByDelta( delta );
  696. // <p>f[oo</p><w><p>b]ar</p></w>
  697. expect( transformed.length ).to.equal( 1 );
  698. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  699. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 0, 1 ] );
  700. } );
  701. } );
  702. describe( 'by UnwrapDelta', () => {
  703. it( 'maintans start position when wrapping element in which the range starts and ends', () => {
  704. root.removeChildren( root.childCount );
  705. root.appendChildren( [
  706. new Element( 'w', null, [
  707. new Element( 'p', null, new Text( 'foo' ) )
  708. ] ),
  709. new Element( 'p', null, new Text( 'bar' ) )
  710. ] );
  711. // <w><p>f[o]o</p></w><p>bar</p>
  712. range.start = new Position( root, [ 0, 0, 1 ] );
  713. range.end = new Position( root, [ 0, 0, 2 ] );
  714. const unwrapPosition = new Position( root, [ 0 ] );
  715. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  716. const transformed = range.getTransformedByDelta( delta );
  717. // <p>f[o]o</p><p>bar</p>
  718. expect( transformed.length ).to.equal( 1 );
  719. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  720. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 2 ] );
  721. } );
  722. it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
  723. root.removeChildren( root.childCount );
  724. root.appendChildren( [
  725. new Element( 'w', null, [
  726. new Element( 'p', null, new Text( 'foo' ) )
  727. ] ),
  728. new Element( 'p', null, new Text( 'bar' ) )
  729. ] );
  730. // <w><p>f[oo</p></w><p>b]ar</p>
  731. range.start = new Position( root, [ 0, 0, 1 ] );
  732. range.end = new Position( root, [ 1, 1 ] );
  733. const unwrapPosition = new Position( root, [ 0 ] );
  734. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  735. const transformed = range.getTransformedByDelta( delta );
  736. // <p>f[oo</p><p>b]ar</p>
  737. expect( transformed.length ).to.equal( 2 );
  738. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  739. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  740. expect( transformed[ 1 ].root.rootName ).to.equal( '$graveyard' );
  741. } );
  742. it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
  743. root.removeChildren( root.childCount );
  744. root.appendChildren( [
  745. new Element( 'p', null, new Text( 'foo' ) ),
  746. new Element( 'w', null, [
  747. new Element( 'p', null, new Text( 'bar' ) )
  748. ] )
  749. ] );
  750. // <p>f[oo</p><w><p>b]ar</p></w>
  751. range.start = new Position( root, [ 0, 1 ] );
  752. range.end = new Position( root, [ 1, 0, 1 ] );
  753. const unwrapPosition = new Position( root, [ 1 ] );
  754. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  755. const transformed = range.getTransformedByDelta( delta );
  756. // <p>f[oo</p><p>b]ar</p>
  757. expect( transformed.length ).to.equal( 1 );
  758. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  759. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  760. } );
  761. } );
  762. } );
  763. } );
  764. describe( 'getTransformedByDeltas', () => {
  765. beforeEach( () => {
  766. root.appendChildren( new Text( 'foobar' ) );
  767. range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
  768. } );
  769. function expectRange( range, startOffset, endOffset ) {
  770. expect( range.start.offset ).to.equal( startOffset );
  771. expect( range.end.offset ).to.equal( endOffset );
  772. }
  773. it( 'should return a range transformed by multiple deltas', () => {
  774. const transformed = range.getTransformedByDeltas( [
  775. getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
  776. getInsertDelta( new Position( root, [ 6 ] ), new Text( 'xx' ), 2 ) // Range becomes 5..10.
  777. ] );
  778. expectRange( transformed[ 0 ], 5, 10 );
  779. } );
  780. it( 'should correctly handle breaking transformed range and all range "pieces"', () => {
  781. const transformed = range.getTransformedByDeltas( [
  782. getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
  783. getMoveDelta( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
  784. getInsertDelta( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
  785. getMoveDelta( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
  786. getMoveDelta( new Position( root, [ 6 ] ), 1, new Position( root, [ 1 ] ), 5 ) // Range becomes 1..2, 4..7 and 8..10.
  787. ] );
  788. expect( transformed.length ).to.equal( 3 );
  789. expectRange( transformed[ 0 ], 4, 7 );
  790. expectRange( transformed[ 1 ], 1, 2 );
  791. expectRange( transformed[ 2 ], 8, 10 );
  792. } );
  793. it( 'should return range equal to original range for empty delta set', () => {
  794. const transformed = range.getTransformedByDeltas( [] );
  795. expectRange( transformed[ 0 ], 2, 5 );
  796. } );
  797. } );
  798. describe( 'getMinimalFlatRanges', () => {
  799. beforeEach( () => {
  800. prepareRichRoot( root );
  801. } );
  802. it( 'should return empty array if range is collapsed', () => {
  803. let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
  804. let flat = range.getMinimalFlatRanges();
  805. expect( flat.length ).to.equal( 0 );
  806. } );
  807. it( 'should return empty array if range does not contain any node', () => {
  808. let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
  809. let flat = range.getMinimalFlatRanges();
  810. expect( flat.length ).to.equal( 0 );
  811. } );
  812. it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
  813. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  814. let flat = range.getMinimalFlatRanges();
  815. expect( flat.length ).to.equal( 4 );
  816. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
  817. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
  818. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
  819. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
  820. expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
  821. expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
  822. expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
  823. expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
  824. } );
  825. it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
  826. let range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
  827. let flat = range.getMinimalFlatRanges();
  828. expect( flat.length ).to.equal( 2 );
  829. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  830. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
  831. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
  832. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
  833. } );
  834. } );
  835. describe( 'isFlat', () => {
  836. beforeEach( () => {
  837. prepareRichRoot( root );
  838. } );
  839. it( 'should be true if start and end position are in the same parent', () => {
  840. let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
  841. expect( range.isFlat ).to.be.true;
  842. } );
  843. it( 'should be false if start and end position are in different parents', () => {
  844. let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
  845. expect( range.isFlat ).to.be.false;
  846. } );
  847. } );
  848. describe( 'fromJSON', () => {
  849. it( 'should create range from given JSON object', () => {
  850. const serialized = jsonParseStringify( range );
  851. const deserialized = Range.fromJSON( serialized, doc );
  852. expect( deserialized ).to.deep.equal( range );
  853. } );
  854. } );
  855. function mapNodesToNames( nodes ) {
  856. return nodes.map( ( node ) => {
  857. return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
  858. } );
  859. }
  860. function prepareRichRoot() {
  861. root.insertChildren( 0, [
  862. new Element( 'div', [], [
  863. new Element( 'h', [], new Text( 'first' ) ),
  864. new Element( 'p', [], new Text( 'lorem ipsum' ) )
  865. ] ),
  866. new Element( 'p', [], new Text( 'foo' ) ),
  867. new Element( 'p', [], new Text( 'bar' ) ),
  868. new Element( 'div', [], [
  869. new Element( 'h', [], new Text( 'second' ) ),
  870. new Element( 'p', [], new Text( 'lorem' ) )
  871. ] )
  872. ] );
  873. }
  874. } );