8
0

range.js 29 KB

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