range.js 29 KB

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