range.js 20 KB

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