00001 /*===========================================================================*\ 00002 * * 00003 * OpenFlipper * 00004 * Copyright (C) 2001-2009 by Computer Graphics Group, RWTH Aachen * 00005 * www.openflipper.org * 00006 * * 00007 *---------------------------------------------------------------------------* 00008 * This file is part of OpenFlipper. * 00009 * * 00010 * OpenFlipper is free software: you can redistribute it and/or modify * 00011 * it under the terms of the GNU Lesser General Public License as * 00012 * published by the Free Software Foundation, either version 3 of * 00013 * the License, or (at your option) any later version with the * 00014 * following exceptions: * 00015 * * 00016 * If other files instantiate templates or use macros * 00017 * or inline functions from this file, or you compile this file and * 00018 * link it with other files to produce an executable, this file does * 00019 * not by itself cause the resulting executable to be covered by the * 00020 * GNU Lesser General Public License. This exception does not however * 00021 * invalidate any other reasons why the executable file might be * 00022 * covered by the GNU Lesser General Public License. * 00023 * * 00024 * OpenFlipper is distributed in the hope that it will be useful, * 00025 * but WITHOUT ANY WARRANTY; without even the implied warranty of * 00026 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * 00027 * GNU Lesser General Public License for more details. * 00028 * * 00029 * You should have received a copy of the GNU LesserGeneral Public * 00030 * License along with OpenFlipper. If not, * 00031 * see <http://www.gnu.org/licenses/>. * 00032 * * 00033 \*===========================================================================*/ 00034 00035 /*===========================================================================*\ 00036 * * 00037 * $Revision: 8520 $ * 00038 * $Author: moebius $ * 00039 * $Date: 2010-02-10 15:56:59 +0100 (Mi, 10. Feb 2010) $ * 00040 * * 00041 \*===========================================================================*/ 00042 00043 00044 00045 00046 //============================================================================= 00047 // 00048 // MyTypes 00049 // 00050 //============================================================================= 00051 00052 #define BASEOBJECTDATA_C 00053 00054 00055 //== INCLUDES ================================================================= 00056 00057 #include "Types.hh" 00058 00059 //== TYPEDEFS ================================================================= 00060 00061 //== CLASS DEFINITION ========================================================= 00062 00063 // =============================================================================== 00064 // Additional Nodes 00065 // =============================================================================== 00066 00067 template< typename NodeT > 00068 bool BaseObjectData::addAdditionalNode(NodeT* _node , QString _pluginName, QString _nodeName , int _id ) 00069 { 00070 if ( hasAdditionalNode(_pluginName,_nodeName,_id) ) { 00071 std::cerr << "Trying to inserted additional node twice in " << _pluginName.toStdString() 00072 << " with Name " << _nodeName.toStdString() << " and id " << _id << std::endl; 00073 return false; 00074 } 00075 00076 QString name = _pluginName+"#"+_nodeName+"#"+QString::number(_id); 00077 00078 std::pair <BaseNode*,QString> newNode(dynamic_cast<BaseNode*>(_node) , name); 00079 additionalNodes_.push_back(newNode); 00080 00081 return true; 00082 } 00083 00084 template< typename NodeT > 00085 bool BaseObjectData::getAdditionalNode(NodeT*& _node , QString _pluginName, QString _nodeName , int _id ) 00086 { 00087 QString searchname = _pluginName + "#" + _nodeName + "#" + QString::number(_id); 00088 00089 for ( uint i =0 ; i < additionalNodes_.size() ; ++i ) { 00090 if ( additionalNodes_[i].second == searchname ) { 00091 _node = dynamic_cast<NodeT*>(additionalNodes_[i].first); 00092 return ( _node != NULL); 00093 } 00094 } 00095 00096 return false; 00097 } 00098 00099 template< typename NodeT > 00100 bool BaseObjectData::removeAdditionalNode(NodeT*& _node, QString _pluginName, QString _nodeName , int _id ) 00101 { 00102 QString searchname = _pluginName + "#" + _nodeName + "#" + QString::number(_id); 00103 00104 for ( uint i =0 ; i < additionalNodes_.size() ; ++i ) { 00105 if ( additionalNodes_[i].second == searchname ) { 00106 _node = dynamic_cast<NodeT*>(additionalNodes_[i].first); 00107 if (_node != NULL) //valid node delete subtree 00108 { 00109 _node->delete_subtree(); 00110 additionalNodes_.erase (additionalNodes_.begin()+i); 00111 } 00112 return true; 00113 } 00114 } 00115 00116 return false; 00117 } 00118 00119 //=============================================================================