range.js 57 KB

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