mirror of
https://bitbucket.org/wisemapping/wisemapping-frontend.git
synced 2024-11-21 22:27:56 +01:00
Fix events tests.
This commit is contained in:
Paulo Gustavo Veiga
parent
e31aa2a547
commit
f25ca27ca6
@ -21,6 +21,7 @@ pipelines:
|
||||
- yarn bootstrap
|
||||
- yarn build
|
||||
- yarn lint
|
||||
- yarn test:unit
|
||||
# - yarn test
|
||||
artifacts:
|
||||
- packages/**/cypress/snapshots/**/__diff_output__/*.diff.png
|
||||
|
||||
@ -17,7 +17,7 @@
|
||||
*/
|
||||
|
||||
class Events {
|
||||
private _handlerByType;
|
||||
protected _handlerByType;
|
||||
|
||||
constructor() {
|
||||
this._handlerByType = {};
|
||||
|
||||
@ -1,536 +0,0 @@
|
||||
/*
|
||||
* Copyright [2021] [wisemapping]
|
||||
*
|
||||
* Licensed under WiseMapping Public License, Version 1.0 (the "License").
|
||||
* It is basically the Apache License, Version 2.0 (the "License") plus the
|
||||
* "powered by wisemapping" text requirement on every single page;
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the license at
|
||||
*
|
||||
* http://www.wisemapping.org/license
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
import $ from 'jquery';
|
||||
import { $assert } from '@wisemapping/core-js';
|
||||
import TestSuite from './TestSuite';
|
||||
import LayoutManager from '../../../src/components/layout/LayoutManager';
|
||||
import OriginalLayout from '../../../src/components/layout/OriginalLayout';
|
||||
|
||||
class FreeTestSuite extends TestSuite {
|
||||
constructor() {
|
||||
$('#freeTest').css('display', 'block');
|
||||
super();
|
||||
this.testFreePosition();
|
||||
this.testFreePredict();
|
||||
this.testReconnectFreeNode();
|
||||
this.testSiblingOverlapping();
|
||||
this.testRootNodeChildrenPositioning();
|
||||
this.testBalancedFreePredict();
|
||||
this.testFreeReorder();
|
||||
this.testFreeOverlap();
|
||||
}
|
||||
|
||||
testFreePosition() {
|
||||
console.log('testFreePosition:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(10, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(11, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(12, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(13, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(14, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(15, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(16, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(17, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(18, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(19, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(20, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(21, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(22, TestSuite.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0).connectNode(0, 2, 1).connectNode(0, 3, 2).connectNode(0, 4, 3);
|
||||
manager.connectNode(4, 21, 0).connectNode(4, 22, 0);
|
||||
manager.connectNode(1, 5, 0);
|
||||
manager.connectNode(5, 6, 0).connectNode(6, 8, 0).connectNode(8, 9, 0);
|
||||
manager.connectNode(5, 7, 1).connectNode(7, 10, 0);
|
||||
manager
|
||||
.connectNode(3, 11, 0)
|
||||
.connectNode(11, 14, 0)
|
||||
.connectNode(14, 18, 0)
|
||||
.connectNode(14, 19, 1)
|
||||
.connectNode(14, 20, 2);
|
||||
manager
|
||||
.connectNode(3, 12, 1)
|
||||
.connectNode(12, 15, 0)
|
||||
.connectNode(12, 16, 1)
|
||||
.connectNode(12, 17, 2);
|
||||
manager.connectNode(3, 13, 2);
|
||||
|
||||
manager.layout();
|
||||
manager.plot('testFreePosition1', { width: 1400, height: 600 });
|
||||
|
||||
console.log('\tmove node 12 to (300,30):');
|
||||
manager.moveNode(12, { x: 300, y: 30 });
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition2', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, 12, { x: 300, y: 30 });
|
||||
|
||||
console.log('\tmove node 13 to (340,180):');
|
||||
const node13Pos = { x: 340, y: 180 };
|
||||
manager.moveNode(13, node13Pos);
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition3', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, 13, node13Pos);
|
||||
|
||||
console.log('\tmove node 11 to (250,-50):');
|
||||
manager.moveNode(11, { x: 250, y: -50 });
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition4', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, 11, { x: 250, y: -50 });
|
||||
$assert(
|
||||
manager.find(13).getPosition().x == node13Pos.x
|
||||
&& manager.find(13).getPosition().y == node13Pos.y,
|
||||
"Node 13 shouldn't have moved",
|
||||
);
|
||||
|
||||
console.log('\tmove node 7 to (350,-190):');
|
||||
manager.moveNode(7, { x: 350, y: -190 });
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition5', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, 7, { x: 350, y: -190 });
|
||||
|
||||
console.log('\tadd node 23 to 12:');
|
||||
manager.addNode(23, TestSuite.NODE_SIZE, position);
|
||||
manager.connectNode(12, 23, 3);
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition6', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, null, null);
|
||||
|
||||
console.log('\tmove node 4 to (-300, 190):');
|
||||
manager.moveNode(4, { x: -300, y: 190 });
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition7', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, 4, { x: -300, y: 190 });
|
||||
|
||||
console.log('\tadd node 24 to 3:');
|
||||
manager.addNode(24, TestSuite.NODE_SIZE, position);
|
||||
manager.connectNode(3, 24, 3);
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition8', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, null, null);
|
||||
|
||||
console.log('\tadd node 25 to 17:');
|
||||
manager.addNode(25, TestSuite.NODE_SIZE, position);
|
||||
manager.connectNode(17, 25, 0);
|
||||
manager.layout(true);
|
||||
manager.plot('testFreePosition9', { width: 1400, height: 600 });
|
||||
this._assertFreePosition(manager, null, null);
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testFreePredict() {
|
||||
console.log('testFreePredict:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(10, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(11, TestSuite.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0);
|
||||
manager.connectNode(0, 2, 1);
|
||||
manager.connectNode(0, 3, 2);
|
||||
manager.connectNode(3, 4, 0);
|
||||
manager.connectNode(3, 5, 1);
|
||||
manager.connectNode(3, 6, 2);
|
||||
manager.connectNode(5, 7, 0);
|
||||
manager.connectNode(5, 8, 1);
|
||||
manager.connectNode(5, 11, 2);
|
||||
manager.connectNode(2, 9, 0);
|
||||
manager.connectNode(2, 10, 1);
|
||||
|
||||
manager.layout();
|
||||
const graph = manager.plot('testFreePredict1', { width: 1000, height: 400 });
|
||||
|
||||
const pos1 = { x: 370, y: 80 };
|
||||
const predict1 = manager.predict(5, 11, pos1, true);
|
||||
this._plotPrediction(graph, predict1);
|
||||
$assert(
|
||||
predict1.position.x == pos1.x && predict1.position.y == pos1.y,
|
||||
'free predict should return the same position',
|
||||
);
|
||||
|
||||
const pos2 = { x: -200, y: 80 };
|
||||
const predict2 = manager.predict(0, 2, pos2, true);
|
||||
this._plotPrediction(graph, predict2);
|
||||
$assert(
|
||||
predict2.position.x == pos2.x && predict2.position.y == pos2.y,
|
||||
'free predict should return the same position',
|
||||
);
|
||||
|
||||
const pos3 = { x: 200, y: 30 };
|
||||
const node5 = manager.find(5);
|
||||
const predict3 = manager.predict(3, 5, pos3, true);
|
||||
this._plotPrediction(graph, predict3);
|
||||
$assert(
|
||||
predict3.position.x == node5.getPosition().x && predict3.position.y == pos3.y,
|
||||
'free predict should return the x-coordinate of the node',
|
||||
);
|
||||
|
||||
const pos4 = { x: -100, y: 45 };
|
||||
const node10 = manager.find(10);
|
||||
const predict4 = manager.predict(2, 10, pos4, true);
|
||||
this._plotPrediction(graph, predict4);
|
||||
$assert(
|
||||
predict4.position.x == node10.getPosition().x && predict4.position.y == pos4.y,
|
||||
'free predict should return the x-coordinate of the node',
|
||||
);
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testReconnectFreeNode() {
|
||||
console.log('testReconnectFreeNode:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(10, TestSuite.NODE_SIZE, position);
|
||||
manager.addNode(11, TestSuite.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0);
|
||||
manager.connectNode(0, 2, 1);
|
||||
manager.connectNode(0, 3, 2);
|
||||
manager.connectNode(3, 4, 0);
|
||||
manager.connectNode(3, 5, 1);
|
||||
manager.connectNode(3, 6, 2);
|
||||
manager.connectNode(5, 7, 0);
|
||||
manager.connectNode(5, 8, 1);
|
||||
manager.connectNode(5, 11, 2);
|
||||
manager.connectNode(2, 9, 0);
|
||||
manager.connectNode(2, 10, 1);
|
||||
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode1', { width: 1000, height: 400 });
|
||||
|
||||
console.log('\tmove node 5');
|
||||
manager.moveNode(5, { x: 250, y: 30 });
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode2', { width: 1000, height: 400 });
|
||||
this._assertFreePosition(manager, 5, { x: 250, y: 30 });
|
||||
|
||||
console.log('\treconnect node 5 to node 2');
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(2, 5, 2);
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode3', { width: 1000, height: 400 });
|
||||
$assert(
|
||||
manager.find(5).getPosition().y > manager.find(10).getPosition().y
|
||||
&& manager.find(5).getPosition().x == manager.find(10).getPosition().x,
|
||||
'Node 5 is incorrectly positioned',
|
||||
);
|
||||
$assert(manager.find(5).getOrder() == 2, 'Node 5 should have order 2');
|
||||
|
||||
console.log('\tmove node 8');
|
||||
manager.moveNode(8, { x: -370, y: 60 });
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode4', { width: 1000, height: 400 });
|
||||
this._assertFreePosition(manager, 8, { x: -370, y: 60 });
|
||||
|
||||
console.log('\treconnect node 5 to node 10');
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(10, 5, 0);
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode5', { width: 1000, height: 400 });
|
||||
$assert(
|
||||
manager.find(5).getPosition().y == manager.find(10).getPosition().y
|
||||
&& manager.find(5).getPosition().x < manager.find(10).getPosition().x,
|
||||
'Node 5 is incorrectly positioned',
|
||||
);
|
||||
$assert(manager.find(5).getOrder() == 0, 'Node 5 should have order 0');
|
||||
|
||||
console.log('reconnect node 5 to node 3');
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(3, 5, 2);
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode6', { width: 1000, height: 400 });
|
||||
$assert(
|
||||
manager.find(5).getPosition().y > manager.find(6).getPosition().y
|
||||
&& manager.find(5).getPosition().x == manager.find(6).getPosition().x,
|
||||
'Node 5 is incorrectly positioned',
|
||||
);
|
||||
$assert(manager.find(5).getOrder() == 2, 'Node 5 should have order 2');
|
||||
|
||||
console.log('\tmove node 8');
|
||||
manager.moveNode(8, { x: 370, y: 30 });
|
||||
manager.layout();
|
||||
manager.plot('testReconnectFreeNode7', { width: 1000, height: 400 });
|
||||
this._assertFreePosition(manager, 8, { x: 370, y: 30 });
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testSiblingOverlapping() {
|
||||
console.log('testSiblingOverlapping:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position).connectNode(0, 1, 0);
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position).connectNode(1, 2, 0);
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position).connectNode(1, 3, 1);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position).connectNode(1, 4, 2);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position).connectNode(1, 5, 3);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position).connectNode(1, 6, 4);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position).connectNode(1, 7, 5);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position).connectNode(1, 8, 6);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position).connectNode(0, 9, 4);
|
||||
manager.layout();
|
||||
manager.plot('testSiblingOverlapping1', { width: 800, height: 600 });
|
||||
|
||||
console.log('\tmove node 2');
|
||||
manager.moveNode(2, { x: 250, y: -30 });
|
||||
manager.layout();
|
||||
manager.plot('testSiblingOverlapping2', { width: 800, height: 600 });
|
||||
this._assertFreePosition(manager, 2, { x: 250, y: -30 });
|
||||
|
||||
console.log('\tmove node 7');
|
||||
manager.moveNode(7, { x: 250, y: 100 });
|
||||
manager.layout();
|
||||
manager.plot('testSiblingOverlapping3', { width: 800, height: 600 });
|
||||
this._assertFreePosition(manager, 7, { x: 250, y: 100 });
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testRootNodeChildrenPositioning() {
|
||||
console.log('testRootNodeChildrenPositioning:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position).connectNode(0, 1, 0);
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position).connectNode(0, 2, 1);
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position).connectNode(0, 3, 2);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position).connectNode(0, 4, 3);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position).connectNode(0, 5, 4);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position).connectNode(0, 6, 5);
|
||||
manager.layout();
|
||||
manager.plot('testRootNodeChildrenPositioning1', { width: 800, height: 600 });
|
||||
|
||||
console.log('\tmove node 1');
|
||||
manager.moveNode(1, { x: 150, y: 0 });
|
||||
manager.layout();
|
||||
manager.plot('testRootNodeChildrenPositioning2', { width: 800, height: 600 });
|
||||
this._assertFreePosition(manager, 1, { x: 150, y: 0 });
|
||||
|
||||
console.log('\tmove node 4');
|
||||
manager.moveNode(4, { x: -140, y: 30 });
|
||||
manager.layout();
|
||||
manager.plot('testRootNodeChildrenPositioning3', { width: 800, height: 600 });
|
||||
this._assertFreePosition(manager, 4, { x: -140, y: 30 });
|
||||
|
||||
console.log('\tmove node 2');
|
||||
manager.moveNode(2, { x: -150, y: -50 });
|
||||
manager.layout();
|
||||
manager.plot('testRootNodeChildrenPositioning4', { width: 800, height: 600 });
|
||||
this._assertFreePosition(manager, 2, { x: -150, y: -50 });
|
||||
|
||||
// TODO(gb): fix this. It's not working
|
||||
// console.log("\tmove node 6");
|
||||
// manager.moveNode(6, {x:-150, y:-50});
|
||||
// manager.layout();
|
||||
// manager.plot("testRootNodeChildrenPositioning5", {width:800, height:600});
|
||||
// this._assertFreePosition(manager, 6, {x:-150, y:-50});
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testBalancedFreePredict() {
|
||||
console.log('testBalancedFreePredict:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position).connectNode(0, 1, 0);
|
||||
manager.layout();
|
||||
const graph1 = manager.plot('testBalancedFreePredict1', { width: 800, height: 400 });
|
||||
|
||||
const predict1 = manager.predict(0, 1, { x: 70, y: 0 }, true);
|
||||
this._plotPrediction(graph1, predict1);
|
||||
$assert(
|
||||
predict1.position.x == manager.find(1).getPosition().x,
|
||||
'Prediction x pos should be the same as node 1',
|
||||
);
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testFreeReorder() {
|
||||
console.log('testFreeReorder:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position).connectNode(0, 1, 0);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position).connectNode(1, 4, 0);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position).connectNode(1, 5, 1);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position).connectNode(1, 6, 2);
|
||||
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position).connectNode(0, 2, 2);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position).connectNode(2, 7, 0);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position).connectNode(2, 8, 1);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position).connectNode(2, 9, 2);
|
||||
manager.addNode(10, TestSuite.NODE_SIZE, position).connectNode(2, 10, 3);
|
||||
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position).connectNode(0, 3, 4);
|
||||
manager.addNode(11, TestSuite.NODE_SIZE, position).connectNode(3, 11, 0);
|
||||
manager.addNode(12, TestSuite.NODE_SIZE, position).connectNode(3, 12, 1);
|
||||
manager.addNode(13, TestSuite.NODE_SIZE, position).connectNode(3, 13, 2);
|
||||
manager.addNode(14, TestSuite.NODE_SIZE, position).connectNode(3, 14, 3);
|
||||
manager.addNode(15, TestSuite.NODE_SIZE, position).connectNode(3, 15, 4);
|
||||
manager.addNode(16, TestSuite.NODE_SIZE, position).connectNode(3, 16, 5);
|
||||
|
||||
manager.layout();
|
||||
manager.moveNode(14, { x: 270, y: -160 });
|
||||
manager.layout();
|
||||
manager.plot('testFreeReorder1', { width: 800, height: 1200 });
|
||||
$assert(
|
||||
manager.find(14).getPosition().y > manager.find(10).getPosition().y,
|
||||
'Node 14 should be below branch 2',
|
||||
);
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
testFreeOverlap() {
|
||||
console.log('testFreeOverlap:');
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, TestSuite.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, TestSuite.NODE_SIZE, position).connectNode(0, 1, 0);
|
||||
manager.addNode(4, TestSuite.NODE_SIZE, position).connectNode(1, 4, 0);
|
||||
manager.addNode(5, TestSuite.NODE_SIZE, position).connectNode(1, 5, 1);
|
||||
manager.addNode(6, TestSuite.NODE_SIZE, position).connectNode(1, 6, 2);
|
||||
|
||||
manager.addNode(2, TestSuite.NODE_SIZE, position).connectNode(0, 2, 2);
|
||||
manager.addNode(7, TestSuite.NODE_SIZE, position).connectNode(2, 7, 0);
|
||||
manager.addNode(8, TestSuite.NODE_SIZE, position).connectNode(2, 8, 1);
|
||||
manager.addNode(9, TestSuite.NODE_SIZE, position).connectNode(2, 9, 2);
|
||||
manager.addNode(10, TestSuite.NODE_SIZE, position).connectNode(2, 10, 3);
|
||||
|
||||
manager.addNode(3, TestSuite.NODE_SIZE, position).connectNode(0, 3, 4);
|
||||
manager.addNode(11, TestSuite.NODE_SIZE, position).connectNode(3, 11, 0);
|
||||
manager.addNode(12, TestSuite.NODE_SIZE, position).connectNode(3, 12, 1);
|
||||
manager.addNode(13, TestSuite.NODE_SIZE, position).connectNode(3, 13, 2);
|
||||
manager.addNode(14, TestSuite.NODE_SIZE, position).connectNode(3, 14, 3);
|
||||
manager.addNode(15, TestSuite.NODE_SIZE, position).connectNode(3, 15, 4);
|
||||
manager.addNode(16, TestSuite.NODE_SIZE, position).connectNode(3, 16, 5);
|
||||
|
||||
manager.layout();
|
||||
manager.plot('testFreeOverlap1', { width: 800, height: 1200 });
|
||||
|
||||
manager.moveNode(14, { x: 270, y: 7 });
|
||||
manager.layout();
|
||||
manager.plot('testFreeOverlap2', { width: 800, height: 1200 });
|
||||
$assert(
|
||||
manager.find(2).getPosition().y > manager.find(1).getPosition().y,
|
||||
'Branches 1 and 2 are overlapping',
|
||||
);
|
||||
|
||||
console.log('OK!\n\n');
|
||||
}
|
||||
|
||||
_assertFreePosition(manager, id, position) {
|
||||
if (id != null && position.x != null && position.y != null) {
|
||||
const node = manager.find(id);
|
||||
$assert(
|
||||
node.getPosition().x == position.x && node.getPosition().y == position.y,
|
||||
`Freely moved node ${id
|
||||
} is not left at free position (${position.x
|
||||
},${position.y
|
||||
}). `
|
||||
+ `Actual position: (${node.getPosition().x
|
||||
},${node.getPosition().y
|
||||
})`,
|
||||
);
|
||||
}
|
||||
|
||||
const treeSet = manager._treeSet;
|
||||
treeSet._rootNodes.forEach(((rootNode) => {
|
||||
const heightById = rootNode.getSorter().computeChildrenIdByHeights(treeSet, rootNode);
|
||||
this._assertBranchCollision(treeSet, rootNode, heightById);
|
||||
}));
|
||||
}
|
||||
|
||||
_assertBranchCollision(treeSet, node, heightById) {
|
||||
const children = treeSet.getChildren(node);
|
||||
const childOfRootNode = treeSet._rootNodes.includes(node);
|
||||
|
||||
children.forEach((child) => {
|
||||
const height = heightById[child.getId()];
|
||||
let siblings = treeSet.getSiblings(child);
|
||||
if (childOfRootNode) {
|
||||
siblings = siblings.filter((sibling) => child.getOrder() % 2 === sibling.getOrder() % 2);
|
||||
}
|
||||
|
||||
siblings.forEach((sibling) => {
|
||||
this._branchesOverlap(child, sibling, heightById);
|
||||
});
|
||||
});
|
||||
|
||||
children.forEach(((child) => {
|
||||
OriginalLayout._assertBranchCollision(treeSet, child, heightById);
|
||||
}));
|
||||
}
|
||||
|
||||
static _branchesOverlap(branchA, branchB, heightById) {
|
||||
const topA = branchA.getPosition().y - heightById[branchA.getId()] / 2;
|
||||
const bottomA = branchA.getPosition().y + heightById[branchA.getId()] / 2;
|
||||
const topB = branchB.getPosition().y - heightById[branchB.getId()] / 2;
|
||||
const bottomB = branchB.getPosition().y + heightById[branchB.getId()] / 2;
|
||||
|
||||
$assert(
|
||||
topA >= bottomB || bottomA <= topB,
|
||||
`Branches ${branchA.getId()} and ${branchB.getId()} overlap`,
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
export default FreeTestSuite;
|
||||
@ -3,11 +3,11 @@ import Events from '../../../src/components/Events';
|
||||
describe('Events class suite', () => {
|
||||
class TestClass extends Events {
|
||||
getEvents() {
|
||||
return this.$events;
|
||||
return this._handlerByType;
|
||||
}
|
||||
|
||||
removeEvents() {
|
||||
this.$events = {};
|
||||
this._handlerByType = {};
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@ -1,275 +0,0 @@
|
||||
import Constants from './Constants';
|
||||
import LayoutManager from '../../../src/components/layout/LayoutManager';
|
||||
|
||||
expect.extend({
|
||||
toNotBeBranchesOverlap(received, expected) {
|
||||
const a = received;
|
||||
const b = expected;
|
||||
if (a[0] <= b[1] || a[1] >= b[0]) {
|
||||
return {
|
||||
message: 'Success',
|
||||
pass: true,
|
||||
};
|
||||
}
|
||||
return {
|
||||
message: 'Error',
|
||||
pass: false,
|
||||
};
|
||||
},
|
||||
});
|
||||
|
||||
describe('Free Test Suite', () => {
|
||||
function branchesOverlap(branchA, branchB, heightById) {
|
||||
const topA = branchA.getPosition().y - heightById[branchA.getId()] / 2;
|
||||
const bottomA = branchA.getPosition().y + heightById[branchA.getId()] / 2;
|
||||
const topB = branchB.getPosition().y - heightById[branchB.getId()] / 2;
|
||||
const bottomB = branchB.getPosition().y + heightById[branchB.getId()] / 2;
|
||||
|
||||
test('Not be Branches Overlap', () => {
|
||||
expect([bottomA, topA]).toNotBeBranchesOverlap([bottomB, topB]);
|
||||
});
|
||||
}
|
||||
|
||||
function branchCollision(treeSet, node, heightById) {
|
||||
const children = treeSet.getChildren(node);
|
||||
const childOfRootNode = treeSet._rootNodes.includes(node);
|
||||
|
||||
children.forEach(((child) => {
|
||||
let siblings = treeSet.getSiblings(child);
|
||||
if (childOfRootNode) {
|
||||
siblings = siblings
|
||||
.filter((sibling) => (child.getOrder() % 2) === (sibling.getOrder() % 2));
|
||||
}
|
||||
|
||||
siblings.forEach(((sibling) => {
|
||||
branchesOverlap(child, sibling, heightById);
|
||||
}));
|
||||
}));
|
||||
|
||||
children.forEach((child) => {
|
||||
branchCollision(treeSet, child, heightById);
|
||||
}, this);
|
||||
}
|
||||
|
||||
describe('avoidCollisionTree1Test', () => {
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, Constants.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, Constants.NODE_SIZE, position);
|
||||
manager.addNode(2, Constants.NODE_SIZE, position);
|
||||
manager.addNode(3, Constants.NODE_SIZE, position);
|
||||
manager.addNode(4, Constants.NODE_SIZE, position);
|
||||
manager.addNode(5, Constants.NODE_SIZE, position);
|
||||
manager.addNode(6, Constants.NODE_SIZE, position);
|
||||
manager.addNode(7, Constants.NODE_SIZE, position);
|
||||
manager.addNode(8, Constants.NODE_SIZE, position);
|
||||
manager.addNode(9, Constants.NODE_SIZE, position);
|
||||
manager.addNode(10, Constants.NODE_SIZE, position);
|
||||
manager.addNode(11, Constants.NODE_SIZE, position);
|
||||
manager.addNode(12, Constants.NODE_SIZE, position);
|
||||
manager.addNode(13, Constants.NODE_SIZE, position);
|
||||
manager.addNode(14, Constants.NODE_SIZE, position);
|
||||
manager.addNode(15, Constants.NODE_SIZE, position);
|
||||
manager.addNode(16, Constants.NODE_SIZE, position);
|
||||
manager.addNode(17, Constants.NODE_SIZE, position);
|
||||
manager.addNode(18, Constants.NODE_SIZE, position);
|
||||
manager.addNode(19, Constants.NODE_SIZE, position);
|
||||
manager.addNode(20, Constants.NODE_SIZE, position);
|
||||
manager.addNode(21, Constants.NODE_SIZE, position);
|
||||
manager.addNode(22, Constants.NODE_SIZE, position);
|
||||
manager.addNode(23, Constants.NODE_SIZE, position);
|
||||
manager.addNode(24, Constants.NODE_SIZE, position);
|
||||
manager.addNode(25, Constants.NODE_SIZE, position);
|
||||
manager.addNode(26, Constants.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0).connectNode(0, 2, 1).connectNode(0, 3, 2).connectNode(0, 4, 3);
|
||||
manager.connectNode(4, 21, 0).connectNode(4, 22, 0);
|
||||
manager.connectNode(1, 5, 0).connectNode(1, 23, 0).connectNode(23, 24, 0).connectNode(24, 25, 0)
|
||||
.connectNode(24, 26, 0);
|
||||
manager.connectNode(5, 6, 0).connectNode(6, 8, 0).connectNode(8, 9, 0);
|
||||
manager.connectNode(5, 7, 1).connectNode(7, 10, 0);
|
||||
manager.connectNode(3, 11, 0).connectNode(11, 14, 0)
|
||||
.connectNode(14, 18, 0).connectNode(14, 19, 1)
|
||||
.connectNode(14, 20, 2);
|
||||
manager.connectNode(3, 12, 1).connectNode(12, 15, 0)
|
||||
.connectNode(12, 16, 1).connectNode(12, 17, 2);
|
||||
manager.connectNode(3, 13, 2);
|
||||
|
||||
manager.layout(true);
|
||||
|
||||
const treeSet = manager._treeSet;
|
||||
treeSet._rootNodes.forEach(((rootNode) => {
|
||||
const heightById = rootNode.getSorter().computeChildrenIdByHeights(treeSet, rootNode);
|
||||
branchCollision(treeSet, rootNode, heightById);
|
||||
}));
|
||||
});
|
||||
|
||||
describe('avoidCollisionTree2Test - FAILING, commented test', () => {
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, Constants.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, Constants.NODE_SIZE, position);
|
||||
manager.addNode(2, Constants.NODE_SIZE, position);
|
||||
manager.addNode(3, Constants.NODE_SIZE, position);
|
||||
manager.addNode(4, Constants.NODE_SIZE, position);
|
||||
manager.addNode(5, Constants.NODE_SIZE, position);
|
||||
manager.addNode(6, Constants.NODE_SIZE, position);
|
||||
manager.addNode(7, Constants.NODE_SIZE, position);
|
||||
manager.addNode(8, Constants.NODE_SIZE, position);
|
||||
manager.addNode(9, Constants.NODE_SIZE, position);
|
||||
manager.addNode(10, Constants.NODE_SIZE, position);
|
||||
manager.addNode(11, Constants.NODE_SIZE, position);
|
||||
manager.addNode(12, Constants.NODE_SIZE, position);
|
||||
manager.addNode(13, Constants.NODE_SIZE, position);
|
||||
manager.addNode(14, Constants.NODE_SIZE, position);
|
||||
manager.addNode(15, Constants.NODE_SIZE, position);
|
||||
manager.addNode(16, Constants.NODE_SIZE, position);
|
||||
manager.addNode(17, Constants.NODE_SIZE, position);
|
||||
manager.addNode(18, Constants.NODE_SIZE, position);
|
||||
manager.addNode(19, Constants.NODE_SIZE, position);
|
||||
manager.addNode(20, Constants.NODE_SIZE, position);
|
||||
manager.addNode(21, Constants.NODE_SIZE, position);
|
||||
manager.addNode(22, Constants.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0).connectNode(0, 2, 1).connectNode(0, 3, 2).connectNode(0, 4, 3);
|
||||
manager.connectNode(4, 21, 0).connectNode(4, 22, 0);
|
||||
manager.connectNode(1, 5, 0);
|
||||
manager.connectNode(5, 6, 0).connectNode(6, 8, 0).connectNode(8, 9, 0);
|
||||
manager.connectNode(5, 7, 1).connectNode(7, 10, 0);
|
||||
manager.connectNode(3, 11, 0).connectNode(11, 14, 0)
|
||||
.connectNode(14, 18, 0).connectNode(14, 19, 1)
|
||||
.connectNode(14, 20, 2);
|
||||
manager.connectNode(3, 12, 1).connectNode(12, 15, 0)
|
||||
.connectNode(12, 16, 1).connectNode(12, 17, 2);
|
||||
manager.connectNode(3, 13, 2);
|
||||
|
||||
manager.layout(true);
|
||||
|
||||
const treeSet = manager._treeSet;
|
||||
treeSet._rootNodes.forEach(((rootNode) => {
|
||||
const heightById = rootNode.getSorter().computeChildrenIdByHeights(treeSet, rootNode);
|
||||
// FIXME: uncoment this line when bug is fixed, branchCollision(treeSet, rootNode, heightById);
|
||||
}));
|
||||
});
|
||||
|
||||
describe('predict test', () => {
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, Constants.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, Constants.NODE_SIZE, position);
|
||||
manager.addNode(2, Constants.NODE_SIZE, position);
|
||||
manager.addNode(3, Constants.NODE_SIZE, position);
|
||||
manager.addNode(4, Constants.NODE_SIZE, position);
|
||||
manager.addNode(5, Constants.NODE_SIZE, position);
|
||||
manager.addNode(6, Constants.NODE_SIZE, position);
|
||||
manager.addNode(7, Constants.NODE_SIZE, position);
|
||||
manager.addNode(8, Constants.NODE_SIZE, position);
|
||||
manager.addNode(9, Constants.NODE_SIZE, position);
|
||||
manager.addNode(10, Constants.NODE_SIZE, position);
|
||||
manager.addNode(11, Constants.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0);
|
||||
manager.connectNode(0, 2, 1);
|
||||
manager.connectNode(0, 3, 2);
|
||||
manager.connectNode(3, 4, 0);
|
||||
manager.connectNode(3, 5, 1);
|
||||
manager.connectNode(3, 6, 2);
|
||||
manager.connectNode(5, 7, 0);
|
||||
manager.connectNode(5, 8, 1);
|
||||
manager.connectNode(5, 11, 2);
|
||||
manager.connectNode(2, 9, 0);
|
||||
manager.connectNode(2, 10, 1);
|
||||
|
||||
manager.layout();
|
||||
|
||||
test('Predict 1', () => {
|
||||
const pos1 = { x: 370, y: 80 };
|
||||
const predict1 = manager.predict(5, 11, pos1, true);
|
||||
expect(predict1.position.x).toEqual(pos1.x);
|
||||
expect(predict1.position.y).toEqual(pos1.y);
|
||||
});
|
||||
|
||||
test('Predict 2', () => {
|
||||
const pos2 = { x: -200, y: 80 };
|
||||
const predict2 = manager.predict(0, 2, pos2, true);
|
||||
expect(predict2.position.x).toEqual(pos2.x);
|
||||
expect(predict2.position.y).toEqual(pos2.y);
|
||||
});
|
||||
|
||||
test('Predict 3', () => {
|
||||
const pos3 = { x: 200, y: 30 };
|
||||
const node5 = manager.find(5);
|
||||
const predict3 = manager.predict(3, 5, pos3, true);
|
||||
expect(predict3.position.x).toEqual(node5.getPosition().x);
|
||||
expect(predict3.position.y).toEqual(pos3.y);
|
||||
});
|
||||
|
||||
test('Predict 4', () => {
|
||||
const pos4 = { x: -100, y: 45 };
|
||||
const node10 = manager.find(10);
|
||||
const predict4 = manager.predict(2, 10, pos4, true);
|
||||
expect(predict4.position.x).toEqual(node10.getPosition().x);
|
||||
expect(predict4.position.y).toEqual(pos4.y);
|
||||
});
|
||||
});
|
||||
|
||||
describe('reconnect node test', () => {
|
||||
const position = { x: 0, y: 0 };
|
||||
const manager = new LayoutManager(0, Constants.ROOT_NODE_SIZE);
|
||||
|
||||
// Prepare a sample graph ...
|
||||
manager.addNode(1, Constants.NODE_SIZE, position);
|
||||
manager.addNode(2, Constants.NODE_SIZE, position);
|
||||
manager.addNode(3, Constants.NODE_SIZE, position);
|
||||
manager.addNode(4, Constants.NODE_SIZE, position);
|
||||
manager.addNode(5, Constants.NODE_SIZE, position);
|
||||
manager.addNode(6, Constants.NODE_SIZE, position);
|
||||
manager.addNode(7, Constants.NODE_SIZE, position);
|
||||
manager.addNode(8, Constants.NODE_SIZE, position);
|
||||
manager.addNode(9, Constants.NODE_SIZE, position);
|
||||
manager.addNode(10, Constants.NODE_SIZE, position);
|
||||
manager.addNode(11, Constants.NODE_SIZE, position);
|
||||
|
||||
manager.connectNode(0, 1, 0);
|
||||
manager.connectNode(0, 2, 1);
|
||||
manager.connectNode(0, 3, 2);
|
||||
manager.connectNode(3, 4, 0);
|
||||
manager.connectNode(3, 5, 1);
|
||||
manager.connectNode(3, 6, 2);
|
||||
manager.connectNode(5, 7, 0);
|
||||
manager.connectNode(5, 8, 1);
|
||||
manager.connectNode(5, 11, 2);
|
||||
manager.connectNode(2, 9, 0);
|
||||
manager.connectNode(2, 10, 1);
|
||||
manager.layout();
|
||||
|
||||
test('Reconnect Node', () => {
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(2, 5, 2);
|
||||
manager.layout();
|
||||
|
||||
expect(manager.find(5).getPosition().y).toBeGreaterThan(manager.find(10).getPosition().y);
|
||||
expect(manager.find(5).getPosition().x).toEqual(manager.find(10).getPosition().x);
|
||||
expect(manager.find(5).getOrder()).toEqual(2);
|
||||
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(10, 5, 0);
|
||||
manager.layout();
|
||||
|
||||
expect(manager.find(5).getPosition().y).toEqual(manager.find(10).getPosition().y);
|
||||
expect(manager.find(5).getPosition().x).toBeLessThan(manager.find(10).getPosition().x);
|
||||
expect(manager.find(5).getOrder()).toEqual(0);
|
||||
|
||||
manager.disconnectNode(5);
|
||||
manager.connectNode(3, 5, 2);
|
||||
manager.layout();
|
||||
|
||||
expect(manager.find(5).getPosition().y).toBeGreaterThan(manager.find(6).getPosition().y);
|
||||
expect(manager.find(5).getPosition().x).toEqual(manager.find(6).getPosition().x);
|
||||
expect(manager.find(5).getOrder()).toEqual(2);
|
||||
});
|
||||
});
|
||||
});
|
||||
Loading…
Reference in New Issue
Block a user