range.js 29 KB

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