/usr/include/tulip/AbstractProperty.h is in libtulip-dev 3.1.2-2.3ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
*/
#ifndef TULIP_PROPERTIESPROXY_H
#define TULIP_PROPERTIESPROXY_H
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "tulip/Observable.h"
#include "tulip/ObservableProperty.h"
#include "tulip/Iterator.h"
#include "tulip/Types.h"
#include "tulip/PropertyAlgorithm.h"
#include "tulip/MutableContainer.h"
#include "tulip/ReturnType.h"
#include "tulip/tulipconf.h"
#include "tulip/TemplateFactory.h"
#include "tulip/Reflect.h"
namespace tlp {
/**
* \defgroup properties
*/
/*@{*/
//=============================================================
class TLP_SCOPE PropertyInterface: public Observable, public ObservableProperty {
public:
virtual ~PropertyInterface();
virtual void erase(const node) =0;
virtual void erase(const edge) =0;
virtual void copy(const node, const node, PropertyInterface *) =0;
virtual void copy(const edge, const edge, PropertyInterface *) =0;
virtual PropertyInterface* clonePrototype(Graph *, std::string) =0;
//=================================================================================
// Returns a string describing the type of the property.
// i.e. "graph", "double", "layout", "string", "integer", "color", "size", ...
virtual std::string getTypename() = 0;
static std::string getTypename( PropertyInterface * );
// Untyped accessors
virtual std::string getNodeDefaultStringValue() = 0;
virtual std::string getEdgeDefaultStringValue() = 0;
virtual std::string getNodeStringValue( const node n ) = 0;
virtual std::string getEdgeStringValue( const edge e ) = 0;
virtual bool setNodeStringValue( const node n, const std::string & v ) = 0;
virtual bool setEdgeStringValue( const edge e, const std::string & v ) = 0;
virtual bool setAllNodeStringValue( const std::string & v ) = 0;
virtual bool setAllEdgeStringValue( const std::string & v ) = 0;
// the ones below are used by GraphUpdatesRecorder
virtual Iterator<node>* getNonDefaultValuatedNodes()=0;
virtual Iterator<edge>* getNonDefaultValuatedEdges()=0;
virtual DataMem* getNodeDefaultDataMemValue() = 0;
virtual DataMem* getEdgeDefaultDataMemValue() = 0;
virtual DataMem* getNodeDataMemValue( const node n ) = 0;
virtual DataMem* getEdgeDataMemValue( const edge e ) = 0;
virtual DataMem* getNonDefaultDataMemValue( const node n ) = 0;
virtual DataMem* getNonDefaultDataMemValue( const edge e ) = 0;
virtual void setNodeDataMemValue( const node n, const DataMem* v) = 0;
virtual void setEdgeDataMemValue( const edge e, const DataMem* v) = 0;
virtual void setAllNodeDataMemValue(const DataMem* v ) = 0;
virtual void setAllEdgeDataMemValue(const DataMem* v ) = 0;
protected:
// redefinitions of ObservableProperty methods
void notifyAfterSetNodeValue(PropertyInterface*,const node n);
void notifyAfterSetEdgeValue(PropertyInterface*,const edge e);
void notifyAfterSetAllNodeValue(PropertyInterface*);
void notifyAfterSetAllEdgeValue(PropertyInterface*);
void notifyDestroy(PropertyInterface*);
};
/**
* This class is used to store a property of a graph.
* A property is a couple of two functions:
* - One from the set of nodes to a set of Tnode value
* - One from the set of edges to a set of Tedge value
*
* A AbstractProperty can be connected or not to a PropertyAlgorithm.
* In the first case it can be seen as buffer beetween the property and the user.
* In the second case it is only a memory area for storing data.
* A AbstractProperty is an observable, so it can be observed by others objects.
*/
template <class Tnode, class Tedge, class TPROPERTY = PropertyAlgorithm >
class TLP_SCOPE AbstractProperty : public PropertyInterface {
friend class GraphView;
public:
static TLP_SCOPE TemplateFactory< PropertyFactory<TPROPERTY>, TPROPERTY, PropertyContext > *factory;
static void initFactory() {
if (!factory) {
factory = new TemplateFactory< PropertyFactory<TPROPERTY>, TPROPERTY, PropertyContext >;
}
}
AbstractProperty(Graph *);
/**
* Returns the node default value of the property proxy
* warnning: If the type is a pointer it can produce big memory
* leak if the user doesn't manage the memory himself
*/
typename Tnode::RealType getNodeDefaultValue();
/**
* Returns the edge default value of the property proxy
* warnning: If the type is a pointer it can produce big memory
* leak if the user doesn't manage the memory himself
*/
typename Tedge::RealType getEdgeDefaultValue();
/**
* Returns the value associated to the node n in this property.
* If the value is already fixed it is done in constant time.
* else if it is a computed property (plug-in), it calls the associated property
* If there is no value and no algorithms it returns the default value
* depending of the type.
*/
typename ReturnType<typename Tnode::RealType>::Value getNodeValue(const node n );
/**
* Returns the value associated to the node n in this property.
* If the value is already fixed it is done in constant time.
* else if it is a computed property (plug-in), it calls the associated property
* If there is no value and no algorithms it returns the default value
* depending of the type.
*/
typename ReturnType<typename Tedge::RealType>::Value getEdgeValue(const edge e);
/**
* Set the value of a node n and notify the observers of a modification.
* Warning : When using computed property (plug-in), if one sets the value of
* a node n, the plug-in won't be call for n.
*/
void setNodeValue(const node n, const typename Tnode::RealType &v);
/**
* Set the value of an edge and notify the observers of a modification.
* Warning : When using computed property (plug-in), if one sets the value of
* a edge e, the plug-in won't be call for e.
*/
void setEdgeValue(const edge e, const typename Tedge::RealType &v);
/**
* Set the value of all nodes and notify the observers
*/
void setAllNodeValue(const typename Tnode::RealType &v);
/**
* Set the value of all edges and notify the observers
*/
void setAllEdgeValue(const typename Tedge::RealType &v);
//=================================================================================
virtual void erase(const node n);
//=================================================================================
virtual void erase(const edge e);
//=================================================================================
// Because of compilation pb on Windows platform (g++ bug ???)
// we include the code of the method below instead of having it
// included in AbstractProperty.cpp
virtual AbstractProperty<Tnode,Tedge,TPROPERTY>& operator =(AbstractProperty<Tnode,Tedge,TPROPERTY> &prop) {
if (this!= &prop) {
//=============================================================
//The backup is necessary, if a proxy is a function which use the value of "*this"
//Future implementation should take into account : recursive or not
//It will enable to presserve the backup cost in a lot of case.
//=============================================================
if (graph == 0) graph = prop.graph;
if (graph == prop.graph) {
setAllNodeValue(prop.getNodeDefaultValue());
setAllEdgeValue(prop.getEdgeDefaultValue());
Iterator<node> *itN = prop.getNonDefaultValuatedNodes();
while (itN->hasNext()) {
node itn = itN->next();
setNodeValue(itn, prop.getNodeValue(itn));
} delete itN;
Iterator<edge> *itE = prop.getNonDefaultValuatedEdges();
while (itE->hasNext()) {
edge ite = itE->next();
setEdgeValue(ite, prop.getEdgeValue(ite));
} delete itE;
} else {
MutableContainer<typename Tnode::RealType> backupNode;
MutableContainer<typename Tedge::RealType> backupEdge;
backupNode.setAll(prop.nodeDefaultValue);
backupEdge.setAll(prop.edgeDefaultValue);
Iterator<node> *itN=graph->getNodes();
while (itN->hasNext()) {
node itn=itN->next();
if (prop.graph->isElement(itn))
backupNode.set(itn.id,prop.getNodeValue(itn));
} delete itN;
Iterator<edge> *itE=graph->getEdges();
while (itE->hasNext()) {
edge ite=itE->next();
if (prop.graph->isElement(ite))
backupEdge.set(ite.id,prop.getEdgeValue(ite));
} delete itE;
//==============================================================*
itN=graph->getNodes();
while (itN->hasNext()) {
node itn=itN->next();
if (prop.graph->isElement(itn))
setNodeValue(itn,backupNode.get(itn.id));
} delete itN;
itE=graph->getEdges();
while (itE->hasNext()) {
edge ite=itE->next();
if (prop.graph->isElement(ite))
setEdgeValue(ite,backupEdge.get(ite.id));
} delete itE;
}
clone_handler(prop);
}
return *this;
}
//=================================================================================
bool compute(const std::string &algorithm, std::string &msg, const PropertyContext&);
//=================================================================================
virtual std::string getTypename();
// Untyped accessors
virtual std::string getNodeDefaultStringValue();
virtual std::string getEdgeDefaultStringValue();
virtual std::string getNodeStringValue( const node n );
virtual std::string getEdgeStringValue( const edge e );
virtual bool setNodeStringValue( const node n, const std::string & v );
virtual bool setEdgeStringValue( const edge e, const std::string & v );
virtual bool setAllNodeStringValue( const std::string & v );
virtual bool setAllEdgeStringValue( const std::string & v );
// returns an iterator on all nodes whose value is different
// from the default value
virtual Iterator<node>* getNonDefaultValuatedNodes();
// returns an iterator on all edges whose value is different
// from the default value
virtual Iterator<edge>* getNonDefaultValuatedEdges();
// for performance reason and use in GraphUpdatesRecorder
virtual DataMem* getNodeDefaultDataMemValue();
virtual DataMem* getEdgeDefaultDataMemValue();
virtual DataMem* getNodeDataMemValue(const node n);
virtual DataMem* getEdgeDataMemValue(const edge e);
virtual DataMem* getNonDefaultDataMemValue( const node n );
virtual DataMem* getNonDefaultDataMemValue( const edge e );
virtual void setNodeDataMemValue( const node n, const DataMem* v);
virtual void setEdgeDataMemValue( const edge e, const DataMem* v);
virtual void setAllNodeDataMemValue(const DataMem* v);
virtual void setAllEdgeDataMemValue(const DataMem* v);
protected:
//=================================================================================
///Enable to clone part of sub_class
virtual void clone_handler(AbstractProperty<Tnode,Tedge,TPROPERTY> &){};
protected:
MutableContainer<typename Tnode::RealType> nodeProperties;
MutableContainer<typename Tedge::RealType> edgeProperties;
Graph *graph;
bool circularCall;
typename Tnode::RealType nodeDefaultValue;
typename Tedge::RealType edgeDefaultValue;
};
/*@}*/
}
#include "./cxx/AbstractProperty.cxx"
#endif
|