8
0

range.js 57 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532
  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( 'getJoined()', () => {
  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 nor have equal start/end', () => {
  608. const otherRange = new Range( new Position( root, [ 5, 5 ] ), new Position( root, [ 7 ] ) );
  609. const sum = range.getJoined( otherRange );
  610. expect( sum ).to.be.null;
  611. } );
  612. it( 'should return a range spanning both of the ranges if the ranges have equal start/end positions', () => {
  613. const otherRange = new Range( new Position( root, [ 5, 4 ] ), new Position( root, [ 7 ] ) );
  614. const sum = range.getJoined( otherRange );
  615. expect( sum.start.path ).to.deep.equal( [ 3, 2 ] );
  616. expect( sum.end.path ).to.deep.equal( [ 7 ] );
  617. } );
  618. it( 'should return a range spanning both of the ranges if the ranges have equal start/end positions (different order)', () => {
  619. const otherRange = new Range( new Position( root, [ 1, 4 ] ), new Position( root, [ 3, 2 ] ) );
  620. const sum = range.getJoined( otherRange );
  621. expect( sum.start.path ).to.deep.equal( [ 1, 4 ] );
  622. expect( sum.end.path ).to.deep.equal( [ 5, 4 ] );
  623. } );
  624. it( 'should return a range spanning both of the ranges - original range contains the other range', () => {
  625. const otherRange = new Range( new Position( root, [ 4 ] ), new Position( root, [ 5 ] ) );
  626. const sum = range.getJoined( otherRange );
  627. expect( sum.isEqual( range ) ).to.be.true;
  628. } );
  629. it( 'should return a range spanning both of the ranges - original range is contained by the other range', () => {
  630. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 6 ] ) );
  631. const sum = range.getJoined( otherRange );
  632. expect( sum.isEqual( otherRange ) ).to.be.true;
  633. } );
  634. it( 'should return a range spanning both of the ranges - original range intersects with the other range', () => {
  635. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 4, 7 ] ) );
  636. const sum = range.getJoined( otherRange );
  637. expect( sum.start.path ).to.deep.equal( [ 3 ] );
  638. expect( sum.end.path ).to.deep.equal( [ 5, 4 ] );
  639. } );
  640. it( 'should return a range spanning both of the ranges if both ranges are equal', () => {
  641. const otherRange = range.clone();
  642. const sum = range.getJoined( otherRange );
  643. expect( sum.isEqual( range ) ).to.be.true;
  644. } );
  645. describe( 'with `loose` option enabled', () => {
  646. beforeEach( () => {
  647. prepareRichRoot( root );
  648. } );
  649. it( 'should return null if ranges are not intersecting nor touching', () => {
  650. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 3 ] ) );
  651. const otherRange = new Range( new Position( root, [ 3, 1 ] ), new Position( root, [ 3, 2 ] ) );
  652. const sum = range.getJoined( otherRange, true );
  653. expect( sum ).to.be.null;
  654. } );
  655. it( 'should return a range spanning both of the ranges - original range end is equal to other range start position', () => {
  656. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 3 ] ) );
  657. const otherRange = new Range( new Position( root, [ 3 ] ), new Position( root, [ 3, 2 ] ) );
  658. const sum = range.getJoined( otherRange, true );
  659. expect( sum.start.path ).to.deep.equal( [ 0, 1 ] );
  660. expect( sum.end.path ).to.deep.equal( [ 3, 2 ] );
  661. } );
  662. it( 'should return a range spanning both of the ranges - original range start is equal to other range end position', () => {
  663. const range = new Range( new Position( root, [ 3 ] ), new Position( root, [ 3, 2 ] ) );
  664. const otherRange = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 3 ] ) );
  665. const sum = range.getJoined( otherRange, true );
  666. expect( sum.start.path ).to.deep.equal( [ 0, 1 ] );
  667. expect( sum.end.path ).to.deep.equal( [ 3, 2 ] );
  668. } );
  669. it( 'should return a range spanning both of the ranges - original range is touching other range on the right side', () => {
  670. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 3 ] ) );
  671. const otherRange = new Range( new Position( root, [ 3, 0 ] ), new Position( root, [ 3, 2 ] ) );
  672. const sum = range.getJoined( otherRange, true );
  673. expect( sum.start.path ).to.deep.equal( [ 0, 1 ] );
  674. expect( sum.end.path ).to.deep.equal( [ 3, 2 ] );
  675. } );
  676. it( 'should return a range spanning both of the ranges - original range is touching other range on the left side', () => {
  677. const range = new Range( new Position( root, [ 1, 0 ] ), new Position( root, [ 3, 2 ] ) );
  678. const otherRange = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 0, 2 ] ) );
  679. const sum = range.getJoined( otherRange, true );
  680. expect( sum.start.path ).to.deep.equal( [ 0, 1 ] );
  681. expect( sum.end.path ).to.deep.equal( [ 3, 2 ] );
  682. } );
  683. } );
  684. } );
  685. // Note: We don't create model element structure in these tests because this method
  686. // is used by OT so it must not check the structure.
  687. describe( 'getTransformedByOperation()', () => {
  688. let gyPos;
  689. beforeEach( () => {
  690. range = new Range( Position._createAt( root, 2 ), Position._createAt( root, 5 ) );
  691. gyPos = new Position( gy, [ 0 ] );
  692. } );
  693. function expectRange( range, startOffset, endOffset ) {
  694. expect( range.start.offset ).to.equal( startOffset );
  695. expect( range.end.offset ).to.equal( endOffset );
  696. }
  697. describe( 'by AttributeOperation', () => {
  698. it( 'nothing should change', () => {
  699. const opRange = new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) );
  700. const op = new AttributeOperation( opRange, 'key', true, false, 1 );
  701. const transformed = range.getTransformedByOperation( op );
  702. expectRange( transformed[ 0 ], 2, 5 );
  703. } );
  704. } );
  705. describe( 'by InsertOperation', () => {
  706. it( 'insert before range', () => {
  707. const op = new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 );
  708. const transformed = range.getTransformedByOperation( op );
  709. expectRange( transformed[ 0 ], 5, 8 );
  710. } );
  711. it( 'insert inside range', () => {
  712. const op = new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 );
  713. const transformed = range.getTransformedByOperation( op );
  714. expectRange( transformed[ 0 ], 2, 8 );
  715. } );
  716. it( 'insert after range', () => {
  717. const op = new InsertOperation( new Position( root, [ 6 ] ), new Text( 'abc' ), 1 );
  718. const transformed = range.getTransformedByOperation( op );
  719. expectRange( transformed[ 0 ], 2, 5 );
  720. } );
  721. } );
  722. describe( 'by MarkerOperation', () => {
  723. it( 'nothing should change', () => {
  724. const op = new MarkerOperation(
  725. 'marker', null, new Range( Position._createAt( root, 1 ), Position._createAt( root, 6 ) ), model.markers, true, 1
  726. );
  727. const transformed = range.getTransformedByOperation( op );
  728. expectRange( transformed[ 0 ], 2, 5 );
  729. } );
  730. } );
  731. describe( 'by MoveOperation', () => {
  732. it( 'move before range', () => {
  733. const start = new Position( root, [ 0 ] );
  734. const target = new Position( otherRoot, [ 0 ] );
  735. const op = new MoveOperation( start, 2, target, 1 );
  736. const transformed = range.getTransformedByOperation( op );
  737. expectRange( transformed[ 0 ], 0, 3 );
  738. } );
  739. it( 'move intersecting with range (and targeting before range)', () => {
  740. const start = new Position( root, [ 4 ] );
  741. const target = new Position( root, [ 0 ] );
  742. const op = new MoveOperation( start, 2, target, 1 );
  743. const transformed = range.getTransformedByOperation( op );
  744. expectRange( transformed[ 0 ], 4, 6 );
  745. expectRange( transformed[ 1 ], 0, 1 );
  746. } );
  747. it( 'move inside the range', () => {
  748. range.end.offset = 6;
  749. const start = new Position( root, [ 3 ] );
  750. const target = new Position( root, [ 5 ] );
  751. const op = new MoveOperation( start, 1, target, 1 );
  752. const transformed = range.getTransformedByOperation( op );
  753. expectRange( transformed[ 0 ], 2, 4 );
  754. expectRange( transformed[ 1 ], 4, 5 );
  755. expectRange( transformed[ 2 ], 5, 6 );
  756. } );
  757. // #877.
  758. it( 'moved element contains range start and is moved towards inside of range', () => {
  759. // Initial state:
  760. // <w><p>abc</p><p>x[x</p></w><p>d]ef</p>
  761. // Expected state after moving `<p>` out of `<w>`:
  762. // <w><p>abc</p></w><p>x[x</p><p>d]ef</p>
  763. // <w><p>abc</p>{</w>}<p>x[x</p><p>d]ef</p>
  764. const range = new Range( new Position( root, [ 0, 1, 1 ] ), new Position( root, [ 1, 1 ] ) );
  765. const op = new MoveOperation( new Position( root, [ 0, 1 ] ), 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( [ 1, 1 ] );
  769. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 1 ] );
  770. } );
  771. it( 'moved element contains range end and is moved towards range', () => {
  772. // Initial state:
  773. // <p>a[bc</p><p>def</p><p>x]x</p>
  774. // Expected state after moving:
  775. // <p>a[bc</p><p>x]x</p><p>def</p>
  776. const range = new Range( new Position( root, [ 0, 1 ] ), new Position( root, [ 2, 1 ] ) );
  777. const op = new MoveOperation( new Position( root, [ 2 ] ), 1, new Position( root, [ 1 ] ), 1 );
  778. const transformed = range.getTransformedByOperation( op );
  779. expect( transformed.length ).to.equal( 1 );
  780. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 1 ] );
  781. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  782. } );
  783. // #1358
  784. it( 'should not crash and not transform the range if move operation moves 0 nodes', () => {
  785. const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
  786. const op = new MoveOperation( new Position( root, [ 0, 1 ] ), 0, new Position( root, [ 0, 3 ] ), 1 );
  787. const transformed = range.getTransformedByOperation( op );
  788. expect( transformed.length ).to.equal( 1 );
  789. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  790. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 4 ] );
  791. } );
  792. } );
  793. describe( 'by MoveOperation to graveyard', () => {
  794. it( 'remove before range', () => {
  795. const start = new Position( root, [ 0 ] );
  796. const op = new MoveOperation( start, 2, gyPos, 1 );
  797. const transformed = range.getTransformedByOperation( op );
  798. expectRange( transformed[ 0 ], 0, 3 );
  799. } );
  800. it( 'remove intersecting with range', () => {
  801. const start = new Position( root, [ 4 ] );
  802. const op = new MoveOperation( start, 2, gyPos, 1 );
  803. const transformed = range.getTransformedByOperation( op );
  804. expectRange( transformed[ 0 ], 2, 4 );
  805. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  806. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 1 );
  807. } );
  808. it( 'remove inside the range', () => {
  809. const start = new Position( root, [ 3 ] );
  810. const op = new MoveOperation( start, 2, gyPos, 1 );
  811. const transformed = range.getTransformedByOperation( op );
  812. expectRange( transformed[ 0 ], 2, 3 );
  813. expect( transformed[ 1 ].root ).to.equal( doc.graveyard );
  814. expect( transformed[ 1 ].end.offset - transformed[ 1 ].start.offset ).to.equal( 2 );
  815. } );
  816. } );
  817. describe( 'by RenameOperation', () => {
  818. it( 'nothing should change', () => {
  819. const op = new RenameOperation( new Position( root, [ 3 ] ), 'old', 'new', 1 );
  820. const transformed = range.getTransformedByOperation( op );
  821. expectRange( transformed[ 0 ], 2, 5 );
  822. } );
  823. } );
  824. describe( 'by SplitOperation', () => {
  825. it( 'split inside range', () => {
  826. range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 0, 4 ] ) );
  827. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  828. const transformed = range.getTransformedByOperation( op );
  829. expect( transformed.length ).to.equal( 1 );
  830. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  831. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  832. } );
  833. it( 'split at the beginning of multi-element range', () => {
  834. range = new Range( new Position( root, [ 0, 4 ] ), new Position( root, [ 1, 2 ] ) );
  835. const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
  836. const transformed = range.getTransformedByOperation( op );
  837. expect( transformed.length ).to.equal( 1 );
  838. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 0 ] );
  839. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2, 2 ] );
  840. } );
  841. it( 'split inside range which starts at the beginning of split element', () => {
  842. range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 4 ] ) );
  843. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  844. const transformed = range.getTransformedByOperation( op );
  845. expect( transformed.length ).to.equal( 1 );
  846. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  847. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 1 ] );
  848. } );
  849. it( 'split inside range which end is at the end of split element', () => {
  850. range = new Range( new Position( root, [ 0, 3 ] ), new Position( root, [ 0, 6 ] ) );
  851. const op = new SplitOperation( new Position( root, [ 0, 4 ] ), 5, gyPos, 1 );
  852. const transformed = range.getTransformedByOperation( op );
  853. expect( transformed.length ).to.equal( 1 );
  854. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  855. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 2 ] );
  856. } );
  857. it( 'split element which has collapsed range at the end', () => {
  858. range = new Range( new Position( root, [ 0, 6 ] ), new Position( root, [ 0, 6 ] ) );
  859. const op = new SplitOperation( new Position( root, [ 0, 3 ] ), 6, gyPos, 1 );
  860. const transformed = range.getTransformedByOperation( op );
  861. expect( transformed.length ).to.equal( 1 );
  862. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1, 3 ] );
  863. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 1, 3 ] );
  864. } );
  865. it( 'split element which is the last element in the range', () => {
  866. range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  867. const op = new SplitOperation( new Position( root, [ 2, 0 ] ), 6, gyPos, 1 );
  868. const transformed = range.getTransformedByOperation( op );
  869. expect( transformed.length ).to.equal( 1 );
  870. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 1 ] );
  871. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 4 ] );
  872. } );
  873. } );
  874. describe( 'by MergeOperation', () => {
  875. it( 'merge element with collapsed range', () => {
  876. range.start = new Position( root, [ 1, 0 ] );
  877. range.end = new Position( root, [ 1, 0 ] );
  878. const op = new MergeOperation(
  879. new Position( root, [ 1, 0 ] ),
  880. 4,
  881. new Position( root, [ 0, 3 ] ),
  882. gyPos,
  883. 1
  884. );
  885. const transformed = range.getTransformedByOperation( op );
  886. expect( transformed.length ).to.equal( 1 );
  887. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  888. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  889. } );
  890. it( 'merge element with collapsed range #2', () => {
  891. range.start = new Position( root, [ 1, 3 ] );
  892. range.end = new Position( root, [ 1, 3 ] );
  893. const op = new MergeOperation(
  894. new Position( root, [ 0, 0 ] ),
  895. 4,
  896. new Position( root, [ 1, 3 ] ),
  897. gyPos,
  898. 1
  899. );
  900. const transformed = range.getTransformedByOperation( op );
  901. expect( transformed.length ).to.equal( 1 );
  902. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 3 ] );
  903. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  904. } );
  905. // #877.
  906. it( 'merge elements that contain elements with range boundaries', () => {
  907. // Initial state:
  908. // <w><p>x[x</p></w><w><p>y]y</p></w>
  909. // Expected state after merge:
  910. // <w><p>x[x</p><p>y]y</p></w>
  911. const range = new Range( new Position( root, [ 0, 0, 1 ] ), new Position( root, [ 1, 0, 1 ] ) );
  912. const op = new MergeOperation(
  913. new Position( root, [ 1, 0 ] ),
  914. 4,
  915. new Position( root, [ 0, 1 ] ),
  916. gyPos,
  917. 1
  918. );
  919. const transformed = range.getTransformedByOperation( op );
  920. expect( transformed.length ).to.equal( 1 );
  921. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 0, 1 ] );
  922. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 1, 1 ] );
  923. } );
  924. it( 'merge at the beginning of the range', () => {
  925. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
  926. const op = new MergeOperation(
  927. new Position( root, [ 2, 0 ] ),
  928. 4,
  929. new Position( root, [ 1, 1 ] ),
  930. gyPos,
  931. 1
  932. );
  933. const transformed = range.getTransformedByOperation( op );
  934. expect( transformed.length ).to.equal( 1 );
  935. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  936. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
  937. } );
  938. it( 'merge at the end of the range', () => {
  939. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 4 ] ) );
  940. const op = new MergeOperation(
  941. new Position( root, [ 3, 0 ] ),
  942. 4,
  943. new Position( root, [ 2, 1 ] ),
  944. gyPos,
  945. 1
  946. );
  947. const transformed = range.getTransformedByOperation( op );
  948. expect( transformed.length ).to.equal( 1 );
  949. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  950. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 3 ] );
  951. } );
  952. it( 'merged element is the only node in the range', () => {
  953. const range = new Range( new Position( root, [ 2 ] ), new Position( root, [ 3 ] ) );
  954. const op = new MergeOperation(
  955. new Position( root, [ 2, 0 ] ),
  956. 4,
  957. new Position( root, [ 1, 1 ] ),
  958. gyPos,
  959. 1
  960. );
  961. const transformed = range.getTransformedByOperation( op );
  962. expect( transformed.length ).to.equal( 1 );
  963. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 2 ] );
  964. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
  965. } );
  966. it( 'range start is between merged elements #1', () => {
  967. // <p>aa</p>{<p>b}b</p><p>cc</p>
  968. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 1, 1 ] ) );
  969. const op = new MergeOperation(
  970. new Position( root, [ 1, 0 ] ),
  971. 2,
  972. new Position( root, [ 0, 2 ] ),
  973. gyPos,
  974. 1
  975. );
  976. const transformed = range.getTransformedByOperation( op );
  977. expect( transformed.length ).to.equal( 1 );
  978. // <p>aa{b}b</p><p>cc</p>
  979. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  980. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 3 ] );
  981. } );
  982. it( 'range start is between merged elements #2', () => {
  983. // <p>aa</p>{<p>cc</p><p>b}b</p>
  984. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2, 1 ] ) );
  985. const op = new MergeOperation(
  986. new Position( root, [ 2, 0 ] ),
  987. 2,
  988. new Position( root, [ 0, 2 ] ),
  989. gyPos,
  990. 1
  991. );
  992. const transformed = range.getTransformedByOperation( op );
  993. expect( transformed.length ).to.equal( 1 );
  994. // <p>aa{bb</p><p>cc</p>}
  995. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  996. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 2 ] );
  997. } );
  998. it( 'range is set on closing tag of merge target element', () => {
  999. // <p>aa{</p>}<p>bb</p>
  1000. const range = new Range( new Position( root, [ 0, 2 ] ), new Position( root, [ 1 ] ) );
  1001. const op = new MergeOperation(
  1002. new Position( root, [ 1, 0 ] ),
  1003. 2,
  1004. new Position( root, [ 0, 2 ] ),
  1005. gyPos,
  1006. 1
  1007. );
  1008. const transformed = range.getTransformedByOperation( op );
  1009. expect( transformed.length ).to.equal( 1 );
  1010. // <p>aa{}bb</p>
  1011. expect( transformed[ 0 ].start.path ).to.deep.equal( [ 0, 2 ] );
  1012. expect( transformed[ 0 ].end.path ).to.deep.equal( [ 0, 2 ] );
  1013. } );
  1014. } );
  1015. } );
  1016. describe( 'getTransformedByOperations()', () => {
  1017. beforeEach( () => {
  1018. root._appendChild( new Text( 'foobar' ) );
  1019. range = new Range( Position._createAt( root, 2 ), Position._createAt( root, 5 ) );
  1020. } );
  1021. function expectRange( range, startOffset, endOffset ) {
  1022. expect( range.start.offset ).to.equal( startOffset );
  1023. expect( range.end.offset ).to.equal( endOffset );
  1024. }
  1025. it( 'should return a range transformed by multiple operations', () => {
  1026. const transformed = range.getTransformedByOperations( [
  1027. new InsertOperation( new Position( root, [ 1 ] ), new Text( 'abc' ), 1 ), // Range becomes 5..8.
  1028. new InsertOperation( new Position( root, [ 6 ] ), new Text( 'xx' ), 2 ) // Range becomes 5..10.
  1029. ] );
  1030. expectRange( transformed[ 0 ], 5, 10 );
  1031. } );
  1032. it( 'should correctly handle breaking transformed range and all range "pieces"', () => {
  1033. const transformed = range.getTransformedByOperations( [
  1034. new InsertOperation( new Position( root, [ 3 ] ), new Text( 'abc' ), 1 ), // Range becomes 2..8.
  1035. new MoveOperation( new Position( root, [ 4 ] ), 3, new Position( root, [ 9 ] ), 2 ), // Range becomes 2..5 and 6..9.
  1036. new InsertOperation( new Position( root, [ 0 ] ), new Text( 'x' ), 3 ), // Range becomes 3..6 and 7..10.
  1037. new MoveOperation( new Position( root, [ 9 ] ), 1, new Position( root, [ 4 ] ), 4 ), // Range becomes 3..7 and 8..10.
  1038. new MoveOperation( new Position( root, [ 6 ] ), 1, new Position( root, [ 1 ] ), 5 ) // Range becomes 1..2, 4..7 and 8..10.
  1039. ] );
  1040. expect( transformed.length ).to.equal( 3 );
  1041. expectRange( transformed[ 0 ], 4, 7 );
  1042. expectRange( transformed[ 1 ], 1, 2 );
  1043. expectRange( transformed[ 2 ], 8, 10 );
  1044. } );
  1045. it( 'should return range equal to original range for empty operation set', () => {
  1046. const transformed = range.getTransformedByOperations( [] );
  1047. expectRange( transformed[ 0 ], 2, 5 );
  1048. } );
  1049. } );
  1050. describe( 'getMinimalFlatRanges()', () => {
  1051. beforeEach( () => {
  1052. prepareRichRoot( root );
  1053. } );
  1054. it( 'should return empty array if range is collapsed', () => {
  1055. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 1, 3 ] ) );
  1056. const flat = range.getMinimalFlatRanges();
  1057. expect( flat.length ).to.equal( 0 );
  1058. } );
  1059. it( 'should return empty array if range does not contain any node', () => {
  1060. const range = new Range( new Position( root, [ 1, 3 ] ), new Position( root, [ 2, 0 ] ) );
  1061. const flat = range.getMinimalFlatRanges();
  1062. expect( flat.length ).to.equal( 0 );
  1063. } );
  1064. it( 'should return a minimal set of flat ranges that covers the range (start and end in different sub-trees)', () => {
  1065. const range = new Range( new Position( root, [ 0, 0, 3 ] ), new Position( root, [ 3, 0, 2 ] ) );
  1066. const flat = range.getMinimalFlatRanges();
  1067. expect( flat.length ).to.equal( 4 );
  1068. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0, 3 ] );
  1069. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 0, 5 ] );
  1070. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1 ] );
  1071. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 2 ] );
  1072. expect( flat[ 2 ].start.path ).to.deep.equal( [ 1 ] );
  1073. expect( flat[ 2 ].end.path ).to.deep.equal( [ 3 ] );
  1074. expect( flat[ 3 ].start.path ).to.deep.equal( [ 3, 0, 0 ] );
  1075. expect( flat[ 3 ].end.path ).to.deep.equal( [ 3, 0, 2 ] );
  1076. } );
  1077. it( 'should return a minimal set of flat ranges that covers the range (start.path is prefix of end.path)', () => {
  1078. const range = new Range( new Position( root, [ 0 ] ), new Position( root, [ 0, 1, 4 ] ) );
  1079. const flat = range.getMinimalFlatRanges();
  1080. expect( flat.length ).to.equal( 2 );
  1081. expect( flat[ 0 ].start.path ).to.deep.equal( [ 0, 0 ] );
  1082. expect( flat[ 0 ].end.path ).to.deep.equal( [ 0, 1 ] );
  1083. expect( flat[ 1 ].start.path ).to.deep.equal( [ 0, 1, 0 ] );
  1084. expect( flat[ 1 ].end.path ).to.deep.equal( [ 0, 1, 4 ] );
  1085. } );
  1086. } );
  1087. describe( 'isFlat', () => {
  1088. beforeEach( () => {
  1089. prepareRichRoot( root );
  1090. } );
  1091. it( 'should be true if start and end position are in the same parent', () => {
  1092. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 0, 2 ] ) );
  1093. expect( range.isFlat ).to.be.true;
  1094. } );
  1095. it( 'should be false if start and end position are in different parents', () => {
  1096. const range = new Range( new Position( root, [ 0, 0 ] ), new Position( root, [ 3, 0, 1 ] ) );
  1097. expect( range.isFlat ).to.be.false;
  1098. } );
  1099. } );
  1100. describe( 'toJSON()', () => {
  1101. it( 'should serialize range', () => {
  1102. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  1103. const serialized = range.toJSON();
  1104. expect( serialized ).to.deep.equal( {
  1105. start: { root: 'main', path: [ 1 ], stickiness: 'toNext' },
  1106. end: { root: 'main', path: [ 3 ], stickiness: 'toPrevious' }
  1107. } );
  1108. } );
  1109. } );
  1110. describe( 'fromJSON()', () => {
  1111. it( 'should create range from given JSON object', () => {
  1112. const serialized = range.toJSON();
  1113. const deserialized = Range.fromJSON( serialized, doc );
  1114. expect( deserialized ).to.deep.equal( range );
  1115. } );
  1116. } );
  1117. describe( 'getCommonAncestor()', () => {
  1118. it( 'should return common ancestor for positions from Range', () => {
  1119. expect( range.getCommonAncestor() ).to.equal( root );
  1120. } );
  1121. } );
  1122. describe( 'getContainedElement()', () => {
  1123. beforeEach( () => {
  1124. prepareRichRoot( root );
  1125. } );
  1126. it( 'should return an element when it is fully contained by the range', () => {
  1127. // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p>]<p>bar</p><div><h>second</h><p>lorem</p></div>
  1128. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2 ] ) );
  1129. expect( range.getContainedElement() ).to.equal( root.getNodeByPath( [ 1 ] ) );
  1130. } );
  1131. it( 'should return "null" if the range is collapsed', () => {
  1132. // <div><h>first</h><p>lorem ipsum</p></div>[]<p>foo</p><p>bar</p><div><h>second</h><p>lorem</p></div>
  1133. const range = new Range( new Position( root, [ 1 ] ) );
  1134. expect( range.getContainedElement() ).to.be.null;
  1135. } );
  1136. it( 'should return "null" if it contains 2+ elements', () => {
  1137. // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p><p>bar</p>]<div><h>second</h><p>lorem</p></div>
  1138. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 3 ] ) );
  1139. expect( range.getContainedElement() ).to.be.null;
  1140. } );
  1141. it( 'should return "null" if it contains an element and some other nodes', () => {
  1142. // <div><h>first</h><p>lorem ipsum</p></div>[<p>foo</p><p>ba]r</p><div><h>second</h><p>lorem</p></div>
  1143. const range = new Range( new Position( root, [ 1 ] ), new Position( root, [ 2, 2 ] ) );
  1144. expect( range.getContainedElement() ).to.be.null;
  1145. } );
  1146. it( 'should return "null" if it fully contains a node but the node is not an element', () => {
  1147. // <div><h>first</h><p>lorem ipsum</p></div><p>foo</p><p>[bar]</p><div><h>second</h><p>lorem</p></div>
  1148. const range = new Range( new Position( root, [ 2, 0 ] ), new Position( root, [ 2, 3 ] ) );
  1149. expect( range.getContainedElement() ).to.be.null;
  1150. } );
  1151. } );
  1152. function mapNodesToNames( nodes ) {
  1153. return nodes.map( node => {
  1154. return ( node instanceof Element ) ? 'E:' + node.name : 'T:' + node.data;
  1155. } );
  1156. }
  1157. function prepareRichRoot() {
  1158. root._insertChild( 0, [
  1159. new Element( 'div', [], [
  1160. new Element( 'h', [], new Text( 'first' ) ),
  1161. new Element( 'p', [], new Text( 'lorem ipsum' ) )
  1162. ] ),
  1163. new Element( 'p', [], new Text( 'foo' ) ),
  1164. new Element( 'p', [], new Text( 'bar' ) ),
  1165. new Element( 'div', [], [
  1166. new Element( 'h', [], new Text( 'second' ) ),
  1167. new Element( 'p', [], new Text( 'lorem' ) )
  1168. ] )
  1169. ] );
  1170. }
  1171. } );