8
0

removedelta.js 2.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
  1. /**
  2. * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: treemodel, delta */
  6. 'use strict';
  7. const modules = bender.amd.require(
  8. 'treemodel/document',
  9. 'treemodel/position',
  10. 'treemodel/range',
  11. 'treemodel/element'
  12. );
  13. describe( 'Batch', () => {
  14. let Document, Position, Range, Element;
  15. let doc, root, div, p, batch, chain;
  16. before( () => {
  17. Document = modules[ 'treemodel/document' ];
  18. Position = modules[ 'treemodel/position' ];
  19. Range = modules[ 'treemodel/range' ];
  20. Element = modules[ 'treemodel/element' ];
  21. } );
  22. beforeEach( () => {
  23. doc = new Document();
  24. root = doc.createRoot( 'root' );
  25. div = new Element( 'div', [], 'foobar' );
  26. p = new Element( 'p', [], 'abcxyz' );
  27. root.insertChildren( 0, [ div, p ] );
  28. batch = doc.batch();
  29. } );
  30. function getNodesAndText( element ) {
  31. let range = Range.createFromElement( element );
  32. let txt = '';
  33. for ( let step of range ) {
  34. let node = step.node;
  35. if ( node.character ) {
  36. txt += node.character.toLowerCase();
  37. } else if ( node.name ) {
  38. txt += node.name.toUpperCase();
  39. }
  40. }
  41. return txt;
  42. }
  43. describe( 'removeNode', () => {
  44. beforeEach( () => {
  45. chain = batch.removeNode( div );
  46. } );
  47. it( 'should remove specified node', () => {
  48. expect( root.getChildCount() ).to.equal( 1 );
  49. expect( getNodesAndText( root.getChild( 0 ) ) ).to.equal( 'abcxyz' );
  50. } );
  51. it( 'should be chainable', () => {
  52. expect( chain ).to.equal( batch );
  53. } );
  54. } );
  55. describe( 'remove', () => {
  56. beforeEach( () => {
  57. div.insertChildren( 4, [ new Element( 'p', [], 'gggg' ) ] );
  58. div.insertChildren( 2, [ new Element( 'p', [], 'hhhh' ) ] );
  59. // Range starts in ROOT > DIV > P > gg|gg.
  60. // Range ends in ROOT > DIV > ...|ar.
  61. let range = new Range( new Position( root, [ 0, 2, 2 ] ), new Position( root, [ 0, 6 ] ) );
  62. chain = batch.remove( range, new Position( root, [ 1, 3 ] ) );
  63. } );
  64. it( 'should move any range of nodes', () => {
  65. expect( getNodesAndText( root.getChild( 0 ) ) ).to.equal( 'foPhhPar' );
  66. expect( getNodesAndText( root.getChild( 1 ) ) ).to.equal( 'abcxyz' );
  67. } );
  68. it( 'should create minimal number of operations', () => {
  69. expect( batch.deltas.length ).to.equal( 1 );
  70. expect( batch.deltas[ 0 ].operations.length ).to.equal( 2 );
  71. } );
  72. it( 'should be chainable', () => {
  73. expect( chain ).to.equal( batch );
  74. } );
  75. } );
  76. } );