positioniterator.js 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127
  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 Element from '/ckeditor5/core/treemodel/element.js';
  9. import Character from '/ckeditor5/core/treemodel/character.js';
  10. import PositionIterator from '/ckeditor5/core/treemodel/positioniterator.js';
  11. import Position from '/ckeditor5/core/treemodel/position.js';
  12. import Range from '/ckeditor5/core/treemodel/range.js';
  13. describe( 'range iterator', () => {
  14. let ELEMENT_ENTER, ELEMENT_LEAVE, CHARACTER;
  15. let doc, expectedItems, root, img1, paragraph, b, a, r, img2, x;
  16. before( () => {
  17. ELEMENT_ENTER = PositionIterator.ELEMENT_ENTER;
  18. ELEMENT_LEAVE = PositionIterator.ELEMENT_LEAVE;
  19. CHARACTER = PositionIterator.CHARACTER;
  20. doc = new Document();
  21. root = doc.createRoot( 'root' );
  22. // root
  23. // |- img1
  24. // |- p
  25. // |- B
  26. // |- A
  27. // |- R
  28. // |
  29. // |- img2
  30. // |
  31. // |- X
  32. b = new Character( 'b' );
  33. a = new Character( 'a' );
  34. r = new Character( 'r' );
  35. img2 = new Element( 'img2' );
  36. x = new Character( 'x' );
  37. paragraph = new Element( 'p', [], [ b, a, r, img2, x ] );
  38. img1 = new Element( 'img1' );
  39. root.insertChildren( 0, [ img1, paragraph ] );
  40. expectedItems = [
  41. { type: ELEMENT_ENTER, node: img1 },
  42. { type: ELEMENT_LEAVE, node: img1 },
  43. { type: ELEMENT_ENTER, node: paragraph },
  44. { type: CHARACTER, node: b },
  45. { type: CHARACTER, node: a },
  46. { type: CHARACTER, node: r },
  47. { type: ELEMENT_ENTER, node: img2 },
  48. { type: ELEMENT_LEAVE, node: img2 },
  49. { type: CHARACTER, node: x },
  50. { type: ELEMENT_LEAVE, node: paragraph }
  51. ];
  52. } );
  53. it( 'should return next position', () => {
  54. let iterator = new PositionIterator( new Position( root, [ 0 ] ) ); // beginning of root
  55. let i, len;
  56. for ( i = 0, len = expectedItems.length; i < len; i++ ) {
  57. expect( iterator.next() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  58. }
  59. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  60. } );
  61. it( 'should return previous position', () => {
  62. let iterator = new PositionIterator( new Position( root, [ 2 ] ) ); // ending of root
  63. for ( let i = expectedItems.length - 1; i >= 0; i-- ) {
  64. expect( iterator.previous() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  65. }
  66. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  67. } );
  68. it( 'should return next position in the boundaries', () => {
  69. let start = new Position( root, [ 1, 0 ] ); // p, 0
  70. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  71. let iterator = new PositionIterator( new Range( start, end ) );
  72. let i, len;
  73. for ( i = 3, len = expectedItems.length; i < 7; i++ ) {
  74. expect( iterator.next() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  75. }
  76. expect( iterator.next() ).to.have.property( 'done' ).that.is.true;
  77. } );
  78. it( 'should return previous position in the boundaries', () => {
  79. let start = new Position( root, [ 1, 0 ] ); // p, 0
  80. let end = new Position( root, [ 1, 3, 0 ] ); // img, 0
  81. let iterator = new PositionIterator( new Range( start, end ), end );
  82. let i, len;
  83. for ( i = 6, len = expectedItems.length; i > 2; i-- ) {
  84. expect( iterator.previous() ).to.deep.equal( { done: false, value: expectedItems[ i ] } );
  85. }
  86. expect( iterator.previous() ).to.have.property( 'done' ).that.is.true;
  87. } );
  88. it( 'should return iterate over the range', () => {
  89. let start = new Position( root, [ 0 ] ); // begging of root
  90. let end = new Position( root, [ 2 ] ); // ending of root
  91. let range = new Range( start, end );
  92. let i = 0;
  93. let value;
  94. for ( value of range ) {
  95. expect( value ).to.deep.equal( expectedItems[ i ] );
  96. i++;
  97. }
  98. expect( i ).to.equal( expectedItems.length );
  99. } );
  100. } );