mergedelta.js 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /**
  2. * @license Copyright (c) 2003-2017, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. import Document from '../../../src/model/document';
  6. import Position from '../../../src/model/position';
  7. import Element from '../../../src/model/element';
  8. import Text from '../../../src/model/text';
  9. import CKEditorError from '@ckeditor/ckeditor5-utils/src/ckeditorerror';
  10. import MergeDelta from '../../../src/model/delta/mergedelta';
  11. import SplitDelta from '../../../src/model/delta/splitdelta';
  12. import MoveOperation from '../../../src/model/operation/moveoperation';
  13. import RemoveOperation from '../../../src/model/operation/removeoperation';
  14. import ReinsertOperation from '../../../src/model/operation/reinsertoperation';
  15. import count from '@ckeditor/ckeditor5-utils/src/count';
  16. describe( 'Batch', () => {
  17. let doc, root, p1, p2, batch;
  18. beforeEach( () => {
  19. doc = new Document();
  20. root = doc.createRoot();
  21. p1 = new Element( 'p', { key1: 'value1' }, new Text( 'foo' ) );
  22. p2 = new Element( 'p', { key2: 'value2' }, new Text( 'bar' ) );
  23. root.insertChildren( 0, [ p1, p2 ] );
  24. } );
  25. describe( 'merge', () => {
  26. it( 'should merge foo and bar into foobar', () => {
  27. doc.batch().merge( new Position( root, [ 1 ] ) );
  28. expect( root.maxOffset ).to.equal( 1 );
  29. expect( root.getChild( 0 ).name ).to.equal( 'p' );
  30. expect( root.getChild( 0 ).maxOffset ).to.equal( 6 );
  31. expect( count( root.getChild( 0 ).getAttributes() ) ).to.equal( 1 );
  32. expect( root.getChild( 0 ).getAttribute( 'key1' ) ).to.equal( 'value1' );
  33. expect( root.getChild( 0 ).getChild( 0 ).data ).to.equal( 'foobar' );
  34. } );
  35. it( 'should throw if there is no element after', () => {
  36. expect( () => {
  37. doc.batch().merge( new Position( root, [ 2 ] ) );
  38. } ).to.throw( CKEditorError, /^batch-merge-no-element-after/ );
  39. } );
  40. it( 'should throw if there is no element before', () => {
  41. expect( () => {
  42. doc.batch().merge( new Position( root, [ 0, 2 ] ) );
  43. } ).to.throw( CKEditorError, /^batch-merge-no-element-before/ );
  44. } );
  45. it( 'should be chainable', () => {
  46. batch = doc.batch();
  47. const chain = batch.merge( new Position( root, [ 1 ] ) );
  48. expect( chain ).to.equal( batch );
  49. } );
  50. it( 'should add delta to batch and operation to delta before applying operation', () => {
  51. sinon.spy( doc, 'applyOperation' );
  52. batch = doc.batch().merge( new Position( root, [ 1 ] ) );
  53. const correctDeltaMatcher = sinon.match( operation => {
  54. return operation.delta && operation.delta.batch && operation.delta.batch == batch;
  55. } );
  56. expect( doc.applyOperation.calledWith( correctDeltaMatcher ) ).to.be.true;
  57. } );
  58. } );
  59. } );
  60. describe( 'MergeDelta', () => {
  61. let mergeDelta, doc, root;
  62. beforeEach( () => {
  63. doc = new Document();
  64. root = doc.createRoot();
  65. mergeDelta = new MergeDelta();
  66. } );
  67. describe( 'constructor()', () => {
  68. it( 'should create merge delta with no operations added', () => {
  69. expect( mergeDelta.operations.length ).to.equal( 0 );
  70. } );
  71. } );
  72. describe( 'type', () => {
  73. it( 'should be equal to merge', () => {
  74. expect( mergeDelta.type ).to.equal( 'merge' );
  75. } );
  76. } );
  77. describe( 'position', () => {
  78. it( 'should be null if there are no operations in delta', () => {
  79. expect( mergeDelta.position ).to.be.null;
  80. } );
  81. it( 'should be equal to the position between merged nodes', () => {
  82. mergeDelta.operations.push( new MoveOperation( new Position( root, [ 1, 2, 0 ] ), 4, new Position( root, [ 1, 1, 4 ] ) ) );
  83. mergeDelta.operations.push( new RemoveOperation( new Position( root, [ 1, 2, 0 ] ), 1, new Position( doc.graveyard, [ 0 ] ) ) );
  84. expect( mergeDelta.position.root ).to.equal( root );
  85. expect( mergeDelta.position.path ).to.deep.equal( [ 1, 2, 0 ] );
  86. } );
  87. } );
  88. describe( 'getReversed', () => {
  89. it( 'should return empty SplitDelta if there are no operations in delta', () => {
  90. const reversed = mergeDelta.getReversed();
  91. expect( reversed ).to.be.instanceof( SplitDelta );
  92. expect( reversed.operations.length ).to.equal( 0 );
  93. } );
  94. it( 'should return correct SplitDelta', () => {
  95. mergeDelta.operations.push( new MoveOperation( new Position( root, [ 1, 2, 0 ] ), 4, new Position( root, [ 1, 1, 4 ] ) ) );
  96. mergeDelta.operations.push( new RemoveOperation( new Position( root, [ 1, 2, 0 ] ), 1, new Position( doc.graveyard, [ 0 ] ) ) );
  97. const reversed = mergeDelta.getReversed();
  98. expect( reversed ).to.be.instanceof( SplitDelta );
  99. expect( reversed.operations.length ).to.equal( 2 );
  100. expect( reversed.operations[ 0 ] ).to.be.instanceof( ReinsertOperation );
  101. expect( reversed.operations[ 0 ].howMany ).to.equal( 1 );
  102. expect( reversed.operations[ 0 ].targetPosition.path ).to.deep.equal( [ 1, 2, 0 ] );
  103. expect( reversed.operations[ 1 ] ).to.be.instanceof( MoveOperation );
  104. expect( reversed.operations[ 1 ].sourcePosition.path ).to.deep.equal( [ 1, 1, 4 ] );
  105. expect( reversed.operations[ 1 ].howMany ).to.equal( 4 );
  106. expect( reversed.operations[ 1 ].targetPosition.path ).to.deep.equal( [ 1, 2, 0 ] );
  107. } );
  108. } );
  109. it( 'should provide proper className', () => {
  110. expect( MergeDelta.className ).to.equal( 'engine.model.delta.MergeDelta' );
  111. } );
  112. } );