moveoperation.js 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103
  1. /**
  2. * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: document */
  6. /* global describe, before, beforeEach, it, expect */
  7. 'use strict';
  8. const modules = bender.amd.require(
  9. 'document/document',
  10. 'document/operation/moveoperation',
  11. 'document/operation/insertoperation',
  12. 'document/operation/changeoperation',
  13. 'document/operation/nooperation',
  14. 'document/attribute',
  15. 'document/position',
  16. 'document/range',
  17. 'document/element',
  18. 'document/node',
  19. 'document/nodelist',
  20. 'ckeditorerror'
  21. );
  22. describe( 'MoveOperation', () => {
  23. let Document, MoveOperation, InsertOperation, ChangeOperation, NoOperation,
  24. Attribute, Position, Range, Element, Node, NodeList, CKEditorError;
  25. before( () => {
  26. Document = modules[ 'document/document' ];
  27. MoveOperation = modules[ 'document/operation/moveoperation' ];
  28. InsertOperation = modules[ 'document/operation/insertoperation' ];
  29. ChangeOperation = modules[ 'document/operation/changeoperation' ];
  30. NoOperation = modules[ 'document/operation/nooperation' ];
  31. Attribute = modules[ 'document/attribute' ];
  32. Position = modules[ 'document/position' ];
  33. Range = modules[ 'document/range' ];
  34. Element = modules[ 'document/element' ];
  35. Node = modules[ 'document/node' ];
  36. NodeList = modules[ 'document/nodelist' ];
  37. CKEditorError = modules.ckeditorerror;
  38. } );
  39. let doc, root;
  40. beforeEach( () => {
  41. doc = new Document();
  42. root = doc.createRoot( 'root' );
  43. } );
  44. it( 'should move from one node to another', () => {
  45. let p1 = new Element( 'p1', [], new Element( 'x' ) );
  46. let p2 = new Element( 'p2' );
  47. root.insertChildren( 0, [ p1, p2 ] );
  48. doc.applyOperation(
  49. new MoveOperation(
  50. new Position( [ 0, 0 ], root ),
  51. new Position( [ 1, 0 ], root ),
  52. 1,
  53. doc.version
  54. )
  55. );
  56. expect( doc.version ).to.equal( 1 );
  57. expect( root.getChildCount() ).to.equal( 2 );
  58. expect( root.getChild( 0 ).name ).to.equal( 'p1' );
  59. expect( root.getChild( 1 ).name ).to.equal( 'p2' );
  60. expect( p1.getChildCount() ).to.equal( 0 );
  61. expect( p2.getChildCount() ).to.equal( 1 );
  62. expect( p2.getChild( 0 ).name ).to.equal( 'x' );
  63. } );
  64. it( 'should move position of children in one node backward', () => {
  65. root.insertChildren( 0, 'xbarx' );
  66. doc.applyOperation(
  67. new MoveOperation(
  68. new Position( [ 2 ], root ),
  69. new Position( [ 1 ], root ),
  70. 2,
  71. doc.version
  72. )
  73. );
  74. expect( doc.version ).to.equal( 1 );
  75. expect( root.getChildCount() ).to.equal( 5 );
  76. expect( root.getChild( 0 ).character ).to.equal( 'x' );
  77. expect( root.getChild( 1 ).character ).to.equal( 'a' );
  78. expect( root.getChild( 2 ).character ).to.equal( 'r' );
  79. expect( root.getChild( 3 ).character ).to.equal( 'b' );
  80. expect( root.getChild( 4 ).character ).to.equal( 'x' );
  81. } );
  82. it( 'should move position of children in one node forward', () => {
  83. root.insertChildren( 0, 'xbarx' );
  84. doc.applyOperation(
  85. new MoveOperation(
  86. new Position( [ 1 ], root ),
  87. new Position( [ 4 ], root ),
  88. 2,
  89. doc.version
  90. )
  91. );
  92. expect( doc.version ).to.equal( 1 );
  93. expect( root.getChildCount() ).to.equal( 5 );
  94. expect( root.getChild( 0 ).character ).to.equal( 'x' );
  95. expect( root.getChild( 1 ).character ).to.equal( 'r' );
  96. expect( root.getChild( 2 ).character ).to.equal( 'b' );
  97. expect( root.getChild( 3 ).character ).to.equal( 'a' );
  98. expect( root.getChild( 4 ).character ).to.equal( 'x' );
  99. } );
  100. it( 'should create a move operation as a reverse', () => {
  101. let nodeList = new NodeList( 'bar' );
  102. let sourcePosition = new Position( [ 0 ], root );
  103. let targetPosition = new Position( [ 4 ], root );
  104. let operation = new MoveOperation( sourcePosition, targetPosition, nodeList.length, doc.version );
  105. let reverse = operation.getReversed();
  106. expect( reverse ).to.be.an.instanceof( MoveOperation );
  107. expect( reverse.baseVersion ).to.equal( 1 );
  108. expect( reverse.howMany ).to.equal( nodeList.length );
  109. expect( reverse.sourcePosition.isEqual( targetPosition ) ).to.be.true;
  110. expect( reverse.targetPosition.isEqual( sourcePosition ) ).to.be.true;
  111. } );
  112. it( 'should undo move node by applying reverse operation', () => {
  113. let p1 = new Element( 'p1', [], new Element( 'x' ) );
  114. let p2 = new Element( 'p2' );
  115. root.insertChildren( 0, [ p1, p2 ] );
  116. let operation = new MoveOperation(
  117. new Position( [ 0, 0 ], root ),
  118. new Position( [ 1, 0 ], root ),
  119. 1,
  120. doc.version
  121. );
  122. doc.applyOperation( operation );
  123. expect( doc.version ).to.equal( 1 );
  124. expect( root.getChildCount() ).to.equal( 2 );
  125. expect( p1.getChildCount() ).to.equal( 0 );
  126. expect( p2.getChildCount() ).to.equal( 1 );
  127. expect( p2.getChild( 0 ).name ).to.equal( 'x' );
  128. doc.applyOperation( operation.getReversed() );
  129. expect( doc.version ).to.equal( 2 );
  130. expect( root.getChildCount() ).to.equal( 2 );
  131. expect( p1.getChildCount() ).to.equal( 1 );
  132. expect( p1.getChild( 0 ).name ).to.equal( 'x' );
  133. expect( p2.getChildCount() ).to.equal( 0 );
  134. } );
  135. it( 'should throw an error if number of nodes to move exceeds the number of existing nodes in given element', () => {
  136. root.insertChildren( 0, 'xbarx' );
  137. let operation = new MoveOperation(
  138. new Position( [ 3 ], root ),
  139. new Position( [ 1 ], root ),
  140. 3,
  141. doc.version
  142. );
  143. expect( () => doc.applyOperation( operation ) ).to.throw( CKEditorError, /operation-move-nodes-do-not-exist/ );
  144. } );
  145. it( 'should throw an error if target or source parent-element specified by position does not exist', () => {
  146. let p = new Element( 'p' );
  147. p.insertChildren( 0, 'foo' );
  148. root.insertChildren( 0, [ 'ab', p ] );
  149. let operation = new MoveOperation(
  150. new Position( [ 2, 0 ], root ),
  151. new Position( [ 1 ], root ),
  152. 3,
  153. doc.version
  154. );
  155. root.removeChildren( 2, 1 );
  156. expect( () => doc.applyOperation( operation ) ).to.throw( CKEditorError, /operation-move-position-invalid/ );
  157. } );
  158. it( 'should throw an error if operation tries to move a range between the beginning and the end of that range', () => {
  159. root.insertChildren( 0, 'xbarx' );
  160. let operation = new MoveOperation(
  161. new Position( [ 1 ], root ),
  162. new Position( [ 2 ], root ),
  163. 3,
  164. doc.version
  165. );
  166. expect( () => doc.applyOperation( operation ) ).to.throw( CKEditorError, /operation-move-range-into-itself/ );
  167. } );
  168. it( 'should throw an error if operation tries to move a range into a sub-tree of a node that is in that range', () => {
  169. let p = new Element( 'p', [], [ new Element( 'p' ) ] );
  170. root.insertChildren( 0, [ 'ab', p, 'xy' ] );
  171. let operation = new MoveOperation(
  172. new Position( [ 1 ], root ),
  173. new Position( [ 2, 0, 0 ], root ),
  174. 3,
  175. doc.version
  176. );
  177. expect( () => doc.applyOperation( operation ) ).to.throw( CKEditorError, /operation-move-node-into-itself/ );
  178. } );
  179. it( 'should not throw an error if operation move a range into a sibling', () => {
  180. let p = new Element( 'p' );
  181. root.insertChildren( 0, [ 'ab', p, 'xy' ] );
  182. let operation = new MoveOperation(
  183. new Position( [ 1 ], root ),
  184. new Position( [ 2, 0 ], root ),
  185. 1,
  186. doc.version
  187. );
  188. expect(
  189. () => {
  190. doc.applyOperation( operation );
  191. }
  192. ).not.to.throw();
  193. expect( root.getChildCount() ).to.equal( 4 );
  194. expect( p.getChildCount() ).to.equal( 1 );
  195. expect( p.getChild( 0 ).character ).to.equal( 'b' );
  196. } );
  197. it( 'should create operation with the same parameters when cloned', () => {
  198. let sourcePosition = new Position( [ 0 ], root );
  199. let targetPosition = new Position( [ 1 ], root );
  200. let howMany = 4;
  201. let baseVersion = doc.version;
  202. let op = new MoveOperation( sourcePosition, targetPosition, howMany, baseVersion );
  203. let clone = op.clone();
  204. // New instance rather than a pointer to the old instance.
  205. expect( clone ).not.to.be.equal( op );
  206. expect( clone ).to.be.instanceof( MoveOperation );
  207. expect( clone.sourcePosition.isEqual( sourcePosition ) ).to.be.true;
  208. expect( clone.targetPosition.isEqual( targetPosition ) ).to.be.true;
  209. expect( clone.howMany ).to.equal( howMany );
  210. expect( clone.baseVersion ).to.equal( baseVersion );
  211. } );
  212. describe( 'getTransformedBy', () => {
  213. let nodeA, nodeB, op, baseVersion, sourcePosition, targetPosition, rangeEnd, howMany, expected;
  214. beforeEach( () => {
  215. nodeA = new Node();
  216. nodeB = new Node();
  217. baseVersion = doc.version;
  218. sourcePosition = new Position( [ 2, 2, 4 ], root );
  219. targetPosition = new Position( [ 3, 3, 3 ], root );
  220. howMany = 2;
  221. rangeEnd = sourcePosition.clone();
  222. rangeEnd.offset += howMany;
  223. op = new MoveOperation( sourcePosition, targetPosition, howMany, baseVersion );
  224. expected = {
  225. type: MoveOperation,
  226. sourcePosition: sourcePosition.clone(),
  227. targetPosition: targetPosition.clone(),
  228. howMany: howMany,
  229. baseVersion: baseVersion + 1
  230. };
  231. } );
  232. function expectOperation( op, params ) {
  233. for ( let i in params ) {
  234. if ( params.hasOwnProperty( i ) ) {
  235. if ( i == 'type' ) {
  236. expect( op ).to.be.instanceof( params[ i ] );
  237. }
  238. else if ( params[ i ] instanceof Array ) {
  239. expect( op[ i ].length ).to.equal( params[ i ].length );
  240. for ( let j = 0; j < params[ i ].length; j++ ) {
  241. expect( op[ i ][ j ] ).to.equal( params[ i ][ j ] );
  242. }
  243. } else if ( params[ i ] instanceof Position || params[ i ] instanceof Range ) {
  244. expect( op[ i ].isEqual( params[ i ] ) ).to.be.true;
  245. } else {
  246. expect( op[ i ] ).to.equal( params[ i ] );
  247. }
  248. }
  249. }
  250. }
  251. describe( 'InsertOperation', () => {
  252. // insert in different spots than move op
  253. it( 'should not change if origin and destination are different than insert address', () => {
  254. let transformBy = new InsertOperation(
  255. new Position( [ 1, 3, 2 ], root ),
  256. [ nodeA, nodeB ],
  257. baseVersion
  258. );
  259. let transOp = op.getTransformedBy( transformBy );
  260. expectOperation( transOp[ 0 ], expected );
  261. } );
  262. // insert inside moved node
  263. it( 'should not change if insert was inside moved sub-tree', () => {
  264. let transformBy = new InsertOperation(
  265. new Position( [ 2, 2, 3, 1 ], root ),
  266. [ nodeA, nodeB ],
  267. baseVersion
  268. );
  269. let transOp = op.getTransformedBy( transformBy );
  270. expectOperation( transOp[ 0 ], expected );
  271. } );
  272. // insert before to moved node
  273. it( 'should increment origin offset if insert was in the same parent but before moved node', () => {
  274. let transformBy = new InsertOperation(
  275. new Position( [ 2, 2, 0 ], root ),
  276. [ nodeA, nodeB ],
  277. baseVersion
  278. );
  279. let transOp = op.getTransformedBy( transformBy );
  280. expected.sourcePosition.offset += 2;
  281. expectOperation( transOp[ 0 ], expected );
  282. } );
  283. // insert after to moved node
  284. it( 'should not increment offset if insert was in the same parent but after moved node', () => {
  285. let transformBy = new InsertOperation(
  286. new Position( [ 2, 2, 6 ], root ),
  287. [ nodeA, nodeB ],
  288. baseVersion
  289. );
  290. let transOp = op.getTransformedBy( transformBy );
  291. expectOperation( transOp[ 0 ], expected );
  292. } );
  293. // insert next to a path to moved node
  294. it( 'should update origin path if insert was before a node from that path', () => {
  295. let transformBy = new InsertOperation(
  296. new Position( [ 2, 0 ], root ),
  297. [ nodeA, nodeB ],
  298. baseVersion
  299. );
  300. let transOp = op.getTransformedBy( transformBy );
  301. expected.sourcePosition.path[ 1 ] += 2;
  302. expectOperation( transOp[ 0 ], expected );
  303. } );
  304. it( 'should not update origin path if insert was after a node from that path', () => {
  305. let transformBy = new InsertOperation(
  306. new Position( [ 2, 3 ], root ),
  307. [ nodeA, nodeB ],
  308. baseVersion
  309. );
  310. let transOp = op.getTransformedBy( transformBy );
  311. expectOperation( transOp[ 0 ], expected );
  312. } );
  313. // insert before to moved node
  314. it( 'should increment destination offset if insert was in the same parent but before moved node', () => {
  315. let transformBy = new InsertOperation(
  316. new Position( [ 3, 3, 2 ], root ),
  317. [ nodeA, nodeB ],
  318. baseVersion
  319. );
  320. let transOp = op.getTransformedBy( transformBy );
  321. expected.targetPosition.offset += 2;
  322. expectOperation( transOp[ 0 ], expected );
  323. } );
  324. // insert after to moved node
  325. it( 'should not increment destination offset if insert was in the same parent but after moved node', () => {
  326. let transformBy = new InsertOperation(
  327. new Position( [ 3, 3, 4 ], root ),
  328. [ nodeA, nodeB ],
  329. baseVersion
  330. );
  331. let transOp = op.getTransformedBy( transformBy );
  332. expectOperation( transOp[ 0 ], expected );
  333. } );
  334. // insert next to a path to moved node
  335. it( 'should update destination path if insert was before a node from that path', () => {
  336. let transformBy = new InsertOperation(
  337. new Position( [ 3, 0 ], root ),
  338. [ nodeA, nodeB ],
  339. baseVersion
  340. );
  341. let transOp = op.getTransformedBy( transformBy );
  342. expected.targetPosition.path[ 1 ] += 2;
  343. expectOperation( transOp[ 0 ], expected );
  344. } );
  345. it( 'should not update destination path if insert was after a node from that path', () => {
  346. let transformBy = new InsertOperation(
  347. new Position( [ 3, 6 ], root ),
  348. [ nodeA, nodeB ],
  349. baseVersion
  350. );
  351. let transOp = op.getTransformedBy( transformBy );
  352. expectOperation( transOp[ 0 ], expected );
  353. } );
  354. it( 'should increment destination offset if insert is on the same position and move operation is weaker', () => {
  355. let transformBy = new InsertOperation(
  356. new Position( [ 3, 3, 3 ], root ),
  357. [ nodeA, nodeB ],
  358. baseVersion
  359. );
  360. let transOp = op.getTransformedBy( transformBy );
  361. expected.targetPosition.offset += 2;
  362. expectOperation( transOp[ 0 ], expected );
  363. } );
  364. it( 'should not increment destination offset if insert is on the same position and move operation is stronger', () => {
  365. let transformBy = new InsertOperation(
  366. new Position( [ 3, 3, 3 ], root ),
  367. [ nodeA, nodeB ],
  368. baseVersion
  369. );
  370. let transOp = op.getTransformedBy( transformBy, true );
  371. expectOperation( transOp[ 0 ], expected );
  372. } );
  373. it( 'should update destination path if insert is at the same offset and move operation is weaker', () => {
  374. let transformBy = new InsertOperation(
  375. new Position( [ 3, 3 ], root ),
  376. [ nodeA, nodeB ],
  377. baseVersion
  378. );
  379. let transOp = op.getTransformedBy( transformBy );
  380. expected.targetPosition.path[ 1 ] += 2;
  381. expectOperation( transOp[ 0 ], expected );
  382. } );
  383. it( 'should be split into two operations if insert was inside the moved range', () => {
  384. let transformBy = new InsertOperation(
  385. new Position( [ 2, 2, 5 ], root ),
  386. [ nodeA, nodeB ],
  387. baseVersion
  388. );
  389. let transOp = op.getTransformedBy( transformBy );
  390. expect( transOp ).to.be.instanceof( Array );
  391. expect( transOp.length ).to.equal( 2 );
  392. expected.sourcePosition.path = [ 2, 2, 7 ];
  393. expected.howMany = 1;
  394. expectOperation( transOp[ 0 ], expected );
  395. expected.sourcePosition.path = [ 2, 2, 4 ];
  396. expected.howMany = 1;
  397. expected.baseVersion++;
  398. expectOperation( transOp[ 1 ], expected );
  399. } );
  400. } );
  401. describe( 'ChangeOperation', () => {
  402. it( 'should not get updated', () => {
  403. let transformBy = new ChangeOperation(
  404. new Range( sourcePosition, rangeEnd ),
  405. new Attribute( 'abc', true ),
  406. new Attribute( 'abc', false ),
  407. baseVersion
  408. );
  409. let transOp = op.getTransformedBy( transformBy );
  410. expectOperation( transOp[ 0 ], expected );
  411. } );
  412. } );
  413. describe( 'MoveOperation', () => {
  414. it( 'should not change if both operations are happening in different parts of tree', () => {
  415. let transformBy = new MoveOperation(
  416. new Position( [ 1, 2 ], root ),
  417. new Position( [ 4, 1, 0 ], root ),
  418. 3,
  419. baseVersion
  420. );
  421. let transOp = op.getTransformedBy( transformBy );
  422. expectOperation( transOp[ 0 ], expected );
  423. } );
  424. describe( 'when incoming move origin node does not and is not contained by on-site move origin node', () => {
  425. it( 'should increment origin offset if affected by on-site move-to', () => {
  426. let transformBy = new MoveOperation(
  427. new Position( [ 4, 1, 0 ], root ),
  428. new Position( [ 2, 2, 0 ], root ),
  429. 2,
  430. baseVersion
  431. );
  432. let transOp = op.getTransformedBy( transformBy );
  433. expected.sourcePosition.offset += 2;
  434. expectOperation( transOp[ 0 ], expected );
  435. } );
  436. it( 'should decrement origin offset if affected by on-site move-out', () => {
  437. let transformBy = new MoveOperation(
  438. new Position( [ 2, 2, 0 ], root ),
  439. new Position( [ 4, 1, 0 ], root ),
  440. 2,
  441. baseVersion
  442. );
  443. let transOp = op.getTransformedBy( transformBy );
  444. expected.sourcePosition.offset -= 2;
  445. expectOperation( transOp[ 0 ], expected );
  446. } );
  447. it( 'should not decrement origin offset if on-site moved range is after incoming moved range', () => {
  448. let transformBy = new MoveOperation(
  449. new Position( [ 2, 2, 9 ], root ),
  450. new Position( [ 4, 1, 0 ], root ),
  451. 2,
  452. baseVersion
  453. );
  454. let transOp = op.getTransformedBy( transformBy, true );
  455. expectOperation( transOp[ 0 ], expected );
  456. } );
  457. it( 'should update origin path if affected by on-site move-to', () => {
  458. let transformBy = new MoveOperation(
  459. new Position( [ 4, 1, 0 ], root ),
  460. new Position( [ 2, 1 ], root ),
  461. 2,
  462. baseVersion
  463. );
  464. let transOp = op.getTransformedBy( transformBy );
  465. expected.sourcePosition.path[ 1 ] += 2;
  466. expectOperation( transOp[ 0 ], expected );
  467. } );
  468. it( 'should not update origin path if on-site moved range is after a node from that path', () => {
  469. let transformBy = new MoveOperation(
  470. new Position( [ 2, 3 ], root ),
  471. new Position( [ 4, 1, 0 ], root ),
  472. 2,
  473. baseVersion
  474. );
  475. let transOp = op.getTransformedBy( transformBy );
  476. expectOperation( transOp[ 0 ], expected );
  477. } );
  478. it( 'should update destination path if affected by on-site move-to', () => {
  479. let transformBy = new MoveOperation(
  480. new Position( [ 4, 1, 0 ], root ),
  481. new Position( [ 3, 1 ], root ),
  482. 2,
  483. baseVersion
  484. );
  485. let transOp = op.getTransformedBy( transformBy );
  486. expected.targetPosition.path[ 1 ] += 2;
  487. expectOperation( transOp[ 0 ], expected );
  488. } );
  489. it( 'should update origin path if affected by on-site move-out', () => {
  490. let transformBy = new MoveOperation(
  491. new Position( [ 2, 0 ], root ),
  492. new Position( [ 4, 1, 0 ], root ),
  493. 2,
  494. baseVersion
  495. );
  496. let transOp = op.getTransformedBy( transformBy );
  497. expected.sourcePosition.path[ 1 ] -= 2;
  498. expectOperation( transOp[ 0 ], expected );
  499. } );
  500. it( 'should update origin path if affected by on-site move-out', () => {
  501. let transformBy = new MoveOperation(
  502. new Position( [ 3, 0 ], root ),
  503. new Position( [ 4, 1, 0 ], root ),
  504. 2,
  505. baseVersion
  506. );
  507. let transOp = op.getTransformedBy( transformBy );
  508. expected.targetPosition.path[ 1 ] -= 2;
  509. expectOperation( transOp[ 0 ], expected );
  510. } );
  511. it( 'should decrement destination offset if affected by on-site move-out', () => {
  512. let transformBy = new MoveOperation(
  513. new Position( [ 3, 3, 0 ], root ),
  514. new Position( [ 4, 1, 0 ], root ),
  515. 2,
  516. baseVersion
  517. );
  518. let transOp = op.getTransformedBy( transformBy );
  519. expected.targetPosition.offset -= 2;
  520. expectOperation( transOp[ 0 ], expected );
  521. } );
  522. it( 'should increment destination offset affected by on-site move-to', () => {
  523. let transformBy = new MoveOperation(
  524. new Position( [ 4, 1, 0 ], root ),
  525. new Position( [ 3, 3, 0 ], root ),
  526. 2,
  527. baseVersion
  528. );
  529. let transOp = op.getTransformedBy( transformBy );
  530. expected.targetPosition.offset += 2;
  531. expectOperation( transOp[ 0 ], expected );
  532. } );
  533. it( 'should get split into two operations if on-site move-to was inside incoming move range', () => {
  534. let transformBy = new MoveOperation(
  535. new Position( [ 4, 1, 0 ], root ),
  536. new Position( [ 2, 2, 5 ], root ),
  537. 2,
  538. baseVersion
  539. );
  540. let transOp = op.getTransformedBy( transformBy );
  541. expect( transOp ).to.be.instanceof( Array );
  542. expect( transOp.length ).to.equal( 2 );
  543. expected.howMany = 1;
  544. expected.sourcePosition.offset = 7;
  545. expectOperation( transOp[ 0 ], expected );
  546. expected.sourcePosition.offset = 4;
  547. expected.baseVersion++;
  548. expectOperation( transOp[ 1 ], expected );
  549. } );
  550. } );
  551. describe( 'when incoming move origin node sub-tree contains on-site move origin', () => {
  552. it( 'should increment origin offset if affected by on-site move-to', () => {
  553. let transformBy = new MoveOperation(
  554. new Position( [ 2, 2, 5, 1 ], root ),
  555. new Position( [ 2, 2, 0 ], root ),
  556. 2,
  557. baseVersion
  558. );
  559. let transOp = op.getTransformedBy( transformBy );
  560. expected.sourcePosition.offset += 2;
  561. expectOperation( transOp[ 0 ], expected );
  562. } );
  563. it( 'should update origin path if affected by on-site move-to', () => {
  564. let transformBy = new MoveOperation(
  565. new Position( [ 2, 2, 5, 1 ], root ),
  566. new Position( [ 2, 1 ], root ),
  567. 2,
  568. baseVersion
  569. );
  570. let transOp = op.getTransformedBy( transformBy );
  571. expected.sourcePosition.path[ 1 ] += 2;
  572. expectOperation( transOp[ 0 ], expected );
  573. } );
  574. it( 'should update destination path if affected by on-site move-to', () => {
  575. let transformBy = new MoveOperation(
  576. new Position( [ 2, 2, 5, 1 ], root ),
  577. new Position( [ 3, 1 ], root ),
  578. 2,
  579. baseVersion
  580. );
  581. let transOp = op.getTransformedBy( transformBy );
  582. expected.targetPosition.path[ 1 ] += 2;
  583. expectOperation( transOp[ 0 ], expected );
  584. } );
  585. it( 'should increment destination offset affected by on-site move-to', () => {
  586. let transformBy = new MoveOperation(
  587. new Position( [ 2, 2, 5, 1 ], root ),
  588. new Position( [ 3, 3, 0 ], root ),
  589. 2,
  590. baseVersion
  591. );
  592. let transOp = op.getTransformedBy( transformBy );
  593. expected.targetPosition.offset += 2;
  594. expectOperation( transOp[ 0 ], expected );
  595. } );
  596. it( 'should get split into two operations if on-site move-to was inside incoming move range', () => {
  597. let transformBy = new MoveOperation(
  598. new Position( [ 2, 2, 5, 1 ], root ),
  599. new Position( [ 2, 2, 5 ], root ),
  600. 2,
  601. baseVersion
  602. );
  603. let transOp = op.getTransformedBy( transformBy );
  604. expect( transOp ).to.be.instanceof( Array );
  605. expect( transOp.length ).to.equal( 2 );
  606. expected.howMany = 1;
  607. expected.sourcePosition.offset = 7;
  608. expectOperation( transOp[ 0 ], expected );
  609. expected.sourcePosition.offset = 4;
  610. expected.baseVersion++;
  611. expectOperation( transOp[ 1 ], expected );
  612. } );
  613. } );
  614. it( 'should not change if on-site move is from non-affecting position to inside of moved sub-tree', () => {
  615. let transformBy = new MoveOperation(
  616. new Position( [ 4, 1, 0 ], root ),
  617. new Position( [ 2, 2, 5, 1 ], root ),
  618. 2,
  619. baseVersion
  620. );
  621. let transOp = op.getTransformedBy( transformBy );
  622. expectOperation( transOp[ 0 ], expected );
  623. } );
  624. it( 'should update origin address if on-site move origin node sub-tree includes incoming move origin node', () => {
  625. let transformBy = new MoveOperation(
  626. new Position( [ 2, 1 ], root ),
  627. new Position( [ 4, 2 ], root ),
  628. 3,
  629. baseVersion
  630. );
  631. let transOp = op.getTransformedBy( transformBy );
  632. expected.sourcePosition.path = [ 4, 3, 4 ];
  633. expectOperation( transOp[ 0 ], expected );
  634. } );
  635. it( 'should update destination address if incoming move destination is inside of on-site moved sub-tree', () => {
  636. let transformBy = new MoveOperation(
  637. new Position( [ 3, 2 ], root ),
  638. new Position( [ 0, 1 ], root ),
  639. 3,
  640. baseVersion
  641. );
  642. let transOp = op.getTransformedBy( transformBy );
  643. expected.targetPosition.path = [ 0, 2, 3 ];
  644. expectOperation( transOp[ 0 ], expected );
  645. } );
  646. describe( 'when both move operations\' destinations are inside of moved sub-trees', () => {
  647. it( 'should be changed to operation reversing site-on move', () => {
  648. let transformBy = new MoveOperation(
  649. new Position( [ 3, 2 ], root ),
  650. new Position( [ 2, 2, 5, 0 ], root ),
  651. 3,
  652. baseVersion
  653. );
  654. let transOp = op.getTransformedBy( transformBy );
  655. let reversed = transformBy.getReversed();
  656. expected.sourcePosition = reversed.sourcePosition;
  657. expected.targetPosition = reversed.targetPosition;
  658. expected.howMany = reversed.howMany;
  659. expectOperation( transOp[ 0 ], expected );
  660. } );
  661. } );
  662. describe( 'when both move operations have same range', () => {
  663. it( 'should be changed to no-op if incoming operation is weaker', () => {
  664. let transformBy = new MoveOperation(
  665. op.sourcePosition.clone(),
  666. new Position( [ 4, 1, 0 ], root ),
  667. op.howMany,
  668. baseVersion
  669. );
  670. let transOp = op.getTransformedBy( transformBy );
  671. expectOperation( transOp[ 0 ], {
  672. type: NoOperation,
  673. baseVersion: baseVersion + 1
  674. } );
  675. } );
  676. it( 'should have it\'s origin address changed if incoming operation is stronger', () => {
  677. let transformBy = new MoveOperation(
  678. op.sourcePosition.clone(),
  679. new Position( [ 4, 1, 0 ], root ),
  680. op.howMany,
  681. baseVersion
  682. );
  683. let transOp = op.getTransformedBy( transformBy, true );
  684. expected.sourcePosition.path = [ 4, 1, 0 ];
  685. expectOperation( transOp[ 0 ], expected );
  686. } );
  687. } );
  688. describe( 'when incoming range is contained by on-site range', () => {
  689. it( 'should be changed to no-op if incoming operation is weaker', () => {
  690. let transformBy = new MoveOperation(
  691. new Position( [ 2, 2, 3 ], root ),
  692. new Position( [ 4, 1, 0 ], root ),
  693. 4,
  694. baseVersion
  695. );
  696. let transOp = op.getTransformedBy( transformBy );
  697. expectOperation( transOp[ 0 ], {
  698. type: NoOperation,
  699. baseVersion: baseVersion + 1
  700. } );
  701. } );
  702. it( 'should have it\'s origin address changed if incoming operation has higher site id', () => {
  703. let transformBy = new MoveOperation(
  704. new Position( [ 2, 2, 3 ], root ),
  705. new Position( [ 4, 1, 0 ], root ),
  706. 4,
  707. baseVersion
  708. );
  709. let transOp = op.getTransformedBy( transformBy, true );
  710. expected.sourcePosition.path = [ 4, 1, 1 ];
  711. expectOperation( transOp[ 0 ], expected );
  712. } );
  713. } );
  714. describe( 'when incoming range intersects on right-side with on-site range', () => {
  715. it( 'should get shrunk if it is weaker', () => {
  716. let transformBy = new MoveOperation(
  717. new Position( [ 2, 2, 3 ], root ),
  718. new Position( [ 4, 1, 0 ], root ),
  719. 2,
  720. baseVersion
  721. );
  722. let transOp = op.getTransformedBy( transformBy );
  723. expected.sourcePosition.path = [ 2, 2, 3 ];
  724. expected.howMany = 1;
  725. expectOperation( transOp[ 0 ], expected );
  726. } );
  727. it( 'should get split into two operations if it is stronger', () => {
  728. let transformBy = new MoveOperation(
  729. new Position( [ 2, 2, 3 ], root ),
  730. new Position( [ 4, 1, 0 ], root ),
  731. 2,
  732. baseVersion
  733. );
  734. let transOp = op.getTransformedBy( transformBy, true );
  735. expect( transOp ).to.be.instanceof( Array );
  736. expect( transOp.length ).to.equal( 2 );
  737. expected.sourcePosition.path = [ 2, 2, 3 ];
  738. expectOperation( transOp[ 0 ], {
  739. type: MoveOperation,
  740. sourcePosition: new Position( [ 4, 1, 1 ], root ),
  741. targetPosition: expected.targetPosition,
  742. howMany: 1,
  743. baseVersion: expected.baseVersion
  744. } );
  745. expected.howMany = 1;
  746. expected.baseVersion++;
  747. expectOperation( transOp[ 1 ], expected );
  748. } );
  749. } );
  750. describe( 'when incoming range intersects on left-side with on-site range', () => {
  751. it( 'should get shrunk if it has lower site id', () => {
  752. let transformBy = new MoveOperation(
  753. new Position( [ 2, 2, 5 ], root ),
  754. new Position( [ 4, 1, 0 ], root ),
  755. 2,
  756. baseVersion
  757. );
  758. let transOp = op.getTransformedBy( transformBy );
  759. expected.howMany = 1;
  760. expectOperation( transOp[ 0 ], expected );
  761. } );
  762. it( 'should get split into two operations (one of them with updated address and offset) if it has higher site id', () => {
  763. let transformBy = new MoveOperation(
  764. new Position( [ 2, 2, 5 ], root ),
  765. new Position( [ 4, 1, 0 ], root ),
  766. 2,
  767. baseVersion
  768. );
  769. let transOp = op.getTransformedBy( transformBy, true );
  770. expect( transOp ).to.be.instanceof( Array );
  771. expect( transOp.length ).to.equal( 2 );
  772. expectOperation( transOp[ 0 ], {
  773. type: MoveOperation,
  774. sourcePosition: new Position( [ 4, 1, 0 ], root ),
  775. targetPosition: expected.targetPosition,
  776. howMany: 1,
  777. baseVersion: expected.baseVersion
  778. } );
  779. expected.howMany = 1;
  780. expected.baseVersion++;
  781. expectOperation( transOp[ 1 ], expected );
  782. } );
  783. } );
  784. describe( 'when incoming range contains on-site range', () => {
  785. it( 'should get shrunk if it has lower site id', () => {
  786. op.howMany = 4;
  787. let transformBy = new MoveOperation(
  788. new Position( [ 2, 2, 5 ], root ),
  789. new Position( [ 4, 1, 0 ], root ),
  790. 2,
  791. baseVersion
  792. );
  793. let transOp = op.getTransformedBy( transformBy );
  794. expected.howMany = 2;
  795. expectOperation( transOp[ 0 ], expected );
  796. } );
  797. it( 'should get split into two operations if it has higher site id', () => {
  798. op.howMany = 4;
  799. let transformBy = new MoveOperation(
  800. new Position( [ 2, 2, 5 ], root ),
  801. new Position( [ 4, 1, 0 ], root ),
  802. 2,
  803. baseVersion
  804. );
  805. let transOp = op.getTransformedBy( transformBy, true );
  806. expect( transOp ).to.be.instanceof( Array );
  807. expect( transOp.length ).to.equal( 2 );
  808. expectOperation( transOp[ 0 ], {
  809. type: MoveOperation,
  810. sourcePosition: new Position( [ 4, 1, 0 ], root ),
  811. targetPosition: expected.targetPosition,
  812. howMany: 2,
  813. baseVersion: expected.baseVersion
  814. } );
  815. expected.howMany = 2;
  816. expected.baseVersion++;
  817. expectOperation( transOp[ 1 ], expected );
  818. } );
  819. it( 'should get split into three operations if it has higher site id and on-site destination is inside moved range', () => {
  820. op.howMany = 6;
  821. let transformBy = new MoveOperation(
  822. new Position( [ 2, 2, 5 ], root ),
  823. new Position( [ 2, 2, 9 ], root ),
  824. 2,
  825. baseVersion
  826. );
  827. let transOp = op.getTransformedBy( transformBy, true );
  828. expect( transOp ).to.be.instanceof( Array );
  829. expect( transOp.length ).to.equal( 3 );
  830. expected.sourcePosition.path = [ 2, 2, 9 ];
  831. expected.howMany = 1;
  832. expectOperation( transOp[ 0 ], expected );
  833. expected.sourcePosition.path = [ 2, 2, 7 ];
  834. expected.howMany = 2;
  835. expected.baseVersion++;
  836. expectOperation( transOp[ 1 ], expected );
  837. expected.sourcePosition.path = [ 2, 2, 4 ];
  838. expected.howMany = 3;
  839. expected.baseVersion++;
  840. expectOperation( transOp[ 2 ], expected );
  841. } );
  842. } );
  843. } );
  844. } );
  845. } );