wisemapping-open-source/mindplot/src/main/javascript/model/NodeModel.js

193 lines
6.5 KiB
JavaScript
Raw Normal View History

/*
2011-07-27 13:25:10 +02: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.
*/
mindplot.model.NodeModel = new Class({
2011-09-08 14:54:55 +02:00
Extends: mindplot.model.INodeModel,
2011-07-27 13:25:10 +02:00
initialize:function(type, mindmap, id) {
$assert(type, 'Node type can not be null');
$assert(mindmap, 'mindmap can not be null');
2011-09-08 14:54:55 +02:00
this._properties = {};
this.parent(mindmap);
this.setId(id);
this.setType(type);
this.areChildrenShrunken(false);
2011-07-27 13:25:10 +02:00
this._children = [];
this._feature = [];
},
createFeature: function(type, attributes) {
return mindplot.TopicFeature.createModel(type, this, attributes);
},
addFeature: function(feature) {
$assert(feature, 'feature can not be null');
this._feature.push(feature);
},
getFeatures: function() {
return this._feature;
},
removeFeature: function(feature) {
$assert(feature, 'feature can not be null');
this._feature.erase(feature);
},
findFeatureByType : function(type) {
$assert(type, 'type can not be null');
return this._feature.filter(function(feature) {
return feature.getType() == type;
});
},
findFeatureById : function(id) {
$assert($defined(id), 'id can not be null');
return this._feature.filter(function(feature) {
return feature.getId() == id;
})[0];
2011-07-27 13:25:10 +02:00
},
2011-09-14 13:51:38 +02:00
getPropertiesKeys : function() {
return Object.keys(this._properties);
},
2011-09-08 14:54:55 +02:00
putProperty : function(key, value) {
$defined(key, 'key can not be null');
this._properties[key] = value;
2011-07-27 13:25:10 +02:00
},
2011-09-09 07:22:44 +02:00
2011-09-10 06:17:48 +02:00
getProperties: function() {
return this._properties;
2011-09-09 07:22:44 +02:00
},
2011-09-08 14:54:55 +02:00
getProperty : function(key) {
$defined(key, 'key can not be null');
var result = this._properties[key];
return !$defined(result) ? null : result;
2011-07-27 13:25:10 +02:00
},
2011-09-08 14:54:55 +02:00
clone : function() {
var result = new mindplot.model.NodeModel(this.getType(), this._mindmap);
result._children = this._children.each(function(node) {
var cnode = node.clone();
cnode._parent = result;
return cnode;
});
2011-07-27 13:25:10 +02:00
2011-09-11 05:07:43 +02:00
result._properties = Object.clone(this._properties);
result._feature = this._feature.clone();
2011-09-08 14:54:55 +02:00
return result;
2011-07-27 13:25:10 +02:00
},
2011-09-10 02:53:41 +02:00
appendChild : function(child) {
$assert(child && child.isNodeModel(), 'Only NodeModel can be appended to Mindmap object');
2011-07-27 13:25:10 +02:00
this._children.push(child);
child._parent = this;
},
2011-09-10 02:53:41 +02:00
removeChild : function(child) {
$assert(child && child.isNodeModel(), 'Only NodeModel can be appended to Mindmap object.');
2011-07-27 13:25:10 +02:00
this._children.erase(child);
child._parent = null;
},
getChildren : function() {
return this._children;
},
getParent : function() {
return this._parent;
},
setParent : function(parent) {
$assert(parent != this, 'The same node can not be parent and child if itself.');
2011-07-27 13:25:10 +02:00
this._parent = parent;
},
2012-03-07 05:13:50 +01:00
canBeConnected : function(sourceModel, sourcePosition, targetTopicHeight,targetTopicSize) {
$assert(sourceModel != this, 'The same node can not be parent and child if itself.');
$assert(sourcePosition, 'childPosition can not be null.');
2011-07-27 19:53:32 +02:00
$assert(targetTopicHeight, 'childrenWidth can not be null.');
2012-03-07 05:13:50 +01:00
$assert(targetTopicSize, 'targetTopicSize can not be null.');
2011-07-27 13:25:10 +02:00
// Only can be connected if the node is in the left or rigth.
var targetModel = this;
var mindmap = targetModel.getMindmap();
var targetPosition = targetModel.getPosition();
var result = false;
2011-09-08 14:54:55 +02:00
if (sourceModel.getType() == mindplot.model.INodeModel.MAIN_TOPIC_TYPE) {
2012-03-07 05:13:50 +01:00
// Finally, check current node position ...
2011-07-27 13:25:10 +02:00
var yDistance = Math.abs(sourcePosition.y - targetPosition.y);
var gap = 35 + targetTopicHeight / 2;
if (targetModel.getChildren().length > 0) {
gap += Math.abs(targetPosition.y - targetModel.getChildren()[0].getPosition().y);
}
if (yDistance <= gap) {
// Circular connection ?
if (!sourceModel._isChildNode(this)) {
var toleranceDistance = (targetTopicSize.width / 2) + targetTopicHeight;
var xDistance = sourcePosition.x - targetPosition.x;
var isTargetAtRightFromCentral = targetPosition.x >= 0;
2009-06-07 20:59:43 +02:00
2011-07-27 13:25:10 +02:00
if (isTargetAtRightFromCentral) {
2011-09-08 14:54:55 +02:00
if (xDistance >= -targetTopicSize.width / 2 && xDistance <= mindplot.model.INodeModel.MAIN_TOPIC_TO_MAIN_TOPIC_DISTANCE / 2 + (targetTopicSize.width / 2)) {
2011-07-27 13:25:10 +02:00
result = true;
}
} else {
2011-09-08 14:54:55 +02:00
if (xDistance <= targetTopicSize.width / 2 && Math.abs(xDistance) <= mindplot.model.INodeModel.MAIN_TOPIC_TO_MAIN_TOPIC_DISTANCE / 2 + (targetTopicSize.width / 2)) {
2011-07-27 13:25:10 +02:00
result = true;
}
2009-06-07 20:59:43 +02:00
}
}
}
2011-07-27 13:25:10 +02:00
} else {
throw "No implemented yet";
2009-06-07 20:59:43 +02:00
}
2011-07-27 13:25:10 +02:00
return result;
},
_isChildNode : function(node) {
var result = false;
if (node == this) {
result = true;
} else {
var children = this.getChildren();
for (var i = 0; i < children.length; i++) {
var child = children[i];
result = child._isChildNode(node);
if (result) {
break;
}
2009-06-07 20:59:43 +02:00
}
}
2011-07-27 13:25:10 +02:00
return result;
},
2009-06-07 20:59:43 +02:00
2011-09-08 14:54:55 +02:00
inspect : function() {
2011-07-27 13:25:10 +02:00
return '(type:' + this.getType() + ' , id: ' + this.getId() + ')';
}
2011-09-08 14:54:55 +02:00
});