range.js 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566
  1. /**
  2. * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: view */
  6. import Range from '/ckeditor5/engine/view/range.js';
  7. import Position from '/ckeditor5/engine/view/position.js';
  8. import Element from '/ckeditor5/engine/view/element.js';
  9. import DocumentFragment from '/ckeditor5/engine/view/documentfragment.js';
  10. import Text from '/ckeditor5/engine/view/text.js';
  11. import TreeWalker from '/ckeditor5/engine/view/treewalker.js';
  12. import { parse } from '/ckeditor5/engine/dev-utils/view.js';
  13. function getRange( view, options = {} ) {
  14. const { selection } = parse( view, options );
  15. return selection.getFirstRange();
  16. }
  17. describe( 'Range', () => {
  18. describe( 'constructor', () => {
  19. it( 'creates range from provided positions', () => {
  20. const start = new Position( {}, 1 );
  21. const end = new Position( {}, 2 );
  22. const range = new Range( start, end );
  23. expect( range ).to.be.an.instanceof( Range );
  24. expect( range ).to.have.property( 'start' ).that.not.equals( start );
  25. expect( range ).to.have.property( 'end' ).that.not.equals( end );
  26. expect( range.start.parent ).to.equal( start.parent );
  27. expect( range.end.parent ).to.equal( end.parent );
  28. expect( range.start.offset ).to.equal( start.offset );
  29. expect( range.end.offset ).to.equal( end.offset );
  30. } );
  31. it( 'creates collapsed range', () => {
  32. const start = new Position( {}, 1 );
  33. const range = new Range( start );
  34. expect( range.start.isEqual( start ) ).to.be.true;
  35. expect( range.isCollapsed ).to.be.true;
  36. } );
  37. } );
  38. describe( 'iterator', () => {
  39. it( 'should iterate over the range returning tree walker values', () => {
  40. const range = getRange( '<p>fo{o</p><p>bar</p><p>xy}z</p>' );
  41. const values = Array.from( range );
  42. expect( values.length ).to.equal( 5 );
  43. expect( values[ 0 ].item.data ).to.equal( 'o' );
  44. expect( values[ 1 ].item.name ).to.equal( 'p' );
  45. expect( values[ 2 ].item.data ).to.equal( 'bar' );
  46. expect( values[ 3 ].item.name ).to.equal( 'p' );
  47. expect( values[ 4 ].item.data ).to.equal( 'xy' );
  48. } );
  49. } );
  50. describe( 'isFlat', () => {
  51. it( 'should be true if range start and range end are in same parent', () => {
  52. const range = getRange( '<p>f{oo}</p><p>bar</p>' );
  53. expect( range.isFlat ).to.be.true;
  54. } );
  55. it( 'should be false if range start and range end are in different parents', () => {
  56. const range = getRange( '<p>fo{o</p><p>b}ar</p>' );
  57. expect( range.isFlat ).to.be.false;
  58. } );
  59. } );
  60. describe( 'getRoot', () => {
  61. it( 'should return root element in which range is created', () => {
  62. const viewRoot = new Element( 'div' );
  63. const range = getRange( '<p>f{oo</p><p>ba}r</p>', { rootElement: viewRoot } );
  64. expect( range.root ).to.equal( viewRoot );
  65. } );
  66. it( 'should return document fragment in which range is created', () => {
  67. const viewFrag = new DocumentFragment();
  68. const range = getRange( '<p>f{oo</p><p>ba}r</p>', { rootElement: viewFrag } );
  69. expect( range.root ).to.equal( viewFrag );
  70. } );
  71. } );
  72. describe( 'isEqual', () => {
  73. it( 'should return true for the same range', () => {
  74. const start = new Position( {}, 1 );
  75. const end = new Position( {}, 2 );
  76. const range = new Range( start, end );
  77. expect( range.isEqual( range ) ).to.be.true;
  78. } );
  79. it( 'should return true for ranges with same start and end positions', () => {
  80. const start = new Position( {}, 1 );
  81. const end = new Position( {}, 2 );
  82. const range1 = new Range( start, end );
  83. const range2 = new Range( start, end );
  84. expect( range1.isEqual( range2 ) ).to.be.true;
  85. } );
  86. it( 'should return false if start position is different', () => {
  87. const start1 = new Position( {}, 1 );
  88. const start2 = new Position( {}, 1 );
  89. const end = new Position( {}, 2 );
  90. const range1 = new Range( start1, end );
  91. const range2 = new Range( start2, end );
  92. expect( range1.isEqual( range2 ) ).to.be.false;
  93. } );
  94. it( 'should return false if end position is different', () => {
  95. const start = new Position( {}, 1 );
  96. const end1 = new Position( {}, 2 );
  97. const end2 = new Position( {}, 2 );
  98. const range1 = new Range( start, end1 );
  99. const range2 = new Range( start, end2 );
  100. expect( range1.isEqual( range2 ) ).to.be.false;
  101. } );
  102. it( 'should return false for ranges with same root and different offsets', () => {
  103. const mockObject = {};
  104. const range1 = new Range( new Position( mockObject, 0 ), new Position( mockObject, 10 ) );
  105. const range2 = new Range( new Position( mockObject, 2 ), new Position( mockObject, 10 ) );
  106. expect( range1.isEqual( range2 ) ).to.be.false;
  107. } );
  108. } );
  109. describe( 'containsPosition', () => {
  110. let viewRoot, range;
  111. beforeEach( () => {
  112. viewRoot = new Element( 'div' );
  113. range = getRange( '<p>fo{o</p><p>bar</p><p>xy}z</p>', { rootElement: viewRoot } );
  114. } );
  115. it( 'should return false if position is before range', () => {
  116. const position = new Position( viewRoot.getChild( 0 ).getChild( 0 ), 1 ); // After "f".
  117. expect( range.containsPosition( position ) ).to.be.false;
  118. } );
  119. it( 'should return false if position is after range', () => {
  120. const position = new Position( viewRoot.getChild( 2 ).getChild( 0 ), 3 ); // After "z".
  121. expect( range.containsPosition( position ) ).to.be.false;
  122. } );
  123. it( 'should return true if position is inside range', () => {
  124. const position = new Position( viewRoot.getChild( 1 ).getChild( 0 ), 1 ); // After "b".
  125. expect( range.containsPosition( position ) ).to.be.true;
  126. } );
  127. } );
  128. describe( 'containsRange', () => {
  129. let viewRoot, range, beforeF, afterF, beforeB, afterX;
  130. beforeEach( () => {
  131. viewRoot = new Element( 'div' );
  132. range = getRange( '<p>fo{o</p><p>bar</p><p>xy}z</p>', { rootElement: viewRoot } );
  133. beforeF = new Position( viewRoot.getChild( 0 ).getChild( 0 ), 0 );
  134. afterF = new Position( viewRoot.getChild( 0 ).getChild( 0 ), 1 );
  135. beforeB = new Position( viewRoot.getChild( 1 ).getChild( 0 ), 0 );
  136. afterX = new Position( viewRoot.getChild( 2 ).getChild( 0 ), 1 );
  137. } );
  138. it( 'should return false if ranges do not intersect', () => {
  139. const otherRange = new Range( beforeF, afterF );
  140. expect( range.containsRange( otherRange ) ).to.be.false;
  141. } );
  142. it( 'should return false if ranges intersect but only partially', () => {
  143. const otherRange = new Range( afterF, afterX );
  144. expect( range.containsRange( otherRange ) ).to.be.false;
  145. } );
  146. it( 'should return false if ranges are equal', () => {
  147. const otherRange = Range.createFromRange( range );
  148. expect( range.containsRange( otherRange ) ).to.be.false;
  149. } );
  150. it( 'should return true if given range is inside range', () => {
  151. const otherRange = new Range( beforeB, afterX );
  152. expect( range.containsRange( otherRange ) ).to.be.true;
  153. } );
  154. } );
  155. describe( 'other range interaction', () => {
  156. let root, p1, p2, t1, t2, t3;
  157. // root
  158. // __________|__________
  159. // | |
  160. // ___p1___ p2
  161. // | | |
  162. // t1 t2 t3
  163. beforeEach( () => {
  164. t1 = new Text( 'foo' );
  165. t2 = new Text( 'bar' );
  166. t3 = new Text( 'baz' );
  167. p1 = new Element( 'p', null, [ t1, t2 ] );
  168. p2 = new Element( 'p', null, t3 );
  169. root = new Element( 'div', null, [ p1, p2 ] );
  170. } );
  171. describe( 'isIntersecting', () => {
  172. it( 'should return true if given range is equal', () => {
  173. const range = Range.createFromParentsAndOffsets( t1, 0, t3, 2 );
  174. const otherRange = Range.createFromRange( range );
  175. expect( range.isIntersecting( otherRange ) ).to.be.true;
  176. expect( otherRange.isIntersecting( range ) ).to.be.true;
  177. } );
  178. it( 'should return true if given range contains this range', () => {
  179. const range = Range.createFromParentsAndOffsets( t1, 0, t3, 3 );
  180. const otherRange = Range.createFromParentsAndOffsets( p1, 1, t2, 2 );
  181. expect( range.isIntersecting( otherRange ) ).to.be.true;
  182. expect( otherRange.isIntersecting( range ) ).to.be.true;
  183. } );
  184. it( 'should return true if given range ends in this range', () => {
  185. const range = Range.createFromParentsAndOffsets( root, 1, t3, 3 );
  186. const otherRange = Range.createFromParentsAndOffsets( t1, 0, p2, 0 );
  187. expect( range.isIntersecting( otherRange ) ).to.be.true;
  188. expect( otherRange.isIntersecting( range ) ).to.be.true;
  189. } );
  190. it( 'should return true if given range starts in this range', () => {
  191. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  192. const otherRange = Range.createFromParentsAndOffsets( p1, 1, p2, 0 );
  193. expect( range.isIntersecting( otherRange ) ).to.be.true;
  194. expect( otherRange.isIntersecting( range ) ).to.be.true;
  195. } );
  196. it( 'should return false if given range is fully before/after this range', () => {
  197. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  198. const otherRange = Range.createFromParentsAndOffsets( root, 1, t3, 0 );
  199. expect( range.isIntersecting( otherRange ) ).to.be.false;
  200. expect( otherRange.isIntersecting( range ) ).to.be.false;
  201. } );
  202. it( 'should return false if ranges are in different roots', () => {
  203. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  204. const otherRange = Range.createFromParentsAndOffsets( new Element( 'div' ), 1, t3, 0 );
  205. expect( range.isIntersecting( otherRange ) ).to.be.false;
  206. expect( otherRange.isIntersecting( range ) ).to.be.false;
  207. } );
  208. } );
  209. describe( 'getDifference', () => {
  210. it( 'should return range equal to original range if other range does not intersect with it', () => {
  211. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  212. const otherRange = Range.createFromParentsAndOffsets( root, 1, t3, 0 );
  213. const difference = range.getDifference( otherRange );
  214. expect( difference.length ).to.equal( 1 );
  215. expect( difference[ 0 ].isEqual( range ) ).to.be.true;
  216. } );
  217. it( 'should return shrunken range if other range intersects with it', () => {
  218. const range = Range.createFromParentsAndOffsets( root, 1, t3, 3 );
  219. const otherRange = Range.createFromParentsAndOffsets( t1, 0, p2, 0 );
  220. const difference = range.getDifference( otherRange );
  221. expect( difference.length ).to.equal( 1 );
  222. expect( difference[ 0 ].start.parent ).to.equal( p2 );
  223. expect( difference[ 0 ].start.offset ).to.equal( 0 );
  224. expect( difference[ 0 ].end.parent ).to.equal( t3 );
  225. expect( difference[ 0 ].end.offset ).to.equal( 3 );
  226. } );
  227. it( 'should return an empty array if other range contains or is same as the original range', () => {
  228. const range = Range.createFromParentsAndOffsets( p1, 1, t2, 2 );
  229. const otherRange = Range.createFromParentsAndOffsets( t1, 0, t3, 3 );
  230. const difference = range.getDifference( otherRange );
  231. expect( difference.length ).to.equal( 0 );
  232. } );
  233. it( 'should two ranges if other range is contained by the original range', () => {
  234. const range = Range.createFromParentsAndOffsets( t1, 0, t3, 3 );
  235. const otherRange = Range.createFromParentsAndOffsets( p1, 1, t2, 2 );
  236. const difference = range.getDifference( otherRange );
  237. expect( difference.length ).to.equal( 2 );
  238. expect( difference[ 0 ].start.parent ).to.equal( t1 );
  239. expect( difference[ 0 ].start.offset ).to.equal( 0 );
  240. expect( difference[ 0 ].end.parent ).to.equal( p1 );
  241. expect( difference[ 0 ].end.offset ).to.equal( 1 );
  242. expect( difference[ 1 ].start.parent ).to.equal( t2 );
  243. expect( difference[ 1 ].start.offset ).to.equal( 2 );
  244. expect( difference[ 1 ].end.parent ).to.equal( t3 );
  245. expect( difference[ 1 ].end.offset ).to.equal( 3 );
  246. } );
  247. } );
  248. describe( 'getIntersection', () => {
  249. it( 'should return range equal to original range if other range contains it', () => {
  250. const range = Range.createFromParentsAndOffsets( t2, 0, t3, 0 );
  251. const otherRange = Range.createFromParentsAndOffsets( t1, 1, t3, 1 );
  252. const intersection = range.getIntersection( otherRange );
  253. expect( intersection.isEqual( range ) ).to.be.true;
  254. } );
  255. it( 'should return range equal to other range if it is contained in original range', () => {
  256. const range = Range.createFromParentsAndOffsets( t1, 1, t3, 1 );
  257. const otherRange = Range.createFromParentsAndOffsets( t2, 0, t3, 0 );
  258. const intersection = range.getIntersection( otherRange );
  259. expect( intersection.isEqual( otherRange ) ).to.be.true;
  260. } );
  261. it( 'should return null if ranges do not intersect', () => {
  262. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  263. const otherRange = Range.createFromParentsAndOffsets( t3, 0, t3, 3 );
  264. const intersection = range.getIntersection( otherRange );
  265. expect( intersection ).to.be.null;
  266. } );
  267. it( 'should return common part if ranges intersect partially', () => {
  268. const range = Range.createFromParentsAndOffsets( t1, 0, t2, 3 );
  269. const otherRange = Range.createFromParentsAndOffsets( t2, 0, t3, 3 );
  270. const intersection = range.getIntersection( otherRange );
  271. expect( intersection.start.parent ).to.equal( t2 );
  272. expect( intersection.start.offset ).to.equal( 0 );
  273. expect( intersection.end.parent ).to.equal( t2 );
  274. expect( intersection.end.offset ).to.equal( 3 );
  275. } );
  276. } );
  277. } );
  278. describe( 'getWalker', () => {
  279. it( 'should be possible to iterate using this method', () => {
  280. const range = getRange( '<p>fo{o</p><p>ba}r</p><p>xyz</p>' );
  281. const values = [];
  282. for ( let value of range.getWalker() ) {
  283. values.push( value );
  284. }
  285. expect( values.length ).to.equal( 4 );
  286. expect( values[ 0 ].item.data ).to.equal( 'o' );
  287. expect( values[ 1 ].item.name ).to.equal( 'p' );
  288. expect( values[ 1 ].type ).to.equal( 'elementEnd' );
  289. expect( values[ 2 ].item.name ).to.equal( 'p' );
  290. expect( values[ 2 ].type ).to.equal( 'elementStart' );
  291. expect( values[ 3 ].item.data ).to.equal( 'ba' );
  292. } );
  293. it( 'should accept TreeWalker options', () => {
  294. const range = getRange( '<p>foo</p><p>b{ar</p><p>xy}z</p>' );
  295. const walker = range.getWalker( { singleCharacters: true, ignoreElementEnd: true } );
  296. const values = [];
  297. for ( let value of walker ) {
  298. values.push( value );
  299. }
  300. expect( walker ).to.be.instanceof( TreeWalker );
  301. expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
  302. expect( values.length ).to.equal( 5 );
  303. expect( values[ 0 ].item.data ).to.equal( 'a' );
  304. expect( values[ 1 ].item.data ).to.equal( 'r' );
  305. expect( values[ 2 ].item.name ).to.equal( 'p' );
  306. expect( values[ 3 ].item.data ).to.equal( 'x' );
  307. expect( values[ 4 ].item.data ).to.equal( 'y' );
  308. } );
  309. } );
  310. describe( 'getItems', () => {
  311. it( 'should return iterator that iterates over all view items in the range', () => {
  312. const range = getRange( '<p>fo{o</p><p>bar</p><p>xy}z</p>' );
  313. const nodes = [];
  314. for ( let node of range.getItems() ) {
  315. nodes.push( node );
  316. }
  317. expect( nodes.length ).to.equal( 5 );
  318. expect( nodes[ 0 ].data ).to.equal( 'o' );
  319. expect( nodes[ 1 ].name ).to.equal( 'p' );
  320. expect( nodes[ 2 ].data ).to.equal( 'bar' );
  321. expect( nodes[ 3 ].name ).to.equal( 'p' );
  322. expect( nodes[ 4 ].data ).to.equal( 'xy' );
  323. } );
  324. it( 'should accept TreeWalker options', () => {
  325. const range = getRange( '<p>foo</p><p>b{ar</p><p>xy}z</p>' );
  326. const nodes = [];
  327. for ( let node of range.getItems( { singleCharacters: true } ) ) {
  328. nodes.push( node );
  329. }
  330. expect( nodes.length ).to.equal( 5 );
  331. expect( nodes[ 0 ].data ).to.equal( 'a' );
  332. expect( nodes[ 1 ].data ).to.equal( 'r' );
  333. expect( nodes[ 2 ].name ).to.equal( 'p' );
  334. expect( nodes[ 3 ].data ).to.equal( 'x' );
  335. expect( nodes[ 4 ].data ).to.equal( 'y' );
  336. } );
  337. } );
  338. describe( 'getPositions', () => {
  339. it( 'should return iterator that iterates over all positions in the range', () => {
  340. const range = getRange( '<p>fo{o</p><p>b}ar</p><p>xyz</p>' );
  341. const positions = [];
  342. for ( let position of range.getPositions() ) {
  343. positions.push( position );
  344. }
  345. expect( positions.length ).to.equal( 5 );
  346. expect( positions[ 0 ].parent.data ).to.equal( 'foo' ); // Inside text node "foo".
  347. expect( positions[ 0 ].offset ).to.equal( 2 );
  348. expect( positions[ 1 ].parent.name ).to.equal( 'p' ); // At the end of the first P element.
  349. expect( positions[ 1 ].offset ).to.equal( 1 );
  350. expect( positions[ 2 ].parent ).to.be.instanceof( DocumentFragment ); // In document fragment, between Ps.
  351. expect( positions[ 2 ].offset ).to.equal( 1 );
  352. expect( positions[ 3 ].parent.name ).to.equal( 'p' ); // At the beginning of the second P element.
  353. expect( positions[ 3 ].offset ).to.equal( 0 );
  354. expect( positions[ 4 ].parent.data ).to.equal( 'bar' ); // Inside text node "bar".
  355. expect( positions[ 4 ].offset ).to.equal( 1 );
  356. } );
  357. it( 'should accept TreeWalker options', () => {
  358. const range = getRange( '<p>foo</p><p>b{ar</p><p>xy}z</p>' );
  359. const positions = [];
  360. for ( let position of range.getPositions( { singleCharacters: true } ) ) {
  361. positions.push( position );
  362. }
  363. expect( positions.length ).to.equal( 7 );
  364. expect( positions[ 0 ].parent.data ).to.equal( 'bar' ); // "b^ar".
  365. expect( positions[ 0 ].offset ).to.equal( 1 );
  366. expect( positions[ 1 ].parent.data ).to.equal( 'bar' ); // "ba^r".
  367. expect( positions[ 1 ].offset ).to.equal( 2 );
  368. expect( positions[ 2 ].parent.name ).to.equal( 'p' ); // <p>bar^</p> -- at the end of P node.
  369. expect( positions[ 2 ].offset ).to.equal( 1 );
  370. expect( positions[ 3 ].parent ).to.be.instanceof( DocumentFragment ); // "</p>^<p>" -- between P nodes.
  371. expect( positions[ 3 ].offset ).to.equal( 2 );
  372. expect( positions[ 4 ].parent.name ).to.equal( 'p' ); // <p>^xyz</p> -- at the start of P node.
  373. expect( positions[ 4 ].offset ).to.equal( 0 );
  374. expect( positions[ 5 ].parent.data ).to.equal( 'xyz' ); // "x^yz".
  375. expect( positions[ 5 ].offset ).to.equal( 1 );
  376. expect( positions[ 6 ].parent.data ).to.equal( 'xyz' ); // "xy^z".
  377. expect( positions[ 6 ].offset ).to.equal( 2 );
  378. } );
  379. } );
  380. describe( 'static constructors', () => {
  381. let div, p, foz;
  382. beforeEach( () => {
  383. foz = new Text( 'foz' );
  384. p = new Element( 'p', null, foz );
  385. div = new Element( 'div', null, p );
  386. } );
  387. describe( 'createIn', () => {
  388. it( 'should return range', () => {
  389. const range = Range.createIn( p );
  390. expect( range.start.parent ).to.deep.equal( p );
  391. expect( range.start.offset ).to.deep.equal( 0 );
  392. expect( range.end.parent ).to.deep.equal( p );
  393. expect( range.end.offset ).to.deep.equal( 1 );
  394. } );
  395. } );
  396. describe( 'createOn', () => {
  397. it( 'should return range', () => {
  398. const range = Range.createOn( p );
  399. expect( range.start.parent ).to.equal( div );
  400. expect( range.start.offset ).to.equal( 0 );
  401. expect( range.end.parent ).to.equal( div );
  402. expect( range.end.offset ).to.equal( 1 );
  403. } );
  404. } );
  405. describe( 'createFromParentsAndOffsets', () => {
  406. it( 'should return range', () => {
  407. const range = Range.createFromParentsAndOffsets( div, 0, foz, 1 );
  408. expect( range.start.parent ).to.deep.equal( div );
  409. expect( range.start.offset ).to.deep.equal( 0 );
  410. expect( range.end.parent ).to.deep.equal( foz );
  411. expect( range.end.offset ).to.deep.equal( 1 );
  412. } );
  413. } );
  414. describe( 'createFromPositionAndShift', () => {
  415. it( 'should make range from start position and offset', () => {
  416. const position = new Position( foz, 1 );
  417. const range = Range.createFromPositionAndShift( position, 2 );
  418. expect( range ).to.be.instanceof( Range );
  419. expect( range.start.isEqual( position ) ).to.be.true;
  420. expect( range.end.parent ).to.equal( foz );
  421. expect( range.end.offset ).to.deep.equal( 3 );
  422. } );
  423. it( 'should accept negative shift value', () => {
  424. const position = new Position( foz, 3 );
  425. const range = Range.createFromPositionAndShift( position, -1 );
  426. expect( range ).to.be.instanceof( Range );
  427. expect( range.end.isEqual( position ) ).to.be.true;
  428. expect( range.start.parent ).to.equal( foz );
  429. expect( range.start.offset ).to.deep.equal( 2 );
  430. } );
  431. } );
  432. describe( 'createFromRange', () => {
  433. it( 'should create a new instance of Range that is equal to passed range', () => {
  434. const range = new Range( new Position( foz, 0 ), new Position( foz, 2 ) );
  435. const clone = Range.createFromRange( range );
  436. expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
  437. expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
  438. } );
  439. } );
  440. } );
  441. } );