range.js 53 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373
  1. /**
  2. * @license Copyright (c) 2003-2018, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. import Range from '../../src/model/range';
  6. import Position from '../../src/model/position';
  7. import Element from '../../src/model/element';
  8. import Text from '../../src/model/text';
  9. import Model from '../../src/model/model';
  10. import TreeWalker from '../../src/model/treewalker';
  11. import MergeDelta from '../../src/model/delta/mergedelta';
  12. import MoveOperation from '../../src/model/operation/moveoperation';
  13. import RemoveOperation from '../../src/model/operation/removeoperation';
  14. import CKEditorError from '@ckeditor/ckeditor5-utils/src/ckeditorerror';
  15. import { jsonParseStringify } from '../../tests/model/_utils/utils';
  16. import {
  17. getAttributeDelta,
  18. getInsertDelta,
  19. getMoveDelta,
  20. getRemoveDelta,
  21. getRenameDelta,
  22. getSplitDelta,
  23. getMergeDelta,
  24. getWrapDelta,
  25. getUnwrapDelta
  26. } from '../../tests/model/delta/transform/_utils/utils';
  27. describe( 'Range', () => {
  28. let doc, range, start, end, root, otherRoot;
  29. beforeEach( () => {
  30. const model = new Model();
  31. doc = model.document;
  32. root = doc.createRoot();
  33. otherRoot = doc.createRoot( '$root', 'otherRoot' );
  34. start = new Position( root, [ 1 ] );
  35. end = new Position( root, [ 2 ] );
  36. range = new Range( start, end );
  37. } );
  38. describe( 'constructor()', () => {
  39. it( 'should create a range with given positions', () => {
  40. expect( range.start.isEqual( start ) ).to.be.true;
  41. expect( range.end.isEqual( end ) ).to.be.true;
  42. } );
  43. it( 'should create collapsed range', () => {
  44. const collapsed = new Range( start );
  45. expect( collapsed.start.isEqual( start ) ).to.be.true;
  46. expect( collapsed.isCollapsed ).to.be.true;
  47. } );
  48. } );
  49. describe( 'root', () => {
  50. it( 'should be equal to start position root', () => {
  51. expect( range.root ).to.equal( start.root );
  52. } );
  53. } );
  54. describe( 'isCollapsed', () => {
  55. it( 'should be true if range start and end positions are equal', () => {
  56. const collapsedRange = new Range( start, start );
  57. expect( collapsedRange.isCollapsed ).to.be.true;
  58. } );
  59. it( 'should be false if range start and end positions are not equal', () => {
  60. expect( range.isCollapsed ).to.be.false;
  61. } );
  62. } );
  63. describe( 'isEqual()', () => {
  64. it( 'should return true if the ranges are the same', () => {
  65. const sameStart = Position.createFromPosition( start );
  66. const sameEnd = Position.createFromPosition( end );
  67. const sameRange = new Range( sameStart, sameEnd );
  68. expect( range.isEqual( sameRange ) ).to.be.true;
  69. } );
  70. it( 'should return false if the start position is different', () => {
  71. const range = new Range( start, end );
  72. const diffStart = new Position( root, [ 0 ] );
  73. const sameEnd = Position.createFromPosition( end );
  74. const diffRange = new Range( diffStart, sameEnd );
  75. expect( range.isEqual( diffRange ) ).to.be.false;
  76. } );
  77. it( 'should return false if the end position is different', () => {
  78. const sameStart = new Position( root, [ 0 ] );
  79. const diffEnd = new Position( root, [ 0 ] );
  80. const diffRange = new Range( sameStart, diffEnd );
  81. expect( range.isEqual( diffRange ) ).to.be.false;
  82. } );
  83. it( 'should return false if ranges are in different roots', () => {
  84. const otherRootStart = new Position( otherRoot, start.path.slice() );
  85. const otherRootEnd = new Position( otherRoot, end.path.slice() );
  86. const otherRootRange = new Range( otherRootStart, otherRootEnd );
  87. expect( range.isEqual( otherRootRange ) ).to.be.false;
  88. } );
  89. } );
  90. describe( 'isIntersecting()', () => {
  91. it( 'should return true if given range is equal', () => {
  92. const otherRange = Range.createFromRange( range );
  93. expect( range.isIntersecting( otherRange ) ).to.be.true;
  94. } );
  95. it( 'should return true if given range contains this range', () => {
  96. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 3 ] ) );
  97. expect( range.isIntersecting( otherRange ) ).to.be.true;
  98. } );
  99. it( 'should return true if given range ends in this range', () => {
  100. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1, 4 ] ) );
  101. expect( range.isIntersecting( otherRange ) ).to.be.true;
  102. } );
  103. it( 'should return true if given range starts in this range', () => {
  104. const otherRange = new Range( new Position( root, [ 1, 4 ] ), new Position( root, [ 3 ] ) );
  105. expect( range.isIntersecting( otherRange ) ).to.be.true;
  106. } );
  107. it( 'should return false if given range is fully before this range', () => {
  108. const otherRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  109. expect( range.isIntersecting( otherRange ) ).to.be.false;
  110. } );
  111. it( 'should return false if given range is fully after this range', () => {
  112. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 2, 0 ] ) );
  113. expect( range.isIntersecting( otherRange ) ).to.be.false;
  114. } );
  115. it( 'should return false if ranges are in different roots', () => {
  116. const otherRange = new Range( new Position( otherRoot, [ 0 ] ), new Position( otherRoot, [ 1, 4 ] ) );
  117. expect( range.isIntersecting( otherRange ) ).to.be.false;
  118. } );
  119. } );
  120. describe( 'static constructors', () => {
  121. let p;
  122. // root
  123. // |- p
  124. // |- foz
  125. beforeEach( () => {
  126. p = new Element( 'p', [], new Text( 'foz' ) );
  127. root._insertChild( 0, [ p ] );
  128. } );
  129. describe( 'createIn()', () => {
  130. it( 'should return range', () => {
  131. const range = Range.createIn( p );
  132. expect( range.start.path ).to.deep.equal( [ 0, 0 ] );
  133. expect( range.end.path ).to.deep.equal( [ 0, 3 ] );
  134. } );
  135. } );
  136. describe( 'createOn()', () => {
  137. it( 'should return range', () => {
  138. const range = Range.createOn( p );
  139. expect( range.start.path ).to.deep.equal( [ 0 ] );
  140. expect( range.end.path ).to.deep.equal( [ 1 ] );
  141. } );
  142. } );
  143. describe( 'createCollapsedAt()', () => {
  144. it( 'should return new collapsed range at the given item position', () => {
  145. const item = new Element( 'p', null, new Text( 'foo' ) );
  146. const range = Range.createCollapsedAt( item );
  147. expect( range.start.parent ).to.equal( item );
  148. expect( range.start.offset ).to.equal( 0 );
  149. expect( range.isCollapsed ).to.be.true;
  150. } );
  151. it( 'should return new collapse range at the given item position and offset', () => {
  152. const item = new Element( 'p', null, new Text( 'foo' ) );
  153. const range = Range.createCollapsedAt( item, 1 );
  154. expect( range.start.parent ).to.equal( item );
  155. expect( range.start.offset ).to.equal( 1 );
  156. expect( range.isCollapsed ).to.be.true;
  157. } );
  158. } );
  159. describe( 'createFromParentsAndOffsets()', () => {
  160. it( 'should return range', () => {
  161. const range = Range.createFromParentsAndOffsets( root, 0, p, 2 );
  162. expect( range.start.path ).to.deep.equal( [ 0 ] );
  163. expect( range.end.path ).to.deep.equal( [ 0, 2 ] );
  164. } );
  165. } );
  166. describe( 'createFromPositionAndShift()', () => {
  167. it( 'should make range from start position and offset', () => {
  168. const position = new Position( root, [ 1, 2, 3 ] );
  169. const range = Range.createFromPositionAndShift( position, 4 );
  170. expect( range ).to.be.instanceof( Range );
  171. expect( range.start.isEqual( position ) ).to.be.true;
  172. expect( range.end.root ).to.equal( range.start.root );
  173. expect( range.end.path ).to.deep.equal( [ 1, 2, 7 ] );
  174. } );
  175. } );
  176. describe( 'createFromRange()', () => {
  177. it( 'should create a new instance of Range that is equal to passed range', () => {
  178. const clone = Range.createFromRange( range );
  179. expect( clone ).not.to.be.equal( range ); // clone is not pointing to the same object as position
  180. expect( clone.isEqual( range ) ).to.be.true; // but they are equal in the position-sense
  181. } );
  182. } );
  183. describe( 'createFromRanges()', () => {
  184. function makeRanges( root, ...points ) {
  185. const ranges = [];
  186. for ( let i = 0; i < points.length; i += 2 ) {
  187. ranges.push( Range.createFromParentsAndOffsets( root, points[ i ], root, points[ i + 1 ] ) );
  188. }
  189. return ranges;
  190. }
  191. beforeEach( () => {
  192. root._appendChild( new Text( 'abcdefghijklmnopqrtuvwxyz' ) );
  193. } );
  194. it( 'should throw if empty array is passed', () => {
  195. expect( () => {
  196. Range.createFromRanges( [] );
  197. } ).to.throw( CKEditorError, /^range-create-from-ranges-empty-array/ );
  198. } );
  199. it( 'should return a copy of the range if only one range was passed', () => {
  200. const original = Range.createFromParentsAndOffsets( root, 2, root, 3 );
  201. const range = Range.createFromRanges( [ original ] );
  202. expect( range.isEqual( original ) ).to.be.true;
  203. expect( range ).not.to.be.equal( original );
  204. } );
  205. it( 'should combine ranges with reference range', () => {
  206. const range = Range.createFromRanges( makeRanges( root, 3, 7, 2, 3, 7, 9, 11, 14, 0, 1 ) );
  207. expect( range.start.offset ).to.equal( 2 );
  208. expect( range.end.offset ).to.equal( 9 );
  209. } );
  210. } );
  211. } );
  212. describe( 'iterator', () => {
  213. it( 'should iterate over the range returning tree walker values', () => {
  214. prepareRichRoot( root );
  215. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  216. const nodes = Array.from( range ).map( value => value.item );
  217. const lengths = Array.from( range ).map( value => value.length );
  218. const nodeNames = mapNodesToNames( nodes );
  219. expect( nodeNames ).to.deep.equal(
  220. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  221. expect( lengths ).to.deep.equal( [ 2, 1, 11, 1, 3, 1, 3, 1, 1, 2 ] );
  222. } );
  223. } );
  224. describe( 'getWalker()', () => {
  225. it( 'should be possible to iterate using this method', () => {
  226. prepareRichRoot( root );
  227. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  228. const items = [];
  229. const walker = range.getWalker();
  230. for ( const value of walker ) {
  231. items.push( value.item );
  232. }
  233. expect( mapNodesToNames( items ) ).to.deep.equal(
  234. [ 'T:st', 'E:h', 'E:p', 'T:lorem ipsum', 'E:p', 'E:div', 'E:p',
  235. 'T:foo', 'E:p', 'E:p', 'T:bar', 'E:p', 'E:div', 'E:h', 'T:se' ] );
  236. } );
  237. it( 'should return treewalker with given options', () => {
  238. prepareRichRoot( root );
  239. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  240. const walker = range.getWalker( { singleCharacters: true } );
  241. expect( walker ).to.be.instanceof( TreeWalker );
  242. expect( walker ).to.have.property( 'singleCharacters' ).that.is.true;
  243. expect( walker ).to.have.property( 'boundaries' ).that.equals( range );
  244. expect( walker ).to.have.property( 'shallow' ).that.is.false;
  245. } );
  246. } );
  247. describe( 'getItems()', () => {
  248. it( 'should iterate over all items in the range', () => {
  249. prepareRichRoot( root );
  250. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  251. const items = Array.from( range.getItems() );
  252. const nodeNames = mapNodesToNames( items );
  253. expect( nodeNames ).to.deep.equal(
  254. [ 'T:st', 'E:p', 'T:lorem ipsum', 'E:p', 'T:foo', 'E:p', 'T:bar', 'E:div', 'E:h', 'T:se' ] );
  255. } );
  256. it( 'should iterate over all items in the range as single characters', () => {
  257. const a = new Text( 'a' );
  258. const b = new Text( 'b' );
  259. const x = new Text( 'x' );
  260. const y = new Text( 'y' );
  261. const e1 = new Element( 'e1' );
  262. const e2 = new Element( 'e2' );
  263. e1._insertChild( 0, [ a, b ] );
  264. e2._insertChild( 0, [ x, y ] );
  265. root._insertChild( 0, [ e1, e2 ] );
  266. const range = new Range(
  267. new Position( root, [ 0, 1 ] ),
  268. new Position( root, [ 1, 1 ] )
  269. );
  270. const items = Array.from( range.getItems( { singleCharacters: true } ) );
  271. expect( items.length ).to.equal( 3 );
  272. expect( items[ 0 ].data ).to.equal( 'b' );
  273. expect( items[ 1 ] ).to.equal( e2 );
  274. expect( items[ 2 ].data ).to.equal( 'x' );
  275. } );
  276. } );
  277. describe( 'getPositions()', () => {
  278. beforeEach( () => {
  279. prepareRichRoot( root );
  280. } );
  281. it( 'should iterate over all positions in this range', () => {
  282. const expectedPaths = [
  283. [ 1, 2 ], [ 1, 3 ],
  284. [ 2 ], [ 2, 0 ], [ 2, 3 ],
  285. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 2 ]
  286. ];
  287. const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  288. let i = 0;
  289. for ( const position of range.getPositions() ) {
  290. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  291. i++;
  292. }
  293. expect( i ).to.equal( expectedPaths.length );
  294. } );
  295. it( 'should return single nodes iterating over all positions in this range', () => {
  296. const expectedPaths = [
  297. [ 1, 2 ], [ 1, 3 ],
  298. [ 2 ], [ 2, 0 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ],
  299. [ 3 ], [ 3, 0 ], [ 3, 0, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ]
  300. ];
  301. const range = new Range( new Position( root, [ 1, 2 ] ), new Position( root, [ 3, 0, 2 ] ) );
  302. let i = 0;
  303. for ( const position of range.getPositions( { singleCharacters: true } ) ) {
  304. expect( position.path ).to.deep.equal( expectedPaths[ i ] );
  305. i++;
  306. }
  307. expect( i ).to.equal( expectedPaths.length );
  308. } );
  309. } );
  310. describe( 'containsPosition()', () => {
  311. beforeEach( () => {
  312. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  313. } );
  314. it( 'should return false if position is before range', () => {
  315. const position = new Position( root, [ 0, 4 ] );
  316. expect( range.containsPosition( position ) ).to.be.false;
  317. } );
  318. it( 'should return false if position is after range', () => {
  319. const position = new Position( root, [ 3, 0 ] );
  320. expect( range.containsPosition( position ) ).to.be.false;
  321. } );
  322. it( 'should return true if position is inside range', () => {
  323. const position = new Position( root, [ 2, 2 ] );
  324. expect( range.containsPosition( position ) ).to.be.true;
  325. } );
  326. } );
  327. describe( 'containsRange()', () => {
  328. beforeEach( () => {
  329. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  330. } );
  331. it( 'should return true if ranges are equal and check is not strict', () => {
  332. const otherRange = Range.createFromRange( range );
  333. expect( range.containsRange( otherRange, true ) ).to.be.true;
  334. } );
  335. it( 'should return true if ranges start at the same position and check is not strict', () => {
  336. const otherRange = new Range( range.start, new Position( root, [ 2 ] ) );
  337. expect( range.containsRange( otherRange, true ) ).to.be.true;
  338. } );
  339. it( 'should return true if ranges end at the same position and check is not strict', () => {
  340. const otherRange = new Range( new Position( root, [ 2 ] ), range.end );
  341. expect( range.containsRange( otherRange, true ) ).to.be.true;
  342. } );
  343. it( 'should return false if given range is collapsed and starts or ends at another range boundary', () => {
  344. expect( range.containsRange( new Range( range.start, range.start ) ) ).to.be.false;
  345. expect( range.containsRange( new Range( range.end, range.end ) ) ).to.be.false;
  346. // Collapsed range should always be checked in strict mode.
  347. expect( range.containsRange( new Range( range.start, range.start ), true ) ).to.be.false;
  348. expect( range.containsRange( new Range( range.end, range.end ), true ) ).to.be.false;
  349. } );
  350. } );
  351. describe( 'containsItem()', () => {
  352. let a, b, c, d, xxx;
  353. beforeEach( () => {
  354. a = new Element( 'a' );
  355. b = new Element( 'b' );
  356. c = new Element( 'c' );
  357. d = new Element( 'd' );
  358. xxx = new Text( 'xxx' );
  359. b._appendChild( xxx );
  360. root._appendChild( [ a, b, c, d ] );
  361. } );
  362. it( 'should return true if element is inside range and false when it is not inside range', () => {
  363. const range = Range.createFromParentsAndOffsets( root, 1, root, 3 ); // Range over `b` and `c`.
  364. expect( range.containsItem( a ) ).to.be.false;
  365. expect( range.containsItem( b ) ).to.be.true;
  366. expect( range.containsItem( xxx ) ).to.be.true;
  367. expect( range.containsItem( c ) ).to.be.true;
  368. expect( range.containsItem( d ) ).to.be.false;
  369. } );
  370. } );
  371. describe( '_getTransformedByInsertion()', () => {
  372. it( 'should return an array of Range objects', () => {
  373. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  374. const transformed = range._getTransformedByInsertion( new Position( root, [ 2 ] ), 2 );
  375. expect( transformed ).to.be.instanceof( Array );
  376. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  377. } );
  378. it( 'should update it\'s positions offsets if insertion is before range and they are affected', () => {
  379. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  380. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 2 );
  381. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  382. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  383. } );
  384. it( 'should update it\'s positions paths if insertion is before range and they are affected', () => {
  385. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  386. const transformed = range._getTransformedByInsertion( new Position( root, [ 0 ] ), 2 );
  387. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  388. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  389. } );
  390. it( 'should expand range if insertion was in the middle of range', () => {
  391. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  392. const transformed = range._getTransformedByInsertion( new Position( root, [ 5, 0 ] ), 4 );
  393. expect( transformed.length ).to.equal( 1 );
  394. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  395. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  396. } );
  397. it( 'should return array with two ranges if insertion was in the middle of range and spread flag was set', () => {
  398. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  399. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 1, 6 ] ), 4, true );
  400. expect( transformed.length ).to.equal( 2 );
  401. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  402. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 1, 6 ] );
  403. expect( transformed[ 1 ].start.path ).to.deep.equal( [ 4, 1, 10 ] );
  404. expect( transformed[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  405. } );
  406. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  407. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  408. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3 );
  409. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  410. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  411. } );
  412. it( 'should expand range if insertion is equal to start boundary of the range and sticky flag is set', () => {
  413. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  414. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  415. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  416. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  417. } );
  418. it( 'should not update positions if insertion is before range (but not equal to the start boundary)', () => {
  419. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  420. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 1 ] ), 3 );
  421. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  422. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  423. } );
  424. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  425. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  426. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3 );
  427. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  428. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  429. } );
  430. it( 'should expand range if insertion is equal to end boundary of the range and sticky flag is set', () => {
  431. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  432. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 4 ] ), 3, false, true );
  433. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  434. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  435. } );
  436. it( 'should not update positions if insertion is after range (but not equal to the end boundary)', () => {
  437. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  438. const transformed = range._getTransformedByInsertion( new Position( root, [ 4, 5 ] ), 3 );
  439. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  440. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  441. } );
  442. it( 'should expand range after inserted nodes if the range is collapsed and isSticky is true', () => {
  443. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  444. const transformed = range._getTransformedByInsertion( new Position( root, [ 3, 2 ] ), 3, false, true );
  445. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  446. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 5 ] );
  447. } );
  448. } );
  449. describe( '_getTransformedByMove()', () => {
  450. it( 'should return an array of Range objects', () => {
  451. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  452. const transformed = range._getTransformedByMove( new Position( root, [ 2 ] ), new Position( root, [ 5 ] ), 2 );
  453. expect( transformed ).to.be.instanceof( Array );
  454. expect( transformed[ 0 ] ).to.be.instanceof( Range );
  455. } );
  456. it( 'should update it\'s positions offsets if target is before range and they are affected', () => {
  457. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  458. const transformed = range._getTransformedByMove( new Position( root, [ 8, 1 ] ), new Position( root, [ 3, 1 ] ), 2 );
  459. expect( transformed[ 0 ].start.offset ).to.equal( 4 );
  460. expect( transformed[ 0 ].end.offset ).to.equal( 6 );
  461. } );
  462. it( 'should update it\'s positions paths if target is before range and they are affected', () => {
  463. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  464. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 0 ] ), 2 );
  465. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 5 );
  466. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 6 );
  467. } );
  468. it( 'should expand range if target was in the middle of range', () => {
  469. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  470. const transformed = range._getTransformedByMove( new Position( root, [ 8 ] ), new Position( root, [ 5, 0 ] ), 4 );
  471. expect( transformed.length ).to.equal( 1 );
  472. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  473. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 8 ] );
  474. } );
  475. it( 'should not expand range if insertion is equal to start boundary of the range', () => {
  476. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 8 ] ) );
  477. const transformed = range._getTransformedByMove( new Position( root, [ 8, 2 ] ), new Position( root, [ 3, 2 ] ), 3 );
  478. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 5 ] );
  479. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 11 ] );
  480. } );
  481. it( 'should not expand range if insertion is equal to end boundary of the range', () => {
  482. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  483. const transformed = range._getTransformedByMove( new Position( root, [ 8, 4 ] ), new Position( root, [ 4, 4 ] ), 3 );
  484. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  485. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 4 ] );
  486. } );
  487. it( 'should update it\'s positions offsets if source is before range and they are affected', () => {
  488. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 4 ] ) );
  489. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 8, 1 ] ), 2 );
  490. expect( transformed[ 0 ].start.offset ).to.equal( 0 );
  491. expect( transformed[ 0 ].end.offset ).to.equal( 2 );
  492. } );
  493. it( 'should update it\'s positions paths if source is before range and they are affected', () => {
  494. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 4, 4 ] ) );
  495. const transformed = range._getTransformedByMove( new Position( root, [ 0 ] ), new Position( root, [ 8 ] ), 2 );
  496. expect( transformed[ 0 ].start.path[ 0 ] ).to.equal( 1 );
  497. expect( transformed[ 0 ].end.path[ 0 ] ).to.equal( 2 );
  498. } );
  499. it( 'should shrink range if source was in the middle of range', () => {
  500. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  501. const transformed = range._getTransformedByMove( new Position( root, [ 5, 0 ] ), new Position( root, [ 8 ] ), 4 );
  502. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  503. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 0 ] );
  504. } );
  505. it( 'should shrink range if source contained range start position', () => {
  506. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  507. const transformed = range._getTransformedByMove( new Position( root, [ 3, 1 ] ), new Position( root, [ 8 ] ), 2 );
  508. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 1 ] );
  509. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  510. } );
  511. it( 'should shrink range if source contained range end position', () => {
  512. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  513. const transformed = range._getTransformedByMove( new Position( root, [ 5, 3 ] ), new Position( root, [ 8 ] ), 2 );
  514. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  515. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 5, 3 ] );
  516. } );
  517. it( 'should move range if it was contained in moved range', () => {
  518. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 7 ] ) );
  519. const transformed = range._getTransformedByMove( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ), 2 );
  520. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 4, 2 ] );
  521. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4, 7 ] );
  522. } );
  523. it( 'should not stick to moved range, if the transformed range is collapsed #1', () => {
  524. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  525. const transformed = range._getTransformedByMove( new Position( root, [ 3, 0 ] ), new Position( root, [ 6 ] ), 2 );
  526. expect( transformed.length ).to.equal( 1 );
  527. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 0 ] );
  528. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 0 ] );
  529. } );
  530. it( 'should not stick to moved range, if the transformed range is collapsed #2', () => {
  531. const range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 3, 2 ] ) );
  532. const transformed = range._getTransformedByMove( new Position( root, [ 3, 2 ] ), new Position( root, [ 6 ] ), 2 );
  533. expect( transformed.length ).to.equal( 1 );
  534. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  535. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3, 2 ] );
  536. } );
  537. } );
  538. describe( 'getDifference()', () => {
  539. let range;
  540. beforeEach( () => {
  541. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  542. } );
  543. it( 'should return an array of Range objects', () => {
  544. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  545. const diff = range.getDifference( otherRange );
  546. expect( diff ).to.be.instanceof( Array );
  547. expect( diff[ 0 ] ).to.be.instanceof( Range );
  548. } );
  549. it( 'should return original range if other range does not intersect with it', () => {
  550. const otherRange = new Range( new Position( root, [ 6 ] ), new Position( root, [ 7 ] ) );
  551. const diff = range.getDifference( otherRange );
  552. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  553. expect( diff[ 0 ].end.path ).to.deep.equal( [ 5, 4 ] );
  554. } );
  555. it( 'should return shrunken range if other range intersects with it', () => {
  556. const otherRange = new Range( new Position( root, [ 4, 1 ] ), new Position( root, [ 7 ] ) );
  557. const diff = range.getDifference( otherRange );
  558. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  559. expect( diff[ 0 ].end.path ).to.deep.equal( [ 4, 1 ] );
  560. } );
  561. it( 'should return an empty array if other range contains or is same as the original range', () => {
  562. const otherRange = new Range( new Position( root, [ 2 ] ), new Position( root, [ 6 ] ) );
  563. const diff = range.getDifference( otherRange );
  564. expect( diff.length ).to.equal( 0 );
  565. } );
  566. it( 'should two ranges if other range is contained by the original range', () => {
  567. const otherRange = new Range( new Position( root, [ 3, 7 ] ), new Position( root, [ 4, 1 ] ) );
  568. const diff = range.getDifference( otherRange );
  569. expect( diff.length ).to.equal( 2 );
  570. expect( diff[ 0 ].start.path ).to.deep.equal( [ 3, 2 ] );
  571. expect( diff[ 0 ].end.path ).to.deep.equal( [ 3, 7 ] );
  572. expect( diff[ 1 ].start.path ).to.deep.equal( [ 4, 1 ] );
  573. expect( diff[ 1 ].end.path ).to.deep.equal( [ 5, 4 ] );
  574. } );
  575. } );
  576. describe( 'getIntersection()', () => {
  577. let range;
  578. beforeEach( () => {
  579. range = new Range( new Position( root, [ 3, 2 ] ), new Position( root, [ 5, 4 ] ) );
  580. } );
  581. it( 'should return null if ranges do not intersect', () => {
  582. const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
  583. const common = range.getIntersection( otherRange );
  584. expect( common ).to.be.null;
  585. } );
  586. it( 'should return a range equal to the common part of ranges - original range contains the other range', () => {
  587. const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
  588. const common = range.getIntersection( otherRange );
  589. expect( common.isEqual( otherRange ) ).to.be.true;
  590. } );
  591. it( 'should return a range equal to the common part of ranges - original range is contained by the other range', () => {
  592. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
  593. const common = range.getIntersection( otherRange );
  594. expect( common.isEqual( range ) ).to.be.true;
  595. } );
  596. it( 'should return a range equal to the common part of ranges - original range intersects with the other range', () => {
  597. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
  598. const common = range.getIntersection( otherRange );
  599. expect( common.start.path ).to.deep.equal( [ 3, 2 ] );
  600. expect( common.end.path ).to.deep.equal( [ 4, 7 ] );
  601. } );
  602. it( 'should return a range equal to both ranges if both ranges are equal', () => {
  603. const otherRange = Range.createFromRange( range );
  604. const common = range.getIntersection( otherRange );
  605. expect( common.isEqual( range ) ).to.be.true;
  606. } );
  607. } );
  608. // Note: We don't create model element structure in these tests because this method
  609. // is used by OT so it must not check the structure.
  610. describe( 'getTransformedByDelta()', () => {
  611. beforeEach( () => {
  612. range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
  613. } );
  614. function expectRange( range, startOffset, endOffset ) {
  615. expect( range.start.offset ).to.equal( startOffset );
  616. expect( range.end.offset ).to.equal( endOffset );
  617. }
  618. describe( 'by AttributeDelta', () => {
  619. it( 'nothing should change', () => {
  620. const delta = getAttributeDelta( Range.createFromParentsAndOffsets( root, 1, root, 6 ), 'key', true, false, 1 );
  621. const transformed = range.getTransformedByDelta( delta );
  622. expectRange( transformed[ 0 ], 2, 5 );
  623. } );
  624. } );
  625. describe( 'by InsertDelta', () => {
  626. it( 'insert before range', () => {
  627. const delta = getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
  628. const transformed = range.getTransformedByDelta( delta );
  629. expectRange( transformed[ 0 ], 5, 8 );
  630. } );
  631. it( 'insert inside range', () => {
  632. const delta = getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
  633. const transformed = range.getTransformedByDelta( delta );
  634. expectRange( transformed[ 0 ], 2, 8 );
  635. } );
  636. it( 'insert after range', () => {
  637. const delta = getInsertDelta( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
  638. const transformed = range.getTransformedByDelta( delta );
  639. expectRange( transformed[ 0 ], 2, 5 );
  640. } );
  641. } );
  642. describe( 'by MoveDelta', () => {
  643. it( 'move before range', () => {
  644. const start = new Position( root, [ 0 ] );
  645. const target = new Position( otherRoot, [ 0 ] );
  646. const delta = getMoveDelta( start, 2, target, 1 );
  647. const transformed = range.getTransformedByDelta( delta );
  648. expectRange( transformed[ 0 ], 0, 3 );
  649. } );
  650. it( 'move intersecting with range (and targeting before range)', () => {
  651. const start = new Position( root, [ 4 ] );
  652. const target = new Position( root, [ 0 ] );
  653. const delta = getMoveDelta( start, 2, target, 1 );
  654. const transformed = range.getTransformedByDelta( delta );
  655. expectRange( transformed[ 0 ], 4, 6 );
  656. expectRange( transformed[ 1 ], 0, 1 );
  657. } );
  658. it( 'move inside the range', () => {
  659. range.end.offset = 6;
  660. const start = new Position( root, [ 3 ] );
  661. const target = new Position( root, [ 5 ] );
  662. const delta = getMoveDelta( start, 1, target, 1 );
  663. const transformed = range.getTransformedByDelta( delta );
  664. expectRange( transformed[ 0 ], 2, 4 );
  665. expectRange( transformed[ 1 ], 5, 6 );
  666. expectRange( transformed[ 2 ], 4, 5 );
  667. } );
  668. // #877.
  669. it( 'moved element contains range start and is moved towards inside of range', () => {
  670. // Initial state:
  671. // <w><p>abc</p><p>x[x</p></w><p>d]ef</p>
  672. // Expected state after moving `<p>` out of `<w>`:
  673. // <w><p>abc</p></w><p>x[x</p><p>d]ef</p>
  674. const range = new Range( new Position( root, [ 0, 1, 1 ] ), new Position( root, [ 1, 1 ] ) );
  675. const delta = getMoveDelta( new Position( root, [ 0, 1 ] ), 1, new Position( root, [ 1 ] ), 1 );
  676. const transformed = range.getTransformedByDelta( delta );
  677. expect( transformed.length ).to.equal( 1 );
  678. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 1 ] );
  679. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
  680. } );
  681. it( 'moved element contains range start and is moved out of range', () => {
  682. // Initial state:
  683. // <p>abc</p><p>x[x</p><p>d]ef</p>
  684. // Expected state after moving:
  685. // <p>x[x</p><p>abc</p><p>d]ef</p>
  686. const range = new Range( new Position( root, [ 1, 1 ] ), new Position( root, [ 2, 1 ] ) );
  687. const delta = getMoveDelta( new Position( root, [ 1 ] ), 1, new Position( root, [ 0 ] ), 1 );
  688. const transformed = range.getTransformedByDelta( delta );
  689. expect( transformed.length ).to.equal( 1 );
  690. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  691. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
  692. } );
  693. it( 'moved element contains range end and is moved towards range', () => {
  694. // Initial state:
  695. // <p>a[bc</p><p>def</p><p>x]x</p>
  696. // Expected state after moving:
  697. // <p>a[bc</p><p>x]x</p><p>def</p>
  698. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 2, 1 ] ) );
  699. const delta = getMoveDelta( new Position( root, [ 2 ] ), 1, new Position( root, [ 1 ] ), 1 );
  700. const transformed = range.getTransformedByDelta( delta );
  701. expect( transformed.length ).to.equal( 1 );
  702. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  703. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  704. } );
  705. it( 'moved element contains range end and is moved out of range', () => {
  706. // Initial state:
  707. // <p>a[bc</p><p>x]x</p><p>def</p>
  708. // Expected state after moving:
  709. // <p>a[bc</p><p>def</p><p>x]x</p>
  710. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 1, 1 ] ) );
  711. const delta = getMoveDelta( new Position( root, [ 1 ] ), 1, new Position( root, [ 3 ] ), 1 );
  712. const transformed = range.getTransformedByDelta( delta );
  713. expect( transformed.length ).to.equal( 1 );
  714. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  715. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
  716. } );
  717. // #1358
  718. it( 'should not crash and not transform the range if move delta moves 0 nodes', () => {
  719. const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
  720. const delta = getMoveDelta( new Position( root, [ 0, 1 ] ), 0, new Position( root, [ 0, 3 ] ), 1 );
  721. const transformed = range.getTransformedByDelta( delta );
  722. expect( transformed.length ).to.equal( 1 );
  723. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  724. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 4 ] );
  725. } );
  726. } );
  727. describe( 'by RemoveDelta', () => {
  728. it( 'remove before range', () => {
  729. const start = new Position( root, [ 0 ] );
  730. const delta = getRemoveDelta( start, 2, 1 );
  731. const transformed = range.getTransformedByDelta( delta );
  732. expectRange( transformed[ 0 ], 0, 3 );
  733. } );
  734. it( 'remove intersecting with range', () => {
  735. const start = new Position( root, [ 4 ] );
  736. const delta = getRemoveDelta( start, 2, 1 );
  737. const transformed = range.getTransformedByDelta( delta );
  738. expectRange( transformed[ 0 ], 2, 4 );
  739. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  740. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 1 );
  741. } );
  742. it( 'remove inside the range', () => {
  743. const start = new Position( root, [ 3 ] );
  744. const delta = getRemoveDelta( start, 2, 1 );
  745. const transformed = range.getTransformedByDelta( delta );
  746. expectRange( transformed[ 0 ], 2, 3 );
  747. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  748. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 2 );
  749. } );
  750. } );
  751. describe( 'by RenameDelta', () => {
  752. it( 'nothing should change', () => {
  753. const delta = getRenameDelta( new Position( root, [ 3 ] ), 'old', 'new', 1 );
  754. const transformed = range.getTransformedByDelta( delta );
  755. expectRange( transformed[ 0 ], 2, 5 );
  756. } );
  757. } );
  758. describe( 'by SplitDelta', () => {
  759. it( 'split inside range', () => {
  760. range.start = new Position( root, [ 0, 2 ] );
  761. range.end = new Position( root, [ 0, 4 ] );
  762. const delta = getSplitDelta( new Position( root, [ 0, 3 ] ), new Element( 'p' ), 3, 1 );
  763. const transformed = range.getTransformedByDelta( delta );
  764. expect( transformed.length ).to.equal( 1 );
  765. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  766. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  767. } );
  768. it( 'split at the beginning of multi-element range', () => {
  769. range.start = new Position( root, [ 0, 4 ] );
  770. range.end = new Position( root, [ 1, 2 ] );
  771. const delta = getSplitDelta( new Position( root, [ 0, 4 ] ), new Element( 'p' ), 3, 1 );
  772. const transformed = range.getTransformedByDelta( delta );
  773. expect( transformed.length ).to.equal( 1 );
  774. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 0 ] );
  775. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 2 ] );
  776. } );
  777. it( 'split inside range which starts at the beginning of split element', () => {
  778. range.start = new Position( root, [ 0, 0 ] );
  779. range.end = new Position( root, [ 0, 4 ] );
  780. const delta = getSplitDelta( new Position( root, [ 0, 3 ] ), new Element( 'p' ), 3, 1 );
  781. const transformed = range.getTransformedByDelta( delta );
  782. expect( transformed.length ).to.equal( 1 );
  783. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  784. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  785. } );
  786. it( 'split inside range which end is at the end of split element', () => {
  787. range.start = new Position( root, [ 0, 3 ] );
  788. range.end = new Position( root, [ 0, 6 ] );
  789. const delta = getSplitDelta( new Position( root, [ 0, 4 ] ), new Element( 'p' ), 2, 1 );
  790. const transformed = range.getTransformedByDelta( delta );
  791. expect( transformed.length ).to.equal( 1 );
  792. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  793. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 2 ] );
  794. } );
  795. it( 'split element which has collapsed range at the end', () => {
  796. range.start = new Position( root, [ 0, 6 ] );
  797. range.end = new Position( root, [ 0, 6 ] );
  798. const delta = getSplitDelta( new Position( root, [ 0, 3 ] ), new Element( 'p' ), 3, 1 );
  799. const transformed = range.getTransformedByDelta( delta );
  800. expect( transformed.length ).to.equal( 1 );
  801. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 3 ] );
  802. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 3 ] );
  803. } );
  804. } );
  805. describe( 'by MergeDelta', () => {
  806. it( 'merge element with collapsed range', () => {
  807. range.start = new Position( root, [ 1, 0 ] );
  808. range.end = new Position( root, [ 1, 0 ] );
  809. const delta = getMergeDelta( new Position( root, [ 1 ] ), 3, 3, 1 );
  810. const transformed = range.getTransformedByDelta( delta );
  811. expect( transformed.length ).to.equal( 1 );
  812. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  813. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  814. } );
  815. // #877.
  816. it( 'merge elements that contain elements with range boundaries', () => {
  817. // Initial state:
  818. // <w><p>x[x</p></w><w><p>y]y</p></w>
  819. // Expected state after merge:
  820. // <w><p>x[x</p><p>y]y</p></w>
  821. const range = new Range( new Position( root, [ 0, 0, 1 ] ), new Position( root, [ 1, 0, 1 ] ) );
  822. const delta = getMergeDelta( new Position( root, [ 1 ] ), 1, 1, 1 );
  823. const transformed = range.getTransformedByDelta( delta );
  824. expect( transformed.length ).to.equal( 1 );
  825. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  826. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 1, 1 ] );
  827. } );
  828. // #1132.
  829. it( 'merge delta has move operation that does not start from offset 0', () => {
  830. // This scenario is a test for a rare situation, that after some OT, a move operation in
  831. // merge delta does not start from 0 offset.
  832. //
  833. // It happens that move operation in merge delta becomes "do nothing move operation", something like:
  834. //
  835. // move range [ a, x ] - [ a, y ] to [ a, x ]
  836. // for example: move [ 0, 3 ] - [ 0, 6 ] -> [ 0, 3 ]
  837. //
  838. // This is a result of valid transformation and we need to check if range is properly transformed
  839. // when such unusual delta is generated.
  840. // For more see: https://github.com/ckeditor/ckeditor5-engine/pull/1133#issuecomment-329080668.
  841. //
  842. // For this test scenario assume: <p>foobar[]</p>, "bar" is moved between "o" and "b".
  843. // Expect state after transformation is that nothing has changed.
  844. const range = new Range( new Position( root, [ 0, 6 ] ), new Position( root, [ 0, 6 ] ) );
  845. const delta = new MergeDelta();
  846. delta.addOperation( new MoveOperation( new Position( root, [ 0, 3 ] ), 3, new Position( root, [ 0, 3 ] ), 0 ) );
  847. delta.addOperation( new RemoveOperation( new Position( root, [ 1 ] ), 1, new Position( doc.graveyard, [ 0 ] ), 1 ) );
  848. const transformed = range.getTransformedByDelta( delta );
  849. expect( transformed.length ).to.equal( 1 );
  850. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 6 ] );
  851. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 6 ] );
  852. } );
  853. } );
  854. describe( 'by WrapDelta', () => {
  855. it( 'maintans start position when wrapping element in which the range starts and ends', () => {
  856. // <p>f[o]o</p><p>bar</p>
  857. range.start = new Position( root, [ 0, 1 ] );
  858. range.end = new Position( root, [ 0, 2 ] );
  859. const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  860. const wrapElement = new Element( 'w' );
  861. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  862. const transformed = range.getTransformedByDelta( delta );
  863. // <w><p>f[o]o</p></w><p>bar</p>
  864. expect( transformed.length ).to.equal( 1 );
  865. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  866. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 0, 2 ] );
  867. } );
  868. it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
  869. // <p>f[oo</p><p>b]ar</p>
  870. range.start = new Position( root, [ 0, 1 ] );
  871. range.end = new Position( root, [ 1, 1 ] );
  872. const wrapRange = new Range( new Position( root, [ 0 ] ), new Position( root, [ 1 ] ) );
  873. const wrapElement = new Element( 'w' );
  874. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  875. const transformed = range.getTransformedByDelta( delta );
  876. // <w><p>f[oo</p></w><p>b]ar</p>
  877. expect( transformed.length ).to.equal( 1 );
  878. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  879. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  880. } );
  881. it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
  882. // <p>f[oo</p><p>b]ar</p>
  883. range.start = new Position( root, [ 0, 1 ] );
  884. range.end = new Position( root, [ 1, 1 ] );
  885. const wrapRange = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2 ] ) );
  886. const wrapElement = new Element( 'w' );
  887. const delta = getWrapDelta( wrapRange, wrapElement, 1 );
  888. const transformed = range.getTransformedByDelta( delta );
  889. // <p>f[oo</p><w><p>b]ar</p></w>
  890. expect( transformed.length ).to.equal( 1 );
  891. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  892. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 0, 1 ] );
  893. } );
  894. } );
  895. describe( 'by UnwrapDelta', () => {
  896. it( 'maintans start position when wrapping element in which the range starts and ends', () => {
  897. // <w><p>f[o]o</p></w><p>bar</p>
  898. range.start = new Position( root, [ 0, 0, 1 ] );
  899. range.end = new Position( root, [ 0, 0, 2 ] );
  900. const unwrapPosition = new Position( root, [ 0 ] );
  901. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  902. const transformed = range.getTransformedByDelta( delta );
  903. // <p>f[o]o</p><p>bar</p>
  904. expect( transformed.length ).to.equal( 1 );
  905. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  906. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 2 ] );
  907. } );
  908. it( 'maintans start position when wrapping element in which the range starts but not ends', () => {
  909. // <w><p>f[oo</p></w><p>b]ar</p>
  910. range.start = new Position( root, [ 0, 0, 1 ] );
  911. range.end = new Position( root, [ 1, 1 ] );
  912. const unwrapPosition = new Position( root, [ 0 ] );
  913. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  914. const transformed = range.getTransformedByDelta( delta );
  915. // <p>f[oo</p><p>b]ar</p>
  916. expect( transformed.length ).to.equal( 2 );
  917. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  918. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  919. expect( transformed[ 1 ].root.rootName ).to.equal( '$graveyard' );
  920. } );
  921. it( 'maintans end position when wrapping element in which the range ends but not starts', () => {
  922. // <p>f[oo</p><w><p>b]ar</p></w>
  923. range.start = new Position( root, [ 0, 1 ] );
  924. range.end = new Position( root, [ 1, 0, 1 ] );
  925. const unwrapPosition = new Position( root, [ 1 ] );
  926. const delta = getUnwrapDelta( unwrapPosition, 1, 1 );
  927. const transformed = range.getTransformedByDelta( delta );
  928. // <p>f[oo</p><p>b]ar</p>
  929. expect( transformed.length ).to.equal( 1 );
  930. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  931. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  932. } );
  933. } );
  934. } );
  935. describe( 'getTransformedByDeltas()', () => {
  936. beforeEach( () => {
  937. root._appendChild( new Text( 'foobar' ) );
  938. range = Range.createFromParentsAndOffsets( root, 2, root, 5 );
  939. } );
  940. function expectRange( range, startOffset, endOffset ) {
  941. expect( range.start.offset ).to.equal( startOffset );
  942. expect( range.end.offset ).to.equal( endOffset );
  943. }
  944. it( 'should return a range transformed by multiple deltas', () => {
  945. const transformed = range.getTransformedByDeltas( [
  946. getInsertDelta( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
  947. getInsertDelta( new Position( root, [ 6 ] ), new Text( 'xx' ), 2 ) // Range becomes 5..10.
  948. ] );
  949. expectRange( transformed[ 0 ], 5, 10 );
  950. } );
  951. it( 'should correctly handle breaking transformed range and all range "pieces"', () => {
  952. const transformed = range.getTransformedByDeltas( [
  953. getInsertDelta( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
  954. getMoveDelta( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
  955. getInsertDelta( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
  956. getMoveDelta( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
  957. getMoveDelta( new Position( root, [ 6 ] ), 1, new Position( root, [ 1 ] ), 5 ) // Range becomes 1..2, 4..7 and 8..10.
  958. ] );
  959. expect( transformed.length ).to.equal( 3 );
  960. expectRange( transformed[ 0 ], 4, 7 );
  961. expectRange( transformed[ 1 ], 1, 2 );
  962. expectRange( transformed[ 2 ], 8, 10 );
  963. } );
  964. it( 'should return range equal to original range for empty delta set', () => {
  965. const transformed = range.getTransformedByDeltas( [] );
  966. expectRange( transformed[ 0 ], 2, 5 );
  967. } );
  968. } );
  969. describe( 'getMinimalFlatRanges()', () => {
  970. beforeEach( () => {
  971. prepareRichRoot( root );
  972. } );
  973. it( 'should return empty array if range is collapsed', () => {
  974. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
  975. const flat = range.getMinimalFlatRanges();
  976. expect( flat.length ).to.equal( 0 );
  977. } );
  978. it( 'should return empty array if range does not contain any node', () => {
  979. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
  980. const flat = range.getMinimalFlatRanges();
  981. expect( flat.length ).to.equal( 0 );
  982. } );
  983. it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
  984. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  985. const flat = range.getMinimalFlatRanges();
  986. expect( flat.length ).to.equal( 4 );
  987. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
  988. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
  989. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
  990. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
  991. expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
  992. expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
  993. expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
  994. expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
  995. } );
  996. it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
  997. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
  998. const flat = range.getMinimalFlatRanges();
  999. expect( flat.length ).to.equal( 2 );
  1000. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  1001. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
  1002. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
  1003. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
  1004. } );
  1005. } );
  1006. describe( 'isFlat', () => {
  1007. beforeEach( () => {
  1008. prepareRichRoot( root );
  1009. } );
  1010. it( 'should be true if start and end position are in the same parent', () => {
  1011. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
  1012. expect( range.isFlat ).to.be.true;
  1013. } );
  1014. it( 'should be false if start and end position are in different parents', () => {
  1015. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
  1016. expect( range.isFlat ).to.be.false;
  1017. } );
  1018. } );
  1019. describe( 'fromJSON()', () => {
  1020. it( 'should create range from given JSON object', () => {
  1021. const serialized = jsonParseStringify( range );
  1022. const deserialized = Range.fromJSON( serialized, doc );
  1023. expect( deserialized ).to.deep.equal( range );
  1024. } );
  1025. } );
  1026. describe( 'getCommonAncestor()', () => {
  1027. it( 'should return common ancestor for positions from Range', () => {
  1028. expect( range.getCommonAncestor() ).to.equal( root );
  1029. } );
  1030. } );
  1031. function mapNodesToNames( nodes ) {
  1032. return nodes.map( node => {
  1033. return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
  1034. } );
  1035. }
  1036. function prepareRichRoot() {
  1037. root._insertChild( 0, [
  1038. new Element( 'div', [], [
  1039. new Element( 'h', [], new Text( 'first' ) ),
  1040. new Element( 'p', [], new Text( 'lorem ipsum' ) )
  1041. ] ),
  1042. new Element( 'p', [], new Text( 'foo' ) ),
  1043. new Element( 'p', [], new Text( 'bar' ) ),
  1044. new Element( 'div', [], [
  1045. new Element( 'h', [], new Text( 'second' ) ),
  1046. new Element( 'p', [], new Text( 'lorem' ) )
  1047. ] )
  1048. ] );
  1049. }
  1050. } );