positioniterator.js 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  1. /**
  2. * @license Copyright (c) 2003-2016, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: treemodel */
  6. 'use strict';
  7. import Document from '/ckeditor5/core/treemodel/document.js';
  8. import Attribute from '/ckeditor5/core/treemodel/attribute.js';
  9. import Element from '/ckeditor5/core/treemodel/element.js';
  10. import Character from '/ckeditor5/core/treemodel/character.js';
  11. import Text from '/ckeditor5/core/treemodel/text.js';
  12. import PositionIterator from '/ckeditor5/core/treemodel/positioniterator.js';
  13. import Position from '/ckeditor5/core/treemodel/position.js';
  14. import Range from '/ckeditor5/core/treemodel/range.js';
  15. describe( 'range iterator', () => {
  16. let ELEMENT_ENTER, ELEMENT_LEAVE, CHARACTER, TEXT;
  17. let doc, expectedItems, expectedItemsMerged, root, img1, paragraph, b, a, r, img2, x;
  18. before( () => {
  19. ELEMENT_ENTER = PositionIterator.ELEMENT_ENTER;
  20. ELEMENT_LEAVE = PositionIterator.ELEMENT_LEAVE;
  21. CHARACTER = PositionIterator.CHARACTER;
  22. TEXT = PositionIterator.TEXT;
  23. doc = new Document();
  24. root = doc.createRoot( 'root' );
  25. // root
  26. // |- img1
  27. // |- p
  28. // |- B
  29. // |- A
  30. // |- R
  31. // |
  32. // |- img2
  33. // |
  34. // |- X
  35. let attrBoldTrue = new Attribute( 'bold', true );
  36. b = new Character( 'b', [ attrBoldTrue ] );
  37. a = new Character( 'a', [ attrBoldTrue ] );
  38. r = new Character( 'r' );
  39. img2 = new Element( 'img2' );
  40. x = new Character( 'x' );
  41. paragraph = new Element( 'p', [], [ b, a, r, img2, x ] );
  42. img1 = new Element( 'img1' );
  43. root.insertChildren( 0, [ img1, paragraph ] );
  44. expectedItems = [
  45. { type: ELEMENT_ENTER, node: img1 },
  46. { type: ELEMENT_LEAVE, node: img1 },
  47. { type: ELEMENT_ENTER, node: paragraph },
  48. { type: CHARACTER, node: b },
  49. { type: CHARACTER, node: a },
  50. { type: CHARACTER, node: r },
  51. { type: ELEMENT_ENTER, node: img2 },
  52. { type: ELEMENT_LEAVE, node: img2 },
  53. { type: CHARACTER, node: x },
  54. { type: ELEMENT_LEAVE, node: paragraph }
  55. ];
  56. expectedItemsMerged = [
  57. { type: ELEMENT_ENTER, node: img1 },
  58. { type: ELEMENT_LEAVE, node: img1 },
  59. { type: ELEMENT_ENTER, node: paragraph },
  60. { type: TEXT, node: new Text( 'ba', [ attrBoldTrue ] ) },
  61. { type: TEXT, node: new Text( 'r' ) },
  62. { type: ELEMENT_ENTER, node: img2 },
  63. { type: ELEMENT_LEAVE, node: img2 },
  64. { type: TEXT, node: new Text( 'x' ) },
  65. { type: ELEMENT_LEAVE, node: paragraph }
  66. ];
  67. } );
  68. it( 'should return next position', () => {
  69. let iterator = new PositionIterator( new Position( root, [ 0 ] ) ); // beginning of root
  70. let i, len;
  71. for ( i = 0, len = expectedItems.length; i < len; i++ ) {
  72. expect( iterator.next() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  73. }
  74. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  75. } );
  76. it( 'should return previous position', () => {
  77. let iterator = new PositionIterator( new Position( root, [ 2 ] ) ); // ending of root
  78. for ( let i = expectedItems.length - 1; i >= 0; i-- ) {
  79. expect( iterator.previous() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  80. }
  81. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  82. } );
  83. it( 'should return next position in the boundaries', () => {
  84. let start = new Position( root, [ 1, 0 ] ); // p, 0
  85. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  86. let iterator = new PositionIterator( new Range( start, end ) );
  87. let i, len;
  88. for ( i = 3, len = expectedItems.length; i < 7; i++ ) {
  89. expect( iterator.next() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  90. }
  91. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  92. } );
  93. it( 'should return previous position in the boundaries', () => {
  94. let start = new Position( root, [ 1, 0 ] ); // p, 0
  95. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  96. let iterator = new PositionIterator( new Range( start, end ), end );
  97. let i, len;
  98. for ( i = 6, len = expectedItems.length; i > 2; i-- ) {
  99. expect( iterator.previous() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  100. }
  101. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  102. } );
  103. it( 'should return iterate over the range', () => {
  104. let start = new Position( root, [ 0 ] ); // beginning of root
  105. let end = new Position( root, [ 2 ] ); // ending of root
  106. let range = new Range( start, end );
  107. let i = 0;
  108. for ( let value of range ) {
  109. expect( value ).to.deep.equal( expectedItems[ i ] );
  110. i++;
  111. }
  112. expect( i ).to.equal( expectedItems.length );
  113. } );
  114. it( 'should merge characters when iterating over the range using next', () => {
  115. let start = new Position( root, [ 0 ] ); // beginning of root
  116. let end = new Position( root, [ 2 ] ); // ending of root
  117. let range = new Range( start, end );
  118. let iterator = new PositionIterator( range, range.start, true );
  119. let step = iterator.next();
  120. let i = 0;
  121. while ( !step.done ) {
  122. expect( step.value ).to.deep.equal( expectedItemsMerged[ i ] );
  123. step = iterator.next();
  124. i++;
  125. }
  126. expect( i ).to.equal( expectedItemsMerged.length );
  127. } );
  128. it( 'should merge characters when iterating over the range using previous', () => {
  129. let start = new Position( root, [ 0 ] ); // beginning of root
  130. let end = new Position( root, [ 2 ] ); // ending of root
  131. let range = new Range( start, end );
  132. let iterator = new PositionIterator( range, range.end, true );
  133. let step = iterator.previous();
  134. let i = expectedItemsMerged.length;
  135. while ( !step.done ) {
  136. i--;
  137. expect( step.value ).to.deep.equal( expectedItemsMerged[ i ] );
  138. step = iterator.previous();
  139. }
  140. expect( i ).to.equal( 0 );
  141. } );
  142. } );