mediawiki-extensions-Visual.../tests/ve2/dm/ve.dm.DocumentFragment.test.js
Trevor Parscal 9887dbd96f Split Broke DefinitionListNode out of ListNode and DefinitionListItemNode out of ListItemNode
* Makes it simpler in the linear model because we don't have to use style: "item" for regular list items and style: "definition" for definition lists
* Enforces correct nesting through existing node rules systems
* Updates tests accordingly

Change-Id: I64d80af938e325f1961226505bdc386bb35ccdda
2012-05-04 11:56:32 -07:00

116 lines
3.6 KiB
JavaScript

module( 've.dm.DocumentFragment' );
/* Tests */
test( 'constructor', 114, function() {
var fragment = new ve.dm.DocumentFragment( ve.dm.example.data );
// Test count: ( ( 4 tests x 21 branch nodes ) + ( 3 tests x 10 leaf nodes ) ) = 114
ve.dm.example.nodeTreeEqual( fragment.getDocumentNode(), ve.dm.example.tree );
} );
test( 'getData', 1, function() {
var fragment = new ve.dm.DocumentFragment( ve.dm.example.data );
deepEqual( fragment.getData(), ve.dm.example.data );
} );
test( 'getOffsetMap', 55, function() {
var fragment = new ve.dm.DocumentFragment( ve.dm.example.data ),
actual = fragment.getOffsetMap(),
expected = ve.dm.example.getOffsetMap( fragment.getDocumentNode() );
ok( actual.length === expected.length, 'offset map lengths match' );
for ( var i = 0; i < actual.length; i++ ) {
ok( actual[i] === expected[i], 'reference at offset ' + i );
}
} );
test( 'getDocumentNode', 2, function() {
var parentDocument = new ve.dm.Document(),
fragment = new ve.dm.DocumentFragment( ve.dm.example.data, parentDocument );
notStrictEqual(
fragment.getDocumentNode(),
parentDocument.getDocumentNode(),
'fragment and parent documents are different'
);
strictEqual(
fragment.getDocumentNode().getRoot(),
parentDocument.getDocumentNode().getRoot(),
'fragment and parent documents share the same root node'
);
} );
test( 'getNodeFromOffset', 42, function() {
var fragment = new ve.dm.DocumentFragment( ve.dm.example.data ),
root = fragment.getDocumentNode().getRoot(),
node,
expected = [
[], // 0 - document
[0], // 1 - heading
[0], // 2 - heading
[0], // 3 - heading
[0], // 4 - heading
[], // 5 - document
[1], // 6 - table
[1, 0], // 7 - tableRow
[1, 0, 0], // 8 - tableCell
[1, 0, 0, 0], // 9 - paragraph
[1, 0, 0, 0], // 10 - paragraph
[1, 0, 0], // 11 - tableCell
[1, 0, 0, 1], // 12 - list
[1, 0, 0, 1, 0], // 13 - listItem
[1, 0, 0, 1, 0, 0], // 14 - paragraph
[1, 0, 0, 1, 0, 0], // 15 - paragraph
[1, 0, 0, 1, 0], // 16 - listItem
[1, 0, 0, 1, 0, 1], // 17 - list
[1, 0, 0, 1, 0, 1, 0], // 18 - listItem
[1, 0, 0, 1, 0, 1, 0, 0], // 19 - paragraph
[1, 0, 0, 1, 0, 1, 0, 0], // 20 - paragraph
[1, 0, 0, 1, 0, 1, 0], // 21 - listItem
[1, 0, 0, 1, 0, 1], // 22 - list
[1, 0, 0, 1, 0], // 23 - listItem
[1, 0, 0, 1], // 24 - list
[1, 0, 0], // 25 - tableCell
[1, 0, 0, 2], // 26 - list
[1, 0, 0, 2, 0], // 27 - listItem
[1, 0, 0, 2, 0, 0], // 28 - paragraph
[1, 0, 0, 2, 0, 0], // 29 - paragraph
[1, 0, 0, 2, 0], // 30 - listItem
[1, 0, 0, 2], // 31 - list
[1, 0, 0], // 32 - tableCell
[1, 0], // 33 - tableRow
[1], // 34 - table
[], // 35- document
[2], // 36 - preformatted
[2], // 37 - preformatted
[2], // 38 - preformatted
[2], // 39 - preformatted
[2], // 40 - preformatted
[] // 41 - document
];
for ( var i = 0; i < expected.length; i++ ) {
node = root;
for ( var j = 0; j < expected[i].length; j++ ) {
node = node.children[expected[i][j]];
}
ok( node === fragment.getNodeFromOffset( i ), 'reference at offset ' + i );
}
} );
test( 'getDataFromNode', 3, function() {
var fragment = new ve.dm.DocumentFragment( ve.dm.example.data );
deepEqual(
fragment.getDataFromNode( fragment.getDocumentNode().getChildren()[0] ),
ve.dm.example.data.slice( 1, 4 ),
'branch with leaf children'
);
deepEqual(
fragment.getDataFromNode( fragment.getDocumentNode().getChildren()[1] ),
ve.dm.example.data.slice( 6, 34 ),
'branch with branch children'
);
deepEqual(
fragment.getDataFromNode( fragment.getDocumentNode().getChildren()[2].getChildren()[1] ),
[],
'leaf without children'
);
} );