8
0

position.js 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491
  1. /**
  2. * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
  3. * For licensing, see LICENSE.md.
  4. */
  5. /* bender-tags: document */
  6. 'use strict';
  7. const modules = bender.amd.require(
  8. 'document/element',
  9. 'document/character',
  10. 'document/position',
  11. 'document/document',
  12. 'ckeditorerror',
  13. 'document/nodelist'
  14. );
  15. describe( 'position', () => {
  16. let Element, Character, Document, NodeList, Position, CKEditorError;
  17. let doc, root, otherRoot, p, ul, li1, li2, f, o, z, b, a, r;
  18. // root
  19. // |- p Before: [ 0 ] After: [ 1 ]
  20. // |- ul Before: [ 1 ] After: [ 2 ]
  21. // |- li Before: [ 1, 0 ] After: [ 1, 1 ]
  22. // | |- f Before: [ 1, 0, 0 ] After: [ 1, 0, 1 ]
  23. // | |- o Before: [ 1, 0, 1 ] After: [ 1, 0, 2 ]
  24. // | |- z Before: [ 1, 0, 2 ] After: [ 1, 0, 3 ]
  25. // |- li Before: [ 1, 1 ] After: [ 1, 2 ]
  26. // |- b Before: [ 1, 1, 0 ] After: [ 1, 1, 1 ]
  27. // |- a Before: [ 1, 1, 1 ] After: [ 1, 1, 2 ]
  28. // |- r Before: [ 1, 1, 2 ] After: [ 1, 1, 3 ]
  29. before( () => {
  30. Element = modules[ 'document/element' ];
  31. Character = modules[ 'document/character' ];
  32. Document = modules[ 'document/document' ];
  33. NodeList = modules[ 'document/nodelist' ];
  34. Position = modules[ 'document/position' ];
  35. CKEditorError = modules.ckeditorerror;
  36. doc = new Document();
  37. root = doc.createRoot( 'root' );
  38. otherRoot = doc.createRoot( 'otherRoot' );
  39. f = new Character( 'f' );
  40. o = new Character( 'o' );
  41. z = new Character( 'z' );
  42. li1 = new Element( 'li', [], [ f, o, z ] );
  43. b = new Character( 'b' );
  44. a = new Character( 'a' );
  45. r = new Character( 'r' );
  46. li2 = new Element( 'li', [], [ b, a, r ] );
  47. ul = new Element( 'ul', [], [ li1, li2 ] );
  48. p = new Element( 'p' );
  49. root.insertChildren( 0, [ p, ul ] );
  50. } );
  51. it( 'should create a position with path and document', () => {
  52. let position = new Position( [ 0 ], root );
  53. expect( position ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
  54. expect( position ).to.have.property( 'root' ).that.equals( root );
  55. } );
  56. it( 'should throw error if given root is not a RootElement instance', () => {
  57. expect( () => {
  58. new Position( [ 0 ] );
  59. } ).to.throw( CKEditorError, /position-root-not-rootelement/ );
  60. expect( () => {
  61. new Position( [ 0 ], new Element( 'p' ) );
  62. } ).to.throw( CKEditorError, /position-root-not-rootelement/ );
  63. } );
  64. it( 'should create positions form node and offset', () => {
  65. expect( Position.createFromParentAndOffset( root, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
  66. expect( Position.createFromParentAndOffset( root, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
  67. expect( Position.createFromParentAndOffset( root, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 2 ] );
  68. expect( Position.createFromParentAndOffset( p, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 0, 0 ] );
  69. expect( Position.createFromParentAndOffset( ul, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0 ] );
  70. expect( Position.createFromParentAndOffset( ul, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
  71. expect( Position.createFromParentAndOffset( ul, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 2 ] );
  72. expect( Position.createFromParentAndOffset( li1, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 0 ] );
  73. expect( Position.createFromParentAndOffset( li1, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
  74. expect( Position.createFromParentAndOffset( li1, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
  75. expect( Position.createFromParentAndOffset( li1, 3 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 3 ] );
  76. } );
  77. it( 'should create positions before elements', () => {
  78. expect( Position.createBefore( p ) ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
  79. expect( Position.createBefore( ul ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
  80. expect( Position.createBefore( li1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0 ] );
  81. expect( Position.createBefore( f ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 0 ] );
  82. expect( Position.createBefore( o ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
  83. expect( Position.createBefore( z ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
  84. expect( Position.createBefore( li2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
  85. expect( Position.createBefore( b ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 0 ] );
  86. expect( Position.createBefore( a ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 1 ] );
  87. expect( Position.createBefore( r ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 2 ] );
  88. } );
  89. it( 'should throw error if one try to create positions before root', () => {
  90. expect( () => {
  91. Position.createBefore( root );
  92. } ).to.throw( CKEditorError, /position-before-root/ );
  93. } );
  94. it( 'should create positions after elements', () => {
  95. expect( Position.createAfter( p ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
  96. expect( Position.createAfter( ul ) ).to.have.property( 'path' ).that.deep.equals( [ 2 ] );
  97. expect( Position.createAfter( li1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
  98. expect( Position.createAfter( f ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
  99. expect( Position.createAfter( o ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
  100. expect( Position.createAfter( z ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 3 ] );
  101. expect( Position.createAfter( li2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 2 ] );
  102. expect( Position.createAfter( b ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 1 ] );
  103. expect( Position.createAfter( a ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 2 ] );
  104. expect( Position.createAfter( r ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 3 ] );
  105. } );
  106. it( 'should throw error if one try to make positions after root', () => {
  107. expect( () => {
  108. Position.createAfter( root );
  109. } ).to.throw( CKEditorError, /position-after-root/ );
  110. } );
  111. it( 'should have parent', () => {
  112. expect( new Position( [ 0 ], root ) ).to.have.property( 'parent' ).that.equals( root );
  113. expect( new Position( [ 1 ], root ) ).to.have.property( 'parent' ).that.equals( root );
  114. expect( new Position( [ 2 ], root ) ).to.have.property( 'parent' ).that.equals( root );
  115. expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'parent' ).that.equals( p );
  116. expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
  117. expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
  118. expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
  119. expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
  120. expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
  121. expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
  122. expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
  123. } );
  124. it( 'should have offset', () => {
  125. expect( new Position( [ 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
  126. expect( new Position( [ 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
  127. expect( new Position( [ 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
  128. expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
  129. expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
  130. expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
  131. expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
  132. expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
  133. expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
  134. expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
  135. expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'offset' ).that.equals( 3 );
  136. } );
  137. it( 'should be able to set offset', () => {
  138. let position = new Position( [ 1, 0, 2 ], root );
  139. position.offset = 4;
  140. expect( position.offset ).to.equal( 4 );
  141. expect( position.path ).to.deep.equal( [ 1, 0, 4 ] );
  142. } );
  143. it( 'should have nodeBefore', () => {
  144. expect( new Position( [ 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
  145. expect( new Position( [ 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( p );
  146. expect( new Position( [ 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( ul );
  147. expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
  148. expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
  149. expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( li1 );
  150. expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( li2 );
  151. expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
  152. expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( f );
  153. expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( o );
  154. expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( z );
  155. } );
  156. it( 'should have nodeAfter', () => {
  157. expect( new Position( [ 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( p );
  158. expect( new Position( [ 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( ul );
  159. expect( new Position( [ 2 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
  160. expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
  161. expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( li1 );
  162. expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( li2 );
  163. expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
  164. expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( f );
  165. expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( o );
  166. expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( z );
  167. expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
  168. } );
  169. it( 'should have proper parent path', () => {
  170. let position = new Position( [ 1, 2, 3 ], root );
  171. expect( position.getParentPath() ).to.deep.equal( [ 1, 2 ] );
  172. } );
  173. it( 'should return a new, equal position when cloned', () => {
  174. const position = new Position( [ 1, 2, 3 ], root );
  175. const clone = position.clone();
  176. expect( clone ).not.to.be.equal( position ); // clone is not pointing to the same object as position
  177. expect( clone.isEqual( position ) ).to.be.true; // but they are equal in the position-sense
  178. expect( clone.path ).not.to.be.equal( position.path ); // make sure the paths are not the same array
  179. } );
  180. describe( 'isBefore', () => {
  181. it( 'should return true if given position has same root and is before this position', () => {
  182. let position = new Position( [ 1, 1, 2 ], root );
  183. let beforePosition = new Position( [ 1, 0 ], root );
  184. expect( position.isAfter( beforePosition ) ).to.be.true;
  185. } );
  186. it( 'should return false if given position has same root and is not before this position', () => {
  187. let position = new Position( [ 1, 1, 2 ], root );
  188. let afterPosition = new Position( [ 1, 2 ], root );
  189. expect( position.isAfter( afterPosition ) ).to.be.false;
  190. } );
  191. it( 'should return false if given position has different root', () => {
  192. let position = new Position( [ 1, 1, 2 ], root );
  193. let differentPosition = new Position( [ 1, 0 ], otherRoot );
  194. expect( position.isAfter( differentPosition ) ).to.be.false;
  195. } );
  196. } );
  197. describe( 'isEqual', () => {
  198. it( 'should return true if given position has same path and root', () => {
  199. let position = new Position( [ 1, 1, 2 ], root );
  200. let samePosition = new Position( [ 1, 1, 2 ], root );
  201. expect( position.isEqual( samePosition ) ).to.be.true;
  202. } );
  203. it( 'should return false if given position has different path', () => {
  204. let position = new Position( [ 1, 1, 1 ], root );
  205. let differentPosition = new Position( [ 1, 2, 2 ], root );
  206. expect( position.isEqual( differentPosition ) ).to.be.false;
  207. } );
  208. it( 'should return false if given position has different root', () => {
  209. let position = new Position( [ 1, 1, 1 ], root );
  210. let differentPosition = new Position( [ 1, 1, 1 ], otherRoot );
  211. expect( position.isEqual( differentPosition ) ).to.be.false;
  212. } );
  213. } );
  214. describe( 'isAfter', () => {
  215. it( 'should return true if given position has same root and is after this position', () => {
  216. let position = new Position( [ 1, 1, 2 ], root );
  217. let afterPosition = new Position( [ 1, 2 ], root );
  218. expect( position.isBefore( afterPosition ) ).to.be.true;
  219. } );
  220. it( 'should return false if given position has same root and is not after this position', () => {
  221. let position = new Position( [ 1, 1, 2 ], root );
  222. let beforePosition = new Position( [ 1, 0 ], root );
  223. expect( position.isBefore( beforePosition ) ).to.be.false;
  224. } );
  225. it( 'should return false if given position has different root', () => {
  226. let position = new Position( [ 1, 1, 2 ], root );
  227. let differentPosition = new Position( [ 1, 2 ], otherRoot );
  228. expect( position.isBefore( differentPosition ) ).to.be.false;
  229. } );
  230. } );
  231. describe( 'compareWith', () => {
  232. it( 'should return Position.SAME if positions are same', () => {
  233. const position = new Position( [ 1, 2, 3 ], root );
  234. const compared = new Position( [ 1, 2, 3 ], root );
  235. expect( position.compareWith( compared ) ).to.equal( Position.SAME );
  236. } );
  237. it( 'should return Position.BEFORE if the position is before compared one', () => {
  238. const position = new Position( [ 1, 2, 3 ], root );
  239. const compared = new Position( [ 1, 3 ], root );
  240. expect( position.compareWith( compared ) ).to.equal( Position.BEFORE );
  241. } );
  242. it( 'should return Position.AFTER if the position is after compared one', () => {
  243. const position = new Position( [ 1, 2, 3, 4 ], root );
  244. const compared = new Position( [ 1, 2, 3 ], root );
  245. expect( position.compareWith( compared ) ).to.equal( Position.AFTER );
  246. } );
  247. it( 'should return Position.DIFFERENT if positions are in different roots', () => {
  248. const position = new Position( [ 1, 2, 3 ], root );
  249. const compared = new Position( [ 1, 2, 3 ], otherRoot );
  250. expect( position.compareWith( compared ) ).to.equal( Position.DIFFERENT );
  251. } );
  252. } );
  253. describe( 'getTransformedByInsertion', () => {
  254. it( 'should return a new Position instance', () => {
  255. const position = new Position( [ 0 ], root );
  256. const transformed = position.getTransformedByInsertion( new Position( [ 2 ], root ), 4, false );
  257. expect( transformed ).not.to.equal( position );
  258. expect( transformed ).to.be.instanceof( Position );
  259. } );
  260. it( 'should increment offset if insertion is in the same parent and closer offset', () => {
  261. const position = new Position( [ 1, 2, 3 ], root );
  262. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2, 2 ], root ), 2, false );
  263. expect( transformed.offset ).to.equal( 5 );
  264. } );
  265. it( 'should not increment offset if insertion position is in different root', () => {
  266. const position = new Position( [ 1, 2, 3 ], root );
  267. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2, 2 ], otherRoot ), 2, false );
  268. expect( transformed.offset ).to.equal( 3 );
  269. } );
  270. it( 'should not increment offset if insertion is in the same parent and the same offset', () => {
  271. const position = new Position( [ 1, 2, 3 ], root );
  272. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2, 3 ], root ), 2, false );
  273. expect( transformed.offset ).to.equal( 3 );
  274. } );
  275. it( 'should increment offset if insertion is in the same parent and the same offset and it is inserted before', () => {
  276. const position = new Position( [ 1, 2, 3 ], root );
  277. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2, 3 ], root ), 2, true );
  278. expect( transformed.offset ).to.equal( 5 );
  279. } );
  280. it( 'should not increment offset if insertion is in the same parent and further offset', () => {
  281. const position = new Position( [ 1, 2, 3 ], root );
  282. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2, 4 ], root ), 2, false );
  283. expect( transformed.offset ).to.equal( 3 );
  284. } );
  285. it( 'should update path if insertion position parent is a node from that path and offset is before next node on that path', () => {
  286. const position = new Position( [ 1, 2, 3 ], root );
  287. const transformed = position.getTransformedByInsertion( new Position( [ 1, 2 ], root ), 2, false );
  288. expect( transformed.path ).to.deep.equal( [ 1, 4, 3 ] );
  289. } );
  290. it( 'should not update path if insertion position parent is a node from that path and offset is after next node on that path', () => {
  291. const position = new Position( [ 1, 2, 3 ], root );
  292. const transformed = position.getTransformedByInsertion( new Position( [ 1, 3 ], root ), 2, false );
  293. expect( transformed.path ).to.deep.equal( [ 1, 2, 3 ] );
  294. } );
  295. } );
  296. describe( 'getTransformedByDeletion', () => {
  297. it( 'should return a new Position instance', () => {
  298. const position = new Position( [ 0 ], root );
  299. const transformed = position.getTransformedByDeletion( new Position( [ 2 ], root ), 4 );
  300. expect( transformed ).not.to.equal( position );
  301. expect( transformed ).to.be.instanceof( Position );
  302. } );
  303. it( 'should return null if original position is inside one of removed nodes', () => {
  304. const position = new Position( [ 1, 2 ], root );
  305. const transformed = position.getTransformedByDeletion( new Position( [ 0 ], root ), 2 );
  306. expect( transformed ).to.be.null;
  307. } );
  308. it( 'should decrement offset if deletion is in the same parent and closer offset', () => {
  309. const position = new Position( [ 1, 2, 7 ], root );
  310. const transformed = position.getTransformedByDeletion( new Position( [ 1, 2, 2 ], root ), 2 );
  311. expect( transformed.offset ).to.equal( 5 );
  312. } );
  313. it( 'should set position offset to deletion offset if position is between removed nodes', () => {
  314. const position = new Position( [ 1, 2, 4 ], root );
  315. const transformed = position.getTransformedByDeletion( new Position( [ 1, 2, 3 ], root ), 5 );
  316. expect( transformed.offset ).to.equal( 3 );
  317. } );
  318. it( 'should not decrement offset if deletion position is in different root', () => {
  319. const position = new Position( [ 1, 2, 3 ], root );
  320. const transformed = position.getTransformedByDeletion( new Position( [ 1, 2, 1 ], otherRoot ), 2 );
  321. expect( transformed.offset ).to.equal( 3 );
  322. } );
  323. it( 'should not decrement offset if deletion is in the same parent and further offset', () => {
  324. const position = new Position( [ 1, 2, 3 ], root );
  325. const transformed = position.getTransformedByDeletion( new Position( [ 1, 2, 4 ], root ), 2 );
  326. expect( transformed.offset ).to.equal( 3 );
  327. } );
  328. it( 'should update path if deletion position parent is a node from that path and offset is before next node on that path', () => {
  329. const position = new Position( [ 1, 2, 3 ], root );
  330. const transformed = position.getTransformedByDeletion( new Position( [ 1, 0 ], root ), 2 );
  331. expect( transformed.path ).to.deep.equal( [ 1, 0, 3 ] );
  332. } );
  333. it( 'should not update path if deletion position parent is a node from that path and offset is after next node on that path', () => {
  334. const position = new Position( [ 1, 2, 3 ], root );
  335. const transformed = position.getTransformedByDeletion( new Position( [ 1, 3 ], root ), 2 );
  336. expect( transformed.path ).to.deep.equal( [ 1, 2, 3 ] );
  337. } );
  338. } );
  339. describe( 'getTransformedByMove', () => {
  340. it( 'should increment offset if a range was moved to the same parent and closer offset', () => {
  341. const position = new Position( [ 1, 2, 3 ], root );
  342. const transformed = position.getTransformedByMove( new Position( [ 2 ], root ), new Position( [ 1, 2, 0 ], root ), 3, false );
  343. expect( transformed.path ).to.deep.equal( [ 1, 2, 6 ] );
  344. } );
  345. it( 'should decrement offset if a range was moved from the same parent and closer offset', () => {
  346. const position = new Position( [ 1, 2, 3 ], root );
  347. const transformed = position.getTransformedByMove( new Position( [ 1, 2, 0 ], root ), new Position( [ 2 ], root ), 3, false );
  348. expect( transformed.path ).to.deep.equal( [ 1, 2, 0 ] );
  349. } );
  350. it( 'should update path if a range contained this position', () => {
  351. const position = new Position( [ 1, 2, 3 ], root );
  352. const transformed = position.getTransformedByMove( new Position( [ 1, 1 ], root ), new Position( [ 2, 1 ], root ), 3, false );
  353. expect( transformed.path ).to.deep.equal( [ 2, 2, 3 ] );
  354. } );
  355. } );
  356. describe( '_getCombined', () => {
  357. it( 'should return correct combination of this and given positions', () => {
  358. const position = new Position( [ 1, 3, 4, 2 ], root );
  359. const sourcePosition = new Position( [ 1, 1 ], root );
  360. const targetPosition = new Position( [ 2, 5 ], root );
  361. const combined = position._getCombined( sourcePosition, targetPosition );
  362. expect( combined.path ).to.deep.equal( [ 2, 7, 4, 2 ] );
  363. } );
  364. } );
  365. } );