| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525 |
- /**
- * @license Copyright (c) 2003-2015, CKSource - Frederico Knabben. All rights reserved.
- * For licensing, see LICENSE.md.
- */
- /* bender-tags: document */
- /* global describe, before, beforeEach, it, expect */
- 'use strict';
- const modules = bender.amd.require(
- 'document/document',
- 'document/node',
- 'document/nodelist',
- 'document/operation/insertoperation',
- 'document/operation/removeoperation',
- 'document/operation/changeoperation',
- 'document/operation/moveoperation',
- 'document/operation/nooperation',
- 'document/position',
- 'document/range',
- 'document/character',
- 'document/nodelist',
- 'document/attribute'
- );
- describe( 'InsertOperation', () => {
- let Document, Node, NodeList, InsertOperation, RemoveOperation, ChangeOperation,
- MoveOperation, NoOperation, Position, Range, Character, Attribute;
- before( () => {
- Document = modules[ 'document/document' ];
- Node = modules[ 'document/node' ];
- NodeList = modules[ 'document/nodelist' ];
- InsertOperation = modules[ 'document/operation/insertoperation' ];
- RemoveOperation = modules[ 'document/operation/removeoperation' ];
- ChangeOperation = modules[ 'document/operation/changeoperation' ];
- MoveOperation = modules[ 'document/operation/moveoperation' ];
- NoOperation = modules[ 'document/operation/nooperation' ];
- Position = modules[ 'document/position' ];
- Range = modules[ 'document/range' ];
- Character = modules[ 'document/character' ];
- Attribute = modules[ 'document/attribute' ];
- } );
- let doc, root;
- beforeEach( () => {
- doc = new Document();
- root = doc.createRoot( 'root' );
- } );
- it( 'should insert node', () => {
- doc.applyOperation(
- new InsertOperation(
- new Position( [ 0 ], root ),
- new Character( 'x' ),
- doc.version
- )
- );
- expect( doc.version ).to.equal( 1 );
- expect( root.getChildCount() ).to.equal( 1 );
- expect( root.getChild( 0 ).character ).to.equal( 'x' );
- } );
- it( 'should insert set of nodes', () => {
- doc.applyOperation(
- new InsertOperation(
- new Position( [ 0 ], root ),
- 'bar',
- doc.version
- )
- );
- expect( doc.version ).to.equal( 1 );
- expect( root.getChildCount() ).to.equal( 3 );
- expect( root.getChild( 0 ).character ).to.equal( 'b' );
- expect( root.getChild( 1 ).character ).to.equal( 'a' );
- expect( root.getChild( 2 ).character ).to.equal( 'r' );
- } );
- it( 'should insert between existing nodes', () => {
- root.insertChildren( 0, 'xy' );
- doc.applyOperation(
- new InsertOperation(
- new Position( [ 1 ], root ),
- 'bar',
- doc.version
- )
- );
- expect( doc.version ).to.equal( 1 );
- expect( root.getChildCount() ).to.equal( 5 );
- expect( root.getChild( 0 ).character ).to.equal( 'x' );
- expect( root.getChild( 1 ).character ).to.equal( 'b' );
- expect( root.getChild( 2 ).character ).to.equal( 'a' );
- expect( root.getChild( 3 ).character ).to.equal( 'r' );
- expect( root.getChild( 4 ).character ).to.equal( 'y' );
- } );
- it( 'should insert text', () => {
- doc.applyOperation(
- new InsertOperation(
- new Position( [ 0 ], root ),
- [ 'foo', new Character( 'x' ), 'bar' ],
- doc.version
- )
- );
- expect( doc.version ).to.equal( 1 );
- expect( root.getChildCount() ).to.equal( 7 );
- expect( root.getChild( 0 ).character ).to.equal( 'f' );
- expect( root.getChild( 1 ).character ).to.equal( 'o' );
- expect( root.getChild( 2 ).character ).to.equal( 'o' );
- expect( root.getChild( 3 ).character ).to.equal( 'x' );
- expect( root.getChild( 4 ).character ).to.equal( 'b' );
- expect( root.getChild( 5 ).character ).to.equal( 'a' );
- expect( root.getChild( 6 ).character ).to.equal( 'r' );
- } );
- it( 'should create a remove operation as a reverse', () => {
- let position = new Position( [ 0 ], root );
- let operation = new InsertOperation(
- position,
- [ 'foo', new Character( 'x' ), 'bar' ],
- 0
- );
- let reverse = operation.getReversed();
- expect( reverse ).to.be.an.instanceof( RemoveOperation );
- expect( reverse.baseVersion ).to.equal( 1 );
- expect( reverse.sourcePosition ).to.equal( position );
- expect( reverse.howMany ).to.equal( 7 );
- } );
- it( 'should undo insert node by applying reverse operation', () => {
- let operation = new InsertOperation(
- new Position( [ 0 ], root ),
- new Character( 'x' ),
- doc.version
- );
- let reverse = operation.getReversed();
- doc.applyOperation( operation );
- expect( doc.version ).to.equal( 1 );
- doc.applyOperation( reverse );
- expect( doc.version ).to.equal( 2 );
- expect( root.getChildCount() ).to.equal( 0 );
- } );
- it( 'should undo insert set of nodes by applying reverse operation', () => {
- let operation = new InsertOperation(
- new Position( [ 0 ], root ),
- 'bar',
- doc.version
- );
- let reverse = operation.getReversed();
- doc.applyOperation( operation );
- expect( doc.version ).to.equal( 1 );
- doc.applyOperation( reverse );
- expect( doc.version ).to.equal( 2 );
- expect( root.getChildCount() ).to.equal( 0 );
- } );
- it( 'should create operation with the same parameters when cloned', () => {
- let position = new Position( [ 0 ], root );
- let nodeA = new Node();
- let nodeB = new Node();
- let nodes = new NodeList( [ nodeA, nodeB ] );
- let baseVersion = doc.version;
- let op = new InsertOperation( position, nodes, baseVersion );
- let clone = op.clone();
- // New instance rather than a pointer to the old instance.
- expect( clone ).not.to.be.equal( op );
- expect( clone ).to.be.instanceof( InsertOperation );
- expect( clone.position.isEqual( position ) ).to.be.true;
- expect( clone.nodeList.get( 0 ) ).to.equal( nodeA );
- expect( clone.nodeList.get( 1 ) ).to.equal( nodeB );
- expect( clone.nodeList.length ).to.equal( 2 );
- expect( clone.baseVersion ).to.equal( baseVersion );
- } );
- describe( 'getTransformedBy', () => {
- let nodeA, nodeB, nodeC, nodeD, position, op, baseVersion, expected;
- beforeEach( () => {
- nodeA = new Node();
- nodeB = new Node();
- nodeC = new Node();
- nodeD = new Node();
- baseVersion = doc.version;
- position = new Position( [ 0, 2, 1 ], root );
- op = new InsertOperation( position, [ nodeA, nodeB ], baseVersion );
- expected = {
- type: InsertOperation,
- position: position.clone(),
- baseVersion: baseVersion + 1
- };
- } );
- function expectOperation( op, params ) {
- for ( let i in params ) {
- if ( params.hasOwnProperty( i ) ) {
- if ( i == 'type' ) {
- expect( op ).to.be.instanceof( params[ i ] );
- }
- else if ( params[ i ] instanceof Array ) {
- expect( op[ i ].length ).to.equal( params[ i ].length );
- for ( let j = 0; j < params[ i ].length; j++ ) {
- expect( op[ i ][ j ] ).to.equal( params[ i ][ j ] );
- }
- } else if ( params[ i ] instanceof Position || params[ i ] instanceof Range ) {
- expect( op[ i ].isEqual( params[ i ] ) ).to.be.true;
- } else {
- expect( op[ i ] ).to.equal( params[ i ] );
- }
- }
- }
- }
- describe( 'InsertOperation', () => {
- it( 'should not change when positions are different', () => {
- let transformBy = new InsertOperation(
- new Position( [ 1, 3, 2 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should increment offset if addresses are same and offset is after applied operation', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 2, 0 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should increment offset if positions are same and operation to transform is weaker', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 2, 1 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not increment offset if positions are same and operation to transform is stronger', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 2, 1 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy, true );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not increment offset if addresses are same and offset is before applied operation', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 2, 2 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should update address at node(i) if applied operation\'s address was a prefix and its offset is before node(i)', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 1 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.path[ 1 ] += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not update address at node(i) if applied operation\'s address was a prefix and its offset is after node(i)', () => {
- let transformBy = new InsertOperation(
- new Position( [ 0, 6 ], root ),
- [ nodeC, nodeD ],
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- } );
- describe( 'ChangeOperation', () => {
- it( 'should not get updated', () => {
- let rangeStart = position.clone();
- let rangeEnd = position.clone();
- rangeEnd.offset += 2;
- let transformBy = new ChangeOperation(
- new Range( rangeStart, rangeEnd ),
- null,
- new Attribute( 'foo', 'bar' ),
- baseVersion
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- } );
- describe( 'MoveOperation', () => {
- it( 'should not change if insert is in different path than move origin and destination', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 3, 2 ], root ),
- new Position( [ 2, 1 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should have it\'s address merged with destination address if insert was inside moved node sub-tree', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 1 ], root ),
- new Position( [ 1, 1 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.path = [ 1, 2, 1 ];
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should decrement offset if address is same as move origin and insert offset is after moved node offset', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 2, 0 ], root ),
- new Position( [ 1, 1 ], root ),
- 1
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset--;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not decrement offset if address is same as move origin and insert offset is after moved node offset', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 2, 4 ], root ),
- new Position( [ 1, 1 ], root ),
- 1
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should increment offset if address is same as move destination and insert offset is after move-to offset', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 1 ], root ),
- new Position( [ 0, 2, 0 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not increment offset if address is same as move destination and insert offset is before move-to offset', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 1 ], root ),
- new Position( [ 0, 2, 4 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should increment offset if position is same as move operation and insert operation is weaker', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 1 ], root ),
- new Position( [ 0, 2, 1 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not increment offset if position is same as move operation and insert operation is stronger', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 1 ], root ),
- new Position( [ 0, 2, 1 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy, true );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should update address if moved node is before a node from insert path', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 0 ], root ),
- new Position( [ 1, 0 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.path[ 1 ] -= 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not update address if moved node is after a node from insert path', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 4 ], root ),
- new Position( [ 1, 0 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should update address if move-in destination is before a node from insert path', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 0 ], root ),
- new Position( [ 0, 0 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.path[ 1 ] += 2;
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should not update address if move-in destination after a node from insert path', () => {
- let transformBy = new MoveOperation(
- new Position( [ 1, 0 ], root ),
- new Position( [ 0, 4 ], root ),
- 2
- );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- it( 'should decrement offset if address is same as move origin and insert offset is in the middle of moved range', () => {
- let transformBy = new MoveOperation(
- new Position( [ 0, 2, 0 ], root ),
- new Position( [ 1, 0 ], root ),
- 3
- );
- let transOp = op.getTransformedBy( transformBy );
- expected.position.offset = 0;
- expectOperation( transOp[ 0 ], expected );
- } );
- } );
- describe( 'NoOperation', () => {
- it( 'should not get updated', () => {
- let transformBy = new NoOperation( baseVersion );
- let transOp = op.getTransformedBy( transformBy );
- expectOperation( transOp[ 0 ], expected );
- } );
- } );
- } );
- } );
|