range.js 50 KB

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