positioniterator.js 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  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 Text from '/ckeditor5/core/treemodel/text.js';
  11. import PositionIterator from '/ckeditor5/core/treemodel/positioniterator.js';
  12. import Position from '/ckeditor5/core/treemodel/position.js';
  13. import Range from '/ckeditor5/core/treemodel/range.js';
  14. describe( 'range iterator', () => {
  15. let ELEMENT_ENTER, ELEMENT_LEAVE, CHARACTER, TEXT;
  16. let doc, expectedItems, expectedItemsMerged, root, img1, paragraph, b, a, r, img2, x;
  17. before( () => {
  18. ELEMENT_ENTER = PositionIterator.ELEMENT_ENTER;
  19. ELEMENT_LEAVE = PositionIterator.ELEMENT_LEAVE;
  20. TEXT = PositionIterator.TEXT;
  21. doc = new Document();
  22. root = doc.createRoot( 'root' );
  23. // root
  24. // |- img1
  25. // |- p
  26. // |- B
  27. // |- A
  28. // |- R
  29. // |
  30. // |- img2
  31. // |
  32. // |- X
  33. let attrBoldTrue = new Attribute( 'bold', true );
  34. b = new Text( 'b', [ attrBoldTrue ] );
  35. a = new Text( 'a', [ attrBoldTrue ] );
  36. r = new Text( 'r' );
  37. img2 = new Element( 'img2' );
  38. x = new Text( 'x' );
  39. paragraph = new Element( 'p', [], [ b, a, r, img2, x ] );
  40. img1 = new Element( 'img1' );
  41. root.insertChildren( 0, [ img1, paragraph ] );
  42. expectedItems = [
  43. { type: ELEMENT_ENTER, node: img1 },
  44. { type: ELEMENT_LEAVE, node: img1 },
  45. { type: ELEMENT_ENTER, node: paragraph },
  46. { type: TEXT, text: 'b', attrs: [ attrBoldTrue ] },
  47. { type: TEXT, text: 'a', attrs: [ attrBoldTrue ] },
  48. { type: TEXT, text: 'r', attrs: [] },
  49. { type: ELEMENT_ENTER, node: img2 },
  50. { type: ELEMENT_LEAVE, node: img2 },
  51. { type: TEXT, text: 'x', attrs: [] },
  52. { type: ELEMENT_LEAVE, node: paragraph }
  53. ];
  54. expectedItemsMerged = [
  55. { type: ELEMENT_ENTER, node: img1 },
  56. { type: ELEMENT_LEAVE, node: img1 },
  57. { type: ELEMENT_ENTER, node: paragraph },
  58. { type: TEXT, text: 'ba', attrs: [ attrBoldTrue ] },
  59. { type: TEXT, text: 'r', attrs: [] },
  60. { type: ELEMENT_ENTER, node: img2 },
  61. { type: ELEMENT_LEAVE, node: img2 },
  62. { type: TEXT, text: 'x', attrs: [] },
  63. { type: ELEMENT_LEAVE, node: paragraph }
  64. ];
  65. } );
  66. function expectItem( item, expected ) {
  67. expect( item.done ).to.be.false;
  68. if ( item.value.type == TEXT ) {
  69. let text = item.value.node.text;
  70. expect( text ).to.equal( expected.text );
  71. expect( Array.from( item.value.node.attrs ) ).to.deep.equal( expected.attrs );
  72. } else {
  73. expect( item.value ).to.deep.equal( expected );
  74. }
  75. }
  76. it( 'should return next position', () => {
  77. let iterator = new PositionIterator( new Position( root, [ 0 ] ) ); // beginning of root
  78. let i, len;
  79. for ( i = 0, len = expectedItems.length; i < len; i++ ) {
  80. expectItem( iterator.next(), expectedItems[ i ] );
  81. }
  82. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  83. } );
  84. it( 'should return previous position', () => {
  85. let iterator = new PositionIterator( new Position( root, [ 2 ] ) ); // ending of root
  86. for ( let i = expectedItems.length - 1; i >= 0; i-- ) {
  87. expectItem( iterator.previous(), expectedItems[ i ] );
  88. }
  89. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  90. } );
  91. it( 'should return next position in the boundaries', () => {
  92. let start = new Position( root, [ 1, 0 ] ); // p, 0
  93. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  94. let iterator = new PositionIterator( new Range( start, end ) );
  95. let i, len;
  96. for ( i = 3, len = expectedItems.length; i < 7; i++ ) {
  97. expectItem( iterator.next(), expectedItems[ i ] );
  98. }
  99. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  100. } );
  101. it( 'should return previous position in the boundaries', () => {
  102. let start = new Position( root, [ 1, 0 ] ); // p, 0
  103. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  104. let iterator = new PositionIterator( new Range( start, end ), end );
  105. let i, len;
  106. for ( i = 6, len = expectedItems.length; i > 2; i-- ) {
  107. expectItem( iterator.previous(), expectedItems[ i ] );
  108. }
  109. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  110. } );
  111. it( 'should merge characters when iterating over the range using next', () => {
  112. let start = new Position( root, [ 1 ] );
  113. let end = new Position( root, [ 1, 4 ] );
  114. let range = new Range( start, end );
  115. let iterator = new PositionIterator( range, range.start, true );
  116. let i;
  117. for ( i = 2; i <= 6; i++ ) {
  118. expectItem( iterator.next(), expectedItemsMerged[ i ] );
  119. }
  120. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  121. } );
  122. it( 'should merge characters when iterating over the range using previous', () => {
  123. let start = new Position( root, [ 1 ] );
  124. let end = new Position( root, [ 1, 4 ] );
  125. let range = new Range( start, end );
  126. let iterator = new PositionIterator( range, range.end, true );
  127. for ( let i = 6; i >= 2; i-- ) {
  128. expectItem( iterator.previous(), expectedItemsMerged[ i ] );
  129. }
  130. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  131. } );
  132. it( 'should respect boundaries when iterating using next and merging characters', () => {
  133. let start = new Position( root, [ 1, 0 ] );
  134. let end = new Position( root, [ 1, 1 ] );
  135. let range = new Range( start, end );
  136. let iterator = new PositionIterator( range, range.start, true );
  137. let val = iterator.next();
  138. expect( val.done ).to.be.false;
  139. expect( val.value.node.text ).to.equal( 'b' );
  140. val = iterator.next();
  141. expect( val.done ).to.be.true;
  142. } );
  143. it( 'should respect boundaries when iterating using previous and merging characters', () => {
  144. let start = new Position( root, [ 1, 1 ] );
  145. let end = new Position( root, [ 1, 2 ] );
  146. let range = new Range( start, end );
  147. let iterator = new PositionIterator( range, range.end, true );
  148. let val = iterator.previous();
  149. expect( val.done ).to.be.false;
  150. expect( val.value.node.text ).to.equal( 'a' );
  151. val = iterator.previous();
  152. expect( val.done ).to.be.true;
  153. } );
  154. } );