|
@@ -0,0 +1,229 @@
|
|
|
|
|
+/**
|
|
|
|
|
+ * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
|
|
|
|
|
+ * For licensing, see LICENSE.md.
|
|
|
|
|
+ */
|
|
|
|
|
+
|
|
|
|
|
+/* bender-tags: document */
|
|
|
|
|
+
|
|
|
|
|
+'use strict';
|
|
|
|
|
+
|
|
|
|
|
+var modules = bender.amd.require(
|
|
|
|
|
+ 'document/element',
|
|
|
|
|
+ 'document/character',
|
|
|
|
|
+ 'document/position',
|
|
|
|
|
+ 'document/document',
|
|
|
|
|
+ 'ckeditorerror',
|
|
|
|
|
+ 'document/nodelist'
|
|
|
|
|
+);
|
|
|
|
|
+
|
|
|
|
|
+describe( 'position', function() {
|
|
|
|
|
+ var Element, Character, Document, NodeList, Position, CKEditorError;
|
|
|
|
|
+
|
|
|
|
|
+ var doc, root, p, ul, li1, li2, f, o, z, b, a, r;
|
|
|
|
|
+
|
|
|
|
|
+ // root
|
|
|
|
|
+ // |- p Before: [ 0 ] After: [ 1 ]
|
|
|
|
|
+ // |- ul Before: [ 1 ] After: [ 2 ]
|
|
|
|
|
+ // |- li Before: [ 1, 0 ] After: [ 1, 1 ]
|
|
|
|
|
+ // | |- f Before: [ 1, 0, 0 ] After: [ 1, 0, 1 ]
|
|
|
|
|
+ // | |- o Before: [ 1, 0, 1 ] After: [ 1, 0, 2 ]
|
|
|
|
|
+ // | |- z Before: [ 1, 0, 2 ] After: [ 1, 0, 3 ]
|
|
|
|
|
+ // |- li Before: [ 1, 1 ] After: [ 1, 2 ]
|
|
|
|
|
+ // |- b Before: [ 1, 1, 0 ] After: [ 1, 1, 1 ]
|
|
|
|
|
+ // |- a Before: [ 1, 1, 1 ] After: [ 1, 1, 2 ]
|
|
|
|
|
+ // |- r Before: [ 1, 1, 2 ] After: [ 1, 1, 3 ]
|
|
|
|
|
+ before( function() {
|
|
|
|
|
+ Element = modules[ 'document/element' ];
|
|
|
|
|
+ Character = modules[ 'document/character' ];
|
|
|
|
|
+ Document = modules[ 'document/document' ];
|
|
|
|
|
+ NodeList = modules[ 'document/nodelist' ];
|
|
|
|
|
+ Position = modules[ 'document/position' ];
|
|
|
|
|
+ CKEditorError = modules.ckeditorerror;
|
|
|
|
|
+
|
|
|
|
|
+ doc = new Document();
|
|
|
|
|
+
|
|
|
|
|
+ root = doc.createRoot( 'root' );
|
|
|
|
|
+
|
|
|
|
|
+ f = new Character( 'f' );
|
|
|
|
|
+ o = new Character( 'o' );
|
|
|
|
|
+ z = new Character( 'z' );
|
|
|
|
|
+
|
|
|
|
|
+ li1 = new Element( 'li', [], [ f, o, z ] );
|
|
|
|
|
+
|
|
|
|
|
+ b = new Character( 'b' );
|
|
|
|
|
+ a = new Character( 'a' );
|
|
|
|
|
+ r = new Character( 'r' );
|
|
|
|
|
+
|
|
|
|
|
+ li2 = new Element( 'li', [], [ b, a, r ] );
|
|
|
|
|
+
|
|
|
|
|
+ ul = new Element( 'ul', [], [ li1, li2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ p = new Element( 'p' );
|
|
|
|
|
+
|
|
|
|
|
+ root.insertChildren( 0, [ p, ul ] );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should create a position with path and document', function() {
|
|
|
|
|
+ var position = new Position( [ 0 ], root );
|
|
|
|
|
+
|
|
|
|
|
+ expect( position ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
|
|
|
|
|
+ expect( position ).to.have.property( 'root' ).that.equals( root );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should make positions form node and offset', function() {
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( root, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( root, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( root, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( p, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 0, 0 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( ul, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( ul, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( ul, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( li1, 0 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 0 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( li1, 1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( li1, 2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
|
|
|
|
|
+ expect( Position.createFromParentAndOffset( li1, 3 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 3 ] );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should make positions before elements', function() {
|
|
|
|
|
+ expect( Position.createBefore( p ) ).to.have.property( 'path' ).that.deep.equals( [ 0 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createBefore( ul ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createBefore( li1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createBefore( f ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 0 ] );
|
|
|
|
|
+ expect( Position.createBefore( o ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
|
|
|
|
|
+ expect( Position.createBefore( z ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createBefore( li2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createBefore( b ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 0 ] );
|
|
|
|
|
+ expect( Position.createBefore( a ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 1 ] );
|
|
|
|
|
+ expect( Position.createBefore( r ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 2 ] );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should throw error if one try to make positions before root', function() {
|
|
|
|
|
+ expect(
|
|
|
|
|
+ function() {
|
|
|
|
|
+ Position.createBefore( root );
|
|
|
|
|
+ }
|
|
|
|
|
+ ).to.throw( CKEditorError, /position-before-root/ );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should make positions after elements', function() {
|
|
|
|
|
+ expect( Position.createAfter( p ) ).to.have.property( 'path' ).that.deep.equals( [ 1 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createAfter( ul ) ).to.have.property( 'path' ).that.deep.equals( [ 2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createAfter( li1 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createAfter( f ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 1 ] );
|
|
|
|
|
+ expect( Position.createAfter( o ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 2 ] );
|
|
|
|
|
+ expect( Position.createAfter( z ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 0, 3 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createAfter( li2 ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 2 ] );
|
|
|
|
|
+
|
|
|
|
|
+ expect( Position.createAfter( b ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 1 ] );
|
|
|
|
|
+ expect( Position.createAfter( a ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 2 ] );
|
|
|
|
|
+ expect( Position.createAfter( r ) ).to.have.property( 'path' ).that.deep.equals( [ 1, 1, 3 ] );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should throw error if one try to make positions after root', function() {
|
|
|
|
|
+ expect(
|
|
|
|
|
+ function() {
|
|
|
|
|
+ Position.createAfter( root );
|
|
|
|
|
+ }
|
|
|
|
|
+ ).to.throw( CKEditorError, /position-after-root/ );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should have parent', function() {
|
|
|
|
|
+ expect( new Position( [ 0 ], root ) ).to.have.property( 'parent' ).that.equals( root );
|
|
|
|
|
+ expect( new Position( [ 1 ], root ) ).to.have.property( 'parent' ).that.equals( root );
|
|
|
|
|
+ expect( new Position( [ 2 ], root ) ).to.have.property( 'parent' ).that.equals( root );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'parent' ).that.equals( p );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
|
|
|
|
|
+ expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
|
|
|
|
|
+ expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'parent' ).that.equals( ul );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'parent' ).that.equals( li1 );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should have offset', function() {
|
|
|
|
|
+ expect( new Position( [ 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
|
|
|
|
|
+ expect( new Position( [ 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
|
|
|
|
|
+ expect( new Position( [ 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
|
|
|
|
|
+ expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
|
|
|
|
|
+ expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'offset' ).that.equals( 0 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'offset' ).that.equals( 1 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'offset' ).that.equals( 2 );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'offset' ).that.equals( 3 );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should have nodeBefore', function() {
|
|
|
|
|
+ expect( new Position( [ 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
|
|
|
|
|
+ expect( new Position( [ 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( p );
|
|
|
|
|
+ expect( new Position( [ 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( ul );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
|
|
|
|
|
+ expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( li1 );
|
|
|
|
|
+ expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( li2 );
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'nodeBefore' ).that.is.null;
|
|
|
|
|
+ expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( f );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( o );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'nodeBefore' ).that.equals( z );
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should have nodeAfter', function() {
|
|
|
|
|
+ expect( new Position( [ 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( p );
|
|
|
|
|
+ expect( new Position( [ 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( ul );
|
|
|
|
|
+ expect( new Position( [ 2 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 0, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( li1 );
|
|
|
|
|
+ expect( new Position( [ 1, 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( li2 );
|
|
|
|
|
+ expect( new Position( [ 1, 2 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
|
|
|
|
|
+
|
|
|
|
|
+ expect( new Position( [ 1, 0, 0 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( f );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 1 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( o );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 2 ], root ) ).to.have.property( 'nodeAfter' ).that.equals( z );
|
|
|
|
|
+ expect( new Position( [ 1, 0, 3 ], root ) ).to.have.property( 'nodeAfter' ).that.is.null;
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should equals another position with the same path', function() {
|
|
|
|
|
+ var position = new Position( [ 1, 1, 2 ], root );
|
|
|
|
|
+ var samePosition = new Position( [ 1, 1, 2 ], root );
|
|
|
|
|
+
|
|
|
|
|
+ expect( position.isEqual( samePosition ) ).to.be.true;
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should not equals another position with the different path', function() {
|
|
|
|
|
+ var position = new Position( [ 1, 1, 1 ], root );
|
|
|
|
|
+ var differentNode = new Position( [ 1, 2, 2 ], root );
|
|
|
|
|
+
|
|
|
|
|
+ expect( position.isEqual( differentNode ) ).to.be.false;
|
|
|
|
|
+ } );
|
|
|
|
|
+
|
|
|
|
|
+ it( 'should have proper parent path', function() {
|
|
|
|
|
+ var position = new Position( [ 1, 2, 3 ], root );
|
|
|
|
|
+
|
|
|
|
|
+ expect( position.getParentPath() ).to.deep.equal( [ 1, 2 ] );
|
|
|
|
|
+ } );
|
|
|
|
|
+} );
|