range.js 54 KB

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