 |
Tulip
4.7.0
Better Visualization Through Research
|
|
Tulip
4.7.0
Better Visualization Through Research
|
#include <minmaxproperty.h>
Inheritance diagram for tlp::MinMaxProperty< nodeType, edgeType, propType >: Collaboration diagram for tlp::MinMaxProperty< nodeType, edgeType, propType >:Public Member Functions | |
| MinMaxProperty (tlp::Graph *graph, const std::string &name, typename nodeType::RealType NodeMin, typename nodeType::RealType NodeMax, typename edgeType::RealType EdgeMin, typename edgeType::RealType EdgeMax) | |
| edgeType::RealType | getEdgeMax (Graph *graph=NULL) |
| edgeType::RealType | getEdgeMin (Graph *graph=NULL) |
| nodeType::RealType | getNodeMax (Graph *graph=NULL) |
| nodeType::RealType | getNodeMin (Graph *graph=NULL) |
| virtual void | treatEvent (const tlp::Event &ev) |
| void | updateAllEdgesValues (typename edgeType::RealType newValue) |
| void | updateAllNodesValues (typename nodeType::RealType newValue) |
| template<> | |
| void | updateEdgeValue (tlp::edge e, tlp::LineType::RealType newValue) |
| void | updateEdgeValue (tlp::edge e, typename edgeType::RealType newValue) |
| void | updateNodeValue (tlp::node n, typename nodeType::RealType newValue) |
| Public Member Functions inherited from tlp::AbstractProperty< nodeType, edgeType, propType > | |
| AbstractProperty (Graph *, const std::string &n="") | |
| int | compare (const node n1, const node n2) const |
| int | compare (const edge e1, const edge e2) const |
| virtual void | computeMetaValue (node n, Graph *sg, Graph *mg) |
| virtual void | computeMetaValue (edge e, tlp::Iterator< edge > *itE, Graph *mg) |
| virtual bool | copy (const node destination, const node source, PropertyInterface *property, bool ifNotDefault=false) |
| virtual bool | copy (const edge destination, const edge source, PropertyInterface *property, bool ifNotDefault=false) |
| virtual void | copy (PropertyInterface *property) |
| virtual unsigned int | edgeValueSize () const |
| virtual void | erase (const node n) |
| virtual void | erase (const edge e) |
| virtual DataMem * | getEdgeDataMemValue (const edge e) const |
| virtual DataMem * | getEdgeDefaultDataMemValue () const |
| virtual std::string | getEdgeDefaultStringValue () const |
| virtual edgeType::RealType | getEdgeDefaultValue () const |
| virtual std::string | getEdgeStringValue (const edge e) const |
| virtual tlp::StoredType < typename edgeType::RealType > ::ReturnedConstValue | getEdgeValue (const edge e) const |
| virtual DataMem * | getNodeDataMemValue (const node n) const |
| virtual DataMem * | getNodeDefaultDataMemValue () const |
| virtual std::string | getNodeDefaultStringValue () const |
| virtual nodeType::RealType | getNodeDefaultValue () const |
| virtual std::string | getNodeStringValue (const node n) const |
| virtual tlp::StoredType < typename nodeType::RealType > ::ReturnedConstValue | getNodeValue (const node n) const |
| virtual DataMem * | getNonDefaultDataMemValue (const node n) const |
| virtual DataMem * | getNonDefaultDataMemValue (const edge e) const |
| virtual tlp::Iterator< edge > * | getNonDefaultValuatedEdges (const Graph *g=NULL) const |
| virtual tlp::Iterator< node > * | getNonDefaultValuatedNodes (const Graph *g=NULL) const |
| virtual unsigned int | nodeValueSize () const |
| virtual unsigned int | numberOfNonDefaultValuatedEdges () const |
| virtual unsigned int | numberOfNonDefaultValuatedNodes () const |
| virtual AbstractProperty < nodeType, edgeType, propType > & | operator= (AbstractProperty< nodeType, edgeType, propType > &prop) |
| virtual bool | readEdgeDefaultValue (std::istream &) |
| virtual bool | readEdgeValue (std::istream &, edge) |
| virtual bool | readNodeDefaultValue (std::istream &) |
| virtual bool | readNodeValue (std::istream &, node) |
| virtual void | setAllEdgeDataMemValue (const DataMem *v) |
| virtual bool | setAllEdgeStringValue (const std::string &inV) |
| virtual void | setAllEdgeValue (const typename edgeType::RealType &v) |
| virtual void | setAllNodeDataMemValue (const DataMem *v) |
| virtual bool | setAllNodeStringValue (const std::string &inV) |
| virtual void | setAllNodeValue (const typename nodeType::RealType &v) |
| virtual void | setEdgeDataMemValue (const edge e, const DataMem *v) |
| virtual bool | setEdgeStringValue (const edge inE, const std::string &inV) |
| virtual void | setEdgeValue (const edge e, const typename edgeType::RealType &v) |
| virtual void | setMetaValueCalculator (PropertyInterface::MetaValueCalculator *mvCalc) |
| virtual void | setNodeDataMemValue (const node n, const DataMem *v) |
| virtual bool | setNodeStringValue (const node inN, const std::string &inV) |
| virtual void | setNodeValue (const node n, const typename nodeType::RealType &v) |
| virtual void | writeEdgeDefaultValue (std::ostream &) const |
| virtual void | writeEdgeValue (std::ostream &, edge) const |
| virtual void | writeNodeDefaultValue (std::ostream &) const |
| virtual void | writeNodeValue (std::ostream &, node) const |
Protected Member Functions | |
| MINMAX_MAP (nodeType) minMaxNode | |
| MINMAX_MAP (edgeType) minMaxEdge | |
| MINMAX_PAIR (nodeType) computeMinMaxNode(Graph *graph) | |
| MINMAX_PAIR (edgeType) computeMinMaxEdge(Graph *graph) | |
| void | removeListenersAndClearEdgeMap () |
| void | removeListenersAndClearNodeMap () |
| Protected Member Functions inherited from tlp::AbstractProperty< nodeType, edgeType, propType > | |
| virtual void | clone_handler (AbstractProperty< nodeType, edgeType, propType > &) |
Protected Attributes | |
| edgeType::RealType | _edgeMax |
| edgeType::RealType | _edgeMin |
| nodeType::RealType | _nodeMax |
| nodeType::RealType | _nodeMin |
| bool | needGraphListener |
| Protected Attributes inherited from tlp::AbstractProperty< nodeType, edgeType, propType > | |
| edgeType::RealType | edgeDefaultValue |
|
MutableContainer< typename edgeType::RealType > | edgeProperties |
| nodeType::RealType | nodeDefaultValue |
|
MutableContainer< typename nodeType::RealType > | nodeProperties |
Abstracts the computation of minimal and maximal values on node and edge values of properties.
The value is lazily computed on first request. The value is cached, and the cache is invalidated whenever it cannot be simply updated.
Definition at line 39 of file minmaxproperty.h.
| tlp::MinMaxProperty< nodeType, edgeType, propType >::MinMaxProperty | ( | tlp::Graph * | graph, |
| const std::string & | name, | ||
| typename nodeType::RealType | NodeMin, | ||
| typename nodeType::RealType | NodeMax, | ||
| typename edgeType::RealType | EdgeMin, | ||
| typename edgeType::RealType | EdgeMax | ||
| ) |
Constructs a MinMaxProperty.
| graph | The graph to attach the property to. |
| name | The name of the property. |
| NodeMin | The minimal value the property can take for nodes (e.g. INT_MIN) |
| NodeMax | The maximal value the property can take for nodes (e.g. INT_MIN) |
| EdgeMin | The minimal value the property can take for edges (e.g. INT_MIN) |
| EdgeMax | The maximal value the property can take for edges (e.g. INT_MIN) |
Definition at line 23 of file minmaxproperty.cxx.
| edgeType::RealType tlp::MinMaxProperty< nodeType, edgeType, propType >::getEdgeMax | ( | tlp::Graph * | graph = NULL | ) |
Computes the maximum value on the edges. It is only computed if it has never been retrieved before, or if the cached value could not be updated.
| graph | The graph on which to compute. |
Definition at line 74 of file minmaxproperty.cxx.
Here is the call graph for this function:| edgeType::RealType tlp::MinMaxProperty< nodeType, edgeType, propType >::getEdgeMin | ( | tlp::Graph * | graph = NULL | ) |
Computes the minimum value on the edges. It is only computed if it has never been retrieved before, or if the cached value could not be updated.
| graph | The graph on which to compute. |
Definition at line 59 of file minmaxproperty.cxx.
Here is the call graph for this function:| nodeType::RealType tlp::MinMaxProperty< nodeType, edgeType, propType >::getNodeMax | ( | tlp::Graph * | graph = NULL | ) |
Computes the maximum value on the nodes. It is only computed if it has never been retrieved before, or if the cached value could not be updated.
| graph | The graph on which to compute. |
Definition at line 44 of file minmaxproperty.cxx.
Here is the call graph for this function:| nodeType::RealType tlp::MinMaxProperty< nodeType, edgeType, propType >::getNodeMin | ( | tlp::Graph * | graph = NULL | ) |
Gets the minimum value on the nodes. It is only computed if it has never been retrieved before, or if the cached value could not be updated.
| graph | The graph on which to compute. |
Definition at line 29 of file minmaxproperty.cxx.
Here is the call graph for this function:| void tlp::MinMaxProperty< nodeType, edgeType, propType >::updateAllEdgesValues | ( | typename edgeType::RealType | newValue | ) |
Updates the value of all edges, setting the maximum and minimum values to this. Should be called by subclasses in order to keep the cache up to date.
| newValue | The new maximal and minimal value. |
Definition at line 311 of file minmaxproperty.cxx.
| void tlp::MinMaxProperty< nodeType, edgeType, propType >::updateAllNodesValues | ( | typename nodeType::RealType | newValue | ) |
Updates the value of all nodes, setting the maximum and minimum values to this. Should be called by subclasses in order to keep the cache up to date.
| newValue | The new maximal and minimal value. |
Definition at line 299 of file minmaxproperty.cxx.
| void tlp::MinMaxProperty< nodeType, edgeType, propType >::updateEdgeValue | ( | tlp::edge | e, |
| typename edgeType::RealType | newValue | ||
| ) |
Updates the value on an edge, and updates the minimal/maximal cached values if necessary. Should be called by subclasses in order to keep the cache up to date.
| e | The edge for which the value is updated. |
| newValue | The new value on this edge. |
Definition at line 274 of file minmaxproperty.cxx.
| void tlp::MinMaxProperty< nodeType, edgeType, propType >::updateNodeValue | ( | tlp::node | n, |
| typename nodeType::RealType | newValue | ||
| ) |
Updates the value on a node, and updates the minimal/maximal cached values if necessary. Should be called by subclasses in order to keep the cache up to date.
| n | The node for which the value is updated. |
| newValue | The new value on this node. |
Definition at line 249 of file minmaxproperty.cxx.
1.8.6 
