range.js 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756
  1. /**
  2. * @license Copyright (c) 2003-2016, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: model */
  6. import Range from 'ckeditor5/engine/model/range.js';
  7. import Position from 'ckeditor5/engine/model/position.js';
  8. import Element from 'ckeditor5/engine/model/element.js';
  9. import Text from 'ckeditor5/engine/model/text.js';
  10. import Document from 'ckeditor5/engine/model/document.js';
  11. import TreeWalker from 'ckeditor5/engine/model/treewalker.js';
  12. import { jsonParseStringify } from 'tests/engine/model/_utils/utils.js';
  13. describe( 'Range', () => {
  14. let doc, range, start, end, root, otherRoot;
  15. beforeEach( () => {
  16. doc = new Document();
  17. root = doc.createRoot();
  18. otherRoot = doc.createRoot( '$root', 'otherRoot' );
  19. start = new Position( root, [ 1 ] );
  20. end = new Position( root, [ 2 ] );
  21. range = new Range( start, end );
  22. } );
  23. describe( 'constructor()', () => {
  24. it( 'should create a range with given positions', () => {
  25. expect( range.start.isEqual( start ) ).to.be.true;
  26. expect( range.end.isEqual( end ) ).to.be.true;
  27. } );
  28. it( 'should create collapsed range', () => {
  29. const collapsed = new Range( start );
  30. expect( collapsed.start.isEqual( start ) ).to.be.true;
  31. expect( collapsed.isCollapsed ).to.be.true;
  32. } );
  33. } );
  34. describe( 'root', () => {
  35. it( 'should be equal to start position root', () => {
  36. expect( range.root ).to.equal( start.root );
  37. } );
  38. } );
  39. describe( 'isCollapsed', () => {
  40. it( 'should be true if range start and end positions are equal', () => {
  41. let collapsedRange = new Range( start, start );
  42. expect( collapsedRange.isCollapsed ).to.be.true;
  43. } );
  44. it( 'should be false if range start and end positions are not equal', () => {
  45. expect( range.isCollapsed ).to.be.false;
  46. } );
  47. } );
  48. describe( 'isEqual', () => {
  49. it( 'should return true if the ranges are the same', () => {
  50. let sameStart = Position.createFromPosition( start );
  51. let sameEnd = Position.createFromPosition( end );
  52. let sameRange = new Range( sameStart, sameEnd );
  53. expect( range.isEqual( sameRange ) ).to.be.true;
  54. } );
  55. it( 'should return false if the start position is different', () => {
  56. let range = new Range( start, end );
  57. let diffStart = new Position( root, [ 0 ] );
  58. let sameEnd = Position.createFromPosition( end );
  59. let diffRange = new Range( diffStart, sameEnd );
  60. expect( range.isEqual( diffRange ) ).to.be.false;
  61. } );
  62. it( 'should return false if the end position is different', () => {
  63. let sameStart = new Position( root, [ 0 ] );
  64. let diffEnd = new Position( root, [ 0 ] );
  65. let diffRange = new Range( sameStart, diffEnd );
  66. expect( range.isEqual( diffRange ) ).to.be.false;
  67. } );
  68. it( 'should return false if ranges are in different roots', () => {
  69. let otherRootStart = new Position( otherRoot, start.path.slice() );
  70. let otherRootEnd = new Position( otherRoot, end.path.slice() );
  71. let otherRootRange = new Range( otherRootStart, otherRootEnd );
  72. expect( range.isEqual( otherRootRange ) ).to.be.false;
  73. } );
  74. } );
  75. describe( 'isIntersecting', () => {
  76. it( 'should return true if given range is equal', () => {
  77. let otherRange = Range.createFromRange( range );
  78. expect( range.isIntersecting( otherRange ) ).to.be.true;
  79. } );
  80. it( 'should return true if given range contains this range', () => {
  81. let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 3 ] ) );
  82. expect( range.isIntersecting( otherRange ) ).to.be.true;
  83. } );
  84. it( 'should return true if given range ends in this range', () => {
  85. let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1, 4 ] ) );
  86. expect( range.isIntersecting( otherRange ) ).to.be.true;
  87. } );
  88. it( 'should return true if given range starts in this range', () => {
  89. let otherRange = new Range( new Position( root, [ 1, 4 ] ), new Position( root, [ 3 ] ) );
  90. expect( range.isIntersecting( otherRange ) ).to.be.true;
  91. } );
  92. it( 'should return false if given range is fully before this range', () => {
  93. let otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  94. expect( range.isIntersecting( otherRange ) ).to.be.false;
  95. } );
  96. it( 'should return false if given range is fully after this range', () => {
  97. let otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 2, 0 ] ) );
  98. expect( range.isIntersecting( otherRange ) ).to.be.false;
  99. } );
  100. it( 'should return false if ranges are in different roots', () => {
  101. let otherRange = new Range( new Position( otherRoot, [ 0 ] ), new Position( otherRoot, [ 1, 4 ] ) );
  102. expect( range.isIntersecting( otherRange ) ).to.be.false;
  103. } );
  104. } );
  105. describe( 'static constructors', () => {
  106. let p;
  107. // root
  108. // |- p
  109. // |- foz
  110. beforeEach( () => {
  111. p = new Element( 'p', [], new Text( 'foz' ) );
  112. root.insertChildren( 0, [ p ] );
  113. } );
  114. describe( 'createIn', () => {
  115. it( 'should return range', () => {
  116. const range = Range.createIn( p );
  117. expect( range.start.path ).to.deep.equal( [ 0, 0 ] );
  118. expect( range.end.path ).to.deep.equal( [ 0, 3 ] );
  119. } );
  120. } );
  121. describe( 'createOn', () => {
  122. it( 'should return range', () => {
  123. const range = Range.createOn( p );
  124. expect( range.start.path ).to.deep.equal( [ 0 ] );
  125. expect( range.end.path ).to.deep.equal( [ 1 ] );
  126. } );
  127. } );
  128. describe( 'createFromParentsAndOffsets', () => {
  129. it( 'should return range', () => {
  130. const range = Range.createFromParentsAndOffsets( root, 0, p, 2 );
  131. expect( range.start.path ).to.deep.equal( [ 0 ] );
  132. expect( range.end.path ).to.deep.equal( [ 0, 2 ] );
  133. } );
  134. } );
  135. describe( 'createFromPositionAndShift', () => {
  136. it( 'should make range from start position and offset', () => {
  137. const position = new Position( root, [ 1, 2, 3 ] );
  138. const range = Range.createFromPositionAndShift( position, 4 );
  139. expect( range ).to.be.instanceof( Range );
  140. expect( range.start.isEqual( position ) ).to.be.true;
  141. expect( range.end.root ).to.equal( range.start.root );
  142. expect( range.end.path ).to.deep.equal( [ 1, 2, 7 ] );
  143. } );
  144. } );
  145. describe( 'createFromRange', () => {
  146. it( 'should create a new instance of Range that is equal to passed range', () => {
  147. const clone = Range.createFromRange( range );
  148. expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
  149. expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
  150. } );
  151. } );
  152. } );
  153. describe( 'iterator', () => {
  154. it( 'should iterate over the range returning tree walker values', () => {
  155. prepareRichRoot( root );
  156. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  157. let nodes = Array.from( range ).map( value => value.item );
  158. let lengths = Array.from( range ).map( value => value.length );
  159. let nodeNames = mapNodesToNames( nodes );
  160. expect( nodeNames ).to.deep.equal(
  161. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  162. expect( lengths ).to.deep.equal( [ 2, 1, 11, 1, 3, 1, 3, 1, 1, 2 ] );
  163. } );
  164. } );
  165. describe( 'getWalker', () => {
  166. it( 'should be possible to iterate using this method', () => {
  167. prepareRichRoot( root );
  168. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  169. const items = [];
  170. const walker = range.getWalker();
  171. for ( let value of walker ) {
  172. items.push( value.item );
  173. }
  174. expect( mapNodesToNames( items ) ).to.deep.equal(
  175. [ 'T:st', 'E:h', 'E:p', 'T:lorem ipsum', 'E:p', 'E:div', 'E:p',
  176. 'T:foo', 'E:p', 'E:p', 'T:bar', 'E:p', 'E:div', 'E:h', 'T:se' ] );
  177. } );
  178. it( 'should return treewalker with given options', () => {
  179. prepareRichRoot( root );
  180. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  181. const walker = range.getWalker( { singleCharacters: true } );
  182. expect( walker ).to.be.instanceof( TreeWalker );
  183. expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
  184. expect( walker ).to.have.property( 'boundaries' ).that.equals( range );
  185. expect( walker ).to.have.property( 'shallow' ).that.is.false;
  186. } );
  187. } );
  188. describe( 'getItems', () => {
  189. it( 'should iterate over all items in the range', () => {
  190. prepareRichRoot( root );
  191. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  192. let items = Array.from( range.getItems() );
  193. let nodeNames = mapNodesToNames( items );
  194. expect( nodeNames ).to.deep.equal(
  195. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  196. } );
  197. it( 'should iterate over all items in the range as single characters', () => {
  198. const a = new Text( 'a' );
  199. const b = new Text( 'b' );
  200. const x = new Text( 'x' );
  201. const y = new Text( 'y' );
  202. const e1 = new Element( 'e1' );
  203. const e2 = new Element( 'e2' );
  204. e1.insertChildren( 0, [ a, b ] );
  205. e2.insertChildren( 0, [ x, y ] );
  206. root.insertChildren( 0, [ e1, e2 ] );
  207. let range = new Range(
  208. new Position( root, [ 0, 1 ] ),
  209. new Position( root, [ 1, 1 ] )
  210. );
  211. let items = Array.from( range.getItems( { singleCharacters: true } ) );
  212. expect( items.length ).to.equal( 3 );
  213. expect( items[ 0 ].data ).to.equal( 'b' );
  214. expect( items[ 1 ] ).to.equal( e2 );
  215. expect( items[ 2 ].data ).to.equal( 'x' );
  216. } );
  217. } );
  218. describe( 'getPositions', () => {
  219. beforeEach( () => {
  220. prepareRichRoot( root );
  221. } );
  222. it( 'should iterate over all positions in this range', () => {
  223. let expectedPaths = [
  224. [ 1, 2 ], [ 1, 3 ],
  225. [ 2 ], [ 2, 0 ], [ 2, 3 ],
  226. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
  227. ];
  228. let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  229. let i = 0;
  230. for ( let position of range.getPositions() ) {
  231. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  232. i++;
  233. }
  234. expect( i ).to.equal( expectedPaths.length );
  235. } );
  236. it( 'should return single nodes iterating over all positions in this range', () => {
  237. let expectedPaths = [
  238. [ 1, 2 ], [ 1, 3 ],
  239. [ 2 ], [ 2, 0 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ],
  240. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ]
  241. ];
  242. let range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  243. let i = 0;
  244. for ( let position of range.getPositions( { singleCharacters: true } ) ) {
  245. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  246. i++;
  247. }
  248. expect( i ).to.equal( expectedPaths.length );
  249. } );
  250. } );
  251. describe( 'containsPosition', () => {
  252. beforeEach( () => {
  253. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  254. } );
  255. it( 'should return false if position is before range', () => {
  256. const position = new Position( root, [ 0, 4 ] );
  257. expect( range.containsPosition( position ) ).to.be.false;
  258. } );
  259. it( 'should return false if position is after range', () => {
  260. const position = new Position( root, [ 3, 0 ] );
  261. expect( range.containsPosition( position ) ).to.be.false;
  262. } );
  263. it( 'should return true if position is inside range', () => {
  264. const position = new Position( root, [ 2, 2 ] );
  265. expect( range.containsPosition( position ) ).to.be.true;
  266. } );
  267. } );
  268. describe( '_getTransformedByInsertion', () => {
  269. it( 'should return an array of Range objects', () => {
  270. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  271. const transformed = range._getTransformedByInsertion( new Position( root, [ 2 ] ), 2 );
  272. expect( transformed ).to.be.instanceof( Array );
  273. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  274. } );
  275. it( 'should update it\'s positions offsets if insertion is before range and they are affected', () => {
  276. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  277. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 2 );
  278. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  279. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  280. } );
  281. it( 'should update it\'s positions paths if insertion is before range and they are affected', () => {
  282. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  283. const transformed = range._getTransformedByInsertion( new Position( root, [ 0 ] ), 2 );
  284. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  285. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  286. } );
  287. it( 'should expand range if insertion was in the middle of range', () => {
  288. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  289. const transformed = range._getTransformedByInsertion( new Position( root, [ 5, 0 ] ), 4 );
  290. expect( transformed.length ).to.equal( 1 );
  291. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  292. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  293. } );
  294. it( 'should return array with two ranges if insertion was in the middle of range and spread flag was set', () => {
  295. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  296. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 1, 6 ] ), 4, true );
  297. expect( transformed.length ).to.equal( 2 );
  298. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  299. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 1, 6 ] );
  300. expect( transformed[ 1 ].start.path ).to.deep.equal( [ 4, 1, 10 ] );
  301. expect( transformed[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  302. } );
  303. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  304. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  305. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3 );
  306. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  307. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  308. } );
  309. it( 'should expand range if insertion is equal to start boundary of the range and sticky flag is set', () => {
  310. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  311. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  312. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  313. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  314. } );
  315. it( 'should not update positions if insertion is before range (but not equal to the start boundary)', () => {
  316. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  317. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 3 );
  318. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  319. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  320. } );
  321. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  322. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  323. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3 );
  324. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  325. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  326. } );
  327. it( 'should expand range if insertion is equal to end boundary of the range and sticky flag is set', () => {
  328. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  329. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3, false, true );
  330. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  331. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  332. } );
  333. it( 'should not update positions if insertion is after range (but not equal to the end boundary)', () => {
  334. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  335. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 5 ] ), 3 );
  336. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  337. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  338. } );
  339. it( 'should not change if the range is collapsed and isSticky is false', () => {
  340. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  341. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, false );
  342. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  343. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
  344. } );
  345. it( 'should move after inserted nodes if the range is collapsed and isSticky is true', () => {
  346. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  347. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  348. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  349. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 5 ] );
  350. } );
  351. } );
  352. describe( '_getTransformedByMove', () => {
  353. it( 'should return an array of Range objects', () => {
  354. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  355. const transformed = range._getTransformedByMove( new Position( root, [ 2 ] ), new Position( root, [ 5 ] ), 2 );
  356. expect( transformed ).to.be.instanceof( Array );
  357. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  358. } );
  359. it( 'should update it\'s positions offsets if target is before range and they are affected', () => {
  360. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  361. const transformed = range._getTransformedByMove( new Position( root, [ 8, 1 ] ), new Position( root, [ 3, 1 ] ), 2 );
  362. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  363. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  364. } );
  365. it( 'should update it\'s positions paths if target is before range and they are affected', () => {
  366. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  367. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 0 ] ), 2 );
  368. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  369. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  370. } );
  371. it( 'should expand range if target was in the middle of range', () => {
  372. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  373. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 5, 0 ] ), 4 );
  374. expect( transformed.length ).to.equal( 1 );
  375. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  376. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  377. } );
  378. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  379. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  380. const transformed = range._getTransformedByMove( new Position( root, [ 8, 2 ] ), new Position( root, [ 3, 2 ] ), 3 );
  381. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  382. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  383. } );
  384. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  385. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  386. const transformed = range._getTransformedByMove( new Position( root, [ 8, 4 ] ), new Position( root, [ 4, 4 ] ), 3 );
  387. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  388. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  389. } );
  390. it( 'should update it\'s positions offsets if source is before range and they are affected', () => {
  391. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  392. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 8, 1 ] ), 2 );
  393. expect( transformed[ 0 ].start.offset ).to.equal( 0 );
  394. expect( transformed[ 0 ].end.offset ).to.equal( 2 );
  395. } );
  396. it( 'should update it\'s positions paths if source is before range and they are affected', () => {
  397. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  398. const transformed = range._getTransformedByMove( new Position( root, [ 0 ] ), new Position( root, [ 8 ] ), 2 );
  399. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 1 );
  400. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 2 );
  401. } );
  402. it( 'should shrink range if source was in the middle of range', () => {
  403. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  404. const transformed = range._getTransformedByMove( new Position( root, [ 5, 0 ] ), new Position( root, [ 8 ] ), 4 );
  405. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  406. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 0 ] );
  407. } );
  408. it( 'should shrink range if source contained range start position', () => {
  409. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  410. const transformed = range._getTransformedByMove( new Position( root, [ 3, 1 ] ), new Position( root, [ 8 ] ), 2 );
  411. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 1 ] );
  412. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  413. } );
  414. it( 'should shrink range if source contained range end position', () => {
  415. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  416. const transformed = range._getTransformedByMove( new Position( root, [ 5, 3 ] ), new Position( root, [ 8 ] ), 2 );
  417. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  418. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 3 ] );
  419. } );
  420. it( 'should move range if it was contained in moved range', () => {
  421. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 7 ] ) );
  422. const transformed = range._getTransformedByMove( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ), 2 );
  423. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 4, 2 ] );
  424. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  425. } );
  426. } );
  427. describe( 'getDifference', () => {
  428. let range;
  429. beforeEach( () => {
  430. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  431. } );
  432. it( 'should return an array of Range objects', () => {
  433. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  434. const diff = range.getDifference( otherRange );
  435. expect( diff ).to.be.instanceof( Array );
  436. expect( diff[ 0 ] ).to.be.instanceof( Range );
  437. } );
  438. it( 'should return original range if other range does not intersect with it', () => {
  439. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  440. const diff = range.getDifference( otherRange );
  441. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  442. expect( diff[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  443. } );
  444. it( 'should return shrunken range if other range intersects with it', () => {
  445. const otherRange = new Range( new Position( root, [ 4, 1 ] ), new Position( root, [ 7 ] ) );
  446. const diff = range.getDifference( otherRange );
  447. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  448. expect( diff[ 0 ].end.path ).to.deep.equal( [ 4, 1 ] );
  449. } );
  450. it( 'should return an empty array if other range contains or is same as the original range', () => {
  451. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 6 ] ) );
  452. const diff = range.getDifference( otherRange );
  453. expect( diff.length ).to.equal( 0 );
  454. } );
  455. it( 'should two ranges if other range is contained by the original range', () => {
  456. const otherRange = new Range( new Position( root, [ 3, 7 ] ), new Position( root, [ 4, 1 ] ) );
  457. const diff = range.getDifference( otherRange );
  458. expect( diff.length ).to.equal( 2 );
  459. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  460. expect( diff[ 0 ].end.path ).to.deep.equal( [ 3, 7 ] );
  461. expect( diff[ 1 ].start.path ).to.deep.equal( [ 4, 1 ] );
  462. expect( diff[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  463. } );
  464. } );
  465. describe( 'getIntersection', () => {
  466. let range;
  467. beforeEach( () => {
  468. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  469. } );
  470. it( 'should return null if ranges do not intersect', () => {
  471. const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
  472. const common = range.getIntersection( otherRange );
  473. expect( common ).to.be.null;
  474. } );
  475. it( 'should return a range equal to the common part of ranges - original range contains the other range', () => {
  476. const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
  477. const common = range.getIntersection( otherRange );
  478. expect( common.isEqual( otherRange ) ).to.be.true;
  479. } );
  480. it( 'should return a range equal to the common part of ranges - original range is contained by the other range', () => {
  481. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
  482. const common = range.getIntersection( otherRange );
  483. expect( common.isEqual( range ) ).to.be.true;
  484. } );
  485. it( 'should return a range equal to the common part of ranges - original range intersects with the other range', () => {
  486. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
  487. const common = range.getIntersection( otherRange );
  488. expect( common.start.path ).to.deep.equal( [ 3, 2 ] );
  489. expect( common.end.path ).to.deep.equal( [ 4, 7 ] );
  490. } );
  491. } );
  492. describe( 'getMinimalFlatRanges', () => {
  493. beforeEach( () => {
  494. prepareRichRoot( root );
  495. } );
  496. it( 'should return empty array if range is collapsed', () => {
  497. let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
  498. let flat = range.getMinimalFlatRanges();
  499. expect( flat.length ).to.equal( 0 );
  500. } );
  501. it( 'should return empty array if range does not contain any node', () => {
  502. let range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
  503. let flat = range.getMinimalFlatRanges();
  504. expect( flat.length ).to.equal( 0 );
  505. } );
  506. it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
  507. let range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  508. let flat = range.getMinimalFlatRanges();
  509. expect( flat.length ).to.equal( 4 );
  510. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
  511. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
  512. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
  513. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
  514. expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
  515. expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
  516. expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
  517. expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
  518. } );
  519. it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
  520. let range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
  521. let flat = range.getMinimalFlatRanges();
  522. expect( flat.length ).to.equal( 2 );
  523. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  524. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
  525. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
  526. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
  527. } );
  528. } );
  529. describe( 'isFlat', () => {
  530. beforeEach( () => {
  531. prepareRichRoot( root );
  532. } );
  533. it( 'should be true if start and end position are in the same parent', () => {
  534. let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
  535. expect( range.isFlat ).to.be.true;
  536. } );
  537. it( 'should be false if start and end position are in different parents', () => {
  538. let range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
  539. expect( range.isFlat ).to.be.false;
  540. } );
  541. } );
  542. describe( 'fromJSON', () => {
  543. it( 'should create range from given JSON object', () => {
  544. const serialized = jsonParseStringify( range );
  545. const deserialized = Range.fromJSON( serialized, doc );
  546. expect( deserialized ).to.deep.equal( range );
  547. } );
  548. } );
  549. describe( 'isEmpty', () => {
  550. beforeEach( () => {
  551. prepareRichRoot( root );
  552. } );
  553. it( 'should be true if there are no nodes between range start and end', () => {
  554. let range = new Range( new Position( root, [ 0, 0, 5 ] ), new Position( root, [ 0, 1, 0 ] ) );
  555. expect( range.isEmpty ).to.be.true;
  556. } );
  557. it( 'should be false if there are nodes between range start and end', () => {
  558. let range = new Range( new Position( root, [ 0, 0, 5 ] ), new Position( root, [ 0, 1, 1 ] ) );
  559. expect( range.isEmpty ).to.be.false;
  560. } );
  561. } );
  562. function mapNodesToNames( nodes ) {
  563. return nodes.map( ( node ) => {
  564. return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
  565. } );
  566. }
  567. function prepareRichRoot() {
  568. root.insertChildren( 0, [
  569. new Element( 'div', [], [
  570. new Element( 'h', [], new Text( 'first' ) ),
  571. new Element( 'p', [], new Text( 'lorem ipsum' ) )
  572. ] ),
  573. new Element( 'p', [], new Text( 'foo' ) ),
  574. new Element( 'p', [], new Text( 'bar' ) ),
  575. new Element( 'div', [], [
  576. new Element( 'h', [], new Text( 'second' ) ),
  577. new Element( 'p', [], new Text( 'lorem' ) )
  578. ] )
  579. ] );
  580. }
  581. } );