8
0

removedelta.js 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  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, range;
  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. div.insertChildren( 4, [ new Element( 'p', [], 'gggg' ) ] );
  28. div.insertChildren( 2, [ new Element( 'p', [], 'hhhh' ) ] );
  29. root.insertChildren( 0, [ div, p ] );
  30. batch = doc.batch();
  31. // Range starts in ROOT > DIV > P > gg|gg.
  32. // Range ends in ROOT > DIV > ...|ar.
  33. range = new Range( new Position( root, [ 0, 2, 2 ] ), new Position( root, [ 0, 6 ] ) );
  34. } );
  35. function getNodesAndText( element ) {
  36. let range = Range.createFromElement( element );
  37. let txt = '';
  38. for ( let step of range ) {
  39. let node = step.node;
  40. if ( node.character ) {
  41. txt += node.character.toLowerCase();
  42. } else if ( node.name ) {
  43. txt += node.name.toUpperCase();
  44. }
  45. }
  46. return txt;
  47. }
  48. describe( 'remove', () => {
  49. it( 'should remove specified node', () => {
  50. batch.remove( div );
  51. expect( root.getChildCount() ).to.equal( 1 );
  52. expect( getNodesAndText( root.getChild( 0 ) ) ).to.equal( 'abcxyz' );
  53. } );
  54. it( 'should move any range of nodes', () => {
  55. batch.remove( range );
  56. expect( getNodesAndText( root.getChild( 0 ) ) ).to.equal( 'foPhhPar' );
  57. expect( getNodesAndText( root.getChild( 1 ) ) ).to.equal( 'abcxyz' );
  58. } );
  59. it( 'should create minimal number of operations when removing a range', () => {
  60. batch.remove( range );
  61. expect( batch.deltas.length ).to.equal( 1 );
  62. expect( batch.deltas[ 0 ].operations.length ).to.equal( 2 );
  63. } );
  64. it( 'should be chainable', () => {
  65. chain = batch.remove( range );
  66. expect( chain ).to.equal( batch );
  67. } );
  68. } );
  69. } );