2012-01-10 03:50:52 +01:00
|
|
|
/*
|
|
|
|
* Copyright [2011] [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.
|
|
|
|
*/
|
2012-01-10 23:01:16 +01:00
|
|
|
mindplot.nlayout.SymmetricSorter = new Class({
|
2012-01-11 00:01:36 +01:00
|
|
|
Extends: mindplot.nlayout.AbstractBasicSorter,
|
2011-12-11 17:13:43 +01:00
|
|
|
initialize:function() {
|
|
|
|
|
|
|
|
},
|
|
|
|
|
|
|
|
predict : function(parent, graph, position) {
|
|
|
|
|
|
|
|
// No children...
|
|
|
|
var children = graph.getChildren(parent);
|
|
|
|
if (children.length == 0) {
|
2011-12-31 18:52:13 +01:00
|
|
|
return [0,parent.getPosition()]; // @Todo:Change x ...
|
2011-12-11 17:13:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Try to fit within ...
|
|
|
|
//
|
|
|
|
// - Order is change if the position top position is changed ...
|
2011-12-31 18:52:13 +01:00
|
|
|
// - Suggested position is the middle between the two topics...
|
2011-12-11 17:13:43 +01:00
|
|
|
//
|
|
|
|
var result = null;
|
|
|
|
children.forEach(function(child) {
|
|
|
|
var cpos = child.getPosition();
|
|
|
|
if (position.y > cpos.y) {
|
|
|
|
result = [child.getOrder(),{x:cpos.x,y:cpos.y + child.getSize().height}];
|
|
|
|
}
|
|
|
|
});
|
|
|
|
|
|
|
|
// Ok, no overlap. Suggest a new order.
|
|
|
|
if (result) {
|
|
|
|
var last = children.getLast();
|
2012-01-10 23:01:16 +01:00
|
|
|
result = [last.getOrder() + 1,{x:cpos.x,y:cpos.y - (mindplot.nlayout.SymmetricSorter.INTERNODE_VERTICAL_PADDING * 4)}];
|
2011-12-11 17:13:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
},
|
|
|
|
|
|
|
|
insert: function(treeSet, parent, child, order) {
|
2011-12-12 03:47:01 +01:00
|
|
|
var children = this._getSortedChildren(treeSet, parent);
|
2011-12-11 17:13:43 +01:00
|
|
|
$assert(order <= children.length, "Order must be continues and can not have holes. Order:" + order);
|
2011-12-31 18:52:13 +01:00
|
|
|
$assert(order <= children.length, "Order must be continues and can not have holes. Order:" + order);
|
2011-12-11 17:13:43 +01:00
|
|
|
|
|
|
|
// Shift all the elements in one .
|
|
|
|
for (var i = order; i < children.length; i++) {
|
|
|
|
var node = children[i];
|
2011-12-12 03:47:01 +01:00
|
|
|
node.setOrder(i + 1);
|
2011-12-11 17:13:43 +01:00
|
|
|
}
|
|
|
|
child.setOrder(order);
|
|
|
|
},
|
|
|
|
|
2011-12-12 03:47:01 +01:00
|
|
|
detach:function(treeSet, node) {
|
|
|
|
var parent = treeSet.getParent(node);
|
|
|
|
var children = this._getSortedChildren(treeSet, parent);
|
|
|
|
var order = node.getOrder();
|
|
|
|
$assert(children[order] === node, "Node seems not to be in the right position");
|
|
|
|
|
|
|
|
// Shift all the nodes ...
|
|
|
|
for (var i = node.getOrder() + 1; i < children.length; i++) {
|
|
|
|
var child = children[i];
|
|
|
|
child.setOrder(child.getOrder() - 1);
|
|
|
|
}
|
|
|
|
node.setOrder(0);
|
|
|
|
},
|
|
|
|
|
2011-12-11 17:13:43 +01:00
|
|
|
computeOffsets:function(treeSet, node) {
|
|
|
|
$assert(treeSet, "treeSet can no be null.");
|
|
|
|
$assert(node, "node can no be null.");
|
|
|
|
|
2011-12-12 03:47:01 +01:00
|
|
|
var children = this._getSortedChildren(treeSet, node);
|
2011-12-11 17:13:43 +01:00
|
|
|
|
|
|
|
// Compute heights ...
|
|
|
|
var heights = children.map(function(child) {
|
2012-01-10 23:35:52 +01:00
|
|
|
return {id:child.getId(), order:child.getOrder(), position: child.getPosition(), height: this._computeChildrenHeight(treeSet, child)};
|
|
|
|
}, this).reverse();
|
2011-12-30 21:48:11 +01:00
|
|
|
|
2011-12-11 17:13:43 +01:00
|
|
|
// Compute the center of the branch ...
|
|
|
|
var totalHeight = 0;
|
|
|
|
heights.forEach(function(elem) {
|
|
|
|
totalHeight += elem.height;
|
|
|
|
});
|
|
|
|
var ysum = totalHeight / 2;
|
|
|
|
|
|
|
|
// Calculate the offsets ...
|
|
|
|
var result = {};
|
|
|
|
for (var i = 0; i < heights.length; i++) {
|
|
|
|
ysum = ysum - heights[i].height;
|
|
|
|
|
2012-01-10 13:44:33 +01:00
|
|
|
var parent = treeSet.getParent(treeSet.find(heights[i].id));
|
|
|
|
var direction = parent.getPosition().x > 0 ? 1 : -1;
|
|
|
|
|
2012-01-02 21:10:14 +01:00
|
|
|
var yOffset = ysum + heights[i].height/2;
|
2012-01-10 23:01:16 +01:00
|
|
|
var xOffset = direction * (node.getSize().width + mindplot.nlayout.SymmetricSorter.INTERNODE_HORIZONTAL_PADDING);
|
2011-12-11 17:13:43 +01:00
|
|
|
|
|
|
|
$assert(!isNaN(xOffset), "xOffset can not be null");
|
|
|
|
$assert(!isNaN(yOffset), "yOffset can not be null");
|
|
|
|
|
|
|
|
result[heights[i].id] = {x:xOffset,y:yOffset};
|
|
|
|
}
|
|
|
|
return result;
|
2011-12-30 21:48:11 +01:00
|
|
|
},
|
|
|
|
|
|
|
|
toString:function() {
|
|
|
|
return "Symmetric Sorter";
|
2011-12-11 17:13:43 +01:00
|
|
|
}
|
|
|
|
});
|
|
|
|
|
2012-01-10 23:01:16 +01:00
|
|
|
mindplot.nlayout.SymmetricSorter.INTERNODE_VERTICAL_PADDING = 5;
|
|
|
|
mindplot.nlayout.SymmetricSorter.INTERNODE_HORIZONTAL_PADDING = 5;
|
2011-12-11 17:13:43 +01:00
|
|
|
|
|
|
|
|